ppxscal/embedding_network huggingface dataset:
Denotational semantics of concurrency
Authors: J. W. de Bakker, J. I. Zucker
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

A general framework for the denotational treatment of concurrency is introduced. The key idea is the notion of process which is element of a domain obtained as solution of a domain equation in the style as considered previously by Plotkin. We use tools from metric topology as advocated by Nivat to solve this equation, show how operations upon processes can be defined conveniently, and illustrate the approach with the definition of a variety of concepts as encountered in the study of concurrency. Only few proofs of the supporting mathematical theory are given; full proofs will appear in the final version of the paper.
PAS-CIP: An interactive logic design system
Authors: Gotaro Odawara, Satoshi Kurishima, Hiroshi Aoyama, Yasuhiko Kanaya
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper discusses a Circuit Information Processor(CIP), a subsystem of a Packaging Automation System(PAS), currently under development at the University of Tokyo. The CIP is an interactive design system for digital circuits. As an interactive tool for the CIP, a template which is used by the designer to enter the circuit information into the computer data base, has been developed in our laboratory. In the CIP, the data base for the packaging design system is generated by drawing a logic diagram with the template on a digitizer.
The york APL command processor for TSO
Authors: Enio Presutto
Venue: Proceedings of seventh international conference on APL (1975)

This paper will describe the York University implementation of the APL language, highlighting the version designed to run as a Command Processor under the Time-sharing Option of the IBM System/360-370 Operating System.
Methods for specifying display parameters in graphics programming languages
Authors: Elaine L. Thomas
Venue: ACM SIGGRAPH Computer Graphics (1976)

A general purpose graphics programming language should provide a means for specifying not only the lines, characters, and/or surfaces which compose a picture but also parameters such as the intensity of a particular object in the picture and the relative position of one object with respect to another in the picture. This paper will address the manner in which graphics programming languages associate display parameters with display objects. The syntax of the particular graphics programming language will not be considered, nor will the capabilities of the display hardware with which the language is associated. Instead, the paper will concentrate on the semantics of display parameter specification.
TORNET: A local area network
Authors: Z. G. Vranesic, V. C. Hamacher, W. M. Loucks, S. G. Zaky
Venue: Proceedings of the seventh symposium on Data communications (1981)

TORNET is an experimental local area computer network presently being designed and built in the Computer Group Laboratory of the Department of Electrical Engineering at the University of Toronto. The network consists of a number of local rings, each attached to a central ring. The local rings employ a variation on the slotted-ring format that uses a limited insertion technique to achieve reasonable response times for character traffic among many devices and small computers. Two fixed-length packet formats (one byte or 128 bytes of data) are used on the local rings. Only the longer format is used on the central ring which generally provides record level access to shared specialized equipment. The main objective in the local ring design is a low-cost port for inexpensive terminals, sensors, etc. The paper concentrates on the functional characteristics of the local rings, including delay-throughput comparisons with other well-known ring schemes.
Security design considerations of hardware
Authors: Richard A. Smith
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Traditionally, computer hardware have been designed independent of the total system's approach. Central processing units can usually provide protection under software and firmware control, but do not provide for software copy protection and data integrity automatically. Storage devices and peripherals have been built to receive and transmit information without being regarded as a valuable resource. The operation, reliability, and performance of computer systems is usually measured with respect to the hardware device, requiring software to gather and correlate data into meaningful units of measure. This session will discuss the security design and functional specifications of fifth generation computer hardware by concentrating on the relationship between storage devices, processor units, and configuration management issues. The relationship is defined as execution stylometry or a means of fingerprinting software to hardware. In today's business environment, more and more dependencies have been based on the availability of information and the validity of that information. Attempts to satisfy the security needs of business through software have proved unsuccessful and ineffective. The opportunities to specify the building blocks and integration criteria in fifth generation systems provide a mechanism for satisfying these security needs.
Soft machines: A philosophy of user-computer interface design
Authors: Lloyd H. Nakatani, John A. Rohrlich
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Machines and computer systems differ in many characteristics that have important consequences for the user. Machines are special-purpose, have forms suggestive of their functions, are operated with controls in obvious one-to-one correspondence with their actions, and the consequences of the actions on visible objects are immediately and readily apparent. By contrast, computer systems are general-purpose, have inscrutable form, are operated symbolically via a keyboard with no obvious correspondence between keys and actions, and typically operate on invisible objects with consequences that are not immediately or readily apparent. The characteristics possessed by machines, but typically absent in computer systems, aid learning, use and transfer among machines. But &ldquo;hard,&rdquo; physical machines have limitations: they are inflexible, and their complexity can overwhelm us. We have built in our laboratory &ldquo;soft machine&rdquo; interfaces for computer systems to capitalize on the good characteristics of machines and overcome their limitations. A soft machine is implemented using the synergistic combination of real-time computer graphics to display &ldquo;soft controls,&rdquo; and a touch screen to make soft controls operable like conventional hard controls.
Shared functions and variables as an aid to applications design
Authors: Michael J.A. Berry
Venue: Proceedings of the international conference on APL (1984)

Analogic APL incorporates true sharing of named objects into APL for the first time. Both functions and variables may be shared. True shared variables are variables which are visible and accessible to multiple tasks without the aid of any intervening processor. They fill roles traditionally taken by shared file systems and (@@@@)SVO-style shared variables. Their straightforward design allows an APL programmer to develop whatever sharing protocol is most appropriate to the application. One could, for example, build a complete shared file system or (@@@@)SVO-style shared variable processor written in APL. All of the features of Analogic APL discussed in this paper have been fully specified. The system is now being implemented. A substantial subset of these features will be demonstrable in Helsinki in June, 1984.
A client-based transaction system to maintain data integrity
Authors: William H. Paxton
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

This paper describes a technique for maintaining data integrity that can be implemented using capabilities typically found in existing file systems. Integrity is a property of a total collection of data. It cannot be maintained simply by using reliable primitives for reading and writing single units&mdash;the relations between the units are important also. The technique suggested in this paper ensures that data integrity will not be lost as a result of simultaneous access or as a result of crashes at inopportune times. The approach is attractive because of its relative simplicity and its modest demands on the underlying file system. The paper gives a detailed description of how consistent, atomic transactions can be implemented by client processes communicating with one or more file server computers. The discussion covers file structure, basic client operations, crash recovery, and includes an informal correctness proof.
Validation of simulation models
Authors: Robert G. Sargent
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

This is a tutorial paper on validation of simulation models. Included in this tutorial are what is meant by validation, the problem dependent characteristics of simulation model validation, descriptions of the various validation techniques and their use and a discussion on the statistics used in validation techniques (but not the detailed statistical tests themselves).
Rectangularly arranged collections of collections
Authors: Trenchard More
Venue: Proceedings of the international conference on APL (1982)

The concepts of collection, rectangular arrangement, and membership for nested arrays are discussed separately and independently of array-theoretic operations. The concepts are illustrated by examples generated in the Nested Interactive Array Language, Nial.
A layout verification system for analog bipolar integrated circuits
Authors: Erich Barke
Venue: Proceedings of the 20th Design Automation Conference (1983)

A new layout verification system, called ALAS (ALayout Analysis System) is presented. Its main intention is to tackle the particular verification problems of analog bipolar circuits. At present, the system comprises four main parts: a device recognition program produces a list of devices, a plot program converts these data to a layout-oriented circuit diagram, a connectivity analysis program yields device-oriented or net-oriented descriptions of the derived circuit and a network comparison program tests the consistency of this actual circuit with the intended nominal one. A fifth program, that will calculate the parameters of the actual circuit, is under development. To derive the actual circuit from layout ALAS uses geometrical mask data only; no additional circuit information is needed. If not available from the design system, a description of the nominal circuit may be supplied manually in a SPICE-like input format.
System correctness
Authors: Alan Ballard, Dennis Tsichritzis
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

There is no question that reliability is an important factor in the production and life cycle of software. Logical correctness is the first step towards achieving reliability. While operating systems may be too large to prove correct, in view of the current state of the art, there are often key algorithms and critical properties which are good candidates. A precise statement of the properties, assumptions, and theorems involved greatly influences the reliability of the program. As a side benefit we get a tremendous understanding of the operation of the programs while trying to prove their correctness. By the time we have stated formally all the properties, assertions and theorems involved, the program is sufficiently analyzed informally to ensure its correctness for all practical purposes.
Image enhancement using watershed-based maximum homogeneity filtering
Authors: M. W. Hansen, W. E. Higgins
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

892 Abstract: We introduce an image enhancement method referred to as watershed-based maximum homogeneity filtering. This enhancement technique uses watershed analysis to initially cluster groups of similar connected pixels into catchment basins. Similar neighboring catchment basins are then averaged together to compute the filtered image. As illustrative results show, this technique compares well to other popular nonlinear filters.
Power system load flow in APL
Authors: Wilbur R. LePage, Lowell E. Lingo
Venue: Proceedings of the sixth international conference on APL (1974)

A set of APL functions has been developed for the purpose of simulating a power system and performing load flow studies. The functions constitute a "higher order" power system language consisting of 25 functions. Most of these functions provide interaction with the data stored in a file which represents the parameters of the network and its state with respect to voltage, power and reactive voltamperes. This interaction permits values to be changed, and results to be read out. Three of the functions are used to produce solutions. This set of functions accomplishes what some years ago was done on an analog device (network analyzer) and now is usually done in a batch processing mode. Engineers recognize that the analyzer was a better learning instrument than a batch processing computer. The APL system regains some of the advantages of the analyzer (individual control of parameters and readout, and immediacy of results). Accordingly, although the APL system described in this paper is not capable of handling the large networks of practical importance in the power system industry, it is felt that there are applications in education. Because of the large amount of data to be handled, a file system is necessary. The system described in this paper is in APL PLUS.
Dynamic e-Services in Collaborative Applications
Authors: Silvia Llorente, Jaime Delgado
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Electronic commerce users increasingly demand new kind of services, which can be adapted to their needs. Focusing on this, we present dynamic e-services (electronic commerce of services). These services have some special characteristics that determine theirdynamism. For example, they may involve several users, the number depending on the specific service. These users could interchange information that is grouped into steps. The relationship among that group of steps could be modelled with the help of a workflow.To develop e-services with these characteristics, we have defined a methodology that we present here. To illustrate its use, we also present an example of development of e-service: collaborative edition with moderator.
Simulation analysis
Authors: W. David Kelton
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The use of a computer simulation model to learn about the system(s) under study must involve an analysis of the results from the simulation program itself. A classification of simulation types is given which provides a framework for a treatment of simulation analysis. A more detailed discussion of the most difficult class of simulation analysis is presented. Various goals of analyses are mentioned, together with a brief discussion of related topics.
How does a centralized computer center with a large mainframe adapt to the introduction of lots of micros?
Authors: Howard Strauss
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

Over the past ten years or so many computer centers have made the transition from large, centralized batch machines to large, centralized timesharing machines. This was a carefully planned move controlled largely by the central site. Today an even more revolutionary transition is underway: the introduction of microcomputers. This new change is often not being led by the central site and is rarely under the control of any central authority. How can the central site manage the influx of micros under these circumstances? Can micros be supported by the central site and should they be? How does one manage the &ldquo;threats&rdquo; to the central site by the introduction of micros? What can be done to ensure that productivity goes up with the introduction of micros? What can be done to ensure that productivity goes up with the introduction of micros? What role should the central site play, if any, in this new revolution? How are user services organization altered by the introduction of micros?
DELTA: An expert system to troubleshoot diesel electric locomotives
Authors: Piero P. Bonissone
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

In the last few years, expert systems have become the most visible and fastest growing branch of Artificial Intelligence. Their objective is to capture the knowledge of an expert in a particular problem domain, represent it in a modular, expandable structure, and transfer it to other users in the same problem domain. To accomplish this goal, it is necessary to address issues of knowledge acquisition, knowledge representation, inference mechanisms, control strategies, user interface and dealing with uncertainty.
Closure of families of languages under substitution operators
Authors: David J. Lewis
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

This paper treats the closure of families of formal languages under operators which may be viewed as substitution into a particular language. A language L over alphabet {a1,...,an} induces an n-place operator on languages by substitution of the n arguments Li for the symbols ai. For example, if L is regular, it induces an operator under which any full AFL is closed. In section two we find a large class of full AFL's which are closed under no other such operators than those induced by regular languages. Also, for any full AFL @@@@', let @@@@ be the class of languages which @@@@' is closed under substitution into. Then @@@@ is itself a full AFL and is closed under substitution. Finally we show that any substitution-closed full AFL @@@@ is obtained in this manner from some non-substitution-closed full AFL @@@@ (except when @@@@ is the universal family). The study is based on the concept of a full AFL, and in section one considerable effort is devoted to a novel approach to the subject. A full AFL is taken to be a family of languages closed under finite-state transducer mappings and substitution into regular sets. By replacing the family of regular sets with more general families we obtain some broad results about canonical forms for derivations of languages from other languages using transducers and substitution. These forms yield several known forms as special cases, and provide tools needed for the study of full AFL's in section two.
Interactive simulation gaming for energy-policy analysis
Authors: Peter D. Blair
Venue: Proceedings of the international conference on APL: part 1 (1979)

This paper describes the design and implementation of a multiple player interactive simulation game in APL for use in education, policy analysis and planning in energy-environment related systems. The &ldquo;Regional Energy-Environment Game&rdquo; makes use of APLSV's shared-variable feature to establish communication links between players as well as to provide an interface between these players and an analytical model of an energy-environment system.
Automatic synthesis of microcontrollers
Authors: Andrew W. Nagle
Venue: ACM SIGMICRO Newsletter (1978)

A method is proposed for automating the design of a microcontroller from a register transfer level description of a digital system. This method designs the format of the control word, determines the timing of branch decisions, and specifies the content of the microprogram. A data structure is introduced which supports some heuristic optimization of the design. The goal of the design method is to produce correct designs that are partially optimized with a practical amount of computing effort. An example is given to show how the method works.
An interactive electrical graph extractor
Authors: J. L. Kors, M. Israel
Venue: Proceedings of the 21st Design Automation Conference (1984)

Simulation, inteconnection verification, design Rules Checking, need a data base corresponding to the electrical graph of the circuit layout to be verified. We present an interactive electrical graph extractor, based on EMILIE2 CAD system *, working during the layout design and avoiding the use of an off line extractor.
A comment on the recognition of hand-printed two-dimensional mathematical expressions
Authors: Robert H. Anderson
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

The conference paper &ldquo;Computer Input/Output of Mathematical Expressions&rdquo; by Professor Martin is an excellent summary of the characteristics of 2D math expressions and of algorithms for their recognition and display. Professor Martin argues that for efficiency a recognition system must be carefully programmed to allow a rather complete notation and still take advantage of constraints in the notation. In practice, this usually means &ldquo;hand-tailoring&rdquo; a recognition algorithm to a particular notation. Unfortunately, a limitation of most &ldquo;hand-tailored&rdquo; programs is that they are rather inflexible and difficult to change in any significant way. I would like to focus my comments on the pair of questions, &ldquo;(1) Are 'hand-tailored' 2D recognition algorithms necessary for efficiency?, and (2) Is there an alternative?&rdquo;
Memory utilization efficiency under a class of first-fit algorithms
Authors: Aaron Tenenbaum
Venue: Proceedings of the ACM 1980 annual conference (1980)

This paper examines an improved version of a modified first-fit storage allocation algorithm. In this version, small blocks of free storage are not permitted to remain on the free list but instead are placed on a separate sliver list, available for recombination with newly freed blocks. The memory utilization efficiency of a system under this algorithm is shown to be markedly superior to a system using an algorithm in which such blocks are unavailable for either allocation or recombination.
An approach to standardizing computer systems
Authors: Edward Morenoff, John B. McLean
Venue: Proceedings of the 1967 22nd national conference (1967)

The fundamental goal of an evolutionary approach to upgrading a computer installation is the maintenance of a continuity of operation as various elements of the installation (equipment components and system support programs) are replaced. The realization of this goal requires the isolation and separation of the inter-dependencies which now exist between the various elements of a computer installation. This includes the inter-dependencies between programs and the characteristics of equipment components, between programs and the characteristics of other programs, and between equipment components and the characteristics of other equipment components.
The new developments in C
Authors: S. C. Johnson, L. Rosler
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

The C language has developed considerably since the publication of the Kernighan and Ritchie book. The language development includes enumeration data types, a void type, long (more than 8 character) identifiers, and an expanded semantic structure. At the same time, the compiler technology that developed the Portable C Compiler (which was used to provide more than 30 production compilers on different machines) is evolving into PCC2, which offers improved maintenance and an easier porting process while handling a larger number of machine features.
Formalization of properties of recursively defined functions
Authors: Zohar Manna, Amir Pnueli
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

This paper is concerned with the relationship between the convergence, correctness and equivalence of recursively defined functions and the satisfiability (or unsatisfiability) of certain first-order formulas.