By Topic

Computers, IEEE Transactions on

Issue 10 • Date Oct. 1977

Filter Results

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

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

    Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (223 KB)  
    Freely Available from IEEE
  • A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors

    Page(s): 933 - 937
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1718 KB)  

    In this paper we construct algorithms and investigate the time required for the parallel evaluation of rational expressions using small numbers of processors. We define algorithms which compute a polynomial with n operations in 3n/(2p + 1) + Q(p2) time units with p processors and a general rational expression with n operations in 5n/(2p + 3) + 0(p2) time units. These algorithms are suitable for implementation on computers with restricted data access. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Paging Performance of Array Algorithms

    Page(s): 938 - 947
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2896 KB)  

    Data paging is of primary concern for problems with large data bases and for many types of array problems. We show that prepaging reduces the paging problems of array algorithms operating on large arrays. We also show that the use of a submatrix algorithm considerably improves the locality. Finally, we consider methods of automating these performance-improvement techniques by means of a compiler in the context of a structured array language. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Compact High-Speed Parallel Multiplication Scheme

    Page(s): 948 - 957
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3652 KB)  

    This paper discusses a compact, fast, parallel multiplication scheme of the generation-reduction type using generalized Dadda-type pseudoadders for reduction and m X m multipliers for generation. The implications of present and future LSI are considered, a partitioning algorithm is presented, and the results obtained for a 24 X 24-bit implementation are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Properties of Image-Processing Operations on Projection Sets Obtained from Digital Pictures

    Page(s): 958 - 970
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3062 KB)  

    A projection of a digital picture (image) may be defined as an ordered set of values, each of which is the sum of the gray levels along a given path drawn through the picture. A projection set is at ordered set of projections of the picture. Given a projection set, reconstruction is achieved by operating on the projection set to produce either the original picture or an approximation to it. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential Estimation Technique for Enhancement of Noisy Images

    Page(s): 971 - 987
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (6994 KB)  

    A sequential estimation algorithm for the enhancement of noisy images is presented. A set of parameters obtained by a transformation of an autoregressive (AR) model representing the image process, is used for computational advantages. The method presented has an added advantage that it requires no a priori knowledge of the statistics of the noise-free data. Several examples are presented to illustrate the utility of the algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Boundary Detection: A Generalization and a New Algorithm

    Page(s): 988 - 998
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (8208 KB)  

    We study class of fast algorithms that extract object boundaries from digitized images. A set of orthogonal functions related to distinctive image features is presented, which allows efficient extraction of such boundary elements. The properties of these functions are. used to define new criteria for edge detection and a sequential algorithm is presented. Results indicate considerable improvements over, existing techniques, with a very moderate increase of computational cost. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A General Model for Memory Interference in Multiprocessors

    Page(s): 998 - 1005
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3448 KB)  

    This paper presents a mathematical model for determining the extent of memory interference in multiprocessor systems. The model takes into account the numbers of processors and memory modules in the system and their relative service times, as well as the patterns of memory accesses made by the processors. The results predicted by the model are compared with simulation results and with results from other exact or approximate models, where these exist. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Table-Lookup Methods for Generating Arbitrary Random Numbers

    Page(s): 1006 - 1008
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1738 KB)  

    Extremely fast table-lookup procedures are described for generating random numbers from an arbitrary distribution on a digital computer. The procedures sacrifice some accuracy in order to achieve this speed, but the accuracy is sufficient for most types of Monte-Carlo simulations. A method is given to eliminate the error associated with truncation for distribution functions with an infinite domain. The performance of the table-lookup methods is examined for a few common distribution functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Weighted Generalized Inverse Algorithm for Pattern Recognition

    Page(s): 1009 - 1017
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2467 KB)  

    A new weighted mean-square-error (MSE) procedure for pattern classification is introduced. The method iteratively repeats the misclassified samples. Three theorems on redundancy and the least square generalized inverse solution for an inconsistent set of equations are presented and proved. The resulting algorithm is presented together with a convergence proof for the linearly separable case. Several examples are included that demonstrate the advantage of the method over the MSE solution for both the separable and nonseparable cases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Physical Uncertainty and Information

    Page(s): 1017 - 1025
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4141 KB)  

    Uncertainties inherent in physical phenomena and structures obscure the physical representation of information. Time-dependent uncertainties in physical parameters are conventionally regarded as noise. Time-independent uncertainties, fixed in the physical structure of the devices used to represent information, although determinable in principle, are in fact unknown to the system designer and play a role in information theory similar to that of conventional noise. Several examples of the way in which power is used in logic and memory devices to overcome the effects of physical uncertainty are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer Simulation of Space-Filling Molecular Models

    Page(s): 1026 - 1028
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (664 KB)  

    Three commonly used types of three-dimensional molecular models are reviewed together with their suitability for two-dimensional computer representation. A new algorithm is described which allows perspective, hidden-line drawings to be made of space-filling models, and which takes advantage of the spherical symmetries of these models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Fourier Transforms on Finite Non-Abelian Groups

    Page(s): 1028 - 1030
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (619 KB)  

    Recent works [1]-[9] were devoted to the properties and application of Fourier transforms over finite Abelian groups and fast Fourier transforms for calculation of the corresponding spectra. In this correspondence we describe Fourier transforms on finite non-Abelian groups and appropriate algorithms of fast Fourier transforms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Skip-and-Set Fast-Division Algorithm

    Page(s): 1030 - 1032
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (441 KB)  

    A fast-division algorithm, effectively implementable with available IC technology, has been developed and implemented. Especially suited for asynchronous division units, the skip-and-set algorithm provides simple control provisions for the division of numbers in any format and to any fractional precision. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum Universal Logic Module Sequential Circuits with Decoders

    Page(s): 1032 - 1035
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (598 KB)  

    Universal logic modules of n variables (ULM-n) can be used to synthesize sequential machines. It has been shown that any machine can be realized using delayed ULM's and OR gates. Addition of an n -to-2n decoder allows minimization of the number of ULM's necessary. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cyclic-Order Property of Bodies with Three-Face Vertices

    Page(s): 1035 - 1039
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (677 KB)  

    A cyclic-order property is defined for three-dimensional bodies with vertices formed by three faces. The property is useful in resolving ambiguities caused by the extraction of imperfect line data from photographs of such bodies. The property augments the grammatical rules-that govern the possibility or impossibility of the existence of three-dimensional bodies corresponding to particular two-dimensional line-structure projections. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Syntactic Description and Recognition of Rotary Machine Elements

    Page(s): 1039 - 1043
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (854 KB)  

    A formal description of rotary machine elements defined by contours has been established. The contours are formed through an axis-cross section of elements. The segments are defined as intervals of straight lines or curves. A broken line constructed of segments is a contour. A characterological description of a contour as a word in a given alphabet has been established. A class of contours possessing similar configurations of segments is introduced. This class is identified with regular event. These classes are subsets of a language generated by the local adjunct grammar. The regular expression having a very convenient form for denoting the class of contours has been defined. Finally, an algorithm deciding if any contour belongs to a class has been given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Concepts for Three-Dimensional Shape Analysis

    Page(s): 1043 - 1049
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1079 KB)  

    A new approach to machine representation and analysis of three-dimensional objects is presented. The representation, based on the notion of "skeleton" of an object leads to a scheme for comparing two given object views for shape relations. The objects are composed of long, thin, rectangular prisms joined at their ends. The input picture to the program is the digitized line drawing portraying the three-dimensional object. To compare two object views, two characteristic vertices called "cardinal point" and "end-cardinal point," occurring consistently at the bends and open ends of the object are detected. The skeletons are then obtained as a connected path passing through these points. The shape relationships between the objects are then obtained from the matching characteristics of their skeletons. The method explores the possibility of a more detailed and finer analysis leading to detection of features like symmetry, asymmetry and other shape properties of an object. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Testing 2-Asummability of Boolean Functions

    Page(s): 1049 - 1053
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1058 KB)  

    Simple algorithms have been developed to generate pairs of minterms forming a given 2-sum and thereby to test 2-asummability of switching functions. The 2-asummability testing procedure can be easily implemented on the computer. Since 2-asummability is a necessary and sufficient condition for a switching function of upto eight variables to be linearly separable (LS), it can be used for testing LS switching functions of upto eight variables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Curve Segmentation by Relaxation Labeling

    Page(s): 1053 - 1057
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2041 KB)  

    This correspondence discusses parallel iterative methods of segmenting the border of a shape into "angles" and "sides." Initially, smoothed "slope" and "curvature" values of the border are measured at every point, and the curvature value determines the point's initial probabilities of being an angle or a side. The values are then iteratively adjusted, and the probabilities are reinforced or weakened, in a manner dependent on the values and probabilities at neighboring points. For example, a point p's probability of being on a side is reinforced if p and its neighbors have similar slopes, and our estimate of p's slope can be improved by (say) averaging with these slopes. Similarly, p's probability of being an angle is reinforced if appropriate slope or curvature differences exist between p and its neighbors, and our estimate of p's curvature can be improved by taking the neighbors' slopes into account. A set of such reinforcement and adjustment rules is formulated, and examples are given of their effects on various types of shapes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal Fault Tests for Redundant Combinational Networks

    Page(s): 1057 - 1060
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (825 KB)  

    This correspondence is concerned with the detection of permanent faults in redundant combinational networks. Fault masking in such networks is examined. A method for determining an optimal test set that will detect all detectable faults is given. 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): 1060
    Save to Project icon | Request Permissions | PDF file iconPDF (131 KB)  
    Freely Available from IEEE
  • Papers to be Published in the Next Issue November 1977

    Page(s): 1060
    Save to Project icon | Request Permissions | PDF file iconPDF (406 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