Abstract: Systems are provided for costing service proposals, each comprising a set of proposal elements (OEs) selected from a predetermined group of proposal elements. A proposal costing system has a proposal formulator for selecting a set of proposal elements (OEs) for a new service proposal from the predetermined group of proposal elements in response to user input. The system includes a cost controller for maintaining, for each OE, service data indicative of service tasks associated with that proposal element. The system is adapted for determining a total cost for a new service proposal in dependence on the service data for the selected proposal elements and cost data indicating a cost of service tasks indicated by the service data. In addition, the cost controller is adapted for automatically updating the service data for OEs in the group in dependence on maintenance data indicative of service tasks performed in operation of real services.

Abstract: Systems are provided for costing service proposals, each comprising a set of proposal elements (OEs) selected from a predetermined group of proposal elements. A proposal costing system has a proposal formulator for selecting a set of proposal elements (OEs) for a new service proposal from the predetermined group of proposal elements in response to user input. The system includes a cost controller for maintaining, for each OE, service data indicative of service tasks associated with that proposal element. The system is adapted for determining a total cost for a new service proposal in dependence on the service data for the selected proposal elements and cost data indicating a cost of service tasks indicated by the service data. In addition, the cost controller is adapted for automatically updating the service data for OEs in the group in dependence on maintenance data indicative of service tasks performed in operation of real services.

Abstract: A method and apparatus for use where an incoming high speed data stream is first divided into N lower bandwidth channels and is then transmitted through the network to a receiver where it arrives with varying delays depending on the physical characteristics of the network. The high speed data stream is reconstructed by determining the different geographical delay parameters among the lower speed channels, by adjusting the transmission delays by alignment circuitry, and then by combining the lower speed signals into one high bandwidth channel. When one of the lower speed channels fails, the bandwidth is automatically re-adjusted using the remaining N−1 lines. When the failed channel is restored to an acceptable level of service, the communication protocol automatically re-adjusts the bandwidth to the full N channels. When the network indicates the loss of a line, the multiplexers at both ends of the link automatically compensate for the loss without any message exchange.

Abstract: This technique for coding images involves filtering the original input image into subband images using successive high-pass and low-pass filterings over a tree-shaped filter with each tree filtering stage involving re-scaling operations adjusted to keep the subband image signal dynamics substantially stable throughout the filtering tree.

Abstract: A vector quantization encoder comprises a codebook built with the so-called Linde-Buzo-Gray (LBG) algorithm, an intermediary codebook built from the initial codebook (LBG) and a Hash-table containing subsets of the initial codebook (LBG). Vector quantization is then performed in two steps. First, a multistep prequantization of an input vector gives an index in the Hash-table which points to a subset of vectors of the initial codebook (LBG). Then a full search is performed within the pointed subset of vectors of the initial codebook (LBG).

Abstract: A digital filter providing output samples at a rate B while input samples are being provided at a rate A. The filter impulse response h(t) is sampled at a rate P=a.A=b.B, with P being the lowest common multiple to A and B, to derive Np filter coefficients therefrom. The coefficients are arranged into "a" sets of Np/a coefficients and stored. Output samples are then computed by feeding input samples Sn at incoming rate while permutating the sets of coefficients and generating output samples at the output rate.

Abstract: A pitch detector to adjust long term prediction in a pulse excitation speech coder. A residual signal r(n) is first derived from the speech signal s(n) by short term filtering. Then, r(n) is processed to calculate a prediction error signal e(n) which is subsequently pulse excitation encoded. The processing of e(n) entails prediction of a residual by measuring a pitch related factor M, employing two steps. First calculating a coarse M value through peak clipping and sign transition detection, and then adjusting the M value by autocorrelation--calculations about the roughly spaced peaks.