ppxscal/embedding_network huggingface dataset:
MOSES&mdash;a system for quickly implementing efficient code for new linear programming algorithms and variants of algorithms
Authors: Robert C. Bushnell
Venue: Proceedings of the 1971 26th annual conference (1971)

A method is described for utilizing a system of Fortran subprograms to implement algorithms and variants of algorithms for Mathematical Programming. A particular implementation of the Dantzig-Wolfe procedure is used as an example.
An analysis of central processor-input-output processor contention
Authors: William D. Strecker
Venue: ACM SIGSIM Simulation Digest (1979)

Most computer systems have separate central (CPU) and input-output (IOP) processors to permit simultaneous computation and input-output (I/O). It is conventional in such systems to avoid any loss of I/O data by granting the IOP priority over the CPU for memory service. Although this priority discipline is simple to implement it may result in a maximum degradation of CPU performance. In this discussion an analysis of the IOP priority discipline is given together with an analysis of other priority disciplines which require the buffering of IOP requests and results are given showing that only a small amount of buffering is required to produce a noticeable improvement in CPU performance.
TurboDOSTM multiprocessor operating system
Authors: William A. Schultz
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

The TurboDOS operating system is a product of Software 2000, Inc., and is trademarked and copyrighted by them. At MuSYS Corp., we have used TurboDOS in conjunction with various slave processor boards to construct a wide variety of S-100 based computer systems, ranging from two to over sixty users. TurboDOS is designed for multiprocessor networks of Z-80 based computers, although single user versions are available. Extensive use is made of the Z-80 instruction set to achieve a highly table oriented and reentrant architecture, which is very adaptable to the user's environment. In addition to MuSYS, many companies are selling TurboDOS for specific hardware configurations on an OEM basis. This is one of the primary distinctions with other multiprocessor operating systems, which are supported by only a single vendor.
On the relation between wire length distributions and placement of logic on master slice ICs
Authors: Sarma Sastry, Alice Parker
Venue: Proceedings of the 21st Design Automation Conference (1984)

The quality of placement and routing on gate arrays is commonly measured by average wire length. With regard to wire length, placement and routing are mutually competing tasks and the solution space for both is exponential. Estimates of measures of placement such as average wire length or, total wiring tracks prior to routing give some indication of the routability of the placement and, can be used to select another placement and repeat. The nature of these problems necessitates a probabilistic approach to the wirability analysis of integrated circuits. Stochastic models for wiring space estimation and the relation between wire length distribution and placement optimization have received attention recently [1], [6], [2], [5], [7], [3] and [4]. Much of the reported work on wire length distributions and placement of logic rests on empirical evidence that indicates that &ldquo;well placed&rdquo; chips exhibit Rent's Rule between the number of components and the number of corresponding external connections. Rent's Rule has been the basis of the heuristic arguments used to derive upper bounds on the average wire length and the form of the wire length distribution. Rent's Rule has the form T &equil; KC p (1) where T is the average number of external connections, C is the average number of components, K is number of connections per component and p is a positive constant. In [1], [2] and [4] the effect of placement on wire length distribution was introduced by assuming that a hierarchical partitioning scheme aimed at minimizing the average wire length results in a configuration that exhibits Rent's Rule. In [2] an upper bound r@@@@k for the average wire length between elements of different subsets of components of size k was derived, and using Rent's Rule to obtain the number of connections between such subsets, an upper bound on the average wire length was derived. In [3] the Pareto distribution is proposed for the distribution of wire lengths. Similar results were presented in [4]. In this paper we present a model that provides a mathematical basis for Rent's Rule and its relation to wire length distribution. It will be shown that Rent's Rule, an observed fact, is a manifestation of a more fundamental underlying process characterized by a function which leads directly to a general class of wire length distributions, the Weibull family. That is, Rent's Rule contains all the information about the distribution of wire lengths. Thus, estimates for the average wire length can be derived. Theory presented here is substantiated by simulation results and earlier research data.
Integration of design and programming methodology into beginning computer science courses
Authors: Philippe Gabrini
Venue: ACM SIGCSE Bulletin (1982)

Much has already been written on beginning computer science courses; but what has been written has been about how to present programming concepts to students who are new to computer science, about structured programming and GOTO-less programming as well as about the contents of those beginning courses. Design and programming methodology is usually left for a specific course given to junior or senior students. Even though structured programming and some approaches to problem solving are taught, very often methodology is ignored or barely mentioned. And when students do take a course on systems design, the view of methodology they get is obscured by the usually bad habits they have developed during their studies and in their programming projects. This has left the universities open to criticism by industry for not producing people ready for work, or for producing people with bad working habits who have a hard time adjusting to the standards of established organizations. Efforts to remedy that problem have been sporadic, some teachers did introduce methodology in a beginning course, but only to see their efforts reduced to nothing for lack of follow-up. An experiment to integrate methodology into beginning courses has been made at UQAM where the number of computer science students (more than 900 students in two computer science programs) has made it absolutely necessary to give people good working habits so that the scarce computer resources are used in the most efficient way.
A notation for the GCD and LCM functions
Authors: E. E. McDonnell
Venue: Proceedings of seventh international conference on APL (1975)

This paper proposes a notation to be used for the greatest common divisor (gcd) and least common multiple (1cm) functions in APL. The notation proposed is that in use for the logical or and and functions: @@@@ for gcd and &Lgr; for lcm. For this reason, special attention is paid to the cases of gcd and lcm for the arguments 0 and 1. Also, because we wish to define the functions for negative and complex rational values as well as for positive integers, we discuss the functions more generally than is the case in standard number theory texts, which usually restrict their discussions to positive integers. For this reason we give proofs of some of the basic theorems concerning gcd and lcm, written to insure that they are valid for the entire domain of values for which it is proposed the APL functions be defined. The discussion in this paper is couched in terms of integral arguments. The theoretical extension to rational arguments is an easy one, and it is assumed that the gcd and lcm functions, which depend on the residue function for their definitions, will be implemented for non-integral arguments, just as is the residue function, with all the practical difficulties which this entails. In this paper, the terms &ldquo;greatest&rdquo; and &ldquo;least&rdquo; are taken to refer to magnitudes, and the terms &ldquo;divisor&rdquo; and &ldquo;multiple&rdquo; mean integer divisor and integer multiple.
The construction of a selection battery for programmers adapted to South African conditions
Authors: R. S. Hall
Venue: Proceedings of the eighth annual SIGCPR conference (1970)

The project was undertaken after a meeting between N.I.P.R. staff and a subcommittee of the Computer Society for South Africa in March 1968. Doubts had been expressed over the applicability of programmer aptitude tests normalized for a United States population to a South African population&mdash;a fact which accorded with the N.I.P.R.'s experience with other tests. The Society financed the project, and its influence was of great assistance in obtaining the cooperation of the many different organizations that were involved.
A set-theoretic view of data-base representation
Authors: E. Henry Beitz
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

To achieve what I believe to be an acceptable. Information Management System, I propose that a set-theoretic view of a data-base be adopted. Most potential data-base users use the language of set-theory in their day to day references to the objects and relationships of their data-bases. Instead of twisting these natural language references to &ldquo;collections&rdquo;, a representation that is modelled on sets should be implemented. Among the many advantages to be gained by adopting this approach are: non-redundant storage of data common to two or more application environments, controlled access to the entire data-base by any data-dependent key, rapid selection and isolation of easily specified subsets of data, and the extraction of only those data necessary to satisfy specific needs. This description of data-base representation will include some conceptual aspects and will address specific problems related to the computer-based data-base. Some of the areas that will be addressed are security, integrity, accessibility, and flexibility.
Flowchart schemata with counters
Authors: David A. Plaisted
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

The translation of a specific flowchart schema with one counter into an equivalent flowchart schema without counters is described. This result leads easily to the general translation method from one-counter flowchart schemata to zero-counter flowchart schemata. Some generalizations are then presented.
Hierarchical multiprocessor organizations
Authors: J. Archer Harris, David R. Smith
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

The development of LSI components has induced a substantial research effort into the possibility of applying conglomerations of small processors on some computational problems previously limited to large processors. The primary advantages of &ldquo;multi-microprocessor architectures&rdquo; are their potential for improvements in cost, reliability, and possibly speed over conventional large computers. However, the realization of these advantages requires improvements in the techniques necessary to translate problems into parallel algorithms for multi-microprocessors, and in the architectures of the multi-microprocessors themselves. This paper describes an architecture currently being investigated at SUNY - Stony Brook. The first section discusses various strategies of design. The second section describes the structure of the proposed system. Finally, the third section discusses some classes of problems for which the architecture is suited.
IBM FSD VLSI chip design methodology
Authors: K. Ahdoot, R. Alvarodiaz, L. Crawley
Venue: Proceedings of the 20th Design Automation Conference (1983)

The IBM Corporation's Federal Systems Division (FSD) has designed, developed and implemented a VLSI design methodology selected specifically for the DoD's design environment. The military industry VLSI requirements and IBM FSD's design system goals for developing chip design methodology are described. Substantial reduction in computer costs and design schedule using the methodology and the design system components is demonstrated. The rationale behind selecting the specific combination of tools, from the many design systems in IBM, for forming the FSD chip design system and the methodology is explained.
Improved sharing of APL workspaces and libraries
Authors: James G. Wheeler
Venue: ACM SIGAPL APL Quote Quad (1981)

Years of experience have revealed deficiencies in APL's traditional library structure and its facilities for managing saved workspaces. As part of the development of a new file system, STSC undertook to resolve these deficiencies in a revised design. The rules governing the use of shared workspaces have been broadened and placed under the control of an access matrix, giving the user great flexibility in controlling how invidual workspaces are used. APL libraries have been generalized and likewise placed under access-matrix control. System facilities are provided that allow any workspace-management action to be performed under program control. The concept of the APL workspace has hardly changed since the earliest APL systems; it is worthwhile to wonder why. To programmers weary from battling the job control languages of that era's operating systems, the workspace must have seemed a concept of charming and startling simplicity. To the computer novice, who found in APL a shortcut through the maze of technical lore, the notion of the workspace was quickly assimilated into intuition.
The generation of simulator-based systems for microcode development
Authors: C C Charlton, D Jackson, P H Leng
Venue: ACM SIGMICRO Newsletter (1984)

The work described in this paper is directed at the structure and construction of simulator-based systems for the development and testing of microcode. While the value of such software tools is widely recognised, their availability in the early stages of the development cycle of a new machine is subject to the time and effort required for their implementation. We describe here the design of a system to assist in their generation from the specifications of the machine to be simulated. The system is based on the application of generalised program and data structures to facilitate the rapid implementation of an efficient simulation 'nucleus', which is integrated with an 'environment' of machine-independent routines for user interaction with the simulated machine.
Contextual postprocessing of a Korean OCR system by linguistic constraints
Authors: Hyuk-Chul Kwon, Ho-Jeong Hwang, Min-Jung Kim, Seong-Whan Lee
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

The approach in this paper focuses on the contextual postprocessing by selecting the most feasible word from multiple output strings of an OCR system. The correction is applied only when the selection fails. The selected word is confirmed by the collocation between the word and the adjacent words. The five functions applied in the system are (1) to select a word from candidate words, (2) to correct candidate words using a confusion matrix of syllables, (3) to combine two substrings to a word that spans two lines, (4) to guess unknown nouns, and (5) to confirm a selected word by the contextual information of adjacent words. To improve speed, we use syllable di-grams and viable-prefixes of Korean words. The experimental result shows that the two heuristics speed up the system more than 1,000 times in worst case. Our system improves the word recognition rate of the OCR system from 90.50% to 94.72%.
Simulation-aided design of man/machine interfaces in automated industries
Authors: Gary I. Davis, James R. Buck
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper describes the potential use of new computer simulation techniques for human factors designers in automated industrial process control. Problems in communications, operational procedures, and task allocation between the operator, computers and other machines can be identified from the simulation results and resolved. Also the simulation can show the system performance, individual operator workload with allocations of time into task classes, and provide the mechanism for testing sensitivities to learning, individual differences, motivation, environmental conditions, and job stress. Design strategies with computer simulation and coupled man-in-the-loop simulation are discussed.
Simulation systems for logistics support planning
Authors: Donald F. Blumberg
Venue: Proceedings of the third conference on Applications of simulation (1969)

Many organizations now operate, or are planning the operation of complex logistics and maintenance support systems that defy analysis by any of the existing analytical techniques and inventory models. These logistics systems are characterized by having a mix of high-value reparable parts with relatively low demand over time. In addition, such complex support systems are generally composed of several locations where the repair and stock locations may not be the same. The given problem is to specify inventory levels at the several locations that will maximize the total system effectiveness, as well as to specify optimal maintenance and logistics operations policies and procedures. The achievement of this goal is further complicated by the fact that any one location can, in time, draw upon the stock and maintenance capabilities of any other location. Because of this, it is impossible to maximize the system effectiveness by optimizing the stock and maintenance activity at each location independently of that at the other locations.
BASIC
Authors: Thomas E. Kurtz
Venue: ACM SIGPLAN Notices (1978)

Dartmouth College is a small university dating from 1769, and dedicated &ldquo;... for the education and instruction of Youth of the Indian Tribes in this Land in reading, writing and all parts of learning... and also of English Youth and any others.&rdquo; (Wheelock 1769.) The undergraduate student body (now nearly 4000) outnumbers all graduate students by more than 5 to 1, and majors predominantly in the Social Sciences and the Humanities (over 75 percent). In 1940 a milestone event, not well remembered until recently (Loveday 1977), took place at Dartmouth. Dr. George Stibitz of the Bell Telephone Laboratories demonstrated publicly for the first time, at the annual meeting of the American Mathematical Society, the remote use of a computer over a communications line. The computer was a relay calculator designed to carry out arithmetic on complex numbers. The terminal was a Model 26 Teletype.
Maintenance of the computer sciences teleprocessing system
Authors: D.E. W. Bucher
Venue: Proceedings of the international conference on Reliable software (1975)

This paper describes the maintenance and enhancement of the Computer Sciences Teleprocessing System (CSTS) and its component processors. CSTS is the system offered by the INFONET Division of Computer Sciences Corporation to provide nationwide conversational and batch teleprocessing service. In the first section, the organization of the project personnel and major activities of project departments are described. The second section describes the process by which functional enhancements and error corrections are implemented. The final section describes testing techniques and procedures used during implementation. The project staff is organized into implementation departments and service departments. Implementation departments develop new features of the system, corrections to errors, and improvements in system operation, especially in reduction of software overhead. Implementation departments are organized by system software functions such as operating system (device control, task management, and file management), language processors and data management systems, communications software, and applications. The service departments are system integration, performance analysis, product management and system test. The functions performed by these departments are described. Also described are the system evolution conferences and the periodic review of enhancements by a Change Advisory Board. During the development of a new version of the system, effective tracking of the status of changed modules is essential. The data base and process used to track new features, error corrections and changed component modules are described. The flow of implemented changes through system integration and system test is delineated, as is the development and verification of change documentation for users, administrators and operations personnel. The final section of the paper describes the design and documentation of test programs and the organization of test sets. Effective test operations are achieved by using self-checking tests as well as automated test operation and verification. Tests for compliance with functional specifications and for conformity to internal design are described.
APL in education
Authors: Kenneth E. Iverson
Venue: ACM SIGAPL APL Quote Quad (1982)

Although the initial development of APL was motivated by the need for a precise notation for use ' ... in teaching classes, and in writing ... ', the use of APL as a teaching tool was lagged far behind its commercial use. This paper will review the current state of APL in education, and discuss possible strategies for advancing it.
A specialized computer architecture for text retrieval
Authors: David C. Roberts
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

This paper describes a specialized computer architecture for text retrieval that provides a wide range of query capabilities, without the use of indexes of the material retrieved. A distributed approach is employed, with direct search processors. Each search processor is closely associated with one or more disk drives that store the data to be searched and each consists of a comparator for matching query terms, logic elements to combine query terms, a disk controller and a control minicomputer. The key element of the architecture is the comparator, which can store over 64.000 characters of query terms and compare all of these terms simultaneously with data arriving from a disk continuously at more than one million bytes per second. Exact match, partical match, numeric comparison and context limitation are among the capabilities provided. The comparator is implemented as three similar universal finite-state automata, with special features to facilitate text retrieval and reduce hardware costs. A breadboard version of the system with one searcher is operational and has undergone detailed evaluation. A prototype system with two searchers is being implemented and will be placed into regularly scheduled use.
APL syntax and semantics
Authors: Kenneth E. Iverson
Venue: ACM SIGAPL APL Quote Quad (1983)

This paper presents a working model of APL syntax and semantics that incorporates explicit representations of functions, operators, and syntax, thus providing a basis for the clear and explicit statement of extended facilities in the language, as well as a tool for experimentation upon them. Use of the model is illustrated in the treatment of the syntax of operators, and in the discussion of a number of new or recently-proposed facilities including indirect assignment, the operators axis, derivative, inverse, and til, and the functions link, and from. The entire model is included in an appendix.