ppxscal/embedding_network huggingface dataset:
Handling contingencies in planned office activities
Authors: Agustin Araya
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

A plan-based approach for systems that support office activities involving multiple agents has several advantages. It can represent important aspects of these activities, it has the potential for alleviating maintenance problems by generating new plans when activities change, and it can increase the reusability of knowledge across activities. On the other hand, because office activities take place in dynamic environments a system using a plan to coordinate an activity will have to deal with many contingencies and surprises. We describe the main characteristics of a plan-based approach and the roles a system of this kind can play in an office, and present a process for handling contingencies which can make the system robust in the presence of contingencies not explicitly dealt with in the plan. We close with a discussion of an implementation of the process and the viability of the approach to support real office activities.
The minimum consistent DFA problem cannot be approximated within and polynomial
Authors: L. Pitt, M. K. Warmuth
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

The minimum consistent DFA problem is that of finding a DFA with as few states as possible that is consistent with a given sample (a finite collection of words, each labeled as to whether the DFA found should accept or reject). Assuming that P &ne; NP, it is shown that for any constant k, no polynomial time algorithm can be guaranteed to find a consistent DFA of size optk, where opt is the size of a smallest DFA consistent with the sample. This result holds even if the alphabet is of constant size two, and if the algorithm is allowed to produce an NFA, a regular grammar, or a regular expression that is consistent with the sample. Similar hardness results are described for the problem of funding small consistent linear grammars.
An efficient two-dimensional layout compaction algorithm
Authors: H. Shin, C.-Y. Lo
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

A new heuristic two-dimensional symbolic layout-compaction approach is developed. After conventional one-dimensional compaction steps, all the components on the critical paths that define the height or width of the given layout are found and rearranged to reduce the layout size. During this process, constraints in both x and y directions are considered and pitch-matching of ports for hierarchical compaction can be achieved to reduce the amount of the design data. This approach generated the smallest area for several examples we have tried when compared with other published results. The expected run time can be bounded by &Ogr;(T1), where T1 is the run time of a typical one-dimensional compactor.
Using Perceptual Organization to Extract 3D Structures
Authors: R. Mohan, R. Nevatia
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The authors describe an approach to perceptual grouping for detecting and describing 3-D objects in complex images and apply it to the task of detecting and describing complex buildings in aerial images. They argue that representations of structural relationships in the arrangements of primitive image features, as detected by the perceptual organization process, are essential for analyzing complex imagery. They term these representations collated features. The choice of collated features is determined by the generic shape of the desired objects in the scene. The detection process for collated features is more robust than the local operations for region segmentation and contour tracing. The important structural information encoded in collated features aids various visual tasks such as object segmentation, correspondence processes, and shape description. The proposed method initially detects all reasonable feature groupings. A constraint satisfaction network is then used to model the complex interactions between the collations and select the promising ones. Stereo matching is performed on the collations to obtain height information. This aids in further reasoning on the collated features and results in the 3-D description of the desired objects.
A note on the numerical evaluation of arctangent function
Authors: S. Moritsugu, M. Matsumoto
Venue: ACM SIGSAM Bulletin (1989)

This paper describes the problem of selection of an appropriate branch of multiple-valued functions. Real-valued arctangent function over real number filed is considered as an example. It is discussed how to select FORTRAN functions "ATAN" and "ATAN2', and how to evaluate the formula [arctan [EQUATION]. Minute post-conditioning is required for transferring the result of computer algebra to numerical computation.
A simplified graphic notation for Ada programs
Authors: D. Sterne, A. Glendening, A. Jachowski, G. Pretti
Venue: ACM SIGAda Ada Letters (1989)

A number of graphic notations for describing Ada programs have been proposed. In general, these are not supported by off-the-shelf tools; they are perceived by nonexperts as incomprehensible; they obscure simple design deficiencies; and they cannot adequately represent design overviews. To address these problems, a simplified graphic notation has been developed and used in a large Ada application at GTE Government Systems Corporation, in Rockville, Maryland. The notation consists of three interrelated diagrams based on extensions of structure chart concepts.
Sacrificing simplicity for convenience: Where do you draw the line?
Authors: J. H. Williams, E. L. Wimmers
Venue: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1988)

The designers of (functional) programming languages are faced with two occasionally conflicting goals: programmer convenience and semantic simplicity. For example, it is convenient to treat I/O operations as primitive &ldquo;functions&rdquo; with side effects, but doing so destroys referential transparency. FL is a functional language that is designed to trade some of the semantic simplicity of a pure language for some of the convenience of a procedural language, by treating I/O operations as primitives with &ldquo;side effects&rdquo;, but by using a structuring technique that localizes the scope of those effects. In this way, surprisingly little of the semantic simplicity is lost, as can be seen by comparing the underlying algebraic laws of FL with those of its pure counterpart. FP. This paper describes that comparison and shows that, in fact, for programs involving I/O, the structures of the algebraic laws of the two languages are identical! It concludes by showing that this technique cannot be extended to allow assignment statements without incurring a massive loss in the expressiveness and simplicity of the underlying algebra.
Automated proof of ring commutativity problems by algebraic methods
Authors: Hantao Zhang
Venue: Journal of Symbolic Computation (1990)

Using a simple computer program, we have proved thousands and thousands of instances ofthe theorem that for any integer n>1, for any element x in an associative ring, x^n=x implies the commutativity of the ring (an instance of the theorem is obtained by taking a specific value for n). The program is based on Newton's binomial theorem and Euclid's gcd algorithm. New algorithms are introduced to speed up the gcd computation and to decide quickly whether a binomial coefficient is odd.
The changing of the guard: a case study of change in computing
Authors: Alison Hartman, Thomas Gerace, Cliff Woodruff, J. E. Diem
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

Change, in the context of computing environments, can assume a number of forms, varying widely in nature and degree. At Tulane University, Tulane Computing Services initiated a significant change in the Office of the President of the University: the existing system of stand-alone MS-DOS microcomputers was replaced by a Macintosh local area network complete with laser printing, mainframe communications, and shared file access. In this instance, the director of the department (the President of the University) directed that the change take place, and the central computing organization and the President's office staff worked together to accomplish the transition to the new computing environment. The change was effected with minimal disruption to the department's operations. This paper describes the successful implementation of change from one computing environment to another. We discuss the planning and preparation involved in facilitating change, the training and education required for those involved in the change, and the attitudes of the individuals affected by the change. An important component of the process was interviews conducted with those involved. These interviews were conducted in order to determine the factors which influence an individual's attitudes toward change, specifically in the context of computing environments.
Computer perspectives: the bandwidth famine
Authors: Maurice V. Wilkes
Venue: Communications of the ACM (1990)

A number of years ago I visited a young and successful computer company and was given a tour of the facilities by one of the directors. We passed offices in which people were working at computer terminals; I was told they constituted the accounts department. A little further on we came to the software department; here people were also using terminals. &ldquo;Now,&rdquo; said my host, &ldquo;I will show you the hardware department.&rdquo; To my surprise, instead of the oscilloscopes and waveform analyzers that I had expected to find, I saw more computer terminals. This was a sign of the times.Today, the designer of printed circuit boards such as those intended to be plugged into PCs, has a great variety of software tools from which to choose: programs for layout and routing; programs for checking that the design rules have been followed correctly; logic simulators for checking that the design is functionally correct; and more elaborate simulators for checking the timing. These tools make it possible to produce a working prototype without performing any experimental work on a laboratory bench.In the dark ages of electronics, the debugging of circuits was carried out using experimental versions made by screwing the components down on a piece of wood and connecting them. The behavior of the circuit was checked using an oscilloscope. These experimental versions were known as breadboards, because someone had compared them to those boards on which bread was sliced. The wooden board has been obsolete for years, but the term has survived. A modern version of the breadboard (still used occasionally) is the wire-wrapped prototype. It is, however, costly in time and money and the effort spent on it does not advance the physical design of the final product. Moreover, in certain respects, particularly as regards electrical interference and cross talk, the wire-wrapped version may give misleading information.
Authentication Mechanisms in Microprocessor-Based Local Area Networks
Authors: L. Ciminiera, A. Valenzano
Venue: IEEE Transactions on Software Engineering (1989)

The problem of authenticating the users of a computer network in order to protect the shared resources against unauthorized use is discussed. Since intruders could enter the network and try to use services they have no right to access, the host implementing the service (or server) has to check the user's identity and access rights by searching in the relevant database. The author presents a method of carrying out such checks efficiently. The basic idea is that a suitable interface process is associated with each user-server connection in order to filter out unauthorized requests, thus implementing a sort of cache with parallel search where the working set of the whole database is stored and explored. The use of the interface process enables the system to exploit the hardware support for capability checking provided by new microprocessors. In particular, an implementation using iAPX432-based hosts is illustrated and performance issues are discussed.
A data acquisition and information handling system in Ada for electron spectroscopy
Authors: M. Carlsson, L. Asplund
Venue: ACM SIGAda Ada Letters (1989)

A distributed, real time, data acquisition computer system for electron spectroscopy, ESCA, is presented. The design and implementation in Ada involves windowing, menus, forms, graphical presentation, multitasking and instrumental communication. Our experience using Ada is discussed. Ada has been used in all phases. Data types and packages are presented. It is found that the language is very suitable for scientific purposes.
Why a supercomputer is like a Burger King
Authors: Landy Manderson
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

Recently, Alabama installed a Cray supercomputer for use in research and education throughout the state. In response to this, we were asked to present a discussion of the intricacies of supercomputing for a group that was primarily involved with an IBM mainframe. The resulting speech turned out to be a somewhat humorous and completely analogical look at the entire spectrum of computing systems. This paper and its accompanying session is a presentation of that speech; it is hoped that it can provide inspiration and motivation for others faced with a similar task.
Design Techniques for Testable Embedded Error Checkers
Authors: E. J. McCluskey
Venue: Computer (1990)

Design techniques to ensure the testability of embedded checkers that cannot be tested by scan-path bistables are presented. The discussion covers: types of error detectors; parity checkers and self-testing circuits; two-rail checkers; M-out-of-N checkers; and equality checkers. The techniques outline guarantee single stuck fault testability.
The designer as user: building requirements for design tools from design practice
Authors: Mary Beth Rosson, Wendy Kellogg, Susanne Maass
Venue: Communications of the ACM (1988)

Software tools that support the design and development of interactive computing systems are an exciting possibility. The potential pay-off is great: user interface management systems, for example, promise not only to speed the process of specifying, implementing and maintaining user interface code, but also to guide the content of the user interfaces they support. As for any tool intended for human use, however, the success of software design tools will hinge on a thorough understanding of the problems they seek to address&mdash;design as it is practiced in the real world.
Achieving high instruction cache performance with an optimizing compiler
Authors: W. W. Hwu, P. P. Chang
Venue: ACM SIGARCH Computer Architecture News (1989)

Increasing the execution power requires a high instruction issue bandwidth, and decreasing instruction encoding and applying some code improving techniques cause code expansion. Therefore, the instruction memory hierarchy performance has become an important factor of the system performance. An instruction placement algorithm has been implemented in the IMPACT-I (Illinois Microarchitecture Project using Advanced Compiler Technology - Stage I) C compiler to maximize the sequential and spatial localities, and to minimize mapping conflicts. This approach achieves low cache miss ratios and low memory traffic ratios for small, fast instruction caches with little hardware overhead. For ten realistic UNIX* programs, we report low miss ratios (average 0.5%) and low memory traffic ratios (average 8%) for a 2048-byte, direct-mapped instruction cache using 64-byte blocks. This result compares favorably with the fully associative cache results reported by other researchers. We also present the effect of cache size, block size, block sectoring, and partial loading on the cache performance. The code performance with instruction placement optimization is shown to be stable across architectures with different instruction encoding density.
John von Neumann's Contributions to Computing and Computer Science
Authors: W. Aspray
Venue: IEEE Annals of the History of Computing (1989)

Aspray emphasizes von Neumann's critical role in the formation of modern computing and celebrates von Neumann as the scientific legitimizer of computing. He provides a survey of von Neumann's many important contributions to computer architecture, hardware, design and construction, programming, numerical analysis, scientific computation, and the theory of computing. Aspray's essay stresses especially the importance of von Neumann's work to promote the development of logical design.
A Predictable Real-Time Kernel for Distributed Multisensor Systems
Authors: I. Lee, R. B. King, R. P. Paul
Venue: Computer (1989)

The authors present a real-time kernel developed to support a distributed multisensor system encountered in robotics applications. To ensure predictability, the kernel provides services with bounded worst-case execution times. In addition, the kernel allows the programmer to specify timing constraints for process execution and interprocess communication. The kernel uses these timing constraints both for scheduling processes and for scheduling communications. To illustrate the kernel, the authors describe a multisensor system being developed on their distributed real-time system. They present the measured performance of kernel primitives along with conclusions and remarks regarding distributed real-time systems.
Determining Surface Orientation by Projecting a Stripe Pattern
Authors: M. Asada, H. Ichikawa, S. Tsuji
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

A method is presented for determining the surface orientations of an object by projecting a stripe pattern on to it. Assuming orthographical projection as a camera model and parallel light projection of the stripe pattern, the method obtains a 2 1/2-D representation of objects by estimating surface normals from the slopes and intervals of the stripes in the image. The 2 1/2-D image is further divided into planar or singly curved surfaces by examining the distribution of the surface normals in gradient space. A simple application to finding a planar surface and determining its orientation and shape is shown. The error in surface orientation is discussed.
Modular Decomposition of Combinatorial Multiple-Values Circuits
Authors: K.-Y. Fang, A. S. Wojcik
Venue: IEEE Transactions on Computers (1988)

A decomposition approach to the modular design of multiple-valued logic functions is discussed. Systematic procedures to utilize a fixed set of building blocks from which an arbitrary function can be designed are illustrated. The building blocks are composed of T gates (multiplexers). The first step is the partitioning of all logic functions into classes. Representative building blocks for each class are then developed. Finally, optimization techniques are described that reduce the number of building blocks required in the design. This approach is, in principle, applicable to functions in any radix and will always yield a design for the target function. Examples are presented to illustrate the approach for ternary functions.
Beacons an initial program comprehension
Authors: S. Wiedenbeck, J. Scholtz
Venue: ACM SIGCHI Bulletin (1989)

Beacons are any surface features which typically occur in a program and strongly point to the program's function. In a sort the swap is a beacon because it is typically present and is the prime operation which moves the problem toward the goal of a sorted list. Our objective was to establish a causal connection between the presence of beacons and comprehension of high-level program function.
Modeling mutation on a vector processor
Authors: A. P. Mathur, E. W. Krauser
Venue: Proceedings of the 10th international conference on Software engineering (1988)

Mutation analysis is a software testing methodology designed to substantiate the correctness of a program &PHgr;. The mutation approach is to induce syntactically correct changes in &PHgr;, thereby creating a set of mutant programs. The goal of a tester is to construct a set of test data T that distinguishes the output of &PHgr;(T) from that of all mutant programs. Test data sensitive enough to distinguish al1 mutant programs is deemed adequate to infer the probable correctness of &PHgr;. We propose an algorithm designed to exploit the architecture of a vector processor like the Cyber 205 or Cray X/MP. The algorithm manages the simultaneous execution of multiple mutant FORTRAN 77 programs. This is accomplished by viewing the execution of these mutants as a sequence of vector instructions. The algorithm promises potential to greatly increase the performance of a mutation based testing system, as well as points towards a general method of simultaneous program execution against multiple data sets.
Simulation and layout of a laser radar production facility
Authors: S. J. Lehman, W. R. Davison
Venue: Proceedings of the 21st conference on Winter simulation (1989)

As manufacturing operations expand or contract with changing economic climates, there is a need to identify alternative office, factory and plant space requirements. These analyses may include the rearranging of office or factory space, the addition of new facilities and equipment, or the contraction and consolidation of existing space. Often, this analysis is required in a short time with personnel awaiting the results before beginning construction.Such was the case at the United Technology Optical Systems (UTOS) facility in West Palm Beach, Florida where production of a laser radar system was to be undertaken. A limited amount of space was available for production and it was not known whether this area could be effectively used for manufacturing. Production floor space is a commodity that is hotly contested for within a facility that manufactures several product lines. The laser radar production group was being pressured to finalize their space and equipment requirements as soon as possible, adding to the urgency.This paper describes a program undertaken by the United Technologies Research Center (UTRC) to develop a simulation model of the proposed laser radar facility and by exercising the model, to assist UTOS in identifying output and production capabilities. The results of this analysis were used as a basis for developing a layout of the production and clean room areas indicating the actual number and location of the equipment needed to meet the desired production schedule.
A grammar-based approach towards unifying hierarchical data models
Authors: M. Gyssens, J. Paredaens, D. van Gucht
Venue: ACM SIGMOD Record (1989)

A simple model for representing the hierarchical structure of information is proposed. This model, called the grammatical model, is based on trees that are generated by grammars; the grammars describe the hierarchy of the information represented by the trees. Two transformation languages, an algebra and a calculus, are presented and shown to be equally expressive.
Enhanced simulated annealing for automatic reconfiguration of multiprocessors in space
Authors: J. R. Slagle, A. Bose, P. Busalacchi, C. Wee
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

This paper describes our recent results in developing enhanced simulated annealing algorithms using a LISP environment. The application is to use simulated annealing for automatic reconfiguration of multiprocessors in space. Our approach to solving this problem involves a combination of object-oriented programming, search strategies, knowledge based reasoning, and an advanced reconfiguration algorithm. The application was developed and is being enhanced on a LISP workstation (Xerox Dandelion) using LOOPS. This environment played an important role in both the initial success of the prototype [9] and the recent development efforts [3] [16] [22].