By Topic

IEEE Transactions on Computers

Issue 6 • Date June 1974

Filter Results

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

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

    Publication Year: 1974, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (196 KB)
    Freely Available from IEEE
  • On Some Open Problems in the Theory of Cellular Automata

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

    Some open problems in the theory of cellular automata are considered: the tradeoff between machine complexity and interconnection complexity, linear time pattern recognition and transformation problems, and the noncomputability of the constant of linearity of linear time problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Unified Approach to Combinational Hazards

    Publication Year: 1974, Page(s):566 - 575
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2824 KB)

    Transients in combinational circuits are approached through an analysis of the transition process in a pure delay circuit model that completely separates delay from structure and logic. During any transition, only monotonically increasing sequences of transient input vertices can occur because no transient input variable can change more than once. This restriction to the shortest trajectories thro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebraic Model for the Analysis of Logical Circuits

    Publication Year: 1974, Page(s):576 - 581
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    The purpose of this paper is to propose an algebraic model of logical circuits which has been designed to build up efficient analysis and simulation procedures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Suboptimal Sequential Decision Schemes With On-Line Feature Ordering

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

    Sequential decision algorithms with on-line feature ordering and a limited look-ahead approximation are considered. The algorithms can be used with or without contextual constraints for multicategory pattern recognition problems. Computational complexity due to on-line ordering of features is analyzed and related to system performance. Computer simulated results are obtained using a standard data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of Some Classification Techniques

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

    The so-called table look-up classification procedure and a modification of it are discussed. These and several other classification techniques are evaluated and simulation results comparing some of the techniques are displayed. Indications are that the table look-up technique is quite useful in classifying large sets of data, such as in remote sensing data analysis. View full abstract»

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

    Publication Year: 1974, Page(s):597 - 602
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1832 KB)

    Random occurrences of three types of errors in the input to a finite automaton are considered: an α error is a deletion of one symbol from the input string; a β error is an insertion of one extra symbol; and a δ error is a change of one symbol into another symbol. A method using operators for determining regular expressions defining error-corrupted strings is developed and is employ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages

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

    The nature of probability-measure languages (pm-languages) has been investigated [2], [3], [7], [8], in particular, those languages generated by given probabilistic grammars (p-grammars). However, the determination of a p-grammar that can generate some given language has been an open question. Since languages are infinite in general, the specification of a pm-language is vague. In this paper, it i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Cost of Developing Large-Scale Software

    Publication Year: 1974, Page(s):615 - 636
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5192 KB)

    The work of software cost forecasting falls into two parts. First we make what we call structural forecasts, and then we calculate the absolute dollar-volume forecasts. Structural forecasts describe the technology and function of a software project, but not its size. We allocate resources (costs) over the project's life cycle from the structural forecasts. Judgment, technical knowledge, and econom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for Generating Prime Implicants of a Boolean Expression

    Publication Year: 1974, Page(s):637 - 641
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    This correspondence gives a method which generates prime implicants in a simple one-pass procedure. Starting from the lowest (or highest) points in the function lattice, it generates successive subcubes in a unique sequence. Each subcube is formed only once. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Explanation of the Reflected Binary Code

    Publication Year: 1974, Page(s):641 - 642
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    Reflected binary (RB) code words plus an even parity check can be considered as signed digit (SD) representations of the corresponding natural binary (NB) code words. The SD code words allow a simple serial conversion with the least significant bit leading of their digits forming the RB code words into the NB code words. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Algorithms for Joining Two Points by a Straight-Line Segment

    Publication Year: 1974, Page(s):642 - 646
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    After an overview of the cellular logic image processor, CLIP 3, parallel algorithms for joining two points are described. These real time algorithms are simple, work properly, preserve the connectivity, are based only on logic, and show much of the behavior of processing occurring in sensory elements of animals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Weighting Method for the Determination of the Irredundant Set of Prime Implicants"

    Publication Year: 1974, Page(s): 646
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    By contradictory example, the method proposed by Bubenik for selecting "an irredundant set of prime implicants" is shown to lack generality. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B74-35 Minicomputers—International Computer State of the Art Report

    Publication Year: 1974, Page(s):647 - 648
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (344 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1974, Page(s): 648-a
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • Compcon Goes to Washington

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