摘要:

AbstractThe set of multiple‐valued Kleenean functions define a model of a Kleene algebra (a fuzzy algebra) suitable for treating ambiguity. This paper enumerates the Kleenean functions exactly, using the relation that the mapping fromp‐valued Kleenean functions to monotonic ternary inputp‐valued output functions is a bijection. Thus, the numberpnof input vectors that should be searched is 3nforp‐valuedn‐variable Kleenean functions. In this paper, we show how to obtain this number for 4‐ to 8‐valued Kleenean functions with 3 or fewer variables. We show that the number increases stepwise as the radix becomes larger and that the number of even (2m)‐valued Kleenean functions is uniquely determined by the number of odd (2m‐ 1)‐valued Kleenean functions. These results show that the essence of Kleenean algebra is principally revealed by its odd‐valued functions. Moreover, the number of input variables increases exponentially as the variable becomes larger, and increases logarithmically as the radix becomes larger. Thus, increasing the number of variables has more of an effect on increasing this number than does i

ISSN:0882-1666    

DOI:10.1002/scj.4690240301

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

年代:1993

数据来源: WILEY

摘要:

AbstractThis paper discusses a realization of a self‐testing distributed arbiter for bus‐connected systems. One of the traditional schemes for arbitration is that each of the connected modules acknowledges when the arbitration is completed. However, there is a problem in that a dedicated software as well as a complex hardware are required, which increases the cost and affects the through‐put of the system.The method proposed in this paper assigns a certain code as the module number for verification of arbitration, and detects failure by a retrial using its complement. In other words, the method aims at secure arbitration using time‐space redundancy, i.e., redundancy in time and redundancy in code space, and at realization by as simple a circuit as possible, with the self‐testing function.It is verified from the results of simulation that all single stuck‐at faults can be detected for the case of 3 bits, under the assumption that all possible inputs are given before the next failure is produced. Even if not all of the inputs are given, there was no observed extraordinary operation where an incorrect module is selected. Thus, the self‐testing arbiter with a high speed and a simple hardware configuration ca

ISSN:0882-1666    

DOI:10.1002/scj.4690240302

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

年代:1993

数据来源: WILEY

摘要:

AbstractAs a connection method for a LAN, which connects computers and various other equipment (called processors hereafter), a token ring system is currently used. Any two processors on a ring can communicate with each other directly. As one fundamental problem for distributed algorithms in a network of several rings connected by links, the problem of parallel data transmission between processors is discussed in this paper. In the parallel data transmission problem, a predetermined processor holding data with specified addresses sends the data to the specified addresses in parallel. Given the numbers of processors and rings, the minimum computation time for data exchange between the processors, and conditions on the network configuration to achieve that minimum are obtained while keeping the number of links minimum.

ISSN:0882-1666    

DOI:10.1002/scj.4690240303

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

年代:1993

数据来源: WILEY

摘要:

AbstractThis paper describes a parallel branch‐and‐bound algorithm for general integer linear programming problems and its implementation on a distributed memory multiprocessor nCUBE2.With a branch‐and‐bound algorithm, the amount of computation on each search tree node varies, and in general, is large. This has led to development of an effective communication strategy for the algorithm presented herein. Its implementation and performance evaluation also are described.The results show that the more difficult the problem instances become in terms of time to solve on a sequential computer, the more efficient the algorithm presented here prove

ISSN:0882-1666    

DOI:10.1002/scj.4690240304

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

年代:1993

数据来源: WILEY

摘要:

AbstractThis paper proposes a segmentation method based on region information and edge information. The method consists of three steps: (1) a connected component which is a part of an object is extracted as a seed by using a simple process such as a histogram analysis; (2) this seed is expanded repeatedly; and (3) to evaluate the possibility of the expansion, the uniformity of gray levels (region information) and checking the presence of border pixels (edge information) are used.Although the method can be considered as a kind of region expansion, the significant features are that it contains the growth of a seed and the edge information (a part of control information) to expand the region repeatedly. The former gives preliminary information on approximate gray levels of an object and extracts the object as a connected component, and the latter makes the edge information more useful. Although the usefulness of the edge information in a conventional region‐and‐edge integrated method such as the superslice algorithm depends greatly on its region segmentation, the use of such methods can be avoided in the proposed method, since both the region and edge information are used simultaneously for the control conditions of the region expansion. The method is justified experimentally by using synthetic images and actual images in two and three dimensi

ISSN:0882-1666    

DOI:10.1002/scj.4690240305

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

年代:1993

数据来源: WILEY

摘要:

AbstractA human being, observing a silhouette outline of an object, can estimate its three‐dimensional (3‐D) shape. This process has implications for the problem of recognizing and understanding 3‐D shapes, since a similar process is needed in 3‐D shape modeling of computer graphics.One idea for such 3‐D shape modeling is to generate generalized cylinders on the basis of symmetry of the silhouette. This means finding symmetrically related pairs of points on the outline and estimating cross sections of the object from line segments connecting respective pairs of points.A generalized cylinder for the object can be constructed from the set of such cross sections. However, the symmetric point pairs previously were extracted by heuristic methods, and some instability was involved.This paper applies a recently proposed method of computing symmetric point pairs based on geometric division of the plane to 3‐D shape modeling. Two ways to develop it are proposed: (1) prune it if the symmetric axis has branches, thereby generating a generalized cylinder for the trunk; and (2) generate generalized cylinders for the trunk and for respective branches, thereby modeling a complex shape as a self‐intersecting object composed of multiple segments. The segment decomposition is implemented by natu

ISSN:0882-1666    

DOI:10.1002/scj.4690240306

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

年代:1993

数据来源: WILEY

摘要:

AbstractThis paper proposes a sequentially updated environment model for a mobile robot equipped with a stereo camera. Information obtained from the visual sensors on the robot is used to construct a model for the area surrounding the path of the robot. The model is sequentially updated as environmental data is acquired, and relationships between multiple image frames are observed. The principle of trinocular stereo is applied to the sequential images occurring before and after movement. Line segments are constructed on the frames showing spatial and temporal relationships, and from these, a three‐dimensional geometric wire‐frame model is constructed. The model also uses efficient relationships to allow rapid processing and continual updating of the mo

ISSN:0882-1666    

DOI:10.1002/scj.4690240307

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

年代:1993

数据来源: WILEY

摘要:

AbstractAn algorithm for object detection is presented. This method is robust against brightness variation and does not depend on the position, size, background pattern, shape, or color of target objects. The method consists of three processes: (1) normalize the brightness of the target and reference images; (2) calculate features, called the normalized principal component features; and (3) construct a classifier by statistical learning. The method is applied to car detection in a parking lot. Under various conditions, at least 98 percent of the cars were detected correctly. Application to moving‐car detection and person detection also is presente

ISSN:0882-1666    

DOI:10.1002/scj.4690240308

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

年代:1993

数据来源: WILEY

摘要:

AbstractThe recognition of connected characters in cursive handwriting is a difficult task with ordinary pattern‐matching techniques, since the shape of the individual character is affected by its preceding and succeeding characters. One of the authors has proposed a neural network model called the selective attention model, which has the ability to recognize and extract individual patterns from a composite of a number of elementary patterns. However, when a large number of patterns are presented concurrently, this model doe not always work correctly. In this paper, we extend the idea of this model and construct a new system, which has the ability to recognize the connected characters in cursive handwriting. it has been verified by computer simulation that this system can be used to correctly recognize connected character

ISSN:0882-1666    

DOI:10.1002/scj.4690240309

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

年代:1993

数据来源: WILEY

摘要:

AbstractIn a conventional dynamic programming beam search, the parameters of the threshold function for pruning grid points in the dynamic programming region are assumed to be set to the same values throughout the speech input. In this paper, I describe a method designed to improve the effectiveness of decreasing the computation amount in the dynamic programming beam search by changing the parameters during speech input. An accumulated distance is defined that is not easily influenced by the quality of matching at the beginning of speech input. When this accumulated distance is used in the grid point pruning decision, the parameters of the threshold function can be changed to smaller values, at an early point in time of several frames from the beginning of the speech input, without missing grid points on the optimum dynamic programming path for the reference pattern. It was demonstrated through word recognition tests that the computation amount when the proposed threshold function is used can be decreased to about 1/5 of that in the conventional, simple grid point pruning method, and decreased by at least 1/2 compared to the threshold function of [11] because of the effectiveness of changing the threshold function's parameters at an early point during speech input.

ISSN:0882-1666    

DOI:10.1002/scj.4690240310

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

年代:1993

数据来源: WILEY