ppxscal/embedding_network huggingface dataset:
Microprocessor assembly language draft standard IEEE task P694/D11
Authors: Wayne P. Fischer
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

With the proliferation of microprocessors, the need to establish standards for the naming of microprocessor instruction sets and assemblers has become critical. This standard sets forth a set of instruction mnemonics and descriptions, provides procedures for consistently naming additional instructions, and establishes standard assembler language characteristics.
Monte Carlo techniques for stochastic network analysis
Authors: John M. Burt, Mark B. Garman
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

This paper presents simulation procedures for efficiently obtaining estimates of the distribution function, or parameters thereof, of the maximal flow-time through directed acyclic networks whose activity times are random variables.
A new routing algorithm for two-sided boards with floating vias
Authors: Wenliang Wu, Douglas C. Schmidt
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper discusses a new routing program. The program initially partitions a printed circuit board into regions called saturated zones. These saturated zones are subsequently merged by routing into larger and larger saturated zones until the final combination yields a routing for the entire board. The algorithm gains efficiency and effectiveness from the fact that restricted sets of wires are considered in parallel.
Parallel Compilation In A Multiprocessor Environment (Extended Abstract)
Authors: M. Dennis Mickunas, Richard M. Schell
Venue: Proceedings of the 1978 annual conference (1978)

Considerable research has been devoted to the problem of compiling on the one hand and to the design of software for multiprocessor systems on the other. Efforts have been made toward compiling code for use in parallel environments. However, to date few serious attempts have been made to study the development of compilers capable of fully exploiting parallel architectures. The thrust of this paper involves investigating precisely that problem.
Implications for computer science departments of the ACM information systems curriculum
Authors: Robert L. Ashenhurst
Venue: ACM SIGCSE Bulletin (1973)

The ACM Curriculum Committee on Computer Education for Management last year issued a report containing a variety of curriculum recommendations for graduate professional programs in information systems [1]. The work of the Committee has been supported by the National Science Foundation.* A brief summary of the recommendations is given in the Proceedings of ACM 72 [2]. The report addresses the need for information systems programs as stand-alone offerings, or as part of Master's level education in graduate business schools, computer science departments, or other graduate departments. The implications of these recommendations for computer science departments may be addressed under three headings, depending on the role of the department as: (i) including offerings relevant to information systems in its regular Master's degree program; (ii) participating in the offering of an independent program leading to an MS degree in information systems, but as a collaborator with another unit, e.g. a business school; or (iii) undertaking to offer an independent program entirely on its own.
Computer structures: What have we learned from the PDP-11?
Authors: Gordon Bell, William D. Strecker
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

Over the PDP-11'S six year life about 20,000 specimens have been built based on 10 species (models). Although range was a design goal, it was unquantified; the actual range has exceeded expectations (500:1 in memory size and system price). The range has stressed the basic mini(mal) computer architecture along all dimensions. The main PMS structure, i.e. the UNIBUS, has been adopted as a de facto standard of interconnection for many micro and minicomputer systems. The architectural experience gained in the design and use of the PDP-11 will be described in terms of its environment (initial goals and constraints, technology, and the organization that designs, builds and distributes the machine).
The field transform and its application to personal handwritten Chinese character recognition
Authors: Ming-Jing Li, Ru-Wei Dai
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

There is a special induction field in the figures of characters which is a physiological and psychological phenomenon and is highly related to human character recognition. In this paper, a formal definition of the field transform is introduced, in which the field of a character image is simulated by a 2-dimensional scalar field which is caused by all the stroke points in the character image. If can be applied to both binary and gray-level images. A very simple character recognition approach is also proposed based on the field transform and is applied to personal handwritten Chinese character recognition. Preliminary experimental results are very promising. Further efforts should be made to find out new ways of utilizing the field transform for character recognition and other applications.
A principle of algorithm design on limited problem domain
Authors: Jayadev Misra
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper studies the problem of algorithm design on well defined data structures. A general principle is presented which is shown to be useful in designing algorithms which operate on sequences (strings). A generalization of the principle is presented for more general data structures. Implications of these results are discussed.
A model of Safeway's control system
Authors: John Ryder
Venue: Proceedings of the third conference on Applications of simulation (1969)

A detailed model, using GPSS/360, of the extensive software designed and implemented to support Safeway's Basic Management Information System. Also modeled, to the same level, are most of the functions of OS/MVT. HELP routines are used to implement external (console) control and display capabilities, dynamic allocation of GPSS matrices, paging of GPSS blocks and common, and other functions designed to reduce the amount of permanently resident data.
Using APL to understand bit-slice microprocessors
Authors: J. Welford
Venue: ACM SIGAPL APL Quote Quad (1984)

This paper describes strategies used for the rapid construction of a microprogram assembler and simulator written in APL. Although the motivation for the work was learning and teaching, and although both designs are simple and superficially ad-hoc, the approach is easily applicable in a routine way to other systems and requires little more effort than that involved in writing the definition files for general purpose simulators and assemblers, the work of the latter being mainly done by the APL interpreter.
On teaching recursion
Authors: Robert L. Kruse
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Tree diagrams can be fruitfully employed in elementary courses to illustrate recursion, explain its implementation, and motivate its applications in algorithm design. At the same time, tree diagrams can lead to guidelines to help the student decide when recursion is a good method, and when it should be avoided. This paper discusses these methods and, as an example, develops an algorithm for generating permutations.
Debugging &ldquo;level&rdquo;: Step-wise debugging
Authors: Dick Hamlet
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

Debugging techniques originated with low-level programming languages, where the memory dump and interactive word-by-word examination of memory were the primary tools. &ldquo;High-level&rdquo; debugging is often no more than low-level techniques adapted to high-level languages. For example, to examine the execution of an operational specification one state at a time by setting breakpoints, is superior to doing the same thing to a machine-language program, but only because the language level has improved; the debugging remains primitive. This paper attempts a radical definition of debugging level, and illustrates it with a technique for ordering the execution of concurrent processes in a way that follows their design structure. Division of a program into a collection of cooperating processes is a means of controlling the complexity of each process. However, in execution the program-development structure is ignored, with the result that the advantages of decomposition are lost. What the designer has divided and conquered, the debugger sees as an overwhelming monolith. The technique proposed here causes the focus of execution to follow the design structure, in a way that does not require detailed user direction.
Training requirements for computer programmers in relation to system development phases
Authors: Perry E. Rosove
Venue: Proceedings of the seventh annual conference on SIGCPR (1969)

The purpose of this paper is to suggest that the training of computer programmers might be improved by developing training requirements and course curricula through analyses of the attributes of typical information system development phases. This approach differs from, but would complement, the existing method of deriving training requirements from analyses of the tasks and skills associated with job categories.
Structured systems analysis tutorial
Authors: V. Arthur Owles, Michael J Powers
Venue: Proceedings of the ACM '81 conference (1981)

Business systems analysts and university faculty or in-house DP trainers who teach courses which involve information systems analysis and development. Familiarity with the basic concepts of structured program design is assumed. The tutorial will introduce the basic tools and concepts of structured analysis and show the transition to structured design.
Specification of a regression test for a mini computer operating system
Authors: Patricia R. Cox
Venue: Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality (1981)

In this paper I describe the practical problems of designing a regression test set for an existing mini-computer operating system. The ideal regression test would test each function with all possible combinations of the options for each variation of the operating system. This is impractical if not impossible so the alternative is to choose the individual cases for maximum coverage. To do that the system is viewed both functionally and structurally and cases are selected for inclusion in the test set. The method of selecting the tests is described along with the tools that will be needed to measure the coverage and to maintain the test set.
Building a user-defined interface
Authors: Dennis Wixon, John Whiteside, Michael Good, Sandra Jones
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

A measurably easy-to-use interface has been built using a novel technique. Novices attempted an electronic mail task using a command-line interface containing no help, no menus, no documentation, and no instruction. A hidden operator intercepted commands when necessary, creating the illusion of a true interactive session. The software was repeatedly revised to recognize users' new commands; in essence, the users defined the interface. This procedure was used on 67 subjects. The first version of the software could recognize only 7% of all the subjects' spontaneously generated commands; the final version could recognize 76% of those commands. This experience contradicts the idea that people are not good at designing their own command languages. Through careful observation and analysis of user behavior, a mail interface unusable by novices evolved into one that let novices do useful work within minutes.
General purpose tools for system simulation
Authors: Joe K. Clema
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

A brief overview of the simulation community is provided including its past, present and future. The systems simulation problem is stated. Certain general strategies, tools, techniques, and methodologies applicable to virtually all systems simulations are described. Emphasis is placed on a set of automated tools, standards, and documentation providing high visibility to the programmer as well as to the manager. The described set of integrated tools and techniques are easily tailored to the particular user application and they have been used to facilitate the development of large-scale systems simulations.
APL functions which enhance APL branching
Authors: J. P. Dorocak
Venue: Proceedings of the eighth international conference on APL (1976)

APL functions are defined which improve the syntax and semantics of the APL branch mechanism. The IF-THEN, IF-THEN-ELSE, DOWHILE, DOUNTIL and DOCASE constructs are included. No compilation, interpreter alteration or special features are required by this approach.
Discrete-event simulation in the engineering/construction industry
Authors: D. J. Dunne
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The conceptual and construction procedure planning process for modern major resource development projects represents a challenging problem in scheduling, logistics and resource allocation. The large capital investment, the magnitude of many of the projects, the impact of minor decisions, and the fact that many resource extractions are located in remote regions of the world combine to present a potentially high degree of risk to management. This paper discusses why discrete systems simulation can be a valuable planning tool to aid management in preparing for the real world contingencies which inevitably occur when major projects move into the field.
Associative techniques in the solution of data management problems
Authors: Caspar R. DeFiore, Neil J. Stillman, P. Bruce Berra
Venue: Proceedings of the 1971 26th annual conference (1971)

This paper is concerned with the development of data management systems from an associative point of view. The design utilizes relational set theory applied to information systems. The basic notion involves the mathematical transformation of hierarchical structures of n-ary relations into associative normal form (ANF). This transformation preserves the information content while at the same time allowing the information to be manipulated by an associative memory in a more efficient manner than is possible on a random access memory. Among the advantages that can be realized from this system are the capability of handling many and varied data structures; substantially fewer pointers and directories; a reduction in storage space requirements; and a substantial decrease in query and update time.
An introduction to the Risch integration algorithm
Authors: Joel Moses
Venue: Proceedings of the 1976 annual conference (1976)

Risch's decision procedure for determining the integrability in closed form of the elementary functions of the calculus is presented via examples. The exponential and logarithmic cases of the algorithms had been implemented for the MACSYMA system several years ago. The implementation of the algebraic case of the algorithm is the subject of current research.
Direct connection between Compiling Techniques and Databases courses
Authors: Nadia Thalmann
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

Two of the most demanding subjects in a Computer Science Curriculum are Compiling Techniques and Databases. In both courses, a major problem is: what should be the main project in the laboratory?. Since 1974, we have had students at various universities write compilers (2) in such a course. In each case, a complete compiler has been implemented. We have tried to establish a direct connection between the Compiling Techniques Course and the Databases Course because both can be selectively chosen by the same students. This paper is divided into three parts: first, we outline the content of each course and the relationship existing between them; secondly, we analyze the criteria for language selection with regards to both courses (also with respect to methodology and to structured programming); third, we discuss the language and illustrate it using some examples.
On enhancing the interface to the source code of computer programs
Authors: Ronald Baecker, Aaron Marcus
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

This paper addresses issues in the human factors of computer program documentation. We develop a framework for research on enhancing the interface to the source code of computer programs through designing and automating the production of effective typeset representations of the source text. Principles underlying the design research and examples of sample production are presented. This work was supported by the U.S. Defense Advanced Research Projects Agency under DARPA Order 4469. We are grateful for valued assistance to the other members of the research team, Michael Arent, Design Director, Aaron Marcus and Associates, and Paul Breslin, John Jackson, Allen McIntosh, and Christopher Sturgess, Human Computing Resources Corporation, and to Trigraph Typesetters, Toronto.
Computer system performance and evaluation (Paper-Panel Session)
Authors: Gary Carlson, Kenneth W. Kolence, Henry C. Lucas,  Jr., Richard L. Madden, Dennis G. Severance, Alan G. Merten
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Two interrelated sessions will address the technology of computer system performance measurement and evaluation from both the point of view of a user (computer management) and the point of view of the developer of methodologies. The first session will deal with various uses of monitoring devices and data in improving the efficiency and effectiveness of a computer installation, as practiced in operating computer centers today. In the second session, recent methodological developments and their implications for performance evaluation will be described. Following the second session, a panel of speakers from both sessions will discuss the major problems and potentials of performance measurement with a view toward future directions. During the panel discussion emphasis will be on interaction with the audience.
The ROBOT System: Natural language processing applied to data base query
Authors: Larry R. Harris
Venue: Proceedings of the 1978 annual conference (1978)

In the early 1970's the natural language processing techniques developed within the field of artificial intelligence (AI) made important progress. Within certain restricted micro worlds of discourse it became possible to process a reasonably large class of English. These techniques have now been applied to the real micro world of data base query, allowing for information to be extracted from data bases by asking ordinary English questions. This paper discusses the importance of true natural language data base query and describes the ROBOT system, a high performance production level system already installed in several real world environments. The specific data structure requirements of the ROBOT system are discussed, as well as an extended type of data inversion that provides precisely the functionality required by the natural language parser.
Interactive system for controlled vocabulary maintenance
Authors: Dave W. Wattenbarger, John A. Bailey, Samuel J. Martinez
Venue: Proceedings of the 1977 annual conference (1977)

Bibliographic retrieval files frequently are indexed using words or phrases from a controlled vocabulary list. Usually these lists are structured to show relationships between terms, and strict rules are established to define permissible structuring. Because, with a large vocabulary it is humanly impossible to remember all of the many concepts involved, a printed list is required to define the different terms with their corresponding relationships. Computer processing is ideally suited for the term manipulation and tabulation required for generating such a list. Terms and relationships can be added or modified later, so that the vocabulary can remain useful for current ideas. Here again, computer programming can be utilized to make such changes. The Information Services Division of The University of Tulsa has used controlled vocabularies to index Petroleum Abstracts since 1965. Their Exploration and Production Thesaurus provides an example of the problems involved with managing a controlled vocabulary. A new Dictionary Control System has been developed for vocabulary maintenance, which is described in this paper. With this new system, thousands of terms with their corresponding relationships may be stored, modified or listed. A B-tree was chosen as the main data storage structure because of its multiway branching which decreases search time and storage requirements. A set of Dictionary System subroutines allows addition, deletion or modification of terms or relationships to be done interactively with individual terms, or in a batch mode. These routines allow extensive error checking using rules defined independently of the data structure. Experience with the new Dictionary Control System has shown it to be an efficient and valuable tool for controlled vocabulary maintenance.
Vector execution of flow graphs(Extended Abstract)
Authors: H. R. Strong
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Given a vector of tasks intended to execute the same program simultaneously on a machine which can execute only one instruction at a time, but can execute that instruction for any specified subset of the vector, the object is to schedule the execution to take maximal advantage of parallelism. Such a scheduling is called a vector execution scheme. A class of &ldquo;perfect&rdquo; programs is characterized for which such scheduling is easy and on which many vector execution schemes are optimal. This characterization shows that scheduling difficulties arise from unrestricted use of gotos producing irreducible programs, from branches in loops, and from nested loops. Once the path through the program is known for each task, it is a finite problem to find an optimal schedule; so there is an optimal vector execution scheme, even over imperfect programs. However, there is no implementable vector execution scheme which does not make use of knowledge of the future and which is optimal with respect to length of execution sequences. Some implementable vector execution schemes based on priority ordering and node sequence approaches are studied and compared as to worst case behavior on imperfect programs.
Interactive theorem proving
Authors: Jorge Morales
Venue: Proceedings of the ACM annual conference (1973)

The results of Notice 72-H2 of the NAMS of June 1972, issue 138, were proven using the Theorem Proving Program of Allen Luckham1. Proofs of the results stated by Cowen, Frisz Grenadir in their notice Some New Axiomatizations in Group Theory, a Preliminary Report and an extension of their results, namely, a new single axiom characterizing abelian groups, were found with the aid of the interactive theorem proving program. Times varied from instantaneous for easy proofs to 55 sec of cpu time for the hardest. The problem of finding proofs was left entirely to the program and the correctness of the results was not known to the user in advance. Some simple heuristic criteria were employed in using the program to find additional single axiom characterizations.