# IEEE Transactions on Electronic Computers

## Filter Results

Displaying Results 1 - 25 of 48
• ### [Front cover]

Publication Year: 1966, Page(s): c1
| PDF (485 KB)
• ### IEEE Computer Group

Publication Year: 1966, Page(s): nil1
| PDF (166 KB)
• ### Breaker Page

Publication Year: 1966, Page(s): nil1
| PDF (166 KB)
• ### A Spectral Stability Analysis of Finite Difference Operators

Publication Year: 1966, Page(s):849 - 854
| | PDF (755 KB)

This paper outlines a simple technique for determining stability criteria for numerical integration procedures. Use is made of the Z-transform and the method is presented in engineering terms. View full abstract»

• ### Statistical Analysis of Paged and Segmented Computer Systems

Publication Year: 1966, Page(s):855 - 863
Cited by:  Papers (8)
| | PDF (1494 KB)

This paper discusses some optimum design problems which arise when paging and segmentation are used in a multiprogrammed computer system, and suggests approaches to their solution. It is argued that design optimization depends fundamentally on the statistics of the typical software load presented to the computer system, and also that the investigation requires the aid of a total system model. Stat... View full abstract»

• ### On Connecting Modules Together Uniformly to Form a Modular Computer

Publication Year: 1966, Page(s):864 - 873
Cited by:  Papers (8)
| | PDF (2010 KB)

A modular computer may be informally defined to be a device consisting of a large (or infinite) number of identical circuit modules connected together in some uniform manner. This paper is concerned with making the concept of connected together in a uniform manner' mathematically precise. Uniformity of connection in a modular device is first defined in terms of the linear graph whose vertices co... View full abstract»

• ### On Computer Self-Diagnosis Part I-Experimental Study of a Processor

Publication Year: 1966, Page(s):873 - 881
Cited by:  Papers (14)
| | PDF (1604 KB)

The problem considered is the derivation of self-diagnosis procedures for digital computers. A self-diagnosis procedure is defined as an experiment of two outcomes: 1) all transistor-diode logic is failure-free; or 2) card or module X has a fault of type Y. Also, the procedure must be sufficiently fast to permit execution every few hours by nontechnical personnel. A method for the production of se... View full abstract»

• ### On Computer Self-Diagnosis Part II-Generalizations and Design Principles

Publication Year: 1966, Page(s):882 - 890
Cited by:  Papers (4)
| | PDF (1661 KB)

A general method for the production of self-diagnosis procedures for digital computers is given. A number of principles which facilitate the design of diagnosable machines are proposed. The most general recommendations are that the machine be asynchronous, free of redundant components, and that production of the diagnosis procedure be undertaken concurrently with design of the system. On the level... View full abstract»

• ### Simplification of the Covering Problem for Multiple Output Logical Networks

Publication Year: 1966, Page(s):891 - 897
Cited by:  Papers (2)
| | PDF (1275 KB)

This paper is concerned with the problem of determining diode optimal representations for two levels of logic with multiple inputs and multiple outputs. Previous papers by the authors and others have formulated algorithms for obtaining optimal representations. However, the linear integer programming problem obtained is often prohibitively large. In the present paper, methods for reducing the size ... View full abstract»

• ### Convolutional Transformations of Binary Sequences: Boolean Functions and Their Resynchronizing Properties

Publication Year: 1966, Page(s):898 - 908
Cited by:  Papers (10)
| | PDF (1904 KB)

Nonfeedback shift registers (finite-memory encoders) can be profitably adopted to perform transformations of binary sequences. The output sequence is convolutionally obtained by sliding'' the encoding device along the input sequence and producing a symbol at each shift. Invertible transformations are characterized and decoding schemes are analyzed. The crucial point in the decoding problem is th... View full abstract»

• ### An Algorithm for Non-Parametric Pattern Recognition

Publication Year: 1966, Page(s):908 - 915
Cited by:  Papers (41)
| | PDF (2231 KB)

The probability densities of each of K classes must be known for a statistically optimum classification of an input into one of K categories. This article describes an economical technique for the approximation of probability densities as generalized N-dimensional histograms constructed from a limited number of samples of each class. The histogram cell locations, shapes, and sizes are determined a... View full abstract»

• ### An Experimental Investigation of a Mixed-Font Print Recognition System

Publication Year: 1966, Page(s):916 - 925
Cited by:  Papers (21)  |  Patents (2)
| | PDF (1878 KB)

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... View full abstract»

• ### Correction [to "Linearity of sequential machines"]

Publication Year: 1966, Page(s): 925
| | PDF (165 KB)

Because of the inadvertent omission of Fig. 6 in the October, 1966 issue, this correction is reprinted completely herewith. S.S. Yau and K.C. Wang, authors of the paper, "Linearity of Sequential Machines," which appeared on pages 337-354 of the June, 1966, issue of these Transactions, have called the to the attention of the Editor errors that appeared on pages 337, 338, 339, 342, 343, 344, 346, 34... View full abstract»

• ### Some Results of Amplitude Distribution Experiments on Shift Register Generated Pseudo-Random Noise

Publication Year: 1966, Page(s):926 - 927
Cited by:  Papers (10)
| | PDF (387 KB)

The well-known cyclic error-correcting codes are used so far only for serial systems; that is, systems having a single channel with information transmitted one bit at a time. In data-processing equipments and communication systems, information is often transmitted serially by characters and parallel by bits within a character. That is, there are several channels in parallel. Error correction in th... View full abstract»

• ### Cyclic Codes in Multiple Channel Parallel Systems

Publication Year: 1966, Page(s):927 - 930
Cited by:  Papers (4)
| | PDF (778 KB)

A catalog of all nonredundant complete sets of functions of two and three binary variables is presented in the form of a table. View full abstract»

• ### Complete Sets of Functions of Two and Three Binary Variables

Publication Year: 1966, Page(s):930 - 931
Cited by:  Papers (3)
| | PDF (441 KB)

A catalog of all nonredundant complete sets of functions of two and three binary variables is presented in the form of a table. View full abstract»

• ### Minimal Feedback Realizations of Sequential Machines

Publication Year: 1966, Page(s):931 - 933
Cited by:  Papers (2)
| | PDF (568 KB)

In this note we define the amount of feedback in a realization of a sequential machine M, give a simple algorithm to compute the minimal amount of feedback which has to be present in any realization of M, and give a canonical realization of M which uses the minimal amount of feedback. View full abstract»

• ### A Lower Bound on the Number of Corrections Required for Convergence of the Single Threshold Gate Adaptive Procedure

Publication Year: 1966, Page(s):933 - 935
Cited by:  Papers (3)
| | PDF (482 KB)

The adaptive single threshold gate realization procedure, originally proposed by Rosenblatt, has been rather extensively studied, and several upper bounds on the number of corrections required for its convergence have been derived. In this note a lower bound on the number of required corrections is determnined, and shown to differ from the upper bound by a factor of about n2 where n is ... View full abstract»

• ### On the Hyperplanes of the Taylor-Steinbuch Linear Separator

Publication Year: 1966, Page(s): 935
| | PDF (187 KB)

A Boolean function of n variables f(x1, x2, . . . , xn) is a k-thresh-old F/T/ . . . function1 if there exist a set of real numbers {w1, w2, . . . , wn}, called the weights, and a sequence of monotonically increasing real numbers {t1, t2, . . . , tk}, called the thresholds, which are such that View full abstract»

• ### Some algebraic properties of multi-threshold functions

Publication Year: 1966, Page(s):935 - 938
Cited by:  Papers (2)
| | PDF (751 KB)

First Page of the Article
View full abstract»

• ### A Nonbulk Addition Technique for Associative Processors

Publication Year: 1966, Page(s):938 - 941
Cited by:  Papers (1)
| | PDF (749 KB)

A process is described for continuing adaptation, after hyperplanes that separate pattern classes in pattern space have been found, in order to increase the distance between sample patterns and hyperplanes. View full abstract»

• ### On the Improvement of a Linear Separation by Extending the Adaptive Process with a Stricter Criterion

Publication Year: 1966, Page(s):941 - 944
Cited by:  Papers (11)
| | PDF (789 KB)

A process is described for continuing adaptation, after hyperplanes that separate pattern classes in pattern space have been found, in order to increase the distance between sample patterns and hyperplanes. It is then shown that the original adaptive process is a special case of a more general adaptive process in which the distance of a mis-assigned training pattern from the border of its proper c... View full abstract»

• ### Pattern Recognition by Using an Associative Memory

Publication Year: 1966, Page(s):944 - 947
Cited by:  Papers (7)
| | PDF (929 KB)

The purpose of this paper is to present a simple template-matching pattern recognition technique by using any general-purpose associative memory. The input patterns for recognition may have wide variations, provided that the distinct features of individual pattern classes can be extracted. Each pattern class is allowed to have deviations in size, style, orientation, etc. within certain limits. Thi... View full abstract»

• ### A Note on an Adaptive Hypersphere Decision Boundary

Publication Year: 1966, Page(s):948 - 949
Cited by:  Papers (7)
| | PDF (406 KB)

Supplementing earlier papers, this note treats two topics: nonsupervised adaptation to the optimum hypersphere for normal distributions, and supervised estimation of the shape parameter m for Pearson probability distributions. View full abstract»

• ### Contributors

Publication Year: 1966, Page(s):950 - 952
| PDF (2880 KB)

## Aims & Scope

This Transactions ceased publication in 1967. The current retitled publication is

Full Aims & Scope