bluuebunny/crossref_metadata_2025_split huggingface dataset:
A Clustered Multiprocessor System
Authors: Nakada Takeo , Horiguchi Susumu , Takaki Yasushi , Kawazoe Yoshiyuki , Shigei Yoshiharu 
Published: November 2009

AbstractWith the recent remarkable development of VLSI technology, the study and the experimental development of multiprocessors composed of a large number of processors have actively been performed. A serious problem in such systems is the contention (conflict) in communication. A clustered system is proposed as a means to ameliorate the problem, where processors are grouped into several units. This paper derives a theoretical expression for the processing efficiency of the clustered multiprocessor system. An experimental system was constructed, which is composed of 32 processors, being grouped into 4 clusters, each of which is composed of 8 processors. The design of the software and the result of implementation are described. As a practical example, the summation of a series and the solution of a system of linear equations are considered. The processing efficiencies of the clustered and nonclustered systems were measured and compared. It is shown as a result that the clustered system can improve the system efficiency considerably by adding a small amount of hardware.
Hardware‐Matching Algorithm for High‐Speed Linguistic Processing in Continuous Speech‐Recognition Systems
Authors: Hamaguchi Shigetatsu , Suzuki Yoshitake 
Published: November 2009

AbstractThis paper considers the Japanese speech input system which recognizes the continuously uttered speech by the standard syllable patterns. In such a system, the dictionary matching procedure is required, where all possible combinations of syllable candidates contained in the recognition result are compared with the Japanese dictionary to select the combinations of syllables contained in the dictionary (i.e., word candidates). Usually, however, there exists a tremendous number, up to several thousands, of possible combinations of syllable candidates obtained from the recognition of continuous speech. On the other hand, a Japanese dictionary, in general, contains several tens of thousands of words. Consequently, the matching procedure requires about 1 s which should be improved from the viewpoint of the system response time. This paper proposes a high‐speed algorithm which directly matches the result with the dictionary. In this algorithm, the kinds of syllable candidates contained in the recognition result of speech are mapped on the RAM address space to be compared with the dictionary, making it unnecessary to expand the result of recognition into a large number of syllable candidate combinations, as in the traditional methods. The design of LSI is discussed which realizes the proposed algorithm by a hardware. The LSI can compare 10 speech recognition results, which contain the syllable sequence length up to 7 and up to 4 candidates for each syllable, with a dictionary of 30, 000 words, in approximately 13 ms. Thus, the processing speed is improved almost by two orders of magnitude, compared with the traditional methods.
The Design Theory of Two‐Dimensional Memory Systems for Image Processing
Authors: Tayama Norio , Sun Weidong , Otawara Isao 
Published: November 2009

AbstractThis paper considers the two‐dimensional image memory system with the parallel access function required in the parallel image processing, and presents the design theory for its construction. So far, numerous studies have been made on the condition for the parallel access for individual memory module assignment expression. The authors believe, however, that the general theory cannot be developed by the earlier functional expression for the memory module assignment. This paper presents a new concept of “memory module assignment permutation.” Based on the proposed idea, a problem is considered concerning the mathematical properties of the memory module assignment permutation to realize the two‐dimensional image memory system with various kinds of parallel access. The problem is formulated and the design condition is described. In other words, the horizontal and vertical line mode as well as the plane‐mode are considered. The necessary and sufficient condition is derived for the memory module assignment permutation to realize the various parallel access.
An Approach for Unified User Interface in the Integrated Information System
Authors: Watanabe Toyohide 
Published: November 2009

AbstractAt present it is most important that information systems not only provide more powerful functionality and performance under the technologies of various data processing facilities and high‐quality data communication means, but also develop more effectual user interface with a view to constructing software development environments. The concept of integration is to support cooperative interfaces among various kinds of processing facilities, and is one of many methods which can provide effectual user interface systematically. In this paper, the integration mechanism in an information system is discussed from the viewpoint of the development of an advanced user interface. First, the logical structures and the physical structures are distinguished from the data structures, which are manipulated by individual processing facilities. Then each data object is controlled uniformly on the basis of these logical structures. The logical structure is specified definitely by users and the physical structure is managed practically by processing facilities. The approach in this paper specifies the logical structures of individual data objects hierarchically with each other, matches these logical structures uniformly, and finally, controls a unified user interface under the cooperative mechanism of processing facilities.
Trinocular Vision Using Edge Continuity and Local Features
Authors: Kitamura Yoshifumi , Kimachi Masatoshi , Yachida Masahiko 
Published: November 2009

AbstractIn the mechanical recognition of three‐dimensional shape, position and orientation of the object, it is important to obtain information concerning the distance to the object (depth). One of the powerful approaches for this purpose is the binocular vision (stereo method), in which two cameras are used to determine the distance based on the principle of trigonometric measurement. In this method, the three‐dimensional position of a point can easily be determined if the correspondences of feature points are established between the two images. However, the correspondence is not easy if the two images have a large number of feature points. We investigated the correspondence problem, and solved the difficulty by introducing another camera, realizing the trinocular vision and applying a simple geometrical processing. However, when the number of the feature points on the image is increased in this method, the correspondence is sometimes not unique, leading to more than one corresponding point. To solve this problem, the edge continuity and the local property of the image are combined with the geometrical constraints by trinocular vision, arriving at a satisfactory result.
Design of a Fault‐Tolerant System Based on Knowledge‐Engineering Approach and Its Application to a Digital Control System
Authors: Kameyama Michitaka , Zheng Li , Higuchi Tatsuo 
Published: November 2009

AbstractIt has been known that independency between processings for replicated modules is the most important factor in a replicated redundant fault‐tolerant system. To reduce the effects of simultaneous failures and/or simultaneous errors including errors caused by the input itself, a new design method of a highly reliable digital control system based on a knowledge‐engineering approach is proposed. The input signals are sampled at different sampling points and processed separately. If the errors in the processed results are detected using the knowledge of erroneous states and dynamic characteristics of the control system, then the internal states in the erroneous module are recovered immediately by using correct states in the other module. Since the input signal sampling and its processing are almost independent, an ultrahigh reliability can be achieved. The usefulness of the proposed method is confirmed by reliability analysis based on Markov graphs and experimental measurement.
One‐Dimensional Bounded Cellular Acceptor with Rotated Inputs. A Relationship between ∧ and ∨ Types
Authors: Taniguchi Hiroshi , Inoue Katsushi , Takanami Itsuo 
Published: November 2009

AbstractThe authors previously introduced the following two‐dimensional automaton, and made several discussions on its accepting power. The input two‐dimensional tape is rotated by 90, 180 or 270 deg in clockwise direction. The rotated results are scanned by one‐dimensional bounded cellular acceptors. The results of scanning are combined by product (∧) or sum (∨), to make the decision regarding the final acceptance. The purpose of this paper is to discuss further details of the accepting power of such an automaton. In the first‐half of this paper, the situation is assumed where the rotated inputs are scanned by the deterministic one‐dimensional bounded cellular acceptors. A discussion is made on the relation between the accepting powers when the results of the scanning are combined only by product or only by sum. It is shown that the families of sets accepted by the product or the sum type are always incomparable. In the second half of the paper, the relation between the accepting powers of the following two automata are described. One is the automaton obtained by combining the one‐dimensional bounded cellular acceptors by sum (or product); the other is the automaton obtained by combining one‐way parallel sequential array acceptors by sum (or product).
Recovery of Nonrigid Curvilinear Objects Using Optical Flow
Authors: Nonmember Akira Kawamura, , Sugie Noboru , Sugihara Kokichi 
Published: November 2009

AbstractThe kinetic depth effect which recognizes a 3‐D structure from a 2‐D information is explained from an algorithmic viewpoint among other human vision functions such as binocular vision.This paper proposes an algorithm for reconstructing the structure and motion of a 3‐D nonrigid object using the information of positions and velocities in the time sequence of images. It is assumed that the nonrigid object does not deviate significantly from rigidity. First, the object is analyzed approximately by assuming that it is rigid. Then the first‐order terms of Ct (which is an interval of two adjacent frames) are added to improve the approximation.Models of rigid and nonrigid objects were made, and information of their positions and optical flows were formed. The effectiveness of the proposed algorithm was confirmed by applying this to the data of the models.
Fabrication of Three—Dimensional Objects Using Laser Lithography
Authors: Nakai Takashi , Marutani Yoji 
Published: November 2009

AbstractThere is no established technique for the 3‐dimensional (3‐D) pattern formation, and many structures cannot be formed using the conventional CAD/CAM technology. We have constructed a simpler economical system for the 3‐D pattern formation by using an ultraviolet laser and light‐sensitive resins. In this technique, the CAD data designed by a computer are sliced horizontally. Using the sliced data, the laser is moved in a 2‐D direction and the light‐sensitive resin is irradiated. Then solidified thin plates are stacked to form a pattern. Using this technique, such complicated patterns as holes, screws and hollow objects, can be formed by one process. Since it is not necessary to maintain the cutting tools and the cutting scraps, a completely automated process can be achieved.
Dynamics of Stochastic Relaxation Processes
Authors: Ejima Toshiaki 
Published: November 2009

AbstractThe consistent labeling problem, which is one of the combinational problems, can be formulated within the framework of the stochastic relaxation process. This paper describes clearly the structure of the stochastic relaxation algorithm obtained from such a formulation. The usefulness of the stochastic relaxation in the consistent labeling problem is demonstrated. The consistent labeling problem belongs to the NP‐complete class, and is one of the “difficult” problems among the combinational problems. The stochastic relaxation method aims at the overall consistency by iterating the adjustment for local consistency. In this sense, in the consistent labeling problem, a consistent label is obtained if the local consistency applies to any part of the system. On the other hand, the stochastic relaxation can be considered as a dynamical system which contains a mutual interaction to adjust the consistency. The steady‐state solution of such a dynamical system corresponds to a solution generated by the stochastic relaxation process. This paper describes clearly the structure of the dynamical system specified by the stochastic relaxation, via a theoretical analysis and a computer simulation. As a result, it was verified that an initial state always exists near the equilibrium point, from which the convergence to the optimal steady‐state solution is ensured. It was verified that by reducing the neighborhood region, the ratio of the initial state region from which the convergence to the optimal steady‐state solution is ensured, is increased.
Analyzing Parallel Executability of Production Systems
Authors: Ishida Toru 
Published: November 2009

AbstractThe production system is one in which mutually independent rules communicate with each other through a common database aiming at the solution of a problem. Because of its nature, the production system seems to contain a larger potential parallelism than the procedural program. At present, however, only one rule succeeded in condition matching, is selected and executed, which prevents the full utilization of the parallelism. The aim of this paper is to realize a high‐speed execution of the production system by executing the rules in parallel as far as possible. First, a new execution model is proposed for the production system, where the rules succeeded in condition match are executed in parallel as far as possible. Then the data dependency graph for the production system is introduced, and a method is presented by which more than one rule is analyzed to determine whether or not they can be executed in parallel. A method is presented which applies the result of parallel executability analysis to the parallel execution of the rules on a parallel computer, or the execution scheduling of the rules on a sequential computer. A production system PLANET was constructed which can analyze a program by a parallel execution simulation, and the proposed method was evaluated. It was verified that four to eight rules can be executed in parallel in the range of programs used in the evaluation. By combining the result of this paper with the traditional parallel condition matching, it is expected that a further parallelism can be realized.
A Parallel Processor System for the Simulation of the Neuron Network
Authors: Omori Takashi 
Published: November 2009

AbstractThis paper investigates the recognition and intelligent system based on the neuron‐like network. A problem in the study is the computational complexity in the simulation of the neuron network model. A dedicated parallel processor system was developed from such a viewpoint, and a high‐speed experiment was realized. This paper describes first the background of the system, where the neuron model is represented essentially by a system of differential equations with local interaction terms. A hardware composed of 64 microprocessors for the parallel computation, as well as the parallel processing description monitor system with interaction, which helps the realization, are described. The monitor discriminates clearly the physical parallel processors and the computation process to be realized logically on the system. The data needed for the interaction terms of the equation are obtained by interprocessor communication. Thus, the description of the parallel processing is made possible with the overhead comparable to the address computation in the usual computer. The parallel computer system was actually constructed, and it was verified that the system is effective for the correspondence problem for binocular vision.
Configuration Estimate of Trihedral Vertex from a Single View
Authors: Shakunaga Takeshi , Kaneko Hiroshi 
Published: November 2009

AbstractIn a previous paper, we introduced “perspective angle transform” (PAT) to analyze the relationship between an angle seen under the condition of “central projection” and an actual angle. The present paper discusses mainly (based on the previous paper) the connotative interpretation of trihedral vertices by using information on an image. This is a problem in reconstructing a three‐dimensional (3‐D) configuration of the trihedral vertex from a central projection image in which all the angles are known. An algorithm to express this problem is introduced so that the problem can be analyzed. An algebraic solution based on the perspective angle transform is given for a case where at least two of the three angles in a trihedral vertex are right angles (i.e., a two‐‐orthogonal vertex or a three‐orthogonal vertex). The number of solutions and the possibility of their interpretations are also analyzed. A one‐dimensional search algorithm (or the examination method for the hypothesis of a normal image) based on the interpretation of the two‐orthogonal vertex is introduced for interpretation of a trihedral vertex. The number of solutions is examined statistically by using a computer simulation. This paper will be useful for analyzing scenes and robot‐vision, whichever images employ central or parallel projection.
A Cryptographic Key Distribution Mechanism Using Double Encryption for Secret Communications
Authors: Kobayashi Tetsuji 
Published: November 2009

AbstractCryptographic key distribution is one of the important problems when a conventional cipher is used for secret communications. Key distribution methods can be categorized as those using a conventional cipher system and those using a public key system. In key distribution methods using a conventional cipher system, the key encryption key should be sent secretly by manual operation. In key distribution methods using a public key system, no manual operation is necessary. This paper proposes a key distribution method (mechanism) which has the same functions as key distribution methods using a public key system. The proposed method is called a double encryption key distribution method and uses modular exponential computation in GF(p), where p is a prime. The authentication scheme for the key distribution method is shown. The advantages of the proposed key distribution method are as follows. Functions, performance and security are almost equal to main key distribution methods using a public key system. Additionally, since each node can generate and delete the encryption and decryption keys for the modular exponential function in each key distribution, it is unnecessary for each node to keep the keys.
Design of a Multiple‐Valued Associative Memory
Authors: Hanyu Takahiro , Higuchi Tatsuo 
Published: November 2009

AbstractAssociative memories and associaLive computer systems with high‐speed processing capability have been increasingly required in the real‐time application domains, such as File Maintenance, Pattern Recognition, Translation, Artificial Intelligence, and so on. This paper presents a design of high‐performance multiple‐valued associative memory which can perform ultrahigh‐speed processing at low cost.In the proposed method, the correlation between input pattern and memorized pattern is represented directly as multiple‐valued information, so that associative processing is performed efficiently by multiple‐valued operations. Based on a complete parallel processing architecture with multiple‐valued digit‐cell, each correlation can be calculated in parallel.In hardware implementation of a single digit‐cell, two kinds of new devices are proposed: the SOS transistor and the floating‐gate MOS transistor. By using these devices, multiple‐valued operators and multiple‐valued memories for the associative memory can be realized efficiently at the device level. It is demonstrated that compared with the corresponding binary implementation the proposed associative memory is very compact.
Speaker‐Independent Large Vocabulary Spoken Word Recognition by a Hierarchically Matching Method and a Method with Discriminant Functions
Authors: Sawai Hidefumi , Nonmember Tetuya Muroi , Yoneyama Masahide 
Published: November 2009

AbstractThis paper reports on a spoken‐word recognition method for a large speaker‐dependent and speaker‐independent vocabulary employing a hierarchical matching technique. First, the two‐stage, speaker‐dependent method is discussed. In the first stage, the input pattern and the average standard are matched. Only in the cases where there are many similar words among the resulting high‐scoring candidate words is the second stage employed. The second stage employs a hierarchical matching method to match the high‐scoring candidates with a multipattern.When this method was applied to a large vocabulary containing 1000 words, the first‐stage recognition rate was improved 3 percent, thereby enabling a final recognition rate of 97 percent. Next, we report on the speaker‐independent method. Clustering is applied to standard word patterns derived from 40 speakers.A representative pattern from within the cluster and the multipattern which belongs to it are placed into a hierarchy. During the recognition phase, in the first stage, the input pattern and the representative pattern are matched.In the cases where there are many similar words among the high‐ranking candidates, the K” method is used in the second stage to match the multipattern which belongs to the representative pattern. Furthermore, in the final stage, a post‐processing method which empl.oys ten types of discriminating functions is used to redistinguish by automatically extracting the differing portions of similar words.Applying this hierarchical matching method to spoken‐word recognition for a 250/ 1011 word large speaker‐independent vocabulary, a high recognition rate of 94.5187.1 percent was possible.
Analysis of Superposed Moiré Patterns in Halftone Screen
Authors: Fukuda Yuichiro 
Published: November 2009

AbstractIn the multicolor printing process, moiré patterns appear in a printed image due to the superposition of two or more screens. This is called superposed moiré and is distinguished from the moiré that appears in the sampling or modulating process. It is necessary to suppress this kind of moiré as well as other kinds. However, the fundamental properties of the superposed moiré, such as their shapes and amplitude, has not been analyzed in detail. Therefore, suppression of the superposed moiré have not yet been considered. This paper proposes an analytical method to determine the fundamental properties of the superposed moiré. This method can estimate the frequency, direction, profile and amplitude caused by arbitrary halftone, screen‐dot functions.
A Shift‐Variant Deconvolution for Aperture Correction of Collimator in Emission CT—Experimental Verification
Authors: Paek Seungkuen , Nakajima Masato , Morozumi Tatsuru , Yuta Shin'Ichi 
Published: November 2009

AbstractOne of the causes of the image‐quality degradation in emission computed‐tomography (ECT) is the characteristic of the aperture of its detection system. This is due to the geometrical structure of the collimator used for limiting the direction of the emitting ray. This kind of degrading causes a shift‐variant blurring in its reconstructed image. We have proposed a method of compensating the degradation by expanding the measured projection data into their frequency space so that the effect of the aperture is turned into a shift‐invariant blurring in each frequency [4, 5], This paper describes an application of the correction method to actual data obtained by light‐emission CT using visible light. The result confirms the usefulness of the proposed method.