bluuebunny/crossref_metadata_2025_split huggingface dataset:
Word and monosyllable recognition using lifters on two‐dimensional cepstrum
Authors: Ariki Yasuo , Nagata Masaaki , Sakai Toshiyuki 
Published: July 2007

AbstractThis paper examines experimentally the dynamical features which are useful in the recognition of words and monosyllables. By the two‐dimensional cepstrum analysis of the speech waveform, the two‐dimensional dynamical features are obtained for the time and frequency variations. First, the usefulness of the dynamic features for the time variation in the recognition is examined. It is shown as the result that the spectral envelope and its global variation are important in the recognition. It is shown especially that the recognition rate for the monosyllable is improved by providing a high‐emphasis lifter for the dynamic feature, and the noise immunity is improved by providing a low‐pass filter. The reason is that the high‐emphasis lifter on the two‐dimensional cepstrum emphasizes the formant in a two‐dimensional way on the time‐frequency plane, while the low‐pass lifter corresponds to the two‐dimensional smoothing on the time‐frequency plane. Finally, the lifting on the two‐dimensional cepstrum is compared experimentally with the usual one‐dimensional cepstrum. Hence, it is seen that the two‐dimensional cepstrum is better from the viewpoints of the monosyllable recognition and the recognition performance in a noisy environment.
A continuous speech recognition system with a powerful environment for the knowledge‐base construction: SPREX II
Authors: Tsujino Katsuhiko , Sakurai Toru , Nomura Yasuo , Chigusa Shunsuke , Mizoguchi Riichiro , Kakusho Osamu 
Published: July 2007

AbstractSPREX II is a continuous speech recognition system which uses the knowledge of experts able to recognize speech by inspecting trajectories of its feature parameters. This system has a powerful environment which supports the construction of its knowledge base, and it proposes a new paradigm which integrates speech recognition and knowledge engineering. This paper describes the necessity and the design philosophies of the support environment of this system, the outline and the effectiveness of the environment which has been implemented based on them, and its current performance.
Anti‐aliasing algorithm using silhouette mask method
Authors: Nakajima Masayuki , Agui Takeshi , Uemura Ken , Noguchi Norimasa 
Published: July 2007

AbstractIn the operation of cutting out a part of a digital photoimage, and that of patching another photoimage with it, the smoothness of the entire synthesized image is often spoiled by jagged edges around the cutout image, which is caused by a finite number of pixels of the images. Although many methods have been proposed to solve this problem, they require a high cost for computer processing. This paper proposes the “silhouette method” in which a silhouette of an object obtained by a backlight illumination is used. It is demonstrated that the method solves the problem.
A method of extracting a kinematically characteristic point from the 3‐dimensional motion of a rigid body
Authors: Hayashi Toyohiko , Ogawa Hidemitsu , Iijima Taizo 
Published: July 2007

AbstractThis paper describes a problem of estimating a kinematically characteristic point of a rigid body moving in a three‐dimensional (3‐D) space. We call this point the 1‐D characteristic point and denote it by P1. The point P1 is characterized by its motion range which forms a curved line. Hence, if the rigid body moves periodically, we can specify P1 as a point which moves reciprocally. This paper proposes a method of estimating P1. By projecting the orbit of a point onto three planes orthogonal with each other, we reduce this estimation problem to that of solving a set of quadratic equations, and we then provide one of its solutions. In addition, we clarify how measurement errors of the motion propagate to an estimation of P1.
Consideration on automatic defect detection algorithm for stamped patterns in electronic parts
Authors: Shima Yoshihiro , Kashioka Seiji , Yasue Toshikazu 
Published: July 2007

AbstractCentral Research Laboratory, Hitachi, Ltd., Kokubunji, Japan 185One of the most important problems in the quality inspection of printed characters, monitoring of printing devices, and evaluation of character recognition devices, is the automatic quality evaluation of the printed character for the character patterns stamped on the object surface or on a paper sheet. This paper considers the characters stamped on the surface of an electronic part such as transistor and integrated circuit, and reports on the result of comparison of defect detection methods for the automatic outlook inspection. First, properties of the stamped pattern, which is the object of inspection, are described, indicating the problems in detecting the defects such as lack, smudge and blur. Then three realizations of the defect detection are proposed: (1) a weighted matching is made with the reference pattern; (2) the reference pattern is divided spatially, and the matching is tried for the divided patterns; and (3) essential points are extracted from the core and background portions of the character, and a local pattern matching is tried. Finally, those defect detection methods are implemented on a computer, and an experiment was made for the actual stamped patterns on the transistor. The results for those methods are compared, and their effectiveness and the range of applications are indicated.
The basic construction of MUSAS: Musical arrangement system. Acquisition of 4‐part melody in consideration of the chord choice
Authors: Mikami Tatsuya , Inoue Kazuo 
Published: July 2007

AbstractConstruction of an expert system is frequently studied in knowledge engineering. Hence, in constructing sophisticated expert systems, analysis of the human thinking process and the human memory mechanism is essential. This is because humans in the real world have problem‐solving abilities.This paper presents the expert system “MUSAS” (musical arrangement system) for musical arrangement, to study the mechanisms and processes in human problem solving. Since musical arrangements have both a theoretical and emotional side, the former being text knowledge and the latter being heuristic, text knowledge is used to propose chords.Finally, the basic construction of MUSAS is given, and the method of application of a knowledge‐based system for musical arrangement along with the system process and experimental results are presented.
Extraction and recognition of partial shapes of machine parts on an assembly line
Authors: Hirata Tatsuya , Ito Hidetoshi , Ishii Naohiro 
Published: July 2007

AbstractVarious studies have been made on the storage and recognition problem for the two‐dimensional shape. An example is the Fourier descriptor which has a versatility in the description and recognition of the closed curve, being robust against expansion‐contraction or rotation. The usefulness of the method has been demonstrated from various standpoints. However, it is not a powerful tool for the partial shape, and little study has been done on that aspect since the contour representing a partial shape is an open curve. A method to represent the feature of the partial shape is the feature vector. In this method, the feature of the partial shape is described by a series of feature points. However, it is not for the description of a closed curve. In the method proposed in this paper: the contour is extracted from the partial image; the condition is stated for the projection shape to be detected from the contour line; and based on the derived condition, the projection shape is extracted. Then new methods for sampling and segmentation are proposed for recognizing the extracted projection shape.In the recognition of the contour line to be extracted in this paper, a new and simple method is proposed based on the concept of the feature vector. By the proposed method, the open curve of the partial shape is represented, and the recognition is performed by examining the matching to the model. It is shown that the proposed method can well recognize and process the partial shape of the machine part on an assembly line.
An efficient distributed algorithm for constructing a breadth‐first search tree
Authors: Park Jungho , Tokura Nobuki , Masuzawa Toshimitsu , Hagihara Ken'Ichi 
Published: July 2007

AbstractWhen information data to solve a problem are distributed over processors on a network, the algorithm which solves the problem by exchanging the information data is called a distributed algorithm. A large number of distributed algorithms has been proposed for various problems, but the proof for the validity is shown only for a few of them. This paper considers an asynchronous network and proposes a distributed algorithm which constructs the breadth‐first search tree with the specified processor as the root. The validity of the algorithm is shown. In general, the efficiency of the distributed algorithm is evaluated by the total number of messages exchanged during execution (message complexity), and the execution time (ideal‐time complexity), assuming the communication delay as a unit time.In the algorithm proposed in this paper, the message complexity and the ideal‐time complexity are both O(n·√e where n is the number of processors and e is the number of links in the network. Especially, when e = Q((n/logn)2), the proposed algorithm is better than other known algorithms in terms of the message complexity.
Maximum lower bound on embedding areas of general graphs
Authors: Wada Koichi , Kawaguchi Kimio , Fujishima Hideyuki 
Published: July 2007

AbstractIn designing VLSI, the problem of how large the chip area will be is of considerable interest. Thus, the primary objective in investigating this problem is to consider formally processing elements and wires of a circuit to be vertices and edges of an undirected graph, and then clarify the area sufficient or necessary to embed this graph onto a rectangular grid graph according to a certain embedding method (this is called an embedding model). In this paper, vertices correspond to a rectangular graph such that [length of long side]/[length of short side] ≤ constant. It is shown that under an embedding model, which forbids images of edges (wires) from passing through the inside of the vertex region of the rectangle, the maximum lower bound of the area corresponding to a general n‐vertex d‐degree graph is ωd2n2. As the result, it is seen that the conventionally known upper bound O(d2n2) cannot be improved any further as long as all n‐vertex d‐degree graphs are considered.
Learning and discrimination of perceptual vowel distribution by a neural net model
Authors: Ohtomo Teruhiko , Takahashi Katsunori , Hara Ken‐Ichi 
Published: July 2007

AbstractThe phoneme perception distribution is determined by the psychoacoustic experiment for the synthesized speech. The purpose of this paper is to attempt a learning of this distribution by a neural net model with three‐layered structure. The following observations are made as the result of learning by a neural net model. The weight of the connection from the input layer to the hidden layer has the function to extract the particular frequency range, and the weight from the hidden layer to the output layer has the function to integrate the unit output in the hidden layer, to extract the particular phoneme. It is shown by integrating those results of analysis that the weight sequence from the input layer to the output layer has the function as a filter to extract only the particular phoneme.Finally, the discrimination power is examined when a part of the connections among units is destroyed or the connection strength of some units is varied. It is shown that the discriminating power is not affected by the change of the weight of the connection between the input layer and the hidden layer, with the effect on the output unit being less than several percent. This result indicates that the neural net model has a feature of distributed memory.
A point pattern matching algorithm
Authors: Umeyama Shinji 
Published: July 2007

AbstractThis paper presents an algorithm for finding a matching between two point patterns given in m‐dimensional Euclidean space. The point pattern matching algorithm here is formulated as a tree search procedure, and the search tree is pruned by a specified tolerance measure for matching. The proposed method is based on the locations of points and is invariant to rotation, translation, and scaling. Moreover, to guide the search, it is easy to use global geometric constraints, such as rotation or scaling parameters.
Approximate performance evaluation of parallel processing systems using average concurrency
Authors: Jittawiriyanukoon Chanintorn , Nakanishi Hikaru , Tezuka Yoshikazu , Watanabe Takashi 
Published: July 2007

AbstractFor the performance evaluation of the parallel processing system of a set of concurrent programs (program group), several methods have been proposed such as decomposition approximation, which consider the program group with fixed concurrency. On the other hand, this paper proposes an innovative approximation method considering a more general program group in which the concurrency changes for each program or with time.First, the average concurrency is determined which is the average of the concurrency of the program group. Then the decomposition approximation is applied to two integers giving bounds to the average concurrency, and the characteristic parameters such as throughput are determined. The two obtained sets of characteristic parameters are averaged with weight, providing the evaluation for the given system. By this method, a system which cannot be handled by the decomposition approximation can now be evaluated. The method has an advantage that the computation can be performed with a very small number of state spaces. Because of this property, the parallel processing system can be evaluated with a high speed and a small memory.Finally, the results obtained by the proposed method and the results of discrete event simulation technique by a supercomputer are compared for several models, and it is indicated that a sufficient accuracy is realized.
A polynomial time validation method for channel boundedness of communication protocols (2 processes)
Authors: Suganuma Tomohisa , Kurosawa Kaoru , Yongmao Ni 
Published: July 2007

AbstractThe number of messages on a communication channel must be bounded. On the other hand, it is known to be undecidable whether or not the given communication protocol satisfies the condition. The communication protocol is modeled in most cases in the form of a communication between two finite‐state machines. Yu and Gouda have shown that if the message is of a single type in such a modeled protocol, the boundedness of the channel is decidable. However, it is not known whether or not this problem can be answered in a polynomial time. This paper presents a method of validation for the boundedness of the channel, where the validation time is a cubic order of the number of states. The result is important in the sense that if the channel is bounded in the communication protocol where all messages are transformed into a single type, the channel is also bounded in the original communication protocol.
An extended syllogistic system with verbs and proper nouns, and its completeness proof
Authors: Noritaka  , Kenichi  , Shigenori  
Published: July 2007

AbstractSyllogism (Aristotle's categorical syllogism) is a logic scheme which can describe derivation relations of propositions stating relations among quantified “terms” (corresponding to common nouns). In this system, relations of the terms are treated directly, while in predicate logic they are decomposed into relations among individual objects. Therefore, syllogism has several advantages in describing the meanings of a natural language in a formal framework of a logic system. However, the expressive ability of classical syllogism is poor in that it can treat only a proposition corresponding to a sentence whose predicate is “be” + noun (i.e., “is‐a” sentence) and cannot treat a sentence with a general verb (or “be” + adjective) in its predicate (we call it a verb sentence). Furthermore, terms in classical syllogism are only those corresponding to common nouns, and thus proper nouns, which cannot be quantified, are excluded.
Behavioral Specification of Nondeterministic State Machines by Event Sequence Sets
Authors: Member Nagatsugu Yamanouchi 
Published: July 2007

AbstractA method for extending the behavioral specification and verification of state machine networks by event sequences to non‐deterministic behavior is presented. The nondeterministic behavior is described by a function between sets of event sequences instead of between sequences. Both the module composition and loop connection operations are modeled by the function composition and the least fixed point, respectively, just as in the deterministic case. Two application examples are described. The example with alternating bit protocol via unreliable communication lines indicates that the method detects the possibility of message stack just as the verification by temporal logic does, while the proof steps of our method are shorter. The second example discusses the cause of the Brock‐Ackerman anomaly and a condition to avoid it.
Determination Method to Identify Effective Software Testing Areas: Detection of Software Defects Related to External Specification Changes
Authors: Kaneko Takeshi , Members Takeshi Nakajo 
Published: July 2007

AbstractA tremendous amount of time is spent in testing in the development of software products. Most of the test methods at present, however, are inefficient since the characters of the software defects are not well considered. From such a viewpoint, an efficient software test should be executed, taking into consideration the characteristics of the software defects. Examining the actual defects, it is found that a large number of defects exist due to specification changes. On the other hand, no testing method has been developed aiming at the detection defects of this type. Thus, it is necessary to develop a method of testing that can effectively detect the incorrect modifications accompanying the specification changes. As a result of detailed examinations of the actually produced defects due to specification changes, a concept called restriction element is introduced, and it is shown that the defects can adequately be described as the incorrect elimination/addition of that element. A theorem is shown which indicates when an incorrect elimination/addition of restriction element is produced, which of the input areas contain the data producing a behavior different from the specification. A method of determining test input areas is proposed based on that theorem. The test, based on the proposed determination of the test input area, can securely and effectively detect the incorrect modification accompanying the change of external specifications.
Design of a fault‐tolerant arithmetic circuit based on distributed coding and its evaluation
Authors: Member Takeshi Kasuga , Kameyama Michitaka , Higuchi Tatsuo 
Published: July 2007

AbstractThe robust fault tolerance is a property that even if an error occurs in the arithmetic circuit, the result of operation does not differ much from the correct value. Such a property will become more important in the construction of a highly safe system. In the present digital system, the weighted code is used in representing numerical information. In this scheme, when an error occurs in a bit with a large weight, the result of operation will differ greatly from the correct value, affecting the safety of the whole system. from such a viewpoint, this paper proposes the distributed coding, i.e., the arithmetic circuit based on the number system with uniform weight 1. It is shown theoretically together with the result of execution that such a circuit is much better than the arithmetic circuit based on the weighted traditional code, in terms of the robust fault tolerance, i.e. the safety.
Effectiveness of making internal representations redundant in neural networks for solving optimization problems
Authors: Member Itsuo Kumazawa 
Published: July 2007

AbstractIn solving an optimization problem using a neural network, the representation schema which codes the solutions of the problem onto the configurations of the states of neurons must first be defined. The coding schema is called an internal representation of the problem and the representation is considered redundant when the schema uses only those configurations which are separate from each other at long Hamming distances. Under some conditions, the redundant representation is shown to be very effective in eliminating the local minima problem, which is one of the most crucial problems in the application of neural networks to optimization problems. In the redundant representation, a stochastic property which appears asymptotically when increasing the number of neurons plays an important role when the solution is read reliably from the random and erroneous states of networks. In these networks, a probabilistic states transition schema is introduced so that the network can escape from the local minima. By introducing the redundancy, the randomly changing configuration can keep the order in which the solution can be read while sufficiently preserving the randomness to escape from the local minima. The result in this paper shows a novel optimization capability of the network which has a highly parallel and nondeterministic computation schema as described in the foregoing.
Segmentation and recognition of color‐dot characters with complex background
Authors: Yamada Hiromitsu , Yamamoto Kazuhiko 
Published: July 2007

AbstractAs an example of character recognition from overlapping data, this paper presents the recognition of Ishihara's color vision test chart, where a color character composed of color dots is embedded in a background composed of color dots. The histogram is constructed on the normalized tri‐color coordinate, and the representative color is determined as the maximal point of the histogram. The distance pattern is constructed based on the representative colors, and the shape skeleton is extracted by the DP matching between the distance pattern and the category dictionary. The line width and the final position are determined by an examination based on the variance criterion. It is shown that the DP matching is useful in the hypothesis testing for the object, where both the background and the character are multivalued color textures.
Performance Evaluation of Multilayered Protocol
Authors: Saito Tadao , Shirahata Atsushi 
Published: July 2007

AbstractThe protocol on the OSI basic reference model is standardized as a hierarchical model composed of seven layers. Protocols of some layers are applied link‐by‐link and protocols of other layers are applied end‐to‐end. The transmission timing of the protocol data unit of each layer depends on the network configuration as well as the protocol parameters. Consequently, there is a possibility that the throughput of the network is deteriorated unless the protocol parameters of each layer are determined adequately according to the network configuration. This paper considers the network containing the transport layer, network layer and data link layer of OSI protocol, and the performance is evaluated from the viewpoint of transmission efficiency, which is a measure in evaluating the network throughput. The relation between the protocol parameters and the throughput is derived. As the protocol parameters, the transmission speed, transmission delay, data unit length, window size, number of intermediate nodes, bit error rate and protocol processing time are considered. The protocol parameters can be determined based on the presented results.