# IEEE Transactions on Computers

## Filter Results

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

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

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

Publication Year: 1972, Page(s): nil1
| PDF (213 KB)
• ### Editor's notice [Change of Associate Editor]

Publication Year: 1972, Page(s): 941
| PDF (633 KB)
• ### Application of Intensity-Modulated Ink Jets to Alphanumeric Printing Devices

Publication Year: 1972, Page(s):942 - 947
Cited by:  Papers (2)  |  Patents (2)
| | PDF (1163 KB)

Experimental models for a line printer and a terminal printer have been constructed, making use of intensity-modulated ink jets for the recording of characters on untreated paper at a speed of 24 lines/s and 50 characters/s, respectively. The characters are printed on the matrix principle, using matrices of 10X16 and 5X7 formed by one oscillating ink jet. The nozzles producing the jets are oscilla... View full abstract»

• ### Some Computer Organizations and Their Effectiveness

Publication Year: 1972, Page(s):948 - 960
Cited by:  Papers (556)  |  Patents (11)
| | PDF (2439 KB)

A hierarchical model of computer organizations is developed, based on a tree model using request/service type resources as nodes. Two aspects of the model are distinguished: logical and physical. General parallel- or multiple-stream organizations are examined as to type and effectiveness-especially regarding intrinsic logical difficulties. The overlapped simplex processor (SISD) is limited by data... View full abstract»

• ### Minimum Search Tree Structures for Data Partitioned into Pages

Publication Year: 1972, Page(s):961 - 967
Cited by:  Papers (2)
| | PDF (1155 KB)

The doubly chained tree structure is an efficient device for organizing a file that must be searched and updated frequently. This paper considers a variation to the doubly chained tree which is more representative of a file in which the data is partitioned into blocks or pages. In this model the cost of searching the next node is 1 if the node is reachable from the same root (i.e., on the same pag... View full abstract»

• ### Asymptotic Analysis of a Nonparametric Clustering Technique

Publication Year: 1972, Page(s):967 - 974
Cited by:  Papers (19)
| | PDF (1172 KB)

A family of nonparametric clustering criteria has been previously proposed by the authors. One particular member of this family was subjected to analysis and experimentation. This criterion was shown by heuristic argument, experimentation, and approximate asymptotic analysis to exhibit valley-seeking'' behavior. In this paper, we consider a more general class of valley-seeking criteria. The resu... View full abstract»

• ### Microprogrammed Arrays

Publication Year: 1972, Page(s):974 - 984
Cited by:  Papers (6)  |  Patents (22)
| | PDF (1943 KB)

The logical organization of a programmable cellular array is presented and discussed. This array is a two-dimensional array of identical cells, each of which can be programmed to one of 12 functional states. It is shown that by appropriate selection of the cell states, a useful class of microprograms can be realized with the array. The realization of a microprogram consists of two steps. First, ea... View full abstract»

• ### Universal Base Functions and Modules for Realizing Arbitrary Switching Functions

Publication Year: 1972, Page(s):985 - 995
Cited by:  Papers (3)
| | PDF (1954 KB)

Universal base functions (UBF's) which are generalizations of universal logic functions are defined. An (n, m, r)-UBF can be implemented as a single module (UBM) with n+m inputs and 1 output. An arbitrary n-variable switching function fn (X) is then realized on the fixed UBM by realizing a suitable set of m r-variable functions with which to drive m inputs of the UBM, the remaining n in... View full abstract»

• ### Computer Minimization of Multivalued Switching Functions

Publication Year: 1972, Page(s):995 - 1003
Cited by:  Papers (40)
| | PDF (1458 KB)

A cubical representation for multivalued switching functions, which is very convenient for digital computer processing, is presented. A p-valued switching function of n variables is represented by an array of cubes. Each cube is composed of a logical co-efficient and n coordinates with each coordinate represented by p bits. A set of operators for multivalued logic design (such as sharp, union, etc... View full abstract»

• ### An Adaptive Random Search Algorithm for Constrained Minimization

Publication Year: 1972, Page(s):1004 - 1008
Cited by:  Papers (11)
| | PDF (896 KB)

The well-known pattern search method has been randomized by Lawrence and Steiglitz [4] in order to augment its ability to adapt to direction. In this note we introduce other refinements in order to make it more adaptive in step size, and the use of penalty terms is incorporated as so to accommodate constraints. This yields an algorithm that appears to be robust and reliable, as verified by numeric... View full abstract»

• ### On Generalized Reed-Muller Expansions

Publication Year: 1972, Page(s):1008 - 1009
Cited by:  Papers (7)
| | PDF (432 KB)

The generalized Reed-Muller expansions of a switching function are generated using a single Boolean matrix and step-by-step shifting of the principal column. View full abstract»

• ### A Space-Efficient List Structure Tracing Algorithm

Publication Year: 1972, Page(s):1009 - 1010
Cited by:  Papers (6)
| | PDF (441 KB)

An algorithm for tracing during garbage collection of list structure is presented. It requires only one bit for each level of doubly branching structure traced. Compared to existing trace algorithms, it generally requires less storage-often, substantially less. View full abstract»

• ### Nonlinear Termination of Transmission Lines

Publication Year: 1972, Page(s):1011 - 1015
Cited by:  Papers (2)
| | PDF (746 KB)

The technique of using nonlinear resistances to terminate interconnecting transmission lines has been designed and tested, and is recommended for use in very high-speed digital circuits. This technique can save power, simplify wiring, and eliminate the problem of ringing in branched networks. Line matching by nonlinear resistance is investigated theoretically, and the properties, possibilities, an... View full abstract»

• ### An Automatic Test Generation System for Illiac IV Logic Boards

Publication Year: 1972, Page(s):1015 - 1017
Cited by:  Papers (24)
| | PDF (608 KB)

A test generation system, developed for the logic boards of the Illiac IV computer, is described. The system combines the test generation by random patterns and the D-algorithm. Some results are given to illustrate the effectiveness of this approach. View full abstract»

• ### High-Speed Multiplication Systems

Publication Year: 1972, Page(s):1017 - 1021
| | PDF (735 KB)

Large-scale scientific computers are characterized by having a high ratio of computing requirements to the input-output requirements. Thus the speed of arithmetic operations should be of prime importance in this group of digital computers. In this note a mathematical formula is derived to determine the multiplication time obtained by each of the known high-speed multiplication techniques. Then a c... View full abstract»

• ### On Complementation of Boolean Functions

Publication Year: 1972, Page(s): 1022
Cited by:  Papers (3)
| | PDF (191 KB)

A theorem is presented that simplifies the computations necessary for complementing a Boolean function. View full abstract»

• ### Cellular Array for Extraction of Squares and Square Roots of Binary Numbers

Publication Year: 1972, Page(s):1023 - 1024
Cited by:  Papers (8)  |  Patents (1)
| | PDF (406 KB)

A cellular array is described that is capable of extracting either the square or the square root of a binary number. The mode of operation is controlled by a single-mode input line. The array is iterative in its connection pattern and is therefore suitable for large-scale integrated (LSI) implementation. Approximate time-delay expressions are derived, which show that the delays for square or squar... View full abstract»

• ### A Simple Technique for Determination of Essential Multiple Output Prime Implicants

Publication Year: 1972, Page(s):1024 - 1026
| | PDF (630 KB)

A simple extension of Ghazala's technique yields a useful criterion of essentiality of a multiple output prime implicant. Use of such a criterion can simplify the subsequent logic minimization procedure. View full abstract»

• ### Signal Flow Graph and a Fortran Program for Haar-Fourier Transform

Publication Year: 1972, Page(s):1026 - 1027
Cited by:  Papers (2)  |  Patents (2)
| | PDF (429 KB)

A signal flow graph is given and a corresponding Fortran program for the Haar-Fourier transform is described. The algorithm performs N - 1 additions and N - 1 subtractions on input data, N being the data number. View full abstract»

• ### Comments on "Error Bounds for a Contextual Recognition Procedure

Publication Year: 1972, Page(s): 1027
Cited by:  Papers (1)
| | PDF (208 KB)

First Page of the Article
View full abstract»

Publication Year: 1972, Page(s):1027 - 1028
Cited by:  Papers (2)
| | PDF (494 KB)

First Page of the Article
View full abstract»

• ### Comments on "A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties

Publication Year: 1972, Page(s):1028 - 1029
| | PDF (561 KB)

First Page of the Article
View full abstract»

Publication Year: 1972, Page(s): 1029
| | PDF (275 KB)

First Page of the Article
View full abstract»

## 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