Abstract: Methods, systems and computer program products provide communications with a plurality of application instances using a plurality of communication protocol stacks and a single Internet Protocol (IP) address. A stack is established as a routing stack associated with the single IP address. Other stacks which are associated with the single IP address are defined as candidate target stacks and an identification of candidate target stacks and the routing stack is distributed to the stacks. The routing stack is notified when an application associated with a candidate target stack listens to a port of the IP address to establish a current actual target stack. A request to establish a connection to the IP address and the port of the IP address is received and a routing table entry corresponding to the current actual target stack is created to provide a routing path from the routing stack to the current actual target stack.

Abstract: Connections from a client to respective ones of a plurality of application instances that receive data from a shared communication protocol stack are assigned by defining an affinity between the client and a corresponding one of the plurality of application instances. Connection requests received from the client at the shared communication protocol stack are assigned to the corresponding one of the plurality of application instances if an affinity is defined between the client and the corresponding one of the plurality of application instances. Connection requests received from the client at the shared communication protocol stack are distributed to selected ones of the plurality of application instances if an affinity is not defined between the client and the corresponding one of the plurality of application instances.

Abstract: Method and apparatus for sending data from one partition to a second partition within a logically partitioned computer. In a data processing system having multiple logical partitions, a send queue is established in the first logical partition, and a receive queue is established in the second logical partition. The send queue is registered in the send queue in a lookup table available to all of the logical partitions. The send queue is registered using as a key the logical partition identification of the first logical partition and the subchannel number (LPAR-ID.SUBCHANNEL#) of the subchannel assigned to the partition. The receive queue is registered in the lookup table using as a key, the internet protocol address of the receive queue in the second partition. A send instruction from the first logical partition is executed which interrogates the lookup table using the LPAR-ID.

Abstract: Methods, systems, and computer program products for automatically establishing an affinity for messages destined for a particular server application in a computing network, where that network performs workload balancing. A server application may specie (for example, using configuration values) that concurrent connection request messages from clients are to be routed to the same application instance, thereby bypassing normal workload balancing (as well as port balancing) that would otherwise occur among multiple application instances. This is advantageous for applications in which multiple concurrent requests from a particular client pertain to the same client operation (such as requests to deliver multiple elements of a single Web page). Access to server application code is not required.

Abstract: Methods, systems, and computer program products for establishing an affinity between a particular server application and a particular client in a computing network, where that network performs workload balancing. A server application explicitly requests to start an affinity for a particular client (or client group), based on application-specific considerations, thereby causing normal workload balancing to be bypassed for subsequent connection requests from that source. The application may also explicitly end an affinity, and/or may extend an affinity. Preferably, each affinity has a maximum duration and will therefore expire automatically if not explicitly ended. No changes are required on client devices or in client software, and there is no dependency on a client to support cookies.

Abstract: A method and workstation for optimizing optimization of biocatalyst performance based on combinatorial chemistry, automation technology, and computer-controlled design is disclosed. The workstation includes a synthesizer, an analyzer, a robot and computer in communication with the synthesizer and analyzer. The computer includes one or more programs for regulating reaction parameters such as types of enzymes; amounts of enzymes; types of solvents/buffers; amounts of solvents/buffers; temperature; pressure; pH; types of substrates; time; enzyme—substrate ratio; and agitation (whether to agitate and the speed of agitation) and employs statistical methods for optimizing multiple reaction parameters and for designing optimized experiments for further investigation.

Abstract: The instant invention encompasses isolated stable esterase enzymes characterized by the ability to remain stable at certain temperatures, substrate specificities, and activity profile.

Abstract: The instant invention encompasses isolated stable esterase enzymes characterized by the ability to remain stable at certain temperatures, substrate specificities, and activity profile; the expression vectors which can express, nucleic acids which encode for, and corresponding protein amino acid sequence of such proteins.

Abstract: The instant invention encompasses isolated stable esterase enzymes characterized by the ability to remain stable at certain temperatures, substrate specificities, and activity profile.

Abstract: In a word processing system, a text stream is stored on a direct access storage device (DASD) for recall and editing. The text stream is organized into a document that is stored on the DASD as a data set. The data set comprises an index portion and a portion containing text records. The index portion is divided into nodes, of which the primary node is called the root node. A method called shadowing is introduced to protect index nodes from the loss of significant data. Status indicators are defined and maintained so that access to a data set for normal system operation may be prevented where there is significant chance that the data set index has errors or is inconsistent to the extent that the normal high performance access method routines may not be able to use the index or may cause inadvertent loss of valid text data.

Abstract: A word processing system is disclosed in which a text stream is stored on a direct access storage device (DASD) for recall and editing. The text stream is organized into a document, which is stored on the DASD as a data set. The data set consists of an index portion and a portion containing text records. The index portion is divided into nodes, of which the primary node is called the root node. When the system operator designates a data set for use, the root node is fetched and retained in a system memory to eliminate the need to fetch it from the DASD for every access. When sequential records are accessed, such as during a document duplication operation, the index is fully searched only for the first of the sequential records. Subsequent records are located through index nodes already in the system memory, with subsequent index nodes being fetched from the DASD only when the last index entry in the current index node has been processed.

Abstract: In a word processing system storing a text stream on a direct access storage device (DASD) for recall and editing, the text stream is organized into a document, which is stored on the DASD as a data set. The data set consists of an index portion and a portion containing text records. The index portion is divided into nodes, of which the primary node is called the root node.A volume which refers to the full contents of the DASD can be formatted to contain multiple zones, each of which is logically independent of all other zones, when the contents of a storage volume can be divided conceptually into portions the uses of which are logically independent. Each zone has its own media allocation map, and data sets whose root is allocated within a given zone have all allocations within that same zone. If more than one data set with a given data set type exists on the storage volume, all of those data sets and the data set director for that data set type are allocated within a single zone.

Abstract: The specification discloses a method for adjusting text in a word processing system when the insert mode is completed. An indicator is set to indicate a change active condition if a change is made to the current line of text when an establish insert mode key is depressed by the operator. The indicator is interrogated to determine if a change active condition has been indicated when a terminate insert mode key is later depressed by the operator. When a change active condition is detected, the line end codes for the current line of text are adjusted to provide an adjusted line. The adjusted line is then interrogated to determine whether a paragraph boundary or page end code is included. If no paragraph boundary or page end code is included, the adjusted line is interrogated to determine whether a change was made in the line end code. Each succeeding line following the adjusted line is adjusted until a paragraph boundary or page end code is encountered or no change in the line end code is made for that line.

Abstract: In a word processor where a text stream is input by way of a keyboard for storage and is displayed to an operator and wherein different keyboard character sets are available, means are provided for signalling the location at which an insert of one or more characters is to be added to the text stream. Means are provided for comparing the active keyboard character set in the text stream immediately preceding the location to the keyboard character set of the insert to produce a first output when the keyboard character sets compare and a second output when the keyboard character sets do not compare. The insert is entered into the text stream at the location upon generation of the first output. Upon generation of the second output a character set change code is added immediately upstream of said location to indicate the keyboard character set for the insert.

Abstract: A word processing system is disclosed in which a text stream is stored for recall and editing. The characters in the text stream can be derived from a number of keyboard character sets but each character must be identified according to its character set to be properly printed or displayed. When the system operator moves, copies or deletes blocks of text the correct keyboard character sets must be maintained. When blocks of text are inserted or deleted the keyboard character sets are determined for the interfacing text blocks. When there is a transition from one keyboard character set to another, a character set change code is inserted to indicate the correct keyboard character set for the immediately following text.