Abstract: A method for an automated call distribution system to re-associate a caller with a queue position previously established in an on-hold queue. The method includes receiving a first incoming call from a caller and assigning the caller to a position in an on-hold queue when the caller is placed on-hold by the automated call distribution system. A placeholder for the caller may then be assigned in the on-hold queue when the caller disconnects with the automated call distribution system. The placeholder corresponds to the position of the caller in the on-hold queue and is associated with a caller identifier. The method further includes receiving a second incoming call from the caller and associating the second incoming call with the caller identifier. It is then determined that the caller is associated with the placeholder. The caller is placed back into the on-hold queue at the position of the placeholder.

Abstract: A method of providing lock-based access to nodes in a concurrent linked list includes providing a plurality of striped lock objects. Each striped lock object is configured to lock at least one of the nodes in the concurrent linked list. An index is computed based on a value stored in a first node to be accessed in the concurrent linked list. A first one of the striped lock objects is identified based on the computed index. The first striped lock object is acquired, thereby locking and providing protected access to the first node.

Abstract: A method of providing lock-based access to nodes in a concurrent linked list includes providing a plurality of striped lock objects. Each striped lock object is configured to lock at least one of the nodes in the concurrent linked list. An index is computed based on a value stored in a first node to be accessed in the concurrent linked list. A first one of the striped lock objects is identified based on the computed index. The first striped lock object is acquired, thereby locking and providing protected access to the first node.

Abstract: A method for an automated call distribution system to re-associate a caller with a queue position previously established in an on-hold queue. The method includes receiving a first incoming call from a caller and assigning the caller to a position in an on-hold queue when the caller is placed on-hold by the automated call distribution system. A placeholder for the caller may then be assigned in the on-hold queue when the caller disconnects with the automated call distribution system. The placeholder corresponds to the position of the caller in the on-hold queue and is associated with a caller identifier. The method further includes receiving a second incoming call from the caller and associating the second incoming call with the caller identifier. It is then determined that the caller is associated with the placeholder. The caller is placed back into the on-hold queue at the position of the placeholder.

Abstract: A method of providing lock-based access to nodes in a concurrent linked list includes providing a plurality of striped lock objects. Each striped lock object is configured to lock at least one of the nodes in the concurrent linked list. An index is computed based on a value stored in a first node to be accessed in the concurrent linked list. A first one of the striped lock objects is identified based on the computed index. The first striped lock object is acquired, thereby locking and providing protected access to the first node.

Abstract: The majority of such software attacks exploit software vulnerabilities or flaws to write data to unintended locations. For example, control-data attacks exploit buffer overflows or other vulnerabilities to overwrite a return address in the stack, a function pointer, or some other piece of control data. Non-control-data attacks exploit similar vulnerabilities to overwrite security critical data without subverting the intended control flow in the program. We describe a method for securing software against both control-data and non-control-data attacks. A static analysis is carried out to determine data flow information for a software program. Data-flow tracking instructions are formed in order to track data flow during execution or emulation of that software. Also, checking instructions are formed to check the tracked data flow against the static analysis results and thereby identify potential attacks or errors. Optional optimisations are described to reduce the resulting additional overheads.

Abstract: The described implementations relate to efficient scheduling of transactions and tasks. A memory location, address, or variable previously accessed by a blocked entity is observed periodically to determine an appropriate time to wake and retry the blocked entity. If the previous accessed memory location, address or variable changes state, a scheduler wakes the blocked entity and the blocked entity retries processing. A doubly-indexed data structure of blocked entities and memory locations associated with the blocked entities may be used to efficiently determine when a retrying execution would be profitable.

Abstract: An apparatus for measuring tension of piston rings includes a cylindrical support fixture having a circumferential groove formed therearound for receiving and holding a piston ring. A rigid base supports a plurality of components of the apparatus. A strong, thin band, formed from a material sufficiently strong to withstand repeated applications of pulling force thereto, is mounted to the base, and is held between two clamps. The band has a loop formed therein, for receiving the support fixture with a piston ring mounted therein. The apparatus also includes reciprocally movable structure for tightening the band around the support fixture, such as a slidably movable clamp assembly at one end of the band. The apparatus further includes mechanism for measuring tension on the band, and fluid activatable mechanism for vertically reciprocating a portion of the support fixture. In a preferred embodiment, the reciprocating mechanism is pneumatically activatable, such as by compressed air.

Abstract: A displacement transducer suitable for use in a magnetic bearing measures the flux density between a pair of components and divides a signal indicative of the magnetomotive force between the components by the flux density signal to obtain a signal indicative of displacement.

Abstract: An axial magnetic bearing includes a rotor overlying a coil in a stator. A second coil is disposed at a location where it does not exert a significant force on the rotor. The second coil generates a magnetic field to oppose and substantially cancel the stray magnetic field generated by the first coil.

Abstract: A magnetic bearing has a number of pole pieces disposed about the circumference of the shaft supported by the bearing. To inhibit magnetic flux migration within the bearing, magnetic barriers of non-magnetic material are interposed between pole pieces at selected locations. Magnetic guides prevent magnetic saturation of the bridging portion of the pole pieces prior to the poles' saturating.