ppxscal/embedding_network huggingface dataset:
LETTER: A system for personalizing processed text
Authors: Edward F. Gehringer, Steven R. Vegdahl
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

The need to maintain multiple versions of documents arises in many different situations. For example, software producers may desire to maintain multiple copies of manuals, one for beginners unfamiliar with computers, and another for experienced users. Scientists may have to produce reports in two forms, one for management and another for technical personnel. Elected officials answering constituents' mail on a particular issue like to be able to tailor their response to the perspective of the letter writer. In general, tailoring computer-generated text to different audiences is an important problem, but one which is scarcely addressed by most text-formatting programs. LETTER attacks this problem by providing a high-level language for creating multiple versions. Input to LETTER is in two parts, a profile and a manuscript. LETTER uses information from the profile to decide how to print each copy requested in the manuscript. The profile consists of information about the readers of the document. The manuscript consists of the text of the document, along with directive expressions. These include directives which cause information to be copied from the profile into the document, conditional expressions which depend on information in the profile, and looping directives which cause multiple copies of the document to be produced. LETTER is written in Pascal, and is designed to be portable. The initial version has been developed on a PDP-10, but we plan to install it on a small personal computer in the near future.
Limitations in pattern recognition and problem solving
Authors: Ranan B. Banerji, George W. Ernst
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

This paper discusses the &ldquo;standard&rdquo; techniques used by problem solving and pattern recognition programs. It is pointed out that evaluation functions (often called discriminant functions) lie at the heart of these programs. Simplicity appears to be an important property of evaluation functions because evaluation functions which are both relatively accurate and efficient are in some sense simple. In addition, simple evaluation functions are easier to learn because there are fewer parameters to estimate. The real difficulty is that no general method exists which extracts a good set of features for a particular problem. Even if this were possible one is still faced with the task of combining these features to obtain the &ldquo;answer&rdquo;. In the case of pattern recognition this combination takes the form of connectives such as arithmetic operations or Boolean operations. However, in the case of problem solving, things are much more complicated since features are at the bottom of a search procedure which looks at many different problem states. This presents the difficulty of making good use of such a large volume of information.
Knotted list structures
Authors: J. Weizenbaum
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

In (3) Perlis and Thornton describe a list structure language the central innovation of which is that the last word of each list specifies the location of the head of the list of which it is the terminal word. They call such list structures threaded lists. Beyond this, however, they hypothesize Sequencing Tables and associated sequencing modes (e, l, and w). The sequencing modes make possible forms of traversing list structures which leave the lists themselves undisturbed in memory. Since the Sequence Table can contain true names as well as aliases for particular list structures and since lists are undisturbed by sequencing, many programs may sequence through lists in different manners, at various rates, but still simultaneously. This partially mitigates against the need to store many copies of a list and becomes critical in multiple computer systems in which it may be expected that a number of sub-programs operate on a single list structure (under various aliases) independently. This note describes a generalization of the threaded list. The name given to such generalized threaded list structures is knotted list structures (KLS). The generalization consists essentially of replacing the thread link which Perlis and Thornton place in the R or link position of the last list cell of a list (or sub-list with a Control List (CL) which is attached to the list structure and which contains, among other information, a push down list capable of storing many thread links. The chief advantage of this scheme is that it permits a sub-list to be a sub-list of many lists, something which ordinary threaded lists do not permit. All other advantages of threaded lists are kept.
An application of formac to the Computation of coverage functions
Authors: Samuel D. Oman
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

This paper deals with a method of evaluating coverage functions, significantly different from existing methods in two respects: First, the method uses a new set of damage functions that are on the one hand empirically realistic, and on the other hand are sufficiently mathematically tractable to allow fairly complicated integrals to be evaluated exactly. Second, the method is implemented on the computer by means of FORMAC, the IBM written symbolic mathematical compiler (described in Reference 1). This second aspect, which will be the primary concern of this paper, is an interesting example of how FORMAC may be used when the application of a mathematical approach to an actual &ldquo;real world&rdquo; problem requires cumbersome and involved computations. In Section 1 we discuss the relationship of the damage function to the coverage function, and mention some of the limitations of existing damage functions. Section 2 deals (very briefly) with the mathematics of the new method, which is due to Mario L. Juncosa of The RAND Corporation; a more detailed exposition of the method will be forthcoming from Dr. Juncosa at a later date. In Section 3 we describe the manner in which the method was implemented via FORMAC, together with some of the difficulties encountered. Finally, Section 4 is devoted to a sample problem, in which the method was used to determine the aimpoint of a pair of weapons that would optimize the probability that the target be destroyed.
Univariate power series expansions in algebraic manipulation
Authors: Richard E. Zippel
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In this paper we present a complete algorithm for the determination of univariate power series expansions of meromorphic functions on a Riemann surface. The difficulties involved when expanding at singularities of various forms are discussed. We demonstrate how to use these techniques to calculate limits and as an aid in solving polynomial equations. Finally we discuss several of the implementations of power series manipulation systems with special emphasis on the implementation in MACSYMA.
Computer-based management systems
Authors: Bill Mein
Venue: ACM SIGCSE Bulletin (1984)

Much has been written regarding the need for students majoring in information systems to take a sequence of courses in communications, both oral and written. Most curricula relegate this important area to electives. This curriculum in Computer-based Management Systems (CMS) addresses this issue in a straightforward manner by incorporating courses in humanities and technical communications as part of the major requirements. The curriculum and facilities supporting the curriculum are discussed.
Introduction
Authors: James A. Higgins
Venue: Proceedings of the conference on APL (1969)

This first APL Users Conference was held at the State University of New York at Binghamton, sponsored by the Computer Center, for two explicit purposes: (1) to bring together as a community of users those, primarily in university environments, who were using the APL\360 Terminal System; (2) to indicate to IBM, both by what would transpire and by the volume of response, that the acceptance of the APL language had grown in a short period of time to an unusually high degree. It was our hope that people with common interests and similar application needs might communicate experiences, reflections, projections and goals for their mutual benefit. An implicit consideration was that an early meeting of this sort might eliminate some redundancy in the development of APL programs and give people a preliminary reference list of those to contact regarding program packages. One of the outgrowths of the Conference was a stated desire to begin to develop an APL Users Group which would be the source of publication and distribution of such packages. This will have been further discussed at the August SHARE meeting in Boston this year.
Optimal folding of a paging drum in a three level memory system
Authors: Lee J. Scheffier
Venue: Proceedings of the fourth ACM symposium on Operating system principles (1973)

This paper describes a drum space allocation and accessing strategy called &ldquo;folding&rdquo;, whereby effective drum storage capacity can be traded off for reduced drum page fetch time. A model for the &ldquo;folded drum&rdquo; is developed and an expression is derived for the mean page fetch time of the drum as a function of the degree of folding. In a hypothetical three-level memory system of primary (directly addressable), drum, and tertiary (usually disk) memories, the tradeoffs among drum storage capacity, drum page fetch time, and page fetch traffic to tertiary memory are explored. An expression is derived for the mean page fetch time of the combined drum-tertiary memory system as a function of the degree of folding. Measurements of the MULTICS three-level memory system are presented as examples of improving multi-level memory performance through drum folding. A methodology is suggested for choosing the degree of folding most appropriate to a particular memory configuration.
Small computers (Panel Discussion): The information gap
Venue: Proceedings of the 1979 annual conference (1979)

The numbers and uses of small computer systems have grown so rapidly over the past decade that we, in the industry, are faced with a serious lack of information about them and now they can or should be used. They are cropping up in different places among business and industry, where computers were never anticipated. Long time, &ldquo;veteran&rdquo; segments of industry are using them in ways they never dreamed would be possible. Many laymen heretofore completely unacquainted with the computing process, are now using it in their day-to-day work. Many experienced computer specialists are now using machines in rather &ldquo;unorthodox&rdquo; ways. The results are a good deal of confusion, and a serious void of information about computers and their usability, or lack thereof. This condition is enhanced by the rate at which the industry is growing and the low cost for which systems are selling. Hardware is inexpensive and readily produced. Documentation, on the other hand, is very expensive and time-consuming. The manual that is well-done is almost a sure sign that the product it describes has either become out dated, or was purchased at an exhorbitant price. The purpose of this panel will be to identify some key aspects of this information gap and, hopefully, to suggest some potential solutions, or trends toward solution, of this problem.
Multiprogramming under separate working-set principle
Authors: Huei-hsiung Chuang
Venue: Proceedings of the ACM annual conference (1973)

A program's instruction working set Wi (ti,Ti) at instruction reference time ti is the set of distinct pages among Ti most recently referenced instruction pages. This program's data working set Wd (td,Td) at data reference time td is the set of distinct pages among Td most recently referenced data pages. Using These definitions, a study of properties of this separate working-set model is presented. Results are compared to that of single working-set model1. A model of multiprogramming implementing separate working-set principle is developed. Analysis of this model is also conducted.
ContextCube " Providing Context Information Ubiquitously
Authors: Martin Bauer, Christian Becker, Jörg Hähner, Gregor Schiele
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Sensing the state of the environment is an important source for context-aware applications. Several approaches exist to provide sensor information to mobile application nodes. As the extreme cases we have pure infrastructures and pure ad hoc networks. In order to allow sensor platforms to serve both of these approaches, we have designed a universal sensor platform and integrated it into an infrastructure-based approach as well as into ad hoc networks. In this paper we discuss the requirements on such a platform, the design, and the experiences.
Automatic test-generation and test-verification of digital systems
Authors: J. P. Verma, D. M. Selove, J. N. Tessier
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The widespread use of large scale and medium scale integrated circuits, coupled with the trend towards larger boards, made manual generation of test patterns very expensive, somewhat ineffective, and rather difficult to update for design changes. The advent of MOS LSI's with extremely large gate density made manual test-verification, the process of finding failures detected by a given test pattern, an impossibility. Therefore, a series of programs was developed, over the years, to completely automate the test cycle&mdash;using logic description files as input, the final output for test generation is a test deck compiled in the language of card test equipment and, in the case of test-verification, lists of detected and undetected failures. All this is accomplished within the global constraint of complete (nearly 100%) coverage and prevailing test floor practices.
INCENSE: A system for displaying data structures
Authors: Brad A. Myers
Venue: Proceedings of the 10th annual conference on Computer graphics and interactive techniques (1983)

Many modern computer languages allow the programmer to define and use a variety of data types. Few programming systems, however, allow the programmer similar flexibility when displaying the data structures for debugging, monitoring and documenting programs. Incense is a working prototype system that allows the programmer to interactively investigate data structures in actual programs. The desired displays can be specified by the programmer or a default can be used. The default displays provided by Incense present the standard form for literals of the basic types, the actual names for scalar types, stacked boxes for records and arrays, and curved lines with arrowheads for pointers. In addition to displaying data structures, Incense also allows the user to select, move, erase and redimension the resulting displays. These interactions are provided in a uniform, natural manner using a pointing device (mouse) and keyboard.
An introduction to the Programmer's Workbench
Authors: T. A. Dolotta, J. R. Mashey
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The Programmer's Workbench (PWB) is a specialized computing facility dedicated to satisfying the needs of developers of computer programs. The PWB might well be called a &ldquo;human-end&rdquo; computer; like &ldquo;front-end&rdquo; and &ldquo;back-end&rdquo; computers, it improves productivity by efficient specialization. It provides a convenient working environment and a uniform set of programming tools to a diverse group of programming projects. These projects produce software for various &ldquo;target&rdquo; computers, including IBM System/370 and UNIVAC 1100 systems of much greater size than the PWB machines. The projects range in size from several people up to several hundred. The first PWB machine was installed in October, 1973; usage, acceptance, and interest have grown rapidly since that time. The PWB currently supports about 110 time-sharing terminals, utilizing a network of four DEC PDP-11 computers, all running the UNIX Time-Sharing System. The PWB adds tools to UNIX to support large projects. This paper gives an overview of the PWB and its development; further details appear in the five following companion papers [BIA76A, DOL76B, KNU76A, MAS76A, MAS76B].
The role of representation in artificial intelligence(Tutorial Session)
Authors: Ira Goldstein, Gary G. Hendrix
Venue: Proceedings of the 1976 annual conference (1976)

In the effort to construct intelligent computer systems, a primary consideration is how to represent large amounts of knowledge in a fashion that permits their effective use and interaction. Indeed, many researchers in the field of artificial intelligence have come to believe that knowledge representation is the fundamental issue in the attempt to understand intelligence. The presentations in this session explore this issue and describe two current important knowledge representation methodologies, namely frames and semantic nets.
Virtual terminal management in a multiple process environment
Authors: Keith A. Lantz, Richard F. Rashid
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

Rochester's Intelligent Gateway provides its users with the facilities for communicating simultaneously with a large number of processes spread out among various computer systems. We have adopted the philosophy that the user should be able to manage any number of concurrent tasks or jobs, viewing their output on his display device as he desires. To achieve this goal the Virtual Terminal Management System (VTMS) converts a single physical terminal into multiple virtual terminals, each of which may be written to or queried for user input. VTMS extends the features of the physical terminal by providing extensive editing facilities, the capacity to maintain all output In disk-based data structures, and sophisticated mechanisms for the management of screen space. Virtual terminals are device-independent; the specific characteristics of the physical terminal are known only to the lowest-level I/O handlers for that device. VTMS Is currently running on a network of six minicomputers supporting various text and raster-graphics displays.
A functional microcomputer network
Authors: C. R. Carman
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

Bishop's, like many other small universities and colleges, is constantly striving to supply state of the art computing facilities to students, faculty, and the administration from very limited funds. The very advantageous cost/performance ratio of this network has allowed the university to obtain such facilities while remaining within budget constraints. The paper describes the computer network of microcomputers installed at Bishop's in the summer of 1981. The experience of the first academic year of actual operation will be outlined. The equipment will be used as the major computing facility on campus. Briefly, the network consists of two nodes, with internode communication capability; 20 independent work stations (soon to be increased), two 80 MB Winchester disk drives, two floppy disk units, two high speed printers and a &ldquo;Diablo-like&rdquo; printer for word processing applications, and a digital plotter. There is also a communication link to the minicomputer being replaced by the new network. Some of the features of the network include: automatic spooling of output to all printers, individual accounting controls (i.e. assignment of passwords, control of disk space including write protection of volumes, control of lines printed per job and per academic term), support of multiple operating systems, and support of multiple processors. The paper will describe our very positive experience with the system, and our future plans.
The open shop interactive mask design operation at harris semiconductor
Authors: Justin E. Harlow,  III, Harris Semiconductor, Palm Bay Florida
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper discusses the evolution of a unique setup for design of integrated circuit masks, using interactive graphics equipment in an open shop environment. The evolution of this design philosophy is traced from manual drafting and digitizing, through limited computer editing, to the present drawing-free methods. Implementation and continuing operation of the facility have posed many unusual problems of load distribution, priority management, control of users and procedures, and data integrity. Harris' solutions to these problems and the resulting high efficiency are discussed.
Documentation Project: Academic software resources
Authors: Carole (Kelly) Havens
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

Over a period of years, an academic user services group can go through enough personnel changes to cause a loss in continuity in documentation. As a result, hundreds of inadequately documented resources can accumulate, become obsolete, or come to exist in multiple copies and versions. User Services may find themselves having to rely on individual users or former staff to supply information on the more obscure resources. Their task, therefore, becomes the creation of a data bank of information documenting all of the functional academic resources on the system. We are now in our second year of such a Documentation Project. We are pleased with the progress and hope that it will provide the foundation for a lasting system. Throughout, we have attempted to make the system easy to maintain and flexible to future expansion. Our considerations during the project are the topic of this paper. These considerations will be covered in order: 1) determining what data items to collect, 2) determining the resources to target, 3) deciding on a medium and format for storing the data bank, 4) providing a means of easy access for staff, 5) developing a means by which users can make use of the data bank, and 6) getting it all accomplished. The first five items involve planning considerations, the last item describes one working implementation.
MAP: A user-controlled automated Mask Analysis Program
Authors: Cheryl L. Mitchell, John M. Gould
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The Mask Analysis Program is a totally general and application independent FORTRAN program for the analysis and manipulation of graphic data. It is particularly useful in integrated circuit design analysis.
A model for simulating combat medical support systems
Authors: Paul B. Richards, J. Raymond Fletcher, Claude Delfosse
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

A computer model that simulates the complexities of an emergency medical system is described. The model represents a medical system that includes various levels of casualty receiving and treatment facilities. The purpose of this model is to provide a computational tool for the comparative analysis and the evaluation of emergency medical care systems. The model demonstrates the effects of the many components comprising a medical treatment and evacuation system, namely casualty receiving facilities, modes of transportation, logistical support, and medical technology. These variables can be manipulated to meet the needs of the user. The results obtained with this model demonstrate that in order to improve the survival of trauma patients, the number of high speed vehicles is more important than their capacity. Vehicle readiness to respond to evacuation requests is also very important in improving the survival. In addition, by increasing the number of surgeons by 50%, the mortality substantially decreases. Elimination of the intermediate level hospital facilities appears to more than double the mortality. The NAMES II (Navy Amphibious Medical Evacuation Simulation) Model, although designed for combat situations, can be adapted for contingency planning in almost all medical emergency systems.