Abstract: A method for selecting physical storage locations for storing data is provided. The method involves selecting physical storage locations for storing data storage by matching the attributes of the physical storage locations with the usage statistics of the data.

Abstract: A method for allocating storage memory space is provided. The method involves receiving a request for storage memory allocation for a file of a current size; estimating a future size of the file, different than the current size of the file, based at least on a particular attribute associated with the file; and causing allocation of storage memory space for storage of the file based on the future size of the file.

Abstract: A method, system, and apparatus for improving performance when retrieving data from one or more storage media. Files to be stored on the one or more storage media are classified into a ranking of different sets. Differences in retrieval value of different regions of the one or more storage media are exploited by selecting which files to store in which regions. For example, files that have a higher classification are stored in regions with faster retrieval values. The files can be classified based on frequency of access. Thus, files that are more frequently accessed are stored in regions that have a faster retrieval value. The files can be classified by another measure such as priority. For example, the classification for some or all of the files can be based on user-assigned priority. The classification may be based on events or data grouping.

Abstract: The invention concerns a rotary distribution apparatus (30) for distributing process liquids, typically in ion exchange and chromatographic separation in the processing of sugar juice. The apparatus includes a core (2) into which fixed process liquid supply pipes (3) extend and annular fluid distribution chambers defined between the core and an outer shell (4) which rotates around the core. Rotating pipes (5) are provided which rotate with the shell and which are connected between selected distribution chambers and selected ports in a rotating indexing disc (6) which rotates, with the shell, relative to a stationary indexing disc (7). The arrangement is such that as the rotating disc rotates, different streams of process liquid streams fed to the rotating disc through the rotating pipes are introduced to fixed ports in the stationary disc. The latter ports are arranged to feed the streams selectively to selected destinations.

Abstract: A method, system, and apparatus for improving performance when retrieving data from one or more storage media. Files to be stored on the one or more storage media are classified into a ranking of different sets. Differences in retrieval value of different regions of the one or more storage media are exploited by selecting which files to store in which regions. For example, files that have a higher classification are stored in regions with faster retrieval values. The files can be classified based on frequency of access. Thus, files that are more frequently accessed are stored in regions that have a faster retrieval value. The files can be classified by another measure such as priority. For example, the classification for some or all of the files can be based on user-assigned priority. The classification may be based on events or data grouping.

Abstract: The deployment of multiple embedded operating system components provides a designer with flexibility when customizing an embedded operating system for a target computing device. The embedded operating system components provide extra features to expand the functionality of the target computing device. The ease with which the designer may select various embedded operating system components to deploy from an originating computing device to the target computing device simplifies the design process. Configuration data of a core embedded operating system and configuration data of the deployed embedded operating system components are merged and any conflicts between configuration data are automatically resolved without rebooting the target computing device.

Abstract: A side-by-side locking display and dispensing structure formed by two ticket dispensing units having adjacent sidewalls and a coupling plate for demountably attaching said dispensing units together in a side-by-side relationship whereby the dispensing units have adjacent sidewalls that are connected together by the coupling plate. Also included in the dispensing units are rails for holding dividers that allow the units to hold tickets of different sizes and ticket fasteners that permit the tickets to be displayed at the front of the units.

Abstract: A display and dispensing device for lottery-type tickets or the like that is securable to prevent the dispensing of the tickets when desired. The device includes a housing of box-like configuration having an open rear end, a door pivotally attached to the housing open end and a security shield pivotally attached to the door and being alternatively located in an open condition allowing said lottery tickets to be dispensed and a closed condition blocking the dispensing of said tickets.

Abstract: A method for selecting storage locations is provided. The method involves selecting storage locations for file storage by matching the speed and/or longevity of the storage locations with the frequency of access of the file type of the file, or the frequency of access of the file itself. The method allows for optimized usage of storage locations by matching frequently accessed files with higher performing storage locations, storage devices or storage systems.

Abstract: A method for determining storage medium transfer rate characteristics. A host computer system issues a sequence of read commands to a storage medium to determine an accurate mapping of differences in transfer rate characteristics. For example, the host issues a sequence of relatively large reads to the storage medium at successively higher logical cluster numbers (LCNs). The host waits for each read command to complete before issuing the next read command and tracks a time interval that is representative of the time between completions of read commands.

Abstract: An apparatus and method for creating shaved, chipped or crushed ice and/or storing such ice at least temporarily. The apparatus includes a housing with a base adapted for placement on a surface such as a table or counter top. A one piece housing is moldable out of plastic. It includes a floor, a front and back, sides, and a top or ceiling. An opening in the back allows access into a substantially enclosed inner chamber or ice cabinet. Optional aspects of the apparatus include a viewing window, a molded drain pan floor in combination with a drain outlet, peak for elevation of the floor from the surface, a manually operated handle and ice ram for forcing ice blocks or cubes against a motorized ice shaver, and a shape and configuration to simulate an igloo or dome shape.

Abstract: A method for optimizing a solid state drive is described. The method involves determining whether a free space fragment on the SSD is smaller than the threshold fragment size. If the free space fragment on the SSD is smaller than the threshold fragment size, eliminating the free space fragment. If the free space fragment on the SSD is not smaller than the threshold fragment size, retaining the free space fragment for storing data. Elimination of the free space fragments smaller than the threshold fragment size results in a fewer number of free space fragments being used when writing to the SSD, allowing for improved SSD performance.

Abstract: The claimed subject matter relates to an architecture or arrangement that can limit access to sensitive information by means of encryption. In particular, data obtained from a payment instrument at, e.g., a Point-Of-Sale (POS) location can be encrypted at an early stage such that a POS (or another) application does not have access to the data in an unencrypted form and/or does not have access to a means for decrypting the data. For example, a Public Key Infrastructure (PKI) arrangement can be employed such that a back-end payment processor can define encryption algorithms, associate itself with a public key, and maintain a private key for decryption. The public key can be delivered to the POS location and employed for data encryption, and, moreover, the PKI can be regulated by the more trusted parties.

Abstract: The claimed subject matter relates to an architecture or arrangement that can limit access to sensitive information by means of encryption. In particular, data obtained from a payment instrument at, e.g., a Point-Of-Sale (POS) location can be encrypted at an early stage such that a POS (or another) application does not have access to the data in an unencrypted form and/or does not have access to a means for decrypting the data. For example, a Public Key Infrastructure (PKI) arrangement can be employed such that a back-end payment processor can define encryption algorithms, associate itself with a public key, and maintain a private key for decryption. The public key can be delivered to the POS location and employed for data encryption, and, moreover, the PKI can be regulated by the more trusted parties.

Abstract: The claimed subject matter relates to an architecture or arrangement that can limit access to sensitive information by means of encryption. In particular, data obtained from a payment instrument at, e.g., a Point-Of-Sale (POS) location can be encrypted at an early stage such that a POS (or another) application does not have access to the data in an unencrypted form and/or does not have access to a means for decrypting the data. For example, a Public Key Infrastructure (PKI) arrangement can be employed such that a back-end payment processor can define encryption algorithms, associate itself with a public key, and maintain a private key for decryption. The public key can be delivered to the POS location and employed for data encryption, and, moreover, the PKI can be regulated by the more trusted parties.

Abstract: Resource-based scheduling of computer jobs is disclosed. A computer job is scheduled based on utilization of a resource and a utilization criterion that the computer job has pertaining to the resource, in accordance with an embodiment of the present invention.

Abstract: Computer micro-jobs are disclosed. A computer job is divided into micro-jobs. In one embodiment, the micro-jobs have a size that allows a particular micro-job to complete within an allotted time for which the particular micro-job owns a resource used to execute the micro-job. In one embodiment, the allotted time is a quantum. In one embodiment, an entire computer job is divided into micro-jobs and the computer job is then executed micro-job by micro-job until the entire computer job is complete. Each of the micro-jobs may complete its execution within its quantum, in one embodiment. In one embodiment, the execution of the micro-jobs is allocated to times when needed resources comply with one or more idleness criteria. A software program executed with micro-jobs may be run at all times while the computer is powered up without impacting the performance of other software programs running on the same computer system.

Abstract: A method for determining storage medium transfer rate characteristics. A host computer system issues a sequence of read commands to a storage medium to determine an accurate mapping of differences in transfer rate characteristics. For example, the host issues a sequence of relatively large reads to the storage medium at successively higher logical cluster numbers (LCNs). The host waits for each read command to complete before issuing the next read command and tracks a time interval that is representative of the time between completions of read commands.