36results about How to "Effective throughput" patented technology

A data migration system and method are disclosed for migrating data from a source server to a target server. The system includes an index containing a plurality of data migration operations in a normalized data model, each data migration operation being stored in association with an attribute, and a data mover communicably connected to the index. The data mover is adapted to move data from the source server to the target server in accordance with the data migration operations contained in the index. The data mover has an attribute corresponding to the associated attribute of at least one data migration operation contained in the index, the attribute indicating the type of data migration operations that can be performed by the data mover.

Various embodiments of methods and associated devices for increasing throughput in a programmable hardware element using interleaved data converters are disclosed. A device comprising a programmable hardware element may be configured to comprise a plurality N of processing portions. The device may receive an input signal, and sample the signal in an interleaved fashion, on a per sample basis, at an effective rate K, to produce N parallel data streams. The N parallel data streams may be processed in parallel by the plurality N of processing portions. Outputs of the plurality N of processing portions may be combined to produce output data. The effective rate K and / or the number N of parallel data streams may be specified by user input. Alternatively, these values may be determined automatically. For example, the effective rate K may be determined automatically based on a bandwidth of the input signal.

A sorting system for postal mail has a plurality of input sections capable of operating in parallel, each including a feeder that takes in mail pieces one at a time and a scanner that scans each mail piece for destination indicia. The system further includes a plurality of stackers each comprising at least one row of pockets in which mail is stacked, and a routing section or switch network effective to route mail in accordance with a sort scheme from any input section to any pocket of a stacker. The routing section uses diverts and merges so that mail can be conveyed to each stacker in accordance with a sort scheme implemented by a control system.

Various embodiments of the present invention provide methods and systems for optimally staining biological samples for analysis. In one embodiment, images of a sample are recorded before and after the application of a staining reagent and a decolorization reagent. A difference image is then generated based at least in part on a comparison of the images of the sample recorded before and after the application of the staining and decolorization reagents. Application parameters of the staining and decolorization reagents are then corrected based at least in part on the difference image such that the reagents may be optimally reapplied to generate a final image of the sample that may enable a user to better differentiate at least one target of interest in the sample. In one example, embodiments of the present invention allow for the generation of images that show only Gram-positive bacteria or only Gram-negative bacteria.

A method for executing a plurality of processing requests performed by a physical computing system that is programmed to execute the processing requests for clients includes, with the physical computing system, assigning an identification number to a new processing request; with the physical computing system, placing the new processing request into a process eligible group if the identification number of the new processing request meets a criterion; and with the physical computing system, placing the processing request into a queued group if the identification number of the processing request does not meet the criterion.

This document describes the NAT traversal mechanism used by originating / terminating P-CSCF nodes (114a / 114b) in an IMS network (105) based on Interactive Connectivity Establishment ICE. The originating P-CSCF node (114a) receives a SIP INVITE request from a first UE (101) originating a call to a second user equipment (UE) (103). If there is no relay candidate address for the first UE (101) in the SIP INVITE request, the SIP INVITE request is modified to include the first address provided by the originating IMS-AGW node (115a) as for the first UE ( 101) and forwarded to the second UE (103). The originating P-CSCF node (114a) receives a SIP INVITE RESPONSE message from the second UE (103) in response to the SIP INVITE request. If there is no relay candidate address for the second UE (103) in the SIP INVITE response, the SIP INVITE response is modified to include a second address provided by the originating IMS-AGW node (115a) as for the second UE ( 103) and forwarded to the first UE (101). The corresponding candidate address information is used by both UEs (101, 103) during ICE procedures. If the use of a relay server is required, only the IMS-AGW node (115a) is deployed.

The invention discloses a method for stochastically optimizing effective throughput adopting cross-layer joint encoding in an erasure channel. The method comprises the steps that (1) a sending end in the erasure channel enables original data delivered by an application program to be subjected to Raptor code encoding on an application layer, coded data are transmitted to a physical layer for R-S code encoding, and the data subjected to joint encoding are sent to the erasure channel; (2) through transmission of the erasure channel, the data reaching a receiving end are subjected to R-S code decoding on the physical layer, after decoding, the decoded data are transmitted to the application layer to be subjected to Raptor code decoding, then the receiving end feeds the decoding condition back to the sending end, and the sending end takes next action according to the feedback information; (3) a discrete stochastic approximation algorithm is adopted, and a proper cross-layer joint code rate is selected to optimize the effective throughput in an erasure channel communication system. The method can stably and efficiently optimize the effective throughput in the erasure channel to the maximum extent.

Implementations of the present principles include methods and systems for retransmitting un-recovered information within a cognitive radio, anti-jamming system. In accordance with aspects of the present principles, encoding schemes may be optimized for retransmission by utilizing a jamming rate and a number of un-recovered packets to minimize packet loss and thereby enhance throughput. In addition, rateless encoding features may be employed to re-encode un-recovered portions of an information sequence for efficient retransmission.

The invention provides a well section method for multi-turn CO2 huff and puff of a viscous oil edge and bottom water reservoir. The well selection method includes the following steps: using a hull and puff oil gain amount as an evaluation index, determining a geological factor, a fluidity factor and a development factor of an oil well; imparting weight to each factor, and correcting the weight of each factor by conducting numerical value dedoublement; using a single-factor sequencing method to acquire a single-sequence matrix; on the basis of respective corrected weight of each factor and the single-sequence matrix, acquiring an overall sequence, obtaining the evidence for well selection. According to the invention, the method herein can overcome man-made interference brought by incomprehensive on-site material and uncertainty of the result from the well selection caused by difficulty of representing continuation-type variant factors, has actual significance for well selection for multi-turn CO2 huff and puff of a viscous oil edge and bottom water reservoir, and is efficient, reasonable and scientific.

The invention relates to methods for making deoxyribofuranose compounds such as compound (2) which are useful intermediates in the preparation of pharmaceutical compounds such as 5-amino-3-(2′-O-acetyl-3′-deoxy-β-D-ribofuranosyl)-3H-thiazolo[4,5-d]pyrimidin-2-one and the like.