Abstract: A method, apparatus and computer-usable medium for testing error handling code. The method includes selecting a method signature to be error tested; selecting an error associated with the method signature from a menu; generating an aspect to be used in a pointcut for an exception that is to be thrown for the selected error; invoking code that generates the selected error; and identifying resultant errors caused by a selected component of the selected error.

Abstract: Under the present invention, a test configuration is provided. The test configuration sets forth a particular enterprise computer architecture of nodes, servers and resources, as well as a quantity of components/beans for an application. Thereafter, the application is generated using a template to replicate the provided quantity of components/beans, and is deployed, installed and started on the application server(s). After the application is started, a client program generated based on the test configuration is run against the application. Throughout the process, (e.g., as the application is being deployed, installed and started, and while the client program is being run), certain performance metrics are monitored to determine the scalability of the application server(s).

Abstract: A method and system for monitoring calls being made from a cellular phone and preventing calls being made to unauthorized numbers, as defined by the owner of the cellular phone. A security challenge is issued to a cell phone user when a suspicious, previously unknown telephone number is attempted to be called. Approved/safe numbers and/or area codes are stored within the phone and/or in a subscriber's account accessible and updated via the Internet. If the user is unable to provide the correct security code in response to the challenge, the user is prevented from making the call to the particular number.

Abstract: A method, apparatus, and computer instructions for defining queries in terms of data objects. A simplified query syntax is introduced for querying across a set of data objects which does not require the duplication of data object shape information. A data object is first defined by providing a name for the data object. Attribute and relationship information is added to the data object, wherein the information defines the shape of the data object. When a query is created, it is defined in terms of data objects. The query is processed, wherein processing the query includes extracting the shape of the data objects using the attribute information in the query. The query is expanded by adding additional syntax to the query based on relationship information defined for the data objects and then executed in its expanded form.

Abstract: A computer implemented method, apparatus, and computer usable program code for determining aggregate values of health data items from heterogeneously coded databases containing heterogeneously coded medical data. The data, in heterogeneous databases, is queried using a series of semantic layers including i) cascaded asymmetric association tables and ii) semantic search. The heterogeneously coded medical data items are translated into conformal dimensions and denominator files of combinations of disease data are derived. The denominator files of combinations of disease are aggregated based on a mapping of the coded medical and demographic conditions. The data is stored in a target data repository.

Abstract: A system and method of improved task switching in a data processing system. First, a first-level cache memory casts out an invalidated page table entry and an associated first page directory base address to a second-level cache memory. Then, the second-level cache memory determines if a task switch has occurred. If a task switch has not occurred, first-level cache memory sends the invalidated page table entry to a current running task directory. If a task switch has occurred, first-level cache memory loads from the second-level cache directory a collection of page table entries related to a new task to enable improved task switching without requiring access to a page table stored in main memory to retrieve the collection of page table entries.

Abstract: A method of reversing a plurality of erroneous invoices proffered by a plurality of vendors/suppliers. The method comprises providing a master database for inputting a plurality of vendor invoices, storing a cancellation request for each of the plurality of erroneous invoices in a response database, executing an agent to extract data pertaining to the cancellation request stored for each of the plurality of erroneous invoices from the response database, creating an intermediate file containing data extracted from the response database, executing a delivery component for adding a header record and trailer record to the intermediate file, and for renaming the intermediate file, and executing a bridge program for delivering the intermediate file from the response database into the master database and processing the intermediate file in the master database in order to reverse each of the plurality of erroneous invoices in the master database.

Abstract: A method and apparatus for generating a service data object based service pattern for an EJB model is provided. Definitions of session bean façade, SDOs, and queries are defined in entity beans. When the definitions are processed, SDOs, related SDOs, and queries for SDOs are added to the session bean façade. At run time, a client may manipulate the SDOs and apply changes to the SDOs via a mediator obtained from a mediator cache. The mediator persists the SDOs to a data graph without interfering the entity bean.

Abstract: Folders of data from disparate application programs are organized in conformity to a reference taxonomy. A reference taxonomy for representing an organization of stored data found in multiple disparate application programs is created. Each application taxonomy from the multiple disparate application programs is compared to the reference taxonomy by a user. If the user decides to use the reference taxonomy, then the reference taxonomy replaces the application taxonomy for each of the multiple disparate application programs.

Abstract: Techniques for processing events in a self-healing system. In one embodiment, the system receives system events, one or more of which may indicate a possible fault condition in the system. A hierarchal rule structure is used to generate a correlated event set. A determining operation determines at least one corrective action to be performed in response to the correlated event set. A deactivating operation deactivates all correlation rules within the hierarchal rule structure that are only used to generate the correlated event set. Repeated instances of the same fault condition are prevented from being processed by the self-healing system.

Abstract: A system, method, and computer program product for reporting and recovering from an internal processor error in a multiprocessor system supporting system management mode. In accordance with the method of the present invention one or more replacement agents are allocated such as during system startup within the multiprocessor system. Machine specific error-reporting registers are monitored for one or more active processor agents during system operation. In response to detecting a faulty agent via the monitoring, a system management interrupt (SMI) request is issued to one or both the faulty agent and a selected replacement agent. In response to receiving the SMI request, the operating state of the faulty agent is copied to the selected replacement agent in system management mode. Operating system processing is then resumed using the replacement agent.

Abstract: A computer system is used to run one or more programs. It includes a memory having at least a first heap and a second heap in which objects are stored, with a first object being stored on the first heap. A write barrier is provided for detecting that said the first object has been updated by a program to include a first reference to a memory location in the second heap.

Abstract: A solution for comparing topologies is provided. In an embodiment of the invention, a set of differences between the nodes and/or connectors of two or more topologies is obtained. Each difference can comprise a missing node/connector and/or a difference in an item/relationship attribute. A user interface is generated that displays one or more of the differences by displaying a subset of each topology that corresponds to the difference. In an embodiment of the invention, a user interface for comparing topologies is provided that displays each subset in a unique display area and enables a user to select the difference(s) and/or limit the difference(s) that can be selected based on the type of difference.

Abstract: Routing data packet traffic in packet networks, expediting the flow of the data packets and reducing the effects of congestion at nodes is accomplished by capturing latency data for nodes for initial measurement times; and computing a least squares estimate of the delay as a recursive least-squares solution.

Abstract: An apparatus for deferred handling of a message in a publish/subscribe system comprises a publisher for publishing the message and a subscriber for receiving the message. The apparatus comprises a handier for handling a first message published by a publisher, the first message comprising an instruction associated with said publisher, the instruction comprising topic data, and a generator, responsive to handling of the first message, for using first data associated with the instruction to generate topic data.

Abstract: A method and system for improving Field Replacement Unit (FRU) isolation in memory sub-systems by monitoring Voltage Regulator Module (VRM) induced memory errors. A comparator compares the output voltage coming from the VRM to memory. If the comparator detects a VRM output voltage transient that is outside a rated threshold, then a counter is increased by one. If the counter exceeds a count threshold, a VRM error is posted. If a memory failure occurs within a predetermined period of time, then the VRM error pinpoints the VRM output voltage transient as being the likely cause of the memory failure.

Abstract: A parser is generated for parsing a marked up document. A template of a sample marked up document chosen by a user is extracted. The template comprises elements of the structural markup of the sample document with their data contents removed. The parser for parsing a marked up document is generated. The parser is generated in the form of code based on the extracted template in such a manner that the parser is adapted to extract any elements and associated data content of the marked up document to be parsed corresponding to the elements of the extracted template.

Abstract: A replacement clip and method for repairing a modular cable connector having a broken locking clip. The replacement clip comprises a substantially u-shaped housing being configured to mount onto a modular connector having a broken clip, the housing having a top surface and a bottom surface opposite from the top surface, the top surface having an arm extension ending in a locking tab, the locking tab being spaced by the arm extension and located at an end opposite from the cable that the connector is connected to, the bottom surface having a slit therein running parallel to the cable, the slit being configured to mount the replacement clip onto the connector, such that, the locking tab securely holds the connector within a socket and such that mechanical and electrical connections between the connector and the socket are maintained.

Abstract: A method and system for testing a computer is presented. The temperature of the computer is controlled by one or more on-board fans inside the computer's enclosure. Voltages are controlled at the Voltage Regulator Module (VRM) level. A test program is then run under varying temperature and VRM voltages, and the results of the test program are logged. The present invention can be used either at the manufacturer's location or the customer's site, either under local or remote control.

Abstract: Prioritizing workload and tasks by first determining if a prioritization state change is necessary, and if so setting priorities to change the prioritization state, and if not examining prioritization state determining inputs, calculating new prioritization states, and updating prioritization states. Next interrupts are processes and prioritization states are updates. The resulting settings and prioritization states are examines, new prioritization states calculated, the new prioritization states compared with existing prioritization states, and the prioritization states changed as a function of present prioritization states and calculated new prioritization states. As a last step either a new prioritization state is set and saved, or the existing prioritization states saved.