By Topic

IEEE Transactions on Computers

Issue 6 • June 1975

Filter Results

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

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

    Publication Year: 1975, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (203 KB)
    Freely Available from IEEE
  • A Least Mean Squares Cubic Algorithm for On-Line Differential of Sampled Analog Signals

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

    A digital computer algorithm is developed for on-line time differentiation of sampled analog voltage signals. The derivative is obtained by employing a least mean squares technique. The recursive algorithm results in a considerable reduction in computer time compared to a complete new solution of the normal equations each time a new data point is accepted. Implementations of the algorithm on a dig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Function Approximation by Walsh Series

    Publication Year: 1975, Page(s):590 - 598
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3976 KB)

    Function approximation by a finite Walsh series is considered. There are two methods for selecting the terms of a series. The process of threshold sampling gives a least-square error approximation, but no error analysis technique is available. However, error analysis is possible if terms are selected according to degrees and subdegrees. It is shown that truncation is equivalent to dropping all ter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Dyadic Models of Time-Invariant Systems

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

    The ease of simulating a dyadic model on digital computers suggests approximating linear time-invariant (LTI) systems by dyadic models. Methods for calculating the best such approximations are provided. It is shown that the matrices characterizing the LTI system and its optimal dyadic approximant have identical diagonal elements in the Walsh domain. This fact is used to derive a direct transformat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theoretical and Experimental Behavior of Synchronizers Operating in the Metastable Region

    Publication Year: 1975, Page(s):604 - 616
    Cited by:  Papers (38)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3288 KB)

    The interaction problem between asynchronous logic elements is formulated with emphasis on the synchronizer. A detailed analytic treatment of the binary flip-flop action in the metastable region is presented. The principle result is to predict, in a probabilistic manner, the time necessary to move from the metastable point to one of the stable boundaries. The effects of circuit time constant and c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Quantitative Evaluation of Edge Detection Schemes and their Comparison with Human Performance

    Publication Year: 1975, Page(s):616 - 628
    Cited by:  Papers (88)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (9424 KB)

    A technique for the quantitative evaluation of edge detection schemes is presented. It is used to assess the performance of three such schemes using a specially-generated set of images containing noise. The ability of human subjects to distinguish the edges in the presence of noise is also measured and compared with that of the edge detection schemes. The edge detection schemes are used on a high-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reed–Muller Canonical Forms in Multivalued Logic

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

    Canonical forms for m-valued functions referred to as m-Reed–Muller canonical (m-RMC) forms that are a generalization of RMC forms of two-valued functions are proposed. m-RMC forms are based on the operations ⊕m (addition mod m) and .m (multiplication mod m) and do not, as in the cases of the generalizations proposed in the literature, require an m-valued function for m not a power of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition

    Publication Year: 1975, Page(s):636 - 650
    Cited by:  Papers (27)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4312 KB)

    A technique for decomposition of polygons into simpler components is described and illustrated with applications in the analysis of handwritten Chinese characters and chromosomes. Polygonal approximations of such objects are obtained by methods described in the literature and then parts of their concave angles are examined recursively for separating convex or other simple shape components. Further... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual Learning from Multiple Views

    Publication Year: 1975, Page(s):651 - 661
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3920 KB)

    An algorithm is presented in which a computer is visually shown a sequence of views of a solid planar object as the object is rotated in space. The computer automatically forms a three-dimensional description of the object. The description consists of a deterministic description of the object's surfaces and how they are interconnected to form the object, along with a measure of each surface's shap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic Syntactic Decoding for Pattern Classification

    Publication Year: 1975, Page(s):662 - 667
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2360 KB)

    A model of noise deformation of the substitution type is adopted for linguistic patterns generated by formal grammars. The maximum-likelihood criterion and the minimum-distance criterion are proposed for the classification of noisy strings described by context-free grammars. Classification algorithms based on a modified Cocke-Younger-Kasami parsing scheme are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic Treatment of General Combinational Networks

    Publication Year: 1975, Page(s):668 - 670
    Cited by:  Papers (237)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    In this correspondence two methods are given for calculating the probability that the output of a general combinational network is 1 given the probabilities for each input being 1. We define the notions of the probability of a signal and signal independence. Then several proofs are given to show the relationship between Boolean operations and algebraic operations upon probabilities. As a result of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Bound for Checking Experiments that Use Simple Input-Output and Characterizing Sequences

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

    The least upper bound of n(n−1)/2 input symbols is derived for the total length of characterizing sequences for a reduced n-state machine. When a machine can be characterized by a set of r characterizing sequences, a reduced upper bound on their total length will be r(2n−r−1)/2 input symbols. To shorten transfer sequences, better use is made of the strong-connectedness assumption... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Modified Fixed-Increment Training Algorithm

    Publication Year: 1975, Page(s):673 - 675
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    There are several available algorithms suitable for training a linear pattern classifier. Fixed-increment algorithms are commonly used because they are easily coded for computer applications. This correspondence presents a modified fixed-increment algorithm that expedites classifier training and yet mantains the basic structure of the traditional fixed-increment algorithm. In applications with med... View full abstract»

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

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

    Fail-safe circuits are designed to assume a 1 (1-fail-safe) or a 0 (0-fail-safe) output state upon failure. This correspondence extends fault detection techniques previously presented [1] to include the design of fail-safe asynchronous sequential circuits. Faults causing failures in the internal state logic and the output state logic circuitry are treated. These failures are assumed to be symmetri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Method for Initial Estimates in the Numerical Solution of Laplace's Equation

    Publication Year: 1975, Page(s):678 - 680
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    In the solution of the Laplace equation using finite difference methods, the iteration is often started with all interior points set equal to zero. It has been found that providing initial estimates for the potentials at these interior points can reduce the number of iterations required to reach convergence. This paper presents a technique which is easy to program and may reduce the total computat... 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): 680-a
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • Does Easier Mean Better?

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