ppxscal/embedding_network huggingface dataset:
Test generation for MOS circuits using D-algorithm
Authors: Sunil K. Jain, Vishwani D. Agrawal
Venue: Proceedings of the 20th Design Automation Conference (1983)

An application of the D-algorithm in generating tests for MOS circuit faults is described. The MOS circuits considered are combinational and acyclic but may contain transmission gates and buses. Tests are generated for both, the stuck type faults and the transistor faults (open and short). A logic model is derived for the MOS circuits. In addition to the conventional logic gates, a new type of modeling block is used to represent the &ldquo;memory&rdquo; state caused by the &ldquo;open&rdquo; transistors. Every fault, whether a stuck type fault or a transistor fault, is represented in the model as a stuck fault at a certain gate input. For generating tests, however, the D-algorithm needs modification. The singular cover and the D-cubes for the new gate include some memory states. To handle the memory state, an initialization procedure has been added to the consistency part of the D-algorithm. The procedure of modeling and test generation is finally extended to transmission gates and buses.
A user interface for online assistance
Authors: Nathan Relles, Lynne A. Price
Venue: Proceedings of the 5th international conference on Software engineering (1981)

This paper describes a software user interface that enables programmers to provide and maintain online aids in an interactive system. Through the interface, users are given a set of consistent and unobtrusive aids that display summary information, command descriptions, explanations of error messages, and other online documentation. The interface is presented here from the views of both the end-user and the programmer.
&ldquo;Recommended mathematical topics for computer science majors&rdquo;
Authors: Ronald L. Davis
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

Although there is not universal agreement on a definition of computer science, I believe that it is the inclusion of a quantitative (mathematical) approach to our discipline that distinguishes &ldquo;computer science&rdquo; from &ldquo;computer programming&rdquo;. Mathematics provides both an established language with which to precisely define terms and established methods for problem solving. For example, the rather vague statement that &ldquo;algorithm A is better than algorithm B&rdquo; may be formulated unambiguously and verified or refuted with respect to certain performance measurements using the formalism of algorithm analysis (l). Mathematical methods also point toward the possibility of proving that an algorithm provides acceptable performance for large classes of inputs, a conclusion which often cannot be supported on the basis of case-by-case testing (5). I will now discuss certain mathematical ideas which naturally arise in computer science courses and cite relevant examples which will hopefully convince the reader that these ideas are worthy of formal study. Suggestions are then offered regarding the inclusion of these studies in the four-year computer science curriculum.
HLL architectures: Pitfalls and predilections
Authors: Krishna Kavi, Boumediene Belkhouche, Evelyn Bullard, Lois Delcambre, Stephen Nemecek
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

An examination of high-level language architectures reveals that some design considerations are based on inaccurate premises. This paper discusses some HLL architecture design misconceptions. Some features that should be considered in the design of HLL architectures are presented. Based on the HLL architecture design considerations, a methodology for quantifying architecture is proposed.
Who is carrying the monkey? the service manager concept
Authors: A. Sheth, S. S. Swaminathan
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

With the revolutionary changes in hardware and user expectations, the User Services of the 1980's will have to adapt to change if they wish to continue providing high quality service to their clients. The Service Manager concept is but one of the many organizational changes that we are planning to alter our direction.
A semi-automatic data base translation system for achieving data sharing in a network environment
Authors: Stanley Y.W. Su, Herman Lam
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

This paper deals with the problems of data base translation for achieving data sharing through a computer network. A semiautomatic data base translation procedure and its prototype implementation are described. The procedure takes advantage of data conversion capabilities already existing in programming languages and I/O control systems and of man-machine interaction to achieve data base translation tasks. The user of one system is allowed to browse, retrieve, edit, format and restructure the data acquired on-line from another system to produce a new data base suitable for his own application programs. The procedure attempts to bypass the complex task of formally describing and translating several levels of data representation commonly undertaken in the existing data base translation systems.
Off-Line Character Recognition Using HMM by Multiple Directional Feature Extraction and Voting with Bagging Algorithm
Authors: Hiromitsu Nishimura, Makoto Kobayashi, Minoru Maruyama, Yasuaki Nakano
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

The purpose of our research is to improve the recognition rate of off-line character recognition systems using the HMM (Hidden Markov Model) without increasing a number of HMM parameters too much. Some 2-dimensional HMM character recognition systems have been proposed to increase representational power. However, since 2-D HMM has much more complex structure and thus requires much more parameters than 1-dimensional HMM, it becomes very hard to gather sufficient samples in order to guarantee the successful generalization. To overcome the problem, we propose a method for character recognition using 1-D HMMs in multiple directions with 2-dimensional feature extraction. To further improve the performance, bagging algorithm is also exploited. The voting by the bagging algorithm, which is reported effective in some neural-network and decision tree classifier systems, has never been used in HMM character recognition systems yet. In our experiment, the recognition rate is increased by about 1% with the multiple directional HMM character recognition system compared to the 1-D HMM character recognition system. The recognition rate is further increased by about 1% with the HMM character recognition system using bagging algorithm.
A modified Chief Programmer Team approach to an operating systems class project
Authors: James T. Perry, Terry E. Weymouth
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

This paper describes the use of the Chief Programmer Team method in an operating systems class to implement a subset of a multiprogramming operating system. The operating system consisted of elements of Job Management, Task Management, and Data Management functions. The students were divided into four groups. One of these, called the Steering Committee, was responsible for assigning coding and design duties to each of the three coding groups. When each major part of the operating system was completed, the Steering Committee would examine the code and approve it, or return it to the coding group for revision. Thus, the Steering Committee acted as Chief Programmer to the other three groups. When all parts of the system were completed, they were linked together and tested. A comprehensive survey containing questions regarding the effectiveness of the Chief Programmer approach was given to all students. The results of this survey indicated that the group programming effort was superior to the conventional method of assigning the project, in its entirety, to each student. Key Words: Chief Programmer Team, Monitor, Operating Systems, Systems Programming.
A virtual memory system for the Hewlett-Packard 2100A
Authors: W. Gary Sitton, Larry L. Wear
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

This paper reports on the development of a virtual memory system for the HP 2100. The major portion of the development is the group of microprograms that were written to alter the instruction and operand fetch programs. No hardware modifications to the 2100 are required to affect the conversion. Although execution speed is not a primary concern in system operation, techniques were used to keep operation as efficient as possible. Timing estimations for instruction execution are given and areas for future research are discussed.
Depth-first digraph algorithms without recursion
Venue: ACM SIGCSE Bulletin (1977)

After having taught the design of algorithms for more than ten years I still find that recursive algorithms are much too difficult for most computer science students. There seem to be two problems: the students are unable to grasp the essence of an algorithm in a recursive setting, and they rarely have any knowledge of the mechanisms underlying recursive calls. In view of the above it was thought useful to translate a number of recursive algorithms into nonrecursive form for classroom use. Tarjan's depth-first search algorithms for digraphs (4,5) were selected because they are sufficiently important to require their study in some computer science course or other. The translation consists of making the depth-first search tree of the digraph explicit, and letting tree traversals take over the role of recursion. The nonrecursive algorithm for topological ordering of an acyclic digraph will be our example here. This algorithm is used to preprocess a scheduling network before it is subjected to critical path analysis.
A taxonomy and analysis of event set management algorithms for discrete event simulation
Authors: John Craig Comfort
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

Seven event set management algorithms and their associated data structure are presented informally and formally, their performances (time per &ldquo;hold&rdquo; operation, search length) are analyzed empirically, using appropriate statistical tests, and the relations between these algorithms are discussed. Each algorithm is tested for several different inter-arrival distributions and event set sizes. Five of these algorithms use data structures which apply successively more sophisticated indexing to a basic linked list, resulting in two algorithms with nearly constant assymptotic behavior. The other two, based on the &ldquo;heap&rdquo; data structure, has logarithmic behavior.
Software engineering...an economic perspective
Authors: J. H. Morrissey, L. S.-Y. Wu
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The production of software can be viewed as an economic, as well as an engineering, process. Since the prime factor of production is the labor inputs of programmers and systems analysts, the personnel characteristics and employment trends of these occupations in the United States are reviewed. These labor factors are then related to prior and expected trends in the installation and utilization of computer equipment. A discussion of programming labor productivity is followed by a digression on the diffusion rates of technology. A brief outlook of plausible software developments suggests two areas perhaps deserving more software engineering research and development attention.
The computer assisted software engineering (CASE) system
Authors: William Scott Amey
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The CASE system provides a comprehensive software development tool that aids engineers, designers, programmers, and managers. The CASE system guides its users through the tasks of documentation, design, coding, testing, configuration control, and status analysis.
Managing and evaluating students in a directed project course
Authors: Dean Sanders
Venue: Proceedings of the fifteenth SIGCSE technical symposium on Computer science education (1984)

Evaluating individual students is especially difficult in a Directed Project course because the content is dictated by the projects rather than by a fixed syllabus. By merging the evaluation process with the project management tasks, and by using prepared checklists for peer, task, and meeting evaluations, students working in a group may be evaluated as individuals and the same grading criteria may be applied to all students even though they are working on different projects.
Aw expanded logic equation list for checkout
Authors: R. P. Larsen, J. A. Luisi, A. K. Singh
Venue: Proceedings of the 19th Design Automation Conference (1982)

In the computer-aided design of digital equipment, by the time a wire unit is in the check-out lab, a large amount of information concerning this unit exists in the form of tape files. Since our D.A. System is entered via logic equations, we have a file containing this information, plus files indicating the partitioning of the equations, the placement of smaller building blocks within larger building blocks, and the assignment of signals to pins for routing or wiring. Also, there will be a wire list file (or a router output file) plus a punch card deck when a wiring machine is to be used. In addition a large pile of computer output reports will exist communicating this information to the literate world. About two years ago we learned that in some of the checkout labs engineers were devoting large amounts of time pouring through the reports we generate in order to correlate signals appearing in logic equations with connector pins. In order to remove this burden from these engineers, a program known as the Equation Connector Program (EQNCON) was written. This program exhibits the correlation of logic signals and connector pins in a printed report which is then heavily used during checkout.
Making nested rotations convenient for the user
Authors: Edward G. Britton, James S. Lipscomb, Michael E. Pique
Venue: ACM SIGGRAPH Computer Graphics (1978)

Subimage motion in a three-dimensional computer graphic system is much easier for the user to control if the subimage moves the same direction as his hand while he manipulates the control device. The implementation of such coordinated motion of hand and subimage implies modification of the normal procedure for calculating transformations. The convenience of such manipulation also depends on appropriate selection or design of the input device. This paper reviews the relevant attributes of locator devices and presents an approach to selection. It presents the mathematics of transformation nesting and &ldquo;compensation&rdquo; to preserve motionsynchrony. Finally, it offers a case history of an interactive graphic system whose human factors were improved by these techniques.
Performance of an I/O channel with multiple paging drums
Authors: Samuel H. Fuller
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

For rotating storage units, a paging drum organization is known to offer substantially better response time to I/O requests than is a more conventional (file) organization [Abate and Dubner, 1969; Fuller and Baskett, 1972 ]. When several, asynchronous paging drums are attached to a single I/O channel, however, much of the gain in response time due to the paging organization is lost; this article investigates the reasons for this loss in performance. A model of an I/O channel with multiple paging drums is presented and we embed into the model a Markov chain that closely approximates the behavior of the I/O channel. The analysis then leads to the moment generating function of sector queue size and the Laplace-Stieltjes transform of the waiting time. A significant observation is that the expected waiting time for an I/O request to a drum can be divided into two terms: one independent of the load of I/O requests to the drum and another that monotonically increases with increasing load. Moreover, the load varying term of the waiting time is nearly proportional to (2 &minus; 1/k) where k is the number of drums connected to the I/O channel. The validity of the Markov chain approximation is examined in several cases by a comparison of the analytic results to the actual performance of an I/O channel with several paging drums.
A study of the comparative effects of various means of motion cueing during a simulated compensatory tracking task
Authors: Burnell T. McKissick, Billy R. Ashworth, Russell V. Parrish, Dennis J. Martin,  Jr.
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

NASA's Langley Research Center conducted a simulation experiment to ascertain the comparative effects of motion cues (combinations of platform motion and g-seat normal acceleration cues) on compensatory tracking performance. In the experiment, a full six-degree-of-freedom YF-16 model was used as the simulated pursuit aircraft. The Langley Visual Motion Simulator (with in-house developed wash-out), and a Langley developed g-seat were principal components of the simulation. The results of the experiment were examined utilizing univariate and multivariate techniques. The statistical analyses demonstrate that the platform motion and g-seat cues provide additional information to the pilot that allows substantial reduction of lateral tracking error. Also, the analyses show that the g-seat cue helps reduce vertical error. The differences in pilot control behavior make it impossible to statistically determine if the motion platform and g-seat cues have an additive effect, or whether the motion or g-seat cues can be interchanged. However, it is anticipated that additional data will overcome this problem.
Enhancement of system design and simulation via general system theories
Authors: J. Talavage
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

My research into system design and simulation indicates at least two areas where General System Theories (GST) can provide insights and support for more detailed efforts. These areas are (I) system design as approached in a hierarchical fashion, and (II) system simulation by relatively naive users for systems that contain complex control or decision structures. As an example of a problem in area I, some designers of large software system have advocated a hierarchical structure to represent the interaction of the components of the software system. Structured Analysis (Ross 1977) is an example of such a methodology. An implicit assumption of such methods is that of closure of certain system properties under interconnection. That is, given functional or realizable components, the series, parallel, or feedback interconnection of such components is assumed to be again a functional or realizable component. An application of GST to this problem area has shown that, for both static (i.e., no concern for time-behavior) and dynamic perspectives, the assumed closure is certainly satisfied in the &ldquo;bottom up&rdquo; direction (i.e., connecting components together). However, in both cases, a well-established GST foundation for closure in a &ldquo;top-down&rdquo; direction (i.e., breaking a system into components) is not yet evident (Talavage). In fact, further developments in GST will be necessary before that issue can be settled.
Simulation models as a basis for designing evaluation data banks
Authors: Gustave J. Rath, Amado SanMateo
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

Simulation typically has been a tool which used data banks as a source of information. This project turns the problem around as simulation is used as a tool to help design an evaluation data bank. The Midwest Regional Spinal Cord Injury Care System (MRSCICS) centers around the Wesley Pavilion of Northwestern Memorial Hospital and the Rehabilitation Institute of Chicago. In the process of trying to develop and improve MRSCICS, an evaluation data bank was planned to determine the effects of different system changes. Martin (1973) developed a flow chart which illustrates the essential nature of this system.
Component library for an integratel DA system
Authors: Kuo-Yen Nieng, Dennis A. Beckley
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes the component library facilities for an integrated DA system at GTE Automatic Electric Laboratories and the approach to the data base design for the component library.
Investigation of the mechanisms for interprocess communication
Authors: Jan Polek, Imtiaz Ahmad
Venue: Proceedings of the ACM annual conference (1973)

From a study of the computer systems operating in a multiprogramming environment, a model for the interrupt activity is derived. The basic components of the interrupt activity are identified and a formulation is developed to express process switching in terms of these components. The systems studied include, in particular, the IBM 360/370, Burroughs 5000/6000/6, PDP 10/11/8, Nova 1200, etc. Some important aspects of interrupt structure, such as, response time, overhead and saturation are examined and compared. The results indicate that while logical functions1, such as, interrupt acknowledge, saving, servicing and post processing are easily identifiable, their hardware implementation exhibit variations which have significant influence on process switching flexibility2. The use of interrupt mechanisms in scheduling of processes in multiprogramming systems is illustrated with examples. Problems of suitable functional modules for processor multiplexing are discussed. The results of the aforementioned study are used to suggest a suitable representation of the mechanisms for interprocess communication.