By Topic

IEEE Transactions on Computers

Issue 2 • Date Feb. 1978

Filter Results

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

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

    Publication Year: 1978, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (248 KB)
    Freely Available from IEEE
  • Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces

    Publication Year: 1978, Page(s):97 - 105
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3247 KB)

    Algorithms are presented that construct the shortest connecting network, or minimal spanning tree (MST), of N points embedded in k-dimensional coordinate space. These algorithms take advantage of the geometry of such spaces to substantially reduce the computation from that required to construct MST's of more general graphs. An algorithm is also presented that constructs a spanning tree that is ver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Correction by Alternate-Data Retry

    Publication Year: 1978, Page(s):106 - 112
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2590 KB)

    A new technique for low-cost error correction is the alternate-data retry (ADR). Like a conventional retry, an ADR is a re-execution of an operation that initially fails to produce an error-free result. Unlike a conventional retry, an ADR uses an alternate representation of the initial data. The choice of the alternate data representation and the design of the processing circuits combine to insure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memory Systems for Image Processing

    Publication Year: 1978, Page(s):113 - 125
    Cited by:  Papers (36)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3448 KB)

    An image can be represented by a two-dimensional array of "image points," which are sets of integers that each describe the color and intensity of a portion of the image. Image-processing operations require that an image or partial image be stored in a memory system that permits access to sequences of image points along any row or column of this image array and/or to the image points within small ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Model-Based Vision System for Industrial Parts

    Publication Year: 1978, Page(s):126 - 143
    Cited by:  Papers (183)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (9057 KB)

    A vision system has been developed which can determine the position and orientation of complex curved objects in gray-level noisy scenes. The system organizes and reduces the image data from a digitized picture to a compact representation having the appearance of a line drawing. This compact image representation can be used for forming a model under favorable viewing conditions or for locating a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-Dimensional Microprocessor Pipelines for Image Processing

    Publication Year: 1978, Page(s):144 - 156
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3427 KB)

    Two-dimensional arrays of microprocessors are considered for the implementation of image processors that are formulated according to a certain state-space model. The microprocessors are totally synchronized—operating with the same clock and executing the same instructions, communicating with each other through local memory units. This allows the use of such an array as a pipeline for the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Decomposition Chart Technique to Aid in Realizations with Multiplexers

    Publication Year: 1978, Page(s):157 - 159
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (569 KB)

    Boolean functions can be realized using multiplexer elements by exploiting Shannon's expansion theorem. The cost of the realization often depends on the choice of the expansion variables versus the residue variables. A method employing Ashenhurst's decomposition charts [6] is described which assists in visualizing the residue functions. The method is effective for six variable functions or less. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Easily Diagnosable Sequential Machines

    Publication Year: 1978, Page(s):159 - 162
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (789 KB)

    This correspondence throws some light into the area of easily diagnosable machines. Given the behavior of a sequential machine in terms of a state table it explores the possibilities of designing a structure, that facilitates easy diagnosis of faults. The objective is achieved through structural decomposition which has already claimed to produce simpler physical realization. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Construction of Binary Matrices with Distinct Submatrices

    Publication Year: 1978, Page(s):162 - 164
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (723 KB)

    Using certain basic facts about finite fields and their use in the construction of linear shift registers of maximal period, a method has been described for the construction of arrays such that if one looks at different parts of the array through a fixed size "window," each configuration seen is distinct. The method has been exemplified in the case where the elements of the array are binary digits... View full abstract»

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

    Publication Year: 1978, Page(s):164 - 167
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    A short list is given of two-dimensional line structures which are topologically identifiable one from the other. View full abstract»

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

    Publication Year: 1978, Page(s): 167
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    A new mathematical algorithm has been developed for the tangent. The form of the equation guarantees that the error is zero at 0°, 45°, and 90° corresponding to tangents of 0, 1, and infinity. With only one constant the error is brought to zero at two more points and the maximum error is less than one part in 3000. By adding a second constant, the error is reduced to less than one i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inference of Sequential Machines from Sample Computations

    Publication Year: 1978, Page(s):167 - 170
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (905 KB)

    This correspondence presents and justifies an algorithm for finding a minimal, though not a smallest, finite sequential machine with a behavior comprising a given finite sample of input-output behavior of some unknown sequential machine. When the number of states n of the machine to be identified is known and the sample contains all input-output pairs of length 2n - 1, the machine found will be eq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Myopic Policies in Sequential Classification

    Publication Year: 1978, Page(s):170 - 174
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1196 KB)

    Several rules for feature selection in myopic policy are examined for solving the sequential finite classification problem with conditionally independent binary features. The main finding is that no rule is consistently superior to the others. Likewise no specific strategy for the alternating of rules seems to be significantly more efficient. View full abstract»

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

    Publication Year: 1978, Page(s):174 - 176
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (815 KB)

    This paper presents an account of algorithms, and the execution of their programs, applied to large practical problems, for array logics, programmed logic arrays (PLA's), in particular for NASA's Jet Propulsion Laboratory at the California Institute of Technology for the Venus Probe and for certain nuclear propulsion studies. The problem of array logic optimization—covering switching functio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Clustering for Problem Localization

    Publication Year: 1978, Page(s):176 - 181
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1113 KB)

    The general procedure of conventional clustering is modified for various applications involving problem localization. This modification introduces the concept of clustering criteria which are used for partitioning a training set, and depend upon certain a priori information with regards to the training set. Also, the need of a structure or a mathematical form for the partition boundaries arises na... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal Test Sets for Multiple Fault Detection in AND-EXOR Arrays

    Publication Year: 1978, Page(s):181 - 187
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1107 KB)

    The fault-detection problem in AND-EXOR arrays is formulated in a new framework. The arrays considered are more general compared to those by the previous researchers. Designs of fault-detecting test sets to detect all multiple faults in these networks are presented. The designs are independent of the function realized and hence can be generated easily. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boolean Network Probabilities and Network Design

    Publication Year: 1978, Page(s):187 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (438 KB)

    The correspondence between Boolean network probabilities and the design formalisms of Ledley and Aiken is demonstrated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Branch and Bound Clustering Algorithm"

    Publication Year: 1978, Page(s): 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    Clustering may be viewed as a combinatorial optimization problem. In the above paper1, the number of ways in which N objects may be assigned to M distinct classes is given by One can easily see that this can be true if and only if M! is a divisor of MN and this is true if and only if M = 1 or M = 2. View full abstract»

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

    Publication Year: 1978, Page(s): 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    As Wetjen observed his comment, MN/M! is only an approximation to the number of ways N objects may be clustered into M nonempty classes. However, this formula has no bearing on our results—it is simply used to motivate the application of branch and bound. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Error-Correcting Codes for Byte-Organized Arithmetic Processors"

    Publication Year: 1978, Page(s):189 - 190
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    This letter concerns the above paper1by P. G. Neumann and T. R. N. Rao. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author's Reply and Comments on the Arithmetic Codes Generated by A = (r - 1)p2

    Publication Year: 1978, Page(s): 190
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    This correspondence is not only a reply to Gritsenko's remarks but also a brief comment on the results found in both papers by Gritsenko [1] and Neumann and Rao.2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Direct Coherent Optical Fourier Transforms of Curves"

    Publication Year: 1978, Page(s):190 - 191
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    The technique that is described by Lanzl and Heitmann in "Direct coherent optical Fourier transform of curves,"1 is shown to be a form of area modulation. Simpler and equally useful techniques have already been described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Procedures for Eliminating Static and Dynamic Hazards in Test Generation"

    Publication Year: 1978, Page(s): 191
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    The following comments on the paper1by M. A. Breuer may be in order. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Delayed Universal Logic Modules and Sequential Machine Synthesis"

    Publication Year: 1978, Page(s): 191
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    Van and Houtte1have suggested a delayed ULM-n for synthesis of sequential machines. Almost an identical approach was suggested by Sureshchander and Bhatt [1] earlier. View full abstract»

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

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