Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computers

Issue 4 • April 1970

Filter Results

Displaying Results 1 - 19 of 19
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 1970, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (329 KB)
    Freely Available from IEEE
  • IEEE Computer Group

    Publication Year: 1970, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • System Design of a Cellular APL Computer

    Publication Year: 1970, Page(s):291 - 303
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1667 KB)

    A system design is given for a computer capable of efficient execution of APL source statements and programs. The system is organized in a new type computer architecture based upon the storage of matrices and vectors in cellular logic arrays. Almost all of the scalar, mixed, and composite fixed point APL operations are implemented on the machine by algorithms given in this paper. The detailed logi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Algorithm for Generating Prime Implicants

    Publication Year: 1970, Page(s):304 - 310
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1045 KB)

    This paper describes an algorithm which will generate all the prime implicants of a Boolean function. The algorithm is different from those previously given in the literature, and in many cases it is more efficient. It is proved that the algorithm will find all the prime implicants. The algorithm may possibly generate some nonprime implicants. However, using frequency orderings on literals, the ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of the Karhunen-Loève Expansion to Feature Selection and Ordering

    Publication Year: 1970, Page(s):311 - 318
    Cited by:  Papers (276)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1275 KB)

    The Karhunen-Lo6ve expansion has been used previously to extract important features for representing samples taken from a given distribution. A method is developed herein to use the Karhunen-Loeve expansion to extract features relevant to classification of a sample taken from one of two pattern classes. Numerical examples are presented to illustrate the technique. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Extension of Threshold Logic

    Publication Year: 1970, Page(s):319 - 341
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4568 KB)

    This paper presents an extension of the concept of linear separation to generate a wider class of Boolean functions. This generalization is affected by modifying the requirements for separation to allow both true and false assignments to reside on the same hyperplane (pseudoseparation) or within the same neighborhood of a hyperplane (marginal separation). Boolean functions which can be separated i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State Minimization of Incompletely Specified Sequential Machines

    Publication Year: 1970, Page(s):342 - 348
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB)

    This paper describes a new method for the state minimization of incompletely specified sequential machines. Previously described methods start with generating all maximal compatibles of states of the original incompletely specified machine and then try to find a closed cover which consists of a minimal number of MCs or portions of MCs. This process involves a long enumeration process and, as the n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Threshold Logic Asymptotes

    Publication Year: 1970, Page(s):349 - 353
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (889 KB)

    Let Rnmbe the number of linearly separable n-argument functions specified on some m points of the n-cube. Let R̄nmand Ṟnmbe, respectively, the minimum and maximum values attained over all choices of the m points. It is known that R̄nm<2mn/n!. 1) Two published "simplifications" of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential Machines Realizable with Delay Elements Only

    Publication Year: 1970, Page(s):353 - 355
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (625 KB)

    This note is concerned with the realization of sequential machines without logic, i. e., using delay elements only. The other approach to the problem deals with only the next-state behavior and tends to be rather long. A new approach is presented for not only the next-state behavior, but also for the complete behavior. Beginning with the output partitions, the predecessors are found until the proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completely Periodic Multithreshold Functions

    Publication Year: 1970, Page(s):355 - 358
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    A class of Boolean functions arising naturally from a consideration of the periodicities of multithreshold functions is defined and the basic properties of these functions, the completely periodic functions, are determined. The observation that this class is invariant under the group of affine transformations allows for a tabulation of the completely periodic functions of up to four variables. Fin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Iterative Consensus to Multiple-Output Functions

    Publication Year: 1970, Page(s): 359
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A limitation in the application of the technique of iterative consensus to multiple-output functions is discussed. A brief example is given, and a solution to the limitation is offered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of the Hadamard Transform and the R- Transform in Ordered Form

    Publication Year: 1970, Page(s):359 - 360
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    This correspondence describes a method of computing the Hadamard transform and the R-transform. This method produces the transform components in the order of the increasing sequency of the Walsh functions represented by the rows of a symmetric Hadamard matrix for which the sequency of each row is larger than the sequency of the preceding row. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Winograd's Algorithm for Inner Products

    Publication Year: 1970, Page(s):360 - 361
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    This correspondence demonstrates an improvement on Winogard's algorithm for inner products as applied to the multiplication of two matrices. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Nonparametric Partitioning Procedure for Pattern Classification"1

    Publication Year: 1970, Page(s):362 - 363
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1336 KB)

    In the above-mentioned paper, Henrichon and Fu present a non- parametric procedure for multivariate, multiclass pattern classification. They obtain a confidence bound on the probability of error through the theory of distribution-free tolerance regions. However, their procedure for obtaining a confidence bound on the basis of a sample from each class is not valid. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authors' Reply5

    Publication Year: 1970, Page(s):363 - 364
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2552 KB)

    The authors wish to thank G. W. Beakley and F. B. Tuteur for their identification of a source of difficulty in the analysis of the non- parametric procedure as originally proposed. We shall reexamine our analysis in the light of this new development and will report on any modifications at a later date. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstracts of Current Computer Literature

    Publication Year: 1970, Page(s):365 - 385
    Request permission for commercial reuse | PDF file iconPDF (4723 KB)
    Freely Available from IEEE
  • Blank Page

    Publication Year: 1970, Page(s): 385
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1970, Page(s): 385
    Request permission for commercial reuse | PDF file iconPDF (253 KB)
    Freely Available from IEEE
  • Blank Page

    Publication Year: 1970, Page(s): 385
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE

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