Abstract: An information handling system includes a set of processing resources and a management resource. The processing resources include a microprocessor and memory accessible to the microprocessor. The management resource is operable to power-up, reset, and power-off the processing resources. The management resource includes a first management module and a redundant second management module. The management resource responds to a single firmware update request by updating firmware on the first management module while maintaining the second management module in a slave mode and, upon successfully updating the firmware on the first management module, updating firmware on the second management module while maintaining the first management module in a passive mode.

Abstract: A compiling system and method for optimizing binary code. The method includes the step of replacing a memory access on a stack area in order to save a value of a register with local variable access. The method further includes: giving a call number to a call instruction and an inlined code in response to an inline expansion of a code to be called by the call instruction; creating a parent-child relationship information for at least one of the call number; processing the memory accesses with an escaped stack pointer as a base address if a stack pointer has escaped; prohibiting a replacement of a prohibited memory access if the stack pointer has escaped; and replacing unprohibited memory access with the local variable access if the stack pointer has escaped.

Abstract: Methods and apparatus are provided for sizing the operating system of a virtual machine. The computer-implemented method includes receiving information representative of an extended application layer and a container, both of which operate at a virtual machine at a host. A determination is made regarding whether one or more aspects of the extended application and the container may be deinstalled by testing at the virtual appliance preconfigured sets of extended application layers and container infrastructure layers, the testing of preconfigured sets performed in order from a smallest preconfigured set having a smallest number of components to a lamest preconfigured set having a lamest number of components. The extended application and the container are implemented without the deinstalled aspects.

Abstract: In one embodiment, accessing a control flow graph (CFG) of a software program written in JavaScript; identifying one or more paths in the CFG; and performing symbolic execution on the software program using the CFG.

Abstract: To allow simplified illustration of the complex technical relationships for a complex software product, provision is made for the structure of the complex software product to be mapped, in at least one embodiment, using an at least three-dimensional system matrix. In this context, the latter is generated by the variables functionality, program components and version level. The complex software product of at least one embodiment is formed by a plurality of functionalities, each functionality being formed by the interaction of a plurality of executable program components associated with it and the program components having one of a plurality of possible version levels. In at least one embodiment, the system matrix is used to check, verify and possibly extend a customer configuration for the software product. At the same time, the matrix is also used to extend the complex software product on the software provider side.

Abstract: A method for attributing revenue for embedded software. The method includes the first step of determining the presence of more than one type of embedded software on a given client site. Then, the process assigns priority based on the length of time each type has resided on the client system and the source of each type, followed by classifying each software type, based on the history of present and predecessor copies of the software. A distribution factor is applied to each software type, based on priority and classification, partner revenue is distributed based on the distribution factor applied to each software type.

Abstract: A system and method for developing web services that includes three frameworks: a Design Time Framework, an Object-Service Framework, and a Run Time Framework. In the Design Time Framework, the system and method includes receiving a schema in a descriptive markup language from a user and generating source code artifacts in an object oriented programming language based on the schema. In the Object-Service Framework, the system and method includes relating the generated source code artifacts to a set of pre-built runtime services. Finally, in a Run Time Framework, the system and method includes providing the set of runtime services, wherein the runtime services interact with the generated source code artifacts through the relationship defined by the Object-Service Framework.

Abstract: A system and method for developing web services that incorporate business rules. The system and method includes three frameworks: a Design Time Framework, an Object-Service Framework, and a Run Time Framework. In the Design Time Framework, the system and method includes receiving a business rule in a descriptive markup language from a user and generating source code artifacts in an object oriented programming language based on the business rule. In the Object-Service Framework, the system and method includes relating the generated source code artifacts to a pre-built Business Rules service. Finally, in the Run Time Framework, the system and method includes providing the Business Rules service, wherein the Business Rules service interacts with the generated source code artifacts through the relationship defined by the Object-Service Framework.

Abstract: A text file is generated by a plurality of users. Comments associated with portions of the text file are inputted utilizing offline computing units. A first and a second location of first and second portions of the text file are automatically obtained. A first review data packet (RDP), and a second RDP are automatically generated. The first and second RDPs consist of one or more comment fields, one or more separators, and one or more effort fields. The comment field consists of comment, author, date, line number, severity, priority, open status, and category. The first and second RDPs are distributed, without the text file, to a third computing unit which utilizes the first and second RDPs to display, respectively, the first comment together with the first portion, and the second comment together with the second portion.

Abstract: A client debugger application or a virtual machine includes a receiving module configured to receive a command packet of a debugging protocol from a computer. The command packet includes an identifier (ID) field. The client debugger application or the virtual machine also includes a parsing module configured to parse an ID from the ID field. One byte of the ID field doubles as a command set value and another byte of the ID field doubles as a command value. The client debugger application or the virtual machine further includes a debugging module configured to use the parsed ID, command set value and command value to perform at least one debugging operation.

Abstract: A system, method, and computer program product that captures performance-characteristic data from the execution of a program and models system performance based on that data. Performance-characterization data based on easily captured reuse distance metrics is targeted. Reuse distance for one memory operation may be measured as the number of memory operations that have been performed since the memory object it accesses was last accessed. Separate call stacks leading up to the same memory operation are identified and statistics are separated for the different call stacks. Methods for efficiently capturing this kind of metrics are described. These data can be refined into easily interpreted performance metrics, such as performance data related to caches with LRU replacement and random replacement strategies in combination with fully associative as well as limited associativity cache organizations. Methods for assessing cache utilization as well as parallel execution are covered.

Abstract: A system for identifying read/write chains in computer software, including a static analysis engine identifying within computer software logical container accesses, a string analyzer configured to at least partly resolve any variables identifying the logical container in any of the accesses by determining a set of potential values of any of the variables, and a Logical Container Access Virtualization component (LCAV) configured to identify the type and scope of any permutations of the accesses, where each of the permutations is defined by substituting any of the potential values for any of the access variables, and identify any read/write chains within the computer software by matching any of the access permutations that read from the logical container with any of the access permutations that write to the logical container if there is an intersection between the scopes of the read and write access permutations.

Abstract: An effective and user-friendly system is disclosed for creating and running a software application for medical imaging, having at least one framework which has a service layer and a superordinate toolkit layer as an application programming interface, wherein functions of the toolkit layer and of the service layer are grouped in each case in a number of components which are arranged strictly hierarchically in such a way that any component can only ever be accessed from a superordinate component.

Abstract: A method for computing a trip count for a loop in advance of the execution of the loop is provided. The method comprises identifying the elements of a loop; returning infinity, if a first index value satisfies a first condition and that a first step size is equal to zero; modifying the first index value and the first step size, if the first index value satisfies the first condition, when the first step size is not equal to zero, and the first step size is greater than half of a first modulus; returning the result computed by applying a formula that divides the difference between a first condition value and the first index value by the first step size and rounds up to a next integer when there is a non-zero remainder; and returning a second trip count for a second loop based on the elements of the first loop.

Abstract: A compiler supporting a language in which selected semantic objects are represented as data objects. The data objects may be used in multiple ways to expand the capabilities of the programming language. Data objects may be passed to applications and used to create executable instructions for that application. In this way, instructions written in the native language of the compiler may be used to control applications that accept programs in a language inconsistent with the native language of the compiler. The syntax checking and variable binding capabilities of the compiler may be used for those instructions that will be executed by an application separate from the object code generated by the compiler. The semantic objects represented as data objects may be selected based on express operations included in the source code or may be based on implicit type conversion.

Abstract: The present invention provides a technique of executing a suitable file from plural files of the same type. In a game apparatus, a ROM medium with game data recorded therein is loaded into a drive device. A patch file acquisition unit acquires a patch file for the game data, and stores the patch file in a HDD. The ROM medium and the patch file respectively include boot files for initiating a main program. An execution processor loads into the memory, the boot file having newer version information, and executes a boot sequence. The execution processor does not execute the boot sequence, when the ROM medium is not loaded into the drive device, and executes the boot sequence, as a condition that the ROM medium is loaded into the drive device.

Abstract: A method, system and program of executing an interpreted programming language application from a server at a designated virtual machine on a client computer are provided. A manifest file is extracted which indicates at least one resource for the interpreted programming language application as well as the repository file associated with the resource. The repository file is located in a web start cache and moved to a run directory accessible by the designated virtual machine, outside the web start cache. The interpreted programming language application is then executed from the run directory using the at least one resource.

Abstract: Tools and techniques are provided to allow partners of analytics providers and others who use web-beacons to submit executable web-beacon plug ins. Analytics providers and others may also write web-beacon plug-ins. Certified plug-ins are executed in response to page loads, visitor clicks, and other visitor and programmatic actions at a website that has been tagged by the analytics provider's web-beacon, without requiring re-tagging of the website with a separate web-beacon for the partner. Web-beacons may invoke core analytics code of an analytics provider, where core analytics code may include multiple plug-ins selected by respective analytics provider partners, where each plug-in may send different analytics data from a website visitor's system to a respective analytics provider partner server. This allows the partner to obtain analytics data by piggybacking on the analytics provider, without re-tagging, and without compromising the availability and accuracy of the analytics data already being gathered.

Abstract: An apparatus and method for detecting program plagiarism through memory access log analysis is provided. A data extractor extracts an access log of an original program and an access log of a target program to be compared with the original program from a memory accessed by the programs. A common string detector enumerates values, which are obtained from the access logs extracted from the original program and the target program, into strings and detects a common string that commonly exists in the strings. A discontinuity calculator calculates a discontinuity value that indicates a distance between the strings by using an array of the detected common strings. A plagiarism determining unit determines that the target program is plagiarized if the calculated discontinuity value is less than a predetermined reference value.

Abstract: Tools and techniques are provided to allow partners of analytics providers and others who use web-beacons to submit web-beacon plug-ins for scrutiny, and for the plug-in to either be refused or else to be certified for use in a core JavaScript file or similar component. Analytics providers and others may also write web-beacon plug-ins. Certified plug-ins are executed in response to page loads, visitor clicks, and other visitor and programmatic actions at a website that has been tagged by the analytics provider's web-beacon, without requiring re-tagging of the website with a separate web-beacon for the partner. This allows the partner to obtain analytics data by piggybacking on the analytics provider, without re-tagging, and without compromising the availability and accuracy of the analytics data already being gathered. To be certified, web-beacon plug-ins must satisfy specific criteria as to their size, behavior, namespace, and the like.