String (computer science)

About: String (computer science) is a research topic. Over the lifetime, 19430 publications have been published within this topic receiving 333247 citations. The topic is also known as: str & s.

Interface for deploying wireline tools with non-electric string

Abstract: Embodiments of the present invention generally relate to a method and/or apparatus for deploying wireline tools with a non-electric string In one embodiment, a method of determining a free point of a tubular string stuck in a wellbore includes deploying a tool string in the stuck tubular with a non-electric string The free point assembly includes a battery, a controller, and a free point tool The method further includes activating the free point tool by the controller The free point tool contacts an inner surface of the stuck tubular string The method further includes applying a tensile force and/or torque to the stuck tubular string; and measuring a response of the tubular string with the free point tool

Lossless data compression circuit and method

Abstract: A lossless data compression circuit compares a new data string with a set of comparison data, and produces a sequence of codewords representing a sequence of successive, non-overlapping substrings of the new data string. A shift register stores and shifts the comparison data until all of the characters in the comparison data have been compared with the new data string. A composite reproduction length circuit finds the maximum length string within the set of comparison characters matching substrings of characters in the new data string beginning at each position in the new data string. The composite reproduction length circuit produces a multiplicity of data pairs, one for each position of the new data string. Each data pair comprises a maximum length value, corresponding to the maximum length matching comparison string found for the new data substring starting at the corresponding position, and a pointer value denoting where the maximum length matching comparison string is located in the comparison data. A codeword generator then generates a sequence of codewords representing the new data string, each codeword including one of these data pairs and representing a substring of the new data string. By using N such data compression units in parallel, with each storing an identical new data string, and each unit's shift register storing and shifting a different subset of a specified comparison string, processing time for generating codewords is reduced by a factor of approximately (N-1)/N.

Towards High-Quality Sound Synthesis of the Guitar and String Instruments

Abstract: The sound quality of real-time synthesis based on physical models has so far been inferior to sampling techniques. In this paper we introduce new principles to make model-based sound synthesis of the guitar and other plucked string instruments more attractive from the viewpoint of sound quality. A major improvement is achieved by estimating the model parameters and the excitation signal from the sound of an acoustic instrument. It is shown that the impulse response of the body is included in this excitation. More complex string behavior, including nonlinearities in some instruments, is briefly studied. Furthermore, different aspects of controlling the real-time synthesis model are discussed. High-quality real-time synthesis is shown to be feasible by using a single digital signal processor.

Word recognition using ontologies

Abstract: Systems, and associated apparatus, methods, or computer program products, may use ontologies to provide improved word recognition. The ontologies may be applied in word recognition processes to resolve ambiguities in language elements (e.g., words) where the values of some of the characters in the language elements are uncertain. Implementations of the method may use an ontology to resolve ambiguities in an input string of characters, for example. In some implementations, the input string may be received from a language conversion source such as, for example, an optical character recognition (OCR) device that generates a string of characters in electronic form from visible character images, or a voice recognition (VR) device that generates a string of characters in electronic form from speech input. Some implementations may process the generated character strings by using an ontology in combination with syntactic and/or grammatical analysis engines to further improve word recognition accuracy.

Direct Construction of Compact Directed Acyclic Word Graphs

Abstract: The Directed Acyclic Word Graph (DAWG) is an efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time linear in the length of the string on a fixed alphabet. Our implementation requires half the memory space used by DAWGs.