| International Business Machines Corporations Patent applications |
| Patent application number | Title | Published |
|---|
| 20100228766 | QUEUE MESSAGE RETRIEVAL BY SELECTION CRITERIA - Embodiments of the present invention address deficiencies of the art in respect to message queuing and provide a method, system and computer program product for message queue retrieval by selection criteria. In an embodiment of the invention, a method for message queue retrieval by selection criteria can include receiving from a requesting application a message retrieval request for a message in a message queue storing different messages and determining from the message retrieval request both a template defining fields in the messages, and also selection criteria operable upon content stored in at least one of the fields in the messages. The method also can include applying the selection criteria to the messages in the message queue to select a message or subset of the messages in the message queue, and transmitting the message or subset to the requesting application. | 09-09-2010 |
| 20100034366 | PARTICIPANT ALERTS DURING MULTI-PERSON TELECONFERENCES - A method for alerting teleconference participants includes: activating a mute function in response to a participant command; tracking a teleconference's conversation audio; determining the level of alertness of a participant; determining whether the participant's name is detected in the teleconference audio; wherein in the event the participant's name is detected: determining whether the context in which the participant was addressed requires the participant to respond; wherein in the event the participant is required to respond: alerting the participant that the participant has been summoned and is required to make a response; providing a conversation summarization to the participant; and deactivating the participant's mute function. | 02-11-2010 |
| 20090271597 | Branch Prediction In A Computer Processor - Methods, apparatus, and products for branch prediction in a computer processor are disclosed that include: recording for a sequence of occurrences of a branch, in an algorithm in which the branch occurs more than once, each result of the branch, including maintaining a pointer to a location of a most recently recorded result; resetting the pointer to a location of the first recorded result upon completion of the algorithm; and predicting subsequent results of the branch, in subsequent occurrences of the branch, in dependence upon the recorded results. | 10-29-2009 |
| 20090216779 | TRANSFERRING MESSAGES TO A DIRECTORY - A method, system, and computer usable program product for transferring messages to a directory are provided in the illustrative embodiments. A listing of message templates that is stored in a computer usable storage medium is received. A list of messages is received. The listing of message templates is loaded in a directory. The directory executes in a data processing system and is configured to store messages. The list of messages are loaded in the directory. Messages are loaded in the directory by receiving a list of messages in the directory. A message is selected and identified from the list of messages. A determination is made if the message corresponds to an existing base message entry in the directory. A message instance entry is created in relation to the existing base message entry if the message corresponds to an existing base message entry and the message is otherwise handled if not. | 08-27-2009 |
| 20090190259 | MAGNETIC TAPE SECURITY - A tape cartridge includes a housing and a length of magnetic tape disposed within the housing. Additionally, the tape cartridge includes at least one cartridge memory chip disposed within the housing and at least one RFID reader operably connected to at least one of the cartridge memory chips and configured to write at least one message to the cartridge memory chip based on a received RFID signal. | 07-30-2009 |
| 20090172484 | Method for Implementing a Serialization Construct Within an Environment of Parallel Data Flow Graphs - A serialization construct is implemented within an environment of a number of parallel data flow graphs. A quiesce node is appended to every active data flow graph. The quiesce node prevents a token from passing to a next data flow graph within a chain before an execution of the active data flow graph has been finished. A serial data flow graph is implemented to provided for a serial execution while no other data flow graph is active. A serialize node is appended to a starting point of a serial data flow graph. A serialize end node is appended to an endpoint of the serial data flow graph. The serialize node is activated to start a serial operation. The serialize end node is activated after the serial operation has been terminated. | 07-02-2009 |
