Abstract:
A system and method for efficiently processing and managing data stored in a queue. A processing device may process the data stored in the queue. Queue protocols can be applied to the queue to efficiently process and manage data stored in the queue. Queue protocols may facilitate efficient use of processing resources that process the data stored in one or more queues. A queue protocol may include at least a first protocol for facilitating transfer of data in the queue to another queue processed by another processing device or a second protocol for inhibiting transfer of data in the queue to another queue.
Abstract:
An overload detecting assembly comprising a lateral probe (18) which cooperates with a first load bearing member (10) as it moves towards a second load bearing member (11) and in turn deflects an indicator member (20) which may take a permanent set when a yield point is exceeded. Ready inspection of the indicator member reveals whether or not it has been bent. The indicator member may comprise a cantilevered beam (24) formed in a sleeve (20) coaxial with the load bearing members (10, 11). Alternatively, an extension (25) of the probe (18) may deflect laterally at a midpoint under overload conditions. Alternatively, the probe (18) may form an impression in an indicator member (30) under overload conditions.
Abstract:
There is described a landing gear having a bogie including a elongated beam (2) for accommodating at least two axles receiving each a pair of ground engaging wheels, at least one axle (5) being pivotally mounted on the elongated beam. The landing gear further includes axle travel limitation means (10) extending between said pivotable axle and said elongated beam to be hitched up thereto, said travel limitation means being deformable one way starting from an stable and lockable state thereof corresponding to a landing position of said pivotable axle. There are also described independently lockable and actuatable telescopic struts.
Abstract:
Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.
Abstract:
A method of generating a double stranded (ds) recombinant nucleic acid molecule covalently linked in both strands by contacting two or more ds nucleotide sequences with a topoisomerase under conditions such that both termini of at least one end of a first ds nucleotide sequence are covalently linked by the topoisomerase to both termini of at least one end of a second ds nucleotide sequence is provided. Also provided is a method for generating a ds recombinant nucleic acid molecule covalently linked in one strand, by contacting two or more ds nucleotide sequences with a type IA topoisomerase under conditions such that one strand, but not both strands, of one or both ends of a first ds nucleotide sequence are covalently linked by the topoisomerase. Compositions for performing such methods, and compositions generated from such methods also are provided, as are kits containing components useful for conveniently practicing the methods.
Abstract:
Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.
Abstract:
A method and apparatus for the conditioning of articles. According to one aspect of the invention, a conveyor conveys articles in a conveying direction along a path. A rotatable belt assembly extends adjacent to the path. The rotatable belt assembly includes a belt having a conditioning run extending generally in the conveying direction to contact articles being conveyed along the path. The belt is mounted so that it is capable of displacement to vary the spacing of the conditioning run from the conveying path. The rotatable belt assembly moves vertically and/or with a rocking movement to condition the articles contacted by the conditioning run. The speed of rotation of the rotatable belt assembly may be varied to adjust the spacing between the articles being conveyed.
Abstract:
Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.
Abstract:
Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.
Abstract:
A spectroscopy method in which a sample is scanned without moving the sample. Light from the sample 16 is collected by a lens 14 and analyzed at a spectrum analyzer 28 before being focused onto a photodetector 32. Light from the focal point of the lens 14 is brought to a tight focus on the photodetector 32 whilst light from in front of or behind the focal point comes to a more diffuse focus. Light from the pixels on the photodetector 32 corresponding to the focal point of the lens 14 is processed, whilst light from pixels outside this region is ignored, thus forming a ‘virtual slit’. The sample 16 is scanned in a vertical direction by moving the ‘virtual slit’ up and down, by changing the designated rows of pixels from which data is analyzed. The sample is scanned in a horizontal direction by moving a vertical slit 24 in the light path in a horizontal direction.