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: 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: 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 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 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: 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 to divide a computing job into micro-jobs and allocate the execution of the micro-jobs to times when needed resources comply with one or more idleness criteria is provided. The micro-jobs are executed on an ongoing basis, but only when the resources needed by the micro-jobs are not needed by other jobs. A software program utilizing this methodology 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: 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: A dynamic digital montage system assists a user in creating and publishing a montage about one or more specified topics. The system receives an identification of one or more topics of interest from the user, and based on the subject information, collects data from dynamic and static data sources for display in dedicated sections of a montage. The data is presented in one of a number of predefined but editable layouts for presentation to a user. In one implementation, at least one of the montage components is associated with a dynamic data source and is updated when new data is provided by the dynamic data source. In another implementation, the data sources attached to the montage components are analyzed on a periodic basis, and based on the analysis, data source assignments and/or the montage layout is revised.

Abstract: A method, system, and apparatus to divide a computing job into micro-jobs and allocate the execution of the micro-jobs to times when needed resources comply with one or more idleness criteria is provided. The micro-jobs are executed on an ongoing basis, but only when the resources needed by the micro-jobs are not needed by other jobs. A software program utilizing this methodology 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: One example embodiment includes a quick sink system. The quick sink system includes a sink. The sink includes a faucet, where the faucet includes a cold water input for receiving cold water and a hot water input for receiving hot water. The sink also includes a basin, where the basin is configured to retain water and a drain, where the drain is configured to remove water from the basin. The quick sink system also includes a first connector, where the first connector is configured to connect the cold water input to a cold water supply, and a second connector, where the second connector is configured to connect the hot water input to a hot water supply.

Abstract: A method for storing data in virtual system is described. The method includes selecting virtual blocks in the virtual disk for storage of data based on contiguous logical blocks, in a disk file residing on physical storage media, that are mapped to the virtual blocks.

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: One example embodiment includes a quick sink system. The quick sink system includes a sink. The sink includes a faucet, where the faucet includes a cold water input for receiving cold water and a hot water input for receiving hot water. The sink also includes a basin, where the basin is configured to retain water and a drain, where the drain is configured to remove water from the basin. The quick sink system also includes a first connector, where the first connector is configured to connect the cold water input to a cold water supply, and a second connector, where the second connector is configured to connect the hot water input to a hot water supply.

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: 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, 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 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: 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 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.