ppxscal/embedding_network huggingface dataset:
DAP&mdash;a distributed array processor
Authors: S. F. Reddaway
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

An array of very simple processing elements is described each with a local semiconductor store. The array may also be used as main storage. Bit-organisation gives great flexibility, including the minimisation of word length. Use of MSI and LSI is helped by the simplicity of the serial design. Using 15-bit fixed point, the theoretical performance of a 72 &times; 128 array is about 108 multiplications or 109 additions per second. Comparisons are made with other architectures. Meteorology is considered as an application. It is attractive to have the whole problem in the array storage.
A multiprocessor raster display for interactive graphics system design
Authors: Walter M. Anderson
Venue: Proceedings of the 18th Design Automation Conference (1981)

The design of increasingly complex VLSI circuits and multilayer printed circuit boards have increased the demands on computer aided design methods including interactive graphics systems. Earlier minicomputer based systems with direct view storage tube displays lack the processing power and display characteristics that allow high degrees of interactivity and visual discrimination required for high productivity in complex design situations. Declining semiconductor RAM costs and increasing capabilities of microprocessors have allowed raster display technology to keep pace with the demands of current interactive graphics systems. The recently introduced Lexidata Graphics System 8000 combines state of the art color and black and white raster display technology with the latest microprocessor technology to provide a powerful element for the design of interactive graphics systems to meet today's greater needs. The GS8000 includes a very fast Schottky display processor to convert vectors to raster and fill areas and a 16 bit microprocessor to service interactive devices and process a world coordinate data base for editing and display. The system hardware off loads a significant processing and memory burden from the host computer allowing the use of a less powerful host or more users on a single host. An extensive software library resident in the Graphics System 8000 reduces the software development required of the user allowing him to concentrate on the applications software necessary for the creation, maintenance and non-graphic processing of his design data base on his host computer.
Completeness problems for switching circuits constructed from delayed gates
Authors: L. Martin, C. Reischer, I. G. Rosenberg
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

The capability of the synthesis of finite deterministic automata build up from delayed gates over a finite alphabet &dbarbelow; is studied by reduce that problem to the problem of building circuits realising functions of several variables ranging over &dbarbelow; and with values in &dbarbelow;. Some characterizations for the completeness (strong, full and uniform completeness) of a set of delayed gates are given, and also for precomplete classes of a set of uniformly delayed gates.
An experiment on high speed file transfer using satellite links
Authors: C. Huitema, I. Valet
Venue: Proceedings of the seventh symposium on Data communications (1981)

One of the first applications of satellite telecommunication systems being studied within the NADIR pilot project is high speed (several Mbits/s) file transfer. After a short description of the French &ldquo;TELECOM 1&rdquo; satellite communication system, the paper points out that usual protocols such as HDLC cannot be simply adapted to fit satellite transmission requirements (high bandwidth, long propagation delay and various error rates). Specific problems, such as choice of frame length, error correction procedure, numbering scheme, and flow control mechanism are discussed, and a set of feasible solutions to be experimented are proposed.
John Hancock's experience with productivity techniques
Authors: Nancy F. Bern
Venue: Proceedings of the 12th Design Automation Conference (1975)

&mdash;A Profile of John Hancock During the past year, John Hancock has been experimenting with Productivity Techniques. The purpose of this paper is to report our results. John Hancock Mutual Life Insurance Company, one of the country's largest mutual life insurance companies, has its home office in Boston, Mass. The data processing function is provided, on a centralized basis, by a department within the company composed of six hundred personnel. EDP areas include machine operations, data entry and keypunch, systems and programming, education, and software support. The equipment installed currently includes three IBM 370/168's; the software environment includes OS/VS with MVS in the planning stage, TSO and IMS. Most of the programming is done in COBOL.
Perspectives of the systems analyst: Identity, function, skills and future
Authors: Paul D. Oyer
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

Numerous studies have shown that real successes in Information Systems have been the exception rather than the rule. Could the employers of Systems Analysts be expecting too much? Can the systems analyst really &ldquo;do everything for everybody&rdquo; on his employers payroll? How can the Systems Analysts cope with the organizational politics and vested interests in his employers organization? The employing organization has numerous problems - but must the Systems Analyst be expected to solve them all? To increase the Information Systems success ratio, Systems Analysts and their employers must somehow close the gap between expectations and actual results. Some suggestions include much more direct user involvement in the systems development process, more behavioral skills (Peopleware) for systems analysts, better tools for the systems analyst, and more realistic expectations in the first place. After 25 years as a Systems and Statistical Analyst and 10 years of teaching systems analysts, the author offers some new perspectives and an analysis of today's Systems Analysts. As a result of participation in an extensive study for the year 2000, some future perspectives and needs of the successful Systems Analyst are proposed.
Specialization of SARA for software synthesis
Authors: Ivan M. Campos, Gerald Estrin
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

The SARA system has been developed to permit top-down design without necessarily prespecifying that implementation would be done in software or hardware. It was felt very important to give the designer freedom to make that decision at a late stage and therefore select the appropriate place for the hardware-software interface. However, the synthesis methodology does not force the designer to hide an intention to use particular devices or particular software systems. Moreover, the area in greatest need of design assistance is programming where a language and associated virtual or real machine would already have been selected. Hence the question was raised, &ldquo;What specialization of SARA would be important for the synthesis of software systems?&rdquo; This paper discusses models of software systems under two very different conditions. In one, it is known that the design of a program for a sequential PL/I processor raises no synchronization issues to be managed by explicit flow-of-control models. Using a simple classical example, the paper shows that it is possible to describe a multi-level model, using SARA, which goes smoothly from programming-in-the-large to programming-in-the-small or actual code. In a second simple case synchronization issues are vital and it is important to keep a token machine explicitly in the model.
SIGIR(Tutorial Session)
Authors: Gerard Salton, Edgar Sibley
Venue: Proceedings of the 1976 annual conference (1976)

This SIGIR tutorial session on retrieval systems presents two experts in their field discussing two major types of retrieval systems. Gerard Salton will present his view of the automated information storage and retrieval system, i.e., a system which is designed to retrieve documents or document surrogates in response to the specific request of a user. He will emphasize file organization, content analysis and indexing, search strategies, and retrieval processes. On the other side of the retrieval fence, Ed Sibley will discuss Data Base Management Systems, with an emphasis on the data structures and interfaces utilized. Terminology, techniques, and problem areas will be discussed with the aim of (1) introducing newcomers to the subject areas, (2) giving the more experienced practitioners an up-to-date look at current technology, and (3) giving users and designers of each type of system insight into the types of techniques which are utilized in both familiar and unfamiliar situations, in order that they may be aided in solving their own retrieval problems.
Operating systems with POPSS
Authors: Neal S. Coulter
Venue: ACM SIGCSE Bulletin (1977)

It is often difficult to select relevant and reasonable laboratory assignments in an introductory operating systems course. The students are seldom prepared to code intricate portions of an operating system, even if suitable hardware were available for such extensive use. Nevertheless, it is essential that the students gain a quantitative insight into the components and interactions of simple and complex operating systems. An operating system simulator that allows an evaluation of the performances of various operating system configutations without requiring the student to write complicated code would help to solve the dilemma. An operating systems simulator named POPSS is a fine tool for such such use.
Some features of the SIMULA 67 language
Authors: Ole-Johan Dahl, BJørn Myhrhaug, Kristen Nygaard
Venue: Proceedings of the second conference on Applications of simulations (1968)

SIMULA 67 is a general purpose programming language with a built-in simulation capability similar to, but stronger than that of SIMULA I. SIMULA 67 has been developed by the authors at the Norwegian Computing Center. Compilers for this language are now being implemented on a number of different computers. Other compilers are in the planning stage. A main characteristic of SIMULA 67 is that it is easily structured towards specialized problem areas, and hence will be used as a basis for special application languages. SIMULA 67 contains the general algorithmic language ALGOL 60 as a subset, except for some very minor revisions. The reason for choosing ALGOL 60 as starting point was that its basic structure lent itself for extension. It was felt that it would be impractical for the users to base SIMULA 67 on still another new algorithmic language, and ALGOL 60 has already a user basis, mainly in Europe and the Soviet.
Considerations for new tactical computer systems
Authors: Jon C. Strauss, Kenneth J. Thurber
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

The real-time command and control environments characteristic of tactical military systems and industrial process control systems place unique and conflicting design requirements on a support computer system. These requirements include fast context switching, selective protection of programs and their files, controlled sharing of program and files, high processing speed, flexible, yet fast priority structure for interrupts and program execution, flexible high-speed I/O and flexible intercommunication and control for interacting programs. This paper describes a new computer system now being prototyped to satisfy these requirements. The system design includes a number of unique features relating to the efficient implementation of a flexible virtual memory addressing system for the stringent real-time environment.
Micros for students-a computer-intensive environment
Authors: Roger S. Pinkham, Edward A. Friedman
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

In order to integrate effective computer utilization into undergraduate engineering, science, computer science, and management curricula, Stevens Institute of Technology has added to its central computer capabilities, personal ownership of microcomputers by students. In 1983, and again in 1984, all entering freshman at Stevens were required to purchase a Digital Equipment Corporation Professional 350 computer with 10 megabyte hard disk, 512K of random access memory and dual floppy disk drives with 800K bytes of storage. With this system, students received PROSE editing software for word processing and two programming languages, BASIC and FORTRAN. DEC PRO 350s have also been distributed in various campus locations and a subsidized program has resulted in widespread faculty ownership of these systems. External grants and institutional funds have supported faculty efforts to develop computer-related curriculum materials in more than 50 courses. Curriculum applications are extremely varied and include simulations, design projects, numerical methods, and tutorials. Currently, there are 1,400 DEC 350s being utilized at Stevens, a pilot networking effort is being implemented, and a fully networked campus is planned for implementation during the 1986/87 academic year. Curriculum examples, initial networking experience, and planning objectives will be discussed.
Maintenance management for sophisticated ground transportation vehicles
Authors: C. W. Collins
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The next generation of ground transportation systems will use sophisticated vehicles and computer controls. Maintenance planning for these systems requires correspondingly advanced management techniques. Simulation has proved to be a valuable management tool for evaluating these plans. This paper discusses a GPSS simulation used to investigate vehicle maintenance strategies for a proposed airport people-mover system. The identification of critical interfaces between operating philosophies and maintenance concepts is described. Model output giving managers insight into relative merits of candidate maintenance system designs is presented.
Simulation techniques for microprocessors
Authors: James R. Armstrong, Garry Woodruff
Venue: Proceedings of the 14th Design Automation Conference (1977)

In recent years the popularity of microprocessors has increased to a point where there exists the need to effectively simulate a microprocessor in conjunction with other logic elements. The two major problems of simulating the microprocessor are the level of detail in the simulation and the method of implementation. A simulation model is developed that allows effective simulation at the chip level with the other logic elements.
A language and model for computer-aided design
Authors: N. J. Denil
Venue: Proceedings of the 1966 21st national conference (1966)

This paper describes Design Language I (DLI) - a prototype computer-aided design system. DLI addresses the creative design of 3-dimensional structure, using a display console for communication with the user. The ultimate objective of a design system is to provide a mechanical designer with a display console on which he may design parts and assemblies, do engineering analyses on these designs, modify them, and finally produce drawings and other engineering documentation. The design process in this ultimate system is characterized by changes - solution to a design problem is worked into a final design by a succession of changes and refinements.
A notation and system for 3-D constructions
Authors: Chris I. Yessios
Venue: Proceedings of the 15th Design Automation Conference (1978)

A linguistic model and its implementation for the description of three-dimensional compositions, primarily as they occur in building construction are presented. The model, while it also provides for irregular compositions, it facilitates the derivation of standard orthogonal arrangements by the use of the junction operator, which does not require the explicit definition of positioning coordinates for each element in the composition. This paper presents a linguistic model for the generation of three-dimensional structures. The model aims at satisfying the above two requirements. It is generative and therefore process oriented and it derives the description of a structure based on the definition of a usually few basic elements. While it also poses claims for generality, it is primarily based on the compositional patterns and practices encountered in building construction. Some of the principles it incorporates build upon previous work done by the author for the implementation of SIPLAN, an experimental site planning oriented language for two-dimensional spatial arrangements.
SADT@@@@ /SAINT: Large scale analysis simulation methodology
Authors: Kenneth H. Evers, Robert F. Bachert, Patrick R. Santucci
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

SADT/SAINT is a highly structured, top-down simulation methodology for defining, analyzing, communicating, and documenting large-scale systems. Structured Analysis and Design Technique (SADT), developed by SofTech, provides a functional representation and a data model of the system that is used to define and communicate the system. System Analysis of Integrated Networks of Tasks (SAINT), currently used by the USAF, is a simulation technique for designing and analyzing man-machine systems but is applicable to a wide range of systems. By linking SADT with SAINT, large-scale systems can be defined in general terms, decomposed to the necessary level of detail, translated into SAINT nomenclature, and implemented into the SAINT program. This paper describes the linking of SADT and SAINT resulting in an enhanced total simulation capability that integrates the analyst, user, and management.
Nested rectangular arrays for measures, addresses, and paths
Authors: Trenchard More
Venue: ACM SIGAPL APL Quote Quad (1979)

The left argument of the reshaping function in APL is an ordinal number or list of ordinals, called a shape, that measures the rectangularity of an array. Shapes are the simplest measures. A natural extension of the index-generator function shows how an array of any valence (rank), depth of nesting, or type can be used as a measure. The method of generalizing shapes to measures also generalizes addresses and paths to arbitrary arrays. Only the leaves of a measure, address, or path matter, the nested rectangular structure does not. These results of array theory for floating arrays are motivated by similar considerations for grounded arrays.
The NYU Ultracomputer&mdash;designing a MIMD, shared-memory parallel machine (Extended Abstract)
Authors: Allan Gottlieb, Ralph Grishman, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, Marc Snir
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

We present the design for the NYU Ultracomputer, a shared-memory MIMD parallel machine composed of thousands of autonomous processing elements. This machine uses an enhanced message switching network with the geometry of an Omega-network to approximate the ideal behavior of Schwartz's paracomputer model of computation and to implement efficiently the important fetch-and-add synchronization primitive. We outline the hardware that would be required to build a 4096 processor system using 1990's technology. We also discuss system software issues, and present analytic studies of the network performance. Finally, we include a sample of our effort to implement and simulate parallel variants of important scientific programs.
Hydra: Multiple People Detection and Tracking Using Silhouettes
Authors: Ismail Haritaoglu, David Harwood, Larry S. Davis
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Hydra is a real-time system for detecting and tracking multiple people when they appear in a group. We describe the computational models employed by Hydra to track multiple people before, during and after occlusion. Hydra combines a silhouette-based shape model, a motion model, and correlation-based matching methods to classify whether or not a foreground region contains multiple people, and to segment the region into its constituent people and track them. Experimental results demonstrate robustness and real-time performance of the algorithm.
Use of APL in teaching electrical network theory
Authors: Paul Penfield,  Jr.
Venue: Proceedings of the fourth international conference on APL (1972)

This paper discussed an experiment in which APL was used in a college course about electrical network theory.
Error checking with pointer variables
Authors: Marvin V. Zelkowitz, Paul R. McMullin, Keith R. Merkel, Howard J. Larsen
Venue: Proceedings of the 1976 annual conference (1976)

The use of pointer variables in a programming language often results in a difficult class of errors to detect. Pointers may point to storage that no longer is allocated, or storage may be allocated as one data type and accessed as another. This report describes the implementation of pointers in the PLUM PL/1 compiler such that all error conditions are detected. In addition, preliminary tests with PLUM seem to indicate that the total checking of pointers is not as expensive an operation as it first appears.
A numeric-controlled formatter
Authors: G. M. Seeds, A. Arpin
Venue: Proceedings of the eighth international conference on APL (1976)

Most existing formatters in APL systems use a character vector control argument to achieve flexibility. A formatter is described which uses a numeric control argument for ease of use, and yet provides a high degree of flexibility.
History, features, and commentary on FORMAC
Authors: Elaine R. Bond
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

The purpose of this paper is to summarize significant characteristics and features of the FORMAC system. FORMAC (FORmula MAnipulation Compiler), an extension of IBM 7090/94 FORTRAN IV, permits algebraic manipulation of mathematical expressions. The FORMAC system provides such capabilities as symbolic differentiation, substitution, evaluation, expansion, and finding coefficients. This paper comments on the project formation, FORMAC capability and language, overall approach to implementation, application problems for which the system has proved of value, and the results of an experimental venture to develop a time-sharing FORMAC algebraic desk calculator.
Free groups and regular expressions
Authors: Peter Johansen
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

Group events are defined as regular events recognized by partial group automata. Canonical forms are introduced for the class of regular expressions denoting group events. Algorithms are presented to find a canonical form from a recognizing automaton, to find a recognizing automaton from a canonical form, and to find a canonical form from a regular expression denoting a simple group event. Furthermore an algorithm is presented that decides whether or not two canonical forms denote the same event.