摘要:

AbstractIn resolution theory, logical formulas of a theorem and axioms must be converted to a form of a clause set (a set of clauses).For more efficient proof, it is desirable that an original clause set is a Horn set. Renaming is one of the operations which can convert a given clause set to a logically equivalent Horn set.To perform the operation for a clause set, negation signs of all literals that have the same predicate symbol should be inverted simultaneously. However, it is difficult to perform the operation systematically and efficiently.In this paper, a symbolic matrix called “literal reverse matrix” is defined for each literal in a clause. Moreover, the definition of reverse matrix is extended for a clause.All renamings which convert a given clause to a Horn clause are derived from clause reverse matrix. Consequently, all renamings which convert a given clause set to a Horn set are synthesized from renamings for each clause in the

ISSN:0882-1666    

DOI:10.1002/scj.4690180701

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

年代:1987

数据来源: WILEY

摘要:

AbstractThis paper discusses the problems and basic principles in the design of the algebraic language ASL/. A text of ASL/ is composed of a context‐free grammar and a set of (conditional, in general) axioms, and specifies the set of expressions and the congruence relation on the set. The set of expressions and the syntax of each expression are specified by the context‐free grammar. The congruence relation on the set of expressions is defined as the minimal equivalence relation, which satisfies the axioms and is closed under the “operations,” i. e., the substitution into a “subexpression.” The value of an expression and the concept of the realization are defined based on the congruence relation. The “projection” is a special case of the conditional axiom, which is a facility to include only the expressions satisfying the specified syntactical condition. Projection is useful for including primitive functions and procedures with parameter passing of call‐by‐value in a text, and also for description of a specification of a realizat

ISSN:0882-1666    

DOI:10.1002/scj.4690180702

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe pattern‐separating function of the two‐layered random nerve‐net, which has forward inhibitory connections, depends on the input structure of the second layer. Among the nerve‐nets with various input structures, the nerve‐net with the fixed number of input connections exhibits a very interesting property that under a certain condition, the input patterns are separated uniformly, independently of the overlapping rate of the patterns. This paper derives the theoretical expression for this property as a polynomial of the overlapping rate among the input patterns. Based on the theoretical expression, the condition is derived for the input patterns to be separated uniformly, independently of the overlapping rate among patterns. Then an example is considered and the condition is examined in detail. The effects of the input pattern and the firing rate of the second layer on the separation are discussed. As a result, it is shown that the pattern separation can be improved by controlling the firing rate of the second layer to a small value, and the patterns with larger firing rates are better

ISSN:0882-1666    

DOI:10.1002/scj.4690180703

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

年代:1987

数据来源: WILEY

摘要:

AbstractNumerous researchers have recently become interested in the information processing in the brain. This is because the brain seems to process information in a mechanism which is completely different from that of the computer. The parallel information processing, learning and self‐organizing ability, as well as the memory mechanism of the brain, present interesting principles of information processing which will be very helpful in the design of future computers. To arrive at a clear understanding of those principles, various attempts have been made to describe the underlying principles in a mathematical and systematic way, in parallel to the examination of the behavior of the neural network model. This paper outlines those efforts from the viewpoint of pattern dynamics of the neural field and the visual information processing, learning function in the input‐output characteristics and the control of movement, self‐organization of information recognition mechanism, the associative model, and its stochastic realization. However, this paper aims not only at a review of the present status, but also at pointing out the present problems such as the bottleneck, indicating the problems posed and the direction of the new possible resea

ISSN:0882-1666    

DOI:10.1002/scj.4690180704

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

年代:1987

数据来源: WILEY

摘要:

AbstractIn the construction of the animation drawing of people and animals using a computer, a drastic reduction of human effort will be realized by automating the painting process. This paper describes an automatic painting method in which the closed region in two consecutive line drawings containing more than one closed region can be identified by motion analysis. For each point on the contour of the closed region in the line drawing, the deformation vector representing the deformation of the closed region and the motion vector representing the motion of the closed region, are defined. The sum of the products of the lengths of the formation vector and the motion vector over the whole closed region, is regarded as the magnitude of the motion of that closed region. A large number of different motions can be conceived of for the closed region from frame to frame, and the principle is set that the most probable motion among the possible motions is the one which minimizes the sum of the motions of the closed regions. Based on this principle, the closed region is identified by determining the motion of the closed region between the two line drawings. This paper describes the algorithm of the proposed method and the result of application to the actual animation.

ISSN:0882-1666    

DOI:10.1002/scj.4690180705

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe cyclic ST‐AN code is a cyclic AN code based on a ternary number system using numerals ‐1, 0, 1 (called symmetrical ternary number system). It is suited to the arithmetic operations handling positive and negative numbers in a symmetrical way as well as to the error‐correction. We have already presented some reports on the basic concept of the code and the error‐correcting ability for the random error. This paper proposes the cyclic ST‐AN code which can correct the burst error. The code is generated by the code generatorA= (3c‐ 1)A2, and is an extension of the algebraic Fire code. Because of this property, it has the features that the construction is very simple and the selection of the code is easy. A satisfactory result is also obtained for the code efficiency. This paper describes first the outline of the cyclic ST‐AN code and the concepts of arithmetic burst. Then it discusses the construction of the cyclic ST‐AN Fire‐type code and its error‐correcting ability. Finally, the decoding method is presented which uses

ISSN:0882-1666    

DOI:10.1002/scj.4690180706

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe autonomous network composed of a threshold element andndelay elements can be considered as a logical model for the neural network. The discussion of the structure of the state configuration sequences, which are realizable by such a network, will give a clue to the logical operation of the neural network. This paper discusses the state configuration sequences realizable by such a network and the property of the threshold function using the connecting edges and boundary vectors. It is shown first that when the state configuration sequences can only be periodic, the maximum realizable length of the periodic sequences is 2n.Then the self‐dual state configuration sequences are generated from the foregoing state configuration sequences, preserving a certain periodic sequence. It is shown that the network function in this case can be composed of an MBS function, and all boundary vectors and weights and thresholds can easily be determined. The structure of the realizable transient sequences is also discusse

ISSN:0882-1666    

DOI:10.1002/scj.4690180707

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

年代:1987

数据来源: WILEY

摘要:

AbstractSo far, numerous distributed algorithms have been proposed. However, most of them do not work well on failure of a processor or link. This paper investigates the relationship between knowledge a processor has concerning the network and the existence of a distributed algorithm under link failure. In this situation, because of the link failure, it is not possible to send a message using it and the processor does not know which link is faulty. The following results are obtained.

ISSN:0882-1666    

DOI:10.1002/scj.4690180708

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

年代:1987

数据来源: WILEY

摘要:

AbstractAlthough the built‐in self‐test approaches by pseudo‐random patterns using LFSR are common, it is difficult to expect high fault coverage for high fan‐in circuits such as PLA. Thus, for the built‐in test of circuits like PLA we need to generate regular test patterns or to devise some counterplan even in the use of random patterns. This paper proposes a method for constructing random‐pattern‐testable PLAs for which we can achieve high fault coverage even by random patterns by adding mask arrays to conventional PLAs. To see how high fault coverage is achieved, fault detection probability by random patterns is analyzed for equivalent AND‐OR circuits of the form‐like trees for both stuck‐ and cross‐point type faults. Also a method for finding a mask that maximizes the probability of fault detection in the composition of random‐t

ISSN:0882-1666    

DOI:10.1002/scj.4690180709

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

年代:1987

数据来源: WILEY

摘要:

AbstractThe Necker cube is a line drawing having two possible solutions in depth perception. The process of interpreting a two‐dimensional line drawing as a three‐dimensional object was investigated using the Necker cube. Attention was directed to a local feature of a briefly presented cube, i.e., an angle at a vertex. The angle under observation was perceived as a front part of the cube and other parts were interpreted so as to match the interpretation of the angle pattern. Results show that the local feature to which attention was directed, was interpreted first. Then global features and other local features were interpreted so as to agree with the local feature interpreted initially. This suggests that the three‐dimensional interpretation of the line drawing was made sequentially from the local feature to global struc

ISSN:0882-1666    

DOI:10.1002/scj.4690180710

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

年代:1987

数据来源: WILEY