Abstract: The present invention provides a novel technique for Web-based asynchronous processing of synchronous requests. The systems and methods of the present invention utilize a synchronous interface in order to couple with systems that synchronously communicate (e.g., to submit queries and receive results). The interface enables reception of synchronous requests, which are queued and parsed amongst subscribed processing servers within a server farm. Respective servers can serially and/or concurrently process the request and/or portions thereof via a dynamic balancing approach. Such approach distributes the request to servers based on server load, wherein respective portions can be re-allocated as server load changes. Results can be correlated with the request, aggregated, and returned such that it appears to the requester that the request was synchronously serviced. The foregoing mitigates the need for clients to perform client-side aggregation of asynchronous results.

Abstract: The present invention relates to systems and methods that facilitate pulling and/or receiving data from a client and posting the data for access by subscribing systems. The systems and methods include a message agent that generates a connection instance that can store connection-related information such as data conveyance state, data identification, and connection identification. Access to the connection instance can be provided to a machine, which can utilize the information to lock the connection and connection instance and begin pulling or receiving data from the client. As the machine pulls or receives data, the data can be published and the connection instance can be concurrently updated to reflect the present state of data conveyance. The information within the connection instance can be utilized to re-establish of severed connection, and to dynamically float the connection between machines to dynamically balance load, ensure reliability and recover from errors.

Abstract: A computer-implemented method analyzes a source code segment which is to be compiled for execution by any one of several different processor types. The method determines whether a performance advantage would be achieved by generating a customized version of object code that can be executed by one of the processor types compared with generating a non-customized version. If a performance advantage would be achieved, the method generates at least one customized object code version and a non-customized version for the source code segment, and it generates a control section that causes one of the object code versions to be called during execution of the object code in accordance with an executing processor's processor type. If no performance advantage would be achieved, the method generates a non-customized version of the object code that can be executed by any of the different processor types.

Abstract: A Monte Carlo method for use with natural language understanding and speech recognition language models can include a series of steps. The steps can include identifying at least one phrase embedded in a body of text wherein the phrase can belong to a phrase class. An additional attribute corresponding to the identified phrase can be determined. The body of text can be copied and the identified phrase can be replaced with a different phrase selected from a plurality of phrases. The different phrase can belong to the phrase class and correspond to the attribute.

Abstract: A work bucket vertical extension apparatus provides a lower pedestal bucket, an upper, elevated bucket vertically aligned into a nested position above the lower pedestal bucket, an da a sliding track mechanism such that the internal volume of the upper bucket is sufficient to receive the upper, elevated bucket when nested.

Abstract: A Monte Carlo method for use with natural language understanding and speech recognition language models can include a series of steps. The steps can include identifying at least one phrase embedded in a body of text wherein the phrase can belong to a phrase class. An additional attribute corresponding to the identified phrase can be determined. The body of text can be copied and the identified phrase can be replaced with a different phrase selected from a plurality of phrases. The different phrase can belong to the phrase class and correspond to the attribute.

Abstract: A computer-implemented method analyzes a source code segment which is to be compiled for execution by any one of several different processor types. The method determines whether a performance advantage would be achieved by generating a customized version of object code that can be executed by one of the processor types compared with generating a non-customized version. If a performance advantage would be achieved, the method generates at least one customized object code version and a non-customized version for the source code segment, and it generates a control section that causes one of the object code versions to be called during execution of the object code in accordance with an executing processor's processor type. If no performance advantage would be achieved, the method generates a non-customized version of the object code that can be executed by any of the different processor types.

Abstract: A computer-implemented method analyzes a source code segment which is to be compiled for execution by any one of several different processor types. The method determines whether a performance advantage would be achieved by generating a customized version of object code that can be executed by one of the processor types compared with generating a non-customized version. If a performance advantage would be achieved, the method generates at least one customized object code version and a non-customized version for the source code segment, and it generates a control section that causes one of the object code versions to be called during execution of the object code in accordance with an executing processor's processor type. If no performance advantage would be achieved, the method generates a non-customized version of the object code that can be executed by any of the different processor types.

Abstract: A chuck having a pair of opposed clamp pads, each pad engaging a tool shank at sharp corners along a pair of angularly-spaced lines of contact. Tapered outer surfaces on the clamp pads are crowned to engage a cooperating taper on a sleeve at the midpoint between the opposite ends of a pad. The clamp pads are carried by a guide bushing that reciprocates within a shaft bore to provide movement of the clamp pads inwardly or outwardly.

Abstract: A computer-implemented method identifies a code segment which is to be customized to a plurality of different processor types. The method generates object code for the code segment, including generating a plurality of sections for the code segment, each of the plurality of sections being object code for the code segment customized for one of the plurality of different processor types, and generating a control section that causes a selected one of the plurality of sections to be called during execution of the object code in accordance with an executing processor's processor type.

Abstract: A method and apparatus are provided for operating a flash memory (24) as a client memory, wherein the flash memory comprises a partition (28) of physical data storage locations. The partition is divided into a plurality of units (30). Each unit is organized into a plurality of allocations (60) where each allocation includes a plurality of blocks (58) of physical data storage locations. The partition is organized into a plurality of regions (46) which define a client address space such that each region represents a portion of the client address space. Interfacing the client address space with the physical address space requires maintaining an allocation list (56) for each unit that includes an allocation (68) entry describing each allocation in the unit. Each allocation entry includes a first field (70) storing a client start address for the allocation in the client address space and a second field (72) storing an allocation length indicating the number of blocks of data in that allocation.