A Match-to-Successive-Sample-Device system with paper tape input/output unit.

1968 ◽  
Author(s):  
Gordon L. Wilson ◽  
A.H. McMorris ◽  
E.G. Rogers
1973 ◽  
Vol 56 (1) ◽  
pp. 135-139
Author(s):  
Matt K John ◽  
Cornelis J Van Laerhoven

Abstract A flexible, general purpose program for a laboratory data acquisition and reduction system employing a minicomputer for off-line processing of digitized data readings from electroanalytical instrumentation was developed. Instrument data from the on-line operation of a hard-wired analog-to-digital data acquisition subsystem in conjunction with an atomic absorption instrument, a colorimeter, or a pH/millivolt meter for speeific-ion electrode determinations, are transformed into concentration units by using a linear interpolation method. The relationship between instrument measurements and quantitative data is approximated by several straight-line segments between the graphical coordinates associated with each of the reference standards analyzed. The coordinates are determined by calibrating readings and known concentrations. Routines are included to edit incorrect raw readings and to make corrections to compensate for unavoidable deviations from standard analytical procedure. The FOCAL-8 language program, therefore, permits unattended processing of sequentially read paper tape input. The results punched on paper tape are easily transferred to a large computer for more sophisticated data analysis and storage.


1995 ◽  
Vol 06 (03) ◽  
pp. 225-231 ◽  
Author(s):  
MARCELO BLATT ◽  
EYTAN DOMANY ◽  
IDO KANTER

We consider two-layered perceptrons consisting of N binary input units, K binary hidden units and one binary output unit, in the limit N≫K≥1. We prove that the weights of a regular irreducible network are uniquely determined by its input-output map up to some obvious global symmetries. A network is regular if its K weight vectors from the input layer to the K hidden units are linearly independent. A (single layered) perceptron is said to be irreducible if its output depends on every one of its input units; and a two-layered perceptron is irreducible if the K+1 perceptrons that constitute such network are irreducible. By global symmetries we mean, for instance, permuting the labels of the hidden units. Hence, two irreducible regular two-layered perceptrons that implement the same Boolean function must have the same number of hidden units, and must be composed of equivalent perceptrons.


1953 ◽  
Vol 41 (10) ◽  
pp. 1483-1486 ◽  
Author(s):  
P. Vance ◽  
D. Haas
Keyword(s):  

1956 ◽  
Vol 103 (2S) ◽  
pp. 356-356
Author(s):  
T. Kilburn ◽  
G.R. Hoffman ◽  
P. Wolstenholme ◽  
A.A. Robinson ◽  
F. McAulay ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document