ppxscal/embedding_network huggingface dataset:
A computer literacy mini-course
Authors: Victoria Green
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

The Computer Consciousness minicourse being taught at Notre Dame's Computing Center began as a response to a growing need noticed by several staff members. Computers today affect everybody's life, and people want to know about them. Many courses in Computer Science and in programming are offered at Notre Dame, both some for credit, and the credit-free mini courses sponsored by the Computing Center. These courses contribute to computer literacy on campus, but they cannot meet the needs of everyone. There exists a group of people who don't necessarily want to learn programming or even to learn how to use computers. They simply want to know what they are all about. This group may include students in non-technical disciplines who cannot schedule a programming class into their packed curricula. Possibly among these people are faculty or staff members who completed their educations before computers were common. Also included are secretaries who are being asked to give up their typewriters in favor of computers dedicated to word processing. They want to understand the machines. Teenagers who know they will have a head start in college if they understand computing are part of this group. Our Computer Consciousness minicourse is for these people.
Automatic ECL LSI design
Authors: N. R. CROCKER, R. W. McGUFFIN, A. MICKLETHWAITE
Venue: Proceedings of the 14th Design Automation Conference (1977)

A complete software system for the automatic design of Emitter Coupled Logic (ECL) LSI circuits is described. It is based on the Standard Cell Array (SCA) principle where pre-designed sub-circuits or cells are placed and tracked on silicon to form the integrated circuit chip. ECL technology, (11 masks, 2 - layer metal) presents many problems not encountered in simpler processes. For example, through-holes may not be created over oxide steps and the high power dissipation of ECL cells makes the distribution of power a critical factor. This paper describes how the complexity may be turned to advantage, especially in tracking. Examples are presented to show how the various difficulties may be overcome.
A survey of user-management practices in major U.S. corporations
Authors: Julian W. Riehl
Venue: Proceedings of the seventeenth annual computer personnel research conference (1980)

Increasing attention is being paid to the subject of user-management involvement in the computer-based information system (CBIS) development process. In-depth research was conducted at five major corporations to determine user-management practices that had proven successful in real-world business environments. The results of the research are presented as a series of principles, or concepts, validated by successful business-world applications, which comprise a planning and control framework for CBIS development designed to guide the interested user-manager in establishing effective management control of the CBIS function in his organization.
A project-oriented undergraduate course sequence in software engineering
Authors: Thomas E. Perkins, Leland L. Beck
Venue: ACM SIGCSE Bulletin (1980)

The design of a two-semester course sequence in software engineering is described. These courses, offered at the undergraduate level, are centered around student projects developed in conjunction with local industry; the projects are used as a focal point to motivate and teach software engineering concepts and tools. The goal of the courses is to provide the student with an overview of the entire software development process, experience as a member of a project team, and exposure to a real-world software environment. This paper describes the course organization and topics, and techniques for project selection and monitoring. Results and experience gained to date with this approach are also discussed.
The design and implementation of a dynamically tailored examination
Authors: Lawrence R. Whitlock
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

Traditionally, examinations have served as evaluation tools for the instructor to aid in assigning grades and to detect concepts not yet mastered by students. Questions requiring more information in the response than just a single word or number can give a better indication of the student's knowledge of the concepts being tested. This type of question is more difficult to grade because the correct answer is not a single word or number, there may be more than one correct answer, or some responses may deserve partial credit. Hand grading of such questions is often inconsistent and laborious. Automatic grading systems have been developed which score responses to complicated problems and analyze student deficiences (e.g., [2], [3]), but these methods may be too time-consuming for use in an interactive environment. An alternate approach to complex grading is to adapt the problems to the abilities of the student. An oral exam is an example of this approach. This paper discusses some problems and solutions of administering an &ldquo;oral exam&rdquo; via a computer. Such an exam will be referred to as a &ldquo;tailored exam&rdquo;. The tailored exam extends to examinations some of the ideas used in individualized instruction in Computer Assisted Instruction.
CDALGO - a test pattern generation program
Authors: Glen D. Vaughn
Venue: Proceedings of the 13th Design Automation Conference (1976)

CDALGO is a test pattern generation program for LSI devices. It is designed to generate minimal sequences that are stable and hazard free.
Some thoughts on the future of associative memories/processors in the solution of data base management problems
Authors: P. Bruce Berra
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

Associative memories and processors have been discussed in the literature for the past 15 years and a small number of hardware devices have actually been built (21). A number of applications have been considered and include air traffic control (22), computer graphics (24, 25), information retrieval (9), numerical analysis (15), networks (18, 19) and among others, data base management (2, 4-8, 10, 11, 13, 17). A significant percentage of present computer resources are expended in the processing of large data bases. Of this, a great deal is wasted by processing largely non-sequential data by sequential means. With hardware costs going down; and software and personnel costs going up it is important to look at the impact of non-sequential computer hardware on data base management (DBM). Based upon previous research in the application of associative processing devices to DBM, it appears that the opportunity exists for increased efficiencies by utilizing these devices in conjunction with sequential computers. In this paper, some of the advantages and limitations of these devices are presented and some brief thoughts are given concerning this author's view of the future. It is assumed here that the reader has a working knowledge of associative processors and DBM.
Some considerations for improving federal modeling
Authors: Paul F. Roth, Saul I. Gass, Austin J. Lemoine
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

A recent issue of SPECTRUM (IEEE) has an editorial(1) concerning &ldquo;systems thinking.&rdquo; In alluding to the state of mind of a &ldquo;systems thinker&rdquo; it denotes the shortcomings of systems science and engineering in terms of the specific area of modeling. The editorial refers to shortcomings in the modeling process identified by an MIT workshop on systems sciences, including questions of: validity demonstration, adequacy of data bases, model compatability, model documentation, and model incorporation of stochastic effects and uncertainties. These shortcomings are discussed in the context of the recommendation of the workshop that a &ldquo;National System Center&rdquo; be established to conduct needed basic research in the general areas of large scale systems analysis, modeling methodologies, and tools for policy analysis and synthesis.
On the cryptocomplexity of knapsack systems
Authors: Adi Shamir
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

A recent trend in cryptographic systems is to base their encryption/decryption functions on NP-complete problems, and in particular on the knapsack problem. To analyze the security of these systems, we need a complexity theory which is less worst-case oriented and which takes into account the extra conditions imposed on the problems to make them cryptographically useful. In this paper we consider the two classes of one-to-one and onto knapsack systems, analyze the complexity of recognizing them and of solving their instances, introduce a new complexity measure (median complexity), and show that this complexity is inversely proportional to the density of the knapsack system. The tradeoff result is based on a fast probabilistic knapsack solving algorithm which is applicable only to one-to-one systems, and it indicates that knapsack-based cryptographic systems in which one can both encrypt and sign messages are relatively insecure. We end the paper with new results about the security of some specific knapsack systems.
Computer literacy: An interdisciplinary, hands on approach at the Evergreen State College, Olympia Washington
Authors: John O. Aikin
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

The Evergreen State College is a fully accredited four year undergraduate liberal arts college of the State of Washington. Evergreen was founded in the late sixties as an alternative to the prevailing pedagogical model of undergraduate specialization. Evergreen instead favors integrated, thematic academic programs which typically involve faculty from several disciplines. From its inception the College has had a strong commitment to familiarizing its students with the computer as a tool. This paper outlines some of the methods used at Evergreen and indicates some of the lessons we have learned which may be useful to other liberal arts colleges.
Goals and plans in a program for playing Go
Authors: Walter Reitman, James Kerwin, Robert Nado, Judith Reitman, Bruce Wilcox
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

A program that plays Go provides a basis for analyzing possibilities for extending present AI conceptions of planning and goal structures to problems that are ill-structured, dynamic, multiperson, resource-bound, and highly interactive. The focus is on mechanisms for communicating information and control over time and among a number of interacting processes, in a flexible but coherent manner. Using the capabilities of current computer languages, it is possible to specify planning and goal structures, and appropriate conventions for them, that will accommodate the demands of these increasingly complex and sophisticated problem environments.
IDEOSY: An Ideographic and Interactive Program Description System
Authors: Alessandro Giacalone, Martin C. Rinard, Thomas W. Doeppner,  Jr.
Venue: ACM SIGPLAN Notices (1984)

IDEOSY is an experiment in the use of a formal semantics as the basis for a programming system and in use of an ideographic language as the primary means of user-computer communication. The important characteristics of our system are that it uses an ideographic syntax, has a syntax-directed editor, supports the definition of various equivalence properties and the proofs of such equivalence, and has an interpreter. It currently runs on Apollo workstations and on VAXes running Berkeley UNIX@ using any of a variety of high-resolution color displays. Our formalism is based on Milner's Calculus of Communicating Systems (CCS) [1]. We have found CCS to be a convenient formalism for describing programs and have even used it for describing the UNIX operating system [2]. Its algebraic properties are very useful for building descriptions out of components and for proving the equivalence of descriptions. Since CCS is an operational semantics, we may directly interpret descriptions written in CCS.
A comparison of instruction sets for stack machines
Authors: Bhaskaram Prabhala, Ravi Sethi
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

Suppose you are approached by a computer designer who wants to select a machine architecture and instruction set that is desirable from a compiler writers standpoint. What would you recommend, and why? We give a limited answer to the above question. We focus on the computation of arithmetic expressions like a&minus;b+c. When computing a&minus;b we need different instructions depending on where a and b are to be found. On a programmable calculator for example, a or b may be on the stack, or stored in some memory register. We also need instructions that copy values from one place to another. Algorithms that generate code for arithmetic expressions tend to treat general purpose registers as a stack. Moreover, results about machines that perform all arithmetic in a hardware stack are directly applicable to machines with general purpose registers. We therefore start our study of instruction sets by looking at stack machines. We compare machines based on the number of instructions needed to compute a given expression. We then turn to algorithms that generate optimal programs for computing expressions on the various machines.
CAI programs at the University of Minnesota
Authors: Russell W. Burris
Venue: Proceedings of the 1975 annual conference (1975)

CAI programs, which may be characterized as drill and tutorial, in use and under development at the University of Minnesota are described and discussed within the context of the more fundamental concerns of research and development into teaching and learning effectiveness. Examples chosen from German language, symbolic logic, legal procedure and clinical medicine programs illustrate student-program interactions. The programs show the results of research analyses of the knowledge and skills to be learned in each of the subject matter areas and studies of what the learner is required to do in order to learn.
Questionnaires as a software evaluation tool
Authors: Robert W. Root, Steve Draper
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

This paper reports on a study investigating the strengths and weaknesses of questionnaires as software evaluation tools. Two major influences on the usefulness of questionnaire-based evaluation responses are examined: the administration of the questionnaire, and the background and experience of the respondent. Two questionnaires were administered to a large number of students in an introductory programming class. The questionnaires were also given to a group of more experienced users (including course proctors). Respondents were asked to evaluate the text editor used in the class along a number of dimensions; evaluation responses were solicited using a number of different question types. Another group of students received the questionnaire individually, with part of it presented on the computer; a third group also evaluated an enhanced version of the editor in followup sessions.
LALR(k) testing is PSPACE-complete
Authors: Esko Ukkonen, Eljas Soisalon-Soininen
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

The problem of testing whether or not an arbitrary context-free grammar is LALR(k) for a fixed integer k &ge; 1 (i.e. only the subject grammar is a problem parameter) is shown to be PSPACE-complete. The result is in contrast with testing the membership in several other easily parsed classes of grammars, such as LR(k), SLR(k), LC(k) and LL(k) grammars, for which deterministic polynomial time membership tests are known. The PSPACE-hardness of the problem is proved using a transformation from the finite state automaton non-universality problem. A nondeterministic algorithm for constructing sets of LR(k) items leads to a polynomially space bounded algorithm for LALR(k) testing.
A totally integrated systems approach to design and manufacturing at McDonnell Douglas Corporation
Authors: Mike Mills
Venue: Proceedings of the 18th Design Automation Conference (1981)

During the 1970s, industry in the United States lost &dollar;125 billion of potential production and at least 2 million jobs. Between 1948 and 1968 U.S. output per hour worked increased at an annual rate of 3.2%. For the past seven years this has dropped to 0.7%. This dramatic downturn in the industrial economy is largely due to a widespread decline in productivity. McDonnell Douglas Corporation (MDC) has addressed the issue of productivity by integrating CAD/CAM technology into its design and manufacturing components.
Notes on merging networks (Prelimiary Version)
Authors: Zhu Hong, Robert Sedgewick
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Several new results which contribute to the understanding of parallel merging networks are presented. First, a simple new explanation of the operation of Batcher's merging networks is offered. This view leads to the derivation of a modified version of Batcher's odd-even (m, n) network which has delay time [log(m+n)]. This is the same delay time as Batcher's bitonic (m, n) network, but it is achieved with substantially fewer comparators. Second, a correspondence is demonstrated between the number of comparators (and the delay time) for such networks and certain properties of binary number systems which have recently been extensively studied. Third, the [log(m + n)] delay time is shown to be optimal for a non-degenerate range of values of m and n.
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
Authors: Kurt Mehlhorn, Erik M. Schmidt
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

In this paper we describe a new method for proving lower bounds on the complexity of VLSI - computations and more generally distributed computations. Lipton and Sedgewick observed that the crossing sequence arguments used to prove lower bounds in VLSI (or TM or distributed computing) apply to (accepting) nondeterministic computations as well as to deterministic computations. Hence whenever a boolean function f is such that f and -&-fmarc; (the complement of f, -&-fmarc; -&-equil; 1 -&-minus; f) have efficient nondeterministic chips then the known techniques are of no help for proving lower bounds on the complexity of deterministic chips. In this paper we describe a lower bound technique (Thm 1) which only applies to deterministic computations
A design system approach to data integrity
Authors: William A. Noon, Ken N. Robbins, M. Ted Roberts
Venue: Proceedings of the 19th Design Automation Conference (1982)

Due to the nature of chip design, the Very Large-Scale Integrated (VLSI) design data base is constantly changing. The changes may be caused by logical or physical design activities. In either case, there is a need to make sure that no matter what happens, the data base remains valid. This paper discusses a system which uses an Automated Data Integrity Technique (AUDIT) to eliminate errors prior to hardware build.
A software quality assurance program through reusable code
Authors: Benito Zychlinski Z., Mario Palomar A.
Venue: Proceedings of the 3rd annual international conference on Systems documentation (1984)

The purpose of this article is to present in the context of Software Engineering, and specifically to Quality Assurance, the development and implementation of two automated tools: Static Code Checker and Program Support Library. These tools, duly combined, allow the usage of a computer to make easier the instrumentation of a Software Quality Assurance Program.
A simple reference string sampling method
Authors: James Wittneben, Dennis Kafura
Venue: Proceedings of the ACM 1980 annual conference (1980)

The performance of a process executing in a virtual memory environment is largely determined by the interaction between the process's memory referencing behavior and the system's memory management policies. The structure of the memory reference string, reflected in such quantities as the page fault rate, the stack depth distribution, and the working set size, has traditionally been expensive to measure because of the overhead in capturing every memory reference. This paper reports on the development and testing of a sampling technique designed to extract accurate measurements of reference string characteristics while recording only a part of the complete reference string. The cost of the measurements is controlled by the sampling rate. Results in this paper are based on experiments using synthetic reference strings from an LRU generative model.
The PCS APL shared file system
Authors: Warren Juran, Charles Moore, Carl Orndorff, Larry Rice
Venue: Proceedings of the sixth international conference on APL (1974)

This paper describes the APL shared file system developed by Proprietary Computer Systems. The file system allows rapid storage and retrieval of APL variables outside the user's workspace. The file system accommodates variable sized records and allows file sharing between users with holds at either the file or record level. The file system is being used for inventory, order entry and reservation systems and as a communication area for storage of data bases for combined on-line/batch applications. The file system is also being used to provide communication for chained workspace processing, temporary storage for APL application programs, proprietary program security, usage monitoring, and for transmitting documents and messages between users.
A development system for testing array theory concepts
Authors: M. A. Jenkins
Venue: Proceedings of the international conference on APL (1981)

An experimental programming system has been written in APL to allow exploration of array theory and its use in a programming environment. The system combines array theory notation with programming language constructs in a simple but powerful language that has both applicative and imperative aspects. The system builds on the work of Hassitt and Lyon, using a shared variable interface to access their low level implementation of array operations. The system allows a small number of primitive operations to be chosen from which one builds other definitions. It has been used to study two different models of the theory, one based on set-theoretic intuition following More's series of papers, and a second that uses recursion to build definitions much in the style of Lisp. This paper describes the overall design, how it has been used and some of the internal algorithms.