ppxscal/embedding_network huggingface dataset:
Author, publisher, and computer center
Authors: Robert C. Gruen
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Two developments in the writing and manufacturing of books are already bringing the university computer center into the text business and may, before long, create closer ties among authors, publishers, and computer centers. First, authors are using word processors and text editors to prepare their manuscripts, and they have a right to demand that their effort in getting the text correct should not be lost in rekeying when the manuscript is set into type. Publishers, on the other hand, are frequently unable to read and make use of the variety of cassettes, diskettes, and tapes they receive from authors. Since many of those authors work at university campuses, university computer centers could provide a natural intermediary, helping the authors create files in media and formats the publishers can use. Second, university computer centers have begun installing non-impact printers capable of producing at high speed finished pages of a quality suitable for a broad range of textbooks and scholarly publications. This suggests a much larger role for the computer center in the final production not just of its own documentation but (with attendant financial headaches) of texts transmitted by publishers for demand printing. Thus the bulk of this paper, an account of what we've tried and what success and frustration we've met, is offered for the interest it may have to those who are trying to establish procedures for text handling. Then the latter part of the paper presents some current developments that, had they been completed several years ago, would have greatly simplified our efforts.
User services in the Mid-Illinois Computer Cooperative
Authors: Jack Thompson
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

The Mid-Illinois Computer Cooperative (MICC) was established in 1974 with the primary mission of supplying supplementary computer services for the research and instructional programs of its five member universites: Eastern Illinois University (EIU), Illinois State University (ISU), Sangamon State University (SSU), Southern Illinois University at Edwardsville (SIU-E), and Western Illinois University (WIU). MICC functions as a conventional 'star' network (see Figure 1). A Contral Data Cyber 7214, located in Edwardsville, Illinois, is connected by leased, voice-grade telephone lines to member campuses. Both batch and interactive terminals are supported. There is one RJE terminal and anywhere from 7 to 20 interactive terminals on each campus (see Figure 2). The KRONOS operating system is used and a wide variety of languages and application packages are supported. Each of the five member institutions has a separate, stand-alone computer facility. These local installations, which range in size from a Xerox 530 to an IBM 370/145, are used to handle the administrative work load and that portion of the academic work load which requires high speed batch I/O. MICC policies are established by an operating board which is composed of two representatives from each institution and one representative from IEC. Policy decisions are implemented and operational direction provided by an executive director who reports to the Board. The staff of MICC has been kept small by design. Most of the direct interaction with users is handled by user coordinators, i.e., individuals from the staffs of the member universities who have been assigned to help develop MICC usage. A single person is designated as User Coordinator for each university although that person may, in turn, direct a staff of several full and/or part-time consultants.
Integrated computer aided design, documentation and manufacturing system for PCB electronics
Authors: Mikko Tervonen, Hannu Lehikoinen, Timo Mukari
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes an integrated computer aided design, documentation and manufacturing system, which assures data integrity from physical design to manufacturing with the aid of one phase data input and integrated parts data base. Unique features of the system are comprehensive documentation support for PCB electronics, one-phase user friendly data input, intensive input data checking, support for part and document numbering and PCB numbering, user definable document formats and languages and fully automatic generation of N.C. programs for insertion machines and input data for test equipment. Although the design support is highly automatic, the system is just computer aided allowing the user to control the work flow and by providing the possibility for the user to overdrive the data base information. The designer experience, intuition and imagination can be fully utilized.
Computers help solve problems in multinational corporations
Authors: E. Jane Powanda
Venue: Proceedings of the 1979 annual conference (1979)

A broad picture is presented of the ways that computers have been and can be utilized by companies dealing in international business. Emphasis is placed on the use of the computer as a management tool, the use of the computer to bring corporate headquarters and foreign subsidiaries closer together, and on some of the new problems created by international computer usage that will require resolution in the next decade.
Primitives for distributed computing
Authors: Barbara Liskov
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

Distributed programs that run on nodes of a network are now technologically feasible, and are well-suited to the needs of organizations. However, our knowledge about how to construct such programs is limited. This paper discusses primitives that support the construction of distributed programs. Attention is focussed on primitives in two major areas: modularity and communication. The issues underlying the selection of the primitives are discussed, especially the issue of providing robust behavior, and various candidates are analyzed. The primitives will ultimately be provided as part of a programming language that will be used to experiment with construction of distributed programs.
Environment primitive operators in programming languages
Authors: Richard O. Clark, James F. Leathrum
Venue: Proceedings of the ACM annual conference (1973)

An extensible language implies that the fundamental semantics of a programming language are included in the base language. Those basic operations which are not so defined cannot be produced by extension. One aspect which has not been decomposed into a set of primitive actions is that of environmental operators. These are operators which describe the binding between a symbol, its value-structure, and a value. As a result, the execution environment of the base language applies to each extension and the style of the language remains fixed. The same remarks also apply to formal semantic descriptions of programming languages. In this paper a value storage mechanism, a value reference mechanism, and a set of binding operators are proposed which permit the execution of a program in the context of a FORTRAN, ALGOL, PL/1, or APL environment.
The Honeywell Modular Microprogram Machine: M3
Authors: E. Douglas Jensen, Richard Y. Kain
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

M3 is intended for research into unconventional special purpose stored program elements of computer systems (for example, a distributed computer Bus Interface Unit). The principal requirements for such a machine are flexibility and modularity. M3 consists of an application independent Kernel Machine to which application-dependent Functional Modules are attached. The Kernel Machine is vertically microprogrammed; it includes highly capable microinstruction sequencing logic which facilitates structured microprogramming. The Functional Modules contain the operand registers and the operators (e.g., adders, shifters, etc.) needed by the specific application. The operators may be invoked not only by the Kernel Machine but also by one another; control may be passed among operators in a sequential or hierarchical fashion; operators may execute concurrently with each other and with the Kernel Machine; operators may be re-entrant or recursive; operators may activate themselves, or cause microcode interrupt routines to be executed in the Kernel Machine.
A student project on political redistricting by computer
Authors: David I. Steinberg
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

On November 17, 1970, the editorial section of the St. Louis Post-Dispatch featured an editorial which urged that the current spate of political redistricting problems (required by law after each census) be accomplished by computer, rather than by the usual partisan haggling and maneuvering. The author of this paper seized upon this editorial and suggested to the Washington University Student Chapter of the Association for Computing Machinery that the problem of political redistricting by computer would make an excellent project for presentation in the Washington University School of Engineering and Applied Science's annual Engineers Weekend activities. The Chapter then decided to undertake such a project, and the chapter president and this author prepared a response to the Post-Dispatch's editorial, in which it was pointed out that the use of computers in treating political redistricting problems involved far more than merely &ldquo;feeding&rdquo; the computer with the relevant population data;
A mechanism for information control in parallel systems
Authors: Richard P. Reitman
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

Denning and Denning have shown how the information security of sequential programs can be certified by a compile-time mechanism [3]. This paper extends their work by presenting a mechanism for certifying parallel programs. The mechanism is shown to be consistent with an axiomatic description of information transmission.
The Distributed Double-Loop Computer Network (DDLCN)
Authors: Ming T. Liu, Sandra A. Mamrak, Jayshree Ramanathan
Venue: Proceedings of the ACM 1980 annual conference (1980)

This paper presents the design of the Distributed Double-Loop Computer Network (DDLCN), which is a local-area distributed computing system that interconnects midi, mini and micro computers using a fault-tolerant double-loop network. Several new features and novel concepts have been incorporated into the design of its subsystems, viz., the reliable communication network, the programming/operating system (P/OS), and the distributed loop data base system (DLDBS). The interface design is unique in that it employs tri-state control logic and bit-sliced processing, thereby enabling the network to become dynamically reconfigurable and fault tolerant with respect to communication link failure as well as component failure in the interface. Three classes of multi-destination communication protocols, each providing a different degree of reliability, have been incorporated into the network to facilitate efficient and reliable exchanges of messages. The P/OS is distinguished from other similar research efforts in that its ultimate goal is to support not only communication and cooperation among autonomous, distributed processes running at various nodes, but also to support convenient and correct resource sharing through program generation (semi-automatic programming) for application and systems programmers. A new concurrency control mechanism for DLDBS has been developed, which uses distributed control without global locking and is deadlock free. In addition to being simple to implement and having good performance (high throughput and low delay), the mechanism is also robust with respect to failure of both communication links and hosts.
An answer to a user's plea?
Authors: D. E. Morgan, J. A. Campbell
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

An era of consumer awareness and power is upon us. Although the great &ldquo;Silent Majority&rdquo; of computer system users (or consumers) may not be aware of it yet, the dawn of their era of awareness and power is near! With the development of multiaccess computer systems and networks of computers, the user is beginning to get the opportunity to employ his choice of system to execute his programs. Even now, some fortunate users are no longer constrained to use the possibly inefficient services of the neighborhood computer monopoly, their organization's local computer center. They are able to run their programs at installations that give them the most for their money, merely by punching the buttons of their telephone. As this era dawns, directors of inefficient computer centers must be wary lest their empires wither from lack of users. But alas, the poor user! A few problems must be solved even as his era dawns! How does he know that computing at his local computer centre costs too much? How can he determine which system gives him the &ldquo;biggest bang for his buck&rdquo;?
Functional simulation shortens the development cycle of a new computer
Authors: Raymond Cheng, Brian Griffin, Kun Katsumata, John Welsh
Venue: Proceedings of the 20th Design Automation Conference (1983)

A high-performance VLSI CPU subsystem for an Ada-oriented 32-bit Instruction Set Architecture was effectively designed and validated on a short schedule using the ISP' hardware descriptive language and N.mPc functional simulation tools. The architecture employs a horizontal microcode structure that drives numerous parallel hardware functions to achieve a throughput performance approaching 3 mips. The design approach incorporated construction of individual ISP' models and simulation of the total system to ensure the functional correctness of the total architecture, the VLSI device partitions, and the detailed interfaces. Additionally, firmware for the complete instruction set was produced and verified by means of simulation on the models. The effectiveness of this approach is evidenced by the efficient CPU functional design and validation work and the rapid integration of the microcode on an advanced development model of the system. The success of this design approach has been a key factor in meeting the development schedule.
Analysis of reliable multicast algorithms for local networks
Authors: Paul V. Mockapetris
Venue: Proceedings of the eighth symposium on Data communications (1983)

Local networks offer unique opportunities for supporting multicast transmissions. This paper describes and analyzes several families of multicast algorithms for local networks. The algorithms examined provide reliable service by dealing with the effects of transmission errors.
Software verification and validation(Position Statement)
Authors: Marilyn S. Fujii
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Logicon was an original advocate of software verification and validation (V V). We began performing V V for the Air Force when the control of critical functions in space and missile applications moved from hardware into software. Since these early beginnings, V V has evolved at Logicon to embrace several complementary techniques for software evaluation. Current V V methods rigorously test and analyze the software to ensure that it performs all intended functions and that it does not cause unintended functions to occur.
Alignment by maximization of mutual information
Authors: P. Viola, W. M. Wells,  III
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

A new information-theoretic approach is presented for finding the pose of an object in an image. The technique does not require information about the surface properties of the object, besides its shape, and is robust with respect to variations of illumination. In our derivation, few assumptions are made about the nature of the imaging process. As a result, the algorithms are quite general and can foreseeably be used in a wide variety of imaging situations. Experiments are presented that demonstrate the approach in registering magnetic resonance images, aligning a complex 3D object model to real scenes including clutter and occlusion, tracking a human head in a video sequence and aligning a view-based 2D object model to real images. The method is based on a formulation of the mutual information between the model and the image. As applied in this paper, the technique is intensity-based, rather than feature-based. It works well in domains where edge or gradient-magnitude based methods have difficulty, yet it is more robust then traditional correlation. Additionally, it has an efficient implementation that is based on stochastic approximation.
The development of the General Purpose Simulation System (GPSS)
Authors: Geoffrey Gordon
Venue: ACM SIGPLAN Notices (1978)

The General Purpose Simulation System (GPSS) is a programming system designed for the simulation of discrete systems. These are systems that can be modeled as a series of state changes that occur instantaneously, usually over a period of time. Complexities in their analysis arise because there are many elements in the system, and there is competition for limited system resources. The simulation technique uses numerical computation methods to follow the system elements through their changes of state, and predicts properties of the system from measurements on the model. GPSS came into existence rapidly, with virtually no planning, and surprisingly little effort. It came rapidly because it filled an urgent need that left little time for exploring alternatives. The lack of planning came from a happy coincidence of a solution meeting its problem at the right time. The economy of effort was based on a background of experience in the type of application for which the language was designed, both on the part of the designer and the early users.
Applications of computer simulation and related techniques to patient scheduling and medical administration
Authors: David Garfinkel
Venue: Proceedings of the 1971 26th annual conference (1971)

Possible applications of simulation and operations research to problems of optimal use of certain medical resources are analyzed. The problems considered include scheduling of the out-patient clinic, the private doctor's office practice, and work-up of hospital in-patients. In all of these situations traditional assumptions regarding the relative value of the doctor's and patients time have lost validity. The efficient use of space within a hospital, the minimization of travel time by members of a geographically fragmented activity, and optimization of transportation facilities are considered. A possible simulation and optimization of group practice is described. The need for interaction between clinicians and simulationists, and for joint training of personnel, is stressed.
Improving white collar productivity
Authors: S. Ron Oliver
Venue: Proceedings of the ACM 1980 annual conference (1980)

This discussion will begin with a brief survey of the variety of ways in which the panelist has observed small computers being utilized by business and industry. Special emphasis will be placed on applications which perform or enhance the various functions of managing an office or business. In summary it will be noted that the vast majority of business applications center around one or both of two themes: a. Replace systems or subsystems previously run on large mainframes. b. Provide a mechanism (e.g., RJE) for accessing systems or subsystems on larger machines.
Structured design methodologies
Authors: G. D. Bergland
Venue: Proceedings of the 15th Design Automation Conference (1978)

This tutorial considers the structure and construction of reliable software. By way of introduction, several of the structured programming and software engineering techniques are classified into three groups; those which impact primarily on the program structure, the development process, and the development support tools. Structural Analysis Concepts are described which have their major impact at the code level, the module level, and the system level. Finally, three of the major structured design methodologies which have been reported in the literature are developed and compared. Functional Decomposition, the Data Flow Design Method, and the Data Structure Design Method are described, characterized, and applied to a specific example. While no one design methodology can be shown to be &ldquo;correct&rdquo; for all types of problems, it is felt that these three can cover a variety of applications. An &ldquo;interim&rdquo; approach for large software design problems is suggested which may be useful until an accepted &ldquo;correct&rdquo; methodology comes along.
Formal definition of programming languages (Panel Session): &ldquo;The lambda calculus approach&rdquo;
Authors: Burt Leavenworth
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A useful mathematical model for block structured programming languages is Church's lambda calculus. The first paper presents a tutorial on the &lgr;-calculus and its relationship to programming languages. The second paper, using techniques introduced in the first paper, addresses certain fundamental questions in the definition of programming languages.
Computer aids to code checking
Authors: Ira C. Diehm
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

When a complex routine is tried on a computer for the first time, it is seldom found to be free from error. The trend toward automatic performance of the clerical parts of the coding process should reduce the number of coding errors. This mechanization of coding is the subject of several methods of eliminating errors before going to the computer. On the other hand, our machines are intended to help to eliminate such drudgeries, so that we are interested in how the machines themselves can be used to analyze coding errors. In the first place, most computers have convenient built-in features which are useful to this end. The term &ldquo;breakpoint&rdquo; is used to mean a special programmed halt which may be overridden by a manual switch. Many machines have breakpoint provisions, means for determining the contents of particular memory locations, and means for determining what instruction is being executed. In addition to these, SEAC, the National Bureau of Standards Eastern Automatic computer, for example, has a device called the &ldquo;automonitor&rdquo;, which will automatically record each instruction and its result. This device was not originally on the machine. One of the first diagnostic routines we used was a routine of the interpretive type which recorded each instruction and its result, while the routine was apparently being executed in the normal manner. The engineers noted that this could be done automatically with a very few engineering changes, so they added the &ldquo;automonitor.&rdquo; The device can also be used to record the instruction and result only on predetermined instructions, in fact it is most valuable when used in this way.
How to write correct programs and know it
Authors: Harlan D. Mills
Venue: Proceedings of the international conference on Reliable software (1975)

There is no foolproof way to ever know that you have found the last error in a program. So the best way to acquire confidence that a program has no errors is never to find the first one, no matter how much it is tested and used. It is an old myth that programming must be an error-prone, cut-and-try process of frustration and anxiety. The new reality is that you can learn to consistently write programs which are error free in their debugging and subsequent use. This new reality is founded in the ideas of structured programming and program correctness, which not only provide a systematic approach to programming but also motivate a high degree of concentration and precision in the coding subprocess.