Showing papers in "Computers & Electrical Engineering in 1984"

TL;DR: This paper discusses reliability modeling techniques based on a behavioral decomposition that provides tractability by separating the reliability model along temporal lines into nearly disjoint fault-occurrence and fault-handling submodels and implemented in the HARP program.

TL;DR: In this article, a methodology for incorporating all relevant data (including, perhaps, data obtained from other related systems or subsystems) into a system or operational-mode reliability analysis for the constant-hazard-rate, series system case is developed.

TL;DR: A fuzzy-set-based measure of the correctness possibility of control programs is developed, which incorporates the development history of the program and estimates the computational and control flow correctness of each equivalence class.

TL;DR: A concise review and classification of literature related to computing systems reliability and failure analysis is put forward.

TL;DR: In this article, the authors proposed a technique of augmenting the network with some additional observation points which take care of otherwise undetectable bridging faults in AND-EXOR arrays, which are different from the arrays based on the Reed-Muller canonic (RMC) expansion of functions.

TL;DR: The general taxonomic scheme proposed by Geoffrion is exploited to provide a systematic framework for viewing computational algorithms for solving large-scale, optimal control problems and to demonstrate the utility of the viewpoint, a new algorithm is presented.

TL;DR: The general schemes for implementing the basic modular operations of addition, subtraction and multiplication in the Residue Number System are described and semiconductor logic gates are used in the proposed implementations.

TL;DR: A brief review of the status of software reliability research is presented, and new research directions that may benefit the software development process in a more positive and direct way are pointed out.

TL;DR: A new methodology to verify a given program flowchart containing single loop or multiple nested loops by using the technique of mathematical induction is described, where the cut-points are created to cut loops in the given program Flowchart.

TL;DR: The matrix representation proposed for a “Staran” interconnecting network is extended for 3-stage network and subsequently an algorithm has been presented for higher order networks.

TL;DR: An algorithm for computing the stratified structure of a Boolean function has been presented, which finds use in the optimum synthesis of MOS network.

TL;DR: An efficient FORTRAN program for solution of such equation megasystems, developed for Control Data computers, Cyber 70 and Cyber 170 series, utilizes two-level indexing of disc files.

TL;DR: The O1-class as discussed by the authors is a class of computer programs where the correctness of any program relative to any other program in the class, over the countable infinity of all inputs, can be established by testing.

TL;DR: Two efficient alternatives to the well-known curve-fitting techniques, namely, the quadratic fitting method and the cubic interpolation method, which are the most popular unidimensional search schemes in nonlinear optimization algorithms are described.