Abstract: Surface-mount technology (SMT) devices and related methods. In some embodiments, an SMT device can include an electrical element and a plurality of terminals connected to the electrical element. The SMT device can further include a body configured to support the electrical element and the plurality of terminals. The body can have a rectangular cuboid shape with a length, a width, and a height that is greater than the width. The body can include a base plane configured to allow surface mounting of the SMT device. In some embodiments, the SMT device can be, for example, a capacitor, an inductor, or a resistor.

Abstract: Temperature compensated circuits for radio-frequency (RF) devices. In some embodiments, an RF circuit can include an input node and a plurality of components interconnected to the input node and configured to yield an impedance for an RF signal at the input node. At least one of the plurality of components can be configured to have temperature-dependence within a temperature range so that the impedance varies to compensate for an effect of temperature change. Such an RF circuit can be, for example, an impedance matching circuit implemented at an output of a power amplifier. The component having temperature-dependence can include a temperature-dependent capacitor such as a ceramic capacitor.

Abstract: In one embodiment, a computer device comprises a back cover in the shape of a plate and a basic module where the back cover is removably attachable to and detachable from a basic module of the computing device by the user by an attachment portion. In this manner designs of and on the back cover may be easily customized to the individual tastes of consumers. Another embodiment of the invention is directed to the back cover and the attachment portion of the type described above. An optional front cover may be added and connected to the back cover about a hinge. The front cover can serve as a stand for the computer display when rotated about the hinge away from the display screen. The optional front cover may also be connected to the back cover by a side cover to form a device resembling a hard bound book.

Abstract: A tongue cleaning device comprising a tongue cleaning surface supported for tongue cleaning by running the surface across the tongue, a reservoir for a tongue cleaning fluid, means to dispense the fluid either onto the tongue cleaning surface, or directly onto the user's tongue, with a cover part, the tongue cleaning surface and cover part being relatively moveable between a position in which the tongue cleaning surface is exposed for use and a position in which the tongue cleaning surface is covered by the cover part.

Abstract: A method and apparatus for back-end processing a recordable media production job after it has been generated and sent to a recordable media production system is described that intercepts the image file generation at a low level within the recordable media production system and allows for adding, deletion and modification of the underlying data files and/or modification of the production job itself under control of an external user defined process, such as an application, DLL, script or plug-in. This interception of the image file generation occurs before the final image is assembled and handed off to the media recorder/producer to be written to the recordable media and is invoked at multiple stages of reading the production job edit list, allowing changes to occur at each stage of the imaging or pre-mastering (file system creation) process.

Abstract: A tongue cleaning device comprising a tongue cleaning surface supported for tongue cleaning by running the surface across the tongue, a reservoir for a tongue cleaning fluid, means to dispense the fluid either onto the tongue cleaning surface, or directly onto the user's tongue, with a cover part, the tongue cleaning surface and cover part being relatively moveable between a position in which the tongue cleaning surface is exposed for use and a position in which the tongue cleaning surface is covered by the cover part.

Abstract: A compactly stored word list that includes a directed graph data structure is used for word to number (W/N) and number to word (N/W) mapping. Each word accepted by the data structure is mapped to a unique corresponding number within a dense set of numbers ranging from zero to one less than the total number of acceptable words. Some common suffixes are collapsed into shared branches, which is possible because the numbers are not stored within the word list. In addition, some branches of the data structure can be skipped during mapping because of information associated with branch points. That information permits the mapping scan to continue with a next branch or with an alternative branch. That information also indicates the number of suffix endings in the next branch; this number is used to keep a count of the word endings during word to number mapping; it is also used both to determine whether to continue with the next branch and also to reduce the number being mapped during number to word mapping.

Abstract: A compactly stored word list that includes a directed graph data structure is used for word to number (W/N) and number to word (N/W) mapping. Each word accepted by the data structure is mapped to a unique corresponding number within a dense set of numbers ranging from zero to one less than the total number of acceptable words. Some common suffixes are collapsed into shared branches, which is possible because the numbers are not stored within the word list. In addition, some branches of the data structure can be skipped during mapping because of information associated with branch points. That information permits the mapping scan to continue with a next branch or with an alternative branch. That information also indicates the number of suffix endings in the next branch; this number is used to keep a count of the word endings during word to number mapping; it is also used both to determine whether to continue with the next branch and also to reduce the number being mapped during number to word mapping.

Abstract: A method and apparatus for applying morphological image criteria that identify image units in an undecoded document image having significant information content, and for retrieving related data that supplements the document either from elsewhere within the document or a source external to the document. The retrieved data can result from character code recognition or template matching of the identified significant image units, or the retrieved data can result directly from an analysis of the morphological image characteristics of the identified significant image units. A reading machine can allow a user to browse and select documents or segments thereof, and to obtain interactive retrieval of documents and supplemental data.

Abstract: The present invention solves a number of problems in using stems (canonical indicators of word meanings) in full-text retrieval of natural language documents, and thus permits recall to be improved without sacrificing precision. It uses various arrangements of finite-state transducers to accurately encode a number of desirable ways of mapping back and forth between words and stems, taking into account both systematic aspects of a language's morphological rule system and also the word-by-word irregularities that also occur. The techniques described apply generally across the languages of the world and are not just limited to simple suffixing languages like English. Although the resulting transducers can have many states and transitions or arcs, they can be compacted by finite-state compression algorithms so that they can be used effectively in resource-limited applications.

Abstract: An FSM data structure is encoded by generating a transition unit of data corresponding to each transition which leads ultimately to a final state of the FSM. Information about the states is included in the transition units, so that the encoded data structure can be written without state units of data. The incoming transition units to a final state each contain an indication of finality. The incoming transition units to a state which has no outgoing transition units each contain a branch ending indication. The outgoing transition units of each state are ordered into a comparison sequence for comparison with a received element, and all but the last outgoing transition unit contain an alternative indication of a subsequent alternative outgoing transition.

Abstract: An FSM data structure is encoded by generating a transition unit of data corresponding to each transition which leads ultimately to a final state of the FSM. Information about the states is included in the transition units, so that the encoded data structure can be written without state units of data. The incoming transition units to a final state each contain an indication of finality. The incoming transition units to a state which has no outgoing transition units each contain a branch ending indication. The outgoing transition units of each state are ordered into a comparison sequence for comparison with a received element, and all but the last outgoing transition unit contain an alternative indication of a subsequent alternative outgoing transition.

Abstract: An FSM data structure is encoded by generating a transition unit of data corresponding to each transition which leads ultimately to a final state of the FSM. Information about the states is included in the transition units, so that the encoded data structure can be written without state units of data. The incoming transition units to a final state each contain an indication of finality. The incoming transition units to a state which has no outgoing transition units each contain a branch ending indication. The outgoing transition units of each state are ordered into a comparison sequence for comparison with a received element, and all but the last outgoing transition unit contain an alternative indication of a subsequent alternative outgoing transition.

Abstract: A compactly stored word list that includes a directed graph data structure is used for word to number (W/N) and number to word (N/W) mapping. Each word accepted by the data structure is mapped to a unique corresponding number within a dense set of numbers ranging from zero to one less than the total number of acceptable words. Some common suffixes are collapsed into shared branches, which is possible because the numbers are not stored within the word list. In addition, some branches of the data structure can be skipped during mapping because of information associated with branch points. That information permits the mapping scan to continue with a next branch or with an alternative branch. That information also indicates the number of suffix endings in the next branch; this number is used to keep a count of the word endings during word to number mapping; it is also used both to determine whether to continue with the next branch and also to reduce the number being mapped during number to word mapping.

Abstract: A compactly stored word list that includes a directed graph data structure is used for word to number (W/N) and number to word (N/W) mapping. Each word accepted by the data structure is mapped to a unique corresponding number within a dense set of numbers ranging from zero to one less than the total number of acceptable words. Some common suffixes are collapsed into shared branches, which is possible because the numbers are not stored within the word list. In addition, some branches of the data structure can be skipped during mapping because of information associated with branch points. That information permits the mapping scan to continue with a next branch or with an alternative branch. That information also indicates the number of suffix endings in the next branch; this number is used to keep a count of the word endings during word to number mapping; it is also used both to determine whether to continue with the next branch and also to reduce the number being mapped during number to word mapping.