By Topic

IEEE Transactions on Computers

Issue 5 • Date May 1970

Filter Results

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

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

    Publication Year: 1970, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (190 KB)
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1970, Page(s): 387
    Request permission for commercial reuse | PDF file iconPDF (1136 KB)
    Freely Available from IEEE
  • A Real-Time Operating System for Manned Spaceflight

    Publication Year: 1970, Page(s):388 - 398
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2408 KB)

    This paper highlights the salient features of the real- time operating system/360 (RTOS) which is being used as the ground support system for the Apollo space program. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Biresidue Error-Correcting Codes for Computer Arithmetic

    Publication Year: 1970, Page(s):398 - 402
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    In an earlier paper [11] a scheme for detecting errors in ADD, COMPLEMENT, SHIFT, and ROTATE operations using a residue check circuitry was presented. A scheme for error location and correction in those operations is derived by a suitable application of a code called biresidue arithmetic code described here. Any single error position can be located and also corrected by use of two residue checkers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dynamic Memory Allocation Algorithm

    Publication Year: 1970, Page(s):403 - 411
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1824 KB)

    A dynamic memory allocation algorithm is presented making use of a priori information about a computer program. A two- level storage system is assumed, and a replacement algorithm is developed based upon a priori knowledge of interaction factors between any two space-taking entities associated with a computation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete-Time Systems with the Decomposition Property

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

    The decomposition property, a necessary condition for linearity, is defined for discrete-time systems. N-state machines with this property have finite memory μ≤N−1. Linear and autonomous systems are important classes of systems with decomposition. Several representations of systems with decomposition are given and a general form of the discrete-time state equations for a finite-me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational Complexity of Partitioned List Algorithms

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

    Some parameters related to the computational complexity of partitioned list algorithms are evaluated. Specifically, an upper bound is computed for the average number of comparisons needed by the most unsophisticated version of a partitioned list algorithm for processing a Boolean function in v variables and u canonical clauses. For the same functions the average memory size required for processing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Synthesis of Redundant Threshold- Logic Elements

    Publication Year: 1970, Page(s):429 - 443
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3056 KB)

    This paper is devoted to the development of procedures for synthesizing threshold-logic elements which can be employed in redundant networks based on the von Neumann multiplexing principle. A major result is the statement of rules for synthesizing elements whose outputs are correct despite the presence of e or fewer errors on the input lines. Several theorems are proved and used as the basis for e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Berkeley Array Processor

    Publication Year: 1970, Page(s):444 - 447
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    The Berkeley array processor is a special-purpose computer designed to perform the operations of correlation, convolution, recursive filtering, matrix multiplication, as well as a variant of the Cooley-Tukey algorithm, and others. This note describes the logical organization and performance of this device. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonorthogonal Projections for Feature Extraction in Pattern Recognition

    Publication Year: 1970, Page(s):447 - 452
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1152 KB)

    It is known that R linearly separable classes of multidimensional pattern vectors can always be represented in a feature space of at most R dimensions. An approach is developed which can frequently be used to find a nonorthogonal transformation to project the patterns into a feature space of considerably lower dimensionality. Examples involving classification of handwritten and printed digits are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Upper Bound for the Finite Delay of Graphs

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

    The notion of graphs solvable with finite delay appears in [1] and [4]. In this note the upper bound on finite delay for a graph with N nodes is reduced to the order of 2N2using techniques from finite automata theory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular Events in Stochastic Sequential Machines

    Publication Year: 1970, Page(s):456 - 457
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    Events representable in stochastic sequential machines, as defined previously by several authors, are shown to be regular in certain cases. The construction of deterministic machines representing those events is implicit. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Tracey's Internal State Assignment Method

    Publication Year: 1970, Page(s): 458
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    Certain partitions in Tracey's assignment method may be eliminated because of impossible transitions on the inputs. This may reduce the complexity of the sequential machine. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Time Required for Timing—The Halting Problem Rephrased

    Publication Year: 1970, Page(s):458 - 459
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    The proof of the unsolvability of the halting problem can be reformulated to show that, in general, the best one can do to estimate the run time of programs is to execute them. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "The Determination of the Maximum Compatibility Classes"

    Publication Year: 1970, Page(s): 459
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authors' reply

    Publication Year: 1970, Page(s): 459
    Request permission for commercial reuse | PDF file iconPDF (202 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contributors

    Publication Year: 1970, Page(s):460 - 461
    Request permission for commercial reuse | PDF file iconPDF (2616 KB)
    Freely Available from IEEE
  • B70-1 Truth Functions and the Problem of Their Realization by Two-Terminal Graphs

    Publication Year: 1970, Page(s): 462
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • R70-1 A Note on Computing Time for the Recognition of Context- Free Languages by a Single-Tape Turing Machine

    Publication Year: 1970, Page(s): 463
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (208 KB)
    Freely Available from IEEE
  • R70-2 Nested Stack Automata

    Publication Year: 1970, Page(s): 463
    Request permission for commercial reuse | PDF file iconPDF (208 KB)
    Freely Available from IEEE
  • R70-3 On Stochastic Languages

    Publication Year: 1970, Page(s):463 - 464
    Request permission for commercial reuse | PDF file iconPDF (472 KB)
    Freely Available from IEEE
  • R70-4 Analysis of Algorithms for the Zero–One Programming Problem

    Publication Year: 1970, Page(s): 464
    Request permission for commercial reuse | PDF file iconPDF (288 KB)
    Freely Available from IEEE
  • R70-5 The Effect of IC's on the Design of Analog Computers

    Publication Year: 1970, Page(s):464 - 465
    Request permission for commercial reuse | PDF file iconPDF (528 KB)
    Freely Available from IEEE
  • R70-6 Use of Functional Approximation Methods in the Computer Solution of Initial Value Partial Differential Equation Problems

    Publication Year: 1970, Page(s): 465
    Request permission for commercial reuse | PDF file iconPDF (272 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