By Topic

Computers, IEEE Transactions on

Issue 2 • Date Feb. 1975

Filter Results

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

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (457 KB)  
    Freely Available from IEEE
  • IEEE Computer Society

    Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (216 KB)  
    Freely Available from IEEE
  • An Improved Algorithm for Testing the Planarity of a Graph

    Page(s): 113 - 121
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 unnecessary if the paths are considered in the proper order. The present implementation is found to run in linear time for most ordinary cases, about twice as fast as Tarjan's Algol implementation. A graph of 3000 vertices and 8994 edges required about 18 s. 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

    Page(s): 122 - 136
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 best advantage. The results of numerous tests are given to demonstrate the value of the techniques. 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

    Page(s): 137 - 150
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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

    Page(s): 150 - 157
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 cells called the neighborhood of Ci. Neighborhoods are divided into two classes, open and closed. Test generation methods are described for local PSF's defined on both open and closed neighborhoods. The detection of PSF's when only one memory cell is faulty (single PSF's) is also discussed. 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

    Page(s): 158 - 181
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 algorithm (based upon the proposed measures and statistical screening) is implemented for extracting feature patterns. In the algorithm, schemes for feature patterns and specimen reweighting are proposed to optimize the utilization of available information in the array, and to minimize possible bias caused by the uneven sampling of the ensemble. Two sets of real world data in the environmental and molecular biology areas are used to exemplify the physical meaning of the proposed measures as well as to demonstrate the operational feasibility and significance of this methodology in analyzing homologous ensemble which is subject to variable degrees of diversity. 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

    Page(s): 182 - 194
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 it is to determine the correct word. 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

    Page(s): 195 - 206
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 sequential network as a READ-ONLY memory. Two operating modes are considered: normal asynchronous operation and a self-clocked mode in which sequential outputs are allowed on a single-input change, thus providing a means of implementing functions normally achieved with synchronous (clocked) networks. In addition the practical timing constraints of the proposed methods are considered. 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

    Page(s): 206 - 210
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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-1x1N-1[/mi]. A matrix method for determining the coefficients of these expansions is presented. The problem of finding minimal expression for a given function is discussed. Finally, we present a new technique for realizing multiple output functions. 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

    Page(s): 210 - 212
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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

    Page(s): 212 - 215
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 significance of this approach for nonternary arithmetic are presented. 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

    Page(s): 215 - 217
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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

    Page(s): 217 - 218
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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

    Page(s): 218 - 219
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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"

    Page(s): 220
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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; and second, that the three types of complement defined are well known in the context of multivalued non-Boolean algebras. View full abstract»

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

    Page(s): 220 - 221
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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

    Page(s): 222
    Save to Project icon | Request Permissions | PDF file iconPDF (224 KB)  
    Freely Available from IEEE
  • B75-4 Computer Organization and Programming

    Page(s): 222 - 223
    Save to Project icon | Request Permissions | PDF file iconPDF (480 KB)  
    Freely Available from IEEE
  • Comments on the Review of "Peripheral Devices"

    Page(s): 223 - 224
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 research and write a book; to have the book reviewed by the publisher, to revise it, and to get it into production takes another two years; and, finally, to get the book reviewed takes another year. One of the reviewer's most devastating criticisms is that the material is five years old. From the above time-table how could I possibly publish information on current machines? How could I ever catchup? View full abstract»

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

    Page(s): 224
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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, including the "rotational position sensing" and "multiple requesting" features. Professor Flores now explains to us that his own book, published two years later, cannot be expected to cover these same items, because of the "constraint of time and necessity!" View full abstract»

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

    Page(s): 224-a
    Save to Project icon | Request Permissions | PDF file iconPDF (144 KB)  
    Freely Available from IEEE
  • People are Getting More Important

    Page(s): 224-b
    Save to Project icon | Request Permissions | 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
Albert Y. Zomaya
School of Information Technologies
Building J12
The University of Sydney
Sydney, NSW 2006, Australia
http://www.cs.usyd.edu.au/~zomaya
albert.zomaya@sydney.edu.au