ppxscal/embedding_network huggingface dataset:
The computer programmer as the model of the worker in the automated office
Authors: Paul Licker
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

This paper will explore the question of the type of work that is most easily handled by office automation and the effects the large-scale introduction of office automation is expected to have on the kind of work that is actually performed by individuals working in offices. Until now, a hinderance to profitable speculation in this area has been the lack of a model of office work in general. A number of individual researchers have looked at various types of worker (clerical, managerial, professional, executive) but none has proposed a model of office work particularly relevant to the automated office. In this paper we will look at the appropriateness of adopting the computer programmer as the model for the future office worker. The implication from adopting this model is that we can examine the experiences of computer programmers over the past twenty-five years and extrapolate this into the automated office workplace.
Converting a swap-based system to do paging in an architecture lacking page-referenced bits
Authors: Özalp Babaoglu, William Joy
Venue: ACM SIGOPS Operating Systems Review (1981)

This paper discusses the modifications made to the UNIX operating system for the VAX-11/780 to convert it from a swap-based segmented system to a paging-based virtual memory system. Of particular interest is that the host machine architecture does not include page-referenced bits. We discuss considerations in the design of page-replacement and load-control policies for such an architecture, and outline current work in modeling the policies employed by the system. We describe our experience with the chosen algorithms based on benchmark-driven studies and production system use.
Information retrieval II: The chaining technique for associative sentence retrieval
Authors: L. C. Clapp
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

Most METHODS of information retrieval attempt to extract, from a file, only single items which completely satisfy a search request. When the input question is highly restrictive, no item in the entire file will be able to match the question, but a satisfactory answer can often be formed by a connected sequence of items, each corresponding to a distinct portion of the search request. This method reduces to the common IR algorithms as the question is broadened. Although the concepts that will be described in this paper could be applied to any general information retrieval task (e.g., document retrieval), we will discuss its application as a method of sentence retrieval which might be part of a general question-answering program.
Incorporation of multiaccess links into a routing protocol
Authors: Radia Perlman
Venue: Proceedings of the eighth symposium on Data communications (1983)

Conventional routing protocols and algorithms work most efficiently on sparsely connected networks. Network topologies today include multiaccess links which include hundreds of nodes, all of which are capable of direct communication with each other. Some of these multiaccess links have broadcasting ability. This paper presents protocols and algorithms for efficiently dealing with the characteristics of various types of multiaccess links, when they are included as links in a general topology net.
The role of the user services representative in an academic computing environment
Authors: John E. Bucher
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

Many frustrations confront users in an academic computing environment. One of the strongest is felt when users try to communicate effectively with the computing center's staff. At the Kansas University Academic Computer Center, we have created the position of User Services Representative (USR) to ameliorate this problem. Among other responsibilities, this person functions as an ombudsman, and provides users with an &ldquo;open door&rdquo; to the services and facilities of the Computing Center. Although this person is not actually classified as a consultant, s/he coordinates this activity, and tries to match up special consulting needs with the most appropriate staff member. Additionally, the User Services Representative handles telephone consulting and acts as a distribution center for questions and problems of great diversity. This helps facilitate greater intra-staff communication too, which can be a real problem with a staff of 50-75 people. In the 15 months since this position was initiated many improvements have been noticed in user assistance services, including shorter waiting lines for consulting and more effective dedicated consulting sessions. This paper will detail the activities of the User Services Representative and show how the position helps to improve communication channels in an academic computing environment.
Automated software control
Authors: James P. Skinner
Venue: Proceedings of the 1977 annual conference (1977)

A time sharing system to provide development and quality assurance personnel a means of tracking the progress of software changes through the release cycle and to produce core image files for testing and release. The system consists of a command language, index sequential data base, assembler, binder and loader. The data base records those interrelations necessary to produce software systems from symbolic updates to source modules. It provides the developer a core image for testing that represents the appropriate quality level and current changes, and software control the means of constructing a release limited to those functions specified in the product schedule.
Simplification of radical expressions
Authors: B. F. Caviness, R. J. Fateman
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In this paper we discuss the problem of simplifying unnested radical expressions. We describe an algorithm implemented in MACSYMA that simplifies radical expressions and then follow this description with a formal treatment of the problem. Theoretical computing times for some of the algorithms are briefly discussed as is related work of other authors.
SIGCSE (Paper Session)
Authors: David L. Cohn, Robert B. Kolstad, Stefan Feyock, Thomas Ford, David Moursund, D. R. Chand, R. Techo
Venue: Proceedings of the 1976 annual conference (1976)

This session is concerned with new ideas and experiences in computer science education. The session will focus on the following questions: (1) How effective a tool is computer programming for motivating minority junior high school students toward professional careers in engineering, computer science, and other related areas? (2) Can different learning styles be detected? Can programming courses be designed to take these styles into account? (3) Should we stop teaching long division, and instead supply all elementary school children with calculators? (4) Can a viable computer science program in a business school be designed by examining the professional needs of the local business community?
A hands-on approach to teaching systems programming
Authors: Malcolm G. Lane
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

Historically, the teaching of systems programming has been undertaken using a variety of techniques. In order to provide students with the best possible learning experience, an approach which allows the students &ldquo;hands-on&rdquo; experience on some computer system is desirable. Such a &ldquo;hands-on&rdquo; approach has proved to be successful in a course in systems programming for over three years at West Virginia University. The approach is discussed in detail and the results of the three years' experience using this approach on an IBM 1130 computer system are presented.
PIRL&mdash;Pattern Information Retrieval Language&mdash;design of syntax
Authors: Sidney Berkowitz
Venue: Proceedings of the 1971 26th annual conference (1971)

The design of a pattern manipulation language, PIRL, is described here. PIRL can handle arbitrary, oriented patterns (i. e., subgraphs) of lists, nodes, numeric and Hollerith data on many levels of abstraction in a concise, legible manner. Patterns and lists may be inserted, retrieved, deleted, indexed, compared, named, intersected, united, and complemented. Pattern names may be referenced to a lower level of abstraction and pattern forms may be quantified. PIRL should be of considerable value in the solution of certain problems in information retrieval, linguistic analysis, scheduling simulation, and pattern recognition.
QAS*APL: A step towards program-free interactive problem solving
Authors: Jim Goff, Milos Konopasek
Venue: ACM SIGAPL APL Quote Quad (1979)

QAS*APL is a non-procedural, very high-level language for work with mathematical models. It is a Question-Answering System that has as its central concept the MODEL, which is defined by a set of algebraic or other equations pertinent to a particular subject. The system solves models for any consistent set of input variables. It makes possible the direct, machine execution of an unmodified set of equations, eliminating end-user programming. The system's front end is a terse query language which operates against a backdrop of implicit, automatic program generation. The paper demonstrates the need for and advantages of a systematic and general approach to the given class of problem.
An on-line interactive system for studying acceptable sampling plans
Authors: Herman D. Hughes
Venue: Proceedings of the ACM annual conference (1973)

In this dissertation an on-line interactive system for generating and analyzing various acceptance sampling plans is presented. This real-time sampling plan system utilizes a series of algorithms to perform the necessary functions for generating information pertinent to single, double, and multiple sampling plans. These algorithms along with other special programming considerations allow for fast generation of the following information relative to single, double, and multiple sampling plans: (1) the operating characteristic (OC) curve, (2) the average outgoing quality (AOQ) curve, (3) the average sample number (ASN) curve, (4) the average total inspection (ATI) curve, (5) multiple plots per graph, (6) the sample size(s), (7) the acceptance number(s), (8) the rejection number(s), (9) the average outgoing quality number (AOQL), (10) the lot size, (11) the lot quality (p' 95' p' 50' p' 10), and (12) the alpha and bet&adot value&sdot for a specified AQL and LPTD. This information for single, double, and multiple sampling plans can be generated by using either the Poisson, binomial, or hypergeometric distribution. Two procedures are available to the user for generating information pertinent to a particular sampling plan. The first procedure enables the user to generate single, double, and multiple sampling plans given the acceptance quality level (AQL) and the lot tolerance percent defective (LTPD). This procedure allows for the generation of two types of sampling plans: one plan minimizes consumers' risk and the other plan minimizes producers' risk. The second procedure permits the user to specify the sample size(s), the acceptance number(s), the rejection numbers (in case of multiple sampling plans), the lot size, and the percent defective used to scale the x-axis. The system is designed for use by a person with various backgrounds in programming or statistical quality control. Several examples of its use are given to illustrate one or more important points. The sampling plan system was found to be an acceptable means of generating and analyzing various sampling plans on a real-time basis.
Exception handling in PL/I
Authors: M. Donald MacLaren
Venue: ACM SIGOPS Operating Systems Review (1977)

The PL/I language's facilities for handling exceptional conditions are analyzed. The description is based on the new PL/I standard. Special attention is given to fine points which are not well known. The analysis is generally critical. It emphasizes problems in regards to implementation and structured programming. A few suggestions for future language design are offered.
On the division of police districts into patrol beats
Authors: Saul I. Gass
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Recent work done by the Science and Technology Task Force of the President's National Crime Commission included several studies and recommendations which deal with the application of digital computers to the law enforcement and criminal justice fields.1 A study by C. Walston reviewed the present range of police computer applications; work by the author and others described an approach to the development of a police command and control system; while work by R. Finkler and others described a computer-based criminal justice information system. Early in the Commission's efforts it became apparent that the area of crime is characterized by few reliable statistics and even fewer analytically based rules of procedure. It is the purpose of this paper to bring appropriate problems within the law enforcement area to the attention of the analytical community of computer personnel and to describe an approach to solving one of these problems. The area of concern can be termed police management decision-making and can be structured into two general problem areas: planning and operations. As we shall see, the range of the specific problems covers a wide gamut of Operations Research/Management Science activities. However, even though some of the problems &ldquo;look familiar&rdquo;, little has been done to develop an analytical structure for these problems within the field of law enforcement.
An investigation of the relative efficiencies of combinators and lambda expressions
Authors: Simon L Peyton Jones
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

In 'A New Implementation Technique for Applicative Languages' [Tu79a] Turner uses combinators to implement lambda expressions. This paper describes an experimental investigation of the efficiency of Turner's technique compared with more traditional reducers.
Large scale gymnastics championships: An on-line interactive collection and analysis of scores
Authors: Daniel L. Bernitt, James S. Walton, Frederick S. Bader
Venue: Proceedings of seventh international conference on APL (1975)

APL has proved to be a magnificent and simple tool for the collection and analysis of the rather complicated scoring in large-scale regional, national or international gymnastics championships, a task previously done by teams of human scorers.
How to measure software reliability, and how not to
Authors: B. Littlewood
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

This paper examines critically, with a view to stimulating a discussion, some concepts which have been used in early work on software reliability measurement, and suggests improvements and areas of potentially fruitful future research. It is proposed that hardware-motivated measures such as mttf, mtbf should not be used for software without justification, and it is shown that such justification may be lacking under quite unexceptionable circumstances. Alternative methods of measuring software reliability are proposed. Emphasis is placed upon differentiating between two concepts of software reliability which are often blurred in the work of previous authors. These are, on the one hand, the reliability of the program-as-it-is (the number of bugs it contains), on the other, the reliability of the program-as-it-performs (failure rate, distribution of time to next failure, etc.). It is argued that the latter, here called operational reliability, is the one we should use. Measures of operational reliability which avoid use of mttf, etc., are proposed. A case is made for software engineers adopting a Bayesian stand-point:both in the interpretation of probability statements and in inference procedures. It is suggested that reliability modelling solely in terms of failures (or number of bugs) is unnecessarily naive. Interest really centres upon the consequences of failures as much as on their frequency. It is proposed that more effort be devoted to the development of models which incorporate a cost (or utility) structure. Finally, brief consideration is given to the question of program structure. The enormous success of hardware reliability theory, in combining component reliabilities with knowledge of system sturcture, must be emulated for software. Unfortunately, software structure does not easily lend itself to such an exercise. Some existing models are considered.
A model of computation for VLSI with related complexity results
Authors: Bernard Chazelle, Louis Monier
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We propose a new model of computation for VLSI which is a refinement of previous models and makes the additional assumption that the time for propagating information is linear in the distance. Our approach is motivated by the failure of previous models to allow for realistic asymptotic analysis. While accommodating for basic laws of physics, this model tries to be most general and technology-independent. Thus, from a complexity viewpoint, it is especially suited for deriving lower bounds and trade-offs. We present new results for a number of problems including fan-in, addition, transitive functions, matrix multiplication, and sorting.
Data-rate constrained lattice vector quantization: a new quantizing algorithm in a rate-distortion sense
Authors: P. Onno, C. Guillemot
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper describes an image coding scheme using lattice vector quantizers where the emphasis is put on a new lattice vector quantization approach. The adaptive signal decomposition uses wavelet packets which allow to best match the decomposition to the signal non-stationary characteristics. The quantizers used here are data rate constrained lattice vector quantizers. A classical rate-distortion algorithm [Ramchandran and Vetterli, 1993] based on two nested optimization processes allows to jointly optimize transformation and quantization and is used as a first step in the quantization procedure described here. It allows to define in each subband the lattice spacing (or scaling factor) minimizing the overall distortion for a given bit rate and to choose by a pruning algorithm the best structure of decomposition. An additional procedure developed here allows (by exploiting the lattice properties) to project a vector on a lattice point providing a better rate-distortion tradeoff. In addition, a new partitioning of the vector space allowing to divide the source of vectors into three sub-sources is introduced in order to improve the coding efficiency. In the rate distortion plane, this new quantization procedure brings a significant improvement of about 0.5-0.6 dB with respect to the classical rate-distortion algorithm.
A graphics aided drafting system (GRAD)
Authors: C. Alaimo
Venue: Proceedings of the 4th Design Automation Conference (1967)

The standard Bell System schematic drawing package, as the name implies, consists mainly of a series of schematic drawings which describe functionally a circuit or system of circuits being developed. In addition to this pictorial information, the package also provides other information which clarifies the descriptions of the circuits. Among this additional information is: A. The apparatus figures - which are a tabular listing, according to equipment unit, of all of the circuit packs, components, etc., that enter into the make-up of the overall circuit. B. The apparatur index - a tabular description, according to function or component type, of all the circuit packs, components, etc., which comprise the circuit. C. Other sections which describe the composition of circuit packs, connector information and the interrelations between major functional blocks of a circuit.
Experimental analysis of a GPSS simulation of a student health center
Authors: F. Paul Wyman, Gerald Creaven
Venue: Proceedings of the 5th conference on Winter simulation (1971)

Simulation was found to be a useful device in studying the effects of varying service capacity in a medical clinic. The intuitive expectation of an inverse relationship between service capability and waiting time was confirmed. The anticipated main effects were supported while all but one of the interaction effects were negligible. A non-linear relationship between service capacity and waiting time was estimated by regression. This relationship was used to construct a decision table with alternatives and cost effects which can be used for decision-making under many conditions and constraints within the Health Center administration's decision space.
TECGRAPH- Technical Computer Graphics: A program package for computer aided design
Authors: Thomas P. Koehler, Atlanta Georgia
Venue: Proceedings of the ACM 1980 annual conference (1980)

The purpose of this puper is to give a brief survey about the theoretical background and the capabilities of the TECGRAPH system for computer aided design in engineering. The concept of this new program package is designed to help engineers doing routine work such as plotting and calculations. By using a new concept for the description of the objects and for the processing of the data developments for numerous applications in engineering are possible. The data description works strictly according to set theory. Thus, it is very easy to learn how to describe an object. Moreover, the use of the program is quite simple. The only prerequisite is that the user should be able to imagine how the object looks. If he is not, he should at least have a rough draft. There is no computer knowledge necessary.
A discussion of CDLI, a computer description language and associated design aid systems
Authors: C. V. Srinivasan
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

CDLI is a formal language for describing hardware and software computing systems in various stages of design. As a formal language to talk about systems of this kind, CDLI provides a linguistic basis to consider machine aided solutions to a variety of design problems. In the context of CDLI, we are envisioning at present systems for design documentation, data retrieval, editing, design analysis, simulation and eventually automatic synthesis. The creation of a powerful and flexible descriptive data base is the key conceptual and technical problem that we must solve to implement these systems. The features introduced in the description language, CDLI, and the kinds of processors that are being developed for the documentation system are intended as solutions for this problem. The system so created will give us a point of departure for further explorations in this area through experimentation. CDLI is a complex language. The appropriateness and the quality of our proposed solutions can receive a definitive assessment only after they are built and used in conjunction with various systems for computer design. Construction and experimentation are therefore crucial parts of our research in this area. Presently, we are in the process of implementing a Design Documentation System based on the description language CDLI.