摘要:

AbstractTo establish an automatic method of signature verification, this paper presents an on‐line recognition technique of handwritten signatures by comparing the dynamic features extracted from pen movement with the reference data. In this paper, it is observed that dynamic features such as changes in pen inclination and writing force with time are different among the writers and these features are detected by various sensors attached to the pen. In other words, the pen inclination is estimated from the relationship between the pen inclination and the intensity of illumination at the paper surface of light emitted from an LED utilizing a reflective optical fiber sensor. The writing force in the axial direction of the pen is obtained from the relationship between the strain and applied force by using a force sensor installed at the central part of the pen. In comparison with the reference data, simple features such as number of pen‐ups and pen‐downs and maximum, minimum and average values of time histories of the writing force and pen inclination are considered first. If the data are rather significant, then further comparison is made with respect to the time series waves of the pen inclination and writing force before a final decision as to whether or not a signature is authentic is made. Finally, the proposed technique is applied to a set of test data consisting of autographs and forgeries and it is shown that this method distinguishes an autograph from a forgery from the changes in writing force and pen attitudes even though two signatures resemble each

ISSN:0882-1666    

DOI:10.1002/scj.4690201001

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

年代:1989

数据来源: WILEY

摘要:

AbstractWhen information data to solve a problem are distributed over processors on a network, the algorithm which solves the problem by exchanging the information data is called a distributed algorithm. A large number of distributed algorithms has been proposed for various problems, but the proof for the validity is shown only for a few of them. This paper considers an asynchronous network and proposes a distributed algorithm which constructs the breadth‐first search tree with the specified processor as the root. The validity of the algorithm is shown. In general, the efficiency of the distributed algorithm is evaluated by the total number of messages exchanged during execution (message complexity), and the execution time (ideal‐time complexity), assuming the communication delay as a unit time.In the algorithm proposed in this paper, the message complexity and the ideal‐time complexity are bothO(n·√ewherenis the number of processors andeis the number of links in the network. Especially, whene=Q((n/logn)2), the proposed algorithm is better than other known algorithms in terms of the message co

ISSN:0882-1666    

DOI:10.1002/scj.4690201002

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

年代:1989

数据来源: WILEY

摘要:

AbstractMAN‐YO is a special‐purpose parallel computing machine being developed for logic circuit design and simulation. It uses dedicated hardware to increase the speed of gate‐level simulation, and a combination of dedicated microprograms and processors for functional level simulation. Furthermore, a multiprocessor architecture, interconnected by a loop‐network, is used to provide concurrent processing capability for high performance, multilevel logic simulation. Experiments were conducted to assess the performance of the functional level sim

ISSN:0882-1666    

DOI:10.1002/scj.4690201003

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

年代:1989

数据来源: WILEY

摘要:

AbstractIn designing VLSI, the problem of how large the chip area will be is of considerable interest. Thus, the primary objective in investigating this problem is to consider formally processing elements and wires of a circuit to be vertices and edges of an undirected graph, and then clarify the area sufficient or necessary to embed this graph onto a rectangular grid graph according to a certain embedding method (this is called an embedding model). In this paper, vertices correspond to a rectangular graph such that [length of long side]/[length of short side]≤ constant. It is shown that under an embedding model, which forbids images of edges (wires) from passing through the inside of the vertex region of the rectangle, the maximum lower bound of the area corresponding to a generaln‐vertexd‐degree graph is ωd2n2. As the result, it is seen that the conventionally known upper boundO(d2n2) cannot be improved any further as long as alln‐vertexd‐degree graphs are

ISSN:0882-1666    

DOI:10.1002/scj.4690201004

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

年代:1989

数据来源: WILEY

摘要:

AbstractThis paper studies the problem of scheduling jobs on a multiprocessor system with a common memory to minimize\documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_{i = 1}^n {w_i \left({f_i } \right)} $\end{document}, wherefidenotes flow‐times of jobsi, andwi(fi)denotes monotonically nondecreasing functions offi. Arriving jobs are assigned to available processors according to an appropriate scheduling rule. Once a job is placed on a processor, it retains the processor during its processing and repeats local computations and accesses to the common memory. First, the scheduling problem is formulated into a zero‐one integer programming problem. Next, a procedure is presented for computing a lower bound on the optimal cost. Finally, the performance of the proposed procedure is evaluated using simulation experiments for the problem of minimizing mean flow

ISSN:0882-1666    

DOI:10.1002/scj.4690201005

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

年代:1989

数据来源: WILEY

摘要:

AbstractThe phoneme perception distribution is determined by the psychoacoustic experiment for the synthesized speech. The purpose of this paper is to attempt a learning of this distribution by a neural net model with three‐layered structure. The following observations are made as the result of learning by a neural net model. The weight of the connection from the input layer to the hidden layer has the function to extract the particular frequency range, and the weight from the hidden layer to the output layer has the function to integrate the unit output in the hidden layer, to extract the particular phoneme. It is shown by integrating those results of analysis that the weight sequence from the input layer to the output layer has the function as a filter to extract only the particular phoneme.Finally, the discrimination power is examined when a part of the connections among units is destroyed or the connection strength of some units is varied. It is shown that the discriminating power is not affected by the change of the weight of the connection between the input layer and the hidden layer, with the effect on the output unit being less than several percent. This result indicates that the neural net model has a feature of distributed memor

ISSN:0882-1666    

DOI:10.1002/scj.4690201006

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

年代:1989

数据来源: WILEY

摘要:

AbstractIn this paper, an attempt is made to develop a new photometric method to reconstruct the 3‐D shape of an object. The method proposed here is called point source illumination stereo (PSIS) and is used to reconstruct the shapes of objects from two images obtained under point light source illumination and perspective projection.It is assumed that the surface of the object is uniform, perfectly diffuse, convex and smooth. In a small‐sized optical system in which both a camera and a light source are near an object, the method is applied to reconstruct the shape of an egg from images taken with a fibersc

ISSN:0882-1666    

DOI:10.1002/scj.4690201007

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

年代:1989

数据来源: WILEY

摘要:

AbstractAn island‐driven control strategy in a speech understanding system (SUS) would be effective when reliable phonetic recognition cannot be obtained due to poor performance of the acoustic processor or noisy conditions. Especially, in conversational speech, the signal suffers from a heavy smoothing effect. An island‐driven SUS begins with detecting the acoustically most probable islands of keywords, and then expands them by a “hypothesis and test” paradigm until it covers the whole utterance using various sources of knowledge. However, this control strategy demands a very complicated linguistic processing rather than a left‐to‐right control. The authors developed an algorithm for transforming a set of syntactic rules written in the definite clause grammar into an efficient word predicting program in Prolog which operates under an island‐driven control. The basic ideas and the algorithm are explained here with a few examples of word predicti

ISSN:0882-1666    

DOI:10.1002/scj.4690201008

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

年代:1989

数据来源: WILEY

摘要:

AbstractThis paper presents an algorithm for finding a matching between two point patterns given inm‐dimensional Euclidean space. The point pattern matching algorithm here is formulated as a tree search procedure, and the search tree is pruned by a specified tolerance measure for matching. The proposed method is based on the locations of points and is invariant to rotation, translation, and scaling. Moreover, to guide the search, it is easy to use global geometric constraints, such as rotation or scaling parameter

ISSN:0882-1666    

DOI:10.1002/scj.4690201009

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

年代:1989

数据来源: WILEY