By Topic

IEEE Transactions on Computers

Issue 2 • Date Feb. 1975

Filter Results

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

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

    Publication Year: 1975, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE
  • An Improved Algorithm for Testing the Planarity of a Graph

    Publication Year: 1975, Page(s):113 - 121
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2800 KB)

    Hopcroft and Tarjan [2] have recently proposed an algorithm that runs in linear time for testing the planarity of a graph. The technique finds a representation of the graph as a sequence of paths and then iteratively imbeds these paths to find a mesh structure, rearranging the meshes as needed to accommodate each new path. Demoucron et al. [1] have shown that this rearrangement process is unnecess... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speeding up the Synthesis of Programs from Traces

    Publication Year: 1975, Page(s):122 - 136
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3776 KB)

    An algorithm is given for synthesizing a computer program from a trace of its behavior. Since the algorithm involves a search, the length of time required to do the synthesis of nontrivial programs can be quite large. Techniques are given for preprocessing the trace information to reduce enumeration, for pruning the search using a failure memory technique, and for utilizing multiple traces to the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Comparison of Register Transfer Languages for Describing Computers and Digital Systems

    Publication Year: 1975, Page(s):137 - 150
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4240 KB)

    Different notations have been proposed over the years to describe register transfer (RT) systems. They have met with varying degrees of success and to provide a direct comparison of them is a difficult task. One of the reasons for this is the different views of the RT level of design held by the proponents of the languages. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection oF Pattern-Sensitive Faults in Random-Access Memories

    Publication Year: 1975, Page(s):150 - 157
    Cited by:  Papers (72)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3864 KB)

    Some formal models for pattern-sensitive faults (PSF's) in random-access memories are presented. The problem of detecting unrestricted PSF's is that of constructing a checking sequence for the memory. An efficient procedure for constructing such a checking sequence is presented. A local PSF is defined as a PSF where the faulty behavior of a memory cell Cidepends on a fixed group of cell... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Typicality, Diversity, and Feature Pattern of an Ensemble

    Publication Year: 1975, Page(s):158 - 181
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4000 KB)

    In this paper, issues concerning feature patterns in terms of both feature composition and feature interdependence are discussed, and the concepts of typicality and diversity of an ensemble are formulated. The features of the specimens investigated are organized in a two-dimensional array, called an observation matrix, with each row vector representing the ordered set of features of a specimen. An... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiments in the Contextual Recognition of Cursive Script

    Publication Year: 1975, Page(s):182 - 194
    Cited by:  Papers (35)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3728 KB)

    In this paper a structure for a contextual cursive script recognition system is presented. This system makes use of letter context to determine word length, letter segmentation, and character identity to achieve contextual recognition at the word level. The system consists of a character recognizer that presents a set of best alternatives for each character to a contextual postprocessor whose task... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Asynchronous Sequential Networks Using Read-Only Memories

    Publication Year: 1975, Page(s):195 - 206
    Cited by:  Papers (5)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3240 KB)

    The application of microprogrammed READ-ONLY memories in the design of asynchronous sequential networks is investigated. Variations of single-transition time (STT) state assignments are shown to be applicable to the problem of assigning memory addresses to a memory representation of an asynchronous network. Design algorithms are developed which allow the implementation of an asynchronous sequentia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reed-Muller Like Canonic Forms for Multivalued Functions

    Publication Year: 1975, Page(s):206 - 210
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1992 KB)

    In this correspondence we show the existence of a Reed-Muller like expansion for multivalued functions. We establish that any m-variable, N-valued function [mi]f(xm,xm-1,...x1[/mi]) can be expressed as [mi]Co+ C1x1+ *--+ + CNm_1xmN-1xm-1N-1x1... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes

    Publication Year: 1975, Page(s):210 - 212
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    We show that a low-cost arithmtetic code with group length n detects all unidirectional multiple errors that affect fewer than n bits, as well as a larger class of such errors confined to a restricted set of bit positions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for Binary Coded Balanced and Ordinary Ternary Operations

    Publication Year: 1975, Page(s):212 - 215
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    A representation for binary coded ternary (BCT) numbers is proposed. This representation is then used for the introduction of algorithms for ternary addition and subtraction on binary hardware. In the algorithm introduced, distinction is made between basic algorithms, i.e., those which are independent of the type of the arithmetic, and those which are dependent upon it. Some suggestions as to the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cascade Realizations of Magnetic Bubble Logic Using a Small Set of Primitives

    Publication Year: 1975, Page(s):215 - 217
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Cascades of only three different primitive 3-3 magnetic bubble logic circuits are shown to realize 29 of the 31 equivalence classes of such circuits. The results are compared with earlier realizations using a set of 15 primitives. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A System of Magnetic Bubble Logic

    Publication Year: 1975, Page(s):217 - 218
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    By using two magnetic-bubble positions per bit it is possible to develop simple logical circuits which display essentially unlimited fan-in and fan-out. Systems of these circuits can be organized such that they conserve bubbles. Pipelining methods can be employed to enhance the throughput. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of Unate Cascade Realizability Using Parameters

    Publication Year: 1975, Page(s):218 - 219
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    This correspondence suggests an improved characterization of Boolean functions based on parameters, for unate cascade (UC) realizability. Using this characterization, UC realizability can be readily tested and arrays of UC's can be synthesized to realize arbitrary Boolean functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement"

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

    These comments point out first that the difficulties encountered in a recent paper1in applying the theorems of Boolean algebra to a multivalued system using max and min functions are not due to the type of complement that is chosen, but due to the attempt to deqne a multivalued Boolean algebra using the max and min functions which are not Boolean functions except in the 2-valued case; a... View full abstract»

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

    Publication Year: 1975, Page(s):220 - 221
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    The above comments on our previous paper are two-fold: first that the choice of min and max functions is inappropriate since, in general, these functions are not Boolean; and second that Definitions 1, 2, and 3 are equivalent to existing definitions in mathematical literature. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B75-3 Numerical Methods

    Publication Year: 1975, Page(s): 222
    Request permission for commercial reuse | PDF file iconPDF (224 KB)
    Freely Available from IEEE
  • B75-4 Computer Organization and Programming

    Publication Year: 1975, Page(s):222 - 223
    Request permission for commercial reuse | PDF file iconPDF (480 KB)
    Freely Available from IEEE
  • Comments on the Review of "Peripheral Devices"

    Publication Year: 1975, Page(s):223 - 224
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    People have been taking digs at my work for many years, and I have taken no recourse to reply. The review in the May 1974 issue of the IEEE TRANSACTIONS ON COMPUTERS issue by Professor Barnard seems highly unfair and does not clearly consider the position of an author describing a changing technology. He should understand something of the publishing field and that it takes at least two years to re... View full abstract»

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

    Publication Year: 1975, Page(s): 224
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Problems in Publishing Current Information: In his rebuttal, Professor Flores stresses the difficulty of publishing an up-to-date book. However, in his 1972 review (IEEE TRANSACTIONS ON COMPUTERS, December 1972) of Katzan's book, Flores complained "My curiosity about the 3330 disk system was not satisfied." Katzan had allocated about 5 pages of his 1971 book to a discussion of the IBM 3330 system,... 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: 1975, Page(s): 224-a
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • People are Getting More Important

    Publication Year: 1975, Page(s): 224-b
    Request permission for commercial reuse | PDF file iconPDF (1360 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