摘要:

AbstractThe feature‐detecting circuits based on the pulse‐type hardware neuron model using a ∧‐shaped transistor to apply neuron information processing in a living body to engineering applications is studied. Previously, the properties of the pulse‐type hardware neuron model were shown using a ∧‐shaped transistor and a temporal feature‐detecting circuit designed with the ON‐response pulse‐type hardware neuron model was presented.This paper discusses spatial feature‐detecting circuits based on the pulse‐type hardware neuron model using a ∧‐shaped transistor. First, the properties of the Neural AND Gate based on the pulse‐type neuron model are shown and the design requirements and the output regions are clarified by operation analysis for local peak, local valley, and slope‐detecting circuits. These circuits are applications for spatial feature detection. Second, the experimental results on the three detecting circuits designed with the pulse‐type hardware neuron model using a ∧‐shaped transistor are shown. Finally, it is concluded that the pulse‐type hardware neuron model using a ∧‐shaped transistor is useful for both spatial feature‐detecting cir

ISSN:0882-1666    

DOI:10.1002/scj.4690201101

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractThe traditional speed improvement of the logic language processing system has been based on the parallelism of clauses, and aimed at speeding up of the unification. However, there can be another approach. By introducing a specific function to the memory hardware, the database can be managed independently of the host CPU. Then the speed is improved by minimizing the data traffic through the von Neumann bottleneck in the retrieval of candidate clauses. This paper proposes a pattern associative memory (PAM) which maintains the clauses by the structural representation in it and retrieves them by pattern matching with a high speed. To make use of argument parallelism of clauses, parallel hashing is adopted in PAM. The individual hash table employs some local search algorithms in combination with the open addressing scheme of hashing to improve the efficiency of managing records within clusters. It was verified by simulation that the compound hash algorithm is sufficiently useful for the load factor of 60 percent or less. A PAM hardware is implemented and applied in Prolog processing to demonstrate the feasibility and usefulness of the proposed method.

ISSN:0882-1666    

DOI:10.1002/scj.4690201102

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

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.

ISSN:0882-1666    

DOI:10.1002/scj.4690201103

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractThis paper discusses the high‐speed DP‐matching as the speech recognition algorithm including connected word sequence recognition. The first improvement is the frame synchronization. By this elaboration, an improvement of the speed by approximately one order of magnitude is achieved, compared with the consecutive word recognition of two‐level DP‐matching type, where DP‐matching is iterated by assuming that any time in the input speech can be the word boundary. The second improvement is the introduction of the beam search.This paper discusses the practical aspects of combining the beam search and DP‐matching. The discussion includes the construction of the work area, control of DP recursive expression and other problems, aiming at an effective reduction of the computational complexity for the recursive expression. The third improvement is the built‐in vector quantization. It is shown that an effective reduction of the computational complexity for the local distance can be produced through a skillful integration of the beam search and the vector quantization.Through an evaluation experiment for the discrete word, it is seen that there is a possibility of achieving the speed improvement by a factor of 30. This corresponds to the speed improvement of two or more orders of magnitude, compared with the two‐level DP‐matching for the consecutive word sequence reco

ISSN:0882-1666    

DOI:10.1002/scj.4690201104

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractImportant themes in research of autonomous mobile robots are recognition of environment and navigation planning. This paper describes the vision system of a mobile robot for recognizing the indoor environment. Line segments in the environment are found and their three‐dimensional (3‐D) positions are determined by using a binocular stereo method and a motion stereo method. It is difficult to acquire complete 3‐D information by a single observation from a point in space. Consequently, a series of observations is made at different points and, by combining the results, the 3‐D world model is updated successively. The indoor navigation of the robot is made by iterating the cooperative motion and observation. Correspondences of line segments among the observed images are established by using a competition matrix based on the similarity of segments. Based on the obtained incomplete 3‐D world model, the image viewed at the next point is predicted which makes the correspondence easier. In addition, the accurate motion of the robot is estimated, guided by the prediction of

ISSN:0882-1666    

DOI:10.1002/scj.4690201105

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

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 protoco

ISSN:0882-1666    

DOI:10.1002/scj.4690201106

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractMammography is one of the tools in the diagnosis of breast cancer. By a new method of mammography based on the soft X‐ray and the ultrafine X‐ray film, the X‐ray exposure is reduced and the fine internal structure of the breast can be observed. With the increase of the subjects for breast cancer, it is required to improve the accuracy and efficiency of the diagnosis. A diagnosis‐supporting equipment is required which provides an image display to assist in recognition of pathological changes, and provides an objective feature evaluation. This paper considers the microcalcification which is important in the diagnosis of the early breast cancer. The microcalcification appears as opaque points on the mammograph, and when the points are concentrated locally, it is diagnosed as malignant.After the emphasis by Laplacian processing, cell division was applied. The cell with aggregated microcalcification was extracted, and the image display was made so that the feature difference between cancerous and noncancerous lesions can be recognized. To arrive at a numerical representation of the feature difference, the following parameters were considered: (1) effective distance between cells; and (2) rate of change of the number of cells with regard to the change of the threshold.As the result of processing 37 cases, including 14 benign cases and three normal cases, up to 14 of 15 malignant cases were able to be separated from other benign and normal cases, using those two par

ISSN:0882-1666    

DOI:10.1002/scj.4690201107

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractThe dynamic retrieval system is considered as a means to construct a database for actual three‐dimensional (3—D) objects, such as commercial goods, art works, animals and plants. In the dynamic retrieval system, the image data are given as the input continuously along the virtual semisphere covering the object. Since a large amount of image data is produced in this way, onlyNrepresentative image data are extracted and stored. Apart from those representative image data, dynamical image data are prepared for rotation and display of the object in the partial area of the terminal screen. The user rotates the object displayed on the partial screen in an interactive way using a joy stick or other device.The outline of the object is examined and the next viewpoint to observe the object is determined. Then the representative image data corresponding to that viewpoint is displayed on the terminal. A problem in this dynamic retrieval is how to select theNrepresentative image data from the continuously observed image data.For this problem, this paper proposes the following algorithm. Two images are taken by viewing the object from two different viewpoints. The variety of object sampling points is defined as an objective measure to represent the difference of information as sensed substantially by the human observer. Then, using that variety of object sampling points, the viewpoint for the representative image data is determined. A result of experiment is presented where the proposed method is applied to determine the representative viewpo

ISSN:0882-1666    

DOI:10.1002/scj.4690201108

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractSequential‐type image processing algorithms for distance transformation, thinning, labeling, etc., cannot be executed efficiently by supercomputers because of the recursive data dependency between the neighborhood operations for pixels. This paper proposes a diagonal scan to replace the conventional television‐type raster scan for the efficient execution of sequential‐type distance transformation algorithms by supercomputers.It is shown for four and eight neighborhood sequential distance transformation algorithms that by changing the direction of the raster scan, the recursive data dependencies between the neighborhood operations within the same scan are removed, that parallel processing by scan line is therefore possible, and that an image processing algorithm equivalent to the original one can be obtained for the new scanning method. To verify the effectiveness of the diagonal scanning a sequential‐type distance transformation algorithm was executed on a supercomputer, the VP100. The result is five to ten times faster than the conventional sequential‐type distance transformation algorithm executed on a general‐purpose computer, the M382. It is also five to ten times faster than conventional sequential‐type distance transformation algorithms executed on a supercomputer, which shows that the diagonal scan

ISSN:0882-1666    

DOI:10.1002/scj.4690201109

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractThis paper proposes a performance evaluation model to analyze the transmission delay time in the multilink HDLC procedure, which is a standard data link layer protocol in the OSI reference model to realize an effective and reliable transmission protocol on standard HDLC procedure. This paper proposes a delay time model consisting of three submodels, i.e., the send station model, the transmission line model, and the receive station model. In an asynchronous balance mode over a point‐to‐point configuration, the total delay time of the system is composed of delay time from departure time of an information frame at the send station to arrival at the receive station and time consumed for frame sequence number rearrangement at the receive station. Characteristics of the multilink HDLC procedure are evaluated in numerical examp

ISSN:0882-1666    

DOI:10.1002/scj.4690201110

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY