Abstract: A method is provided for translating a source operation to a target operation. The source operation acts on one or more source operands, each comprising a binary integer of a first bit-width. The target operation is required to be evaluated by a processor, such as a computer, which performs integer operations on binary integers of a second bit-width which is greater than first bit-width. The source operation is translated to a target operation having at least one target operand. The method identifies whether the value of unused bits of the or each target operand affects the value of the target operation and whether the target operand or any of the target operands is capable of having one or more unused bits of inappropriate value. If so, a correcting operation is added to the target operation for correcting the value of each of the bits of inappropriate value before performing the target operation.

Abstract: Method and apparatus for analysis of executable program code. The executable program includes segments of code that correspond to callable functions in the source code from which the executable code was generated. Compiler-generated checkpoint descriptors are included in the executable and include pairs of entry points and endpoints. Each pair of entry points and endpoints is associated with a callable function in the source code. The pairs of entry points and endpoints are read from the executable program code and used to generate analysis data for the associated functions. In other embodiments, pairs of entry points and endpoints are additionally assembled from dynamic load modules and symbol tables.

Abstract: A method for processing program files by formatting the program file information for storage in permanent memory in a device memory, allowing later additions without requiring storage in dynamic memory. A mapping mechanism is used to allow references to previously processed files. In one embodiment, the mapping mechanism is a link file. The original preprocessing is typically done during manufacture and stores the programming for basic functionality in a device. Later user-specific functions are added by using the mapping mechanism and preprocessing just the use-specific code. Multiple program file units may be added to the application, where the application device either includes the preprocessing tool or has access to it from a desktop or other application. The preprocessing tool may be implemented in software or hardware, and may be resident on the application device or used via a desktop application.

Abstract: A compiler component for the generation of an optimal instruction sequence, the sequence including a compile-time unresolved reference to be resolved at runtime. The compiler generating a snippet list with entries corresponding to snippets defined for instructions including unresolved compile-time references. A runtime helper routine being defined for resolving references at runtime. For each instruction with an unresolved reference, generating a snippet including data for identifying the reference and for permitting resolution of the reference at runtime by the runtime helper routine. The snippet also including a copy of the instruction containing the unresolved reference. The location in the compiled code for the unresolved instruction being written with a call instruction to the snippet. The runtime helper being invoked by the snippet at runtime to resolve the references and to copy the unresolved code copy to the compiled code, with the references resolved.

Abstract: A computer system, a computer product and a method in which static storage within an environment comprising a plurality of compilation modules is managed such that compiled cloned copies of called externally resolved (with respect to a compilation unit) items are preferentially executed in favor of the corresponding externally resolved item based on a favorable comparison of version information of version information prior to execution. In one embodiment, JAVA® programming language methods are processed within the context a modified framework.

Abstract: A manufacturer installs software by first partitioning storage media of the computing system into a first partition and a second partition. The manufacturer installs software bundles Into the second partition. Each software bundle is stored in form as an image. The manufacturer also installs bootable software and a user interface into the first partition. The bootable software and the user interface when run, operate to receive from a user a selection as to which of the software bundles to install in the computing system. The software bundle selected by the user is installed into the first partition while overwriting the bootable software and the user interface. After installation of the software bundle selected by the user, the bootable software, for example, can erase the installation software bundles in the second partition. This is done, for example, by overwriting the second partition with a blank file system.

Abstract: A linker and a method of linking object code modules using the linker is described in which a mechanism is defined for defining and passing relocations, termed compound relocations, in the object files, the compound relocations being expandable by the linker into a sequence of relocations all at the same offset. Each compound relocation has a type field denoting a compound relocation type indicator and an offset field indicating the offset where the compound relocation is to be expanded. The method comprises reading a compound relocation, recalling a predefined sequence of relocations, and executing the predefined sequence at the same location as the compound relocation. By defining compound relocations for frequently performed calculations object file bloat can be avoided, as the same sequences are not repeatedly written in the object code files.

Abstract: A method of implementing a two-dimensional Inverse Discrete Cosine Transform on a block of input data. The method includes 1) generating a performance array for the columns of the input data; 2) performing a column-wise IDCT upon the input data, the IDCT performed in accordance with cases given for each of the columns by the performance array; (3) generating a row performance offset for rows of the input data; and 4) performing a row-wise IDCT upon the result data from the performing of the column-wise IDCT.

Abstract: An apparatus capable of obtaining a result which is desired by an operator, canceling a result when an erroneous operation is performed and facilitating creation of a mathematical expression is provided. This apparatus comprises an indicating mechanism for outputting a position in a mathematical expression and a part in a mathematical expression in accordance with an operation of the operator; an operating mechanism for generating a plurality of proposed transformation results of the mathematical expressions based on the position and the part outputted from the indicating mechanism, and a selecting mechanism for selecting one from a plurality of the proposed transformation results in accordance with an operation of the operator.

Abstract: The present invention teaches a source-level debugger that defines symbol tables with a grammar. A grammar interface component is used by the compiler to automate portions of the debugger to construct and write the symbol table in a grammar thus simplifying the compiler. The grammar interface component is used by the debugger during execution of the target to read and decode the symbol table, thus simplifying the debugger. Using a grammar to specify the symbol table also documents the symbol table concisely and emphasizes that symbol tables are data structures, not file formats. Many of the pitfalls of working with low-level file formats can be avoided by focusing instead on grammar-based high-level data structures and automating the implementation details. Management of breakpoints is divided by splitting the nub into a client nub that is local to the target, a server nub that is local to the debugger.

Abstract: A method and system are provided for providing an open and extensible object definition framework that manages business object definitions as specifications. This framework may be used to dynamically define any object that is to be processed by a computer. Objects can include Properties, Classifications, Knowledge, Business Objects, and Business Rules to name a few. Some examples of typical Business Objects include: business and social entities; locations, including spaces, places and channels; activities, including events and processes; items, including products and services; and business records, including orders and other forms of demand, inventory, jobs, deliverables, statements, transaction history et. al. The method and system may be used to define any object that is to be processed by a computer. Objects can include Properties, Classifications, Knowledge, Business Objects, and Business Rules to name a few.

Abstract: A method for licensing codecs in accordance with the invention includes initiating a call from a first endpoint, the first endpoint identifying a preferred codec, receiving the call at a second endpoint wherein a licensed copy of the preferred codec is not included, and generating a codec license request from the second endpoint to the first endpoint and/or at least one third party codec provider.

Abstract: A process-driven object management system for managing data and code modules is disclosed. The object management system includes a repository that stores objects, wherein ones of the objects referred to as “Asset elements” each describe a respective code or data module. The object management system includes a set of scripted tools for performing renovation, transformation, and code development tasks on the code and data modules. According to one aspect of the invention, the tool invocation constructs are stored as objects in the repository, such that some of the same object management tools and automated repository interface functions used to manage the Asset element can also be used to manage and veiw the tool objects.

Abstract: A system is disclosed that provides a goal based learning system utilizing a rule based expert training system to provide a cognitive educational experience. The system provides the user with a simulated environment that presents a business opportunity to understand and solve optimally. Mistakes are noted and remedial educational material presented dynamically to build the necessary skills that a user requires for success in the business endeavor. The system utilizes an artificial intelligence engine driving individualized and dynamic feedback with synchronized video and graphics used to simulate real-world environment and interactions. Multiple “correct” answers are integrated into the learning system to allow individualized learning experiences in which navigation through the system is at a pace controlled by the learner.

Abstract: A static object system is provided to allow for code for implementing a run-time environment to be automatically generated that is compatible with a high-order systems programming language such as C. In particular, the meta-object system is static, object-oriented, and uses generic functions that can dispatch to an appropriate member function based on the types of one or more arguments. In one embodiment, the generated dispatch code uses a multi-way conditional branch.

Abstract: According to one embodiment, a method of automatically assigning a ranking value to a plurality of received messages is disclosed. Each of the received messages provides information about a computer program. The method includes receiving a first message, storing the first message in the database and initializing the first message. Further, it is determined whether the first message is to be disqualified. If it is determined that the first message is to be disqualified, the first message is disqualified. If it is determined that the first message is not to be disqualified, a ranking value is automatically assigning to the first message based upon a predetermined set of criteria.

Abstract: This game machine system includes a set top box 51 as a receiving unit for receiving digital data distributed using a broadcast system or a communication system. In a game dedicated device 52, starting of a game software item is inhibited until a software start enable signal is received by the receiving unit. Next to the software start enable signal, data for substitution or insertion for data of part of the game software is sent. This data can be commercial ads. The game dedicated machine 52 can judge whether or not the commercial ads have been introduced into and are in operation in the game software and, if the commercial ads are not in the game software, the game dedicated machine 52 can be made so as to be out of operation.

Abstract: A system for performing dependent interval subtraction, wherein a first interval is subtracted from a third interval to produce a resulting interval, given knowledge that the third interval is the sum of the first interval and a second interval. If the left endpoint of the third interval is negative infinity, the left endpoint of the resulting interval becomes negative infinity. Otherwise, the left endpoint of the resulting interval is computed by subtracting a left endpoint of the first interval from a left endpoint of the third interval, rounded down to a nearest floating-point number. Similarly, if the right endpoint of the third interval is positive infinity, the right endpoint of the resulting interval becomes positive infinity. Otherwise, the right endpoint of the resulting interval is computed by subtracting a right endpoint of the first interval from a right endpoint of the third interval, rounded up to a nearest floating-point number.

Abstract: An automated computer-implemented method for generating an audit record of a computer program while the computer program is executing. The computer program has a source program comprising a plurality of source statements written in a predetermined source language. The method includes the steps of: selecting one or more audit options, each audit option being defined by one or more field names; examining each one of the source statements for the presence of one or more of the field names; creating an audit statement in the source language of the computer program corresponding to each one of the source statements in which one or more of the field names is present; and inserting each created audit statement into the source program proximate to the corresponding source statement to form an expanded source program.

Abstract: A computer system including a plurality of computers, a management console operated by the operator to install a program in the computers and a storage subsystem coupled to the computers and the management console is disclosed. The storage subsystem includes a first storage unit shared by the computers and a plurality of second storage units exclusively used by the computers respectively. The first storage unit has stored therein a file related to the program installed in the computers and an installer program for executing the work of installing a program. The second storage units have each stored therein an install agent executed by each computer and a control file accessed by the install agent. The management console includes an install manager for starting the execution of the install agent on each computer. The install manager starts the process according to the install agent on each computer by switching on the power supply of each computer.