ppxscal/embedding_network huggingface dataset:
Microprocessors in a computer science curriculum
Authors: Benjamin M. Lin
Venue: ACM SIGCSE Bulletin (1978)

In computer technology one of the most important developments in recent years is that of microprocessors. Thousands and thousands of microcomputers, which use microprocessors as their central processing units, have been marketed today. We will discuss the actual course implementation of microprocessor topics in a typical undergraduate computer science curriculum. At the beginning, we will discuss how a microcomputer system is used in various aspects of computer science education. Then we will discuss how the subject matter of microprocessors can be integrated into an existing curriculum. In addition, a separate course sequence is suggested to provide good training for computer science majors who are seriously interested in microprocessor applications.
Representation combination of Boolean functions using APL
Authors: Eric Gullichsen
Venue: Proceedings of the international conference on APL (1984)

An ability to compactly represent and efficiently manipulate and combine Boolean functions is required in many tasks pertaining to digital logic design, including those of fault detection and isolation and the decomposition of switching networks. An APL implementation of Roth's cube array representation of Boolean functions is presented, and it is shown how such a representation permits the definition of concise and efficient APL routines to compute various useful logical combinations of these functions.
Special-purpose ternary computer for digital filtering
Authors: Tatsuo Higuchi, Hisamitsu Hoshi
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

Real-time digital filters which have several advantages over analog filters are known as a very important digital-signal processor. This paper provides a summary of the design features of a special-purpose microprogram-controlled ternary computer suited for realizing the real-time digital filters by programming. Many advantages of the ternary number system are effectively employed for the ternary computer in hardware and software. Particular emphasis is placed on the use of the ternary adder with three inputs and the microprogram structure based on ternary logic. An example of the use of the ternary computer proposed for the real-time digital filters is presented to illustrate how microprogramming and user programming can easily be done and execution steps can substantially be reduced, unlike the corresponding binary computer.
Engineering design aspects
Authors: Herbert Y. Chang, Richard N. Talmadge
Venue: Proceedings of the 21st Design Automation Conference (1984)

EDS, a subsystem within AT T Bell Laboratories Unified CAD system, is an integrated front-end computer-aided engineering system that is designed to facilitate the early detection and correction of design errors for system designers. This paper provides an overview of its system attributes and functional capabilities. EDS has been in wide use at AT T Bell Laboratories and AT T Information Systems Laboratory in support of the various hardware design activities associated with electronic switching systems, processors, transmission systems, and many other applications.
MP/C: A multiprocessor/computer architecture
Authors: Bruce W. Arden, Ran Ginosar
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

A computer architecture for concurrent computing is proposed that has the shared memory aspect of tightly coupled multiprocessor systems and also the connection simplicity associated with message-connected, loosely coupled multicomputer systems. A large address space is dynamically partitioned into contiguous segments that can be accessed by a single processor. The partitioning is accomplished by switching the system buses, using semiconductor switches. The completion of a concurrent process is signaled by a processor's return to an idle state and the reattachment of its memory segment to the neighboring active processor. In effect, the assignment of an address sequence and the activation of a processor is a process FORK operation, and the processor deactivation and memory segment reattachment is a process JOIN. Following a description of the MP/C structure and basic operation, some additional enhancements of the system, which improve the applicability of MP/C to many classes of computations, are outlined. Applications include tree-structured multiprocessing, recursive and nondeterministic procedures, arbitrary concurrent computations, very high precision numeric calculations, and process-structured operating systems. The linear MP/C structure is extensible to higher dimensions. A two-dimensional system is described, and its usefulness for data base operations and array processing is discussed.
Programming factors - language features that help explain programming complexity
Authors: H. E. Dunsmore, J. D. Gannon
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Programming complexity (the amount of difficulty in constructing a program) may depend upon certain programming factors (choices of programming language features). Using program changes as a programming complexity measure, previous research has identified five potential programming factors. This paper suggests that subjects tend to use the same levels of these factors in two different programming languages supporting the conjecture that these factors are elements of individual programming style. It also describes five potential programming factors, and although each has intuitive appeal, only average procedure length was related to programming complexity.
Computer aided design of high density printed circuit boards
Authors: R. Campagna, R. Fryer
Venue: Proceedings of the 7th Design Automation Workshop (1970)

A design automation system which accepts engineering data in the form of logic diagrams is described. The output is in the form of paper tape to directly create photomasks and/or drilled boards. The key feature of this approach is a highly sophisticated routing subsystem.
Evaluation of On-Board In-Flight Checkout on military aircraft
Authors: J. L. Johnson
Venue: Proceedings of the second conference on Applications of simulations (1968)

The potential benefits of On-Board In-Flight Checkout (OBIFCO) were evaluated through computer simulation. This evaluation included fighter and transport aircraft operations within both wartime and peacetime environments to determine the effects of early failure warning, reduced diagnosis time, and reliability of diagnosis. A RAND-developed Monte Carlo Simulation, SAMSOM II, was modified for use in the study.
A design study on graphics support in a Fortran environment
Authors: R. G. Loomis
Venue: Proceedings of the SHARE design automation project (1966)

Some of my colleagues in IBM and myself have been jointly studying and discussing the problems involved in providing future graphics support in a FORTRAN environment. In this presentation I will attempt to summarize the major assumptions that have influenced this design study and report on some of the tentative conclusions reached as well as some, as yet, unanswered critical questions. This report is being made at this time in the hope that it will stimulate a critical evaluation on your part and provide us with some useful feedback. Your first opportunity for responding will be provided by the discussion session scheduled for later this afternoon. We hope you will participate by informing us about your own views and experiences with respect to graphical data processing.
The Control Data Institute training program for career entry computer programmers
Authors: R. L. Lien
Venue: Proceedings of the twelfth annual SIGCPR conference (1974)

In the last twenty years the computer has gone from a novelty to a convenience to a necessity. Tools of technology require people who can operate, program and maintain those tools. In order to meet this need, Control Data Corporation established Control Data Institute to provide entry level training to people seeking careers in the computer field. From a single school which opened in Minneapolis in 1965, the Institute has grown to a network of training centers throughout the world. Career entry level institutes are found in twenty locations in the United States, Australia, Canada and Western Europe. Over 8,000 students enroll in programs of study each year; the programs ranging from a few months to nearly a year in length.
A lexical analysis of Labanotation with an associated data structure
Authors: Stephen W. Smoliar
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Labanotation is a two-dimensional graphic notational system for recording movement of the human body. One of the major applications of Labanotation has been the recording of both classical ballet and modern dance. We are developing a program to compile Labanotation scores into movement primitives which will be used to generate a graphic simulation of human movement. We are also building a user-oriented graphics editor as a front end to this system. This entails the design of a data structure which would provide a neat efficient method to store a score (for an editor) and which would also, in essence, be a lexical scan of the score (for the compiler).
Lower bounds on the size of sweeping automata
Authors: Michael Sipser
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

Establishing good lower bounds on the complexity of languages is an important area of current research in the theory of computation. However, despite much effort, fundamental questions such as P &equil;? NP and L &equil;? NL remain open. To resolve these questions it may be necessary to develop a deep combinatorial understanding of polynomial time or log space computations, possibly a formidable task. One avenue for approaching these problems is to study weaker models of computation for which the analogous problems may be easier to settle, perhaps yielding insight into the original problems. Sakoda and Sipser [3] raise the following question about finite automata: Is there a polynomial p, such that every n-state 2nfa (two-way nondeterministic finite automaton) has an equivalent p(n)-state 2dfa? They conjecture a negative answer to this. In this paper we take a step toward proving this conjecture by showing that 2nfa are exponentially more succinct than 2dfa of a certain restricted form.
On the layering problem of multilayer PWB wiring
Authors: Shuji Tsukiyama, Ernest S. Kuh, Isao Shirakawa
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper deals with the layering problem of multilayer PWB wiring, associated with single-row routing. The problem to be considered is restricted to the special case of street capacities up to two in each layer, and it is reduced to a problem of the interval graph by relaxing some restrictions in the original problem. Then, a h&egrave;uristic algorithm is proposed for this problem.
An improved technique for system analyst interaction with users in problem definition
Authors: Richard Boland,  Jr., Heber MacWilliams
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

This paper discusses a study of alternative methods by which information system analysts and intended users may interact during the problem definition phase of system development. The study focuses on improving problem definition by structuring a more appropriate interaction between the user and the systems analyst.
The DI-3000 implementation of the 1979 GSPC 'CORE' graphics standard
Authors: Nikolaus J. Kiefhaber, James R. Warner
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

DI-3000 is a machine-independent system of FORTRAN-callable subroutines based on the 1979 'CORE' report of the Graphics Standards Planning Committee (GSPC) of ACM/SIGGRAPH. DI-3000 supports Output Level-3 (dynamic output), Input Level-2 (synchronous input), and Dimension Level-2 (3D) of the CORE. This includes the complete support of 2D and 3D primitives, full 3D viewing definitions, multiple concurrent display surfaces, Hershey text fonts, all logical input functions, and image transformations. The raster extensions defined in the 1979 CORE Report are also supported, including polygonal primitives, shaded or patterned polygons, and dynamic definition of color video lookup tables on raster devices. DI-3000 uses a network of several interconnected virtual graphics devices which communicate with each other via messages. These virtual devices may represent physical graphics devices, graphics metafiles, or device-independent display files for storing retained segments. The DI-3000 logical network may be implemented in various ways, depending on the architecture and operating system of the target computer system. The network concept is ideally suited to multi-tasking or distributed processing environments, where either the central memory of the host computer is limited or the target graphics devices have local intelligence. Using a logical network, the virtual graphics devices can execute concurrently for increased efficiency. All virtual devices have a distinct layer structure. This allows easy maintenance and extension of the system as the graphics standard evolves, without changes in the basic design. The layer structure also makes it easy to build new graphics device drivers.
Simulation modeling with insight
Authors: Stephen D. Roberts
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

Using INSIGHT, simulation models can be built and evaluated with less time and effort than previously possible. INSIGHT defines a vocabulary for systems analysis and provides a small set of modeling symbols to represent the basic processes found in real systems. By combining the symbols graphically and filling in needed information, immediately useful simulation models can be constructed quickly. Simple models can be greatly embellished using the rich variety of INSIGHT specifications without resorting to any computer programming. The visual model is simply translated into INSIGHT statements for automatic execution. Procedures incorporated in INSIGHT enable sound statistical analysis to be used routinely. Such features reduce the cost and difficulty in obtaining representative results. The net result is that attention is focused on modeling and analysis.
An application of simulation to compare production line configurations with failures and repairs
Authors: F. Paul Wyman, Lawrence E. Moberly
Venue: Proceedings of the 5th conference on Winter simulation (1971)

Three parallel production line configurations are compared by simulation: parallel but independent, dual line without expediting, and a dual line with expediting possible around a failure station. Each facility within a stage draws parts from a common queue in a dual line. Relative performance is studied while varying queue capacity, failure rate, repair rate, and number of stages. The preferability of a dual over independent lines is found to depend upon the degree of expediting possible. Expediting, in turn, depends upon the degree of idle machine capacity built into the work standards.
The pebbling problem is complete in polynomial space
Authors: John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We examine a pebbling problem which has been used to study the storage requirements of various models of computation. Sethi has shown this problem to be NP-hard and Lingas has shown a generalization to be P-space complete. We prove the original problem P-space complete by employing a modification of Lingas's proof. The pebbling problem is one of the few examples of a P-space complete problem not exhibiting any obvious quantifier alternation.
The Icon programming language a new approach to high-level string processing
Authors: Ralph E. Griswold
Venue: Proceedings of the 1979 annual conference (1979)

Icon is a high-level programming language designed for nonnumerical applications with an emphasis on string processing. A goal-directed evaluation mechanism, combined with string analysis operations that are capable of producing alternative values, allows string processing to be integrated with the rest of the features of the language.
Steps toward a cognitive engineering: Design rules based on analyses of human error
Authors: Donald A. Norman
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

This paper uses the analysis of human error to provide a tool for the development of principles of system design, both to minimize the occurrence of error and to minimize its effects. Eventually, it should be possible to establish a systematic set of guidelines, with explicit, quantitative cost-benefit tradeoffs that can lead toward a design discipline&mdash;a &ldquo;Cognitive Engineering.&rdquo; This short note starts the process.
Documentation writers as screen designers for interactive computer systems
Authors: Karen Van Dusen, Nichole J. Vick
Venue: Proceedings of the 2nd annual international conference on Systems documentation (1983)

For interactive computer systems, most of the communication between users and the computer occurs via the written and graphic information shown on the video display terminal. Let's call that information &ldquo;the screen,&rdquo; whether it shows text or graphics. Effective communication between the user and the system depends on how well the screen has been designed. One aspect of that design is how the screens, individually and as a whole, have been worded and organized for overall readability.
A Navigation System for Vision-Guided Mobile Robots
Authors: S. Vitabile, G. Pilato, F. Pullara, F. Sorbello
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper we present a vision system for an autonomous mobile robot. Our robot performs goal reaching tasks into unknown indoor environments by using visual landmarks. Robot vision processes are performed at different levels of abstraction in order to extract useful information for robot navigation. The system, based on the HSV color space, is implemented by two groups of parallel processes: a Low Level Vision System performs obstacle avoidance and corridor following, while an High Level Vision System extracts landmark's contents for high level planning. System performance was tested on sets of digital images supplied by the RWI B12 mobile robot camera.
The design of a switching system to allow remote access to computer services by other computers and terminal devices
Authors: R A Scantlebury, P T Wilkinson
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

An experimental store-and-forward data communication network has been set up within the National Physical Laboratory (NPL) site. The system represents one element of a national data network scheme proposed by NPL. The network is currently offering a data communication service on a trial basis and is operating successfully. Work on an enhanced communication system is in hand. This new system has been organised along strictly hierarchical lines and is intended to meet the requirements of computer to computer communications in a general manner, permitting resource-sharing applications and remote-access computer services to be developed in the Laboratory.
Presentation and major design aspects of the CYCLADES computer network
Authors: Louis Pouzin
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

A computer network is being developed in France, under government sponsorship, to link about twenty heterogeneous computers located in universities, research and D.P. Centers. Goals are to set up a prototype network in order to foster experiment in various areas, such as: data communications, computer interaction, cooperative research, distributed data bases. The network is intended to be both, an object for research, and an operational tool. In order to speed up the implementation, standard equipment is used, and modifications to operating systems are minimized. Rather, the design effort bears on a carefully layered architecture, allowing for a gradual insertion of specialized protocols and services tailored to specific application and user classes. A particular objective, for which CYCLADES should be an operational tool, is to provide various departments of the French Administration with access to multiple data bases located in geographically distant areas. Host-host protocols, as well as error and flow control mechanisms are based on a simple message exchange procedure, on top of which various options may be built for the sake of efficiency, error recovery, or convenience. Depending on available computer resources, these options can be implemented as user software, system modules, or front end processor package. For each of them, network-wide interfaces are defined, to conserve consistency in human communications. CYCLADES uses a packet-switching sub-network, which is a transparent message carrier, completely independent of host-host conventions. While in many ways similar to ARPANET, it presents some distinctive differences in address and message handling, intended to facilitate interconnection with other networks. In particular, addresses can have variable formats, and messages are not delivered in sequence, so that they can flow out of the network through several gates toward an out-side target. Terminal concentrators are mini-hosts, and implement whatever services users or applications require, such as sequencing, error recovery, code translation, buffering, etc. Some specialized hosts may be installed to cater for specific services, such as mail, resource allocation, information retrieval, mass storage. A control center is also being installed and will be operated by the French PTT.
QMOD: A system for automatically generating and solving analytical queueing network models
Authors: Leo H. Groner
Venue: ACM SIGAPL APL Quote Quad (1981)

An analytical queueing model generator (QMOD) is a package for generating and analyzing queueing networks. A description of a queueing network, written in a language meaningful to the user, is compiled into a set of matrices that characterize an analytical model of the network. Network flow rates are computed and used to derive arrival rates at each operation and tool. Tool arrival rates, service rates, and quantities are used in an analytic queueing model of the M/M/K form. Analytical models typically require orders of magnitude less computation time than do simulation models. They, therefore, lend themselves to parametric studies and optimization in ways that would be impractical with simulation models.
Use and cost-effectiveness of packaged TV cassette courses for training analysts
Authors: Patricia Hendershot, A. M. Wildberger
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

This paper is based on current experiences at the Naval Material Command Support Activity (in Arlington, Va.) in the coordination of data processing training. These experiences are presented as having some generalized applicability to any resource-limited, industrial or technical training situation for which a full time training staff is not generally available.
Design of simulation models
Authors: Julian Reitman, Henry Kleine, Otis L. Newton, Howard L. Swaim
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The organizer of this panel has chosen to address this difficult subject by experience. The four invited panelists average 20 years of experience in the field of simulation. They represent the users and the builders of simulation models, both private industry and government, and are familiar with a diversity of languages used in modeling. Each panelist has been invited to give a fifteen minute presentation drawing of their unique perspective of the design of simulation models. Following the presentation, a period will be provided for discussion and questions.