Abstract: A replaceable key structure includes a key holder and a circuit board. The key holder is disposed above a circuit board. The key holder is formed with a mounting slot for selectively receiving a first key module or a second key module therein. A magnetic sensor and a contact connector are disposed on the circuit board positionally corresponding to the mounting slot of the key holder. The first key module has a shaft, and a magnetic element disposed on the bottom of the shaft. The magnetic sensor can output an analog signal when the magnetic element approaches. The second key module has a trigger switch which has two electrical terminals disposed on the bottom surface of the second key module. When the second key module is installed in the mounting slot, the electrical terminals can be electrically connected to the contact connector.

Abstract: Techniques for determining the relationships between a network of services include determining encoding of text fields received and transmitted by the services. Correspondence between the bytes representing a text string in a first data field and encoding data that associates byte characteristics with encoding schemes may be used to determine the encoding scheme associated with the first data field. Other data fields that were transmitted or received close-in-time to the first data field and have a value within a threshold similarity of that of the first data field may be determined to be associated with the first data field. Subsequent to a modification to the network of services, if the encoding of one or more data fields changes or if the associations between data fields change, the particular services that were affected by the modification may be determined based on the differences in encoding schemes and data field associations.

Abstract: A print device prints a document with a security marking in a microtext font. A scanning device scans the security marking, and an optical character recognition (OCR) engine attempts to recognize the characters in the security marking. The system the generates an encoding in which each character of the font is mapped to a character string made up only of characters that the OCR engine could recognize at or above a minimum recognition threshold. Then, when generating a new document with a new security marking in the microtext font, the system will use the encoding to replace each character in the security marking with its representation from the encoding so that the scanner and OCR engine can decode the security marking.

Abstract: This invention relates to a system, method and computer program product for encoding an input string of binary characters including: a cellular data structure definition including a starting empty cell; one or more path definitions defining paths through the data structure; a character reading and writing engine for writing a binary character to an empty cell with a predefined initial position; a next cell determination engine for determining a next empty cell by methodically checking cells along one of the paths in the data structure until an empty cell is located; a loop facilitator for looping back to the writing next character step and the determining next cell step until there are no more data characters or a next empty cell is not determined; and a serialization deserialization engine for methodically serializing the data structure into a one dimensional binary string of characters representing an encoded string of alphanumeric characters.

Abstract: A pair of adjacent characters in a plain ASCII data stream is examined for a condition that the pair contains a consonant followed by one of a set of characters, or a vowel followed by one of the set of characters. The set of characters is selected only from vowels and the space character. If the condition is satisfied, the pair is encoded as a corresponding extended ASCII code. If the condition is not satisfied, the first character of the pair is emitted as a corresponding plain ASCII code, and a next pair is formed with the second character of the (previous) pair as the first character and a next character of the plain ASCII stream as the second character. The next pair as well as further pairs are examined for the condition and correspondingly processed. Compression of the plain ASCII data stream is thereby achieved.

Abstract: A data processing apparatus that is capable of reducing the garbling of characters caused by the difference among the character codes when setting data are transferred to another apparatus by the import-export function. A storage unit stores setting data for the data processing apparatus. A receiving unit receives an instruction for exporting the setting data stored in the storage unit. A converting unit converts Unicode data included in the setting data into character code data of language, which is set to the data processing apparatus. An export unit exports the character code data converted by the converting unit and the Unicode data.

Abstract: A hybrid mechanism whereby hardware acceleration is combined with software such that the compression rate achieved is significantly increased while maintaining the original compression ratio (e.g., using full DHT and not SHT or an approximation). The compression acceleration mechanism is applicable to a hardware accelerator tightly coupled with the general purpose processor. The compression task is divided and parallelized between hardware and software wherein each compression task is split into two acceleration requests: a first request that performs SHT encoding using hardware acceleration and provides post-LZ frequency statistics; and a second request that performs SHT decoding and DHT encoding using the DHT generated in software.

Abstract: A system and a method for remote household appliance control based on a mobile communication network are provided. The system includes: a remote control access device and a remote control executor. The method includes: saving a first corresponding relationship between an infrared code type and identification information of a corresponding controlled household appliance and an operation act; and after receiving an unstructured supplementary service data (USSD) session request from a mobile terminal, sending a locally stored USSD menu to the mobile terminal and starting a USSD session with the mobile terminal; after receiving a USSD session content related to performing an operation act on a household appliance from the mobile terminal, transmitting an infrared control signal according to the corresponding infrared code type searched out according to the first corresponding relationship.

Abstract: A system and method of transmitting electronic voucher through short message. The method of transmitting an electronic voucher through a short message includes converting an electronic voucher to be transmitted into a bit stream; mapping each n-bits of the bit stream to any one text character of one of a plurality of text character groups, wherein text characters in each of the text character groups have at least one same or similar feature, and bit number n corresponding to each text character depends on the number m of the text character groups; arranging the text characters obtained through the mapping into a character sequence; and transmitting the character sequence through a short message. The present invention greatly reduces the cost for issuing an electronic voucher, significantly increases the convenience and apparently improves the safety and the stability.

Abstract: The present disclosure is directed towards systems and methods for compressing messages, such as Short Message Service (SMS) or text messages between fixed or mobile devices through communications networks. The data of, for example, SMS messages is compressed and forwarded through a communication network to an appliance having a processing unit. The appliance decompresses the message and controls its delivery through network communication devices, where the decompressed SMS message is forwarded to its destination.

Abstract: A method for parallel context modeling through reordering the bits of an input sequence to form groups of bits in accordance with a context model-specific reordering schedule. The reordering schedule is developed such that the groups of bits are formed to satisfy two conditions: first, that the context for each of the bits in a group of bits is different from the context of each of the other bits in that group, and the context of each of the bits in that group is determined independently from each of the other bits in that group. The parallel context modeling may be used in encoding or decoding operations.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying misrepresented characters in strings of text. A computer system receives text that includes characters identified as being encoded in UTF-8. The characters are represented as code point values, each code point value representing one character in the text. The computer system makes a determination that the text likely includes characters incorrectly converted from Win-1252 to UTF-8 by comparing the code point values that represent the text with test values. Based on the comparison, the computer system identifies sequences of characters in the text that was likely incorrectly converted.

Abstract: An encoding method comprises generating a character map of an alphanumeric character string, identifying runs of like character type symbols in sequential positions, and removing the runs of character type symbols from the character map. The center for the center infix run is determined, and the characters of each character type are encoded into binary encoded substrings. A decoding method comprises parsing the one or more run fields in the alphanumeric header to determine a number of characters of each type of a plurality of character types represented in the binary encoded string, generating a character map having a string of character type symbols representing the binary encoded string, including determining a reduced character map, centering the character type symbols for a center infix run about the center of the reduced character map, completing a final character map, and decoding each binary encoded string.

Abstract: A high-rate constrained code is provided to encode/decode channel data. A transformer translates binary channel data into an arbitrary alphabet size. The transformer selects an indicator word and makes forbidden prefix substitutions in the data to be transformed. A finite-state encoder imposes some user-defined constraint on the transformed data before the data is transferred to the channel. The high-rate constrained coding technique may be used to produce high-rate DC-limited and run-length-limited codes. The high-rate code can be used in tandem with error-correcting codes.

Abstract: In described embodiments, a method of generating an identifier for a disk includes the steps of requesting an ASCII identification string for the disk and generating a padded string by processing the ASCII identification string into a predetermined number of bytes. The padded string is divided into portions and an encoded value is generated for each portion. The two or more encoded values for the portions are combined into a candidate value compatible with a World-Wide Name (“WWN”). The candidate value is compared to a list of previously generated candidate values and if the candidate value differs from the values in the list, the candidate value is included in the list of generated values and the candidate value is provided as the system-wide name for the disk.

Abstract: The invention relates to a method to efficiently transmit a digital message over a unidirectional optical link, such as the link between a computer screen and a security token equipped with photosensitive elements. It is an object of this invention to provide a source coding scheme that is optimized for transmissions of alphanumerical data containing frequent occurrences of numerals and less frequent occurrences of non-numerical data. This is achieved by using a modified Huffman code for source coding, consisting of a nibble-based prefix-free binary code. The output of the coder is efficiently mapped onto a 6B4T channel code, wherein unused ternary codewords can be used to signal data-link layer events. This efficient signalling of data-link layer events, in turn, allows for a synchronization scheme based on repeated transmissions of a finite-length message, combined with an out-of-band clock signal.

Abstract: A system, method and computer program product for translations in a computer system. The system includes a general purpose register containing a base address of an address translation table. The system also includes a millicode accessible special displacement register configured to receive a plurality of elements to be translated. The system further includes a multiplexer for selecting a particular one of the plurality of elements from the millicode accessible special displacement register and for generating a displacement or offset value. The system further includes an address generator for creating a combined address containing the base address from the general purpose register and the generated displacement or offset value.

Abstract: An encoding method comprises generating a character map of an alphanumeric character string, identifying runs of like character type symbols in sequential positions, and removing the runs of character type symbols from the character map. The center for the center infix run is determined, and the characters of each character type are encoded into binary encoded substrings. A decoding method comprises parsing the one or more run fields in the alphanumeric header to determine a number of characters of each type of a plurality of character types represented in the binary encoded string, generating a character map having a string of character type symbols representing the binary encoded string, including determining a reduced character map, centering the character type symbols for a center infix run about the center of the reduced character map, completing a final character map, and decoding each binary encoded string.

Abstract: A data processing system is provided that includes applications, databases, encryption engines, and decryption engines. Encryption and decryption engines may be used to perform format-preserving encryption on data strings stored in a database. Applications may be used to embed information in data strings. Information may be embedded by using a character set that is larger than a character set being used by a data string. A data string may be converted into a larger character set, analogous to converting a number from a lower base to higher base. Such a conversion may shorten a data string, allowing information to be embedded as appended characters.

Abstract: A high-rate constrained code is provided to encode/decode channel data. A transformer translates binary channel data into an arbitrary alphabet size. The transformer selects an indicator word and makes forbidden prefix substitutions in the data to be transformed. A finite-state encoder imposes some user-defined constraint on the transformed data before the data is transferred to the channel. The high-rate constrained coding technique may be used to produce high-rate DC-limited and run-length-limited codes. The high-rate code can be used in tandem with error-correcting codes.

Abstract: A method for communicating data is provided that includes receiving a plurality of bits associated with a communications flow and applying a variable size codebook for stateful compression or for stateless compression. The method also includes determining if a match exists between the plurality of bits and a selected one of a plurality of bit patterns and communicating a payload present (PP) header bit pattern corresponding to the selected bit pattern in place of the plurality of bits associated with the communications flow.

Abstract: A high-rate constrained code is provided to encode/decode channel data. A transformer translates binary channel data into an arbitrary alphabet size. The transformer selects an indicator word and makes forbidden prefix substitutions in the data to be transformed. A finite-state encoder imposes some user-defined constraint on the transformed data before the data is transferred to the channel. The high-rate constrained coding technique may be used to produce high-rate DC-limited and run-length-limited codes. The high-rate code can be used in tandem with error-correcting codes.

Abstract: The described embodiments provide a system that encodes a sequence of integers using a variable-length compression technique. During operation, the system scans the sequence of integers and observes the sizes of the integers to determine a threshold value, K, from the observed sizes. For a given integer of length N bits, if N?K is greater than zero, the system generates a tag for the encoded integer comprising a sequence of N?K zeros followed by a one, and generates a set of remaining bits for the encoded integer as a sequence of the N?1 least-significant bits which make up the integer. Otherwise, the system generates a tag for the encoded integer as a single one, and generates a set of remaining bits for the encoded integer by padding the N bits which make up the integer with zeros so that the set of remaining bits is K bits in length.

Abstract: Computer-implemented character conversion methods. Characters encoded in a first character set are acquired. The first character set conforms to Unicode Worldwide Character Standard and each character is encoded in first character codes according to the first character set. The first character codes of each character are then converted to numeric character references conforming to Hypertext Markup Language. The numeric character references of each character are stored using a second character set for encoding.

Abstract: A method of determining Unicode values corresponding to the text in digital documents includes: providing a digital document containing information related to the text in the document, the information including at least one set of data selected from the group consisting of: the numerical character code comprised by a single byte value or a sequence of multiple bytes, the glyph name corresponding to the character code for simple fonts, the code-to-Unicode mapping provided by a ToUnicode CMap, and font outline data embedded in the document; obtaining the information related to the text from the document; and determining the Unicode values corresponding to a specific code of a specific font on a per-glyph basis by executing a cascade of determination steps for each code separately, the cascade being executed in a predetermined sequence using different sources of information.

Abstract: Methods and systems for detecting fraud based on velocity counts are disclosed.

Abstract: A system and a method for storing test data are provided. The system includes a memory device and a computer operably communicating with the memory device. The computer is configured to receive test data comprising various data types. The computer is further configured to convert the various data types into 8-bit characters that are stored in a character array. The character array can be stored in a memory device utilizing a single write command.

Abstract: Information, such as ticket information is encoded, for transmission of the encoded information to a device that can display the encoded information as visible alphanumeric characters. Original information is converted into a binary format then separated into x bit binary words, where x is the same as a maximum number of bits data required by every data character in a pre-determined data character map. The binary words are formed into a sequence of characters using a data character map. Special marker characters are inserted into the sequence. The special characters demarcate the sequence into sets of characters separated by one or more special marker characters. Line feed command characters are also inserted. The encoded information is transmitted to a client device that displays it as a rectangular array of characters bounded by the special marker characters.

Abstract: A fixed-size codeword table is generated for decompressing GIF encoded data. The fixed-size codeword table is defined to store a codeword string and a codeword length for each of a number of codewords. The codeword string is defined by a codeword previously represented in the codeword table and a character. The codeword length represents a total number of characters in the codeword string. A current codeword in the GIF encoded data is translated according to the codeword table to generate a series of characters represented by the current codeword. The generated series of characters is stored in a computer memory space.

Abstract: ACARS systems and methods for compiling messages includes a processing device configured for mapping eight-bit characters in an eight-bit character stream into a six bit map to create a generally six-bit character stream. The processing device is further configured for encoding the generally six-bit character stream into an eight-bit character stream. Optionally, the processing device includes a look-up table configured to retrieve substituted six-bit characters in response to the presence of the eight-bit character received at a processor.

Abstract: A character-information conversion apparatus is configured to process character information including attribute information indicating a coding system and character codes conforming to the coding system and for converting the character codes into characters. The apparatus includes a key operation unit, an EEPROM, and a controlling unit. The key operation unit specifies a coding system to be applied to decode character codes conforming to a coding system other than a normally applied coding system. The EEPROM stores information indicating the coding system corresponding to the received input. The controlling unit refers to the attribute information and determines which coding system the character codes conforms to, converts the character codes into characters based on the information stored in the EEPROM when it is incapable of determining the coding system or when it is determined that the coding system differs from the normally applied coding system.

Abstract: A method of detecting the encoding utilized in an electronic document includes testing the text strings to determine whether the electronic document contains only text strings having legal numeric codes. A statistical analysis of the text strings is then conducted to provide a mapping of legally coded candidates. The legally coded candidates are ranked and combined with an expected ranking of legally coded candidates to provide a most probable character mapping.

Abstract: An improved method for determining character codes for a numerical value retrieves two or more character codes for each iteration of the method.

Abstract: Methods, apparatus and data structures are described for representing, storing and manipulating date/time information in an 8-byte timestamp format. By limiting date/time information to a predetermined range and specifying a single date/time structure, an 8-byte timestamp is generated that is capable of conveying the same operational information as conventional 24-byte timestamps, yet which can be more efficiently generated, more efficiently stored, and more efficiently evaluated in boolean operations.

Abstract: Methods, apparatus and data structures are described for representing, storing and manipulating date/time information in an 8-byte timestamp format. By limiting date/time information to a predetermined range and specifying a single date/time structure, an 8-byte timestamp is generated that is capable of conveying the same operational information as conventional 24-byte timestamps, yet which can be more efficiently generated, more efficiently stored, and more efficiently evaluated in boolean operations.

Abstract: Methodology that enables an email sender to view and send a message in substantially any desired character set, and apparatus to perform the methodology. The methodology and apparatus taught herein also enable email software to automatically display a message utilizing the proper character set or sets. This methodology and apparatus further enables mail software to automatically include in the mail message sufficient information to meet the previously defined needs utilizing standard MIME conventions. According to one aspect of the present invention, there is provided a flexible flat file syntax that holds per-locale information about mail, based on MIME conventions. The information in the file is used to build a database that may be used by mail clients through a new API. The contents of the file can also be configured by users to fit their individual and specific mail needs.

Abstract: A system and method for encoding an input sequence of code points to produce an output sequence of bytes that is compressed, but has the same relative binary order as the original sequence.

Abstract: A retrievable memory is provided with a priority encoder. The priority encoder is constituted by encoder units. Each of the encoder units is constituted by an inverter, N-channel MOS transistors and an AND gate. Upon receipt of a signal of H level from a matching line, the encoder unit outputs a signal of H level to a word line, and also outputs a signal of L level to a matching line active signal line MLA1. Then, the encoder units respectively output signals of L level to the word lines. Consequently, even when a plurality of results of a retrieving process are obtained, it is possible to output single data.

Abstract: The present invention provides a data compression method in which a plurality of consecutive characters of a data string to be compressed are set as a character string to be searched for. Bits of a bit string representing the set character string are allocated to at least two codewords. Thus, first and second searching codewords are generated. These first and second codewords are used as array addresses. Fist and second array tables are prepared, in which information on the past occurrence positions of the set character string is previously entered as the contents thereof. When the first and second codewords are generated from the character string to be compressed, the first and second array tables are looked up by using these codewords as the addresses of the arrays. When results of looking up these tables match with each other, it is found that the set character string occurred in the past.

Abstract: A high-penetration transmission method uses a compact character set for encoding an alphanumeric message, in which the signal margin is increased by a combination of bit repetition and a relatively small increase in power. The combination of bit repetition and a relatively small increase in power with a encoding via a compact character set avoids unacceptable delay characteristics. Moreover, the combination of repetition and a relatively small increase in power with the compact character set of the present invention avoids the co-channel interference problems of systems which rely solely on a power increase to increase the signal margin, as less power increase is required to obtain the same increase in signal margin for a given delay time. In one embodiment, a mobile radiocommunication system is provided with a short message service feature for transmitting alphanumeric messages to and from a mobile unit.

Abstract: A product with stored non-sequential data may be provided using a method that codes the data to a coding pattern using at least one sequence with symbols. The coding pattern may be configured such that an arbitrary subsequence of a predetermined magnitude of the sequence unambiguously defines the position of the subsequence in the sequence. The coding pattern may be reproduced on a product. An apparatus may be adapted to record and decode the coding pattern.

Abstract: Techniques to converting source text (e.g., Unicode text) to multiple different encodings are disclosed. The disclosed techniques operate without any font or style information that could suggest the original encoding types. For a given source text, the techniques intelligently determine which of a variety of available target encodings are most appropriate. The determination of the most appropriate target encodings is flexible enough to accommodate different criteria or tolerance levels in performing the conversion as may be desired. The conversion out of Unicode into multiple different encodings also requires the determination of where and when to switch between the available target encodings. Also disclosed is a technique to automatically identify those target encoding that are available.

Abstract: The machine involves code wheels in cascade or in a maze with random or mixed circuits which operate a printing device to print the cipher conjugate of the letter on an operated key when the keyboard is connected to one end of the code wheel maze, and to print the plain conjugate of the letter in cipher when a key bearing such letter is operated with the keyboard connected to the other end of the code wheel maze. The printer is connected to the end of the code wheel maze opposite the end to which the keyboard is connected in both cases.

Abstract: The cryptographic system automatically and continuously changes the cipher equivalents representing plaintext characters so as to prevent any periodicity in the relationship. The system has a series of juxtaposed, rotatable, connection changing mechanisms to provide a large number of alternative paths for the passage of an electric current corresponding to a message character. Further, the system has parts for the irregular and permutative displacements of the members of a set of circuit changing mechanisms to thwart cryptanalysis. The juxtaposed cipher commutators are controlled by cam wheels of different diameters.

Abstract: The crytographic system automatically and continuously changes the cipher equivalents representing plaintext characters so as to prevent any periodicity in the relationship. The system has a series of juxtaposed, rotatable, connection changing mechanisms to provide a large number of alternative paths for the passage of an electric current corresponding to a message character. Further, the system has parts for the irregular and permutative displacements of the members of a set of circuit changing mechanisms to thwart cryptanalysis.

Abstract: A data compressing/decompressing apparatus is suitable for compressing data containing plural-byte characters, for instance, a Japanese language text. The data compressing/decompressing apparatus owns a homonym dictionary in which KANJI-character idioms, KANJI-character-reading, and homonym discrimination information are stored in correspondence with each other. This data compressing/decompressing apparatus converts a KANJI-character idiom contained in declarative sentence data into phonetic data, and further compresses this phonetic data to output the compressed phonetic data. The phonetic data is such data that this KANJI-character idiom is replaced by information constituted by character number discrimination information indicative of the character number about KANJI-character idiom reading, the reading thereof, and the homonym discrimination information thereof.

Abstract: An on-screen display system for displaying instructions for guiding a user to utilize various features of a consumer electronics product such as a television receiver or VCR, includes a memory for storing both uncompressed text data and compressed text data, and an associated microprocessor for retrieving the text data, decompressing it if necessary, and presenting it to a display buffer. Text data compression is in part accomplished by a dictionary containing text data representing commonly used text "strings" comprising one or more words which is stored in the memory. Code words related to the location of respective dictionary entries in memory are substituted for respective uncompressed text data.

Abstract: A system and method of transforming information between UCS and EBCDIC-friendly representations comprises a two-stage transformation process using a first stage which transforms a UCS string to and from an intermediate form string, referred to as an I8-string. A second stage transforms the I8-string to and from a string in an EBCDIC-friendly representation. The two stages employ transformations which result in control characters and other selected characters being represented as single octets in the I8 and EBCDIC-friendly strings and the transformations are symmetric in both stages. The second stage can produce EBCDIC-friendly strings in one or more selected EBCDIC encodings.

Abstract: The decimal numbers in ASCII code are converted into base n number codes, where the base n is greater than ten, and then are transmitted between the main control unit and the terminals including servo systems and spindle systems in an automated factory system. The data is thus compressed, and greater number of axes of the numerically controlled devices, etc., can be controlled within a predetermined time length for transmitting the data.

Abstract: Methods and apparatus for entropy decoding are disclosed. Compressed input data representing one or more signals is loaded into one or more registers. A first candidate value for a most probable signal case is prepared from the input data. A second candidate value for a least probable signal case is prepared from the input data. A final signal value for the one or more signals is selected from the first and second candidate values and an output bin value is generated based on the final signal value. A processor readable medium having embodied therein processor readable instructions for implementing the method for entropy decoding is also disclosed. In addition, a method of avoiding a branch instruction in an electronic processing algorithm is disclosed.