ppxscal/embedding_network huggingface dataset:
Developing a user services professional
Authors: Lois J. Secrist
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

It is scarcely possible to develop a new professional category without determining just what this new profession is to deliver. Given a User Services professional, what is he or she expected to accomplish? To examine the need for a new profession and to determine what technical expertise might he needed, we first must set some goals for the User Services function in a university computer center.
Automatic programming of APL functions for screen management
Authors: Y. S. Chua, C. N. Winton
Venue: ACM SIGAPL APL Quote Quad (1983)

Defining and processing screen displays at present is typically a tedious and system dependent task. In this paper, four fundamental primitive-type functions are proposed for managing input and output for a display controlled via a user-accessible memory mapped screen organization. A utility is described in this context for relieving the programmer from the repetitive tasks of coding input/output instructions and the associated functions for data type checking. The programmer may define forms, protected text information, unprotected fields, and field attributes in a user-friendly manner. Necessary APL functions for performing the actual user/display interaction are generated either by the utility at the time the form is defined, or dynamically via a virtual memory management strategy. As a result, the programmer's efforts may be concentrated on the actual processing of information, minimizing the time needed to prepare a user-friendly interface. Details are supplied as they pertain to APLSV in the IBM 5120 environment.
Advanced Group Rapid Transit [AGRT] operational simulation
Authors: Wallace W. White
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

This paper reviews an example of the use of simulation models to analytically implement command and control systems in fully automated surface transportation systems. An attempt is made to stress the importance of auxiliary simplified models as an aid in developing more complex simulations.
Factorization over finitely generated fields
Authors: James H. Davenport, Barry M. Trager
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

This paper considers the problem of factoring polynomials over a variety of domains. We first describe the current methods of factoring polynomials over the integers, and extend them to the integers mod p. We then consider the problem of factoring over algebraic domains. Having produced several negative results, showing that, if the domain is not properly specified, then the problem is insoluble, we then show that, for a properly specified finitely generated extension of the rationals or the integers mod p, the problem is soluble. We conclude by discussing the problems of factoring over algebraic closures.
Computer literacy by computer
Authors: M. I. Chas. E. Woodson
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

The basic concepts of computer literacy can be taught by the use of computer management and interactive instruction. The approach described here emphasizes measuring student achievement, and informing students of their progress. This approach also incorporates a system for the evaluation of alternative instructional experiences.
Language features for process interaction
Authors: Gregory R. Andrews, James R. McGraw
Venue: ACM SIGOPS Operating Systems Review (1977)

Languages for parallel programming should meet four goals: expressiveness, data integrity, security, and verifiability. This paper presents a set of language features for describing processes and process interaction, gives examples of their use, and briefly discusses their relation to the goals. Two constructs, resources and protected variables, are introduced as the mechanisms for describing interaction. Resources are extensions of the monitor concept of Hoare; protected variables are global variables which can only be accessed by one process at a time. Two types of access control are introduced: restrictions on scope rules for static access, and capabilities for dynamic access. Examples include the interface to machine devices, files and virtual devices, readers/writers, device scheduling, device reservation, and buffer allocation.
PROSIM W: A production system simulator
Authors: Dennis Edwards Kroll
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

This report deals with the development of a computer program to aid in the teaching of production-inventory control systems. The resulting program follows the outline of previous PROSIM programs. PROSIM W has added features over other systems, and is compact and portable. The simulator was used as a followup to a senior/graduate course in inventory control and a number of modifications in the student interface were made as opposed to the method used by Mize et al in PROSIM V. Some coding errors in PROSIM V are also documented.
Cell map representation for hierarchical layout
Authors: J. Soukup, J. Royle
Venue: Proceedings of the 17th Design Automation Conference (1980)

In the hierarchical layout of rectangular blocks, the routing area naturally breaks into a set of adjacent rectangles. These rectangles can be used as basis for both loose routing and the final track assignment. The paper explores some ways of structuring the required data. More details about generalized Lee routing, and practical results are left for verbal presentation.
Recent study of teaching: machine aids in rehabilitation therapy
Authors: G. Rose, M. A. Woodbury, E. S. Fergusson
Venue: Proceedings of the 1965 20th national conference (1965)

THE REHABILITATION of certain classes of handicapped persons by use of self-implementing automated processes will be discussed in this paper. Rehabilitation comprises evaluative testing and analysis, and therapy. Classically, these procedures have depended exclusively on human beings and non-interacting special purpose machines. Aphasia has been chosen as the primary clinical example. To be covered are contributions made in the field of rehabilitation by modern communication technology; specifically, electrical transmission channels and general purpose digital computers. This technology is applied in two general categories: (1) - information retrieval; and (2) - reactive communications situations.
Man-machine interaction: Console oriented model building
Authors: M. Schatzoff
Venue: Proceedings of the 1965 20th national conference (1965)

ALTHOUGH THE STEPS comprising the scientific method have been defined by many authors, in a variety of ways, there is substantial agreement with regard to the basic philosophy underlying the idea. As a point of reference for the ensuing discussion, it might be well to consider the following six phases of research considered by Ackoff1: (1) - formulating the problem; (2) - constructing the model; (3) - testing the model; (4) - deriving a solution from the model; (5) - testing and controlling the solution; and (6) - implementing the solution. In experimental work, the statistical design and analysis of experiments play a crucial role in the modeling process. Box and Hunter5 describe the experimental process as an iterative one involving conjecture, design, experiment, and analysis continually repeated. This iterative characteristic of the process suggests the desirability of being able to construct and test models quickly, while basing decisions at each stage upon information acquired from previous stages. Where non-trivial computations may be required, the analyst can benefit immeasurably by being able to use an electronic computer on a real time basis, with the facility to exercise judgment in modifying assumptions and carrying out complex analyses with ease.
Innovative computer services for minority colleges
Authors: Jesse C. Lewis
Venue: ACM SIGCSE Bulletin (1975)

The word &ldquo;innovative&rdquo; in the title of this paper does not imply that the colleges involved have found or invented some new computer technology to apply to instruction and research. If the word innovative in appropriate at all, it applies to the way we are using the computer or to the fact that for the first time students in a few minority institutions have access to what maybe one of the most valuable tools in education. I have long advocated that the motivational effect and other advantages of the instructional uses of computers should be applied where it is needed most. It is my opinion that the culturally and economically advantaged students (for example, those students who can afford to go to college in Hanover, N. H.) would be successful in college and life with or without access to computer based instruction. However, this may not be true for some students who go to college in Itta Bena, Ms. There is a great need to motivate and provide individualized instruction for students who have net been exposed to many of the advantages of our society.
SIGMOD (Paper Session)
Authors: T. J. Teorey, John W. De Heus, Rob Gerritsen, Howard L. Morgan, James F. Spitzer
Venue: Proceedings of the 1976 annual conference (1976)

This session contains three papers dealing with optimization of data base systems. Two of them treat improvement of performance by wisely choosing storage structures or processing options. The third paper discusses automatic translation between data structures to obtain compatibility with different data base management systems or improve performance.
A procedural approach to pattern matching in SNOBOL4
Authors: Frederick C. Druseikis, John N. Doyle
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

This paper presents a methodology for describing and implementing pattern matching in SNOBOL4. The basic element of the formulation is the coroutine. The coroutine notion permits a complete procedural implementation as well as a concise description of the pattern-matching process. Matching procedures are represented by co-routines whose order of invocation is determined from the tree structure of a given pattern. The context for a coroutine's operation maintains the details of a local matching process. Side effects that may require reversal in the event of backtracking are undone by the coroutine that caused the effect. The system described has been used to implement extensions to the existing pattern-matching facilities of SNOBOL4.
Multi-defect real time diagnosis using a single pin probe
Authors: Lubomyr M. Zobniw
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper describes a multi-defect real time (MRT) diagnostic algorithm that doesn't require fault simulation. This algorithm makes deterministic decisions that direct a single pin probe to as many nodes as are required to diagnose all &ldquo;unrelated&rdquo; (based on course-effect) defects to the lowest repairable or replaceable units.
Computer personnel recruitment SIGBDP and SIGCPR - Sponsored Panel of ACM 80
Venue: Proceedings of the ACM 1980 annual conference (1980)

The first panel member will present &ldquo;Employment Trends in Computer Occupations&rdquo;. This is a preview of a forthcoming Bureau of Labor Statistics Report on the same subject. It is the result of several years of research on employment issues in the field of data processing given by the head of the research team, Mr. Patrick Wash, Supervisory Labor Economist. The second paper will be presented by Dr. Dambury S. Raju, a Professor at the Illinois Institute of Technology. His presentation, entitled &ldquo;Person-Job Matching in the Eighties&rdquo;, reflects almost 20 years of experience as a personnel psychologist working for a large testing firm (SRA) and now teaching. He will cover testing as a tool for person-job matching, considering the EEO requirement. I will wrap up the panel presentation with a case history of the structured recruiting program at Missouri Pacific for computer personnel.
The preliminary design as a key to successful software development
Authors: Jack M. Dreyfus, Peter J. Karacsony
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

A successful software development effort is predicated upon the establishment of a complete preliminary design. A well disciplined methodology is required to ensure the satisfaction of the following key principles: 1) Clear definition of data processing requirements 2) Top-down design definition 3) Design traceability 4) Design verification A well integrated approach which considers these key elements ensures continuity between Data Processing subsystems engineering and detail design. It also provides clear visibility to management and reduces the risk in software development. TRW has developed a preliminary design methodology which has successfully been applied to large scale software development. The methodology is a disciplined integration of design activities from initial system definition to successful completion of software Preliminary Design Review. This paper will discuss the benefits from complete preliminary design and some of the specific design techniques employed.
Development of a monitor-compatible version of APL 1130
Authors: Joel D. Kirscher, Joel D. Hail
Venue: Proceedings of the sixth international conference on APL (1974)

A relocatable version of APL 1130 has been developed that allows the APL system to reside on a regular Monitor disc. Access to APL is accomplished by executing a mainline program that loads the system. These modifications allow APL users to bring up the system without changing to the usual dedicated disc and thus insure greater availability of APL in an 1130 installation.
Quantitative measurement of program quality
Authors: Raymond J. Rubey, R. Dean Hartwick
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

A black-box approach typifies current software quality assurance procedures: a program is good it it satisfies certain operating specifications. While it is common to manage the development of software under quality assurance systems previously devised for hardware, the tools of measurement are not transferable owing to the very basic differences in the nature of hardware and software. In the absence of specific, applicable quantitative measurement tools there exists no means of defining the desired level of quality in a computer program, where quality is considered as something beyond correct program functioning, nor of ascertaining whether the desired level has been achieved. A user should be able to specify precisely how good a product he wishes to buy, such things as how easy the program should be to run production with and how easily it can be modified. Rarely can the user even discuss these factors, much less specify the extent of their importance to him.
SIGNUM (Tutorial Session)
Authors: John Rice, Wayne Cowell, Edward Battiste
Venue: Proceedings of the 1976 annual conference (1976)

This tutorial session is intended to gave the audience an overview of current and possible future mathematical software activities and outlets. The three speakers will cover the academic, government and private sector aspects of mathematical software. The effectiveness of certain journals, textbooks that include software, and conferences will be considered. Various government sponsored research activities will be reviewed and the problems of establishing a financially viable company in this area will be discussed.
Simulation of large communications networks using SPIN
Authors: I. L. Morris, J. McNulty, R. Gee
Venue: Proceedings of the 14th Design Automation Conference (1977)

The SPIN program was developed in order to perform Monte Carlo simulations of large communications networks which are under attack. Two mutually exclusive communications disciplines are applied to the network - cable and radio. Nodes are classified either as &ldquo;originators&rdquo; or &ldquo;receivers&rdquo;. The objective is to determine (for each discipline) how many surviving receivers are connected to surviving originators and their corresponding shortest path lengths. Statistical summaries of surviving receivers and originators and histograms relating surviving receivers with shortest path lengths to surviving originators are produced by the program.
A compiler for lazy ML
Authors: Lennart Augustsson
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

LML is a strongly typed, statically scoped functional Language with Lazy evaluation. It is compiled trough a number of program transformations which makes the code generation easier. Code is generated in two steps, first code for an abstract graph manipulation machine, the G-machine. From this code machine code is generated. Some benchmark tests are also presented.
Valence and precedence in APL extensions
Authors: J. Philip Benkard
Venue: ACM SIGAPL APL Quote Quad (1983)

Extended operator syntax, defined operators, and strand notation are evaluated as APL extensions using the concept of syntactic binding, which is equivalent to the function scope rule and is more readily extended to other classes of objects. Changing syntax has wider impact than adding function, and its side effects should be considered before adoption.
Selling your software
Authors: Doris R. Waggoner
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

The Academic Computing Center (MACC) at the University of Wisconsin-Madison has distributed a variety of software for several years. Early on, this distribution was casual, informal, and intended to answer whatever requests for software came our way. More recently, we have become the Sperry-Univac conversion site for SPSS, and this has forced us to systematize our methods in distributing SPSS. With this as an incentive, we have recently developed more formal procedures, and are distributing about twenty-five pieces of software. This paper discusses the methods we have developed, and what our experiences have been in entering the potentially lucrative software distribution market.
Some connections between nonuniform and uniform complexity classes
Authors: Richard M. Karp, Richard J. Lipton
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

It is well known that every set in P has small circuits [13]. Adleman [1] has recently proved the stronger result that every set accepted in polynomial time by a randomized Turing machine has small circuits. Both these results are typical of the known relationships between uniform and nonuniform complexity bounds. They obtain a nonuniform upper bound as a consequence of a uniform upper bound. The central theme here is an attempt to explore the converse direction. That is, we wish to understand when nonuniform upper bounds can be used to obtain uniform upper bounds. In this section we will define our basic notion of nonuniform complexity. Then we will show how to relate it to more common notions.
Dynamic design rule checking in an interactive printed circuit editor
Authors: T C. Bennett, K. R. Stevens, W. M. vanCleemput
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes an interactive system for editing of printed circuit layout designs. Each editing operation is dynamically checked against a set of user-defined design rules to assure that the resulting design is valid.
Very Long Instruction Word architectures and the ELI-512
Authors: Joseph A. Fisher
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

By compiling ordinary scientific applications programs with a radical technique called trace scheduling, we are generating code for a parallel machine that will run these programs faster than an equivalent sequential machine&mdash;we expect 10 to 30 times faster. Trace scheduling generates code for machines called Very Long Instruction Word architectures. In Very Long Instruction Word machines, many statically scheduled, tightly coupled, fine-grained operations execute in parallel within a single instruction stream. VLIWs are more parallel extensions of several current architectures. These current architectures have never cracked a fundamental barrier. The speedup they get from parallelism is never more than a factor of 2 to 3. Not that we couldn't build more parallel machines of this type; but until trace scheduling we didn't know how to generate code for them. Trace scheduling finds sufficient parallelism in ordinary code to justify thinking about a highly parallel VLIW. At Yale we are actually building one. Our machine, the ELI-512, has a horizontal instruction word of over 500 bits and will do 10 to 30 RISC-level operations per cycle [Patterson 82]. ELI stands for Enormously Longword Instructions; 512 is the size of the instruction word we hope to achieve. (The current design has a 1200-bit instruction word.) Once it became clear that we could actually compile code for a VLIW machine, some new questions appeared, and answers are presented in this paper. How do we put enough tests in each cycle without making the machine too big? How do we put enough memory references in each cycle without making the machine too slow?
A programming theory for discrete simulation
Authors: Robert E. Haymond
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Discrete systems are abstracted as Cartesian products of automata operating on a data structure. These abstract systems are then modeled as intuitive automata with natural (internal) updates and unnatural (external) updates. Formal programs which perform these functions as well as necessary information flow between subsystems are presented. A collection of examples illustrate the theory.
SIGMAP/SIGSAM/SIGNUM(Paper Session)
Authors: M. Andrews, S. F. McCormick, G. D. Taylor, James L. Noyes, Hatem M. Khalil, Dana L. Ulery
Venue: Proceedings of the 1976 annual conference (1976)

This session includes three papers related to the development of algorithms for mathematical software. The first paper reports on efforts to develop software for evaluation of the square root function in microprocessors utilizing fixed point computation. The second describes the use of a simple Fortran precompiler which facilitates the use of a mathematical programming time-sharing system. Finally, current work in analytic computational complexity of sequential algorithms for partial differential equations is reviewed with special emphasis on the criteria and techniques used to perform the analysis.
A unifying framework for the theory of iterative arrays of machines
Authors: Serafino Amoroso, Edward Lieblein, Hisao Yamada
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

A mathematical framework is defined in which many questions concerning uniform arrays of finite-state machines can be formulated and studied. An outline is then presented that informally describes some research areas that have been under investigation. Some of the results uncovered to date are described and many open problems are stated.
Three dimensional graphical display system
Authors: Charles B. Morrill
Venue: Proceedings of the SHARE design automation workshop (1964)

We have been made aware of a number of development programs for computer aided or assisted design. For example, work is going on under the direction of Prof. S. A. Coons at M. I. T. toward the development of a three-dimensional version of Ivan Sutherland's &ldquo;Sketchpad&rdquo; system. Also at M.I.T. under the guidance of Douglas T. Ross a new modular compiler for universal design application is being developed. The realization that topographical information can be communicated with more speed and accuracy by graphical means initiated work on these and many similar programs. Such communication might greatly augment the usefulness of complex applications programs of the type described by Drs. H. Simpson and J. Antebi in their report &ldquo;Framed Structure Analysis&rdquo;(1). A designer could observe loadings on a structure and could change parameters more quickly in a graphical environment.