ppxscal/embedding_network huggingface dataset:
Separate compilation in CHIPSY
Authors: H. Eidnes, D. O. Hallsteinsen, D. H. Wanvik
Venue: ACM SIGSOFT Software Engineering Notes (1989)

This paper describes a practical implementation scheme for separate compilation of strongly typed high-level languages. The scheme provides full inter-module type checking, while limiting the problems of &ldquo;big inhale&rdquo; and most redundant recompilations by employing smart recompilation at reasonable cost. It also provides type-safe link-time substitution of module variants. The scheme has been implemented for CHILL1 in CHIPSY&reg;, and has been in use since 1983. The current host is VAX/VMS. Targets include VAX, Intel 8086 and 80286, both stand-alone and under MS-DOS. A Sun-386i and VAX/Ultrix hosted version is under development. CHIPSY is marketed by KVATRO A/S of Trondheim, Norway.
A Projection Operator for the Restoration of Divergence-Free Vector Fields
Authors: P. Y. Simard, G. E. Mailloux
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

The theory of image restoration by projection onto convex sets can also be applied to the restoration of vector fields. These can have properties that restrict them to lie in well-defined closed convex sets. One of the properties, divergence freedom, is considered, and the theory and numerical implementation of its projection operator are presented. The performance of the operator is illustrated by restoring, from partial information, two simulated divergence-free vector fields. This projection operator finds an important application in the restoration of velocity fields or optical flows computed from an image sequence when the real velocity field is known, a priori to be divergence-free.
Kaleidoscope: mixing objects, constraints, and imperative programming
Authors: Bjorn N. Freeman-Benson
Venue: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications (1990)

Kaleidoscope is an object-oriented language being designed to integrate the traditional imperative object-oriented paradigm with the less traditional declarative constraint paradigm. Imperative state changes provide sequencing while declarative constraints provide object relations. A variables as streams semantics enables the declarative-imperative integration. A running example is used to illustrate the language concepts&mdash;a reimplementation of the MacDraw II dashed-lines dialog box. The example is in three parts: the input channel, using imperative code to sequence through modes; the output channel, using constraints to update the display; and the internal relations, using constraints to maintain the data objects' consistency requirements. The last sections of the paper discuss views as a natural result of combining objects with constraints, as well as related and future work.
MULTES/IS: an effective and reliable test generation system for partial scan and non-scan synchronous circuits
Authors: T. Ogihara, K. Muroi, G. Yonemori, S. Murai
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper describes an automatic test generation system which effectively generates test vectors by recognizing the circuit blocks for which vectors are automatically generated and the circuit blocks for which vectors have to be manually prepared. Test vectors for full scan, partial scan and nonscan synchronous circuit blocks are automatically generated. Test vectors for asynchronous circuit blocks have to be manually prepared.
Inspection of Printed Circuit Boards by Connectivity Preserving Shrinking
Authors: Q.-Z. Ye, P. E. Danielsson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

Two algorithms for visual inspection of printed-circuit boards are presented that perform width checking of conductors and insulators. The first detects the difference between the results of shrinking and connectivity-preserving shrinking (CPS). The second algorithm produces a difference between the original and the shrunk picture. This result is subject to a number of CPS-operations after which errors are easily detected. Both algorithms can be adapted to a suitable level of sensitivity to sharp corners and edge irregularities. A sequential version of CPS is also described which is well suited for hardware implementation in a pipelined structure.
Obstacle Avoidance Using Flow Field Divergence
Authors: R. C. Nelson, J. Aloimonos
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The use of certain measures of flow field divergence is investigated as a qualitative cue for obstacle avoidance during visual navigation. It is shown that a quantity termed the directional divergence of the 2-D motion field can be used as a reliable indicator of the presence of obstacles in the visual field of an observer undergoing generalized rotational and translational motion. The necessary measurements can be robustly obtained from real image sequences. Experimental results are presented showing that the system responds as expected to divergence in real-world image sequences, and the use of the system to navigate between obstacles is demonstrated.
Cactis: a self-adaptive, concurrent implementation of an object-oriented database management system
Authors: Scott E. Hudson, Roger King
Venue: ACM Transactions on Database Systems (TODS) (1989)

Cactis is an object-oriented, multiuser DBMS developed at the University of Colorado. The system supports functionally-defined data and uses techniques based on attributed graphs to optimize the maintenance of functionally-defined data. The implementation is self-adaptive in that the physical organization and the update algorithms dynamically change in order to reduce disk access. The system is also concurrent. At any given time there are some number of computations that must be performed to bring the database up to date; these computations are scheduled independently and are performed when the expected cost to do so is minimal. The DBMS runs in the Unix/C Sun workstation environment. Cactis is designed to support applications that require rich data modeling capabilities and the ability to specify functionally-defined data, but that also demand good performance. Specifically, Cactis is intended for use in the support of such applications as VLSI and PCB design, and software environments.
The next generation of interactive technologies
Authors: Karen A. Frenkel
Venue: Communications of the ACM (1989)

From home entertainment to cultural exhibits to educational methodologies to personal computing, interactive technologies could change observers in to participants.
Two-time scale analysis of coherent vortex evolution in turbulence
Authors: P. W. Terry
Venue: Physica D (1989)

The first SLAM II network simulation model for Juvenile Detention Management in Washington State was built in 1989 by the Washington State Office of the Administrator for the Courts. The juvenile detention process can be viewed as a complicated queuing system from the juvenile's arrival at the detention facility to final release from the facility. The detention process is simulated through the use of RESOURCEs, AWAITs and GATEs that control the movement of the juveniles entering and leaving the system. The goal of this research is to help judges and court administrators apply Operations Research to court management and to examine how parameters as well as structure in the simulation model influence the detention system operation. For example, how does varying the arrival rate, the service rate, or service style affect bed usage and judge time in a detention center? Or, how do changes in legal procedures effect the structure of the model and detention facilities' operations.
Esprit project P1085 - reconfigurable transputer project
Authors: J. G. Harp
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

ESPRIT project P1085 has the objective of developing a high performance multi-processor computer with supporting software and a range of applications to demonstrate its performance. This paper discusses the progress made at the mid-point of the project in meeting this objective. Prototype machines based on a reconfigurable architecture have been built and are described. Software tools have been defined and are being implemented. Applications have been developed using Occam and the high performance being achieved is presented.
The Programmable Network Prototyping System
Authors: Randy Cieslak, Ayman S. Fawaz, Sonia R. Sachs, Pravin Varaiya, Jean Walrand, Albert S. C. Li
Venue: Computer (1989)

The programmable network prototyping system (PNPS) uses a collection of reusable hardware modules that implement generic communications functions such as transmission, reception, signal propagation, and pattern matching. These modules are interconnected and configured to emulate a variety of communication networks whose behavior can be monitored under different load conditions. The user specifies a network as a set of interacting components using available software tools. These tools are accessible within a prototyping environment that includes a control system for configuring the hardware modules and interconnecting them according to the component specifications. Previously designed components are stored in a library and can be used to specify new networks. Although PNPS is designed to provide a prototyping environment for communication networks, some of the basic ideas can be useful in other contexts.
Efficient prime factorization of logic expressions
Authors: P. C. McGeer, R. K. Brayton
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The set of multivariate Boolean functions over the variables &khgr;1 &hellip;, &khgr;m is considered as the set of multilinear polynomials with coefficients in [0,1] over the literals {&khgr;1, &khgr;1, &hellip;, &khgr;m, &khgr;m}. We denote this set of polynomials as B[@@@@], and call the set of polynomial operations over them algebraic operations. It is shown that these polynomials, called logic expressions, have a unique algebraic prime factorization. An &Ogr;(n log2 n) algorithm to find this factorization is presented. An improvement to the algorithm is presented which may reduce its average-case complexity to &Ogr;(n).
VIDEO: a design medium
Authors: Steve Harrison, S. Minneman, B. Stults, K. Weber
Venue: ACM SIGCHI Bulletin (1989)

We use video to support design. By design, we (the Design and Media Spaces Area at Xerox PARC) mean the creation of the new, whether it is architecture, painting, or engineering. We believe that design is a social activity---the interactions of individuals within a group and the relation of groups to one another. Another way we express this point of view is to say design is the social construction of a technical reality. We seek to improve design processes by enabling better communications within the design process.
On the design of some systolic algorithms
Authors: Jan L. A. van de Snepscheut, Johan B. Swenker
Venue: Journal of the ACM (JACM) (1989)

The design of systolic algorithms is discussed, that is, algorithms that may efficiently be executed by a synchronous array of cells that perform local communications only. Systolic algorithms are designed through techniques developed in the context of sequential programming. Heuristics are given that guide the programmer in the design of a variety of efficient solutions.
Demonstrating the dangers of Pseudo-random numbers
Authors: Ronald L. Danilowicz
Venue: ACM SIGCSE Bulletin (1989)

Computer simulations are everywhere, from the corporate office to the local video game parlor. With the increased role being played by these simulations, it is important for students to be completely aware of the limitations of pseudorandom number generators. The fact that random number generators in use today are not truly random is no secret (The New York Times, C1-C8). Since most simulations produce reasonable results it might be difficult to convince students that there are any problems involved in trusting these random number generators. A simple simulation which can be used as a programming exercise in any language can dramatically reveal these dangers.The exercise used requires a statistical evaluation of pi; which yields horrible results. The results are not difficult to explain and the exercise can be extended by allowing students to experiment with modifications to the pseudo-random number generator used in attempts to "fix" the problem. This can be useful, as the attempts to fix the pseudorandom number generator usually aggravate rather than alleviate the problem.
Token Systems That Self-Stabilize
Authors: Geoffrey M. Brown, Mohamed G. Gouda, Chuan-Lin Wu
Venue: IEEE Transactions on Computers (1989)

Presents a novel class of mutual exclusion systems, in which processes circulate one token, and each process enters its critical section when it receives the token. Each system in the class is self-stabilizing; i.e. it it starts at any state, possibly one where many tokens exist in the system, it is guaranteed to converge to a good state where exactly one token exists in the system. The systems are better than previous systems in that their state transitions are noninterfering; i.e., if any state transition is enabled at any instant, then it will continue to be enabled until it is executed. This makes the systems easier to implement as delay-insensitive circuits.
Type inference in the presence of type abstraction
Authors: H.-J. Boehm
Venue: ACM SIGPLAN Notices (1989)

A number of recent programming language designs incorporate a type checking system based on the Girard-Reynolds polymorphic &lgr;-calculus. This allows the construction of general purpose, reusable software without sacrificing compile-time type checking. A major factor constraining the implementation of these languages is the difficulty of automatically inferring the lengthy type information that is otherwise required if full use is made of these languages. There is no known algorithm to solve any natural and fully general formulation of this &ldquo;type inference&rdquo; problem. One very reasonable formulation of the problem is known to be undecidable. Here we define a restricted version of the type inference problem and present an efficient algorithm for its solution. We argue that the restriction is sufficiently weak to be unobtrusive in practice.
The organizational consequences of office automation: refining measurement techniques
Authors: Jonathan A. Morell
Venue: ACM SIGMIS Database (1988)

Data is reported regarding the impact of personal computer use in the Naval Military Personnel Command. The emphasis is on furthering knowledge of variables which may be affected by the introduction of office automation, and of how those variables might be measured. Particular attention was paid to the problem of abstracting generalizable measures from descriptions of what people did with their computers.Analysis of results revealed six general categories of impact, each with several specific, measurable indicators. The general categories include: budgeting, information for planning or administration, amount of time saved, uses of time saved, "information creation", and communication. Examples of measurable indicators of each category are: budgeting - percent of allocated budget spent within a fiscal year; planning and administration- currency of available data; use of time saved accomplishment of new tasks; information creation - development of "private" data bases; and communication - development of "private" data bases; and communication - expectations concerning data that should be available.The intent is to demonstrate that an effort to measure the impact of office automation can be successful, and to urge others to undertake similar analyses with other data sets. Together, such efforts would lead to much improved understanding of how office automation affects activity within organizations.
A language-only course in LISP with PC scheme
Authors: K. A. Lambert
Venue: ACM SIGCSE Bulletin (1989)

This paper describes a course in LISP that introduces students to conventional software engineering techniques, contemporary programming paradigms, and an artificial intelligence application.
A hypertext knowledge based for primary care - LIMEDS in LINCKS
Authors: T. Timpka, L. Padgham, P. Hedblom, S. Wallin, T. Tibblin
Venue: ACM SIGIR Forum (1989)

In organized health care, primary care is the first level. It is characterized by the wide span of health problems managed as well as remote location from traditional medical information and knowledge sources. The LIMEDS project has formulated the special requirements for integrated knowledge and data base management in primary care. This paper presents G&ouml;sta's book, a hypertext knowledge base implemented in LINCKS, an object oriented, networked database system. Firstly, aspects which make integrated hypermedia systems particularly suitable for application in primary health care are explored. We then describe the hypertext knowledge base, consisting of 500 basic text objects and 3000 links, and current implementations using the NODE data model. NODE is implemented on a SUN III fileserver, and the user interface for the hypertext context on Apple Macintosh (TM). Combination of design methods towards a parallel means-ends strategy was found to be necessary to achieve G&ouml;sta's book. Design groups need to be composed of computer science, medical, psychological and organizational competences.
A Benchmark Parallel Sort for Shared Memory Multiprocessors
Authors: R. S. Francis, I. D. Mathieson
Venue: IEEE Transactions on Computers (1988)

The first parallel sort algorithm for shared memory MIMD (multiple-instruction-multiple-data-stream) multiprocessors that has a theoretical and measured speedup near linear is exhibited. It is based on a novel asynchronous parallel merge that evenly partitions data to be merged among any number of processors. A benchmark sorting algorithm is proposed that uses this merge to remove the linear time bottleneck inherent in previous multiprocessors sorts. This sort, when applied to data set on p processors, has a time complexity of O((n log n)/p)+O((n log p)/p) and a space complexity of 2n, where n is the number of keys being sorted. Evaluations of the merge and benchmark sort algorithms on a 12-processor Sequent Balance 21000 System demonstrate near-linear speedup when compared to sequential Quicksort.
A high performance reconfigurable parallel processing architecture
Authors: R. R. Shively, E. B. Morgan, T. W. Copley, A. L. Gorin
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

The architecture of the AT T DSP-3 parallel processor is described. The DSP-3 design is modular and when implemented with 128 processing nodes, provides a maximum throughput of 3.2 GFLOPS (32 bit floating point). The high speed interconnection network (40 Mbytes/sec) contains redundant paths that allow the machine to be configured in a variety of topologies. This flexibility supports efficient operation for a diverse set of signal processing applications and enables topology reconfiguration in support of fault tolerance. Advanced multi-chip 3-D packaging will allow a 800 MFLOP version of the machine to be realized in a multi-processor array volume of 9 cubic inches.
An on-line system for controlling and monitoring software usage in a microcomputer laboratory
Authors: Andrew N. Kreutzer
Venue: ACM SIGUCCS Newsletter (1988)

Prior to the Fall of 1984, the Academic Computing Center facilities at Allentown College consisted of a large minicomputer, a VAX/11-750. Rudimentary load statistics on the VAX were obtained by a program which periodically counted the number of users logged on at that time. The usage profiles generated helped management make decisions such as how many terminals were needed, when the computer center should be open, and when consultants could be used most effectively.
Symbolic solution polynomial equation systems with symmetry
Authors: K. Gatemann
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

Systems of polynomial equations often have symmetry. The Buchberger algorithm which may be used for the solution ignores this symmetry. It is restricted to moderate problems unless factorizing polynomials are found leading to several smaller systems. Therefore two methods are presented which use the symmetry to find factorizing polynomials, decompose the ideal and thus decrease the complexity of the system a lot. In a first approach projections determine factorizing polynomials as input for the solution process, if the group contains reflections with respect to a hyperplane. Two different ways are described for the symmetric group Sm and the dihedral group Dm. While for Sm subsystems are ignored if they have the same zeros modulo G as another subsystem, for the dihedral group Dm polynomials with more than two factors are generated with the help of the theory of linear representations and restrictions are used as well. These decomposition algorithms are independent of the finally used solution technique. We used the REDUCE package Groebner to solve examples from CAPRASSE, DEMARET and NOONBURG which illustrate the efficiency of our REDUCE program. A short introduction to the theory of linear representations is given. In a second approach problems of another class are transformed such that more factors are found during the computation; these transformations are based on the theory of linear representations. Examples illustrate these approaches. The range of solvable problems is enlarged significantly.
Layering and multiple views of data abstraction in Ada: techniques and experiences
Authors: S. Keller, J. Perkins, K. O'Leary
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

This paper describes the results of a study to investigate alternative techniques for using private types and packages to limit visibility of declarative items in Ada. Shortfalls of the conventional technique of applying private types, with regard to issues of recompilation, source code integrity, limiting visibility, performance, support of debugging, and interrelating abstractions, are identified. Possibly other developers of large Ada systems have encountered these issues; an analysis of over two million lines of Ada software developed for the Army, Navy, and Air Force shows that private types are rarely used. This paper describes a series of unconventional techniques for using private types and packages to layer more abstract packages on top of less abstract packages, and to develop multiple views of abstract data types applicable to different classes of users. The promising techniques were applied on an actual software engineering problem, the development of a tree-builder component of an Ada-to-DIANA translator. A description of experiences, in which the techniques realized benefits for changing and debugging the software and for improving reliability, is provided.
Ada software experience with the advanced information processing system
Authors: L. S. Alger
Venue: Proceedings of the conference on TRI-Ada '88 (1989)

The topics covered by the presentation are listed: The AIPS system overview is informational and will be covered quickly AIPS hardware and software are also informational and will be covered quickly Experience include enhancements to the Ada run time system, and the problems and advantages of using Ada for real time, fault tolerant systems Benchmarks were done on several processors and several run time system overheads were measured Future Ada work