Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Computers

Issue 4 • April 1974

Filter Results

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

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

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

    Publication Year: 1974, Page(s): 337
    Request permission for commercial reuse | PDF file iconPDF (1264 KB)
    Freely Available from IEEE
  • An Extension of the Clause Table Approach to Multi-Output Combinational Switching Networks

    Publication Year: 1974, Page(s):338 - 346
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2416 KB)

    There are a number of methods which use a clause table to generate the prime implicants of a switching function. This paper describes a technique for extending the clause table approach to the minimization of multi-terminal networks. The specific extension described here extends the algorithm of Slagle et al. to generate the important implicants of a set of switching functions and to determine a m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Investigation of Alternative Cache Organizations

    Publication Year: 1974, Page(s):346 - 351
    Cited by:  Papers (21)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3408 KB)

    An investigation of the various cache schemes that are practical for a minicomputer has been found to provide considerable insight into cache organization. Simulations are used to obtain data on the performance and sensitivity of organizational parameters of various writeback and lookahead schemes. Hardware considerations in the construction of the actual cache-minicomputer are also noted and a si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Detection of Binary Sequential Machines Using R-Valued Test Machines

    Publication Year: 1974, Page(s):352 - 358
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2312 KB)

    An improved method for detection of faults in completely specified synchronous sequential machines is described. The technique is algorithmic, based on the concept of embedding the given binary machine into an easily testable R-valued machine. Heuristic optimization of additional permutation inputs is shown to lead to considerable reduction in the length of the fault sequence. A bound on the seque... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing for Faults in Wiring Networks

    Publication Year: 1974, Page(s):358 - 363
    Cited by:  Papers (135)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3328 KB)

    An algorithm is derived for multiprobe testing for shorts, opens, and wiring errors in any multiterminal wiring network, such as a printed circuit board, wiring harness, multiconductor cable, or backplane wiring board. For behavioral testing the minimum number of tests required, always achievable, is equal to p - 1 + [log2q], where p is the number of terminals in the largest interconnec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tessellation Aspect of Combinational Cellular Array Testing

    Publication Year: 1974, Page(s):363 - 369
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4792 KB)

    This paper introduces procedures which enable one to settle the tessellation problem for the class of combinational cellular arrays with each cell having a binary horizontal input and a binary vertical input. Where all input combinations are applicable to all cells in the array in this class, the necessary number of tests is obtained from necessary prime as well as composite tessellations. View full abstract»

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

    Publication Year: 1974, Page(s):369 - 374
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3336 KB)

    This paper examines the dynamic fault behavior of asynchronous sequential machines, specifically identifying the faults which cause critical races and hazards, and presents a state assignment technique leading to a machine that enters one of a small set of error states whenever a fault occurs. Entry into an error state can be checked by very simple check circuits; a self-testing check circuit and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach to the Optimal Specification of Read-Only Memories in Microprogrammed Digital Computers

    Publication Year: 1974, Page(s):375 - 389
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3008 KB)

    This paper illustrates an algorithm for finding a read-only memory (ROM) specification, optimal in the sense that it results in a minimum ROM bit dimension, starting with an instruction set description which employs acyclic directed graphs. The algorithm selects (by a tabular technique) a descriptive graph subset, shown to be sufficient; then it performs a heuristically guided search among possibl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monte Carlo Solution of Partial Differential Equations by Special Purpose Digital Computer

    Publication Year: 1974, Page(s):389 - 397
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4728 KB)

    The discrete Monte Carlo method for the solution of partial differential equations has been studied theoretically and experimentally. A special purpose digital computer, the PDE machine, was designed and constructed from macromodules, and Monte Carlo solutions for illustrative problems were obtained. Error analysis has been made and experimental outcomes were compared with theoretical results. Usi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compound Sequential Probability Ratio Test for the Classification of Statistically Dependent Patterns

    Publication Year: 1974, Page(s):398 - 410
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2896 KB)

    A sequential test procedure for the classification of statistically dependent patterns is developed. The test is based on the optimum (Bayes) compound decision theory and the theory of Wald's sequential probability ratio test (SPRT). The compound sequential probability ratio (SPRT) is shown to be recursively computable at every instant of the decision process. A two-class recognition problem with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of Mutual Information in Two-Class Pattern Recognition

    Publication Year: 1974, Page(s):410 - 420
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3464 KB)

    Although mutual information (MI) has been proposed for some time as a measure of the dependence between the class variable and pattern recognition features, it is only recently that the practical problems of designing computer programs to use MI have been raised. Within the two-class context, this paper compares two traditional approaches to the requisite entropy estimation (using the maximum like... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for the Solution of Linear Inequalities

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

    The problem of solving a system of linear inequalities is central to pattern classification where a solution to the system, consistent or not, is required. In this paper, an algorithm is developed using the method of conjugate gradients for function minimization. Specifically, it is shown that the algorithm converges to a solution in both the consistent and inconsistent cases in a finite number of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Classifier Design Technique for Discrete Variable Pattern Recognition Problems

    Publication Year: 1974, Page(s):428 - 441
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4160 KB)

    This paper presents a new computerized technique to aid the designers of pattern classifiers when the measurement variables are discrete and the values form a simple nominal scale (no inherent metric). A theory of "prime events" which applies to patterns with measurements of this type is presented. A procedure for applying the theory of "prime events" and an analysis of the "prime event estimates"... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Balancing of Binary Search Trees

    Publication Year: 1974, Page(s):441 - 444
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2024 KB)

    A method for the balancing of binary search trees on a highly parallel computer is described. This method can be adapted for execution on a multiprocessor computer system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Associative Memory Principle

    Publication Year: 1974, Page(s):444 - 445
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    It is shown that an analog associative memory with optimal selectivity can be formed in adaptive processes which use learning algorithms related to the gradient method. The information is distributed throughout the memory by a matrix transform. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable

    Publication Year: 1974, Page(s):445 - 448
    Cited by:  Papers (61)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Two simple heuristic algorithms for piecewise-linear approximation of functions of one variable are described. Both use a limit on the absolute value of error and strive to minimize the number of approximating segnents subject to the error limit. The first algorithm is faster and gives satisfactory results for sufficiently smooth functions. The second algorithm is not as fast but gives better appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

    Publication Year: 1974, Page(s): 448-a
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • IEEE Computer Society Membership & Publications

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