Abstract: In a system and method for providing a television broadcast that displays different content for different viewers, a pool of content items, or particular items from a pool of content items, is integrated with a signal for a television program. The combined signal is transmitted or broadcast in any suitable way, such as by satellite, antenna, cable, or the like. Once the combined signal has been transmitted, or while the signal is being transmitted, different items from the pool of content items are displayed to different viewers. The items may be displayed to viewers during a broadcast of a pre-recorded television program. Rules may be integrated into the combined signal governing how and when items from the pool of content items are displayed. The rules may also govern which items from the pool of content items are displayed. A return channel may be provided so that a viewer may communicate to a content provider.

Abstract: Embodiments of systems, methods, and computer program products may facilitate translation of machine code associated with a first processor for execution on a second processor. Machine code associated with a first processor may be translated into a translated program that includes one or more translation instructions for execution on the second processor. The one or more translation instructions are used exclusively to translate machine code that is associated with a processor other than the second processor. The translated program may be stored in a storage medium where it may be executed using the second processor. Each translation instruction that involves access of the storage medium may be dispatched to one or more translation load-store units that are dedicated exclusively to processing the translation instructions.

Abstract: Small, optimized sequences of binary 5-tuples, representing filter rules, which achieve space efficient packet filtering. A post-match procedure table allows dynamic and extensible packet processing. Packet filtering is accomplished by processing filter rule statements and procedure statements, entered by a user in a rules file, to generate 5-tuple filtering rules and a procedure table, and loading the filtering rules and procedure table into the filter interpreter. A filter interpreter then applies the resolved filtering rules for each packet received at the network adapter. When a filtered packet matches a rule, a specified function is invoked.

Abstract: A software development system is described in which lattice theory is used to model the compatibility and desirability in the target execution environment of various build option parameters selected by a user. A library selector is formed by combining the build option parameters of each source code entity to produce a selector having the maximum level of execution environment requirements needed among the group of source code entities being compiled. This library selector may be used to select a particular library of machine code entities compatible with these execution environment requirements whilst providing the most desirable machine code entities to exploit the capabilities of the target data processing system.

Abstract: A method for interfacing with an enterprise resource planning system is provided. The method includes providing a file containing data to be loaded into the enterprise planning system (the “data file”). A file containing at least one parameter (the “parameter file”) is created. The parameter file maps data from the data file to screens of the enterprise resource planning system. Each record in the data file is processed according to the parameters in the parameter file to execute screens of the enterprise resource planning system so as to provide the data from the data file to the enterprise resource planning system.

Abstract: A threaded interpreter executes a program having a series of program instructions stored in a memory. For the execution of a program instruction the threaded interpreter includes a preparatory unit for executing a plurality of preparatory steps making th program instruction available in the threaded interpreter, and an execution unit with one or more machine instructions emulating the program instruction. The threaded interpreter is designed such that during the execution on an instruction-level parallel processor of the series of program instructions. Machine instructions implement a first one of the preparatory steps for execution in parallel with machine instructions implementing a second one of the preparatory steps for respective ones of the series of program instructions.

Abstract: Application configurations, including applications themselves, application components, and modules associated with the application are installed on an application-server machine and stored in system-determined locations. These locations, or absolute paths, are then stored in a “loose configuration”. As new versions of applications, components, and/or modules are installed, they are placed in unique locations and given unique version numbers. A record of each application configuration version is stored and is referred to as “snapshots”. These snapshots provide a record of and pointers to the various elements that make up the various application configuration versions, so that at any time, a current version of an application configuration can be “rolled back” to a previous version of an application configuration. The methodology can be utilized to provide a self-healing configuration, whereby a faulty version of an application configuration can be rolled back to a previous version automatically.

Abstract: A middleware schema for describing message transactions is provided, including a structured framework of commands and attributes to be employed by technical personnel in order to develop messages that comply with a target API. The invention applies the middleware schema to interpret the functionality of a source document, and generates high level program source code that formats data messages to comply with a target API.

Abstract: To provide a method for enabling a trace of a stack even without the base pointer. When compiling a subroutine, a stack pointer (SP) change table is created and registered with a subroutine together with an initial frame size, the table recording a pair of an address of a code and the amount of change in the stack pointer from the initial frame size, the code causing an address of the stack pointer to be changed, and a thread is caused to pause at a stack tracing time to calculate the be address of the frame from an address of the initial frame, an execution restarting address in this frame and the SP change table registered with a subroutine corresponding to this address and the initial frame size, and thus a trace of a stack is performed.

Abstract: Methods for managing the distribution of client bits to client computers are disclosed. The methods of the present invention are particularly suited for use in a network environment in which one or more clients are networked with at least one server via a communications network. The communications network can be a LAN, WAN, intranet, or the Internet. The client version of one or more selected applications software components (the “managed components”) is determined on the client computer. The client queries the server to determine the most current version of each of the managed components. If the client version is not the most current version, or if the client version is missing on the client computer, a determination is made whether to download the most current version onto the client. If the determination is made to install or upgrade one or more managed components, the most current version of each of the selected managed components is downloaded onto the client computer.

Abstract: A first system for analysis of a portion of a partial state space includes a representation component and an analysis component. The portion of the partial state space is related to a part of a second system. The representation component of the first system employs a value in the portion of the partial state space to represent that information for the part of the second system is unknown. The analysis component of the first system employs the value in the portion of the partial state space to analyze, in response to an analysis question that is related to the part of the second system, the portion of the partial state space.

Abstract: Portions of code containing critical code routines are identified and labeled, then compiled into Dynamic Link Libraries (“DLLs”) and linked such that the critical code routines are optimally loaded into a reserved address space in the DLL memory space. If supported, cache locking may be enabled for the reserved address space. The portions of source code containing portions of critical code for which execution performance is to be improved are labeled, and the source code is scanned prior to compilation to locate the labeled portions of critical code. A linker is configured to store all the labeled portions of critical code into an Executable and Linking Format (“ELF”) section header, which is relocated at run-time into a memory space reserved for the portions of critical code.

Abstract: A multi-user domain is implemented in a compound document framework to collaboratively modify a compound document in accordance with a concurrency model. A server hosts a multi-user domain in which a plurality of clients participate. The multi-user domain includes a compound document having a shared container part and at least one shared content part. Each participating client can use its own part editors to modify the document. Modification information is sent to the server, which updates the shared document to other clients in accordance with a concurrency model.

Abstract: Disclosed is a method and apparatus for detecting and monitoring program hot spots during execution that may be implemented in hardware. A hot spot detector tracks branch instructions which are retired. Frequently executed branch instruction addresses within a particular interval are designated as hot spot candidates. A hot spot detection counter is used to track non-hot spot branches and hot spot candidate branches. When hot spot candidate branches are frequently encountered compared to non-hot spot candidate branches, the hot spot detector may notify the operating system and hot spot candidate branch addresses may be supplied to a runtime optimizing compiler and a monitor table or a hot spot monitor. The hot spot monitor may disable the hot spot detector when a program is operating in known hot spots and may enable the hot spot detector if the program has strayed from known hot spots.

Abstract: A method for memory management in execution of a program by a computer having a memory includes identifying in the program an array of array elements. At a given point in the program, a range of the elements is determined within the array such that none of the elements in the array outside the range is alive at the point. Information regarding the determined range is passed to a memory management function, so that memory locations are associated with the array elements, responsive to the determined range.

Abstract: A method and apparatus for packaging and distributing software. Embodiments of the invention comprise a software packaging system that is portable across many platforms. Each package is self-contained in form of a single-file entity that comprises a payload file and a control file. The payload file is an archive file that contains a compressed collection of all the software files that are required for installation of the software package. The control file includes the necessary information for installation of the files contained in the payload file, in addition to other descriptive information used to determine the size, type, location of storage, and other useful attributes of a software package, even before it is installed on a system. Security measures have been implemented in the system to detect a package the contents of which have been tampered with. Embodiments of the invention can be utilized to install packaged software that is accessible via the Internet.

Abstract: A method of developing a computer system includes entering information relevant to the system under development, retrieving engineering information that pertains to it's development, then browsing through the engineering information thus retrieved. The information relevant to the system under development relates to its configuration, development processes, or the roles of the developers in its development, etc. The information also can include data that helps identify a plurality of products that make up the system under development. The method is performed using an engineering information management system including an engineering information storage unit, in which engineering information about the computer system under development is stored in association with information about it's development.

Abstract: A technology to automatically generate a command line that has values for undefined variables in the script appended as arguments to the name of the script. This technology is intended for an unsophisticated user that is unlikely to remember or know the undefined variables within a script and/or the format and order that the values for the variables must be presented as arguments appended to the name of the script. The technology will determine the undefined variables within the script and prompt the user to supply values for the variables, then the technology will automatically generate the command line on behalf of the user and provide it to a corresponding scripting-language interpreter.

Abstract: The present invention eliminates redundant array range checks. A two-phased check is performed, namely a wide range check is performed by combining a plurality of array range checks, and a strict range check is unsuccessful, so as to reduce the number of range checks at execution time and allow execution at high speed. For instance, it is possible with a processor such as PowerPC, by using a flag, to invalidate a code for performing an array range check at high speed without increasing a code size. Consequently, the number of array range checks to be executed can be reduced so as to allow execution at high speed. Also, for instance, a plurality of array range checks can be combined without considering existence of instructions which cause a side effect. Consequently, the number of array range checks to be executed can be reduced so as to allow execution at high speed.

Abstract: A method, system, apparatus, and computer program product is presented for improving the execution performance of an application in a data processing system. Instrumentation code is inserted into an application in which the instrumentation code generates trace data for method entry events and method exit events when the instrumented application is executed. The trace output data that is generated by the instrumentation code is then analyzed to detect patterns which indicate an inefficient coding construct in the application. The source code for the inefficient coding construct in the application associated with the detected pattern may be modified according to indications provided to an application developer. For example, a specific inefficient coding construct may be an inefficient use of a cross-language boundary, such as the interface between Java code and native code, in which data is inefficiently transferred across the interface through a local array in the native code.