ppxscal/embedding_network huggingface dataset:
A linear programming system for use on time sharing
Authors: Bruce O. Larsen
Venue: Proceedings of the 1971 26th annual conference (1971)

A linear programming system, NYLPS, designed for batch processing has been adapted for use under time sharing. The new system is called ECLIPS. The system is both conversational, in that it prompts the user for information, and interactive in that the user may interrupt an optimization, change data and continue optimizing without losing the current basis. These features are discussed along with the programming techniques used to accomplish them.
The role of software in successful computer applications
Authors: W. Wayne Black
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper discusses the steps that are required to produce computer programs that satisfactorily implement a computer application. It is a major contention that those steps impacted by structured programming are not the most critical to the development of a successful computer application. Successful computer applications depend more heavily on the statement of the problem, the conceptual solution, and software specification. Ample precedents for approaches to these more crucial steps can be found in good engineering practice and applied science. Heavy emphasis is placed on the purpose and use of software specifications.
THE TRANSFER OF UNIVERSITY SOFTWARE FOR INDUSTRY USE
Authors: Rossane Wyleczuk, Lynn Meyer, Gigi Babcock
Venue: Proceedings of the 20th Design Automation Conference (1983)

Computer-aided engineering software is generated in abundance in educational institutions. As a major source of design automation software, universities have a lot to offer: a progressive research environment; a seemingly inexhaustible supply of software engineers in the form of undergraduates, graduate engineers, and professors; and a no-risk, multi-disciplinary design lab for experimentation. For these reasons, university software is being widely sought for use in production/commercial environments. This paper examines the interface between industry and the universities during the transfer of design automation software. A printed circuit board router, a graphics subroutine library, and a circuit simulation program are used to illustrate issues arising from the technology transfer. Guidelines to increase the likelihood of success in such transfers of software are provided.
Application of extensible languages to specialized application languages
Authors: Jean E. Sammet
Venue: ACM SIGPLAN Notices (1971)

It is becoming increasingly clear that one of the major thrusts of the programming language field is in the direction of specialized application languages - sometimes called special purpose languages. These specialized application languages have already been developed for such diverse fields as civil engineering, electrical engineering, computer assisted instruction, systems programming, equipment checkout, movie animation, etc. Of the roughly 165 languages currently in use in the United States, approximately 85 of them might be classified as specialized. (See the list in Reference 1.) For description and illustration of many of these, see Chapter 9 in Reference 2. All languages are applications oriented. In fact, this is probably the best way to categorize the set of programming languages. However, some application areas are obviously larger than others, e.g., scientific computation (numeric and non-numeric) and business data processing. The main concern here is with the more specialized languages. While each person may have a different idea of what the categories of specialization should be, there can be little dispute about the wide diversity and large number of them.
Random fault analysis
Authors: Robert M. McDermott
Venue: Proceedings of the 18th Design Automation Conference (1981)

A method is presented for performing rapid Test Pattern Evaluation (TPE) using classical statistical analysis. This method is applicable regardless of the types of faults being considered, the likelihood of the fault occuring, or the technique used for fault simulation. A subset of the complete fault list is selected using random sampling techniques, and the fault coverage (percentage of faults detectable by the given test pattern) is estimated and confidence limits about this estimate are given. This technique is useful for LSI as well as VLSI Test Pattern Evaluation in that only a small subset of the total fault list need be analyzed to determine the fault coverage within a few percent.
PEIRCE: A relational DBMS for small systems
Authors: Martin K. Solomon, Carl D. Kirshen
Venue: ACM SIGSMALL Newsletter (1981)

PEIRCE is an interactive relational database management system intended for mini and microcomputers, with an extensible command facility, QUERY, based on Codd's relational algebra and supporting a clerk oriented interface. PEIRCE contains three major independent on-line modules: DBA, QUERY, and CSU. DBA provides the data definition and data dictionary facilities and is discussed in Section 2. QUERY provides both a relational algebra data manipulation language and a clerk oriented interface. QUERY is also discussed in Section 2. Command sequences are discussed in Section 3. We discuss the virtual file facilities of PEIRCE (which include the updating of virtual files) in Section 4. The underlying storage structure, namely entry order sequence with secondary indexes, was chosen primarily with simplicity of recovery in mind and is discussed in section 5. In Section 6 we discuss the control commands IF and FOR, which help to conveniently avoid having a host language facility. We conclude in Section 7 by describing further work planned on PEIRCE.
A few examples of how to use a symmetrical multi-micro-processor
Authors: Guy Mazare
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

This paper presents an overview of an architecture of a multi-micro-processor architecture in which all processors are equivalent. The structure is characterized by a central memory and several caches, and is designed to avoid incoherent data. A fast mechanism of &ldquo;subcontracting&rdquo; between one processor and another is described. The execution of two simple programs under this architecture is studied. The parallel algorithms are described and compared with the original (sequential) algorithms; it is shown that the overhead remains small, few extra memories are necessary and synchronization do not slow down the execution unduly. Furthermore, the locality of the parallel algorithm is compared to that of the sequential algorithm and is found to be less good, but in a reasonable way. As well, an estimation of the cost of the coherence keeping mechanism is given using the difference between the miss ratio of the classical cache and the &ldquo;coherence keeping cache&rdquo;, respectively.
A program for social science computer literacy
Authors: Paul J. Strand
Venue: ACM SIGSOC Bulletin (1982)

A strategy for organizing the social science computer user community is presented. The strategy recognizes that social scientists have exceptional educational needs and unfavorable budgetary constraints. A series of workshops is proposed to reduce curriculum redundancy and avoid the costly "on demand" mode of consultation that has developed in most computer centers. An example of a workshop is provided.
HAWSIM simulation of social services
Authors: Bryan A. Bremner, William F. Eicker
Venue: Proceedings of the third conference on Applications of simulation (1969)

This paper describes one aspect of a large developmental effort to convert and apply the full range of systems technology to community mental health programs. Community mental health is treated functionally as the delivery of health and welfare services which currently operates as a fragmented aggregate of unrelated means. In the attempt to design more efficient health and welfare systems, simulation models are built and subjected to perturbation analyses. HAWSIM, an acronym for Health And Welfare SIMulation was developed specifically as a problem oriented discrete event simulation language to build these models as a tool for management evaluation and program planning of public social services. The developmental history and application of HAWSIM are described including a brief overview of some of the problems in simulating social systems.
Rate-revenue-cost of service simulation of a natural gas utility
Authors: D. Jeffrey Blumenthal
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A major midwestern utility was faced with the dilemma of increased demands for natural gas energy while the supplies of natural gas were diminishing. Questions on how to meet seasonal or off-peak demands, how to utilize underground storage, and how much new supply would be required to eliminate waiting lists for residential customers were typical of the problems confronting this utility. In addition, the cost of service due to inflation and pipeline cost adjustments indicated that this company should perhaps request a general rate increase and required substantial calculations in the PGA (Purchase Gas Adjustment) area. A set of linked models was built for this utility to answer these questions. The models considered the areas of rate, revenue, cost of gas, PGA, and income. Each model could be run independently of the others; however, all could be linked to provide an integrated planning system for the utility. The models were implemented in a conversational mode on a time-shared computer and allowed the model users to interactively vary rate structures, pipeline contract terms and alternative sources of supply over a five-year planning horizon.
Definition and use of higher-level graphics input tools
Authors: Jan Van den Bos
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

A proposal is made for the definition of 'tools', high-level graphics input functions based on the six primitive input classes Clock, Pick, Button, Key, Valuator and Locator. Tools are defined in terms of input expressions, the operands of which are themselves tools, the definition of which may be nested inside this tool. Input expressions are written much like production rules in phrase structure grammars. Determining whether a tool is 'satisfied' can therefore be done most advantageously by an input expression parser. Tool definitions may occur in-line or stored in a library. They are activated by a 'create' primitive, which creates an instance of the tool and causes the input expression to be made active. The parser then determines whether a tool is actually used. Following a 'read' issued to the tool, the tool body generates the returned information as specified by the tool definition. Tools may be explicitly freed by a 'free' primitive; in the case of nesting, tools are freed implicitly when the surrounding tool is freed. Using this approach to higher-level input primitives, a programmer does not have to think about graphics input in terms of awaiting events, interrupts and the like. The creation of a defined tool implies a function awaiting action from the tool.
An inexpensive scheme for calibration of a colour monitor in terms of CIE standard coordinates
Authors: William B. Cowan
Venue: ACM SIGGRAPH Computer Graphics (1983)

The Commission Internationale d'Eclairage system of colorimetry is a method of measuring colours that has been standardized, and is widely used by industries involved with colour. Knowing the CIE coordinates of a colour allows it to be reproduced easily and exactly in many different media. For this reason graphics installations which utilize colour extensively ought to have the capability of knowing the CIE coordinates of displayed colours, and of displaying colours of given CIE coordinates. Such a capability requires a function which transforms video monitor gun voltages (RGB colour space) into CIE coordinates (XYZ colour space), and vice versa. The function incorporates certain monitor parameters. The purpose of this paper is to demonstrate the form that such a function takes, and to show how the necessary monitor parameters can be measured using little more than a simple light meter. Because space is limited, and because each user is likely to implement the calibration differently, few technical details are given, but principles and methods are discussed in sufficient depth to allow the full use of the system. In addition, several visual checks which can be used for quick verification of the integrity of the calibration are described. The paper begins with an overview of the CIE system of colorimetry. It continues with a general discussion of transformations from RGB colour space to XYZ colour space, after which a detailed step-by-step procedure for monitor calibration is presented.
A general purpose translation demonstrater
Authors: John D. Sybalsky
Venue: Proceedings of the 1966 21st national conference (1966)

The purpose of this program is to utilize a computer for universal translation. A theoretical method for obtaining this objective was established. The problem was to determine whether or not this method would work. The program is subject to the following limitations: It is limited to words of six letters or less. The only punctuation it will respond to is the period. The computer translates verbatim. The program has been run successfully translating French to English. It has also been used to transpose the tune &ldquo;America&rdquo; from G major to C major. Finally it has been used to translate Symbolic Computer Language, or MAP, to machine Language, or IBM 7040 actual. The program is written in MAP (symbolic language) and was run on the IBM 7040 computer.
The Computer Science teaching Laboratory at the University of Washington
Authors: Earl Hunt
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

The purpose of this paper is to describe the Computer Science Laboratory at the University of Washington, explain how it is run, and to examine both its benefits and costs to the University. In order to do so, it is necessary to discuss briefly the University of Washington itself. The University of Washington is a very large, single-campus, state university. In a typical quarter approximately 33,000 students are enrolled. There is a faculty of about 2,000. By contrast, the computer science program is a small interdisciplinary program confined strictly to graduate education. The program was begun in 1967, and granted its first PH.D. in 1968. There are at present somewhat more than 40 graduate students and a full-time equivalent faculty of about seven. Prior to the development of the program, there were, of course, teaching courses in Electrical Engineering and other departments and a few courses in mathematics, but the advanced computer science stamp for the University of Washington had not yet been established. The equipment on campus is also important to our story. The University Computer Center operates a Control Data 6400 and a Burroughs B5500. These machines are available to the general user, although the B5500 gives priority to administrative data processing. Use of the machines is charged either to research accounts or to special departmental accounts established to support computing. That is, the Computer Center does not decide who runs on the computer. Rather, this is levied as a charge against departmental budgets. Like any other department, the Computer Science Group also has a budget for computing on the Center's equipment. In addition, there are a variety of special computers on campus. For example, the Physics Department contains a PDP-10 and an XDS-930. There is a very large Raytheon computer complex in Biophysics and there are a number of 1130 and 1800 installations on campus. All these centers are associated with specific research projects, and, therefore, are available only to students who are working with the faculty on these projects. In addition, the University has provision for favorable rates on a number of commercial time-sharing installations. Departments do not receive funds for off campus computing, so that extramural funds must be sought by anyone who wishes to make use of a conversational computing capability.
Performance analysis of circuit switching, baseline interconnection networks
Authors: Manjai Lee, Chuan-lin Wu
Venue: ACM SIGARCH Computer Architecture News (1984)

Performance evaluation, using both analytical and simulation models, of circuit switching baseline networks is presented. Two configurations of the baseline networks, single and dual, are evaluated. In each configuration, two different conflict resolution strategies, drop and hold, are tried to see the performance difference. Our analytical models are based on a more realistic assumption. New analyses are given and are verified by simulation results. In single network configuration, it is shown that the drop strategy is better than the hold strategy in the case that the data transfer time is longer than 10 cycles under a high request rate. In the dual network configuration, five different communication strategies are investigated and the optimum performance level is shown to be dependent on the length of the data transfer time.
Methodology for compiler generated silicon structures
Authors: Antonio Martínez, Scott Nance
Venue: Proceedings of the 21st Design Automation Conference (1984)

A unique cell compiler is described which uses a combination of high level or systems level parameters to define and build complex cells such as RAMs, ROMs and PLAs. The techniques include specialized macros residing in VIP (VLSI Implementation Program), a powerful procedural design language, and predefined component cells used to construct multiple variations of the same circuit.
A decision method for the equivalence of some non-real-time deterministic pushdown automata
Authors: Esko Ukkonen
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

A generalization of the alternate stacking procedure of Valiant for deciding the equivalence of some deterministic pushdown automata (dpda) is introduced. To analyze the power of the generalized procedure we define a subclass of dpda's, called the proper dpda's. This class properly contains the non-singular dpda's and the real time strict dpda's, and the corresponding class of languages properly contains the real time strict deterministic languages. The equivalence problem for proper automata is reducible to the problem of deciding whether or not an automaton is proper. The main result of the paper is that the generalized procedure yields an equivalence test for proper dpda's, at least one of which is also a finite-turn machine.
Timeless access - faculty development through computer conferencing
Authors: Miriam K. Mills
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

This paper will describe the phenomenon of training and development through the use of interactive computers. Following a description of the Electronic Information Exchange System, specific experiences of the New Jersey Institute of Technology in the realm of professional faculty development as well as continuing education will be discussed. The actual experience in moderating a course will be described. General principles that are conducive to the successful use of the system will be considered as well as pitfalls for the unwary.
Developing figures of merit for determining relative air quality
Authors: Meyer Katzper
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

In spite of the fact that air quality has been a major national concern for many years measures have not been taken to develop a methodology for evaluating the relative merit of air quality alternatives. The research to be presented explores the issue of relative air quality merits and develops a rating approach to determine the superior alternative. These measures have been developed and tested using pollution dispersion models and accounting for spatial and temporal patterns of ambient pollution by means of a discrete network of receptor points.
An example of program in the form of abstract machine
Authors: Mario R. Schaffner
Venue: Proceedings of the ACM annual conference (1973)

A computer approach has been shown in which programs describe hardware configurations, rather than software structures for a factory-configurated hardware.1 The programing language describes the processes in the form of abstract machines.2 This form constitutes a suitable user language, and at the same time is the machine language; thus, compilation is unnecessary. As an example, a numerical model for a hypothetical fluid is shown, where at each grid point the computation of the variables has the form [equation] where fi are parameters, functions of time, that characterize the model. Slides will describe the connotations of this abstract machine (the entire description can be written in two punch cards), and then will show different time evolutions and in stability for different patterns of the parameters and initial values, obtained with a first implementation of this type of computer.
A recovery mechanism for modular software
Authors: Flaviu Cristian
Venue: Proceedings of the 4th international conference on Software engineering (1979)

When an exception occurs, the state of a system is damaged : further processing may cause additional exceptions. Under some hypotheses concerning the system structure we give an a priori estimate of the damage caused by exceptions. Based on this estimate we propose a recovery strategy and a recovery mechanism.
Optical storage of page images and pictorial data - opportunities and needed advances in information retrieval
Authors: William R. Nugent, Jessica R. Harding
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

We describe two current development projects at the Library of Congress using high-density optical storage, both of which require more advanced and improved computer-based information retrieval methodologies than existing bibliographic retrieval systems. A much greater emphasis will be placed on the information content of the articles rather than on the broad subject categories in general use for computer retrieval citations to book materials. Needed approaches include the linking of selected external reference sources and the extraction of character-encoded index information from the page images by OCR techniques. Our position is that extremely high density storage of articles in a single subject area requires a finer resolution in the retrieval system accessing the material. A single side of a 12-inch digital optical disk, for example, can hold 15 years of the Journal of the ACM.