Showing papers on "Concatenation published in 1984"

Linear unequal error protection codes from shorter codes (Corresp.)

Abstract: The methods for combining codes, such as the direct sum, direct product, and |u|u + v| constructions, concatenation, etc., are extended to linear unequal error protection codes.

Heading for a diphone speech synthesis system for Dutch

Abstract: A survey is given of the progress made in the development of a diphone speech synthesis system for Dutch. Some programs that facilitate concatenation and input of intonation contours are briefly described and the use of 'special' diphones is explained.

A Layered Broadcast Cryptographic System

Abstract: A new type of cryptosystem is presented that may find application in broadcast communication networks and database systems. To date, all proposals for such systems have either been shown to be weak under cryptanalytic attack or to possess undesirable characteristics such as data expansion. The new scheme is a layered system that is a concatenation of SP-networks and Hill broadcast encryption and is referred to as an SP-Hill cryptosystem. Tests carried out on it indicate that the scheme performs well cryptographically.

Combining two-term relations: evidence in support of flat structure.

Abstract: I will summarize here some evidence in support of the hypothesis that the child's early combinations of two-word relations may be described simply as processes of concatenation and deletion. This implies that the utterances so produced will represent flat constructions as opposed to hierarchical ones.

A group-theoretic treatment of Gaussian optics and third-order aberrations

Abstract: Optical systems produce canonical transformations on the phase space of position and direction of light rays. Contractions of this pseudogrup cut the approximation order automatically to the desired terms throughout. The group Is Sp(2,R) accounts for Gaussian optics and for up-to-third order aberrations. Calculations on concatenation of optical components involve rather simple 2x2 -matrix plus 5-vector algebra.

Concatenation of program modules an algebraic approach to the semantic and implementation problems

Abstract: The paper studies the semantic and implementation problems of programming languages which allow module concatenation. Three known languages of that class are Simula-67, Smalltalk and Loglan. The structure of program modules is treated as an algebra. A concise set of algebraic axioms defining this structure is given. The addressing problem is formulated in algebraic terms. The identifier binding rule is reduced to the evaluation of terms in the algebra of modules. The normal form theorem solves the question of this evaluation. The results allow to develop two efficient updating algorithms going beyond standard Dijkstra's algorithm and relevant for this class of languages. The paper ends with the detailed implementation techniques. The correctness of this implementation is proved. All of this allow to construct a new family of running-systems for languages with module concatenation.

외국어 발음의 다섯가지 문제

Abstract: This study analyzes typical errors Korean students make in pronouncing English, characte-rizing the problems they have and showing ways to help solve them. It recognizes five types of mispronunciation: (1)``phonemic`` pronunciation, (2) ``open`` pron-unciation, (3) ``segmental`` pronunciation, (4) ``neutralizing`` pronunciation, and (5) ``floating`` pronunciation. In short, Koreans pronounce English sentences as a simple concatenation of invariable sounds (=phonemes), not as utterances where phonemes are realized in a variety of ways, blended as units such as syllables, phrases and sentences. This study suggests that students recognize and suppress these five types of mispronunciat-ion, and futher, from hte generative viewpoint, see the acquisition of English phonology as internalizing the phonological system of English through systematic learning, not as the acq-nisition of ``habits`` through rote drills.

The CDTWP: A programmable processor for connected word recognition

Abstract: The architecture of a single board processor for executing a variety of frame-by-frame connected pattern matching techniques which use dynamic time warping is described. The connected dynamic time warp processor (CDTWP) will operate with existing hardware presently used for isolated word recognition. The CDTWP receives input in the form of a sequence of LPC-based feature vectors calculated from a spoken string of connected words. Each input vector, presented at a period of 15 msec, is compared with each frame of every reference template and the results are used to continuously update a hypothesized concatenation of reference templates that best matches the input. This comparison and update operation is completed for a given test frame before the next test frame arrives 15 msec later, and as a result, the CDTWP may be used to recognize the earlier portions of a connected string before the later portions have been spoken. The CDTWP is an experimental tool to examine a class of connected word recognition algorithms and architectures in real time. As a result, it is designed to be programmable and to fit within an existing word recognition system. The programmability and single board constraints limit the total number of reference frames to 455 (about 11 word templates). Current design work on a processor for isolated word dynamic time warping, the DTWP, suggests that a second generation CDTWP may handle 6000 reference frames (150 templates) by the use of existing nonprogrammable processing elements and addition of more template memory.

Decidability of yield's equality for infinite regular trees

Abstract: We introduce yield of infinite trees. Trees are provided with usual syntactic order, words with a new order that canonically makes concatenation continuous. "Yield" operation is continuous. Our main result consists in the decidability of yield's equality for infinite regular trees.

Picture processing method

Abstract: PURPOSE:To perform effective processing with small memory capacity by extracting a pattern in a specific shape from a picture having plural picture patterns, arranging and displaying plural patterns, and storing patterns with good concatenation as a basic pattern repeatedly. CONSTITUTION:Cursors 13a and 13b which are at a specific interval are positioned on a pattern 11 and a rectangular pattern Sa determined by points 14a- 14d is extracted from the pattern 11. Then, the pattern Sa is displayed on a display device 44 such as a CRT repeatedly in two up-down directions. Then, whether the concatenation between repetitive patterns is good or not is confirmed visually. The cursors 13a and 13b are moved gradually to alter the pattern Sa until a clean picture is obtained. Patterns which coincide with the interval of repetition are stored in a storage device 45 as the basic pattern. Thus, the pattern is generated efficiently with small storage capacity.

Information processor with erroneous input correcting function

Abstract: PURPOSE:To perform correction processing with high efficiency without increasing its storage capacity by sectioning an input character string into (n)-character blocks when the input character string is not stored in a word dictionary, and referring to frequency information and substituting a character with a high evaluation value as a correct character. CONSTITUTION:A character string signal A inputted from a KANA (Japanese syllabary) keyboard 1 is passed through a character string converter 18 which converts special character concatenation into one special character to supply a signal B to a CPU12. A character string restoring device 19 restores a signal C to its original special KANA character string when the signal has a special character, and passes other signals as they are to a controller 4 as a signal D, which is sent as a signal E to the word dictionary to be looked up. A signal F when the word is stored in the dictionary 4 is sent to an output storage circuit as a signal G through a controller, and a signal N when not is outputted. The CPU12 when receiving the signal N sections the temporarily stored signal B into (n)-character blocks and sends them as a signal J to a frequency table 17 to obtain a frequency signal K; when a special character is contained, a special character freuqncy table 20 is looked up. The CPU12 calculates an evaluation value and substitutes a character with a maximum value as a correct character.

Encoding and recording/reproducing device of sound signal

Abstract: PURPOSE:To detect previously a reading error of concatenation information and to correct this error, by storing the concatenation information for each track in a reproduction time to define the data corresponding to the stored concentration information as a real data and selecting a reproduction track based on the real data. CONSTITUTION:In a reproduction time, the signal read out of a disk recording/ reproducing part 7 is supplied alternately to RAMs 11 and 12 via a changeover switch 10. The concatenation data among the data written in the RAMs 11 and 12 are supplied to registers 15-17 via a disk controller 8. Then the concatenation data of the present reproduction track is written to those registers together with the concatenation data of the preceding reproduction track and that two times ahead, respectively. The outputs of the registers 15-17 are sent to a coincidence detecting circuit 19, and coincidence is detected among three corresponding joint data. The concatenation data stored in a register 18 is fed to the controller 8. Based on this data, a correct selection (access) is secured for the track to be reproduced next.