ppxscal/embedding_network huggingface dataset:
Congressional Reliance On And Use Of Computers
Authors: John K. Swearingen, Boyd L. Alexander, John J. Boyle
Venue: Proceedings of the 1978 annual conference (1978)

This session will explore the evolution of information support services on Capitol Hill, with an emphasis on the utilization of information technology: computers, microforms, telecommunications, audio and video technologies. The complexities of changing legislative information needs&mdash;fulfilling chamber, committee, and constituent service requirements alike&mdash;will be discussed in the light of the benefits and limitations inherent in using such technology-supported capabilities as computers. Future options for packaging information, special dynamic display systems, and increased reliance on interactive computer and communications activities will also be discussed.
System structure for software fault tolerance
Authors: B. Randell
Venue: Proceedings of the international conference on Reliable software (1975)

The paper presents, and discusses the rationale behind, a method for structuring complex computing systems by the use of what we term &ldquo;recovery blocks&rdquo;, &ldquo;conversations&rdquo; and &ldquo;fault-tolerant interfaces&rdquo;. The aim is to facilitate the provision of dependable error detection and recovery facilities which can cope with errors caused by residual design inadequacies, particularly in the system software, rather than merely the occasional malfunctioning of hardware components.
CELTIC - solving the problems of LSI design with an integrated polycell DA system
Authors: G. Martin, J. Berrie, T. Little, D. Mackay, J. McVean, D. Tomsett, L. Weston
Venue: Proceedings of the 18th Design Automation Conference (1981)

The major problems associated with LSI design include those of design complexity, documentation, mapping, design verification both functional and physical, physical implementation, and the manufacturing interface. The Design Aids group at Burroughs, Cumbernauld, have developed an integrated LSI design system, CELTIC, which solves these problems with a polycell design approach, direct graphics entry of logic diagrams, and automatic generation of LSI layouts. The system reduces the time required to lay out LSI's from months to weeks.
Retailing computer technology to the uninitiated consumer: the case of computer applications transfer in local governments
Authors: Kenneth L. Kraemer
Venue: Proceedings of the 1976 annual conference (1976)

The &ldquo;faith in technology&rdquo; attitude prevalent in the U.S. extends to local governments, where large programs have been instituted to facilitate technology transfer. This paper examines the technology transfer of computer applications among and into local governments by comparing the benefit claims of transfer software with new data on local government transfer activity and planning, and the harsher realities of actual transfer experience as expressed in seven key points most often found in literature about information systems in local government. This paper does not support or discredit claims about transfer in local government. Rather, it attempts to fill part of the void in rational discussion about transfer by offering broad perspectives on why more transfers do not occur and, in some instances, why they shouldn't occur.
Algorithms for edge coloring bipartite graphs
Authors: Harold N. Gabow, Oded Kariv
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

A minimum edge coloring of a bipartite graph is a partition of the edges into &Dgr; matchings, where &Dgr; is the maximum degree in the graph. Coloring algorithms are presented that use time O(min(&brvbar;E&brvbar; &Dgr; log n, &brvbar;E&brvbar; @@@@n log n, n2log &Dgr;)) and space O(n&Dgr;). This compares favorably to the previous O(&brvbar;E&brvbar; [equation] log &Dgr;) time bound. The coloring algorithms also find maximum matchings on regular (or semi-regular) bipartite graphs. The time bounds compare favorably to the O(&brvbar;E&brvbar @@@@n) matching algorithm, expect when [equation] &le; &Dgr; &le; @@@@n log n.
On-line communications and the computer
Authors: F. K. Morioka, R. M. Wainwright
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

This paper contains information on the general characteristics of the Control Data Corporation, MDM Communications Division M1000 Communications Message Switching System. It is the intent of this paper to discuss the analytic systems approach to the problem that led to the building of unique hardware and software to resolve the message handling functions. The M1000 hardware and software system features are discussed in the paper.
Psycological factors in computer programming advisement in a university environment
Authors: Herbert C. Kugel
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

An eminent psychoanalyst once referred to his profession as &ldquo;listening with the third or inner ear.&rdquo; That is, his work consisted of trying not to listen to his patient's actual words, but, rather, to what the patient was really trying to tell him. Unfortunately, these two things were - and are - quite often not the same things in many areas of human contact, not just psychiatry, and it sometime takes quite a while to find out what a person is really trying to say. If this communication difficulty is recognized in some areas, it is, not recognized in others. The author would like in the following discussion to introduce his reader to: 1 The rigid one 2 The curious one (normal) 3 The curious one (sadistic) 4 The wheeler-dealer 5 The normal soul 6 The poor soul 7. The clinging vine.
Using a sales incentive technique in a first course in software engineering
Authors: Lawrence J. Mazlack
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

The best structure for a first course in software engineering is unclear. First, because what should be taught has not been firmly established to the general satisfaction of those involved. Second, providing a realistic environment to motivate belief in the utility of the practices involved is difficult. A strategy which provides the motivation to understand and develop the tools of software engineering is presented. The strategy also effectively requires a form of peer review. The motivating mechanism is the &ldquo;sale&rdquo; of software modules between class participants.
Hospital administration of large numbers of multi-trauma patients
Authors: Mitchell Snyder, Bruno Lunenfeld, Daniel Lieberman
Venue: Proceedings of seventh international conference on APL (1975)

This paper describes a system of programs written first in APL PLUS and now being transposed to APL/SV that on the one hand provide the Hospital Administration with the means of handling the admission problems, keeping records updated , and keeping track of patient movement and on the other hand provide medical researchers with the means of analyzing the data so gathered.
An electronic design interchange format
Authors: John D. Crawford
Venue: Proceedings of the 21st Design Automation Conference (1984)

The large variety of CAD/CAE tools/systems and foundry services now available to the electronic engineer have brought to a head the long-standing need for a standard format for the exchange of design information. Existing formats have not served this need for a variety of reasons. This paper describes an Electronic Design Interchange Format (EDIF) that has arisen from collaboration of the principals involved in four preceding efforts.
Turing machines and the spectra of first-order formulas with equality
Authors: Neil D. Jones, Alan L. Selman
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

In this paper we show that these similarities are not accidental - that spectra and context sensitive languages are closely related, and that their open questions are merely special cases of a family of open questions which relate to the difference (if any) between deterministic and non-deterministic time-or space-bounded Turing machines.
A portable random number generator with built-in well-spread seeds
Authors: Graham Birtwistle
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper discusses the techniques employed in implementing pseudo-random number generating routines in Demos (a discrete event simulation extension to Simula). We give a basic routine for generating random numbers uniform in the interval (0, 1) and show how this was built out to produce the other standard distributions such as randint, Poisson, negexp, etc.; then we show how the basic routine can be adapted to generate many well-separated seeds; and how to effect automatic reporting. The techniques can be employed with other random number generators and in languages other than Simula.
Conference abstracts
Authors: Vladimir Slamecka
Venue: Proceedings of the 5th annual ACM computer science conference (1977)

One problem in computer program testing arises when errors are found and corrected after a portion of the tests have run properly. How can it be shown that a fix to one area of the code does not adversely affect the execution of another area? What is needed is a quantitative method for assuring that new program modifications do not introduce new errors into the code. This model considers the retest philosophy that every program instruction that could possibly be reached and tested from the modified code be retested at least once. The problem is how to determine the minimum number of test cases to be rerun. The process first involves generating the test case dependency matrix and the reachability matrix. Using the test case dependency matrix and the appropriate rows of the reachability matrix, a 0-1 integer program can be specified. The solution of the integer program yields the minimum number of test cases to be rerun, and the coefficients of the objective function identify which specific test cases to rerun.
SINDECS-R: A robotic work cell simulator
Authors: A. P. Robinson, S. Y. Nof
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

A GASP based simulator has been developed as a tool for examining both robotic work cell layout problems and part flow control problems. The unique modeling requirements for such a simulator are described and demonstrated.
Simulation of centralized computer communications systems
Authors: W. Chou, H. Frank, R. Van Slyke
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

In this paper we describe the simulation approach for a general centralized computer communication system with emphasis on efficiency and versatility. The simulation program consists of three modules representing different levels in a hierarchy. The lowest level models the polled multidrop line connecting remote terminals to the concentrator. The second level models the trunk lines and the concentrator which interfaces the multidrop lines of lower speed to one or more higher speed trunk lines connected to a central computer. The highest level models the central computer which communicates with remote terminals via the trunks. A hybrid simulation approach is used to ease program development and to shorten computer running time. When feasible, empirical distributions, analytical formulae or analytical models are used to eliminate simulation steps and simplify simulation procedures. The techniques developed are illustrated by application to the NASDAQ System.
A symbolic-interconnect router for custom IC design
Authors: Charles H. Ng
Venue: Proceedings of the 21st Design Automation Conference (1984)

The router described in this paper is part of a complete CAD system which aims at hierarchical designs of customized VLSI MOS circuits. It routes global signals as symbolic interconnect and is guaranteed to complete all routing in one pass. The router is fully automatic as well as highly interactive. It employs the novel idea of bouyancy and produces wires with a natural bus structure. The router is fully operational, and has been used in routing a number of real-world integrated circuits.
The VHSIC hardware description language (VHDL) program
Authors: Al Dewey
Venue: Proceedings of the 21st Design Automation Conference (1984)

The emergence of the importance of VLSI design automation and the VLSI custom/semicustom industry has spurred a wide-spread interest in hardware description languages. Starting in 1981, the VHSIC Program has acted as a catalyst to develop a standard hardware description language that could beneficially serve the government, industry, and academic communities. This panel will discuss from different viewpoints the issues associated with VLSI interoperability standards and the potential role of the VHSIC Hardware Description Language.
The Cambridge CAP computer and its protection system
Authors: R. M. Needham, R. D.H. Walker
Venue: ACM SIGOPS Operating Systems Review (1977)

This paper gives an outline of the architecture of the CAP computer as it concerns capability-based protection and then gives an account of how protected procedures are used in the construction of an operating system.
Computer aided design (CAD) using logic programming
Authors: Paul W. Horstmann, Edward P. Stabler
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper gives an overview of expert systems and logic programming as applied to Computer-Aided Design (CAD) systems. Our objective is to show the relevance of these two approaches developed from research in artificial intelligence for the solution of problems in VLSI design. We will provide some examples of the use of logic programming for familiar CAD tasks. The expert systems discussed function as experts in a very narrowly defined area of expertise, and can be called designer's assistants. We will also compare the use of logic programming (PROLOG) to current algorithmic solutions to VLSI design problems and discuss some future research in this area.
Computer simulations
Authors: Daniel L. Klassen
Venue: Proceedings of the 1975 annual conference (1975)

The use of computer simulations as instructional tools has grown considerably in recent years. With the growing availability of instructional-timesharing, expecially in elementary and secondary schools, the use of instructional computer simulations is likely to expand even more. This paper briefly explores the use of computer simulations as learning environments.
Computer-integrated manufacturing in Japan (Panel)
Venue: ACM SIGGRAPH Computer Graphics (1984)

Recent progress in Japanese computer-integrated manufacturing (CIM) includes the integration of computer graphics, database management systems, local area networks, robotics and software engineering technology. This panel will discuss advanced CAD, CAM CAT (computer-aided testing) and FMS (flexible manufacturing systems) available in Japan. After the overview by the Chair Prof. Kunii, the basic CIM related researches to support industrial applications will be explained by Prof. Nakajima of the University of Tokyo. A wide spectrum of recent industrial advances and future trends in Japanese CIM are covered by four panelists from reputed manufacturers and users of CIM facilities and equipments. As one of the features of Japanese CIM, it will be noticed throughout the panel presentations and discussions that manufacturers always send out their products into the market after extensive internal use of them. Mr. Kubo of Hitachi Omika Work will present new networked CIM workstation. A typical example of very large CIM will be shown by Mr. Nakagawa of Mitsui Engineering and Shipbuilding. Very aggressive lines of products and plans are expected from Fanuc and will be presented by Mr. Inaba of GM Fanuo Robotics. Mr. Nishioka of Sharp will conclude the session explaining how he has developed and marketed very practical CIM successfully.
The microcomputer-based turnkey system as an instrument for technology transfer
Authors: Claude McMillan, Wilfredo Salhauna
Venue: ACM SIGCSE Bulletin (1980)

A program involving the installation of 6 microcomputer systems in Latin America (Argentina, Mexico, Brazil, Ecuador and Peru), is described. A rationale for the choice of machines is provided; results to date are reported; and prospects for the future forecast. Lacking a comprehensive understanding of data processing systems, and being generally unaware of the increasing power and reliability of small systems, research center administrators and scientists have been unwilling to divert limited funds from competing demands to equip themselves with DP systems, or with personnel utilize them. The IBPGR funded the DISR in Boulder to try to accelerate the data conversion process among a number of specific centers in Latin America and thus to begin the development of the international data exchange network.
A Diagnostic Emulator for HEAO software development
Authors: Peter H. Beer, Kenneth J. Hupf
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

Diagnostic Emulation is the application of microprogramming to the emulation of an operational computer to support software development and verification for that computer. A conventional technique, Interpretive Computer Simulation (ICS), has been used for many years in support of such software development and verification efforts. The ICS method is becoming less cost effective. For the development of attitude control software for NASA's High Energy Astronomical Observatory (HEAO) diagnostic emulation was considered as an alternative. This paper describes the motivation for using an ICS or diagnostic emulator to validate command and control software, the potential advantages of microprogramming, and the analysis which led to the development of the HEAO Diagnostic Emulator rather than the use of conventional techniques. Also discussed are the emulator implementation tradeoff analysis, the resulting program design, and the interface between the microprogram and the assembly language modules. The results to date are described, including the capability, speed, and reliability of the program and initial user response.
Networking with small computers: Intermediate-level communication protocols
Authors: James R. Low
Venue: Proceedings of the 1979 annual conference (1979)

Low-level communication protocols attack the problems of reliably transferring a bit or byte stream from a program residing on one node of a network to another program (usually residing on a different node). High-level protocols are concerned with the semantics of the distributed activity. For example, to read from a remote file, the high-level protocol might require: an open request; several read requests; and finally a close request with the associated replies.
A fault simulation methodology for VLSI
Authors: John P. Hayes
Venue: Proceedings of the 19th Design Automation Conference (1982)

Some deficiencies of existing simulators in the context of VLSI design and testing are considered. A fault simulation approach based on CSA (connector-switch-attenuator) theory is defined which overcomes many of these deficiencies. The CSA circuit elements and logic values needed to model combinational circuits are described and applied to the analysis of various types of MOS circuits. A charge-storage element called a well is introduced to simulate sequential behavior. It is shown that many fault types, including stuck-line faults, short circuits, open circuits, and delay faults can be modeled in a uniform and efficient manner.
Simulation of an automated stacker storage system
Authors: R. Miles Waugh, Richard A. Ankener
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

The Management Sciences Department at Philips Morris has been investigating areas of optimazation within the Finished Goods Warehouse. In pursuing these studies, simulation models have been used as analytical tools. For modelling, GASP IV Simulation Language was selected since it provides exceptional flexibility. The most recently developed model simulates operations of the automated stacker storage and retrieval system. Through analysis of model behavior, Management Sciences evaluates a variety of algorithms. Concepts such as surge controlled interleaving, zones based on turnover, and load leveling have been tested. After determining which algorithms provide the greatest efficiency, Management Sciences submits reports to appropriate managers. Additional studies are being accomplished by analyzing model behavior at higher production levels to identify system bottlenecks.
Software for mathematical programming
Authors: William Orchard-Hays
Venue: Proceedings of the 1971 26th annual conference (1971)

The development of software for mathematical programming has paralleled the development of basic software and has perhaps the longest history of any application system in the computing field. It is by now powerful and elaborate, as well as complicated and expensive. In spite of some aberrations in the evolution of mathematical programming systems, or MPS&mdash;due to competitive factors for both a business and a professional nature&mdash;a fairly universal set of design specification and performance characteristics have evolved and are now well proven in several systems. Unfortunately, existing capability is seldom used with full effectiveness and useful extensions are passed over even though many are possible with modest expenditure&mdash;provided one builds upon legitimate experience.
A Syntactic Schema And Algorithm For Language Arts CAI
Authors: John G. Allee,  Jr., Robert L. Williams
Venue: Proceedings of the 1978 annual conference (1978)

The stand-alone BASIC programs of English Usage Exercises, a language arts CAI series for elementary school students, employ a number of simple algorithms to generate example sentences and sentence exercises from small data clusters. These individual generative programs, since they need no support from other files, are easily transported and may be employed in microprocessors. A schema devised for a series of EUX programs is exampled. In the schema fifteen sentence &ldquo;forms" accept the present and past tenses of be, do, and have. An algorithm devised to interpret the schema enables the relatively small CAI programs to demonstrate a wide variety of syntactical forms.
Biological primitives
Authors: E. C. DeLand
Venue: Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine (1972)

In developing the graphics computer system BIOMOD, we were concerned primarily with the user-system interface. Rather than developing a formal higher-level language specific to modeling in biology, it appeared more fruitful to examine empirically the activities of the modeling process, and to attempt to design so that these activities would be simple to perform. Unfortunately, however, it still functioned easily only for chemists, mathematicians, and programmers; a biologist would still not write FORTRAN or differential equations to describe the basic functions&mdash;for example, a neuron&mdash;of his problem. We would like, therefore, to describe a set of basic biological functions, or primitives, which can have unambiguous definitions and can be parameterized as required in a straightforward, clear way so that they can be called from the library and used in a new problem context. An extension of this concept is to prepare programmed modules, such as a capillary resistance bed, or models, such as a model of the four-chambered heart as a pump, which could be used as required. However, these latter modeling units are not easily parameterized and are usually too individually stylized to carry over from model to model. Instead, we have been concerned with more basic units which can be standardized, as will be described in subsequent sections of this paper. We first briefly describe the BIOMOD system itself.