Abstract: An invariant numeric reference format is defined in a run-time environment for both run-time and storage use. A numeric reference to an object encodes the location of the object as an integral offset from an implicit machine pointer. In environments where the size of contiguous virtual memory segments is limited, objects are stored in a number of fixed-size contiguous chunks in virtual memory called pages. A page-offset numeric reference includes an offset and a page number, which is used to index a page map that contains a page pointer to the beginning of the page. Page-offset numeric references are dereferenced by adding the offset in the numeric reference to the page pointer obtained from the page map based on the page number in the numeric reference.

Abstract: An apparatus for an optical mouse for use with control systems, which is environmentally sealed and durable and therefore, suited for industrial and/or harsh environmental uses.

Abstract: Methods and apparatus for polling a cluster of devices, which are particularly suited for use in wireless parking systems, are disclosed. An application of the polling method and apparatus to parking enforcement is also disclosed.

Abstract: A communications system multiplexes voice communications signals onto one or more transport level connections established through a packetized network, such as the Internet. The invention supports the use of variable-length packets and accommodates variable jitter. The system conforms to real time protocol (RTP) and employs internet telephone gateways (ITGs) to bind users to channel identifiers, to indicate payload type and length, to provide channel identification and time stamps, and to indicate cessation and resumption of voice traffic from a particular user through use of, for example, marker bits.

Abstract: An apparatus for detecting skin areas in video sequences is disclosed. The apparatus is configured to include a shape locator and a tone detector. The shape locator analyzes the input video sequences to identify the edges of all the objects in a video frame and determine whether such edges approximate the outline of a predetermined shape that is likely to contain a skin area. Once objects likely to contain skin areas are located by the shape locator, the tone detector examines the picture elements (pixels) of each located object to determine if such pixels have signal energies that are characteristic of skin areas. The tone detector then samples pixels that have signal energies which are characteristic of skin areas to determine a range of skin tones and compares the range of sampled skin tones with the tones in the entire frame to find all matching skin tones.

Abstract: A vehicle parking network comprises a transmitter-responder device (TRD) for each subscriber and a complementary box which can be coupled to the TRD and only to it, and permits it to communicate with a central computer. The complementary box is provided with identification marks that can be scanned from the outside and includes a microcontroller, memory means and timing means. Once the vehicle is parked, the TRD is used to obtain from the computer a parking authorization and an allowed parking time. Then a legitimate parking sign is displayed and the parking time is downcounted until the allowed time has been completed or until the vehicle leaves the parking space. If communication with the computer cannot be established, the complementary box carries out an assumed parking procedure, stores its data in a buffer memory, and later transmits them to the computer for verification and registration. The computer communicates the data of each parking to the Public Authority charged with collecting the parking fees.

Abstract: A communications system multiplexes voice communications signals onto one or more transport level connections established through a packetized network, such as the Internet. The invention supports the use of variable-length packets and accommodates variable jitter. The system conforms to real time protocol (RTP) and employs internet telephone gateways (ITGs) to bind users to channel identifiers, to indicate payload type and length, to provide channel identification and time stamps, and to indicate cessation and resumption of voice traffic from a particular user through use of, for example, marker bits.

Abstract: A method and apparatus for performing copying garbage collection is provided. In a computer's memory, objects are stored in a permanent semispace. When a garbage collection event is detected, a garbage collection cycle is commenced. During the garbage collection cycle, the live objects in the permanent semispace are copied into a temporary semispace. After copying all the live objects into the temporary semispace, the live objects are then recopied into the permanent semispace.

Abstract: A bin based method for determining a group size estimate for applications utilizing connectionless networks. The method places an indicator of group participants who match the key under a mask into bins, where each bin corresponding to the number of bits in the mask used to determine the match. When the number of bits in the mask is increased from m to m+1, all of the participant indicators in bin m are moved into bin m+1. When the number of bits in the mask decreases from m+1 to m, however, no participant indicators are moved. When a refresh packet is received from a particular participant whose indicator is in bin k, but the current mask is m bits, for k>m., the indicator for that particular participant is moved from bin k to bin m.

Abstract: A vehicle parking network comprises a transmitter-responder device (TRD) for each subscriber and a complementary box which can be coupled to the TRD and only to it, and permits it to communicate with a central computer. The complementary box is provided with identification marks that can be scanned from the outside and includes a microcontroller, memory means and timing means. Once the vehicle is parked, the TRD is used to obtain from the computer a parking authorization and an allowed parking time. Then a legitimate parking sign is displayed and the parking time is down counted until the allowed time has been completed or until the vehicle leaves the parking space. If communication with the computer cannot be established, the complementary box carries out an assumed parking procedure, stores its data in a buffer memory, and later transmits them to the computer for verification and registration.

Abstract: A vehicle parking network comprises a transmitter-responder device (TRD) for each subscriber and a complementary box which can be coupled to the TRD and only to it, and permits it to communicate with a central computer. The complementary box is provided with identification marks that can be scanned from the outside and includes a microcontroller, memory means and timing means. Once the vehicle is parked, the TRD is used to obtain from the computer a parking authorization and an allowed parking time. Then a legitimate parking sign is displayed and the parking time is downcounted until the allowed time has been completed or until the vehicle leaves the parking space. If communication with the computer cannot be established, the complementary box carries out an assumed parking procedure, stores its data in a buffer memory, and later transmits them to the computer for verification and registration. The computer communicates the data of each parking to the Public Authority charged with collecting the parking fees.

Abstract: A method for applying forward error correction in a transmission network includes the steps of choosing one of a plurality of possible error correction codes, using an appropriate field to encode a complete forward-error-correcting (FEC) code algorithm in each FEC packet to be transmitted. The packet stream, consisting of media packets and FEC packets can be sent to both FEC-capable and FEC-incapable receivers. Decoding methods are independent of the forward-error-correcting code transmitted. The sender can adapt the forward-error-correction code algorithm and the degree of error correction provided on a one-time basis or even more dynamically. Decoding and recovery at the receiver require no prior notification from the sender. Applying the FEC code algorithm to decode includes interrogating the bits in an offset bit mask in each FEC packet to yield links with media packets, and applying other fields of the FEC header to obtain instructions to recover lost data in one of the media packets.

Abstract: A feed-forward bit-rate control system that selects and formats DQUANT values in real time for optimal semantically-encoded image transmission by video-compression codecs complying with the ITU-T standards H.263 or H.263E. The system uses a prequantization process to reduce the computational load imposed by the quantizer optimization calculations required for feed-forward semantic coding bit-rate control. The H.263 CBPY and MCBPC coding tables are reordered so as to be indexed using an orthogonal flag-based index values and the RLA coding table is block-indexed using clipped amplitude values, for faster access into these tables. The system also uses a rate-assist process to assure that DQUANT values are provided in each edge macroblock that follows a transition to and from each semantically-defined region when the edge macroblocks have four motion vectors by reducing the number of motion vectors in the macroblock to one.

Abstract: A facility for mapping a plurality of different Virtual Circuit Channels (VCC) into a single VCC is provided for use in a data network. In operation, the facility assembles, in turn, data cells each having a data payload and appropriate header identifying a respective VCC into a series of data cells. The series is then segmented into a predetermined number of data payloads, and a header identifying a common connection over the network is then appended to each of the payloads. The result is then transported over the data network via the common connection.

Abstract: Apparatus and methods are provided for generating an output signal representing an initial Huffman Coding rate for use in compressing a received digital signal. The digital signal includes a plurality of digital sets wherein ones of the digital sets are non-unique. Ones of the digital sets are stored and an indicator is associated with each. The indicator represents the probability of occurrence, or frequency, of the associated digital set within the digital signal. While more than one associated indicator remains stored, pairs of the associated indicators are selectively combined and each of the selectively combined pairs of associated indicators are accumulated to determine the initial Huffman Coding rate. The initial Huffman Coding rate is used to compress the digital signal.

Abstract: A method and apparatus for carrying out rapid, block-based SAD search operations for facial ellipses in a CIF videophone image frame are disclosed. A set of search templates, each having an ellipse pattern with two concentric, contiguous perimeters is defined and a set of parameter values are calculated off line for each template: a predetermined subfactor, index number, number of pixels in its dithered perimeter pattern, and first and second match thresholds. The pixels in the lower portion of each perimeter in the pattern are thinned by dithering so as to emphasize the upper contour of the ellipse. Values of +2k for interior perimeter pixels and -2k for exterior pixels in the template are then added to corresponding +k edge pixels and -k non-edge pixels in each search position of the template on a thresholded binary edge map of the image frame.

Abstract: A method and apparatus for providing high-speed data compressing without sacrificing the quality of data reconstruction. Each input vector or block of original data is expressed as a combination of a codebook index and an error differential, or as a compressed version of the original block of data, depending on whether the total number of bits needed to express the input vector as a combination of a codebook index and an error differential is less than the total bits needed to send the compressed version of the original block of data. In one embodiment, the flexibility to express video data in a compressed format or as a combination of a codebook index plus an error differential is provided through a video system employing a codebook, a scalar quantizer, and an entropy coder.

Abstract: A method and apparatus for coding an image comprising (at least) two regions (e.g., a facial region and a background region) which are to be coded with different quantization error parameters (e.g., quantizer step sizes), wherein the respective quantization error parameters are determined with use of a feed-forward rate control technique. Initial quantization error parameters are assigned to each region, and the overall bit rate which would result for the coding of the given frame is computed based on these assigned quantization error parameters. The computed bit rate is compared to a given bit rate constraint which may, for example, represent a limitation of a transmission channel. Based on the result of this comparison, one or both of the assigned quantization error parameters are adjusted, thereby resulting in different quantization error parameters for the two regions.

Abstract: Apparatus and methods are provided for generating a Huffman Code for use in compressing a received digital signal. The digital signal includes a plurality of digital sets wherein ones of the digital sets are non-unique. Ones of the digital sets are stored. Each stored digital set has associated therewith a codeword and an indicator. The indicator represents a probability of occurrence, or frequency, of the stored digital set within the digital signal. While more than one associated indicator remains stored, pairs of associated indicators are selectively combined and a first digital set associated with a first indicator and a second digital set associated with a second indicator are both associated with the selectively combined indicator. A first binary value is appended to the codeword associated with the first digital set and a second binary value is appended to the codeword associated with the second digital set.

Abstract: A cushion-like, shock-absorbent insole for footwear comprises two vinyl sheets forming an airtight compartment and sealing therein one or more sheets of resilient foam. Vent holes arranged in at least one of the vinyl sheets, preferably at the heel and metatarsal areas, act as metering valves in conjunction with the inside surface of the shoe sole so that air trapped in the foam material cannot instantaneously escape and both cushioning and massaging are provided.