Abstract: A three-tier data processing system of the present invention includes a client application, operating on a client machine (i.e., first tier), which obtains data from a back-end data source (e.g., database server) by submitting a request (e.g., SQL query) to a middle tier. The middle tier, in turn, comprises a provider and a resolver. Data is actually returned to the client by means of a "data packet" of the present invention, which is a platform-independent self-describing data format used to exchange data between different subsystems of the architecture. A data packet normally represents a result set, which is received by a client from a remote server, containing both data and metadata. Upon receiving the data packet from the provider, the client unpacks the data and then proceeds to process and manipulate the data as if it were local data (e.g., for insert, deletes, updates, and the like).

Abstract: This invention is directed to a broad spectrum fungicide/algaecide composition which comprises a mixture of (a) at least one halopropynyl compound and (b) at least one sulfur-containing s-triazine, said mixture provided in an amount to prevent and/or protect a substrate from attack by one or more fungal and/or algael organisms. The composition can be used broadly in industrial systems and more particularly with substrates such as paints, coatings, stucco, concrete, stone, cementaceous surfaces, wood, caulking, sealants, textiles, and the like.

Abstract: System and methods are described for sorting information records in a fast and efficient manner. The present invention is particularly useful in environments where resources, such as available memory storage, are limited. A preferred method of the present invention includes scanning the field of records to be sorted (e.g., from left to right), whereby the system recursively divides the records into smaller groups, as determined by the values at a current position (i.e., the location currently under examination). As the members of a group drop below a predetermined threshold value, traditional improved sorting techniques (e.g., quicksort or insertsort) may be applied to the group to complete the sort.

Abstract: System and methods are described for sorting information records in a fast and efficient manner. The present invention is particularly useful in environments where resources, such as available memory storage, are limited. A preferred method of the present invention includes scanning the field of records to be sorted (e.g., from left to right), whereby the system recursively divides the records into smaller groups, as determined by the values at a current position (i.e., the location currently under examination). As the members of a group drop below a predetermined threshold value, traditional improved sorting techniques (e.g., quicksort or insertsort) may be applied to the group to complete the sort.