bluuebunny/crossref_metadata_2025_split huggingface dataset:
A continuous speech recognition expert system—sprex
Authors: Mizoguchi Riichiro , Kakusho Osamu , Tanaka Yasunori , Fukuda Naoyuki , Tsujino Katsuhiko 
Published: July 2007

AbstractIn the continuously uttered speech, it is often difficult to extract the features of the individual phoneme due to the interaction between phonemes called co‐articulation. In such a case, a large amount of empirical knowledge is required for recognition. In the past, efforts have been made to realize the continuous speech recognition system by a procedural language such as FORTRAN, producing problems in the flexibility and expandability of the system. This paper describes the expert system SPREX for continuous speech recognition, which aims at the solution of those problems by introducing knowledge engineering techniques into the speech recognition. The proposed system is an expert system which simulates the behavior of a human expert by the knowledge engineering technique, where the phonemes are recognized by observing the time‐course of change of the acoustic feature parameters such as formant frequencies. The system can efficiently manage and utilize the empirical rules inherent to the continuous speech recognition. At present, the system is composed of 114 expert knowledges represented by production rules. The recognition rate of 85 percent is realized for 29‐s speech uttered by 3 adult males. Finally, problems left for the studies in this direction are discussed, aiming at the amalgamation of the study of speech and the knowledge engineering.
Time complexity of response time estimation of multichannel communication networks
Authors: Matsumoto Hiroshi , Cunha Wagner Chiepa , Yamashita Masafumi , Ae Tadashi 
Published: July 2007

AbstractIn the multichannel communication network, more than one message can be transmitted in parallel through several channels. This paper defines response time as the time from the origination of a transmission request to the transmission completion, and discusses the time complexity in estimating the maximum response time in the multichannel communication network. The messages are transmitted in the network using simultaneously a set of channels (called a channel set). In the transmission of a message, a request may be issued for one or more channel sets. It is shown that the computational complexity is either polynomial or NP‐hard, depending on the number of requested channel sets.
Role of prosody in cognitive process of spoken language
Authors: Kitahara Yoshinori , Tohkura Yoh'Ichi , Takeda Shoichi , Ichikawa Akira 
Published: July 2007

AbstractThe authors are developing an arbitrary text speech synthesis system, and aiming at the improvement of the synthesized speech quality, the effect of the prosodic information data of the speech, e.g., pitch structure and the time structure, on the speech intelligibility was evaluated by a listening experiment using synthesized speech. It was verified quantitatively by the result of experiment that the pitch information works efficiently in the speech listening without attention concentration, aiding the understanding of the speech. It was seen that the accent information is especially important, so that the accent should be attached to the text speech synthesis system resulting in an accuracy as high as 98 percent or more. It was shown that the existence or nonexistence of the phrase component does not affect speech intelligibility. Some results of the experiment suggest a direction toward improving the performance of the speech recognition system. It was seen that if the phrase recognition rate of 70 percent is achieved in the speech recognition system from the acoustic viewpoint, the rate can be improved up to 90 percent or more without using the pitch information by employing the lower‐ and higher‐level linguistic knowledge' processing. The importance of these factors in improving the intelligibility are in the order of lexicon, context, and accent information.
An approximate encoding scheme for line‐drawings using the concept of vector quantization
Authors: Handa Shiro , Inoue Hideki , Tanaka Hatsukazu 
Published: July 2007

AbstractThis paper proposes an encoding scheme based on the concept of vector quantization, an encoding method for storing a large amount of digital line‐drawings. The vector quantization is a well‐known concept as a highly efficient encoding method for speech and image at low transmission rate. In time‐series data such as speech, the mean‐square distortion per sample is employed as the measure for the distortion in quantization, while in the line‐drawing, it is difficult clearly to specify the correspondence to the sample points. This paper proposes a matching by dynamic programming and demonstrates its validity. From the viewpoint that the distortion in encoding depends greatly on the connections among vector patterns, an encoding method permitting the encoding delay is proposed. It is shown that the distortion‐rate performance is improved drastically. The method is applied to a geographical map, and it was verified that a satisfactory figure is reproduced by approximately 1.0 bit per line pixel.
Maximum PLA folding using inverters
Authors: Iguchi Yukihiro , Mukaidono Masao 
Published: July 2007

AbstractIt is desired to reduce the area of mask PLA to save the silicon area and improve the switching speed. In the usual methods for folding, the columns and/or rows are folded with cuts. On the contrary, recently, a new folding technique has been proposed by the authors. In that technique, a variable line and its negation are folded into one line by inserting an inverter. This paper formulates that folding by using the regular ternary logic function and then clarifies its properties. An algorithm is described which generates the maximum folding. Some experimental results indicate that this algorithm is effective. It is easy to implement the algorithm on computers.
Data compression of myoelectric signal—estimation of force and its long‐term monitoring
Authors: Akazawa Kenzo , Nire Katsuo , Fujii Katsuhiko 
Published: July 2007

AbstractIt is desired in medicine and sport science to develop a lightweight and small‐sized measuring device which can estimate the generated force of muscle from a myo‐electric signal and monitor that signal for a long time. The purpose of this study is to develop a data compression method for the myoelectric signal. First, the myoelectric signal is full‐wave rectified and smoothed to extract the generated force (equivalent isometric tension) of the muscle. The smoothing filter was designed based on the measurements of the myoelectric signal and the force in the isometric contraction. Next, the waveform of the signal (FEMG) after a full‐wave rectification and smoothing is encoded by the adaptive delta modulation (ADM), and the result is stored in the memory. The parameters of ADM were determined in the optimal way for the myoelectric signal. FEMG signals were constructed from fast motion such as occurs in sports, usual motion such as walking, and the delay motion of a neural‐diseased patient, at sampling intervals of 24, 48 and 100 ms. The S/N ratios of ADM data were calculated as above 37, 45 and 52 dB, respectively. A portable computer (8‐bit CPU and 64‐kB memory) with the data compression program was constructed which can measure continuously the myoelectric signal of a normal subject for up to 12 hours. The decoded signal agreed well with the original FEMG, indicating the usefulness of the developed data compression method and the measuring system.
Linguistic processing in an island‐driven speech understanding system
Authors: Kobayashi Yutaka , Niimi Yashuhisa , Uzuhara Shigeru 
Published: July 2007

AbstractAn island‐driven control strategy in a speech understanding system (SUS) would be effective when reliable phonetic recognition cannot be obtained due to poor performance of the acoustic processor or noisy conditions. Especially, in conversational speech, the signal suffers from a heavy smoothing effect. An island‐driven SUS begins with detecting the acoustically most probable islands of keywords, and then expands them by a “hypothesis and test” paradigm until it covers the whole utterance using various sources of knowledge. However, this control strategy demands a very complicated linguistic processing rather than a left‐to‐right control. The authors developed an algorithm for transforming a set of syntactic rules written in the definite clause grammar into an efficient word predicting program in Prolog which operates under an island‐driven control. The basic ideas and the algorithm are explained here with a few examples of word prediction activities.
A pointing method for graphics
Authors: Yoshiyuki Nishinaka, Associate  , Yoshihiro  , Nobuki  
Published: July 2007

AbstractAs interactive computer systems become popular, the study of pointing devices is becoming more important. This article discusses research on the efficiency of pointing methods which include the combination of a pointing device and its controlling software. One observation from this research is that the pointing efficiency is worse on a model with a smaller target size. Here, we propose a new pointing method—the Brake Type Method—in order to reduce the error rate. In this method, we try to make pointing easier through sufficient control of the movement of the mouse‐cursor. This method was evaluated in an experiment, which was also done with a digitizer (a popular pointing device for graphics). Conclusions indicate that the Brake Type Method proposed here is quite effective in reducing the error rate without losing other aspects of pointing efficiency.
A method of frame representation of moving objects for knowledge‐based coding
Authors: Kimoto Tadahiko , Members Yasuhiko Yasuda 
Published: July 2007

AbstractIn knowledge‐based coding which has attracted considerable attention as a new coding scheme for moving pictures, the model of the moving object must be controlled efficiently in the range from the rough motion of the whole body to the detailed displacement of each part when the scenes are synthesized at the receiving side.This paper describes both a method of modeling of the structure and the motions of the object using the frame representation scheme, which is often used in the field of the knowledge engineering, and a scheme to synthesize the scenes based on the models. The objective of this paper is to represent the motion of the object rather than the changes of its surface. For simplicity, the object is limited to that which consists of connected rigid parts. In our method, the structure of the object and its motions are represented hierarchically.Using the motion model, the motion of the whole body can be controlled by the semantic information and the displacement of each part can be controlled by the function. Furthermore, the speed and the amplitude of the motion can be changed efficiently. As an example, we have represented a simple stick model of the human body and its walking motion in the frames, and then synthesized the stick motions.
A highly performable window virtual function for the multiwindow system
Authors: Nonmember Tsukasa Maejima, , Nakamura Taichi , Sugawara Shohei 
Published: July 2007

AbstractA multiwindow system is one in which several rectangular regions called windows are defined on the screen of CRT or other display devices, and the user can handle each of the windows as if they were separate display devices. The features of such a system are that it has the virtual function and multiwindow image synthesis function. One of the important requirements is to reduce the overhead due to those added functions.
A method of constructing cpu for programmable controllers
Authors: Yamashita Yoshiomi , Kawashima Yoshikazu , Nonmember Masami Sakakibara, 
Published: July 2007

AbstractRecently, remarkable developments and performance improvements have been made in factory automation (FA). The programmable controller (PC) is becoming more important than ever as a general‐purpose key component in FA, and rapid improvement has been made in its performance. In addition, it is highly desired to improve the information processing performance. In addition to the bit operation which has been the core of the sequence control, a performance is required which can execute a large‐scale numerical data manipulation at a high speed. This paper aims at realization of a sufficiently high‐speed information processing power. Also, it proposes a new PC dedicated CPU architecture, which is the result of optimization considering the special nature of the PC execution scheme and the command set of the PC dedicated instructions, and demonstrates its effectiveness. The proposed architecture has the following features. The processing function of PC is divided into the system management function and the instruction execution function, each of which is realized by the optimal processor and executed in parallel. The parallelism as well as the execution pattern of the execution program are extracted from the PC dedicated instructions. The parallelism and the high speed are realized as far as possible. Applying the proposed architecture to PC, the speed improvement by 60 times at the maximum is realized, compared with the fastest previous PC of the company, while maintaining the compatibility to the traditional instruction set.
DDS: A declarative debugging system for functional programs
Authors: Takahashi Naohisa , Ono Satoshi 
Published: July 2007

AbstractThis paper describes the outline and implementation of the declarative debugging system DDS. The purpose of DDS is to provide the following debugging system for the functional program without a side effect: (1) The programmer specifies the result of execution and the intermediate result expected to the program (defines in a declarative way, and the system detects the bug automatically based on that specification; (2) an efficient guide is provided to the programmer so that the required input is less and the input can easily be given; and (3) the system has an efficient bug detection mechanism in terms of the memory capacity and the computational complexity. It is an interactive system which can be applied to a wide range of programs. This paper proposes a mechanism called filter, which gives an efficient realization of DDS. The filter is a mechanism which realizes the tabulation technique by a small‐capacity memory, by extending the technique from the viewpoint of the bug detection. The filter is a mechanism which selectively retains the instances needed in the bug detection and controls the function call of the program using the retained data. An experimental system of DDS is constructed on VAX/VMS using Common Lisp. Debugging examples are shown, indicating the usefulness of DDS.
Automatic extraction of roads denoted by parallel lines from 1/25,000‐scaled maps utilizing skip‐scan method
Authors: Nagao Tomoharu , Agui Takeshi , Nakajima Masayuki 
Published: July 2007

AbstractResearch on map processing using computers has been active recently. Data of road networks in a map often are required for processing an urban map. If these data are fed manually into a computer, not only is labor considerable but many errors would occur. A solution to this problem is to extract road networks automatically from the map using a computer. This paper proposes a skip‐scan method which automatically extracts parallel lines from 1/25,000–scaled maps. A given map is scanned at constant intervals so that each cross point of the scanning line and the central line of a road are extracted as feature points. Many short vectors are formed by connecting the feature points. Referring to the original map, connection of the vectors, elimination of noise, and interpolation of parts of roads interrupted by characters on the map are carried out automatically. An algorithm used for this operation is simple, since almost all the elements are vectors. This paper describes the algorithm, and examples of result applications to actual 1/25,000–scaled maps. These confirm the usefulness of the method.
An iterative image registration technique using local affine transformation
Authors: Wakahara Toru 
Published: July 2007

AbstractFor registration between images, algorithms of point correspondence searching type and deformation field analyzing type have been proposed in the past. The former had a problem of increasing processing quantity and the latter had a problem of assuming small displacement or deformation. This paper proposes a cooperative image registration technique which absorbs finite displacement and nonrigid body deformation by iteratively applying affine transformations from coarse to fine for binary images expressed by sets of loci vectors of characteristic points. The process consists of four steps: (1) for each characteristic point of a reference image, a local affine transformation (LAT) weighted by Gaussian window functions is applied; (2) based on the least‐squares method, LAT is optimized for each characteristic point of the reference image so that overlapping for a group of characteristic points of input images becomes best; (3) optimized LAT is applied for each characteristic point of the reference image and deformed reference image is generated; (4) iterating steps (1) through (3) while gradually decreasing the spreads of the Gaussian window functions, when the deformed image coincides with the input image, displacement between images is determined. We have applied this method to binary character images including large deformation and random‐dot stereograms and obtained good results. Also, we evaluated the processing quantity by this method and showed that extension to gray scale images is easily formulated.
Pattern matching of 2‐D shape using hierarchical descriptions
Authors: Morita Satoru , Kawashima Toshio , Aoki Yoshinao 
Published: July 2007

AbstractThis paper introduces a system for hierarchical description of two‐dimensional shapes on the basis of scale space analysis. We propose a group of simple primitives for describing curved line segments; they are suitable for hierarchical analysis. To realize effective matching, nineteen rules are necessary and sufficient to derive a tree. The tree derived from the analysis yields the hierarchical structure of a shape and enables efficient matching of objects in a top‐down manner. An algorithm to create a compact database from trees is also shown. The sophisticated database is shown to be useful for recognizing objects by their category. Several examples showed that matching for skewed or occluded shapes can be done by searching for a subtree in the database.
Set partition of real numbers by hopfield neural network
Authors: Hisanaga Yutaka , Yamashita Masafumi , Ae Tadashi 
Published: July 2007

AbstractThe Hopfield neural network is attracting attention as a high‐speed solver for optimization and other problems. However, it contains a problem in that the network may not arrive at the globally optimal solution but stops at a locally optimal solution unless the initial state is selected appropriately. In other words, the selection of the initial state is important in solving a problem using the Hopfield neural network.This paper considers the real number partition problem, the problem of finding the k largest elements from a given set of real numbers, given integer k. A network to solve this problem is constructed. It is shown that the network arrives at the globally optimal solution if the initial state satisfies a certain condition. Its basin also is examined. As an application example of the network, the sorting problem is considered.
NCC: A concurrent description language for scientific calculation on multiprocessors
Authors: Boku Taisuke , Kudoh Tomohiro , Amano Hideharu , Kimura Tetsuro 
Published: July 2007

AbstractThis paper proposes a concurrent description language called NCC for scientific calculations that are executed on a multiprocessor. NCC is based on a static concurrent process model called “NC model.” NCC's minimal features allow scientific calculations to be efficiently executed on a large‐scale multiprocessor. Having obtained less overhead in execution by restricting NCC's ability to describe concurrent processes, NCC allows users to write scientific calculation programs which are both highly easy to analyze and read.
Stereo‐based description by generalized cylinder complexes from occluding contours
Authors: Etoh Minoru , Tomono Akira , Kishino Fumio 
Published: July 2007

AbstractThis paper proposes a stereo‐based description technique as a preprocessing step for three‐dimensional (3‐D) recognition of an object representable by a straight homogeneous generalized cylinder (SHGC). The 3‐D position estimate of SHGC model be computed if the object being modeled is either a solid of revolution or a body whose contour is symmetrical with respect to its axial.The proposed algorithm is applicable to a complex object if that object can be partitioned into a set of multiple SHGC's. The most important task of the algorithm is the extraction of a symmetry axis for each GC section of the object. The contour lines are analyzed in a scale space. The analysis is performed recursively to obtain each GC section that has stable contour lines. The effectiveness of the proposed algorithm for 3‐D description of an object has been demonstrated via experimentation.
Methods for realizing a priority bus system
Authors: Nakano Koji , Masuzawa Toshimitsu , Tokura Nobuki 
Published: July 2007

AbstractSeveral bus models have been proposed for simultaneous message‐passing on a bus. The priority model is a bus model in which the rightmost processor among processors trying to send to the bus actually succeeds and the common model is a bus model in which simultaneous sending is permitted only if the same value is sent by each processor. Obviously, the priority model is more powerful than the common model. We show two practical methods for realizing a priority bus using common buses.
Relaxation neural network model for optimal binary representation of images and its implementation on a parallel computer
Authors: Sonehara Noboru 
Published: July 2007

AbstractA relaxation neural network model is proposed to solve the binary image representation problem. This network iteratively minimizes the computational energy defined by the quantization error in neighboring picture elements in local and parallel computations. For effective binary representation depending on local features such as edges, a relaxation neural network is proposed. Interactions between binary processes and line processes represent discontinuities of the image. It is shown that the proposed neural models can generate high‐quality binary images. It is also shown that the proposed models can be efficiently implemented on loosely coupled, hypercube multiple‐instruction, multiple data stream (MIMD) and single instruction‐multiple data stream (SIMD) parallel computers by parallel computational models and programming methods.
The Qajar Rock Reliefs
Authors: Luft J. P. 
Published: July 2007

The Qajar rock reliefs are without doubt an anachronistic group of monuments in Iranian art. An expression of royal power in pre-Islamic Iran, with the emergence of Islam, they more or less disappeared. The reason is obvious—they were representing human beings in a demonstrative, outgoing fashion. But even more important was their public character. In contrast to book painting and probably less to painting on canvas, the art of rock reliefs is intentionally turned towards an audience beyond the walls of the court. In some way they belong to the public and were put there with the aim of glorifying and propagating rulership.All together there are eight reliefs, seven from the period of Fath āAli Shah (1797-1834) although not all were commissioned by him, and one from the time of Nasir al-Din Shah (1848-96). This last one is situated on the Haraz Road, near Tangah-i Band-buridah.