Notice

# IEEE Transactions on Computers

## Filter Results

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

Publication Year: 1972, Page(s): c1
| PDF (423 KB)
• ### IEEE Computer Society

Publication Year: 1972, Page(s): nil1
| PDF (222 KB)
• ### [Breaker page]

Publication Year: 1972, Page(s): nil1
| PDF (222 KB)
• ### Editor's Notice

Publication Year: 1972, Page(s): 129
| PDF (580 KB)
• ### Redundancy by Coding Versus Redundancy by Replication for Failure-Tolerant Sequential Circuits

Publication Year: 1972, Page(s):130 - 137
Cited by:  Papers (20)  |  Patents (2)
| | PDF (1386 KB)

A synthesis procedure for failure-tolerant sequential circuits using error-correcting codes is presented. Coding redundancy is then compared with replication as to circuit complexity and reliability improvement. Using appropriate assumptions, it is shown that for a specified ability to tolerate failures, replication yields better circuit reliability than coding redundancy. When circuit complexity ... View full abstract»

• ### Optimal Scheduling Strategies in a Multiprocessor System

Publication Year: 1972, Page(s):137 - 146
Cited by:  Papers (125)
| | PDF (1927 KB)

This paper describes a set of techniques that can be used to optimally schedule a sequence of interrelated computational tasks on a multiprocessor computer system. Using a directed graph model to represent a computational process, two basic problems are solved here. First, given a set of computational tasks and the relationships between them, the tasks are scheduled such that the total execution t... View full abstract»

• ### On the Tradeoff Between Logic Performance and Circuit-to-Pin Ratio for LSI

Publication Year: 1972, Page(s):147 - 153
Cited by:  Papers (22)
| | PDF (1471 KB)

A key problem in the effective use of large-scale integration is the design and partitioning of computer logic to achieve sufficiently high circuit-to-pin ratios. In this paper a power-law relationship between pins and partitioned circuits is discussed and empirical evidence is presented that implies that the pin requirement is a sensitive function of the performance level of the logic. Two techni... View full abstract»

• ### Optimal Networks of NOR-OR Gates for Functions of Three Variables

Publication Year: 1972, Page(s):153 - 160
Cited by:  Papers (8)  |  Patents (2)
| | PDF (1074 KB)

Optimal networks consisting of NOR-OR gates (each gate produces the NOR and/or the OR of its inputs) are tabulated for all Boolean functions of three variables. Optimality is defined as minimizing first the number of gates and then the number of interconnections. The optimal networks were synthesized for each Boolean function by using an integer programming synthesis technique. View full abstract»

• ### A Prototype Intelligent Robot that Assembles Objects from Plan Drawings

Publication Year: 1972, Page(s):161 - 170
Cited by:  Papers (31)  |  Patents (1)
| | PDF (3024 KB)

An intelligent robot that recognizes and assembles three-dimensional objects by means of vidicon cameras, an articulated mechanical hand, and a digital computer is described. Its problem-solving functions include three essential parts: the recognition of macro-instructions from a human master, the recognition of the objects to be handled, and the decision making for executing the necessary tasks. ... View full abstract»

• ### A Nonparametric Valley-Seeking Technique for Cluster Analysis

Publication Year: 1972, Page(s):171 - 178
Cited by:  Papers (38)  |  Patents (4)
| | PDF (1348 KB)

The problem of clustering multivariate observations is viewed as the replacement of a set of vectors with a set of labels and representative vectors. A general criterion for clustering is derived as a measure of representation error. Some special cases are derived by simplifying the general criterion. A general algorithm for finding the optimum classification with respect to a given criterion is d... View full abstract»

• ### A Class of Algorithms for Fast Digital Image Registration

Publication Year: 1972, Page(s):179 - 186
Cited by:  Papers (500)  |  Patents (41)
| | PDF (2638 KB)

The automatic determination of local similarity between two structured data sets is fundamental to the disciplines of pattern recognition and image processing. A class of algorithms, which may be used to determine similarity in a far more efficient manner than methods currently in use, is introduced in this paper. There may be a saving of computation time of two orders of magnitude or more by adop... View full abstract»

• ### On the Definition and Generation of Walsh Functions

Publication Year: 1972, Page(s):187 - 189
Cited by:  Papers (8)  |  Patents (1)
| | PDF (503 KB)

A proof is given of a method proposed by Lackey and Meltzer [2] for determining the selection of Rademacher functions that must be combined to generate a specified Walsh function. The method provides a convenient way of digitally controlling a Walsh function generator. View full abstract»

• ### Path Sensitization, Partial Boolean Difference, and Automated Fault Diagnosis

Publication Year: 1972, Page(s):189 - 195
Cited by:  Papers (31)
| | PDF (1182 KB)

A tool employed in automated fault diagnosis is emphasized: path sensitization by partial Boolean difference analysis. Motivated by the analogy between a test system and a communication system, a model for fault detection of a logic net is outlined from the standpoint of information theory. The classical path sensitizing'' technique is made systematic using the partial Boolean difference. This t... View full abstract»

• ### Fourier Preprocessing for Hand Print Character Recognition

Publication Year: 1972, Page(s):195 - 201
Cited by:  Papers (332)  |  Patents (4)
| | PDF (1199 KB)

A pattern-recognition method, making use of Fourier transformations to extract features which are significant for a pattern, is described. The ordinary Fourier coefficients are difficult to use as input to categorizers because they contain factors dependent upon size and rotation as well as an arbitrary phase angle. From these Fourier coefficients, however, other more useful features can easily be... View full abstract»

• ### Results Obtained Using a Simple Character Recognition Procedure on Munson's Handprinted Data

Publication Year: 1972, Page(s):201 - 205
Cited by:  Papers (20)  |  Patents (1)
| | PDF (1042 KB)

The number of black points in each of the 25 nonoverlapping square regions of a size-normalized character matrix were used to recognize the 3822 uppercase handprinted alphabetic characters from Munson's multiauthor data set. The recognition accuracy obtained using a Bayes' classifier, which assumes statistically independent features, compares favorably with earlier results obtained using recogniti... View full abstract»

• ### Polynomial Representation of Classifiers with Independent Discrete-Valued Features

Publication Year: 1972, Page(s):205 - 208
Cited by:  Papers (2)
| | PDF (787 KB)

It is shown that for n-valued conditionally independent features a large family of classifiers can be expressed as an (n-1)st-degree polynomial discriminant function. The usefulness of the polynomial expansion is discussed and demonstrated by considering the first-order Minkowski metric, the Euclidean distance, and Bayes' classifiers for the ternary-feature case. Finally, some interesting side obs... View full abstract»

• ### On the Existence of a Periodic Analog of a Finite Connected Automaton

Publication Year: 1972, Page(s):208 - 211
Cited by:  Papers (3)
| | PDF (678 KB)

The solution of the problem of the existence of an analog with periodic-variable structure of a given fixed-structure connected automaton is presented. Using a Boolean approach, a necessary and sufficient condition for the existence of the periodic analog is proven, and an algorithm that enables us to actually find this analog is given. The saving of the memory capacity needed for the construction... View full abstract»

• ### Orthogonal Expansion of Many-Valued Logical Functions and its Application to their Realization with a Single-Threshold Element

Publication Year: 1972, Page(s):211 - 218
Cited by:  Papers (3)
| | PDF (1115 KB)

The orthogonal expansion of many-valued logical functions is described and some approximate forms derived from it are discussed. A method of logical design of many-valued functions, especially threshold functions, using a single-threshold element is proposed based on the approximate forms. View full abstract»

• ### A Model for Pattern Recognition Systems with Binary Pattern Vectors

Publication Year: 1972, Page(s): 219
| | PDF (246 KB)

First Page of the Article
View full abstract»

• ### Transference of Learning Between Recognition Classes

Publication Year: 1972, Page(s):219 - 220
Cited by:  Papers (2)
| | PDF (507 KB)

To demonstrate transference, experiments have been carried out in which the recognition of Highleyman's handprinted numerals was a few percent more accurate when numerals and letters were used as a training set than when only numerals were used as a training set. View full abstract»

• ### Comment on "A Nonlinear Mapping for Data Structure Analysis

Publication Year: 1972, Page(s):220 - 221
Cited by:  Papers (7)
| | PDF (1150 KB)

An alternative metric for use with Sammon's nonlinear mapping is suggested. Rather than Euclidean, the Hamming metric is proposed as a means of reducing the iteration time. View full abstract»

• ### Contributors

Publication Year: 1972, Page(s):221 - 223
| PDF (3041 KB)
• ### Book Review

Publication Year: 1972, Page(s): 224
| PDF (231 KB)
• ### Abstracts of Current Computer Literature

Publication Year: 1972, Page(s):225 - 235
| PDF (3044 KB)
• ### Descriptor-in-Context Index

Publication Year: 1972, Page(s):236 - 239
| PDF (884 KB)

## Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24
10129 Torino - Italy
e-mail: pmo@computer.org