Abstract: Systems and methods are described for enabling a user to interact with an avatar representative of a target person. The avatar is configured to virtually embody audio, visual and behavioral characteristics of the target person and respond to the user's query based on the target person's life story. The user's query is presented in the form of audio based utterances. The target person's life story is processed in order to extract contextual, syntactic and semantic features related to the target person's audio, visual and linguistic characteristics.

Abstract: A IP video delivery system (10) includes a multiplexer (30) for transmitting multiple data streams of packets over link (31) to a site having one or more receivers (22). During times of congestion, the multiplexer will discard packets from its internal queues. Packets are intelligently chosen to minimize the effects on the output from the receivers (22) by taking into account timing information related to the packets and priority.

Abstract: A turbine engine includes a plurality of compressor rotors that include ventilation slots to vent the spaces between adjacent compressor rotors. Each compressor rotor is formed from a flat disk of material having first and second circular faces. A circular ridge of material protrudes outward from the one of the circular faces of the disc adjacent an outer edge of the disc. The ventilation slots are formed in the circular ridge of material. Each ventilation slot is a depression in the circular ridge of material, the depression having a longitudinal axis that extends substantially in a radial direction of the disc.

Abstract: A IP video delivery system (10) includes a multiplexer (30) for transmitting multiple data streams of packets over link (31) to a site having one or more receivers (22). During times of congestion, the multiplexer will discard packets from its internal queues. Packets are intelligently chosen to minimize the effects on the output from the receivers (22) by taking into account timing information related to the packets and priority.

Abstract: Method and system for encoding packet interdependency in a packet data stream. In one embodiment, the scheme comprises providing, for each packet in the packet data stream, a dependency relationship field associated therewith; and representing dependency of a first packet on a second packet of the packet data stream by a binary code in the dependency relationship field of the first packet, the binary code for describing the dependency as a subset relationship between the first and second packets.

Abstract: A Look-ahead Contention Resolution (“LCR”) technique for application in burst switching networks is described. The LCR technique takes advantage of the existing separation of data bursts and their BHPs in time (offset or “?”). Through a look-ahead window (“LAW”) W time units wide, a network scheduler can process a group of BHPs prior to the arrival of their respective bursts and gain a collective knowledge of the state of the switch in the futures, rather than processing a single slot ? time units in the future.

Abstract: A Parallel Round-Robin Arbiter (PRRA) system and method for arbitrating among N requesters. A plurality of leaf nodes that correspond to the N requesters form a directed ring of a hierarchical decision tree, wherein the leaf nodes are operable to propagate requests from the requesters. Each leaf node is provided with status logic operable to transmit its priority status for resolution of requests by the decision tree. Logic associated with the decision tree's nodes is operable to hierarchically resolve the requests propagated by the leaf nodes, wherein each leaf node is operable to transmit its grant to one of its immediate leaf node neighbors coupled to it via the directed ring for influencing the neighboring leaf node's priority status logic.

Abstract: A scheduling system and method operable with a burst switching element wherein control information is provided to the switching element via a separate Burst Header that precedes data bursts on ingress data channels. In one embodiment, a series of scheduling determinations are made in a select order such that packet treatment (i.e., processing for transmission, buffering, or packet dropping) is optimized with respect to packet loss and available buffer space. In another embodiment, control information received in the Burst Headers is utilized to reserve output data channel bandwidth to future incoming data packets in a forward-looking scheduling mechanism.

Abstract: A sensor assembly includes a housing and a tube. The housing has a first leading edge portion which is capable of being located in a compressor/fan inlet flow path and which includes an interior wall section. The tube has a proximal portion including an air inlet which is adapted to receive a compressor bleed air flow and a distal portion which is located in the housing and which includes at least one air outlet hole. The hole is spaced apart from the interior wall section and is aligned to direct at least some compressor bleed air flow to impinge against the interior wall section. The housing includes an opening which receives air from the flow path when the housing is located in the flow path, wherein the opening is adapted for fluid communication with a sensor, and wherein the sensor measures at least one of air temperature and air pressure.

Abstract: A IP video delivery system (10) includes a multiplexer (30) for transmitting multiple data streams of packets over link (31) to a site having one or more receivers (22). During times of congestion, the multiplexer will discard packets from its internal queues. Packets are intelligently chosen to minimize the effects on the output from the receivers (22) by taking into account timing information related to the packets and priority.

Abstract: Method and system for encoding packet interdependency in a packet data stream. In one embodiment, the scheme comprises providing, for each packet in the packet data stream, a dependency relationship field associated therewith; and representing dependency of a first packet on a second packet of the packet data stream by a binary code in the dependency relationship field of the first packet, the binary code for describing the dependency as a subset relationship between the first and second packets.

Abstract: A look-up table (LUT)-based arbitration (LTA) system and methodology for use in a network switch element. Input control signals generated by ingress and egress entities associated with a cross-connect matrix of the network switch element are encoded into address information that is used for interrogating a storage structure. Pre-computed arbitration results based on a select arbiter scheme are stored into fields associated with the storage structure. When a particular input combination is applied with respect to an arbitration iteration, a selected arbitration result is obtained by querying the appropriate field, which is then decoded into a corresponding selected entity for the arbitration iteration.

Abstract: A scheduling system and methodology for use in a network switch element having multiserver, multiple-arbiter architecture. Ingress ports and egress ports coupled to the cross-connect fabric of the network element are provided with multiple ingress and egress arbiters, respectively, for effectuating an iterative arbitration strategy such as RGA or RG. Arbiter architectures include singe-arbiter-per-port; single-arbiter-per-server; multiple-arbiters-per-port; and multiple-arbiters-per-server arrangements, wherein the arbiters can be implemented using RRA, BTA, Flexible Ring, or any other arbiter technology. Depending on the iteration strategy, ingress arbiter architecture and egress arbiter architecture, a variety of iterative, multiserver-capable scheduling algorithms can be obtained, which scheduling algorithms can also be implemented in QoS-aware network nodes.

Abstract: A binary-tree-based arbitration system and methodology with attributes that approximate a Generalized Processor Sharing (GPS) scheme for rendering fairer service grants in an environment having a plurality of competing entities. Arbitration based on probabilistic control of arbiter nodes' behavior is set forth for alleviating the inherent unfairness of a binary tree arbiter (BTA). In one implementation, BTA flag direction probabilities are computed based on composite weighted functions that assign relative weights or priorities to such factors as queue sizes, queue ages, and service class parameters. Within this general framework, techniques for desynchronizing a binary tree's root node, shuffling techniques for mapping incoming service requests to the BTA's inputs, and multi-level embedded trees are described.

Abstract: A scheduling system and method operable with a burst switching element wherein control information is provided to the switching element via a separate Burst Header that precedes data bursts on ingress data channels. In one embodiment, a series of scheduling determinations are made in a select order such that packet treatment (i.e., processing for transmission, buffering, or packet dropping) is optimized with respect to packet loss and available buffer space. In another embodiment, control information received in the Burst Headers is utilized to reserve output data channel bandwidth to future incoming data packets in a forward-looking scheduling mechanism.

Abstract: A Look-ahead Contention Resolution (“LCR”) technique for application in burst switching networks is described. The LCR technique takes advantage of the existing separation of data bursts and their BHPs in time (offset or “&tgr;”). Through a look-ahead window (“LAW”) W time units wide, a network scheduler can process a group of BHPs prior to the arrival of their respective bursts and gain a collective knowledge of the state of the switch in the futures, rather than processing a single slot &tgr; time units in the future.

Abstract: Viable biological material is cryogenically preserved (cryopreservation) by immersing the material in a tank of cooling fluid, and circulating the cooling fluid past the material at a substantially constant predetermined velocity and temperature to freeze the material. The material may either be directly plunged into the cooling fluid without preparation, or chemically prepared prior to freezing. A method according to the present invention freezes the biologic material quickly enough to avoid the formation of ice crystals within cell structures (vitrification) and allows the samples to maintain anatomical structure and remain biochemically active after thaw. The temperature of the cooling fluid is preferably between −20 degrees centigrade and −30 degrees centigrade, which is warm enough to minimize the formation of stress fractures and other artefacts in cell membranes due to thermal changes.

Abstract: A binary-tree-based arbitration system and methodology with attributes that approximate a Generalized Processor Sharing (GPS) scheme for rendering fairer service grants in an environment having a plurality of competing entities. Arbitration based on probabilistic control of arbiter nodes' behavior is set forth for alleviating the inherent unfairness of a binary tree arbiter (BTA). In one implementation, BTA flag direction probabilities are computed based on composite weighted functions that assign relative weights or priorities to such factors as queue sizes, queue ages, and service class parameters. Within this general framework, techniques for desynchronizing a binary tree's root node, shuffling techniques for mapping incoming service requests to the BTA's inputs, and multi-level embedded trees are described.

Abstract: Viable biological material is cryogenically preserved (cryopreservation) by immersing the material in a tank of cooling fluid, and circulating the cooling fluid past the material at a substantially constant predetermined velocity and temperature to freeze the material. The material may either be directly plunged into the cooling fluid without preparation, or chemically prepared prior to freezing. A method according to the present invention freezes the biologic material quickly enough to avoid the formation of ice crystals within cell structures (vitrification) and allows the samples to maintain anatomical structure and remain biochemically active after thaw. The temperature of the cooling fluid is preferably between −20 degrees centigrade and −30 degrees centigrade, which is warm enough to minimize the formation of stress fractures and other artefacts in cell membranes due to thermal changes.

Abstract: Viable biological material is cryogenically preserved (cryopreservation) by chemically preparing the material for freezing, immersing the material in a tank of cooling fluid, and circulating the cooling fluid past the material at a substantially constant predetermined velocity and temperature to freeze the material. A method according to the present invention freezes the biologic material quickly enough to avoid the formation of ice crystals within cell structures (vitrification). The temperature of the cooling fluid is preferably between −20° C. and −30° C., which is warm enough to minimize the formation of stress fractures in cell membranes due to thermal changes. Cells frozen using a method according to the present invention have been shown to have approximately an 80 percent survival rate, which is significantly higher than other cryopreservation methods.