Abstract: A switch assembly comprises a button, a pivoting element, a first positioning element, and a second positioning element. The button has a first, second, and third states. The pivoting element extends from a height direction of the button, and has first and second contact parts arranged in the height direction. Surfaces of the first and second contact parts have different contours. The first positioning element and the second positioning element respectively correspond to the first contact part and the second contact part, and are movable relative to each other. A function of the first positioning element and a first positioning section of the first contact part is configuring the first state, and functions of the second positioning element and a second positioning section and a third positioning section of the second contact part are respectively configuring the second state and the third state.

Abstract: A switch assembly comprises a button, a pivoting element, a first positioning element, and a second positioning element. The button has a first, second, and third states. The pivoting element extends from a height direction of the button, and has first and second contact parts arranged in the height direction. Surfaces of the first and second contact parts have different contours. The first positioning element and the second positioning element respectively correspond to the first contact part and the second contact part, and are movable relative to each other. A function of the first positioning element and a first positioning section of the first contact part is configuring the first state, and functions of the second positioning element and a second positioning section and a third positioning section of the second contact part are respectively configuring the second state and the third state.

Abstract: Methods, devices, and computer program products enable the embedding of forensic marks in a host content that is in compressed domain. These and other features are achieved by preprocessing of a host content to provide a plurality of host content versions with different embedded watermarks that are subsequently compressed. A host content may then be efficiently marked with forensic marks in response to a request for such content. The marking process is conducted in compressed domain, thus reducing the computational burden of decompressing and re-compressing the content, and avoiding further perceptual degradation of the host content. In addition, methods, devices and computer program products are disclosed that obstruct differential analysis of such forensically marked content.

Abstract: Methods of audio coding are described in which an excitation signal for a first frequency band of the audio signal is used to calculate an excitation signal for a second frequency band of the audio signal that is separated from the first frequency band.

Abstract: After a call is established between two stations using a codec that has been negotiated during call setup, in-band signaling may be used between the two stations to change the codec that is to be used. The in-band signals are indicative that the station that is transmitting the in-band signals can operate with a second codec and are used to probe whether the receiving station can also operate with that second codec. If the receiving station detects and reacts to the in-band signals, then both stations change to communicate with the second codec. The second codec has compatible packet sizes of the deployed (originally negotiated) codec without any need of infrastructure upgrade and/or quality compromise to legacy phone users (i.e., stations that cannot operate with the second codec).

Abstract: Methods, devices, and computer program products enable the embedding of forensic marks in a host content that is in compressed domain. These and other features are achieved by preprocessing of a host content to provide a plurality of host content versions with different embedded watermarks that are subsequently compressed. A host content may then be efficiently marked with forensic marks in response to a request for such content. The marking process is conducted in compressed domain, thus reducing the computational burden of decompressing and re-compressing the content, and avoiding further perceptual degradation of the host content. In addition, methods, devices and computer program products are disclosed that obstruct differential analysis of such forensically marked content.

Abstract: Methods, devices, and computer program products enable the embedding of forensic marks in a host content that is in compressed domain. These and other features are achieved by preprocessing of a host content to provide a plurality of host content versions with different embedded watermarks that are subsequently compressed. A host content may then be efficiently marked with forensic marks in response to a request for such content. The marking process is conducted in compressed domain, thus reducing the computational burden of decompressing and re-compressing the content, and avoiding further perceptual degradation of the host content. In addition, methods, devices and computer program products are disclosed that obstruct differential analysis of such forensically marked content.

Abstract: Methods, devices, and computer program products enable the embedding of forensic marks in a host content that is in compressed domain. These and other features are achieved by preprocessing of a host content to provide a plurality of host content versions with different embedded watermarks that are subsequently compressed. A host content may then be efficiently marked with forensic marks in response to a request for such content. The marking process is conducted in compressed domain, thus reducing the computational burden of decompressing and re-compressing the content, and avoiding further perceptual degradation of the host content. In addition, methods, devices and computer program products are disclosed that obstruct differential analysis of such forensically marked content.

Abstract: After a call is established between two stations using a codec that has been negotiated during call setup, in-band signaling may be used between the two stations to change the codec that is to be used. The in-band signals are indicative that the station that is transmitting the in-band signals can operate with a second codec and are used to probe whether the receiving station can also operate with that second codec. If the receiving station detects and reacts to the in-band signals, then both stations change to communicate with the second codec. The second codec has compatible packet sizes of the deployed (originally negotiated) codec without any need of infrastructure upgrade and/or quality compromise to legacy phone users (i.e., stations that cannot operate with the second codec).

Abstract: Methods of audio coding are described in which an excitation signal for a first frequency band of the audio signal is used to calculate an excitation signal for a second frequency band of the audio signal that is separated from the first frequency band.

Abstract: Methods, devices, and computer program products enable the embedding of forensic marks in a host content that is in compressed domain. These and other features are achieved by preprocessing of a host content to provide a plurality of host content versions with different embedded watermarks that are subsequently compressed. A host content may then be efficiently marked with forensic marks in response to a request for such content. The marking process is conducted in compressed domain, thus reducing the computational burden of decompressing and re-compressing the content, and avoiding further perceptual degradation of the host content. In addition, methods, devices and computer program products are disclosed that obstruct differential analysis of such forensically marked content.

Abstract: The average amplitude of the samples in a signal sample sequence X in a floating-point format is determined for each frame. If the average amplitude is greater than a predetermined value, an integer formatting part 12 converts the sequence X into a signal sample sequence Y in a 16-bit integer format by truncation, a compressing part 13 codes the sequence Y to output a code sequence Ca, a difference producing part 14 produces a difference signal Z that corresponds to the difference between the signal sample sequence X and a sequence Y? in the floating-point format converted from the sequence Y, and a compressing part 17performs entropy coding on the least significant (23?n) bits of a mantissa M of the difference signal Z, which is determined by the number of bits n following the most significant “1” in each sample in the sequence Y, and outputs a code sequence Cb. If the average amplitude is not greater than the predetermined value, the sequence X is directly losslessly coded by a compressing part 121.

Abstract: The average amplitude of the samples in a signal sample sequence X in a floating-point format is determined for each frame. If the average amplitude is greater than a predetermined value, an integer formatting part 12 converts the sequence X into a signal sample sequence Y in a 16-bit integer format by truncation, a compressing part 13 codes the sequence Y to output a code sequence Ca, a difference producing part 14 produces a difference signal Z that corresponds to the difference between the signal sample sequence X and a sequence Y? in the floating-point format converted from the sequence Y, and a compressing part 17performs entropy coding on the least significant (23?n) bits of a mantissa M of the difference signal Z, which is determined by the number of bits n following the most significant “1” in each sample in the sequence Y, and outputs a code sequence Cb. If the average amplitude is not greater than the predetermined value, the sequence X is directly losslessly coded by a compressing part 121.

Abstract: Signal samples X in a floating-point format, each of which is composed of 1 bit of sign S, 8 bits of exponent E and 23 bits of mantissa M, are converted through truncation by an integer formatting part 12 into signal samples Y in a 24-bit integer format, the integer-value signal samples Y are coded by a compressing part 13 into a code sequence Ca, and the code sequence Ca is output. According to the number of digits n following the most significant “1” in the integer-value signal sample Y, a difference producing part 14 extracts the least significant (23?n) bits from the mantissa M of the input signal sample X to form a difference signal Z, and a compressing part 17 performs entropy coding of the difference signal Z to produce a code sequence Cb and outputs the code sequence Cb. Alternatively, the difference signal Z may be output as it is, rather than being compressed.

Abstract: A pneumatic card transport system is disclosed. The system is configured to use pressurized air to transport a card inserted to a conveying duct inside a card passageway assembly from a first end to a second end. Air nozzles are configured to release the pressurized airstreams at an angle relative to the conveying duct so that the card is essentially floating when traveling along the conveying duct. Hence, the card makes zero or minimum contact with the inner surface of the conveying duct. This will not only reduce the wear and tear of the card, but also reduces the traveling time inside the conveying duct.

Abstract: The average amplitude of the samples in a signal sample sequence X in a floating-point format is determined for each frame. If the average amplitude is greater than a predetermined value, an integer formatting part 12 converts the sequence X into a signal sample sequence Y in a 16-bit integer format by truncation, a compressing part 13 codes the sequence Y to output a code sequence Ca, a difference producing part 14 produces a difference signal Z that corresponds to the difference between the signal sample sequence X and a sequence Y? in the floating-point format converted from the sequence Y, and a compressing part 17 performs entropy coding on the least significant (23?n) bits of a mantissa M of the difference signal Z, which is determined by the number of bits n following the most significant “1” in each sample in the sequence Y, and outputs a code sequence Cb. If the average amplitude is not greater than the predetermined value, the sequence X is directly losslessly coded by a compressing part 121.

Abstract: The average amplitude of the samples in a signal sample sequence X in a floating-point format is determined for each frame. If the average amplitude is greater than a predetermined value, an integer formatting part 12 converts the sequence X into a signal sample sequence Y in a 16-bit integer format by truncation, a compressing part 13 codes the sequence Y to output a code sequence Ca, a difference producing part 14 produces a difference signal Z that corresponds to the difference between the signal sample sequence X and a sequence Y? in the floating-point format converted from the sequence Y, and a compressing part 17 performs entropy coding on the least significant (23?n) bits of a mantissa M of the difference signal Z,. which is determined by the number of bits n following the most significant “1” in each sample in the sequence Y, and outputs a code sequence Cb. If the average amplitude is not greater than the predetermined value, the sequence X is directly losslessly coded by a compressing part 121.

Abstract: Digital signal samples X in a floating-point format, each of which is composed of 1 bit of sign, 8 bits of exponent E and 23 bits of mantissa M, are converted through rounding by an integer formatting part 12 into digital signal samples Y in an integer format, the sequence of the digital signal samples Y is losslessly compression-coded by a compressing part 13 into a code sequence Ca, and the code sequence Ca is output. The digital signal samples Y are converted by a floating point formatting part 15 into digital signal samples X? in the floating-point format, a difference signal ?X indicating the difference between the digital signal sample X? and the digital signal sample X is determined by a subtraction part 16, the difference signal ?X is losslessly coded, and the resulting code sequence Cb is output.