摘要:

AbstractThis paper proposes a configuration for a communication control system with a wide range of applications. The proposed configuration is based on the degenerate realization of serial processing (without any restriction of the order) and time‐division processing of seven kinds of parallelism included in the communication control processing, as well as on the degenerate realization by shared network bus for the processing request (token) transfer among the components. By the proposed eight kinds of standard configurations, a unified design is made for a wide range of performance from the terminal level to the communication control in a large‐scale preprocessing device. The serial processing realized by extracting the protocol‐dependent (level) functions and the programmed control provides a flexible means to cope with a wide range of requirements for such functions as odd or delete kinds of links and protocols. This paper outlines the eight kinds of standard configurations and the principle of selection among those together with the derivation of the proposed configura

ISSN:0882-1666    

DOI:10.1002/scj.4690180501

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

年代:1987

数据来源: WILEY

ISSN:0882-1666    

DOI:10.1002/scj.4690180502

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

年代:1987

数据来源: WILEY

摘要:

AbstractAs a model to describe the concurrent system with a synchronization mechanism, Holenderski has proposed the synchronized shuffle expression (SSE). SSE is a shuffle expression obtained by adding a synchronized shuffle operator with its closure and projection operator. This paper considers various subclasses of SSE. It is shown that the class of languages represented by the subclass excluding the projection operator is the same as the class of recursively enumerable languages. The hierarchical relations among the subclasses are described.

ISSN:0882-1666    

DOI:10.1002/scj.4690180503

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

年代:1987

数据来源: WILEY

摘要:

AbstractWith the recent widespread application of computer graphics, a management system for graphic data is required which is suited to interactive processing. This paper discusses the management structure for the line data, which can realize a retrieval in an efficient way according to the spatial relations. The dynamic data management structure called the BD time, which was developed by the authors for the multidimensional point data management, is employed. In the proposed system, the BD tree is modified into a form (nonpacket type) suited to high‐speed processing, and is extended to suit the line data. In this system, the segment is managed by its centroid and the circumscribed quadrilateral. The BD tree is composed of a set of centroids, where each node has information concerning the circumscribed quadrilaterals for all segments in the subtree. The retrieval is made efficient by the information concerning the circumscribed quadrilateral. In this paper, the data structure for the line data management is discussed first. Then various retrieval algorithms which depend on the spatial relations according to each application are discussed in detail. Finally, the usefulness of the proposed data structure is demonstrated by a retrieval experiment of actual geographical dat

ISSN:0882-1666    

DOI:10.1002/scj.4690180504

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

年代:1987

数据来源: WILEY

摘要:

AbstractOptical flow analysis is a powerful means to extract an object from the dynamic image. Not only can it extract an object, but it can also recover the three‐dimensional structure. However, in practice, there are many cases where the optical flow is difficult to obtain or the motion of the object does not permit a unique interpretation. Based on the gradient method, this paper proposes a method of three‐dimensional motion analysis for multiple moving objects which may include an object for which a unique interpretation of the motion is difficult. By the gradient method, the three‐dimensional motion parameters of a rigid object can be estimated without using the optical flow as a least‐square‐error solution for the system of linear equations, if the three‐dimensional structure of the object is already given. Based on the residual square‐sum error in the estimation, the image plane is segmented if it contains regions of different motions. If the motions are recognized as being similar, the regions are merged. Thus, the object is extracted by iterating the segmentation and merge on the image plane. The uniqueness of the motion is evaluated by the condition number for the coefficient matrix of the system equations. If the motion of the extracted object can be interpreted uniquely, the displacement vector can be determined accurately by iterating the estimation of the

ISSN:0882-1666    

DOI:10.1002/scj.4690180505

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

年代:1987

数据来源: WILEY

摘要:

AbstractA testability evaluation method is described based on an estimated test pattern length to obtain the desired fault coverage. The test pattern length is estimated from network attributes, i.e., No. of gates, No. of signal lines, No. of inputs/outputs, etc. The proposed method begins with modeling a fault coverage curve as a function of test patterns and a curve coefficient. The curve coefficient is described as a function of network attributes based on the previous execution data. The test patterns required to obtain the desired fault coverage can be estimated in the range of upper and lower bounds. The upper and lower bounds are obtained using the interpolation method. The proposed estimation method is evaluated from the relationships between estimated patterns and actual automatic test generation patterns.

ISSN:0882-1666    

DOI:10.1002/scj.4690180506

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

年代:1987

数据来源: WILEY

摘要:

AbstractIn the videotex communication service system, a new matrix function is planned. The drawing pad may be used in writing the mail, where handwritten patterns can be accepted. However, this type of mail is composed of geometric information, and the conversion to pattern information (G/P conversion) is required in the communication device to produce the output processing in the communication device in the low‐level terminal. This paper proposes a G/P conversion method (successive conversion), which suffers less delay in the start of the display and preserves the order of writing. In the successive conversion, the expansion of a geometric primitive and the transmission of the result of expansion are executed alternately. Only the rectangular region containing the part for which the expansion has been made is sent as the pattern data. The proposed method is applied to the drawing mail. It is shown that the processing required in the conversion is twice that of the straight system, where the result is sent after expanding all geometric primitives. It is also shown that the adequate speed of display for the character is 2.7 character/s, if it is displayed following the writing orde

ISSN:0882-1666    

DOI:10.1002/scj.4690180507

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

年代:1987

数据来源: WILEY

摘要:

AbstractThis paper discusses the decision problem concerning security for such cryptographic protocols as the cryptographic key distribution protocols and the digital signature protocols. A cryptographic protocol and its utilization environment are considered secure if an opponent cannot know the secret message or forge a signature successfully by wiretapping or communication function is secure. This paper presents a sufficient condition under which the security problem is decidable. Dolev et al. also investigated the decision problem of the security, but they discussed only the simple case where the cryptographic key is not the object of manipulation (i.e., key generation and distribution are not included in the protocol), and a decision method is presented in which the decision can be made in a polynomial time. By contrast, this paper discusses the problem including the case where the cryptographic key can be an object of manipulation. The key delivery protocol by Ehrsam et al. and the digital signature protocol by Needham et al. satisfy the sufficient condition for the decidability given in this paper. Under the sufficient condition given in this paper, the security can again be decided in a polynomial time.

ISSN:0882-1666    

DOI:10.1002/scj.4690180508

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

年代:1987

数据来源: WILEY

摘要:

AbstractThis paper discusses the hierarchical properties of the κ‐neighborhood template A‐type two‐dimensional bounded cellular acceptor (abbreviated as A‐2BCA(κ) on three‐dimensional tapes we proposed previously. An A‐2BCA(κ) is a three‐dimensional automaton which consists of a pair of a converter and a configuration‐reader. The former converts the given three‐dimensional tape to the two‐dimensional configuration and the latter determines the acceptance or nonacceptance of given three‐dimensional tape whether or not the derived two‐dimensional configuration is accepted.We investigate how the difference of the neighborhood template of the converter or the configuration‐reader affects its accepting power. As a result, it is shown that when the converter is deterministic, the greater the number of neighbor cells of the converter and the more powerful the configuration‐reader, the more powerful the accepting power of the A‐2BCA(κ). However, this is not always true for the nondeterministic case. As far as this case is concerned, the following results are obtained:(1) Nine‐neighbor is as powerful as five‐neighbor whatever the configuration‐reader combined;(2) there exist classes of two‐dimensional automata such that indeed their accepting powers are different, but tho

ISSN:0882-1666    

DOI:10.1002/scj.4690180509

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

年代:1987

数据来源: WILEY

摘要:

AbstractThis paper describes algorithms of magnifying/reducing, rotation, and border following for binary document images by using a segmented block code. Document images such as facsimile images are composed of a large number of binary data. Thus it is difficult for a small‐sized conventional computer to process efficiently a whole document image in a pixel‐by‐pixel manner. Our algorithms described herein use segmented block coded data instead of pixel data. In the segmented block coding scheme, blocks which are two‐dimensional contiguous black pixel areas are extracted and coded by their locations and shapes. Since this coding scheme compresses the amount of data required to process and produce the data form which is suitable to deal with by conventional computer, our algorithms using this coded data work efficiently. Also, there is another advantage in that the results of magnifying/reducing or rotation of images are obtained in the form of a segmented block code. This means that we can manage document images in a unified

ISSN:0882-1666    

DOI:10.1002/scj.4690180510

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

年代:1987

数据来源: WILEY