Abstract: A method and apparatus for controlling a turbo-machine in case of failure of the main burn fuel flow calculator. The apparatus receives at least information from various sensors as well as from the main burn fuel flow calculator. The method and apparatus, herein disclosed, provides a smooth and secure transition between the last burn fuel flow value before the failure of the main burn fuel flow calculator and the future burn fuel flow values.

Abstract: A method and apparatus for controlling a turbo-machine in case of failure of the main burn fuel flow calculator. The apparatus receives at least information from various sensors as well as from the main burn fuel flow calculator. The method and apparatus, herein disclosed, provides a smooth and secure transition between the last burn fuel flow value before the failure of the main burn fuel flow calculator and the future burn fuel flow values.

Abstract: A method and apparatus for controlling a turbo-machine in case of failure of the main burn fuel flow calculator. The apparatus receives at least information from various sensors as well as from the main burn fuel flow calculator. The method and apparatus, herein disclosed, provides a smooth and secure transition between the last burn fuel flow value before the failure of the main burn fuel flow calculator and the future burn fuel flow values.

Abstract: A method and apparatus for controlling a turbo-machine in case of failure of the main burn fuel flow calculator. The apparatus receives at least information from various sensors as well as from the main burn fuel flow calculator. The method and apparatus, herein disclosed, provides a smooth and secure transition between the last burn fuel flow value before the failure of the main burn fuel flow calculator and the future burn fuel flow values.

Abstract: Method and device for caching the IP header of a message being routed through a data transmission network wherein each node includes a route processor for computing a routing algorithm, a main memory for storing the message, a cache memory; and an IP header detection logic circuit for storing the header in the cache memory as the message is being stored in the main memory. Once the header has been stored in the cache memory, it can be read from the cache memory in order to compute the routing algorithm. The new header resulting from the routing computation is written into the cache memory and is then read from the cache memory when the message including the header and the message data is sent over the network.

Abstract: In a data communication network, a system clock rate can be inferred at a receiver by measuring the data rate during successive periods. This information is used to adjust or adapt a receiver output clock to the inferred system clock. To adapt a receiver buffer output clock frequency to the buffer input clock frequency, the level of the buffer is periodically monitored. If the fill level is greater than an upper threshold, the output clock frequency is incremented. If the fill level is less than a lower threshold, the output clock frequency is decremented. A count is maintained of the number of successive adjustment operations performed while the fill level is outside the range bounded by the thresholds. When the fill level returns to the bounded range, a number of reverse frequency adjustments are performed. The number of reverse frequency adjustments are less than the number of earlier opposite frequency adjustments, preferably by a factor of two.