Abstract: A method and apparatus for verifying program code conversion performed by an emulator. A first emulator configured in a same-to-same (X-X) mode converts subject code into target code for execution by a subject processor. Execution of the subject code natively by the subject processor is compared against execution through the first emulator, to verify that program code conversion. Optionally, the first emulator is then used to incrementally validate program code conversion (i.e. optimisation and/or translation) performed by a second emulator, such as a this-to-that (X-Y) mode emulator running on a target processor.

Abstract: The present invention provides for a self-correcting state circuit. A first flip flop is configured to receive a clock input and a first data input, and to generate a first output in response to the clock input and the first data input. A second flip flop is coupled to the first flip flop and configured to receive the clock input and to receive the first output as a second data input, and to generate a second output in response to the clock input and the first output. A first correction circuit is coupled to the second flip flop and configured to generate a corrected output. A third flip flop is coupled to the first correction circuit and configured to receive the clock input and to receive the corrected output as a third data input, and to generate a third output in response to the clock input and the third data input.

Abstract: A computer implemented method, data processing system, and processor are provided for thermal interrupt generation. An interrupt temperature is set to a first temperature and an interrupt direction is to a greater than or equal to determination. A determination is made as to whether a sensed temperature from a digital thermal sensor meets or exceeds the interrupt temperature in response to the interrupt direction. A first interrupt is generated in response to the sensed temperature meeting or exceeding the interrupt temperature.

Abstract: The present invention provides for a system comprising a level shifter configured to receive a first clock signal from a first power domain, to receive a counter signal, to select one of a plurality of intermediate voltages in response to the received counter signal, and to generate a second clock signal in response to the received first clock signal and the selected intermediate voltage. A counter is coupled to the level shifter and configured to receive a divided clock signal and a comparison result signal, and to generate the counter signal in response to the received divided clock signal and comparison result signal. A divider is coupled to the counter and configured to receive the first clock signal and to generate the divided clock signal in response to the received first clock signal. A filter is coupled to the level shifter and configured to receive the second clock signal and to generate a first comparison signal in response to the received second clock signal.

Abstract: Provided is a Web Services Response Template (WSRT) that addresses the problems of efficiency and robustness to change in Web Services response by allowing a requestor to explicitly specify, in a response template what information is to be returned by the request. A requestor of a web service gets just the information it needs; different requestors of the same operation may get different information; and a responder sends the requestor only what is asked for so there is no problem when new information becomes available. WSRTs are specifically designed to allow the type of control needed in program-to-program (P2P) communication, while being very efficiently and simply processed by a web service. Thus, WSRTs address difficulties that arise in typical distributed, P2P communication without adding much overhead or complexity to either a service requester or a service provider.

Abstract: Provided is a JIT compiler that changes the status of run-time determined software routines between being activated and deactivated in an application program. Conditional statements which are used at run-time to determine whether such a routine has been activated or deactivated are presented as discrete conditions that always evaluate to a known result by using an invariant flag in the compiled bytecode. The JIT compiler optimises an application program by excluding discrete condition checks. Consequently, if the branch of the discrete condition that will never execute includes a run-time determined software routine, then the routine will be excluded from the JIT compilation and will not form part of the JIT compiled native machine code. A run-time class or code replacement facility is used as a means of activating or deactivating a run-time determined software routine at run-time by changing the value of the invariant flag of said routine.

Abstract: Provided is a method for providing animation in electronic communications. An image is generated by capturing multiple photographs from a camera or video camera typically fixed in one position. The first photograph is called the “naked photo.” Using a graphics program, photos subsequent to the naked photo are edited to cut an element common to the subsequent photos. The cut images are pasted into the naked photo as layers. The modified naked photo, including the layers, is stored as a web-enabled graphics file, which is then transmitted in conjunction with electronic communication. When the electronic communication is received, the naked photo is displayed and each of the layers is displayed and removed in the order that each was taken with a short delay between photos. In this manner, a movie is generated with much smaller files than is currently possible.

Abstract: Provided is a method for generating an on-demand, custom runtime solution to a user or business's computing needs. A library of software components corresponding to different computing tasks of a business situation is created. Each software component is associated with one or more meta descriptors. Aggregate descriptors are created that define relationships between software components and other software components, software components and aggregate descriptors and between aggregate descriptors. The software components and related meta and aggregate descriptors are managed by means of a software component meta management system (SCMMS). Employing the SCMMS, software components are registered and managed in a hierarchical structure based upon the interrelationships among the software components and the aggregate descriptors. The hierarchical structure is multi-layered, with different layers having different scopes. Users specify the number of levels and how the levels are defined.

Abstract: Provided is a method for programming module load balancing and failover in a distributed computing environment. The Java Management extensions (JMX) specification is enhanced to support load balancing and provide a high-availability of JMX management beans (Mbeans). Also provided are enhancements to the programming model and infrastructure to support the enhanced programming model. Two exemplary approaches for load balancing and failover are provided, one based both upon clustered Mbeans and one based upon unclustered Mbeans. In the unclustered approach, client affinity is supported in that a request from a particular client can be routed to a particular Mbean. In the clustered approach, a specific Mbean can be invoked by providing a special parameter in the Mbean invocation or by adding a special property to the specific Mbean's ObjectName to indicate that during runtime automatic routing should not be employed.

Abstract: Provided is a method for enabling a device without a secure clock to make a determination on the expiration of encrypted content. When the device receives content, the device also receives the content provider's policy on access. This information provides an ATI in UTI units which is to be associated with the content for the purpose of managing the content's expiration. The ATI is converted to the device's DTI units and the DTI is then used to control the availability of the content for decryption and use. The claimed subject matter permits the existence of tolerance, determined by content policy, in the conversion between UTI and the DTI, as well as in the depletion of the ATI. To move or copy content which has an associated remaining ATI, the device converts the ATI into UTI units and provides converted ATI to the target device in conjunction with the associated content.

Abstract: A system and method are disclosed whereby a list-based control (e.g., a Listbox or Choice control) in a graphical user interface may share a single copy of a list with the peer component of the control in the application program interface (API) used to display the control. This overcomes a problem in legacy Java applications, based on the abstract windowing toolkit API, wherein the peer component creates a copy of the list when the corresponding list-based control is displayed. In contrast, peer components within the Swing API reference the original version of the list associated with the control, avoiding this redundancy. According to the system and method disclosed herein, an enhanced version of Swing can be used with legacy application programs, allowing them to benefit from this feature of Swing. No modification of the legacy code is necessary. This extension to Swing is referred to herein as AWTSwing.

Abstract: Provided is a method for generating an on-demand, custom runtime solution to a user or business's computing needs. A library of software components corresponding to different computing tasks of a business situation is created. Each software component is associated with one or more meta descriptors. The software components and related meta descriptors are managed by means of a software component meta management system (SCMMS). Based upon customer, input, various components are selected, or filtered, for incorporation into a business runtime solution. In addition to the user input, user queries are feedback into the SCMMS so that the SCMMS accumulates knowledge about the customer's usage. The knowledge is then employed to facilitate and improve the generation of future runtime solutions for both the customer and other customers.

Abstract: Provided is a method for generating and updating screenshots within computer software documentation. The disclosed techniques enable software documentation to insert up-to-date screenshots either upon installation of the corresponding software, dynamically when the documentation is used, or in some combination of the two approaches. In one embodiment, the computing system or application detects when screenshots have been modified and regenerates screenshots within affected documentation. Documentation is created that includes text and macros. The macros provide for the inclusion of screenshots within the documentation. Each macro includes information about where an associated screenshot is to be captured, the steps necessary to capture the screenshot and the location within the documentation where the screenshot is displayed. Also included in association with the macros is configuration information necessary to generate the appropriate screenshot.

Abstract: Provided is a method for generating an on-demand, custom runtime solution to a user or business's computing needs A library of software components corresponding to different computing tasks of a business situation is created. Each software component is associated with one or more meta descriptors. The software components and related meta descriptors are managed by means of a software component meta management system (SCMMS). Meta descriptors are self adaptive in a manner that reflects real use scenarios. Meta descriptors describe both static and dynamic attributes of components.

Abstract: A first data processing system, which includes a first cryptographic device, is communicatively coupled with a second data processing system, which includes a second cryptographic device. The cryptographic devices then mutually authenticate themselves. The first cryptographic device stores a private key of a first asymmetric cryptographic key pair and a public key of a second asymmetric cryptographic key pair that is associated with the second data processing system. The second cryptographic device stores a private key of the second asymmetric cryptographic key pair and a public key of the first asymmetric cryptographic key pair that is associated with the first data processing system.

Abstract: A computer Implemented method of automatically removing space characters from data being entered into a database system are provided. When a user creates a table in a database system into which data having leading and/or trailing character spaces may be entered, the user may specifically instruct the database system to remove any character spaces before entering the data into the table. Consequently, when a piece of data is being entered into the table, the database system will determine whether the piece of data includes leading and/or trailing character spaces. If so, the database system will automatically remove the character spaces from the piece of data before it is entered into the table. Hence, the use of TRIM functions when retrieving data from the database system will be obviated.

Abstract: There is disclosed a method for flattening hierarchically structured flows using a breadth-first approach. At each level of hierarchy of a hierarchically structured source flow, complex nodes are flattened by one level across the entire breadth of the flow. The results of this flattening are placed in a target flow, and any connections that existed in the source flow are re-established in the target flow in such a way that any data input into the target flow will be processed as if it had been input into the source flow. After a processing iteration, if there are still complex nodes remaining in the target flow, the target flow becomes the next source flow, and the process is repeated until the flow has been completely flattened.

Abstract: For use in an integrated development environment, such as Eclipse, a common connection registry of connections to remote systems is presented. The connection registry contains objects and subsystem objects. The connection objects have attribute information for the remote system whereas the subsystem objects contain information specific to a particular tool and connection. The framework further presents a common user interface by which tools can be registered within a connection, or by which a new connection can be created. The common user interface presents application program interfaces by which connection objects and subsystem objects can be created, retrieved, maintained, updated, modified, stored in the registry, and/or deleted, etc. The framework is capable of maintaining connections and tools within an integrated development environment independent of the type and/or operating system of the remote systems, the programming language of the tools, etc.

Abstract: The present invention provides a system and method of maintaining state information on a client. In response to a client request for a file located on a server, the file is transmitted from the server to the client. An unmodifiable cookie which specifies state information from the server is also transmitted to the client. The client then stores the unmodifiable cookie. A user is unable to alter the unmodifiable cookie on the client machine.

Abstract: There is disclosed a method and system for configuring a data dependency graph (DDG) to handle instruction scheduling in computer architectures permitting dynamic by-pass execution, and for performing dynamic by-pass scheduling utilizing such a configured DDG. In accordance with an embodiment of the invention, a heuristic function is used to obtain a ranking of nodes in the DDG after setting delays at all identified by-pass pairs of nodes in the DDG to 0. From among a list of identified by-pass pairs of nodes, a node that is identified as being the least important to schedule early is marked as “bonded” to its successor, and the corresponding delay for that identified node is set to 0. Node rankings are re-computed and the bonded by-pass pair of nodes are scheduled in consecutive execution cycles with a delay of 0 to increase the likelihood that a by-pass can be successfully taken during run-time execution.