Abstract: Foot support systems include a fluid flow control system that facilitates movement of fluid into, out of, and/or within a sole structure and/or article of footwear, e.g., to change and/or control pressure in fluid filled bladder(s). Aspects of this technology may relate to one or more of: (a) footwear structures in which such systems are incorporated; (b) valve stem based fluid flow transfer systems; (c) solenoid based fluid flow transfer systems; (d) user input button features; (e) air filter features; (f) fluid tube to fluid distributor connection features; (g) fluid distributor to footwear connection features; (h) valve position sensor features; (i) valve transmission features; j) pressure control algorithm features; (k) electronic communication features; (l) system sealing features; and/or (m) pressure sensor mounting features.

Abstract: The invention provides a method of automating the matching of business to business processes. One or more companies may submit their transmission capabilities. The companies' transmission capabilities may be stored in a managed hub. One company may send a request to do business with another company. The possible translation paths between the two companies may be computed.

Abstract: A method for providing files to a remote node including the steps of determining whether bandwidth is available for transmitting across a communications link a file requested by a remote node, reserving bandwidth for the requested file if bandwidth is determined to be available, and opening the requested file for transmission only if bandwidth is reserved. In addition, an apparatus for providing files to a remote node including apparatus for determining whether bandwidth is available for transmitting across a communications link a file requested by a remote node, apparatus for reserving bandwidth for the requested file if bandwidth is determined to be available, and apparatus for opening the requested file for transmission only if bandwidth is reserved.

Abstract: A pre-compiler for a host programming language contains a language dependent portion and a language independent portion. The language dependent portion extracts source file statements written in a supplemental language and converts them into a language independent format. The language independent statements are communicated to the language independent portion, which translates them into lists of tasks to be performed. These tasks are communicated back to the language dependent portion in a language independent format. The language dependent portion then translates the tasks into procedure calls in the host language.

Abstract: In a relational database system, a method is utilized that increases the performance of the sort operation. An optimizer routine in the relational database manager analyzes a user's complete query to determine whether the final sorted results can be used directly by the user as sorting occurs. If the sort results can be used, the sort results are sent to Relational Data Services in the relational database manager for output to the user. Depending upon the determination made by the optimizer routine, one of two output modes for the final sorted sequence string of data are selected by the relational database manager. In disk output mode, the last pass of the final sorted sequence spring is written to disk. In fast direct output mode, the records of data are sent to the user as the final sorted sequence string is being merged during the last pass. The system and method of this invention reduces the total sort time by eliminating the overhead of writing the disk during the fast direct output mode.

Abstract: Record data on a disk file is sorted in a text/data processor by means of an algorithm that transfers such records on the basis of rank to a sort buffer on the basis of qualifying criteria. Each qualified file record is compared with the lowest ranked record previously transferred and located in the sort buffer. When a higher ranked record is identified it is transferred into the buffer at a location based on qualification. Lower ranked records are deleted from the sort buffer if space does not permit the storing of such records within the space available. When the sort buffer has been loaded with the highest ranked records remaining in the disk file without overflowing the buffer is unloaded to an output device. The sort program recycles through a subsequent pass again transferring the highest ranked remaining records into the sort buffer. To minimize recycle time, a presort algorithm is run to set record identifying bits in a bit map section of the sort buffer.

Abstract: Record data on a disk file is sorted in a text/data processor by means of an algorithm that transfers such records on the basis of rank to a sort buffer on the basis of qualifying criteria. Each qualified file record is compared with the lowest ranked record previously transferred and located in the sort buffer. When a higher ranked record is identified it is transferred into the buffer at a location based on qualification. Lower ranked records are deleted from the sort buffer if space does not permit the storing of such records within the space available. When the sort buffer has been loaded with the highest ranked records remaining in the disk file without overflowing the buffer is unloaded to an output device. The sort program recycles through a subsequent pass again transferring the highest ranked remaining records into the sort buffer. To minimize recycle time, a presort algorithm is run to set record identifying bits in a bit map section of the sort buffer.