ppxscal/embedding_network huggingface dataset:
Is there really trouble with UNIX?
Authors: Lorenzo De Leon, William G. Harris, Martha Evens
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Donald Norman has claimed that UNIX has cryptic and inconsistent command names. As Michael Lesk has remarked, the lack of objective data makes it difficult to evaluate the significance of Norman's criticisms. In an effort to explore this controversy we taught one group of novice users the UNIX command language and another group an English-based command language (NUIX). The number of errors and calls for on-line assistance were compared. The subjects in this study were 22 high school women with no formal exposure to computers. The results reveal that the UNIX group made fewer errors than the NUIX group in two training sessions a week apart. Although calls for on-line assistance for the two groups in the first session were comparable, the UNIX group made over twice as many calls for on-line assistance in the second session as the NUIX group. Our findings suggest that even though the UNIX command language may not be harder for novice users to learn, it is probably more difficult for them to use.
A generalized system for university mathematics instruction
Authors: Robert L. Smith, Lee H. Blaine
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

EXCHECK is a system for developing mathematically-based CAI courses. It is currently being used at Stanford University to teach a college-credit course in axiomatic set theory The design of this system had several goals. First, we wanted an instructional system that would provide a semantic base for our work on processing natural language and computer-generated audio. Axiomatic mathematics fits this description in that the underlying semantics is relatively well understood, but many of the interesting problems of natural language are also involved in the informal language of mathematics and the informal expression of mathematical proofs. Second, we recognized that traditional proof checkers were inadequate for teaching mathematics, or for that matter, introductory logic. People understand mathematical concepts and arguments at a level much higher than the traditional formal systems of mathematical logic. Finally, we designed the EXCHECK system to be an extensible system in which other curricula could be implemented with incrementally less work.
A linear-time heuristic for improving network partitions
Authors: C. M. Fiduccia, R. M. Mattheyses
Venue: Proceedings of the 19th Design Automation Conference (1982)

An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To deal with cells of various sizes, the algorithm progresses by moving one cell at a time between the blocks of the partition while maintaining a desired balance based on the size of the blocks rather than the number of cells per block. Efficient data structures are used to avoid unnecessary searching for the best cell to move and to minimize unnecessary updating of cells affected by each move.
Validation criteria for computer system simulations
Authors: Toby J. Teorey
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

Validation of computer system simulation models is a common concern of both the programmer/analyst and the decision maker. This paper addresses the question of what are the major characteristics of the empirical aspects of validation and how one might carry out such a validation process for complex computer system models. Validation is described in terms of verification of the authenticity of the random number and random variate generators and of the independent variables established for the model, a proper choice of dependent (response) variables to observe in both the simulation model and the actual system itself (i.e., two sets of data), a choice of statistical tests for comparing their distributional properties, and the ability to predict system performance based on future changes in the actual system configuration. The concepts of validation are clarified through the example of an actual detailed model constructed for the input/output subsystem for a Burroughs B6700 computer. A validation process is proposed which specifies data that should be collected from the simulation model, which relates experiences with obtaining the coordinate live test data from the actual system under consideration, and finally shows how statistical tests can be applied to verify or reject the hypothesis that both sets of data result from the same population. Empirical data is presented to aid in the understanding of the concepts.
Computing integrated costs of sequences of operations with application to dictionaries
Authors: P. Flajolet, J. Françon, J. Vuillemin
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We introduce a notion of integrated cost of a dictionary, as average cost of sequences of search, insert and delete operations. We express generating functions of these sequences in terms of continued fractions; from this we derive an explicit integral expression of integrated costs for three common representations of dictionaries.
An office study: Its implications on the understanding of organizations
Authors: Gerald R. Barber
Venue: Proceedings of the second ACM-SIGOA conference on Office information systems (1984)

The results of an office study are presented. The goals of the study were to determine some parameters of the problem solving and knowledge level processing that occurs in a particular organization. The problem solving processes in the organization are described and the relationship between these problem solving processes and some characteristics of the knowledge used to solve the problems is discussed. In addition we describe the impact exceptions have on the evolution of the organization and identify two mechanisms that help the organization adapt to change. The implications of the results of the study on the understanding of organizations are discussed. Areas of further study are described.
Troika for architectural planning
Authors: Clifford D. Stewart, Kaiman Lee
Venue: Proceedings of the 1971 26th annual conference (1971)

Architects must willingly experiment with new techniques. We believe that the architect and computer, in partnership, is the best approach to reach this goal. The amount of available information has increased several fold over the past decade. At the same time, the architect's professional responsibility has become multidisciplinary. While it is impossible for him to be knowledgeable in all disciplines, he must see that all available information is considered and integrated into the design. It is here that the computer can help.
Complexity of decision problems based on finite two-person perfect-information games
Authors: Thomas J. Schaefer
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

We present a number of simply-structured combinatorial games for which the problem of determining the outcome of optimal play is complete in polynomial space&mdash;a condition which gives very strong assurance that these problems are hard. In addition to proving this completeness property for some particular games, we introduce a general technique for deriving games complete in polynomial space from NP-complete problems.
Predecessor machines and regressing functions
Authors: John C. Warkentin, Patrick C. Fischer
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

A predecessor machine is a random-access machine with a predecessor operation (i.e., an instruction which subtracts 1 from the contents of a memory cell), but with no operation which can increase the contents of a cell. A regressing function is a total function which never yields an output larger than the maximum of its inputs and a constant. Unlike the situation for random-access machines with a successor operation, it does not matter whether or not predecessor machines with loop control also have conditional transfer instructions. Furthermore, the class of functions computable by predecessor loop machines consists of exactly those regressing functions which are computable by a deterministic linear-bounded automaton. Some generalized predecessor machines are also considered.
Intelligent Assistance for Complex Systems
Authors: Tom Kehler, Avron Barr, Tim Finin, Peter Friedland, Mike Genesereth, Jim Miller, Mark Miller, Elliot Soloway, Harry Tennant
Venue: Proceedings of the ACM '82 conference (1982)

Complex systems are becoming more pervasive, yet in order for these systems to be used effectively, machine-based assistance is needed. With the advent of powerful personal systems it is anticipated that experts in various disciplines will become increasingly dependent on computational environments provided they are given a means of exploiting system capabilities. Traditional help systems have made use of canned text which is presented in response to typing a &ldquo;?&rdquo; or &ldquo;help&rdquo;. Many integral help systems embed canned hints at appropriate places in the program. Help is commonly provided via a scheme for accessing text files. Help files may be indexed by names such as MAIL, EDIT, LOGIN. Indexing of files is sometimes extended by permitting the user to type a sequence of words such as HELP MAIL READ to provide assistance on subcategories of a topic. Canned text can also be accessed hierarchically through use of a menu system. Most traditional help systems use one of the techniques described to provide assistance.
A simulation study of basic oxygen furnace operations
Authors: C. Jain, Phil McDermott
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The study was conducted in the Basic Oxygen Furnace shop of a reputed steel company. Data were collected over extended periods to establish the statistical characteristics of daily liquid iron {hot metal) production from the blast furnaces, the life of refractory-lined vessels of the Basic Oxygen Furnace, and the heat-cycle time. This simulation generates total daily hot metal production from the specified distribution and determines the optimum combination of hot-metal-only charge (regular heat) and mixed charge (scrap and hot-metal or pre-heat) that will maximize ingot steel production within a fixed time period. The simulation takes into account the heat-cycle-time, the charge-mix, the number of heating-vessels available on the oxygen furnace, and the time required for relining of vessels. An iterative process using a modified form of the simplex algorithm with two constraints have been utilized in the simulation study for maximizing output. The output includes, on a daily basis, the hot-metal produced in tons, the number of vessels available, the number of regular-heats and pre-heats required for maximum steel production, steel production in tons, the amount to be pigged, and the amount available for the next day. The simulation provides the decision-maker in charge of the BOF operation with an operational discipline to maximize productivity and a reliable indicator to justify installation of scrap preheating facilities. The entire simulation is written in Fortran IV, level G, and executed on an IBM 360 Model 65 computer.
A study of the first course in computers
Authors: William B. Gruener, Steven M. Graziano
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

This paper describes the first course in computers as taught at community colleges, colleges, or universities. The paper is divided into two major parts. The first part describes four Approaches and three courses. The four Approaches refer to the mix of language constructs and computer concepts; the Approaches underlie the presentation used in teaching the three courses. The second part discusses the frequency of occurrence of these courses based on a survey performed by Addison-Wesley.
Organization of programming languages for business information systems majors
Authors: Lillian N. Cassel
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

The course CS8 &ldquo;Organization of Programming Languages&rdquo; of Curriculum '78 is presented in the context of a program for Business Information Systems at a small business college. The applicability of this course to the Information Systems curriculum is considered. It is asserted that the successful inclusion of this course suggests the desirability of including the other core computer science material, as defined in Curriculum '78, in a program for Information Systems.
Software design using: SADT
Authors: Melvin E. Dickover, Clement L. McGowan, Douglas T. Ross
Venue: Proceedings of the 1977 annual conference (1977)

SADT TM, Structured Analysis and Design Technique, is a graphical language for describing systems. In this paper we indicate the role of SADT in software design. The graphical language provides a powerful design vocabulary in which a designer can concisely and unambiguously express his design. SADT is compatible with widely used contemporary design methodologies including Structured Design and the Jackson method.
Reversal complexity of counter machines
Authors: Tat-hung Chan
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

It has long been known that deterministic 1-way counter machines recognize exactly all r.e. sets. Here we investigate counter machines with general recursive bounds on counter reversals. Our main result is that for bounds which are at least linear, counter reversal is polynomially related to Turing machine time, for both 1-way and 2-way counter machines and in both the deterministic and the nondeterministic cases. This leads to natural characterizations of the classes P and NP, and hence of the P &equil;? NP question, on the counter machine model. We also establish reversal complexity hierarchies for counter machines, using a variety of techniques which include translation of Turing machine time hierarchies, padding arguments as well as more ad hoc counting arguments.
Multiple sequence random number generators
Authors: Joe H. Mize
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Many discrete event simulation models utilize a single random number sequence, regardless of the number of random variables included in the model. This paper illustrates the advantages of utilizing a unique random number sequence for each random variable. An example is included to demonstrate the resulting effects. A method is described for converting a single sequence random number generator to a multiple sequence generator. An application is included that compares simulation results obtained using a single sequence of random numbers to those obtained using a unique sequence for each random variable in the model.
A Self Managing Secondary Memory system
Authors: Manlio DeMartinis, G. Jack Lipovski, Stanley Y.W. Su, J. K. Watson
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

A Self Managing Secondary Memory (SMSM) organization is proposed herein, in which hardware directly assists the storage, retrieval and management of arbitrary length records on such devices as fixed head discs or charge coupled devices (CCD's). This paper emphasizes some of the techniques used to implement an SMSM system. In an SMSM, fixed length words are organized into variable length records, and these records are packed into a file. The first word of the record, a label, can be associatively addressed to mark the record. Marked records can be output, erased, or a word or a collection of words can be inserted after the label of such records. Erased words are shifted to the bottom of memory as data words are packed upward, so that new records or extensions of old records can be inserted at the bottom of the file. In this system, although the file appears to be a single one dimensional array of words, it is actually stored on a number m of n word circular access memories, such as CCD's or tracks of a fixed head disc. Larger systems are implemented by increasing m. The access time for the entire system depends only on n. This architecture is self-managing in that no directories are kept, nor is software garbage collection or allocation necessary. The hardware replaces these functions. This appears to be a desirable direction for secondary memory architectures to develop, with special application to their use in computer networks. This paper discusses techniques for implementing an SMSM. These techniques were developed as part of the Context Addressed Segment Sequential Memory (CASSM) system. This paper therefore also describes that part of CASSM that, by itself, forms a useful SMSM. It is hoped that these techniques will be useful in the development of a new class of intelligent secondary memories to meet present and future needs of computing systems.
Resource demanded paging and dispatching to optimize resource utilization in an operating system
Authors: T. C. Pewitt, S. Y. W. Su
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

This paper presents the design and an evaluation method of an operating system in which the optimization of system utilization is controlled by resource-demanded dispatching of program segments and dynamic scheduling of segment execution. The basic departure of the proposed system design from the operating systems currently in use is that system resources, especially I/O facilities, have much more control over the scheduling of task execution. Each system resource can actively request the dispatcher to activate program segments that use it, whenever the queue length of its associated queue falls under a dynamically adjustable threshold. Program tasks are broken into small segments and resource requirements of these segments are obtained by the system to control segment dispatching. The method of dynamic optimization of the proposed system is presented together with the method for testing the new control algorithms using an existing operating system.
Derivatives without tears in Algol 68
Authors: P. G. Craven
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

Algol 68 is a very suitable language for tackling problems which lie somewhere between numerical calculation and algebraic manipulation. An algorithm is presented which evaluates a function of n variables and its n partial derivatives using at most C.m operations, where m is the number of operations required to evaluate the function and C is a constant independent of n. By altering mode declarations, an ordinary piece of program text written to evaluate the function can be made instead to generate the expression tree required for calculation of derivatives.
Computing futures
Authors: Jean C. Bonney, A. Faye Borthick, Brenda L. Ferriero, Besty R. Little, Elizabeth Wettstein, Eva Michna
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Sometimes it is worthwhile to view college and university computing centers as an outsider. It is amazing that between large and small, public and private, one sees many similarities. Most colleges and universities have their own hardware or access to computing power from a local network. There are statistical and graphical packages to maintain, documentation to write and maintain, users to consult with on a first come/first serve basis and at a higher level, reading rooms and bookstores. There are many common software products such as BASIC, FORTRAN (Including WATFIV), PL/I, SPSS, APL, the Biomedical Data Programs, IMSL, CalComp, and of course STAR TREK. In 1974, I had the opportunity to participate in a working group considering the issue of future services of university computing centers at the Conference for Academic Computing Center Directors, Snowmass, Colorado. That working group left a lasting impression on me. Recently, I have spent many restless hours assembling my ideas of the future in computing services at my own institution and then planning the orchestration of the changes.
An appraisal of the Atlas supervisor
Authors: Derrick Morris, Frank H. Sumner, Michael T. Wyld
Venue: Proceedings of the 1967 22nd national conference (1967)

This report presents the performance of the Supervisor System used on the Atlas Computer at Manchester University, and describes some of the changes made as a result of our experience with the system. Although the machine is used jointly by I.C.T. Computing Service Division and the University Computing Service (U.C.S.), the figures presented are derived mainly from the U.C.S. use of the machine. We begin with an outline of the system and then describe its main sections in some detail. The ideas have been previously presented 1,2,3,4 but the system which has evolved is not described elsewhere. Logically the system is made up of several distinct parts which communicate through small well defined interfaces (the actual implementation is somewhat more complicated). It can be seen from Figure 1 that the path for a normal job is through the input supervisor and into the input well (which is at present magnetic tape). When the complete job has been input the input supervisor makes an entry in the job list, containing the information which the schedler uses to decide when to start the job. When the scheduler selects a job its job entry is passed on to the job assembler which organizes the loading of any magnetic tapes required by the job, and transfers the relevant compiler and input files into the main store.
A new approach to simulating stable stochastic systems
Authors: Michael A. Crane, Donald L. Iglehart
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A technique is introduced for analyzing simulations of stochastic systems in steady-state. Confidence intervals are obtained for a general function of the steady-state distribution.
Electrical considerations in the computer aided design of logic circuit interconnections
Authors: A. E. Ruehli
Venue: Proceedings of the 10th Design Automation Workshop (1973)

In the past, the physical interconnection problem for digital computer circuits has been solved mostly without considering the electrical properties of the wires or, equivalently, the transfer function of the interconnections. Further, the semiconductor devices, which represent another part of the system, are designed using network analysis computer programs with only secondary considerations given to the interconnections. The purpose of this paper is to establish general relations between the physical and electrical aspects of the interconnection wiring design and to present an overview of the state of the art of interconnection analysis techniques.
Inferring Conceptual Structures From Pictorial Input
Authors: Sharon C. Salveter
Venue: Proceedings of the 1978 annual conference (1978)

This paper discusses the mechanisms a program may use to learn conceptual structures that represent natural language meaning. A computer program named Moran is described that infers conceptual structures from simulated pictorial input data. Moran is presented &ldquo;snapshots&rdquo; of an environment and an English sentence describing the action that takes place between the snapshots. The learning task is to associate each root verb with a conceptual structure that represents the types of objects that participate in the action and the changes the objects undergo during the action. Four learning mechanisms are shown to be adequate to accomplish this learning task. The learning mechanisms are described along with the conditions under which each is invoked and the effect each has on existing memory structures.