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 11 • Nov. 1972

Filter Results

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

    Publication Year: 1972, Page(s):c1 - 1268
    Request permission for commercial reuse | PDF file iconPDF (602 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1972, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (221 KB)
    Freely Available from IEEE
  • An Optimal Drum Scheduling Algorithm

    Publication Year: 1972, Page(s):1153 - 1165
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2248 KB)

    Suppose a set of N records must be read or written from a drum, fixed-head disk, or similar storage unit of a computer system. The records vary in length and are arbitrarily located on the surface of the drum. The problem considered here is to find an algorithm that schedules the processing of these records with the minimal total amount of rotational latency (access time), taking into account the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Logarithmic Transcoder

    Publication Year: 1972, Page(s):1165 - 1168
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    A transcoder of logarithmic digital information into linear digital information is described. The circuit is simple and accurate. It can be easily integrated and used in any digital-to-analog or analog-to-digital converter with a logarithmic response. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System Modeling and Testing Procedures for Microdiagnostics

    Publication Year: 1972, Page(s):1169 - 1183
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2912 KB)

    Some basic ideas and practices in the area of microdiagnostics are surveyed, and these are molded into a theoretical framework that could help the design of microprogrammed computers, as well as the development of test procedures for fault detection and location. The basic architectural variations as seen in the current microprogrammed computers and their relationship to microdiagnostics are discu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Easily Testable Realizations ror Logic Functions

    Publication Year: 1972, Page(s):1183 - 1188
    Cited by:  Papers (174)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1144 KB)

    Desirable properties of "easily testable networks" are given. A realization for arbitrary logic function, using AND and EXCLUSIVE-OR gates, based on Reed-Muller canonic expansion is given that has many of these desirable properties. If only permanent stuck-at-0 (s-a-0) or stuck-at-1 (s-a-1) faults occur in a single AND gate or only a single EXCLUSIVE-OR gate is faulty, the following results are de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • N-Fail-Safe Sequential Machines

    Publication Year: 1972, Page(s):1189 - 1196
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1248 KB)

    Let S be a sequential machine with binary (i. e., 0 or 1) input and binary output. Suppose that the third value N, different from 0 and 1, represents the faulty input or output value. An N-fail-safe (NFS) machine S̄ of S is then defined as a sequential machine with ternary (i.e., 0, 1, or N) input and ternary output such that: 1) S is a submachine of S̄, and 2) possible output failures o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning Patterns and Pattern Sequences by Self-Organizing Nets of Threshold Elements

    Publication Year: 1972, Page(s):1197 - 1206
    Cited by:  Papers (191)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1624 KB)

    Various information-processing capabilities of self-organizing nets of threshold elements are studied. A self-organizing net, learning from patterns or pattern sequences given from outside as stimuli, "remembers" some of them as stable equilibrium states or state-transition sequences of the net. A condition where many patterns and pattern sequences are remembered in a net at the same time is shown... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Property Encoding: Application in Binary Picture Encoding and Boundary Following

    Publication Year: 1972, Page(s):1206 - 1216
    Cited by:  Papers (23)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2232 KB)

    In this paper the problem of numerical encoding of pictures consisting of regions of differing contrast is discussed. For this purpose we define the containment code, a special case of the more general property code presented in [1]. The containment code leads in a natural way to procedures for following the boundaries of the regions of the picture. This permits a compression of data into a linear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence of an Identification Technique for Nonlinear Systems

    Publication Year: 1972, Page(s):1216 - 1219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The error equation for an approximate derivative computation scheme predicts convergence of a minimum area criterion for the identification of nonmemory-type nonlinearities and nonconvergence for memory-type nonlinearties. Determination of the system order and gain parameters is possible. Typical experimental results are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing the Computation Time for Using the Technique of Sectioning for Digital Filtering of Pictures

    Publication Year: 1972, Page(s):1219 - 1222
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    This note considers the problem of minimizing the computation time required for digital filtering of pictures by the technique of sectioning. Direct enumeration on a computer was used to tabulate the optimum section size, and tables of the optimum section sizes are presented. The tables are compared with previously tabulated optimum sections for one-dimensional filtering; the optimal two-dimension... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Pattern Search Algorithm for Feedback-Control System Parameter Optimization

    Publication Year: 1972, Page(s):1222 - 1227
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB)

    The problem of parameter optimization for the purpose of synthesis and design of feedback control systems is considered. A flexible performance index, which permits direct consideration of performance specifications such as rise time, settling time, peak overshoot, and bandwidth, in addition to the usual analytic forms, is developed and adapted to a modified version of Rosenbrock's pattern -search... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Ordering of Connections for Automatic Wire Routing

    Publication Year: 1972, Page(s):1227 - 1233
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1208 KB)

    Most wire-routing programs utilize a maze-running technique to route one connection at a time. Once routed, a wire cannot be moved even if it is subsequently discovered to interfere with the successful completion of other connections. The order in which the desired connections are presented to the routing algorithm has therefore been thought to be of critical importance. Experimental evidence is p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Mechanism for Describing Silhouettes

    Publication Year: 1972, Page(s):1233 - 1239
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1280 KB)

    We describe a parallel mechanism, based on an array of circularly nutating photodetectors, that computes an approximation of the density of slopes of the boundary of any piecewise regular silhouette. This density, when properly normalized, is invariant with respect to the size, translation, and orientation of the given silhouette. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions

    Publication Year: 1972, Page(s):1239 - 1246
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1504 KB)

    This note describes an iterative procedure for generating the prime implicants of switching functions by utilizing a new tabular mode of functional representation called clause-column table. The procedure generates all the prime implicants and can be applied equally well to functions given in the sum-of-products or in the product-of-sums froms, both canonical and noncanonical. The procedure can al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on " Single-Channel and Multichannel Finite-State Machines"

    Publication Year: 1972, Page(s): 1247
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB)

    In the nonbinary case, the upper bound on the number of states of the one-channel analog for a k-channel finite-state machine is lower than that given by Gill.1 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to the June 1972 Contributors Section

    Publication Year: 1972, Page(s): 1247
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB)

    In the June 1972 issue of this TRANSACTIONS an inadvertant transposition occurred among the photographs and biographies of three authors. The correct association of these items should have been as shown here. The Editor expresses his regrets to the authors, and apologizes for any inconvenience the oversight may have caused. View full abstract»

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

    Publication Year: 1972, Page(s):1248 - 1249
    Request permission for commercial reuse | PDF file iconPDF (2540 KB)
    Freely Available from IEEE
  • B72-21 Data Structures and Management

    Publication Year: 1972, Page(s): 1250
    Request permission for commercial reuse | PDF file iconPDF (256 KB)
    Freely Available from IEEE
  • B72-22 FORTRAN IV: A Modem Approach

    Publication Year: 1972, Page(s): 1251
    Request permission for commercial reuse | PDF file iconPDF (296 KB)
    Freely Available from IEEE
  • B72-23 Modem Data Processors and Systems

    Publication Year: 1972, Page(s):1251 - 1252
    Request permission for commercial reuse | PDF file iconPDF (512 KB)
    Freely Available from IEEE
  • B72-24 Adaptation and Learning in Automatic Systems

    Publication Year: 1972, Page(s): 1252
    Request permission for commercial reuse | PDF file iconPDF (248 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Publication Year: 1972, Page(s):1253 - 1267
    Request permission for commercial reuse | PDF file iconPDF (3518 KB)
    Freely Available from IEEE
  • IEEE Computer Society Membership & Publications

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

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