Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Computers, IEEE Transactions on

Issue 9 • Date Sept. 1975

Filter Results

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

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

    Publication Year: 1975 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (222 KB)  
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1975 , Page(s): 857
    Save to Project icon | Request Permissions | PDF file iconPDF (1392 KB)  
    Freely Available from IEEE
  • A Piecewise Linear Approximation of Log2x with Equal Maximum Errors in All Intervals

    Publication Year: 1975 , Page(s): 858 - 861
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1632 KB)  

    In this paper it is shown how to divide the interval [1,2] into n parts so that the uniform linear approximation of log2x in each subinterval has the same maximum error. This error is, in the case n = 4, smaller by a factor of 2.3 than the error of the linear mean-square approximation given by Hall et al. [1]. The final products of the mathematical analysis are explicit formulas which allow the direct determination of all parameters and the maximum error for any desired number n of subdivisions of [1,2]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design Verification at the Register Transfer Language Level

    Publication Year: 1975 , Page(s): 861 - 867
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3328 KB)  

    Computer description languages can be used as input to software tools which aid in the design of digital hardware structures. One of the important phases in the design process is verification. A software system is described which aids the verification process of a computer description at the register transfer language (RTL) leveL. It is based on the concept of concurrent simulation and comparison of the functional and the structural description of a computer. Error types, in particular consistency and semantic errors, and algorithms for their detection are discussed. The tools necessary to implement these detection procedures are outlined. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability Analysis of Systems with Concurrent Error Detection

    Publication Year: 1975 , Page(s): 868 - 878
    Cited by:  Papers (12)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2776 KB)  

    There is an increasing use of error detectors and correctors in computer subsystems, such as parity detectors in memory modules and residue checkers in arithmetic units. Their fault tolerant characteristics are studied through the model of detector redundant systems. Their reliabilities and availabilities are analyzed and compared with those which do not have any such error detectors. The design of fault isolating and reconfiguring networks used in the implementation of such systems are developed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Experimental System for Computer Controlled Mechanical Assembly

    Publication Year: 1975 , Page(s): 879 - 888
    Cited by:  Papers (29)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4272 KB)  

    This paper describes the software and hardware architecture of a system designed as a research tool for experiments on programming the computer controlled assembly of mechanical objects. The software consists of a real-time control level and a background level in which an on-line interpreter permits interactive programming. The hardware consists of a manipulator with sensory feedback coupled to an IBM System/7. Additional facilities are available through a link to an IBM System/370 Model 145. The application of the system to sample assemblies is also discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Data Processing by Hadamard-Haar Transform

    Publication Year: 1975 , Page(s): 888 - 896
    Cited by:  Papers (14)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (8120 KB)  

    A hybrid version of the Haar and Walsh-Hadamard transforms (HT and WHT) called Hadamard-Haar transform (HHT),is defined and developed. Efficient algorithms for fast computation of the (HHT), and its inverse are developed. (HHT)r is applied to digital signal and image processing and its utility and effectiveness are compared with other discrete transforms on the basis of some standard performance criteria. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Memory Interference in Multiprocessors

    Publication Year: 1975 , Page(s): 897 - 908
    Cited by:  Papers (99)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3144 KB)  

    This paper presents Markov chain models for analyzing the extent of memory interference in multiprocessor systems with a crosspoint switch for processor-memory communication. Processor behavior is simplified to an ordered sequence of a memory request followed by a certain amount of processing time. The results predicted by the model are compared with some simulation results and some actual measurements on C.mmp, a multiprocessor system being built at Carnegie-Mellon University. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Branch and Bound Clustering Algorithm

    Publication Year: 1975 , Page(s): 908 - 915
    Cited by:  Papers (27)  |  Patents (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4712 KB)  

    The problem of clustering N objects into M classes may be viewed as a combinatorial optimization algorithm. In the literature on clustering, iterative hill-climbing techniques are used to find a locally optimum classification. In this paper, we develop a clustering algorithm based on the branch and bound method of combinatorial optimization. This algorithm determines the globally optimum classification and is computationally efficient View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Picture Reconstruction from Projections

    Publication Year: 1975 , Page(s): 915 - 923
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4744 KB)  

    In this paper we will present two methods for the reronstruction of a two-dimensional picture from its one-dimensional projections at various angles. The first method is recursive, and the second is nonrecursive. Both of these methods have potential applications in picture transmission, and offer valuable insight into the more general problem of reconstruction of three-dimensional objects from their two-dimensional projections. We will illustrate the numerical details of each method by considering the reconstruction of a picture discretized on a 32 X 32 grid, and compare their relative merits. These two methods will also be compared with other methods suggested in the literature. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem

    Publication Year: 1975 , Page(s): 924 - 930
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2088 KB)  

    A new method for computing the prime implicants of a Boolean function from an arbitrary sum-of-products form is given. It depends on the observation that the prime implicants of a Boolean function can be obtained from the prime implicants of its subfunctions with respect to a fixed but arbitrary variable. The problem of obtaining all irredundant sums from the list of all prime implicants and an arbitrary list of implicants representing the function is solved. The irredundant sums are in one-to-one relation to the prime implicants of a positive Boolean function associated with these lists. The known formulas of Petrick, Ghazala, Tison, Mott, and Chang are obtained as special cases and incompletely specified functions can also be handled. We give a complete and simple method for finding the positive Boolean function mentioned above. The paper is self-contained and examples are included. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous Arbiter Module

    Publication Year: 1975 , Page(s): 931 - 932
    Cited by:  Papers (19)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (416 KB)  

    The design and operation of a simple two-input arbiter module suitable for implementing n-input arbiter trees are given in this correspondence. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cellular Logic Array for High-Speed Signed Binary Number Multiplication

    Publication Year: 1975 , Page(s): 932 - 935
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (688 KB)  

    A new high-speed cellular logic array for multiplication of signed binary numbers is described. It uses a four-bit arithmetic logic unit MC10181 to achieve high speed and to reduce the number of interconnections. A multiplication algorithm which implements simultaneous multiplication by two digits of the multiplier results in a cellular logic array achieving high speed and involving less equipment. ment. A high-speed 4 X 2 multiplier chip is proposed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital Image Registration Method Using Boundary Maps

    Publication Year: 1975 , Page(s): 935 - 940
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1112 KB)  

    A new method of automatic image registration (matching) is presented. It requires that the original single or multichannel images first be converted to binary boundary maps having elements equal to zero or unity. The method corrects for both translational and rotational errors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Method of Angle Detection on Digital Curves

    Publication Year: 1975 , Page(s): 940 - 941
    Cited by:  Papers (55)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (376 KB)  

    This correspondence describes an improved method of detecting "angles"—i.e., maxima of the difference between successive nonoverlapping average slopes—on a digital curve. The method is similar to, but gives better results than, a method described in an earlier paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization of Fuzzy Forms

    Publication Year: 1975 , Page(s): 941 - 943
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (544 KB)  

    Fuzzy systems are multivalued logic with a continuum of truth values in [ 0,1]. If the truth values inthe interval [ 0,11 are quantized, the operations max (+) and min (*) can be physically realized. Precisely, if [ 0,1] is quantized into 2m equal intervals then the operation max (+) with n arguments can be realized by n rows of one-dimensional unilateral array, each having ( m + 1) cells. The cells in the array are combinational. The min (*) operation is realized by changing the boundary conditions to the array. Fuzzy forms are expressions of fuzzy variables using max (+) and min (*). These fuzzy forms are realized using the max (+) and min (*) gates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Activity in an Interleaved Memory

    Publication Year: 1975 , Page(s): 943 - 944
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (408 KB)  

    A complicated expression for the average number of active modules, in a published model for interleaved memory, is shown to be a function well studied in other contexts. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eigenvalue Properties of Projection Operators and Their Application to the Subspace Method of Feature Extraction

    Publication Year: 1975 , Page(s): 944 - 948
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (888 KB)  

    The subspace method proposed by Watanabe et al. is an important method of feature extraction in pattern recognition. Some new results described here provide a formulation of the subspace method that is particularly easy to implement and overcomes the various numerical difficulties that were inherent in earlier implementations of the method. The present formulation is also important in that it provides the key to the relation of this method to other methods of feature extraction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Unified Approach to Feature Selection and Learning in Unsupervised Environments

    Publication Year: 1975 , Page(s): 948 - 952
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (736 KB)  

    Here the twin problems of feature selection and learning are tackled simultaneously to obtain a unified approach to the problem of pattern recognition in an unsupervised environment. This is achieved by combining a feature selection scheme based on the stochastic learning automata model with an unsupervised learning scheme such as learning with a probabilistic teacher. Test implementation of this scheme using the remotely sensed agricultural data of the Purdue laboratory for agricultural remote sensing (LARS) in a simulated unsupervised mode, has brought out the efficacy of this integrated system of feature selection and learning. 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): 952-a
    Save to Project icon | Request Permissions | PDF file iconPDF (152 KB)  
    Freely Available from IEEE
  • Does Easier Mean Better?

    Publication Year: 1975 , Page(s): 952-b
    Save to Project icon | Request Permissions | PDF file iconPDF (1048 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