ppxscal/embedding_network huggingface dataset:
SPSL/SPSA a minicomputer database system for structured systems analysis and design
Authors: P. G. Sorenson, J. P. Tremblay, A. W. Friesen
Venue: ACM SIGSMALL Newsletter (1981)

The field of computer-aided systems analysis and design is still very young and therefore, as yet, there are few automated aids in existence. Progress, however, is now being made in computer-aided techniques to be used in the development of information systems. Most of the limited number of automated aids available require large computer systems for their operations. This paper describes a computer-aided systems analysis and documentation system which has been implemented on a PDP-11/40 computer running under the UNIX operating system. In particular, the database design and implementation considerations with in a small minicomputer environment of the SPSL/SPSA system are presented. Also the experiences gained in the use of this system are reported. Finally, several extensions to the existing SPSL/SPSA system currently under development are described.
The principal continuation and the killer heuristic
Authors: Selim G. Akl, Monroe M. Newborn
Venue: Proceedings of the 1977 annual conference (1977)

An algorithm is presented for obtaining the principal continuation in trees searched by two-person game playing programs based on the Alpha-Beta algorithm. Moves saved while determining the principal continuation are shown to be good candidates for killer moves when the killer heuristic supplements the Alpha-Beta search.
A graphics editor for benesh movement notation
Authors: Baldev Singh, John C. Beatty, Rhonda Ryman
Venue: Proceedings of the 10th annual conference on Computer graphics and interactive techniques (1983)

This paper describes an interactive computerized editor for Benesh Movement Notation that aids in the preparation of dance scores on a medium resolution colour display. Benesh Movement Notation is a two-dimensional system for recording human movement in three dimensions of space which has been successfully used in the preparation of scores for a wide repertoire of dances. The preparation and revision of Benesh scores is a lengthy and error-prone process which interactive editing techniques can greatly facilitate. We describe the current state and future extensions of a prototype editing system in which all user interaction is based on a menu-driven scheme using a graphics tablet. Extensive visual cues including iconic trackers and semantic information are provided at all times. Both user and system initiated dialogues are supported. This system has served as a testbed for a variety of man-machine interaction studies, allowing us to transfer the wealth of experience with interactive text editing to a related task: the preparation of dance scores. The project has given us a better understanding of the issues involved in implementing an effective user-interface.
Bandpass filter approximation by interactive graphics
Authors: Herman Daae
Venue: Proceedings of the 13th Design Automation Conference (1976)

In a lossless bandpass filter, the amplitude response function is determined by a certain number of coordinate points. For a given order and class of filter function the number of finite and infinite attenuation points is uniquely determined. Displaying the amplitude response with its selected set of coordinate points, this function may be varied by shifting the points with a light pen. Subsequent computation and display of the group time delay function facilitates a compromise between both response requirements. The process is applied to the example case design of a 12th order IF filter for color television receivers.
Getting more oomph from programming exercises
Authors: Alan L. Tharp
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Much attention has been given to the content of introductory computer science courses, but based upon a perusal of introductory textbooks, it appears that somewhat less attention has been given to the programming exercises to be used in these courses. Programming exercises can be modified to provide a better educational experience for the student. An example of how atypical programming exercises were incorporated into an introductory programming language course is described.
MIKADO - a system for computer aided microprogram design
Authors: Wilfried Rottmann
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

This paper discusses some software aids used in microprogram development at Siemens. The following aspects are typical for the microprogram-design for our present day computers: a) the instruction format of microprograms is complicated and a good knowledge on the internal hardware-structure is required to understand it, b) in our, and also other, microprogramming systems the possibilities of locating the microinstructions in control store are restricted (by limited branching distances e.g.), thus making the address-assignment a difficult optimizing task, c) as soon as the hardware is finished its microprograms have to be available in a sufficiently tested shape, d) above that, microprograms which are stored in read only memory have to be tested before manufacturing very thoroughly, e) manufacturing data has to be generated for microprograms in read only memory. These peculiar problems require additional support by computer aided design-techniques. As an aid for our microprogram design we have developed an integral system, which covers the development range from symbolic microinstruction level to manufacturing data and loadable microprograms. The system is called MIKADO.
An enhancement of lssd to reduce test pattern generation effort and increase fault coverage
Authors: Kewal K. Saluja
Venue: Proceedings of the 19th Design Automation Conference (1982)

In this paper we propose designs of latches which can be used in Level Sensitive Scan Design (LSSD). These new designs can use the existing software support for design rule checks but result into a reduction of effort in test pattern generation and provide a better fault coverage. The system performance is not degraded with the use of latches proposed in this paper.
Development of a multifacetted undergraduate program in Computer and Information Science
Authors: Robert F. Mathis, Douglas S. Kerr
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

Computer and Information Science Departments are usually organized, as was the one at The Ohio State University, by combining already existing courses in computer programming and applications from other departments into one department and adding a few extra courses. This paper is a report concerning how this was done at Ohio State and how the Department has developed since. Suggestions are also included for the organization of new departments at other schools. The report has been arranged in four main sections: a description of the development of the department at Ohio State, a unifying philosophy of the field, a description of the Ohio State undergraduate curriculum in Computer and Information Science, and suggestions for new curricula at other schools.
The education and data processing professions: a perspective
Authors: William D. Garrison
Venue: Proceedings of the ACM '82 conference (1982)

The data processing community is in the process of becoming a data processing profession following the track of other professions required to support a twentieth century, knowledge based society. This paper is intended to provide a perspective on the development of this profession from the experience of another recently created profession&mdash;education. By looking at the experience of education, it may be possible for data processing to move ahead with fewer false starts.
Using fullscreen-support and graphics in an end-user-friendly management information system
Authors: Conrad H. Hoesle
Venue: ACM SIGAPL APL Quote Quad (1984)

This paper is a report on the experiences gained in the combined use of APLDI, GRAPHPAK and GDDM to write an end-user-friendly management information system. It contains hints about fullscreen-support, menu-panel design, user- friendliness and graphics.
Dynamically Expanding Context as Committee Adaptation Method in On-Line Recognition of Handwritten Latin Characters
Authors: Jorma Laaksonen, Matti Aksela, Erkki Oja, Jari Kangas
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

We have developed an adaptive handwriting recognizer for isolated Latin characters in which the adaptive behavior is based on the Dynamically Expanding Context (DEC) algorithm. In our current system, the outputs of a set of static classifiers are combined in a committee machine, whose rules are adapted. Every misclassified character gives rise to adding a new DEC rule to the rule set of the committee. When the existing rules fail to produce correct recognition output, more and more context information is utilized in forming the new DEC rules. Not only the first-ranking outputs from the member classifiers but also the second-ranking ones can be taken into account when forming the DEC rules.In the experiments described in this paper, various options in the implementation of the DEC committee classifier are evaluated. The results of the experiments show that the system is capable of fast adaptation to the user's handwriting and leads to lowered recognition error rates.
Image Sequence Analysis Using A Spatio-Temporal Coding For Automatic Lip-reading
Authors: Abdul Rauf Baig, Renaud Séguier, Gilles Vaucher
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper we present the details of a processing technique utilized to extract parameters from the images of a talking person's mouth region. These parameters are converted into impulse sequences for a given series of images. Spatio-temporal (ST) coding of the impulses provide an input to a spatio-temporal neural network architecture. The system is tested on a French digit recognition task and the results obtained are given. The overall procedure is sufficiently simple to allow us to make plans for its realization as a real time system.
A multimicroprocessor approach to numerical analysis: An application to gaming problems
Authors: Robert McGill, John Steinhoff
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

A parallel processing system is described that consists of a minicomputer host and a set of bipolar microcomputer modules. It is argued that such a system in which the microcomputers operate with little mutual interaction should be effective for an important class of problems in numerical analysis. In particular, estimates are given for the operation of the system on a problem in gaming theory. In this problem, the extensive I/O and software capabilities of the minicomputer provide ease of use for a large part of the problem. The relatively simple part of the problem, which requires almost all of the computational time, is executed in parallel on the microcomputers. It is argued that the system, with 10 to 20 modules, would offer one to two orders of magnitude more speed at several orders of magnitude less cost than current large general-purpose machines. The potential for the development of new algorithms that exploit fully the characteristics of the new devices is discussed.
Notes from the second department of energy library Workshop
Authors: Kirby W. Fong, Rondall E. Jones
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

The U.S. Atomic Energy Commission (AEC) and its successors, first the U.S. Energy Research and Development Administration and now the U.S. Department of Energy (DOE) and Nuclear Regulatory Commission, has been and continues to be one of the nation's major purchasers and users of large scale scientific computers. Historically, each of the more than dozen computer centers at different laboratories evolved independently of the others so that each was self-contained. In particular, each computer center developed mathematical software libraries according to its own needs. In 1975, representatives for the mathematical software libraries at the various AEC computer centers met, with Argonne National Laboratory as the host, to hold the first Workshop on the Operational Aspects of Mathematical Software Libraries. Among the purposes of the first Workshop were: (1) to meet colleagues doing similar work at other AEC computer centers, (2) to share experiences in the management of mathematical software libraries, and (3) to discuss ideas and issues in the operation of libraries. The first Workshop was sufficiently rewarding that the participants felt it appropriate to hold a second Workshop in three years, an interval that would encompass sufficient progress in library operation that new experiences and ideas could be discussed.
Efficient implementation and optimization of run-time checking in PASCAL
Authors: Charles N. Fischer, Richard J. LeBlanc
Venue: ACM SIGPLAN Notices (1977)

Complete run-time checking of programs is an essential tool for the development of reliable software. A number of features of the programming language PASCAL (arrays, subranges, pointers, record variants (discriminated type unions), formal procedures, etc.) can require some checking at run-time as well as during compilation. The problem of efficiently implementing such checking is considered. Language modifications to simplify such checking are suggested. The possibility of optimizing such checking is discussed.
Monte Carlo and stopping rules for some combinatorial problems
Authors: Paul H. Randolph, Oren N. Dalton
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

One major problem in combinatorial theory is to find a combination that will optimize a given objective function. However, for many real problems even with moderate requirements, no algorithm exists which can find an optimum in a livable span of time. This paper proposes that if the N! combinations are viewed as points in a sample space, then a Monte Carlo sampling procedure will provide a &ldquo;good&rdquo; solution. Statistical stopping rules are used to determine when the solution is &ldquo;good enough,&rdquo; as well as provide an estimate of the closeness of the solution to the true optimum.
Can CAD meet the VLSI design problems of the 80's
Authors: David Hightower
Venue: Proceedings of the 16th Design Automation Conference (1979)

The technology of the 80's will permit 106 transistors to be placed on one IC, but what kind of function will the device serve? It is unlikely that a random logic circuit of 106 transistors would be designed, let alone realized in hardware. Such an IC would probably be 5&rdquo; on a side because the total interconnect length (manual or automatic) grows exponentially (approximately .62 N1.226) with the number of devices. This effect can be offset somewhat using multilayer routing, but cannot be satisfactorily overcome because the performance of the circuit will degrade with exponential growth of the average interconnect length. But since the technology allows 106 devices per chip, we have to take advantage of it. Given that the design of such a device will be very difficult and time consuming, it is unlikely that very many of them will be designed. Instead, only a few will be designed, and these will be general purpose devices. The customer will provide the ROM program, and the microelectronics house will supply the programmed part. A typical part will have lots of memory, say 64K of RAM; various other standard design elements, e.g., PLA's, Registers, etc.; and lots of ROM containing the control logic. This type of device could be standardized, and the vendor would only have to insert the ROM code and possibly add one or more layers of interconnect to complete the customization process. We could call such a device a Multi-purpose Super Component, or MSP. With the MSP, layout cycle time is traded for program development time. A study of the economics involved suggests that considerable effort can be expended to assure ROM code correctness without offsetting the benefit of not having to design a new hardware part.
Cost evaluation of storage schemes
Authors: Jair M. Babad, V. Balachandran, Edward A. Stohr
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

In this paper we present a methodology for the cost evaluation of file system performance. The cost structure we consider takes into account the various operations that are required during the processing of data in the system. The cost evaluation approach is then applied to several systems. A new storage scheme&mdash;a partially ordered file&mdash;is proposed, and experimental data which demonstrate its performance are presented. Finally, the cost evaluation approach is applied to this proposed storagse scheme.
A class of generalised stochastic petri nets for the performance evaluation of multiprocessor systems
Authors: M. Ajmone Marsan, G. Balbo, G. Conte
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

Graph models have been proposed by many authors as a useful tool for the analysis of peculiar features of computer systems such as concurrency, synchronization, communication, and cooperation among subsystems. Much of the work in this field is related to the original ideas developed by C. A. Petri. These graph models are today generally known as Petri Nets (PNs).
&ldquo;An interactive system for semi-automatic artwork generation of printed circuit boards&rdquo;
Authors: A. Mura, M. Tomljanovich
Venue: Proceedings of the 10th Design Automation Workshop (1973)

A stand alone minicomputer and a comprehensive software system including a tape puncher and reader provide a rapid automated verification of input data from schematic to artwork.
Evolution in the design of abstract machines for software portability
Authors: Daniel Thalmann
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

The abstract machine model is the best one for solving the difficult problem of program transferring, but an evolution in the design of these machines is necessary. After a brief survey of the well-known abstract machines, this paper proposes the design of a more general one to implement portable operating systems. The complex problem of relating this abstract machine to existing computers is discussed and the paper explains how the top-down methodology is an inestimable means to reduce the machine dependence.
Deadlock-free packet switching networks
Authors: Sam Toueg, Jeffrey D. Ullman
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

Deadlock is one of the most serious system failures that can occur in a computer system or a network. Deadlock states have been observed in existing computer networks emphasizing the need for carefully designed flow control procedures (controllers) to avoid deadlocks. Such a deadlock-free controller is readily found if we allow it global information about the overall network state. Generally, this assumption is not realistic, and we must resort to deadlock free local controllers using only packet and node information. We present here several types of such controllers, we study their relationship and give a proof of their optimality with respect to deadlock free controllers using the same set of local parameters.
Dynamic programming as applied to feature subset selection in a pattern recognition system
Authors: C. Y. Chang
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

This paper proposes dynamic programming search procedures to expedite the feature subset selection processes in a pattern recognition system. It is shown that in general the proposed procedures require far less number of subsets to be evaluated than the exhaustive search procedure. For example, a problem of selecting the best subset of 4 features from a set of 24 features requires an evaluation of [equation] &equil; 10626 subsets by using the exhaustive search procedure; on the other hand, it requires only 175 and 136 subsets to be considered by employing the proposed procedures I and II, respectively, to solve the same problem. While the number of subsets to be evaluated for the dynamic programming search procedures is slightly greater than that for the without-replacement search procedure, the best feature subset selected by the proposed methods may, however, not necessarily contain all of the best single features selected in the previous stages.
Metrics in software quality assurance
Authors: J. E. Gaffney,  Jr.
Venue: Proceedings of the ACM '81 conference (1981)

The nature of &ldquo;software quality&rdquo; and some software metrics are defined and their relationship to traditional software indicators such as &ldquo;maintainability&rdquo; and &ldquo;reliability&rdquo; are suggested. Recent work in the field is summarized and an outlook for software metrics in quality assurance is provided. The material was originally presented as a tutorial at the &ldquo;ACM SIGMETRICS Workshop/Symposium on Measurement and Evaluation of Software Quality&rdquo; on March 25, 1981.
A general university simulation model
Authors: H. K. Eldin, C. C. Daniel
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper presents the results of an attempt to develop a general simulation program for the study of the utilization and allocation of resources in the university environment. The problem area examined covers the use of both physical and human resources. The simulation program was written in GPSS 1100.
An architecture with comprehensive facilities of inter-process synchronization and communication
Authors: P. Guillier, D. Slosberg
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

In the architecture of the &ldquo;Level 64&rdquo; manufactured by CII-Honeywell-Bull and Honeywell Information Systems, processes executing in a central processor are known to the hardware-firmware. They use the same semaphore mechanism as processes executing in an input-output controller. This implies specific data structures recognized by the hardware-firmware and a hardware-firmware dispatching of the central processor resource. Experience in this domain has led to the development of some new extensions. The models &ldquo;Level 64&rdquo;, &ldquo;64/DPS&rdquo; and &ldquo;DPS/7&rdquo; are general purpose medium-scale computers. This paper describes some aspects of their common architecture which have so far not been presented at this level of detail. A characteristic of this architecture is the hardware-firmware implementation of many concepts which are most usually found in a software form. The term &ldquo;integrated object&rdquo; denotes - in this paper - a data structure built in main memory under software responsibility and made known to the hardware-firmware as an operand of a specific instruction which is able to replace an entire sequence of basic instructions. For example an instruction acting upon an integrated object &ldquo;semaphore&rdquo; involves complex operations on integrated objects &ldquo;processes&rdquo; (process switching, queueing, etc...). Emphasis is placed in this paper on semaphores and process operations performed through the use of semaphores. The term &ldquo;hardware&rdquo; will be exclusively used when referring to the combination of hardware-firmware.