ppxscal/embedding_network huggingface dataset:
The integrity problem, and what can be done about it using today's DBMSS
Authors: Pentti A. Honkanen
Venue: ACM SIGMIS Database (1989)

This paper examines the integrity problem in light of what can be accomplished using the syntax of major main-frame DBMSs. The data, entity, and referential integrity problems are examined as they pertain to the relational model. Some suggestions proposed in current literature are examined as a basis for possible solutions. Three major DBMSs, IBM's DB2 (SQL/DS), Cullinet's IDMS/R, and Cincom's Supra are examined and solutions to the data, entity, and referential integrity problems are presented for each system. The proposed solutions cover a spectrum of approaches that could be used in a real world environment. DB2 requires complete individual problem by problem attention by the DBA, IDMS/R requires encoding of constraints by the DBA at schema compilation time, and Supra has system support.
3-D Surface Solution Using Structured Light and Constraint Propagation
Authors: G. Hu, G. Stockman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A method for 3-D surface measurement using a projected grid of light is presented. The grid line identification problem is solved using very general constraints. At the same time, 3-D surface patch solutions are developed. From the general constraints of set of geometric and topological rules are derived that are effectively applied in the computation of grid labels and hence 3-D surface solutions. A set of five algorithms has been applied on five real scenes consisting of multiple objects of arbitrary shapes. The results show that globally consistent surface solutions can be obtained rapidly with good accuracy using a single image. A small degree of ambiguity remains, but can be further reduced or removed using increased knowledge.
New methods in the analysis of logic minimization data and algorithms
Authors: A. J. Coppola
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper introduces techniques from combinatorial and algebraic topology to help in explaining and measuring the performance of modern logic minimizers. The concepts of simple cubical homotopy and the Euler&mdash;Poincare characteristic of a logic cover are defined and analyzed. In particular, simple cubical homotopy is related to the minimization algorithms Espresso&mdash;EXACT and Roth's Extraction Algorithm. Experimental results on the Euler&mdash;Poincare characteristic, along with a new measure, the Euler Ratio are related to the function complexity concepts of &ldquo;Cyclic constraints&rdquo; in Espresso_EXACT, the &ldquo;CyclicKernel&rdquo; in Roth's Extraction Algorithm, and &ldquo;cubical homotopy&rdquo; introduced in this paper.
The Meiko computing surface: an example of a massively parallel system
Authors: CORPORATE Meiko
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

The Computing Surface is a flexible, extensible computing system which is constructed from a choice of intelligent building blocks. A variety of building blocks are available with a range of computational or peripheral capabilities. The general application area in which the Computing Surface is going to be used influences the number and mixture of building blocks chosen to construct a particular machine. Each building block contains a 10Mips, 1 Mflops processor with four autonomous message channels providing communications bandwidth of 10Mbytes per second. The Computing Surface contains an electronic switching mechanism which allows these message channels to be connected in a topology defined by the software of individual applications as they are loaded to be run. Because the message passing capability is 'point-to-point', total system communication bandwidth increases in proportion to the number of building blocks, and therefore in proportion to the processing performance of the system. The architecture is therefore truly extensible, allowing supercomputer class machines to be constructed.
Warp experience: we can map computations onto a parallel computer efficiently
Authors: H. T. Kung
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

Warp is a programmable, systolic array computer developed by Carnegie Mellon and produced by GE. A 10-cell Warp machine can perform 100 million floating-point operations per second (10 MFLOPS). A variety of applications have been mapped onto Warp. The experience has been that the mapping is not a real problem; in fact, usually near-optimal mapping is relatively easy to obtain, and the actual implementation of the mapping on the machine can often be automated. This paper explains why this is the case by examining some computational models which are frequently used on Warp. Carnegie Mellon and Intel are jointly developing a VLSI version of Warp, called iWarp. It is expected that many applications can be efficiently mapped onto low-cost iWarp arrays to achieve an effective computation bandwidth of about one GigaFLOPS.
Knowledge base applications with software engineering: a tool for requirements specifications
Authors: D. W. Cordes, Doris L. Carver
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

The development of proper system specifications provides a foundation for the entire software development process. The effectiveness of the overall system is influenced greatly by the quality of the specifications produced during this phase of the life cycle. Furthermore, this phase acts as a &ldquo;bridge&rdquo; between the user and the software development team. A tool is presented for improving the environment in which specifications are constructed. The bridge between the user and software team is enhanced, improving the interaction between these two groups. By enhancing the user's role within the specification processes, the overall quality of the requirements specifications documents can be improved.
An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases
Authors: Douglas W. Cornell, Philip S. Yu
Venue: IEEE Transactions on Software Engineering (1990)

Vertical partitioning can be used to enhance the performance of relational database systems by reducing the number of disk accesses. The authors identify the key parameters for capturing the behavior of an access plan and propose a two-step methodology consisting of a query analysis step to estimate the parameters and a binary partitioning step which can be applied recursively. The partitioning uses an integer linear programming technique to minimize the number of disk accesses. Significant performance benefit would be achieved for join if the partitioned (inner) relation could fit into the memory buffer under the inner-outer loop join method, or if the partitioned relation could fit into the sort buffer under the sort-merge join method, but not the original relation. For cases where a segment scan or a cluster index scan is used, vertical partitioning of the relation with the algorithm described is still often found to lead to substantial performance improvement.
AI online: the coverage of the literature of artificial intelligence in online bibliographic databases
Authors: William J. Mills
Venue: Issue 107 (January 1989) (1989)

Two years ago I analysed the degree of scatter of AI literature across a wide range of online bibliographic databases [1]. This paper presents the results of a similar survey two years later. Besides drawing attention to those databases which are most likely to yield relevant information for any particular query, the survey also demonstrates the massive growth in the amount of AI-related literature and to some extent identifies where that growth has been most rapid and which other areas may be ripe for development.
Philosopher's corner
Authors: D. Guinier
Venue: ACM SIGSAC Review (1989)

One of the two methods described has points in common with that of Starcenko L. P. (1959) who based his principle on a basic-property of transcendental numbers, namely that the fractional part of a logarithmic set of r prime numbers guaranties completely uniformly (0.,1.) distributed sequences of pseudo-random numbers O (e(LogN(k))**3)+1 for k=1,2,...rOur original method also generates uniform random sequences of real numbers in the interval (0., 1.). It uses a set of real numbers of 54-bit precision mantissa issued from the approximation of independent quotients from randomly chosen integers as dividends and their associated prime numbers as divisors.An aperiodic method: In practice, no period caused by irrationality or error-rounding of the numbers used should be encountered.A faster method: Because the method works only by the use of floating-point additions and subtractions, it provides a better velocity than congruential methods which use integer multiplications and modular reductions.A transportable method: Since the implementation of real numbers in double precision follows the same IEEE standard for binary floating-point arithmetic, this method should give the same results for all sequences and be qualified as transportable.
Learning Nested Differences of Intersection-Closed Concept Classes
Authors: David Helmbold, Robert Sloan, Manfred K. Warmuth
Venue: Machine Learning (1990)

This paper introduces a new framework for constructing learning algorithms. Our methods involve master algorithms which use learning algorithms for intersection-closed concept classes as subroutines. For example, we give a master algorithm capable of learning any concept class whose members can be expressed as nested differences (for example, c1 &ndash; (c2 &ndash; (c3 &ndash; (c4 &ndash; c5)))) of concepts from an intersection-closed class. We show that our algorithms are optimal or nearly optimal with respect to several different criteria. These criteria include: the number of examples needed to produce a good hypothesis with high confidence, the worst case total number of mistakes made, and the expected number of mistakes made in the first t trials.
Distributed FIFO allocation of identical resources using small shared space
Authors: Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1989)

We present a simple and efficient algorithm for the FIFO allocation of k identical resources among asynchronous processes that communicate via shared memory. The algorithm simulates a shared queue but uses exponentially fewer shared memory values, resulting in practical savings of time and space as well as program complexity. The algorithm is robust against process failure through unannounced stopping, making it attractive also for use in an environment of processes of widely differing speeds. In addition to its practical advantages, we show that for fixed k, the shared space complexity of the algorithm as a function of the number N of processes is optimal to within a constant factor.
Human-computer interaction research at the University of Illinois (lab review)
Authors: Arthur F. Kramer, Christopher D. Wickens
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

The Engineering Psychology program at the University of Illinois is interdisciplinary in nature and involves the participation of faculty members, undergraduate, graduate and post-doctoral students from the Department of Psychology, Department of Industrial Engineering, the Institute of Aviation, and the Beckman Institute. While the interests of the faculty members and the students run the gamut from nuts and bolts ergonomics to the design of intelligent systems there are two topics, the design of displays and the acquisition of perceptual-motor and cognitive skills, which serve as a unifying focus of research in Human-Computer Interaction. The examination of issues in display design and skill acquisition ranges from basic research on visual psychophysics and automatization to applied research and design projects on aviation displays and computer-based tutorials. Three laboratories within the Engineering Psychology program contribute to these research efforts: the Visual Information Processing laboratory, the Human-Computer Interaction laboratory, and the Aviation Research laboratory. In the description that follows we will indicate the mission of each of these laboratories and the manner in which they contribute to the interdisciplinary research programs on displays and skill acquisition. The core faculty members conducting Human-Computer Interaction research within the interdisciplinary Engineering Psychology program include: John Andersen (Psychology) John Flach (Engineering) Arthur Kramer (Psychology) Gavan Lintern (Aviation) George McConkie (Psychology) Neville Moray (Engineering) Penelope Sanderson (Engineering) Alan Stokes (Aviation) Brian Ross (Psychology) Christopher Wickens (Aviation)
Performance Considerations for an Operating System Transaction Manager
Authors: Akhil Kumar, Michael Stonebraker
Venue: IEEE Transactions on Software Engineering (1989)

Results of a previous comparison study (A. Kumar and M. Stonebraker, 1987) between a conventional transaction manager and an operating system (OS) transaction manager indicated that the OS transaction manager incurs a severe performance penalty and appears to be feasible only in special circumstances. Three approaches for enhancing the performance of an OS transaction manager are considered. The first strategy is to improve performance by reducing the cost of lock acquisition and by compressing the log. The second strategy explores the possibility of still further improvements from additional semantics to be built into an OS transaction system. The last strategy is to use a modified index structure that makes update operations less expensive to perform. The results show that the OS will have to implement essentially all of the specialized tactics for transaction management that are currently used by a database management system (DBMS) in order to match DBMS performance.
Simulation analysis of a flexible integrated chemical production facility
Authors: J. E. Branstrator
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The design of a "green field" chemical production facility is a complex issue. The evaluation of proven and experimental production processes is necessary. Equipment layout and switching station design should address the flexible requirements of production while adhering to budgetary constraints. Production throughput should be quantified with a valid understanding of scheduling sensitivities. The requirement and impact of critical resources such as labor, raw materials, and warehouse transactions must be realized. Finally, the sizing of various holding tanks for environmental treatment requires coordination with production levels.The intricacies of this manufacturing process make traditional throughput calculations and linear programming approaches obsolete. These issues can be better addressed using computer simulation to model the proposed facility. This paper explores how the design of a new chemical production plant was facilitated using simulation analysis.
Functional languages in microcode compilers
Authors: S. J. Allan
Venue: Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture (1989)

This paper discusses the advantages of using high-level languages in the development of microcode. It also describes reasons functional programming languages should be considered as the source language for microcode compilers. The emergence of parallel execution in microarchitectures dictates that parallelism must be extracted from the microcode programs. This paper shows how functional languages meet the needs of microprogrammers by allowing them to express their algorithms in natural ways while allowing the microcode compiler to extract the parallelism from the program.
Stochastic Petri Net Analysis of a Replicated File System
Authors: J. B. Dugan, G. Ciardo
Venue: IEEE Transactions on Software Engineering (1989)

The authors present a stochastic Petri net model of a replicated file system in a distributed environment where replicated files reside on different hosts and a voting algorithm is used to maintain consistency. Witnesses, which simply record the status of the file but contain no data, can be used in addition to or in place of files to reduce overhead. A model sufficiently detailed to include file status (current or out-of-date) as well as failure and repair of hosts where copies or witnesses reside, is presented. The number of copies and witnesses is not fixed, but is a parameter of the model. Two different majority protocols are examined.
Revision control in an integrated software development environment
Authors: B. Westfechtek
Venue: ACM SIGSOFT Software Engineering Notes (1989)

We present a graph-based formal approach to revision control that takes consistency relations between revisions of different documents into account. We use a new powerful graph grammar specification language, called PROGRESS, for the rule-based specification of consistency preserving changes to revision graphs. In addition to coarse-grained relations between revisions, we also deal with fine-grained relations between increments which belong to revisions of different documents. Our work provides the formal basis for the construction of a syntax-directed hypertext editor which supports control of revisions and their interrelations.
Rendering fur with three dimensional textures
Authors: J. T. Kajiya, T. L. Kay
Venue: ACM SIGGRAPH Computer Graphics (1989)

We present a method for rendering scenes with fine detail via an object called a texel, a rendering primitive inspired by volume densities mixed with anisotropic lighting models. This technique solves a long outstanding problem in image synthesis: the rendering of furry surfaces.
Testing a walkthrough methodology for theory-based design of walk-up-and-use interfaces
Authors: Clayton Lewis, Peter G. Polson, Cathleen Wharton, John Rieman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

The value of theoretical analyses in user interface design has been hotly debated. All sides agree that it is difficult to apply current theoretical models within the constraints of real-world development projects. We attack this problem in the context of bringing the theoretical ideas within a model of exploratory learning [19] to bear on the evaluation of alternative interfaces for walk-up-and-use systems. We derived a &ldquo;cognitive walkthrough&rdquo; procedure for systematically evaluating features of an interface in the context of the theory. Four people independently applied this procedure to four alternative interfaces for which we have empirical usability data. Consideration of the walkthrough sheds light on the consistency with which such a procedure can be applied as well as the accuracy of the results.
Requirements for optimal execution of oops with tests
Authors: A. Uht
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

Both the efficient execution of branch intensive code and knowing the bounds on same are important issues in computing in general and supercomputing in particular. In prior work, it has been suggested, implied, or left as a possible maximum, that the hardware needed to execute code with branches optimally, i.e., oracular performance, is exponentially dependent on the total number of dynamic branches to be executed, this number of branches being proportional at least to the number of iterations of the loop. For classes of code taking at least one cycle per iteration to execute, this is not the case. For loops containing one test (normally in the form of a Boolean recurrence of order 1), it is shown that the hardware necessary varies from exponential to polynomial in the length of the dependency cycle L, while execution time varies from one time cycle per iteration to less than L time cycles per iteration; the variation depends on specific code dependencies.
Incremental systems development-a case study
Authors: P. Landherr
Venue: Proceedings of the international conference on APL (1987)

When Skandinaviska Enskilda Banken started trading bond options a pronounced need for a computerized trading support system arose. As the market changed, the demands on the system changed too, forcing it to evolve in several successive steps. The system described went through being an arbitrage system, a system for price quoting and ended up as a bona fide trading system, doing all of the above and keeping track of all trading, including multiple concurrent users and portfolios
Constructing Distributed Systems in Conic
Authors: Jeff Magee, Morris Sloman
Venue: IEEE Transactions on Software Engineering (1989)

The Conic environment provides a language-based approach to the building of distributed systems which combines the simplicity and safety of a language approach with the flexibility and accessibility of an operating systems approach. It provides a comprehensive set of tools for program compilation, configuration, debugging, and execution in a distributed environment. A separate configuration language is used to specify the configuration of software components into logical nodes. This provides a concise configuration description and facilitates the reuse of program components in different configurations. Applications are constructed as sets of one or more interconnected logical nodes. Arbitrary, incremental change is supported by dynamic configuration. In addition, the system provides user-transparent datatype transformation between heterogeneous processors. Applications may be run on a mixed set of interconnected computers running the Unix operating system and on base target machines with no resident operating system. The basic principles adopted in the construction of the Conic environment are outlined and the configuration and run-time facilities provided are described.
Construction of internet for Japanese academic communities
Authors: J. Murai, H. Kusumoto, S. Yamaguchi, A. Kato
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

WIDE (Widely Integrated Distributed Environment) is a research project aimed at achieving a transparent distributed environment over heterogeneous distributed computing elements with the consideration of various types of connections for internetworking. The target environment of the research is computing environment in the academic and research communities especially in Japan. The WIDE project started its research activities at the end of 1986. The initial purpose of the group was to design the future JUNET environment. In Japan JUNET has been the only network that provides connectivities among academic and research institutes in both private and public organizations. In order to provide better computer communication with the network, interconnection of networks based on open architecture is strongly required. As the result of various studies, the project started its actual design in late 1987 and has been establishing working environments by connecting several universities with various types of links. Together with the actual state and the future plan of the WIDE project, this paper discusses the overview of technologies being employed for the achievement of project goals such as networking technologies, operating system architecture and name space. As the background status of the WIDE projects, this paper also reports an overview of existing academic and research computer networks in Japan, especially focusing on university environments where the sharing of the large scale computing resources are provided.