|
1. |
Analysis and evaluation of sampling methods in binary pattern matching |
|
Systems and Computers in Japan,
Volume 20,
Issue 2,
1989,
Page 1-14
Seiji Kashioka,
Masakazu Ejiri,
Preview
|
PDF (1069KB)
|
|
摘要:
AbstractBinary image pattern matching is used widely in character and symbol recognition, and to determine pattern positions [1, 2].Binary level deviation and superposition of noise have been reported as the causes of inaccuracy in matching between the template and image patterns. As a result, measures have been reported to solve this problem. However, these measures have not been entirely effective. There still remain problems of pattern change due to sampling deviation and error in matching caused by this change.This paper presents a method to prevent sampling errors by using Boke processing [3, 4]. Also, the matching errors which occur due to binary pattern sampling are analyzed and measures to reduce them are proposed.
ISSN:0882-1666
DOI:10.1002/scj.4690200201
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
2. |
A prolog machine based on vlsi algorithms |
|
Systems and Computers in Japan,
Volume 20,
Issue 2,
1989,
Page 15-24
Yasuro Shobatake,
Hideo Aiso,
Preview
|
PDF (710KB)
|
|
摘要:
AbstractThis paper proposes a Prolog direct executer called PMV‐2. To alleviate the von Neumann bottleneck, PMV‐2 is provided with a number of processing elements, each of which stores a term symbol. Using the processing elements, the operations for terms can be executed in parallel. To simplify the algorithm for mapping the tree‐structured data onto processing elements, data are represented by a format called symbol‐line expression. Tree‐structured data with this expression are mapped onto an array which has straight‐line arrangement for processing elements. The configuration of the tree‐structured data on the processing element array can be modified using the methods called Partial Global Communication and Partial Shift. To implement a large number of processing elements, PMV‐2 is constructed based on the VLSI algorithms. A performance evaluation has been made, revealing that the processing speed of approximately 450 kLips is obtained by PMV‐2, which is nearly the same as that of a presently available high‐speed Prolog sys
ISSN:0882-1666
DOI:10.1002/scj.4690200202
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
3. |
Representation of teaching‐world knowledge and the method of the inference for intelligent cai |
|
Systems and Computers in Japan,
Volume 20,
Issue 2,
1989,
Page 25-37
Toshio Okamoto,
Preview
|
PDF (884KB)
|
|
摘要:
AbstractThis paper considers the learning world of differential calculus for composite functions, including trigonometric functions, and describes the mechanism of an intelligent CAI system NEUTON. In the design of the system, the teaching world is divided into the meta‐knowledge‐base for dialog management, the text knowledge‐base, the problem‐solving expert knowledge, the rule‐base for tutoring strategy, and the bug knowledge. The modular structure is thus considered for the knowledge‐base. The representation of knowledge and the method of inference are considered, utilizing the characteristics of such knowledge as follows.The text knowledge is based on the semantic network representation, where the procedural knowledge is supplemented. Other knowledge bases are described by the production rules. The knowledge structure is simplified so that the interpretation and the execution are made by a single meta‐inference engine. The response of the student as well as his level of understanding are recognized and diagnosed utilizing those knowledges, and the individual guidance process is developed. In the intelligent CAI, important mechanisms are those for identifying the cause of the error, and the determination of the micro‐ and macroscopic means of remedy from the knowledge‐base. In this paper, a schema is described where the bug generation, diagnosis mechanism, problem‐solving expert mechanism and the student model called MOD are c
ISSN:0882-1666
DOI:10.1002/scj.4690200203
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
4. |
A real‐time recognition of languages for bounded cellular automata |
|
Systems and Computers in Japan,
Volume 20,
Issue 2,
1989,
Page 38-51
Hiromi Miyajima,
Preview
|
PDF (800KB)
|
|
摘要:
AbstractWith the progress of VLSI technology, researchers are more interested in parallel computation. For example, discussions are made on the parallel processings such as the recognition of language, sorting, matrix computation and graph processing, using the systolic array, the iterative array, and the bounded cellular automaton. It was shown in a previous paper that the bounded cellular automaton is properly faster in the recognition of language than the systolic array, i.e., one‐way cellular automaton. This paper is a continuation of that previous paper, and shows that the bounded cellular automaton can recognize in nearly half the time the class of languages which can be recognized in real tim
ISSN:0882-1666
DOI:10.1002/scj.4690200204
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
5. |
Construction of associative memory from incomplete memorized information using space reduction method |
|
Systems and Computers in Japan,
Volume 20,
Issue 2,
1989,
Page 52-59
Kenji Murakami,
Yasuhiro Yamajo,
Tsunehiro Aibara,
Preview
|
PDF (626KB)
|
|
摘要:
AbstractVarious studies have been made on the construction of associative memory. This paper proposes a method of constructing an associative memory which exhibits almost the same associative ability as in the case where true information is given, even if an incomplete memorized information is given. The construction of the associative memory from the incomplete memorized information (learning pattern) is an important problem related to the learning function of the associative memory. The proposed method is to perform the singular‐value decomposition of the space spanned by the learning pattern, from which the space spanned by the memorized pattern is extracted. The difference of the singular values is utilized in the extraction of the space spanned by the memorized pattern. In the actual construction of the associative memory, it may frequently happen that only the incomplete memorized information disturbed by noise is available. It is very important from the practical viewpoint to consider the construction of the associative memory in such a noisy environment. In the proposed method, it is not necessary to know to which memorized pattern each learning pattern belongs (i.e., supervisor). The method is thus a kind of learning without a supervisor. This paper discusses also the construction of the associative memory with a supervisor, together with the role of the supervisor in the associative memor
ISSN:0882-1666
DOI:10.1002/scj.4690200205
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
6. |
MR image reconstruction from half the data using a phase map |
|
Systems and Computers in Japan,
Volume 20,
Issue 2,
1989,
Page 60-66
Koichi Sano,
Kazuo Suzuki,
Tetsuo Yokoyama,
Hideaki Koizumi,
Preview
|
PDF (564KB)
|
|
摘要:
AbstractThis paper describes a method of image reconstruction from approximately half the data in the measurement space, as a means to reduce the measurement time in magnetic resonance imaging (MRI). In the conventional method, the property of the data where the image is of a real value, is utilized. Consequently, it is not applicable to the case where the image contains a large phase distortion. This paper derives first the theoretical relation among the measured data for the image with arbitrary phase. The condition is shown for the image to be reconstructed using the phase information from the partially measured data. Then a recurrence formula is derived by which the remaining unknown data can be determined by fast‐Fourier transform. By the proposed method, the image can be reconstructed from approximately half the data, including the data needed to estimate the phase. As a result of the simulation and volunteer experiments, it was verified that a satisfactory image can be reconstructed from approximately 53 percent of the dat
ISSN:0882-1666
DOI:10.1002/scj.4690200206
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
7. |
An implementation of multiple‐valued logic circuit with cmos multiple‐valued output gates |
|
Systems and Computers in Japan,
Volume 20,
Issue 2,
1989,
Page 67-77
Izumi Sakata,
Preview
|
PDF (541KB)
|
|
摘要:
AbstractWith the progress of high‐density information handling technology, multiple‐valued logic is considered interesting. Studies have been made on the applications to the high‐density VLSI and the optimally multiple‐valued information processing systems. This paper considers the use of a CMOS multiple‐valued output gate, and proposes an implementation of the multiple‐valued logic circuit, which is suited to the integration from the viewpoints of the integration density and the power consumption. The CMOS multiple‐valued output gate produces a multiple‐valued output from the predetermined number (n‐ 1 forn‐valued case) of binary inputs. Compared with similar multiple‐level output circuits proposed up to now, the gate has the feature of simple structure and easy correspondence to arbitraryn‐valued function. In the design of the multiple‐valued logic circuit by the proposed method, the inputs to the multiple‐valued output gate are determined first from the required multiple‐valued output. Then the logic circuit satisfying the inputs is constructed from the literal circuit with multiple‐valued inputs and binary logic circuits. Design examples by the proposed method are presented. It is shown especially for the arbitraryn‐valued case that the design is simplified since the inputs to the multiple‐valued output gate can be represented in the general form. Several rules for deriving the general form are described. Finally, it is made possible to implement the multiple‐valued logic circuit, whic
ISSN:0882-1666
DOI:10.1002/scj.4690200207
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
8. |
Trial‐and‐error method for automated test data generation and its evaluation |
|
Systems and Computers in Japan,
Volume 20,
Issue 2,
1989,
Page 78-92
Hiroshi Inamura,
Hideo Nakano,
Yoshiro Nakanishi,
Preview
|
PDF (953KB)
|
|
摘要:
AbstractThis paper discusses the trial‐and‐error method for automatic generation of test data. First, the performance of a simple trial‐and‐error method is discussed and an idea of improvement is shown. Then an improved trial‐and‐error method is proposed. In this method, the dynamic determination of the range of the random variable for the linear path predicate is considered. The problem is linearized in the trial‐and‐error process for the path predicate containing nonlinear conditional expressions, and then the order of determination of the variables is also considered. The dynamical determination of the order of the variable is considered for the path predicate containing the ambiguous array reference. Finally, the method is evaluated b
ISSN:0882-1666
DOI:10.1002/scj.4690200208
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
9. |
Auditory compensation effects in symmetrical three‐vowel sequences and a model of perceptual phoneme boundary |
|
Systems and Computers in Japan,
Volume 20,
Issue 2,
1989,
Page 93-104
Teruhiko Ohtomo,
Susumu Yasuda,
Takao Ohuchi,
Ken'Ichi Hara,
Preview
|
PDF (932KB)
|
|
摘要:
AbstractTo recognize the continuous speech by phonemes, the coarticulation must be analyzed. This paper presents a result of psy‐choacoustic experiment for symmetrical three‐vowel sequences, which are generated by the terminal‐analog‐type speech synthesizer, indicating the auditory compensation effects in coarticulation on the phoneme perception. Using each of five Japanese vowels as a reference vowel V0, the symmetrical three‐vowel sequences, /V0‐VV0/ are formed. The distribution of the perceptual phoneme for the middle vowel is examined first. By comparing the results with the perceptual phoneme distribution for five stationary vowels, the shift of the perceptual phoneme distribution due to the auditory compensation effect is investigated. A model is proposed for the boundary shift in the perceptual phoneme distribution. In the model, the 50‐percent phoneme boundary of the perceptual phoneme distribution for five stationary vowels is approximated by straight lines on theF1‐F2logarithmic plane. The straight lines are contracted in the direction of (F1,F2) point of the reference vowel along theF1andF2axis. The proposed model is applied to the perceptual phoneme distributions of the middle vowels in the symmetrical three‐vowel sequences, and its usefulnes
ISSN:0882-1666
DOI:10.1002/scj.4690200209
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
|