Abstract: The invention relates to a message broker for managing subscription requests in a multicast messaging system. The messaging system comprises a plurality of publishers publishing information to the broker and a plurality of subscribers subscribing to information received from one or more publishers. The broker is able to receive a subscription request pointing to topic information in which the requesting subscriber is interested, the topic information defining a specific topic within a topic hierarchy. The broker is able to parse the request to determine if the request includes a wildcard and if the request does include a wildcard, the broker instructs the requesting subscriber to listen on a multicast address associated with the topic in the topic hierarchy which precedes the wildcard.

Abstract: The present invention provides a method, apparatus, and computer instructions for organizing threads in an instant messaging session. Instant messages are received from a list of contacts. Each of these messages are stored in a set of folders, wherein each folders in the set of folders stores messages for a contact in the number of contacts. Each file is linked for access though a graphical user interface. Message threads are handled by displaying a primary dialog window, wherein the primary dialog window includes an ongoing conversation pane and an outgoing message pane. Responsive to a user input identifying a new thread, a secondary dialog window is displayed, wherein the secondary dialog window includes an ongoing conversation pane and an outgoing message pane. Responses to outgoing messages sent from the outgoing message pane are displayed in the primary dialog window in the ongoing conversation pane in the primary dialog window.

Abstract: A method, apparatus, and computer program product are disclosed for testing a data processing system's ability to recover from cache directory errors. A directory entry is stored into a cache directory. The directory entry includes an address tag and directory parity that is associated with that address tag. A cache entry is stored into a cache that is accessed using the cache directory. The cache entry includes information and cache parity that is associated with that information. The directory parity is altered to imply bad parity. The bad parity implies that the address tag that is associated with this parity is invalid. The information included in the cache entry is altered to be incorrect information. However, although the information is now incorrect, the cache parity continues to imply good parity which implies that the data is good. This good parity implies that the information that is associated with the parity is valid, even though it is not.

Abstract: Having detected an anomalous fault in a peripheral I/O slot, a processor entity may need to perform some remedial action, wherein the peripheral slot may have a fault line. First a voltage may be detected on the slot. Processor entity may set a fault if a voltage is found. A hotplug controller which may provide outputs that the processing entity may store as a fault syndrome word. The service processor or operating system, either during initial program load, or at another time, may detect that the fault could be a false fault depending on a set of predefined conditions and following the mechanism described here can then clear the fault earlier set. If an action from a previous device list is set, then there may be a clearing of the voltage fault based on determining that the action is set.

Abstract: A data dictionary is provided that specifies the entities and corresponding attributes for the application program interface developers to use. An extensible markup language interface is provided for customers to perform operations on the data. Application program interfaces receive extensible markup language requests and generate extensible markup language response documents that may return data from the database. A set of classes is also provided that correspond to the entities that are defined in the data dictionary. These classes define utility methods for use in retrieving data. The application program interface then appends the returned response object at the depth necessary in order to generate an extensible markup language document.

Abstract: A computer implemented method, apparatus, and computer usable program code for ensuring forward progress of instructions in a pipeline of a processor. Instructions are received in the pipeline. Instruction flushes are counted in the pipeline to determine a flush count. A single step mode in the pipeline is entered in response to the flush count exceeding a threshold. The single step mode instructions are issued in serial such that an instruction is not issued for execution until a prior instruction has completed execution.

Abstract: To enable a user to perform, by using an ontology, an information search utilizing a meaning given to information on a network by Semantic Web without being required to perform complicated operations for forming an inquiry sentence in conformity with the ontology. In a stage before a search engine for performing an information search by using an ontology is provided an information search supporting system having a morpheme analysis section, a syntactic and semantic analysis section, and a conversion execution section which converts a natural language sentence on which syntactic analysis and semantic analysis have been performed into an inquiry sentence described in an ontology description language by referring to a case frame ontology dictionary in which are stored information indicating to which property in an ontology does the relationship among a predicate, a subject and an object in the natural language sentence correspond and the case frame of the natural language sentence in the property.

Abstract: A speech recognizing device. Natural speech recognizing means recognizes speech input in an application program by dictation. Recognition result converting means converts a recognition result from said natural speech recognizing means into a final recognition result processable by said application program on the basis of a grammar to he used for recognizing said input speech in a grammar method. The recognition result converting means further comprises candidate sentence generating means for evolving said grammar to generate candidate sentences that are candidates for said final recognition result: and matching means for selecting a candidate sentence as said final recognition result among the candidate sentences by matching said candidate sentences generated by said candidate sentence generating means against the recognition result by said natural speech recognizing means.

Abstract: A method, an apparatus, and computer instructions are provided for extending operations of an application in a data processing system. A primary operation is executed. All extended operations of the primary operation are cached and pre and post operation identifiers are identified. For each pre operation identifier, a pre operation instance is created and executed. For each post operation identifier, a post operation instance is created and executed.

Abstract: A method and apparatus are provided for reducing the number of cycles required to checkpoint instructions in a multi-threaded microprocessor that has dispatch group checkpointing. A determination is made in a first stage of a checkpoint pipeline whether checkpointing can occur for a group of instructions. The results of processing the group of instructions flow to a second stage of the checkpoint pipeline regardless of whether the group of instructions is ready to checkpoint. If the group of instructions is ready to checkpoint, the group of instructions is checkpointed in a third stage of the checkpoint pipeline.

Abstract: For a software component to be installed on a target computer system a product dependency graph is determined which identifies additional software components required by the to-be-installed software component as prerequisite or corequisite software components. For each of these software components a corresponding installation facility is determined. Then a process model is generated being executable by a Workflow Management System (WFMS). The WFMS process model comprises a directed graph of activities, wherein each software component of the product dependency graph is associated with an activity such that when the activity is executed the installation facility corresponding to each of the software components is performed. Moreover, the WFMS process model is generated in a way that the sequence of activities in the directed graph is not violating the dependencies of the software components in the product dependency graph. Finally the WFMS process model is inserted in the WFMS as the provisioning process.

Abstract: A bookmark editor in an Internet web browser application allows a user to create symbolic links between bookmarks and bookmark folders. The bookmark editor may also detect when a bookmark already exists for a document and prompt the user to create a link rather than a new bookmark for the same document. The user may then keep a folder, subfolder, or bookmark and link to it via a symbolic link. When a bookmark is added to a folder or subfolder, the user does not need to duplicate that bookmark for a linked folder or subfolder.

Abstract: A method and apparatus for loading a ring of non-scan latches for a logic built-in self-test. A logic built-in self-test value is loaded into a scannable latch from the logic built-in self-test. An override control signal is asserted in response to loading the logic built-in self-test value into the scannable latch. A non-scan latch is forced to load the logic built-in self-test value from the scannable latch in response to asserting the override control signal. Logic paths in the ring of non-scan latches are exercised. The non-scan latch is part of the logical paths. The test results are captured from the logic paths and the test results are compared against expected test results to determine if the logic paths within the ring of non-scan latches are functioning properly.

Abstract: A mechanism is provided in a debugger for building a file information database while significantly reducing debug startup time. For each line number table, the mechanism of the present invention reads the header section and determines all the source files that contribute to the line number table. The mechanism also makes note of the line number table offset. The mechanism then inserts the source filename into the file information database. In one preferred embodiment, the file information database is implemented as a hash table. Searching time occurs during an interactive debug session; therefore, the searching time is not easily detectable to a user, thus creating the perception of a faster interactive debugging session.

Abstract: Method, system and computer program product for transferring data in a data processing system network. A method for transferring data in a data processing system network according to the invention includes determining an adapter among a plurality of adapters that has the lowest transmit latency, and assigning data to be transferred to the adapter determined to have the lowest transmit latency. The data to be transferred is then transferred by the assigned adapter. The present invention utilizes network adapters to transfer data in a more efficient manner.

Abstract: A method, apparatus, and computer program product for monitoring the performance of a system. The mechanism of the present invention provides an interface in the form of a graphical user interface (GUI) to communicate multiple layers of system performance data to an operator. An operator monitors this display of information and uses it to determine how to adjust the system to optimize system performance. This mechanism of the present invention provides immediate feedback to an operator by displaying a trail of metric points, wherein the metric points indicate the status of system performance over a period of time. In this manner, the display mechanism of the present invention immediately conveys to an operator whether the system is operating within predefined margins, the results of performance adjustments made to the system, as well as predictions or trends for the system.

Abstract: A method is presented for throttling data transmissions within a data processing system. Information about a data transfer from a server to a client is received within the application layer of a server, which stores the information about the data transfer along with information about a number of recent data transfers from the server to the client to create a sliding window of historical information about data transfers. The data transfer from the application layer of the server is delayed within the application layer of the server for an amount of time that is approximately equal to a computed delay time value in response to a determination that an average data transfer rate over the number of recent data transfers from the server to the client may exceed a data transfer rate threshold parameter.

Abstract: A self-timed memory array is disclosed, in which segmentability and metal-programmability are supported while minimizing layout space. Self-timing row decoder circuits are placed at the top and bottom of the array adjacent to respective I/O blocks. A self-timing signal is routed from the top (resp. bottom) of the array to a point halfway down (resp. up) the memory array and then back to a self-timing row decoder at the top (resp. bottom) of the array. The same approach may also be used to account for the bitline wire delay from the bottom (resp. top) of the array to the sense amplifiers in the I/O block. Further flexibility in wire routing is provided by eliminating metal routing layers from unneeded memory cells, and a programmable gate array may be used to allow an arbitrary word size to be chosen for the memory.

Abstract: A method, apparatus, and computer usable program code for identifying and tracking grouped content in e-mail campaigns. An instruction set is placed in an e-mail to form a modified e-mail, wherein the modified e-mail contains a grouped content having a plurality of levels that are expandable to present additional content. The modified e-mail is sent to a distribution list, wherein the instruction set is used to track information about the grouped content.

Abstract: A text modification mechanism is provided for formatting data such that the information can be reasonably deciphered by a human, but cannot be easily recognized by computer recognition techniques. The text modification mechanism alters printed text so that computer recognition of characters becomes difficult. Modification of the text may be accomplished with manipulation of the fonts or the background. The mechanism may also modify the text based on user preferences.