ppxscal/embedding_network huggingface dataset:
Balanced job bound analysis of queueing networks
Authors: J. Zahorjan, K. C. Sevcik, D. L. Eager, B. I. Galler
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

Applications of queueing network models to computer system performance prediction typically involve the computation of their equilibrium solution. When numerous alternative systems are to be examined and the numbers of devices and customers are large, however, the expense of computing the exact solutions may not be warranted by the accuracy required. In such situations, it is desirable to be able to obtain bounds on the system solution with very little computation. Asymptotic bound analysis (ABA) is one technique for obtaining such bounds. In this paper, we introduce another bounding technique, called balanced job bounds (BJB), which is based on the analysis of systems in which all devices are equally utilized. These bounds are tighter than ABA bounds in many cases, but they are based on more restrictive assumptions (namely, those that lead to separable queueing network models).
Providing adequate instruction to data processing students spread over a wide geographical area
Authors: Sheridan J. West,  II
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

Students are spread out over approximately 20 European U.S. military installations. The objective of the course of study is the Data Processing Core and Advanced Certificates awarded after 12 and 24 semester hours of course work, respectively. Instruction is provided by U.S. military and civilian personnel qualified in data processing and the language being taught. Purpose: To give students the fundamentals of programming in several of the most common programming languages in use today. They are not expected to become full fledged programmers. In the introductory courses, an important objective is to provide a general appreciation of data processing and how it is affecting the lives of everyone. In addition, it is hoped that students will apply this understanding so that data processing is seen as a tool to make jobs more meaningful&mdash;as opposed to the threat people feel as their job is &ldquo;automated.&rdquo;
Completing nth powers of polynomials
Authors: Barry M. Trager, David Y.Y. Yun
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

A frequent exercise in high school algebra courses is completing the square of some given polynomial. The goal is to find terms involving only constants independent of the main variable, which when added to the given polynomial will result in a perfect square. As a typical example, (x2 + 4x + 3) + 1 &equil; (x+2)2. The method for completing the square such as this one is often nothing more than applying the pattern matching abilities of students to the problem knowing the pattern (x+y)2 &equil; x2 + 2xy + y2. Here, we ask the question whether this problem can be generalized and whether there exists a constructive algorithm that replaces and extends the simple completion procedure of our high school days. The answer turns out to lie in the familiar process of computing polynomial remainder sequences (PRS) [Brown71].
Toward shared variable events implications of (@@@@)SVE in APL2
Authors: John A. Gerth
Venue: ACM SIGAPL APL Quote Quad (1983)

APL2 has two extensions for shared variables, a system function, (@@@@)SVS, which returns the access state of variables and a system variable, (@@@@)SVE, which provides a rudimentary mechanism for detecting events associated with shared variables. Implementation of these constructs raises questions about the signalling rules followed by Shared Variable Processors. This paper discusses those questions and suggests that further research be done.
A systems approach to the introductory course in information systems
Authors: David R. Adams, William Leigh
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Introductory courses in information systems are typically taught as computer &ldquo;literacy&rdquo; courses; in computer science they are oriented to &ldquo;algorithm development&rdquo;. The course described in this paper is concerned with providing the student with facility in the top-down development of hierarchically related systems of programs to be used in a business context. It is considered critical to orient students to this conceptual approach early on in their professional education. The course has been offered for four terms and has been well received by students and valuable for continued educational development in later courses in the curriculum.
Applied quality assurance methodology
Authors: Pamela R. Pfau
Venue: ACM SIGSOFT Software Engineering Notes (1978)

What is the charter of a Quality Assurance (Q.A.) department? What are the activities? How are they undertaken? What is the impact of Quality Assurance upon a software product? The structure and operating philosophy of the department are explained in this report as is the definition of the work cycle as applied to a new release of a software product. Comments are made about the interaction between departments: product development, product maintenance, publications, education, field support, product management, marketing, product distribution and quality assurance. While this is a description of the activities of a company involved in developing and marketing software products, the concepts apply to techniques and practices which would also be beneficial to any data processing department that develops in-house application software.
Peer evaluations of current programmer training programs
Authors: Raymond M. Berger, Frances R. Berger
Venue: Proceedings of the twelfth annual SIGCPR conference (1974)

This is a report on the quantified reactions to the various programmer training curricula described by the speakers at the Twelfth Annual Computer Personnel Research Conference. When plans for the conference were in their initial stage, it was suggested that the speakers might welcome immediate feedback from their peers about how well their training programs met their stated training objectives. This suggestion was implemented by engaging the SIGCPR conference attendees in some on-the-spot research. The attendees were composed largely of personnel and training directors.
Texture tile considerations for raster graphics
Authors: William Dungan,  Jr., Anthony Stenger, George Sutty
Venue: ACM SIGGRAPH Computer Graphics (1978)

As a technique for rendering texture in images, texture tiles meet the subjective criterion of visual acceptability. A texture tile is a digital array of stored texture information that is replicated on a surface within an image. The purpose is to give the surface a textured appearance. The repetitive pattern inherent in the tiling approach can be suppressed. A texture tile must not exhibit macropatterns to avoid this problem. Properties that the mapping algorithm must include are oriented toward controlling aliasing. The tile is stored and accessed at several different levels-of-detail. The accessing technique is based on the size of the footprint the sample projects onto the surface to be textured. Aliasing is further controlled by a combination of increased sampling per pixel and filtering. Several textured images are presented, produced by the texture tile technique. These images show the realistic effect that is added by texture tiles.
Validation of computer simulation models using parametric time series analysis
Authors: Der-Ann Hsu, J. Stuart Hunter
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

In this study a statistical testing procedure is suggested to perform the comparison of the time-dependence structure between realistic and simulation-generated data. The time series technique concerned can be used to perform forecasting, which is usually more efficient and cheaper than ordinary simulation methods, under various experimental conditions.
Teaching a topic in cybernetics with APL: An introduction to neural net modelling
Authors: Howard A. Peelle
Venue: Proceedings of the international conference on APL (1981)

This paper describes a curriculum unit in which APL is used to introduce models of neural networks. It begins with a simple model for transmitting impulses among a vector of logical neurons; then a more sophisticated model is developed with thresholds, decay, and inhibition in a matrix of neurons; then a general model is offered for higher order arrays of neurons, with dynamic input and automated impulse propagation; and, finally, the APL functions are embodied in an easy-to-use simulation package. Possible extensions of these models are proposed as student programming projects; some other related topics are identified as potentially suitable for teaching with APL; and implications for computer science education are mentioned.
ASSIST-V: A tool for studying the implementation of operating systems
Authors: Charles E. Hughes, Charles P. Pfleeger
Venue: ACM SIGCUE Outlook (1976)

This paper describes a program called ASSIST-V which is designed to provide students and other researchers with an environment in which they may write and analyze operating systems for the IBM 360/370 series of machines. ASSIST-V is an extended version of a student-oriented assembler/interpreter called ASSIST. A user of ASSIST-V is presented with a machine which simulates the full set of S/360 machine instructions (including privileged instructions): the standard 360/370 interrupt structure, I/0 channels, and I/0 devices. Since the machine environment is simulated, ASSIST-V can provide debugging and statistics-gathering features not available on an actual &ldquo;bare&rdquo; machine.
Industrial real-time fortran
Authors: Richard W. Signor
Venue: Proceedings of the ACM '81 conference (1981)

The European Workshop on Industrial Computer Systems, together with the International Purdue Workshop on Industrial Computer Systems, has developed a comprehensive tasking model for multi-tasking systems. A realization of this model has been implemented in Fortran 77 and presented for international standardization. The model includes task states (pending, running, suspended, etc.), state transitions, and inter-task communication and synchronization. The latter is achieved by the use of eventmarks, resourcemarks, and semaphores. The Fortran implementation involves procedures for manipulating these objects, controlling task state transitions, performing bit operations on integer variables, and dealing with file contention and other aspects of multi-tasking I/O.
Some operational tools in a OSI protocols study environment
Authors: J. P. Ansart, O. Rafiq, R. Castanet, P. Guitton
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

This paper deals with a strategy for a development chain of protocols (specification, validation, conformity testing) based on knowledge of the RHIN project methodology and the tools which this project produced. This methodology is based on finite state machines with predicates and includes &ldquo;conceptual&rdquo; tools for specification (PDIL)and for validation (VADILOC). &ldquo;Experimental&rdquo; tools play a part in conformity testing (STQ, Cerbere, Genepi). The interaction between conceptual and experimental tools is provided by a test sequence generator GAST which, starting from an automaton whose communication has been validated, provides sequences to be used by the test tools.
Automation of test specifications for N/C printed circuit boards
Authors: Thomas B. Yeager
Venue: Proceedings of the 7th Design Automation Workshop (1970)

This paper presents several computer aided techniques developed by the CIMTROL Division of Cincinnati Milling Machine Co. to assist in the writing of test specifications for fault detection on printed circuit boards used in Numerical Controls. Specific capabilities of this software support are depicted, as shown in figure 1. Each of the software packages is designed to support and augment the usefulness of a special N/C hardware tester built by and used by Cimtrol for manufacturing acceptance testing. The tester is a paper tape controlled machine capable of applying specified inputs to a manufactured circuit board. Outputs are then observed by the tester and compared to known standard outputs which have been pre-determined. All information necessary for the complete testing of a circuit board is gathered by the various computer routines and postprocessed for punched paper tape.
Case studies on the implementation and use of database management systems: Installing the first database application
Venue: Proceedings of the 1979 annual conference (1979)

The potential of database management systems for enhancing system support to managers and users while reducing design, structuring and maintenance problems is well known. Many database packages are available to assist those organizations pursuing this approach to improved data management. Furthermore, suitable guidelines exist to aid in determining whether database systems will help a particular enterprise. Selection criteria for specific system features have also been developed. Once a decision has been made to invest in database systems, organizations face another dilemma: how to get started. In spite of the vast knowledge about these systems, little has been written about launching a database implementation effort. The first application is the most difficult and yet it is the one where mistakes and problems can be the most costly from the viewpoint of both users and systems staff members. The questions that arise from persons involved in database implementation are many and varied; all are probably important. In these situations, it would be helpful to be able to draw on experiences of others who have been through the implementation headaches. In this way, problems can be avoided by new users and more effective and satisfactory transitions achieved. The purpose of this panel is to examine problems and concerns in installing the first database application. The panel members, each of whom is experienced in this area, will examine critical organizational and application issues surrounding the first implementation. Among the issues raised will be determining where to begin and how to select the first application. Also discussed will be overall implementation strategies, common mistakes, and what to watch out for and avoid. The intention is to let emerging database users draw on the actual experiences and frustrations of those who have already blazed a trail. This session should be of interest to both practitioners and researchers.
State of the art and trends in Design Automation in Italy.
Authors: P. Ciompi, L. Simoncini, M. Tomljanovich, G. Valle
Venue: Proceedings of the 12th Design Automation Conference (1975)

A paper, which wants to deal, in the most comprehensive way, about the state of the art in Italy of Design Automation, that is a field which has a direct impact with the industrial reality of the country, presents some difficulty in the acquisition of the informations, which often are confidential or secret. Therefore most of the informations, on which this paper is based, are from the open literature, and therefore report the situation of one or two years ago.
The correctness of a modified SECD machine
Authors: Clement L. McGowan
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

Landin's SECD Machine does not completely compute certain expressions of the &lgr;-calculus and so is modified by the addition of an output component and a unique name counter. This modified machine is proven to correctly implement the &lgr;-calculus.
Computer conference and message systems: Their use in a university computer center
Authors: Steven M. Koning
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Use of a computerized communication system to supplement traditional channels of communication has become an acceptable part of the operation of a large university computer center. CONFER(1), a computer conference and message system, is used for communication with users, among computer center staff members and with staff members from other computer installations. Characteristics of the organization which make it advantageous to use the computer as a medium of communication and the specific applications of the computer center are discussed. The strengths and weaknesses of computerized communication are also considered.
Transition logic: How to reason about temporal properties in a compositional way
Authors: Rob Gerth
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

This paper addresses the problem of obtaining formal proof systems that support reasoning about temporal properties of parallel programs in a way that is compositional or 'syntax directed' - the distinctive feature of e.g. Hoare style proof systems. Now, temporal properties of programs express properties about execution traces of these programs. In the presence of concurrency, compositionality is obtained by concentrating exclusively on the execution traces associated with the atomic actions of programs - the so-called transitions of those programs. To reason about such transitions in a compositional way, 'Transition Logic' is proposed, expressing properties of the form &ldquo;every transition of a program, say &agr;, that starts in a state satisfying assertion p, must end in a state validating &rdquo;: [p]&agr;[q]. Essential is that these assertions can express properties of control locations of programs, too. For this logic, a compositional proof system is obtained which is proved to be sound and relatively complete. An interesting feature of the proof system is the axiomatization of the flow-of-control of programs. The relevance of this logic is supported by the fact that the temporal behaviour of a program is ultimately provable in terms of properties of its transitions, as shown by the work of Z. Manna and A. Pnueli [16].
General microprogram width reduction using generator sets
Authors: Jorge Francisco Martinez-Carballido, V. Michael Powers
Venue: Proceedings of the 14th annual workshop on Microprogramming (1981)

The problem of reducing the microinstruction length for a parallel microprogram, by trading off microprogram width (bits) for subsequent logic, is considered. In a generalization of previous methods, it is shown that a considerable reduction of microprogram storage size can be achieved by selecting a subset of the original microorders to serve as inputs to some generating logic in order to provide all the microorders in the original microprogram. Heuristic solution methods are shown, along with ways to control the bounds of the solutions, allowing the designer the choice between a fast solution and an optimal solution. Examples show the effects of using these methods, alone and in conjunction with previously published methods for width reduction. Applications of the width reduction technique to reasonable modern design situations are discussed.
Performance statistics can help the users
Authors: Robert Beebe, Dick Johnson, Richard Lagerstrom
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Computer center managers are heavy users of statistics about their users' jobs. In fact, most computer centers understand their users quite well: how many of them there are, how many and what types of jobs they run, how long they stay logged on, how many times their jobs fail, and how much money they spend. The users can also benefit from this knowledge. This paper discusses one of the methods used at SLAC to automate the process of notifying the users when their jobs fail tests of reasonableness; wasted core, incorrect estimates of I/O rate, use of defective tapes, etc. Also described are the SLAC computer system, the job mix and the user community at SLAC, and the origins, implementation, and preliminary results of the automation process mentioned above.
Modeling systems using discrete event simulation
Authors: Lee Schruben
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

In this article, we present an introduction to discrete event modeling and discuss some of the important issues related to model development. We are not talking about simulation codes nor statistical models for the outputs from such programs. Rather we will focus on the interface between a real system and a simulation code where we describe the system.
FORTRAN enhancement
Authors: Han Park
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

One of the disadvantages using higher level languages has traditionally been slow execution time. In the last decade, the large core based computer manufacturers have greatly improved execution time of higher level languages either by modifying hardware designs or by implementing slow functional areas into microcodes (firmware). In the mini-computer field, microprogramming concepts and implementations have been amplified by industrial demand and by recent technical advancements. The microprogramming concept is not new, but it took a while for computer design engineers to implement user microprogrammable computers. The utilization of user microprogrammable capability is limited only by one's imagination. The utilitarian value of microprogramming is to maximize the use of mini-computer's resources.
Tools for map graphics
Authors: Patricia Fulton
Venue: Proceedings of the 14th Design Automation Conference (1977)

Tools for Map Graphics There are many types of maps because there are a great number of very different applications that require the information conveyed by maps. The support provided by adequate tools is essential if computerized mapping systems are to be effective. A narrative sequence of events will show why and how adequate support is essential. Simultaneously, a list is developed identifying the tools necessary for creating map graphics by computer-assisted methods.
Summary of CODASYL report on &ldquo;selection and acquisition of data base management systems&rdquo;: CODASYL system committee
Venue: Proceedings of the 1975 annual conference (1975)

This panel will discuss the latest in a series of reports on data base management systems. Of special interest is the attempt to provide a systematic taxonomy for user needs and a means to relate them to the taxonomy of system capabilities developed in prior reports.
Perspectives on testing for programming aptitude
Authors: Jack M. Wolfe
Venue: Proceedings of the 1971 26th annual conference (1971)

This paper discusses limitations of programming aptitude tests. The use of multiple-choice type questions, the testwiseness of the college graduate group, and the inclusion of questions of mathematical information tend to diminish the effectiveness of such tests as predictors of success in business programming. Timed tests favor the faster worker over the slower one who is often more accurate and of equal or better logical capability. The usual criterion of a test's validity is itself often not valid as a simulation of the true criterion but is accepted as the equivalent of the criterion because of its measurability and its appearance of plausibility. Comparative results of various occupational groups on the author's Aptitude Assessment Battery: Programming test are analyzed based on the scores of more than 11,000 persons tested, including more than 2,700 persons with work experience in programming in 317 companies, institutions, and government agencies.
The impact of a computers and society course on student perspectives
Authors: P. J. Nicholson, W. R. Franta, R. E. Anderson
Venue: Proceedings of the ACM annual conference (1973)

This report describes a course entitled &ldquo;Perspectives on computers and society&rdquo; and presents findings from student assessments of course impact and attitude change. Almost all of the class members were computer science majors and they entered with rather favorable attitudes toward computerization. By the end of the quarter they were slightly less favorable toward the computer because of its perceived social impact. The desirability of this more balanced perspective is discussed.