ppxscal/embedding_network huggingface dataset:
The UW-Whitewater management computer systems program
Authors: Jacob Gerlach, Iza Goroff
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Employers of students trained in computer science and data processing fall largely in three categories: manufacturers of computer equipment, software houses, and finally end users of the computers. Of these categories, most employment opportunities are in the third category, the end user. For each employer there is a range of positions from systems programmer to applications programmer to business systems analyst. Figure 1 shows the organization chart of a medium sized systems and data processing area in a company that manufactures consumer products. Of the sixty five positions which would require a degree in computer science or data processing, in at most seven (perhaps only two) of these positions would the traditional computer science graduate be preferred (if the employer had a choice). At the University of Wisconsin-Whitewater our program is aimed at the large number of positions where a business background is helpful. In addition to introductory programming we require three programming courses, two analysis and design courses, a course in hardware and software selection and a course including data base management. In addition, all students must have at least 15 hours of business courses including two accounting courses and a management course. Our graduates have the technical ability to be good programmers and/or systems analysts, and they have the business background so that they can talk to users in the users own language. In developing the major the faculty consulted outside business computing managers and the ACM Information Systems Curriculum1. Many of the courses in the major are very close to those specified in the ACM curriculum.
The undergraduate education of medical computer scientists
Authors: Joel Stutman, Robert S. Tannenbaum
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

The need for true communication between health professionals and computer professionals is expressed. The range of applications of computers in the health care system is discussed. The two programs designed to train medical computer scientists are described in terms of their emphasis on different types of applications. Their respective histories and curricula are related. It is concluded that what is needed is a curriculum which covers all types of applications with close to equal emphasis and allows students the opportunity to go into applications of interest to them in depth via their individual projects, so long as they learn to communicate in all health areas with the relevant professionals.
An extensible file system for hydra
Authors: Guy Almes, George Robertson
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

An extensible file system has been designed and implemented for Hydra, an advanced capability-based operating system. This system demonstrates three notable contributions to subsystem design: - It provides a protected and efficient implementation via user-level code of functions ordinarily implemented as part of a conventional system's monolithic privileged section, - It provides practical solutions to two protection problems, the Modification Problem and the Confinement Problem, for users of the file system, and - It provides separation of mechanisms for data representation from mechanisms for protection and synchronization, thus allowing an extensible family of subfile systems to evolve. This paper treats the design and implementation of the Hydra File System and reflects on its implications for subsystem design and implementation.
Bristle Blocks: A silicon compiler
Authors: Dave Johannsen
Venue: Proceedings of the 16th Design Automation Conference (1979)

Standard LSI Design Automation systems are database management systems that aid the circuit designer by organizing the collection of submodules that comprise a chip. This type of file system usually does not aid in the actual computation of silicon layout, and can hinder a designer with program constraints that have little or nothing to do with silicon constraints. The Bristle Block system is an attempt to create a silicon compiler that will perform the majority of the implementation computation while placing a minimum set of constraints on the designer. The goal of the Bristle Block system is to produce an entire LSI mask set from a single page, high level description of the integrated circuit.
A programmer's interface to graphics dynamics
Authors: Joshua U. Turner
Venue: Proceedings of the 11th annual conference on Computer graphics and interactive techniques (1984)

The term &ldquo;graphics dynamics&rdquo; is used in this paper to describe a capability which permits the application programmer to specify a relationship between various graphics input devices and aspects of the graphics output presentation. Subsequent use of the input devices results in continuous real-time changes to the picture. An experimental graphics system is described, in which a powerful programmer's interface to graphics dynamics was implemented. This interface appears suitable for use as an extension to any of the existing standards and standards proposals, including, CORE, GKS, and PHIGS.
An experimental implementation of the kernel/domain architecture
Authors: Michale J. Spier, Thomas N. Hastings, David N. Cutler
Venue: ACM SIGOPS Operating Systems Review (1973)

As part of its effort to periodically investigate various new promising concepts and techniques, the Digital Equipment Corporation has sponsored a research project whose purpose it was to effect a limited implementation of a protective operating system framework, based on the kernel/domain architecture which has increasingly been propounded in recent years. The project was carried out in 1972, and its successful completion has led to a substantial number of observations and insights. This paper reports on the more significant ones, specifically: 1) the techniques used in mapping a conceptual model onto commercially available hardware (the PDP-11/45 mini-computer), 2) the domain's memory mapping properties, and their impact on programming language storage-class semantics, 3) this architecture's impact on the apparent simplification of various traditionally-complex operating systems monitor functions, and 4) the promise this architecture holds in terms of increased functional flexibility for future-generation geodesic operating systems.
The evaluation, classification and interpretation of expressions
Authors: W. H. Burge
Venue: Proceedings of the 1964 19th ACM national conference (1964)

This paper is concerned with certain expressions which have values or which describe things, which will be called 'applicative expressions' (or AEs). This paper is divided into two parts: the first part describes one method of evaluating AEs; the second part describes AEs which are equivalent to regular expressions and Backus Normal Form expressions, and interprets these expressions in several different ways. They are interpreted as languages, recognizers for membership of a language, programs, state diagrams and sequential circuits. Applicative expressions are structured objects and should be distinguished from languages. Their operator-operand structure is always represented in the same way and is independent of the operator and operand.
DELTA - the Universal Debugger for CP-6
Authors: Carol K. Walter
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

DELTA is the Universal Debugger for CP-6. CP-6, a general purpose communications-oriented operating system, is made up of two environments: host and communications. These two environments each have their own operating system and run on different CPUs. DELTA allows the user to symbolically debug programs written in any language or combination of languages in either environment. DELTA also allows symbolic debugging of the host operating system, the communications operating system, and the language and utility processors for each environment. In addition, DELTA allows symbolic patching of both operating systems and the language and utility processors providing a timely field support for CP-6.
A Powerful Modular Computer On A Universal Building Module
Authors: Svetlana P. Kartashev, Steven I. Kartashev
Venue: Proceedings of the 1978 annual conference (1978)

This paper develops basic principles for constructing instruction sets for two modifications of a modular computer distinct from each other in both the width of the primary memory and the increment h in which consecutive computer sizes are formed. It is shown that since modular computers are assembled from universal modules using pin-to-pin connections only, in constructing an instruction set one has to rely on the modular control organization principle which provides selective activation and deactivation of the same logical circuits in different modules without violating the principle of circuit identity. The paper develops new complex instructions which speed up computations.
On Observing Shape from Defocused Images
Authors: A. Mennucci, S. Soatto
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Accommodation cues are measurable properties of an image that are associated with a change of the geometry of the imaging device. To what extent can three-dimensional shape be reconstructed using accommodation cues alone? This question is fundamental to the problem of reconstructing "shape from focus" (SFF) and "shape from defocus" (SFD) for applications in microscopy, image restoration (de-blurring) and visualization. We address it by studying the observability of accommodation cues in an analytical framework that is independent of the imaging device.
Yes! high level languages should be used to write systems software
Authors: James J. Horning
Venue: Proceedings of the 1975 annual conference (1975)

It has frequently been remarked that it is easier recognize &ldquo;high level&rdquo; languages than to define the concept. For the purposes of this debate, however, I think that we agree that a language is high level to the extent that it discourages (forbids) the specification of machine details (register numbers, absolute addresses, op codes, word-packing, etc.) as a routine part of program composition and low level to the extent that it encourages (requires) such specification. (Note that, by this definition, assembly languages occupy a position intermediate between machine languages and compiled languages.) Thus, I take the point at issue to be: &ldquo;To what extent is it desirable for the system programmer to specify machine details?&rdquo;
Transitive orientation in 0(n2) time
Authors: Jeremy Spinrad
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

This paper presents an algorithm for the transitive graph orientation problem which runs in 0(n2) time. The best previous algorithms for this problem required 0(n3) time. Transitive orientation is the slowest part of several graph recognition problems, so the new algorithm immediately improves the complexity of algorithms for recognizing comparability graphs, permutation graphs, and circular permutation graphs.
ARPEGE: Simulation of an air pollution crisis
Authors: M. A. Greene, A. Hochhauser, M. J. Reilly, J. F. Sautin, A. S. Walters
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Air pollution episodes represent a major environmental problem in urban areas. The high concentration of pollution sources in such areas results in dangerously high levels of air pollution during periods of poor weather conditions. The avoidance of hazardous levels depends upon rapid and decisive actions by responsible people together with cooperation of an informed public. There is a need for educational materials which treat effectively the problem of air pollution episodes. The Air Pollution Episode Game is an educational tool which treats the relevant aspects of urban life during a period of high air pollution. The participants assume various realistic roles and receive information and make decisions characteristic of those roles. The heart of the game is a computer simulation program which calculates meterology, emissions, air quality, adverse effects, etc.
Some current issues in data description
Authors: W. C. McGee
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

The computer industry is currently devoting considerable time and energy to the subject of data description. Most software systems produced today provide some form of data description facility. Computer users and vendors have banded together to study data description; two prominent examples are CODASYL which has two committees working on data description languages, and the ACM Special Interest Group on File Definition and Translation (SIGFIDET) which was organized expressly to study data description problems. Interest in data description has even extended to standards groups: The American National Standards Institute (ANSI) and European Computer Manufacturers Association (ECMA) have both taken a preliminary look at the feasibility of standardizing data description languages. The purpose of this note is to explore briefly four current problems in data description: (1) the multiple data description problem, (2) the problem of &ldquo;physical&rdquo; data description, (3) the distinction between &ldquo;logical&rdquo; and &ldquo;physical&rdquo; data, and (4) the problem of a common or standard data description language. Before getting to these issues, however, it will be helpful first to review what is meant by &ldquo;data description&rdquo; and second to identify the principal reasons for making data descriptions.
Implementation of character string pattern matching on a multiprocessor
Authors: Maniel Vineberg
Venue: ACM SIGMOD Record (1977)

An algorithm to do pattern matching, a basic character string operation, is presented. The Programmable Algorithm Machine (PAM), a proposed special-purpose computer which will feature multiple processing elements and operate efficiently over a wide class of applications, is described. It is shown that the multiple processing elements of the PAM allow concurrent execution of independent operations both in a special case of the pattern matching algorithm, where the string sizes (lengths) are known at compile time, and in the general case, where the sizes are not known.
Future dependent events, as shown by the example of SLAM
Authors: Heimo H. Adelsberger
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Random events in discrete simulation models are classified in ordinary and future dependent events. An event occurring between to and T is classified as an ordinary event, if the probability distribution for the realization in time is known at time to. If changes of the system after time to can affect the probability distribution of an event, it is called a future dependent event. To show the difference we give two examples. In contrary to ordinary events future dependent events are not well supported by the currently most used languages like GPSS, SIMULA, SIMSCRIPT and SLAM. In taking SLAM as an example, we are going to demonstrate, how to adapt a simulation language to be able to handle future dependent events with as slight an effort as possible.
Evaluating computing system changes by means of regression models
Authors: Gerald Waldbaum
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

This paper describes how a regression model of the Research Center's APL system was constructed and used for evaluating system changes. The regression methodology that is generally used for performing such an analysis is believed to have been expanded by the introduction of multiple regression equations for estimating the cumulative distribution function of a performance variable. A model is developed which shows that the size of the workspace, but not the number of workspaces in core, significantly affects the performance of the Research Center's system. In particular, the model indicates that increasing the workspace size from 5 to 7 tracks causes 11 percent of all requests to be degraded by at least 0.4 seconds under mean load conditions.
Verification of a methodology for designing reliable communication protocols
Authors: Huai-An Lin, Ming T. Liu, Charles J. Graff
Venue: Proceedings of the eighth symposium on Data communications (1983)

In this paper we present a new methodology for designing reliable communication protocols. This methodology enhances communicating processes with a synchronization mechanism so that they can detect and resolve the errors caused by collisions automatically. The major advantages of this new methodology include: (1) the &ldquo;state explosion&rdquo; problem involved in protocol validation is alleviated; and (2) the burden of handling errors due to collisions is removed from the protocol designer. There is a need to verify that this methodology is applicable to arbitrary protocols. In this paper we also discuss the application of a program verification technique to this methodology.
Software quality assurance tools: Recent experience and future requirements
Authors: Kurt F. Fischer
Venue: ACM SIGMETRICS Performance Evaluation Review (1978)

The objective of software quality assurance (QA) is to assure sufficient planning, reporting, and control to affect the development of software products which meet their contractual requirements. To implement this objective, eight QA functions can be identified: 1. Initial quality planning 2. Development of software standards and procedures 3. Development of quality assurance tools 4. Conduct of audits and reviews 5. Inspection and surveillance of formal tests 6. Configuration verifications 7. Management of the discrepancy reporting system 8. Retention of QA records The purpose of this paper is to document experiences gained in the use of selected QA tools that perform some of the above functions, to discuss lessons learned, and to suggest future needs.
An affordable approach to an architectural computer system
Authors: Donald E. Bergeson, Robert Babbin
Venue: Proceedings of the 14th Design Automation Conference (1977)

Analysis of information flows, and a review of periodically performed tasks in an architect's office, indicate many functions that could be expedited and enhanced with the aid of a major restructuring that would include a carefully planned, modular, computer system. Staged investment in hardware and software is recommended. A conservative approach indicates computer utilization first in record keeping, then in engineering and text manipulation, and finally in graphics and simulation.
Automatic batch processing in multilayer ceramic metallization
Authors: Neil DalCero
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes advances in the batch processing automation of multilayer ceramic metallization manufacturing. The metallization is a plating process that deposits electroless nickel and electroless gold on conductive molybdenum features. The plating operation involves the processing of up to 72 multilayer ceramic substrates in one group. Each product group automatically moves through 35 sequential chemical operations to complete the process. As a product is completed, the process parameters are monitored and stored by computers (IBM Series 1). In addition, the product transporters are controlled and monitored by computers. Other features of the system include: flexibility to incorporate process changes without affecting production, capability to increase capacity, common product handling, and automatic tracking for manufacturing.
A language for the description of digital computer processors
Authors: John A. Darringer
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

This paper discusses the need for an algorithmic language for writing behavioral descriptions of digital computer processors and proposes an Algol-like candidate. It also discusses programs that simulate and automatically implement processors described in the language.
Data physics - an unorthodox view of data and its implications in data processors
Authors: R. R. Korfhage, W. H.E. Day, L. L. Beck, W. F. Appelbe
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

It is an appropriate time to step back and examine the foundations of our field - to determine how the various approaches and fragmentary principles fit together. The approach that we currently call &ldquo;data physics&rdquo; has this as its objective. While our work clearly is based on that of others in the field, our concepts may seem unusual to the practitioner. We propose a broad and esoteric view of the universe of information - a view that must jibe with the everyday world of libraries and databases, but which may ultimately be stated in terms quite different from those that the practitioner normally uses. We undertake four tasks in this paper: to define the data physics approach, to state the important issues, to propose a model of the information universe, and to discuss the implications of this model.
Logical correctness by construction
Authors: S. M. Leinwand
Venue: Proceedings of the 19th Design Automation Conference (1982)

A novel methodological approach to the design of large-scale-integrated systems proposed correctness by construction. By using a restricted repertoire of admissible combination rules, it is possible to guarantee that only designs suitable for implementation are generated. This paper addresses the complementary issue of logical correctness by construction - prohibiting "meaningless" constructs from occurring. The presented approach is based on defining &ldquo;meaning&rdquo; in terms of a catalog of standard operators. Admissible compositions are restricted so that only constructs belonging to this catalog may be generated. This approach is mainly intended for the data-path of digital systems. There, repetitive and regular compositions provide a suitable environment for using catalogs of operators. The paper focuses on the description of operators relevant to the design at Register Transfer Level. Manipulation rules are used for describing their properties. Rules basic to logical correctness by construction are shown to be: contractions, expansions and transformations into canonical forms.
Analysis of a level algorithm for preemptive scheduling
Authors: Shui Lam, Ravi Sethi
Venue: ACM SIGOPS Operating Systems Review (1975)

Muntz and Coffman give a level algorithm that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors. A variation of their algorithm is adapted for processors of different speeds. The algorithm is shown to be optimal on two processors for arbitrary task systems, but not on three or more processors even for trees. Taking the algorithm as a heuristic on m processors and using the ratio of the lengths of the constructed and optimal schedules as a measure, we show that, on identical processors, its performance is bounded by 2 - 2/m. Moreover 2 - 2/m is a best bound in that there exist task systems for which this ratio is approached arbitrarily closely. On processors of different speeds, we derive an upper bound of its performance in terms of the speeds of the given processor system and show that @@@@1.5m is an upper bound over all processor systems. We also give an example of a system for which the bound @@@@m/2 @@@@2 can be approached asymptotically, thus establishing that the @@@@1.5m bound can at most be improved by a constant factor.