ppxscal/embedding_network huggingface dataset:
A vision of probability and statistics using APL
Venue: Proceedings of the international conference on APL (1981)

Topics in probability and statistics are becoming more and more common in the high school curriculum of today. APL provides a concise language to express these concepts. If it is used in conjunction with a computer, the tedious development of important notions can be simplified. In choosing a sequence of ideas to explore, I am guided by the rather natural way data are collected, organized and analyzed. Computer simulations of experiments are possible to vary the collection process. I encourage students to use their imagination to visualize and create arrays of information and to become comfortable with a language capable of expressing and transforming those data into usable statistics. APL is used to develop theoretical expectations and to provide sampling data for comparisons. Finally, conclusions are drawn. As a bonus, the universality of the mathematical models make them easy to generalize and apply to many diverse situations. We have worked for many years in Scotch Plains-Fanwood High School to blend APL into our teaching of traditional mathematics and science courses. This paper points toward its use in developing concepts in probability and statistics.
On the application of Array Processors to symbol manipulation
Authors: R. Beardsworth
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

In the past general purpose programs for symbol manipulation have been written for traditional Von Neumann machine architectures. The design and implementation of a simple prototype symbol manipulation system for the ICL Distributed Array Processor (DAP), is described. The system is restricted to monovariate polynomials with single precision integer coefficients. The algorithms and data structure are discussed and the design of a more general system for multivariate polynomials using arithmetic with semi-infinite precision is considered.
A hierarchy for nondeterministic time complexity
Authors: Stephen A. Cook
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

The purpose of this paper is to prove the following result: Theorem 1 For any real numbers r1, r2, 1 &le; r1 < r2, there is a set A of strings which has nondeterministic time complexity nr2 but not nondeterministic time complexity nr1 The computing devices are non-deterministic multitape Turing machines.
A special group of users: Instructional faculty
Authors: Geraldine MacDonald
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

A university user services staff serves a wide variety of users: students, staff, administrators, research faculty and instructional faculty. This paper reports on methods used to provide support to instructional faculty. Short-term, concentrated support offered to instructional faculty includes introductory short courses directed to special groups of students, advanced seminars tailored to individual courses, machine room tours, equipment usage demonstrations, specialized consulting services and documentation. Assisting in setting up common files for classroom use as well as reviewing course assignments, job control language, and logon instructions are frequently sought services. With proper planning and coordination, the jobs of both user services and faculty are simplified to the great benefit of the student and the educational process. Examples of services will be reviewed.
Late papers
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This section contains papers and position statements received too late to be incorporated in the session where they will be presented. For ease of reference they are listed under their presentation section as well as under this one.
Uniform definability on finite structures with successor
Authors: Michel de Rougemont
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We study inductive and second-order definability on finite structures with successor and relate these notions to complexity theory. We introduce the dimension d of an inductive definition, directly related to the Time complexity, representing the number of variables necessary to carry an induction. We will prove the following: Connectivity is not uniformly unary &Sgr;11 definable on graphs with successor, generalizing a similar result of Fagin on graphs without successor. We will mention that similarly, Hamiltonicity is neither unary-&Sgr;11 nor unary-&pgr;11 on graphs with successor. These results show that disconnectivity is not inductive of dimension 1 although it is inductive of dimension 2, and that Hamiltonicity is neither inductive nor co-inductive of dimension 1 on graphs with successor.
Multi-level modeling in SARA
Authors: Robert I. Gardner
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

Each model of an evolving system in SARA is a representation of an abstraction of the structure or behavior of that system. The degree or level of abstraction of a model is chosen such that enough detail is represented so that the model provides adequate accuracy for the purposes for which it will be used but not so much detail that the model becomes unduly complicated, difficult to build or difficult to simulate. The technique of multi-level modeling allows a system to be modeled at more than one level of abstraction to provide both detailed modeling and a limit to the complexity of the model [ZUR68]. In top-down design, each successively lower-level model encompasses more detail and possibly less scope than the previous models and in bottom-up design each successively higher-level model encompasses less detail and possible more scope than the previous models. Two different approaches to multi-level modeling that have been used in the implementation of SARA are presented here. One approach is used in the SLI structural modeling tool and allows system structures to be represented as multi-level hierarchies of nested modules. The second approach is used in the GMB behavioral modeling tool and allows the designer to easily develop higher- and lower-level GMB models but represents each model as a single-level model.
Man-machine interface design for timesharing systems
Authors: David R. Cheriton
Venue: Proceedings of the 1976 annual conference (1976)

This paper presents a design approach and design criteria for the man-machine interface in timesharing systems. A conceptual view of timesharing systems is outlined, focusing on the interface between the user and the capabilities of the system. We consider user needs and requirements for this interface and suggest design guidelines and approaches to meet these needs. Finally, we propose a model on which design and design standardization might be based and briefly sketch a design methodology.
'Run-time profiling of Algol 68-R programs using DIDYMUS and SCAMP'
Authors: D. F. Brailsford, E. Foxley, K. C. Mander, D. J. Morgan
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

Information concerning the run-time behaviour of programs (&ldquo;program profiling&rdquo;) can be of the greatest assistance in improving program efficiency. Two software devices have been developed for use on ICL 1900 Series machines to provide such information. DIDYMUS is probabilistic in approach and uses multitasking facilities to sample the instruction addresses used by a program at run time. It will work regardless of the source language of the program and matches the detected addresses against a loader map to produce a histogram. SCAMP is restricted to profiling Algol 68-R programs, but provides deterministic information concerning those language constructs that are monitored. Procedure calls to appropriate counting routines are inserted into the source text in a pre-pass prior to compilation. The profile information is printed out at the end of the program run. It has been found that these two approaches complement each other very effectively.
Control concepts in synergistic man-machine information systems
Authors: Victor Selman, Charles I. Bartfeld, Jerry Selman, Jesse Gershberg
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper describes the coupling of man-machine capabilities/limitations for controlling the efficiency (error rate) of large-scale Management Information Systems (MIS). Error reduction and prevention results are continually assessed by a Pare-to-type analysis, and resources are allocated based upon an agreed prioritized listing of the seriousness of the consequences of error. Statistical Quality Control (SQC) techniques and Sampling Inspection and Acceptance Plans were used both separately and in combination to control a large-scale MIS for public health.
A report on the curriculum recommendations of the ACM sub-committee for community and junior college curriculum
Authors: Bobby Smith, Eric Whiteside, Charles Leidlich
Venue: ACM SIGCSE Bulletin (1976)

Final recommendations for the two-year college curriculum to educate computer programmers for applications programming in a general setting of commerce, industry, and government service will be presented. The attached draft of the report was that used by the group prior to the May 27-28 Workshop, during which reactions from industry and professional society representatives were obtained. After a summary of the content of the report is given by the chairman of the ad hoc sub-committee, comments will be heard from panel participants. Afterwards, a brief critique will be given by a discussion leader, followed by discussion with the audience. Copies of the completed report should be available during the panel session.
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
Authors: Martin Tompa
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

Recent research has investigated time-space tradeoffs for register allocation strategies of certain fixed sets of expressions. This paper is concerned with the time-space tradeoff for register allocation strategies of any set of expressions which compute given functions. Time-space tradeoffs for pebbling superconcentrators and grates are developed. Corollaries which follow include tradeoffs for any straight-line program which computes polynomial multiplication, polynomial convolution, the discrete Fourier transform, oblivious merging, and most sets of linear forms.
On-line modeling by curve-fitting
Authors: G. Knott, R. Shrager
Venue: ACM SIGGRAPH Computer Graphics (1972)

Modeling, as we use the term here, means matching a set of numbers, obtained from some theory, to a set of numbers from the laboratory. We will refer to the laboratory numbers as the observed data or curve and to the theoretical numbers as the computed data or curve. Our purpose may be to evaluate the model; or to use it to determine otherwise unobtainable values as functions of the observed curve. Thus the key problem in modeling by curve-fitting is parameter determination. The model functions contain unknown or vaguely known numbers called parameters that affect the shape of the computed curve. The problem is to find those parameter values that make the computed curve most resemble the observed curve in the least squares sense. This is why we speak of modeling by curve-fitting. Statisticians call this activity non-linear regression.
A proposal for user centered system documentation
Authors: C. O'Malley, P. Smolensky, L. Bannon, E. Conway, J. Graham, J. Sokolov, M. L. Monty
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

This paper outlines a set of proposals for the development of system documentation based on an analysis of user needs. It is suggested that existing documentation is not sensitive enough to the variety of levels of user expertise, nor to the variety of contexts in which on-line help is required. We outline three specific proposals for fulfilling these needs: a quick reference facility, a command-line database, and a facility for full explanation and instruction, and suggest a number of ways in which users might access these facilities. Finally, we suggest a way of combining these facilities into an integrated structured manual, offering more effective user support than is currently provided.
The class concept in the Simula programming language
Authors: Jacob Palme, Mats Wallin
Venue: ACM SIGAPL APL Quote Quad (1981)

This paper is directed at APL-users who wants a quick introduction into the main features of the Simula programming language. Simula is a general purpose high-level language. Good Simula systems exist on most large computers. The paper describes the methods for program and data structuring in Simula. These are well suited for structured programming and for the production of secure, modular programs. The paper also points at some major differences between Simula and APL.
Simscript II.5 tutorial
Authors: Edward C. Russell
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

This tutorial will highlight an area for which SIMSCRIPT is particularly well-suited, a complex network of dissimilar process - each described at an appropriate level of detail. This model has been used, with appropriate variations, for applications as widespread as aircraft maintenance modelling, combat system architecture modelling, waterways network modelling and crude-oil transportation studies. This later application will be used to illustrate the powerful data structuring and model-building techniques of SIMSCRIPT.
A principle for resilient sharing of distributed resources
Authors: Peter A. Alsberg, John D. Day
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

A technique is described which permits distributed resources to be shared (services to be offered) in a resilient manner. The essence of the technique is to a priori declare one of the server hosts primary and the others backups. Any of the servers can perform the primary duties. Thus the role of primary can migrate around the set of servers. The concept of n-host resiliency is introduced and the error detection and recovery schemes for two-host resiliency are presented. The single primary, multiple backup technique for resource sharing is shown to have minimal delay. In the general case, this is superior to multiple primary techniques.
CLIC - computer layout of integrated circuits
Authors: M. Silverberg
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

CLIC is a computer program that accepts conventional circuit schematic terms and produces the layout and set of masks required for the film processes of hybrid microcircuits. The circuit designer makes a schematic layout by placing the circuit elements and interconnecting lines on a modular grid. The input to the computer is the coordinate location of each module containing a circuit part and the part description - chip pad, resistor, conductor begin, conductor end, etc. The program takes this location and part name (which includes resistance value in ohms for resistors), designs the circuit part and then generates a set of masks to produce it. CLIC functions as a preprocessor for other Bell Laboratories programs which generate masks on a number of graphic devices.
APSS: An automatic PLA synthesis system
Authors: M. W. Stebnisky, M. J. McGinnis, J. C. Werbickas, R. N. Putatunda, A. Feller
Venue: Proceedings of the 20th Design Automation Conference (1983)

An integrated, fully automatic software capability that combines Boolean logic translation, Boolean minimization, PLA folding, PLA topology generation, and automatic PLA subchip interfacing to the MP2D standard cell automatic placement and routing program in a single, modular software package is described. Written in ANSI standard FORTRAN, APSS permits the designer to input either arbitrarily formed Boolean equations or a truth table, and to receive a complete MP2D-compatible PLA subchip layout with automatically personalized MP2D subchip interfacing data, as output. As with MP2D, this capability is largely independent of technology and circuit implementation, requiring only an appropriate technology file and cell library consistent with the chosen PLA layout style or &ldquo;Floor Plan.&rdquo;
Engineering A Program Optimizer
Authors: John H. Crawford, Mehdi Jazayeri
Venue: Proceedings of the 1978 annual conference (1978)

We describe our work in formally specifying an extension to an existing, large software system. In particular, we were interested in adding a global optimization phase to an operational cross-compiler. We describe the module decomposition of the optimizer and how the modules were formally specified. The resulting modules constitute a set of tools and a framework which promote the rapid and efficient implementation of porgram optimizers. The information hiding strategy of Parnas was followed in the module decomposition. A specification technique proposed by Parnas was intended to be used for specifying the modules. During the course of specification, however, we found Knuth's attribute grammars a much more convenient specification technique for some aspects of the design, espcially the syntax dependent parts. In the final design, these two different techniques were combined to produce a complete specification which is superior to any we found using either technique alone. The use of attribute grammars also shows an interesting application of language theory to program specification and design.
A relational data base management system
Authors: Giampio Bracchi, A. Fedeli, P. Paolini
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

In this paper the design criteria and the overall organization of MORIS, a new general purpose data management system, are illustrated. The system is based on a relational model of data, in which the data base is viewed as a collection of time varying relations of assorted degrees. The capabilities offered by this model are discussed. The architecture of the system is illustrated, which is designed to provide independence of application programs from growths in data types and changes in data representation, convertibility of data among different storage structures, and ability to provide solutions to a wide variety of unanticipated user's problems in fast and uniform retrieval times. The relational model allows the formal definition of an user oriented language, based on applied predicate calculus. The capabilities of this language for retrieving any information which is, implicitly or explicitly, represented in the data base, are discussed.
Computational techniques and the structure of groups in a certain class
Authors: C. M. Campbell
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

The Todd-Coxeter algorithm enumerates the cosets of a finitely generated subgroup of finite index in a finitely presented group. The algorithm has been modified to give a presentation of the subgroup in terms of the given generators. In this paper we describe briefly computer programmes for the algorithm and the modified algorithm, and illustrate how the modified algorithm may be extended to subgroups of countable index. We then describe some methods that enable us to obtain more information from a coset enumeration programme when space is limited. To illustrate these techniques we investigate a class of cyclically presented groups. We first state some theorems concerning this class. Using the computational techniques described earlier, we then discuss in some detail the structure of some of the particular groups involved. The paper arises out of joint work with E. F. Robertson at the University of St. Andrews.
Distributed fault-tolerance for large multiprocessor systems
Authors: J. G. Kuhl, S. M. Reddy
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

Techniques for dealing with hardware failures in very large networks of distributed processing elements are presented. A concept known as distributed fault-tolerance is introduced. A model of a large multiprocessor system is developed and techniques, based on this model, are given by which each processing element can correctly diagnose failures in all other processing elements in the system. The effect of varying system interconnection structures upon the extent and efficiency of the diagnosis process is discussed, and illustrated with an example of an actual system. Finally, extensions to the model, which render it more realistic, are given and a modified version of the diagnosis procedure is presented which operates under this model.
Computer generation of vertex-graphs
Authors: N. S. Sridharan
Venue: Proceedings of the ACM annual conference (1973)

In connection with the problem of generating all multigraphs having a specified vertex-degree list, Lederberg1 has presented a tree-generation algorithm which, exploiting a canonical-lexical notational system, constructs the complete set of solutions in canonically increasing order, without redundancy. Brown2, et. al., have expanded the scope generation to cyclic graphs. Their method relies upon the existence of a complete and irredundant set of &ldquo;vertex-graphs&rdquo; and the procedure consists of a series of graph labelling steps. Graph labelling allows one to assign labels from a given set to the vertices (edges) of a graph, in such a way that knowing the symmetry group of the graph, equivalent label assignments are avoided prospectively. Recent work has been directed towards supplying the vertex-graphs needed by the generator. A program has been written to generate all graphs with t trivalent and q quadrivalent vertices, from graphs having (t + 2q) trivalent vertices. This method, however, will generate redundant vertex-graphs and some issues in isomorph elimination are considered in this presentation.
FOSSIL1: A policy analysis model of the U.S. energy transition
Authors: Philip M. Budzik, Roger F. Naill
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

Over the past four years the Dartmouth System Dynamics Group has developed a dynamic simulation model to aid in the analysis and design of United States energy policy. The model, titled FOSSIL1, simulates the interactions between energy prices, financial markets, resource depletion, government regulation, changing technologies, and consumer behavior that determine future patterns of energy production and consumption. The model is specifically tailored to allow the user to examine the effects of new energy policy on the behavior of the U.S. energy system. This paper will briefly outline the problem addressed by FOSSIL1, the structural characteristics of the model, and a demonstration of its application to energy policy analysis.
Improving personal efficiency: Time management in today's changing university computing environment
Authors: Darleen Pigford
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

With escalating technological advances and increased computing demands, the director of a university based computing facility finds greater professional responsibilities to perform with somewhat diminishing resources. To partially resolve this imbalance of task and resources, the leaders of computing organizations must seek to utilize their own time as efficaciously as possible. Planning to achieve maximum efficiency in a given time frame is a complex and individualized process. Even though people react differently to time constraints, each can seek to improve individual productivity within a constant time parameter. Practical ways to manage time to improve performance in a changing university computing environment is the theme of this paper.