An enhanced methodof automatic signature verification isdescribed based onmeasurements derived fromtwo accelerometers andthewriting pressure. Modifications totherefer- encegeneration procedure toaccommodate inconsistencies during enrollment andasupervised adaptation procedure arealso given. These procedures areusedinthedesign andimplementation ofa large-scale field testinvolving 248subjects oversixmonths. The central test results wereaTypeIerror rateof1.7 percent andaType IIrate of0.4percent fordeliberate forgers. Theacceptance ratefor random forgery was0.02 percent. I.INTRODUCTION A technique forautomatic signature verification based on accelerometry hasbeendescribed elsewhere (1)-(3). Thisreport gives improvements tothat method, foremost anadditional meas- urement derived fromthewriting pressure, butalso amoreelab- oratedecision strategy including adaptation and the implementation andresults ofa large field testoftheentire system.

The cyclic distance-2 chaining of constant-weight codes has applications in A/ D conversions as well as in combinatorial problems involving the exhaustion of m-out-of-n combinations. It is shown in this paper that such a chaining can be obtained from the Gray code circuit and its transformations. Algorithms based on several theorems derived have been developed and programmed in APL.

A method is presented to approximate optimally ann-dimensional discrete probability distribution by a product of second-order distributions, or the distribution of the first-order tree dependence. The problem is to find an optimum set ofn - 1first order dependence relationship among thenvariables. It is shown that the procedure derived in this paper yields an approximation of a minimum difference in information. It is further shown that when this procedure is applied to empirical observations from an unknown distribution of tree dependence, the procedure is the maximum-likelihood estimate of the distribution.

This paper discusses an experimental study of a mixed-font print recognition system. With a program-controlled CRT scanner input, using 96 N-tuple recognition measurements with ternary minimum distance decision, the system reported is capable of reading a variety of type styles at a performance level which is quite acceptable for fair to good quality print. Performance is marginal for poor quality print.

This paper contains a discussion of a programmed algorithm for designing multifont recognition logics. This design algorithm automatically derives effective recognition logics from representative samples of characters. It has been applied to design. translational invariant logics for upper and lower case typewritten alphabets. Recognition performances in the order of a few errors per thousand characters have been achieved for mixed-font characters from six to 11 different fonts over a wide range of printing quality.

article Free Access Share on A State Variable Assignment Method for Asynchronous Sequential Switching Circuits Author: C. N. Liu IBM Corporation, Yorktown Heights, N.Y. and University of Illinois, Urbana, Ill. IBM Corporation, Yorktown Heights, N.Y. and University of Illinois, Urbana, Ill.View Profile Authors Info & Claims Journal of the ACMVolume 10Issue 2April 1963 pp 209–216https://doi.org/10.1145/321160.321169Published:01 April 1963Publication History 61citation686DownloadsMetricsTotal Citations61Total Downloads686Last 12 Months16Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF