ppxscal/embedding_network huggingface dataset:
A new paradigm for the design of concurrent systems
Authors: Ralph Back Reino Kurki-Suonio
Venue: ACM SIGAda Ada Letters (1987)

A concurrent system is usually understood as a collection of processes that interact through some communication mechanisms. The active components of such a system are the processes; their interaction is described in terms of messages and operations on shared memory. The principal process communication mechanism of Ada, the rendezvous, is a high-level mechanism based on synchronizing messages.In this position paper we argue that appropriate design methods and languages for real-time systems should be based on a notion of interaction that is compatible with the corresponding concepts in the implementation language but provides a higher level of abstraction. It is claimed that existing methods do not satisfy this requirement with respect to Ada. A new paradigm is therefore suggested that reverses the traditional setting as follows. The active components of the system are not the processes but the interactions in which they participate. Such interactions, called joint actions, can be executed whenever they are enabled, i.e. when the required processes are free and willing to participate in these actions.This change of viewpoint has an effect on the kind of entities that are described and refined in the design process. In particular, refinement of joint actions changes the granularity of the system. i.e. the atomicity of events being considered. Another novelty introduced by joint actions is the application of the production language paradigm to the design of concurrent systems. As joint actions are a generalization of the rendezvous, Ada is a suitable implementation language for this approach.
A framed movable-boundry protocol for integrated voice/data in a LAN
Authors: S M Sharrock, K J Maly, S Ghanta, H C Du
Venue: ACM SIGCOMM Computer Communication Review (1986)

A new, fully-distributed protocol for integrated voice/data traffic in a local-area, random-access broadcast network is described. The protocol introduces a movable voice-data boundary to framed TDMA/CSMA and eliminates the requirement of system-wide synchronized clocks. The movable boundary is a major advantage in any system where fluctuations in voice and data loads are expected because assignment of idle capacity from one traffic class to the other increases the utilization of the channel. The protocol provides collision-free virtual circuits for voice and periods of non-persistent CSMA/CD for data traffic and call establishment, and can support multi-party calls as well as two-way conversations. The protocol allows variable-size voice packets that have very low overhead and variable-size data packets that may be much longer than voice packets. This is of significant practical advantage over previous work, which has required fixed-size voice and/or data packets, or voice packets with high overhead. A method of dynamically controlling the movable boundary to balance the voice and data traffic is also proposed.
Systems programming with JSP: example&mdash;a VDU controller
Authors: Bo Sanden
Venue: Communications of the ACM (1985)

The generation of an embedded microprogram controlling a video display unit demonstrates how Jackson Structured Programming can be used effectively for both systems programming and microprocessor applications.
Computing Motion Using Analog and Binary Resistive Networks
Authors: James Hutchinson, Christof Koch, Jin Luo, Carver Mead
Venue: Computer (1988)

The authors describe recent developments in the theory of early vision that led from the formulation of the motion problem as an ill-posed one to its solution by minimizing certain 'cost' functions. These cost or energy functions can be mapped onto simple analog and digital resistive networks. The optical flow is computed by injecting currents into resistive networks and recording the resulting stationary voltage distribution at each node. The authors believe that these networks, which they implemented in complementary metal-oxide-semiconductor (CMOS) very-large-scale integrated (VLSI) circuits, represent plausible candidates for biological vision systems.
Microcode development tools for a capability-based processor
Authors: J. Rosenberg, D. A. Abramson
Venue: Proceedings of the 19th annual workshop on Microprogramming (1986)

The MONADS-PC System is a capability-based computer constructed around a microprogrammed processor designed and implemented at Monash University in Melbourne, Australia. This paper describes a set of tools developed as part of this project in order to simplify the implementation and testing of the microcode and to ensure consistency between the microcode and macro-level machine instruction set. Although some of these tools are at present machine specific, the paper demonstrates that they could be generalised into a flexible microcode development system.
On Fault Isolation and Identification in t1/t1-Diagnosable Systems
Authors: Che-Liang Yang, Gerald M. Masson, Richard A. Leonetti
Venue: IEEE Transactions on Computers (1986)

Consider a classical PMC system composed of n units [1] where it is assumed that at most t1 of these units are faulty. Such a system is said to be t1/t1-diagnosable [3] if, given any complete collection of test results, the set of faulty units can be isolated to within a set of at most t1 units. This paper exposes some new, important properties of general t1/t1-diagnosable systems to present an O(n2.5) algorithm by which all the faulty units except at most one can be correctly identified and all the faulty units can be isolated to within a set of t1 or fewer units in which at most one can possibly be fault free.
A Methodology for Developing Distributed Programs
Authors: S. Ramesh, S. L. Mehndiratta
Venue: IEEE Transactions on Software Engineering (1987)

A methodology, different from the existing ones, for constructing distributed programs is presented. It is based on the well-known idea of developing distributed programs via synchronous and centralized programs. The distinguishing features of the methodology are: 1) specification include process structure information and distributed programs are developed taking this information into account, 2) a new class of programs, called PPSA's, is used in the development process, and 3) a transformational approach is suggested to solve the problems inherent in the method of developing distributed programs through synchronous and centralized programs. The methodology is illustrated with an example.
Finding Interferences Between Rectangular Paths
Authors: Krishna Kant
Venue: IEEE Transactions on Computers (1985)

The paper examines the problem of counting all interferences between a set of rectangular paths. Tight upper bounds on the number of overlaps and intersections between two or more rectangular paths are derived both for the general case and the special cases where the backtracking is not allowed in one or both directions. An optimal algorithm for counting all interferences for both the special and general cases is presented.
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
Authors: I. Chlamtac, S. S. Pinter
Venue: IEEE Transactions on Computers (1987)

This paper proposes a solution to providing a collision free channel allocation in a multihop mobile radio network. An efficient solution to this problem provides spatial reuse of the bandwidth whenever possible. A robust solution maintains the collision free property of the allocation under any combination of topological changes. The node organization algorithm presented in this paper provides a completely distributed, maximally localized execution of collision free channel allocation. It allows for parallel channel allocation in stationary and mobile networks with provable spatial reuse properties. A simpler version of the algorithm provides also a highly localized distributed coloring algorithm of dynamic graphs.
The talking glove
Authors: James Kramer, Larry Leifer
Venue: Issue 39 (Spring 1988) (1988)

A new bi-directional communication aid is being developed which allows deaf, deaf-blind, or nonvocal individuals to interact verbally with others. The device analyzes a nonvocal person's fingerspelling hand formations and outputs the spelled words as synthesized speech. In effect, this component of the communication aid is a "talking glove". In addition, by using state-of-the-art voice recognition equipment, a deaf user is able to read incoming speech on the miniature LCD screen of a modified digital wristwatch. Similarly, a deaf-blind individual may read incoming speech on a portable braille display module.
Implementation and evaluation of a list-processing-oriented data flow machine
Authors: M. Amamiya, M. Takesue, R. Hasegawa, H. Mikami
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

The architecture of a data flow machine, called DFM, is developed for parallel list processing. The DFM can maximally exploit parallelism inherent in list processing, due to its ultra-multi-processing mechanism, packet communication-based parallel and pipeline execution mechanism, and lenient cons mechanism. A practical DFM implementation is described. A DFM prototype machine is implemented and DFM performance is evaluated in a simulation on the register transfer level using several benchmark programs. The DFM single processor system is shown to be about five times faster than conventional machines which use the same device technology, while a multi-processor DFM system is shown to achieve a linear speed-up ratio of 0.6 ~ 0.9.
Operators considered harmful
Authors: Martin Gfeller
Venue: ACM SIGAPL APL Quote Quad (1986)

A set of output utility functions is described that allows the programmer to direct output to four different output devices (array, file, printer, and terminal) in a device-independent manner. These output functions provide the programmer with the ability to switch output devices without recoding application programs, and the ability to control particular device characteristics. The functions include logic for line counting and (optional) page headings, and are easy to learn and use. Technical notes, examples, function listings, and a discussion of potential extensions are also included. These output functions may usefully be included in the utility library of every micro and mainframe APL installation.
File organizations incrementally specified queries
Authors: C. Eastman
Venue: Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval (1987)

Queries to information retrieval systems are often incrementally specified as a result of user interaction with the system. However, most discussions of file organizations consider only completely specified queries. The choice of file organizations to support such incremental specification is discussed qualitatively in this extended abstract. (Quantitative comparisons are partially complete and are not presented here.) Organizations which are advantageous for completely specified queries are not necessarily so for incrementally specified queries (and vice versa).
CIRCAL and the representation of communication, concurrency, and time
Authors: George J. Milne
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1985)

The CIRCAL calculus is presented as a mathematical framework in which to describe and analyze concurrent systems, whether hardware or software. The dot operator is used to compose CIRCAL descriptions, and it is this operator which permits the natural modeling of asynchronous and simultaneous behavior, thus allowing the representation and analysis of system timing properties such as those found in circuits. The CIRCAL framework uses an abstraction operator to permit the modeling of a system at different levels of detail. Behavioral complexity of real systems makes abstraction crucial when producing a tractable model, and we illustrate how abstraction introduces nondeterminisim into system representations. An operational semantics, acceptance semantics, is introduced, and it is in terms of this active experimentation that meaning is given to the CIRCAL syntax, thus allowing proof of system properties to be constructed.
Gridless detail routing with a front
Authors: S Lass
Venue: ACM SIGDA Newsletter (1987)

Detail routing is performed one layer at a time by moving a front across a layer. The front (similar to a line) is orthogonal to the connections being routed. The front approach described here is gridless, includes shove aside, supports variable width lines, and has modest memory requirements.
Conditions for tangent plane continuity over recursively generated B-spline surfaces
Authors: A. A. Ball, D. J. T. Storry
Venue: ACM Transactions on Graphics (TOG) (1988)

The continuity properties of recursively generated B-spline surfaces over an arbitrary topology have been related to the eigenproperties of the local subdivision transformation. In this paper a discrete Fourier transform technique is employed to derive these eigenproperties for a general choice of subdivision weightings. Conditions on these weightings are identified for tangent plane continuity at the extraordinary points and a geometric interpretation is given.
Market automation: self-regulation in a distributed environment
Authors: Ross M. Miller
Venue: Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems (1988)

Initial studies of the stock market crash of October 1987 indicate that insufficient linkages between related securities markets, exacerbated by computerized trading, can lead to market instability. This paper examines how the market mechanism can be made more &ldquo;intelligent,&rdquo; so that it can provide much of the stabilization currently left to the computer-driven arbitrage activities of independent traders while at the same time enhancing market liquidity. This intelligent market mechanism employs techniques derived from concurrent control theory to link markets together in a way that effectively creates new, synthetic securities markets that coexist with current securities markets. This mechanism permits continuous trade in all markets so that the stabilizing activities of arbitrage occur as a direct by-product of the basic operation of the market mechanism. When the speed of communication between markets is fast relative to the pace of trading, this mechanism will operate so that at the operational level it is completely transparent to traders in the market, giving the appearance of a single, fully-linked free market system. This mechanism and the principles upon which it is based have broader applications to computerized markets in manufacturing and the service industries beyond financial markets.
The software structure of extended nucleus based on BTRON specification
Authors: M. Kobayashi, S. Takenouchi, Y. Kushiki, K. Sakamura
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

BTRON stands for Business-oriented operating system (OS) specification in the TRON project and is a computer architecture for office workstation. The major objective is to offer unified man-machine interface (MMI) and handling multi media data. Special features of BTRON specification are included: (1) unified MMI method, (2) data transportability, (3) handling multi media data. In order to achieve these objectives, BTRON specification propose a data model called Real object/virtual object model. To evaluate BTRON specification, the nucleus and extended nucleus were developed on the experimental system, and we evaluated the MMI. In this paper, we discussed the relation of Real object/virtual object model and MMI with implementation of viewport system.
Software process management: lessons learned from history
Authors: B. W. Boehm
Venue: Proceedings of the 9th international conference on Software Engineering (1987)

Regarding history, George Santayana once said, &ldquo;Those who cannot remember the past are condemned to repeat it.&rdquo;I have always been dissatisfied with that statement. It is too negative. History has positive experiences too. They are the ones we would like both to remember and to repeat.The three papers in this session are strong examples of positive early experiences in large-scale software engineering. The papers are:H.D. Benington, &ldquo;Production of Large Computer Programs,&rdquo; Proceedings, ONR Symposium, June 1956.W.A. Hosier, &ldquo;Pitfalls and Safeguards in Real-Time Digital Systems with Emphasis on Programming,&rdquo; IRE Transactions on Engineering Management, June, 1961.W.W. Royce, &ldquo;Managing the Development of Large Software Systems: Concepts and Techniques,&rdquo; Proceedings, WESCON, August 1970.Given the short lifespan of the software field, they can certainly be called &ldquo;historic.&rdquo; Indeed, since many people date the software engineering field from the NATO Garmisch conference in 1968, two of them can even be called &ldquo;prehistoric.&rdquo; They are certainly sufficiently old that most people in the software engineering field have not been aware of them. The intent of this session is to remedy this situation by reprinting them in the Conference Proceedings, and by having the authors (or, in one case, Hosier's colleague J.P. Haverty) discuss both the lessons from their papers which are still equally valid today, and the new insights and developments which have happened in the interim.
The extra stage gamma network
Authors: K. Y. Lee, W. Hegazy
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

The augmented data manipulator (ADM), inverse augmented data manipulator (IADM), and the gamma network are based on the Plus-Minus-2i connection patterns. In such a network there exist multiple paths to connect a source S to a destination D except when S=D. The number of paths for (S,D) is a function of the tag value (D-S) modulo N, and the size of the network N.par>It is shown in this paper that by adding an extra stage to the original PM21 interconnection network, multiple paths are provided for all the tag value including 0. The extra stage can be any stage out of n=log2N stages of the original network.The analyses on the distribution of the number of paths for various tag values are performed for n possible choices of the extra stage. It is shown that the extra stage of 0, +1, -1 connection patterns gives the most uniform distribution, and also results in a 1-fault tolerant interconnection network.
Report on a program for solving polynomial equations in non-commuting variables
Authors: Gilles Labonté
Venue: ACM SIGSAM Bulletin (1987)

We now have a program to solve automatically the following problem. Let one be given a set of equations:[EQUATION]in which the p's are polynomials, with coefficients in a skew-field K, and in which the unknowns m1, m2,..., mn are generally non-intercommuting but can also intercommute. Find the possible representations for the ring of polynomials generated by the m's; Eqs (1) being assumed to define a finite ring.
A consultation system for information center resource allocation
Authors: Mari M Heltne, Ajay S Vinze, Benn R Konsynski, Jay F Nunamaker,  Jr.
Venue: Proceedings of the conference on The 1987 ACM SIGBDP-SIGCPR Conference (1987)

This paper demonstrates the viability of a rule-based consultation system as a mechanism for effective resource management through integration of knowledge about users, business problems, and resources. The specific domain within which the expert system will be tested is the Information Center (IC), which deals with end-user computing resources. In the last decade, the information center concept has been proposed as an organizational solution to resource management problems related to end user computing. As ICs become subjected to increased user expectations, they face the problem of trying to provide more service with limited staff. Just as the IC provides support for technology enhancement, technology can be used to support the IC. The research hypothesis is that the knowledge and methodologies of IC consultants, as well as institutional policies, can be represented in a knowledge base. The system will then draw conclusions about appropriate software or training solutions based on the interaction of user and resource profiles with the problem definition. The output of the model should be compatible with the situation which it is modeling. Currently, a rule-based expert system (ES) is being developed at the University of Arizona Department of Management Information Systems. This paper presents methodologies for design and implementation of the system. The development approach for the IC environment has three main parts, selected on the basis of compatibility with the work environment of the consultants: (1) User Profile, (2) Need Analysis, and (3) Tool/Resource Profile. Considerations of maintainability and transportability are also important. Because of changes in tool availability resulting in a need for new descriptions of the tool offerings, the design of an expert system for ICs must respond dynamically to unique flexibility, portability, and maintenance issues. The ability to transport such a system to similar, but not identical, ICs should be addressed in the design as well. An IC has been described as an organization specifically designed to produce guided services to help end users help themselves. A consultation expert system has been shown to be useful in reaching that goal.
Support for dynamic binding in strongly typed languages
Authors: R E Gantenbein
Venue: ACM SIGPLAN Notices (1987)

Dynamic binding is a facility usually found only in weakly typed languages. A strongly typed, block-structured language can, however, also support dynamic binding if its implementation is modified according to a set of widely applicable principles. The result of applying these principles to a strongly typed base language is a language that has much of the flexibility of weakly typed languages without requiring extensive run-time type checking.The primary principles in this general approach to adding dynamic binding to a language are providing separate compilation for the units of dynamic binding, establishing a link between a name in one unit and its implementation in another, and assuring that programs using dynamic binding remain consistent during their execution. There are different methods for implementing each of these principles; two languages to which dynamic binding has been added serve to illustrate some of the alternatives.
Human-computer interaction research at the University of Maryland
Authors: Ben Shneiderman
Venue: ACM SIGCHI Bulletin (1986)

The Human-Computer Interaction Laboratory (HCIL) is a unit of the Center for Automation Research at the Univesity of Maryland. HCIL is an interdisciplinary research group whose participants are faculty in the Departments of Computer Science and Psychology and the Colleges of Library and Information Services, Business, and Education. In addition, staff scienctists, graduate students, and undergraduates contribute to this small, but lively community that pursues empirical studies of people using computers.Our support comes from industrial research projects, government grants, the State of Maryland, and the University of Maryland. Projects often become interrelated in surprising ways enabling individuals to cooperate constructively. Some of our efforts during the past year are described below.