摘要:

AbstractThe behaviors of such concurrent systems as array processors, should be considered to be a compound interaction of temporal and spatial properties. Thus it is important in expressing semantics to consider both time and spatial axes. However, up to now, few researches have been conducted for a method which treats both axes within the same framework. As a result, previously, we proposed a propositional modal logic ETSL and investigated its model theoretic aspect. In ETSL, the existence theorem of the finite model holds when only finite space is treated. This paper investigates the formal system of ETSL and gives a complete and consistent axiom system for the restricted ETSL which treats only finite spaces. This axiom system is constructed by adding some axioms characterizing time and space to Segerberg's axioms for propositional dynamic logic. Some fundamental operators, e.g., an operator representing “simultaneity,” play important roles in this axiom system. Completeness is proved based on the existence theorem of the foredescribed finite mo

ISSN:0882-1666    

DOI:10.1002/scj.4690180601

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

年代:1987

数据来源: WILEY

摘要:

AbstractThis paper considers various personal identification systems based on questions and answers concerning knowledge inherent to the individual, and discusses the personal identification probability. Assume a personal identification system which containsNknowledge items and assume that a solver has forgotten the correct answers forMitems after the registration. The behavior of the system is as follows:Qknowledge items for questions are selected randomly fromNitems. For each of the selected items,Rselection keys are presented which include a correct answer and the solver is requested to select one. When the solver forgets the correct answer, the probability of correct answer is 1/R; otherwise it is 1. The following three systems are considered under such conditions. System I decides the solver as correct if all answers to the extractedQitems are correct. System II decides the solver as correct if there are fewer thanKincorrect answers. System III decides the solver as correct unlesskor more consecutive answers are incorrect. It is seen that the probability of personal identification increases in the order of I, II and III. It is not always true that the probability of excluding an incorrect solver is low if the probability of personal identification is high. Each of the considered systems is suited to particular applications, depending on the environment.

ISSN:0882-1666    

DOI:10.1002/scj.4690180602

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

年代:1987

数据来源: WILEY

摘要:

AbstractRecognition of lines in drawings is a major task in automatic data acquisition for CAD (computer‐aided design). This paper proposes an algorithm for the recognition of dashed and chained lines in graphical images. This algorithm consists of two major steps: the local recognition step which extracts local connectivity of line segments, and the global recognition step which performs route finding of connected segments based on syntax. The syntax is usually specific to each type of drawing, and is represented as rules. The performance of the proposed algorithm is demonstrated based on experiments using LSI cell drawings and topographical maps containing dashed and chained lines as graphical component

ISSN:0882-1666    

DOI:10.1002/scj.4690180603

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

年代:1987

数据来源: WILEY

摘要:

AbstractThis paper describes a method by which a robot with vision can detect moving objects or obstacles in an environment, by analyzing the consecutive images obtained during its movement in an artificial environment such as inside of a building or a plant. In this paper, it is assumed that the environment is a corridor in a building, which satisfies the following two conditions.(1) The wall of the corridor is planar and is vertical to the floor, and (2) the floor is flat. Under these two assumptions, the optical flow pattern can be estimated for the background (corridor). Assuming that the moving object is performing a parallel translation, the moving object can be extracted from the background by comparing the relative magnitudes of their optical flows, providing the necessary informations to the moving robot. The proposed method has a versatility since no geometrical model is employed which is composed of numerical data. The method utilizes only those properties which are valid in most cases of the artificial environment. An experimental example, the result of analysis for a corridor in a building is shown.

ISSN:0882-1666    

DOI:10.1002/scj.4690180604

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

年代:1987

数据来源: WILEY

摘要:

AbstractThis paper discusses the recognition of the consonant (except the consonant at the top of the word) in a word for unspecified speakers. First, the consonant section is detected based on the power dips extracted from the low‐ and high‐frequency power information, together with the nasal and unvoiced properties.Applying the discrimination diagram to the detected low‐ and high‐frequency dips, the phoneme is classified into the four phoneme classes (rough classification). Then methods are discussed which discriminate the individual phonemes in the phonemes group by pattern matching (fine classification). Using the time‐series pattern of the LPC cepstrum coefficient as the parameter, it is shown that the comparison with the standard phoneme patterns using the Bayes' discriminant and the Mahalabinos distance is the most useful. The result of recognition experiment using the segmentation, rough classification, and fine classifications is presented. For twenty subjects of both sexes, the mean recognition rate of 78.1 percent was

ISSN:0882-1666    

DOI:10.1002/scj.4690180605

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

年代:1987

数据来源: WILEY

摘要:

AbstractWith the widespread use of factory automation, there has been an increasing demand for the recognition of stamped characters. The stamped characters are sometimes of high‐quality, and sometimes of low‐quality, due to the variation of hollow depth and shape. This paper discusses the thresholding method for the recognition of such low‐quality stamped characters. The proposed method determines the optimum threshold characteristic for each stamped character, by which the thresholding for each character is performed. The recognition experiment was performed using 120 samples of stamped characters O, D and 8 of low quality. Ninety‐four samples were recognized correctly by the traditional fixed‐thresholding method, while all 120 samples were recognized correctly by the proposed optimum thresholding method. The recognition rate was examined for 2000 samples composed of sixteen alphanumerals. The correct recognition rate was 99.8 percent, indicating that the proposed method is effective. The stamped character recognition system has been developed for the cylindrical machine part, which can recognize 3 digits of sixteen alphanumerals

ISSN:0882-1666    

DOI:10.1002/scj.4690180606

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

年代:1987

数据来源: WILEY

摘要:

AbstractThis paper discusses the conceptual design of a knowledge processing system. First, by means of knowledge processing technology, a new relationship is established between man and computers, and it becomes possible to adopt a new problem‐solving style. The paper discusses also the need to analyze the types of problems man has to solve, the manner of problem solving, and the limit to the capability of knowledge processing to design an effective computer‐aided problem‐solving system. It is concluded that the new problem‐solving system must be a knowledge processing system founded on the model‐based method. Then the requirements for the knowledge processing system and, in particular, for the knowledge representation language, are discussed. Finally, an example is used to show that a system satisfying these requirements is possible.Here, the importance of the model building concept is stressed for establishing the new problem‐solving style and the declarative langauge including data structure for realizing the knowledge processing system that can aid the process. In general, the real problems are very complex, and it is impossible to solve them by a simple procedure. However, we have to approach the solution through a trial‐and‐error process. The knowledge processing system must be able to aid man in this process very naturally and without any restrictions on m

ISSN:0882-1666    

DOI:10.1002/scj.4690180607

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe analysis of a nonlinear network is reduced to the solution of a system of equations at each step of Newton's method. In the solution by the direct method, the highspeed realization of the LU decomposition of an large‐scale sparse matrix has become important with the development of the integrated technology. In the past, the applications of the array processor and the supercomputer have been considered. However, the array processor cannot utilize the sparsity of the matrix, resulting in an impractical system with too many processor cells. The efficiency of the vectorization is a problem in the super‐computer, when it is used for the Gauss elimination only for the nonzero elements in the matrix. This paper proposes a dedicated processor for LU decomposition of a large‐scale sparse matrix, which can utilize the sparsity of the matrix and can be realized with a practical number of processors. The processor is composed ofqlocal units, corresponding to the nonzero elements in each row of the coefficient matrix, and those units operate in parallel. In the processing of a sparse matrix, the matching of the label is required in the Gauss elimination. It is realized with a high speed by the data‐shift operation by the inter‐register transfer. Furthermore, a processor with a hierarchical memory structure is proposed which can cope with the case where the numberpof nonzero elements in a row

ISSN:0882-1666    

DOI:10.1002/scj.4690180608

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

年代:1987

数据来源: WILEY

摘要:

AbstractAn architecture is proposed for the dataflow computer and an experimental system is constructed. However, since the emphasis has been on the realization of the computer, it has been difficult to estimate the general performance of the dataflow computer from the performance of the experimental system. This paper describes the result of simulation to estimate the general performance.

ISSN:0882-1666    

DOI:10.1002/scj.4690180609

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

年代:1987

数据来源: WILEY