ppxscal/embedding_network huggingface dataset:
Efficient formulation of a bivariate nonic C2-hermite polynomial on triangles
Authors: Albrecht Preusser
Venue: ACM Transactions on Mathematical Software (TOMS) (1990)

Bivariate polynomials over triangular domains are widely in use for the definition of surfaces that are continuously differentiable across a set of triangles. A description is given of how explicit formulas for the coefficients of bivariate nonic polynomials can be found with the help of a computer algebra system. A linear system with 55 equations and 45 nonzero right hand sides must be solved algebraically. The interpolant is twice differentiable across triangle sides and based on function values and partial derivatives up to fourth order at the nodes. Horner's scheme for evaluating polynomials can be applied directly, leading to optimal efficiency during the evaluation phase (54 additions and multiplications for one point). Starting with transformed nodal data, the calculation of one set of coefficients takes about 350 additions, the same number of multiplications, and 30 divisions. &mdash;Author's Abstract
Improving the efficiency of UNIX buffer caches
Authors: A. Braunstein, M. Riley, J. Wilkes
Venue: ACM SIGOPS Operating Systems Review (1989)

This paper reports on the effects of using hardware virtual memory assists in managing file buffer caches in UNIX. A controlled experimental environment was constructed from two systems whose only difference was that one of them (XMF) used the virtual memory hardware to assist file buffer cache search and retrieval. An extensive series of performance characterizations was used to study the effects of varying the buffer cache size (from 3 Megabytes to 70 MB); I\O transfer sizes (from 4 bytes to 64 KB); cache-resident and non-cache-resident data; READs and WRITEs; and a range of application programs. The results: small READ/WRITE transfers from the cache (&le;1 KB) were 5O% faster under XMF, while larger transfers (&ge;8 KB) were 20% faster. Retrieving data from disk, the XMF improvement was 25% and 1O% respectively, although OPEN/CLOSE system calls took slightly longer in XMF. Some individual programs ran as much as 40% faster on XMF, while an application benchmark suite showed a 7-15% improvement in overall execution time. Perhaps surprisingly. XMF had fewer translation lookaside buffer misses.
A high performance broadcast file transfer protocol
Authors: J. S. J. Daka, A. J. Waters
Venue: ACM SIGCOMM Computer Communication Review (1988)

This paper describes a broadcast bulk file transfer protocol and presents its performance characteristics. The protocol is for bulk file distribution over a single satellite channel. The transmitting site and multiple receiver sites share channel access time to send data and acknowledgements. The protocol performance characteristics are investigated using a simulation model that includes modelling of the uplink and downlink error processes at both the transmitter and receivers. The results obtained show that this protocol offers efficient reliable bulk file transfer to multiple receivers using a single satellite channel.
An associated object model for distributed systems
Authors: Zhao Hong, Wayne McCoy
Venue: ACM SIGOPS Operating Systems Review (1990)

As ISDNs develop, distributed applications on these networks will increase in number, scope and complexity. The distributed application environment will become more and more complicated. Distributed applications are as varied as application environments, requiring cooperations between them in different ways and to different extents. We describe here a new model that is designed to support distributed applications, called the Associated Object Model. In this model, multi-objects can communicate with each other through an abstract association, making it possible for application objects to cooperate in wider degree than was possible before. A mechanism supporting associations, broker, is introduced in this paper. By the mechanism, many associations between cooperating application objects can be established and maintained. The paper also includes some discussions about the description and implementation of the model and the mechanism.
Illumination networks: fast realistic rendering with general reflectance functions
Authors: Chris Buchalew, Donald Fussell
Venue: Proceedings of the 16th annual conference on Computer graphics and interactive techniques (1989)

We present a technique for modeling global illumination which allows a wide variety of reflectance functions. Scene coherence is exploited in a preprocessing step in which the geometry is analyzed using iterative techniques. Memory is traded for speed, in anticipation of the high memory capacities of workstations of the future. The algorithm operates well over a wide range of time and image quality constraints: realistic results may be produced very quickly while very accurate results require more time and space. The method can be extended for animation and parallelization.
Compiler optimizations for asynchronous systolic array programs
Authors: M. Lam
Venue: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1988)

A programmable systolic array of high-performance cells is an attractive computation engine if it attains the same utilization of dedicated arrays of simple cells. However, typical implementation techniques used in high-performance processors, such as pipelining and parallel functional units, further complicate the already difficult task of systolic algorithm design. This paper shows that high-performance systolic arrays can be used effectively by presenting the machine to the user as an array of conventional processors communicating asynchronously. This abstraction allows the user to focus on the higher level problem of partitioning a computation across cells in the array. Efficient fine-grain parallelism can be achieved by code motion of communication operations made possible by the asynchronous communication model. This asynchronous communication model is recommended even for programming algorithms on systolic arrays without dynamic flow control between cells. The ideas presented in the paper have been validated in the compiler for the Warp machine [4]. The compiler has been in use in various application areas including robot navigation, low-level vision, signal processing and scientific programming. Near-optimal code has been generated for many published systolic algorithms.
Comments, on 'Design and Evaluation of a Fault-Tolerant Multiprocessor Using Hardware Recovery Blocks' by Y.-H. Lee and K.G. Shin
Authors: Bruno Ciciani, G. Cantone
Venue: IEEE Transactions on Computers (1989)

The author shows that formula (9) of the above mentioned paper is erroneous. A new solution is proposed, and its congruency is shown.
Distributed Associative Memory (DAM) for Bin-Picking
Authors: H. Wechsler, G. L. Zimmerman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The feasibility of using a distributed associative memory as the recognition component for a bin-picking system is established. The system displays invariance to metric distortions and a robust response in the presence of noise, occlusions, and faults. Although the system is primarily concerned with two-dimensional problems, eight extensions to the system allow the three-dimensional bin-picking problem to be addressed. It is noted that there are implicit weaknesses in the neural network model chosen for the heart of the recognition system. The distributed associative memory used is linear, and as a result there are certain desirable properties that cannot be exhibited by the computer vision system.
Accuracy, integrity and security in computerized vote-tallying
Authors: R. G. Saltman
Venue: Communications of the ACM (1988)

The following excerpts have been gleaned from a 130-page report of potential inaccuracies and fraud in computerized voting systems. Recent difficulties in automated vote-tallying, including specific legal cases, are detailed along with a summary of conclusions and recommendations.
A framework for determining useful parallelism
Authors: F. Allen, M. Burke, R. Cytron, J. Ferrante, W. Hsieh
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

An approach to finding and forming parallel processes for both sequential and parallel programs is presented. The approach is presented in a framework that can create useful parallelism for a variety of parallel architectures. The framework makes use of a control dependence graph to capture maximal parallelism, a process tree to expose useful parallelism, renaming and storage segregation to reduce data dependencies, and an architecture-specific cost analyzer to evaluate the effectiveness of the potential processes. The framework is currently being implemented.
The effects of device technology on the usability of advanced telephone functions
Authors: T. L. Roberts, G. Engelbeck
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind (1989)

This paper presents a pilot study that addresses the effect that device technology has on the usability of advanced telephone functions. We prototyped telephone systems using three technologies: the current 12-button phone set, the current phone set augmented with speech synthesis, and a phone set augmented with a display and pointing device. The functions that we offered included call routing, call screening, and message retrieval. Experiments showed that a display-based phone was the fastest to use and was preferred; an interface that used voice-prompting was the slowest and least liked. This points out that future work on prompting interfaces will have to address user control and efficiency issues without causing learning/forgetting problems.
Should short, relatively complex algorithms be taught using both graphical and verbal methods? Six replications
Authors: David Scanlan
Venue: ACM SIGCSE Bulletin (1988)

This research investigates the preference for a graphical method (structured flowcharts) or for a verbal method (pseudocode) when learning short, relatively complex algorithms. The research summarizes the data from 6 replications using 193 students of data structures and 16 data structures classes. A preference for flowcharts was hypothesized under eight conditions. All eight conditions produced large differences which were statistically significant, p < .0001. The preferences for flowcharts ranged from 75.1% to 89.1%. No significant preferences were found for pseudocode. The results indicate that graphical methods should be strongly considered when teaching relatively complex algorithms. Most importantly, the results signify that there may be two types of learners: (1) a type which prefers flowcharts (a graphical method) and (2) a type which prefers pseudocode (a verbal method). Since most textbooks only express algorithms verbally, one must question the wisdom for using only one method.
Interactive performance display and debugging using the NCUBE real-time graphicssystem
Authors: R. Morison
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

The NCUBE Real-Time Graphics System is an option for NCUBE/7 and NCUBE/1O hypercube systems. It is a parallel graphics interface that is able to display up to 30 frames per second of hypercube output. Systems such as this are potentially well suited to real time display of output from parallel programs. This paper discusses the issues of real time display for performance monitors on MIMD computers that have a high bandwidth graphics interface such as the one mentioned above. Several monitors for an asynchronous parallel
EMIR: an expert system for electromagnetic interference resolution
Authors: J. E. Bowen, B. A. Boewn
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

The increasing density and complexity of modern radio communications systems and the crowded electromagnetic environment make electromagnetic interference (EMI) a growing concern. To ensure electromagnetic compatibility (EMC) in Transport Canada (TC) installations, such as airports and air traffic control centres, improved methods for systems design, installation and maintenance are required. When Electromagnetic Interference is found to be a problem, immediate steps are taken to identify and resolve the interference which may be caused by radiation sources such as broadcast stations, air/ground transmitters, computing devices, vehicular electrical systems, etc.This paper discusses Phase I of a multi-phase project. EMIR (Electromagnetic Interference Resolution) is a rule-based project, sponsored by Transport Canada of the Canadian Government, through its Transportation Development Centre. The project encapsulated, an expert's knowledge and experience about Radio Frequency Interference (RFI) between radio communication systems in an expert system.EMIR reflects the standard diagnostic algorithm of hypothesis, test, and corrective measures; however, it contains a novel approach toward the treatment of the uncertainty of input data. EMIR removes the necessity of acquiring from the user the uncertainty associated with the responses. It uses the expert's experience to judge the relevance of the response to each individual interference. In addition, the system has a module which is automatically invoked when an anomalous situation occurs. This module not only allows the system to consider anomalies, it will also call for assistance from the expert when the situation appears to be outside EMIR's capability. Finally, the user interface is as helpful and easy to operate as possible, and the system is expandable into other EMI domains.
An efficient 3-D visualization technique for finite element models and other coarse volumes
Authors: R. S. Gallagher, J. C. Nagtegaal
Venue: Proceedings of the 16th annual conference on Computer graphics and interactive techniques (1989)

We have developed a technique that extends existing 3-D result visualization methods for use with discretized volumes such as finite element models, where result values are only available at coarsely spaced points throughout the volume. It represents results as smooth isosurfaces within the volume for one or more result values, using visually continuous, bi-cubic polynomials.At each of the points where results are available, result gradients are calculated by a finite difference procedure. The result values and result gradients are used to obtain the location of and the tangents to the isosurfaces on lines connecting the result points. Continuous doubly curved surfaces and surface normals are constructed separately between these discrete isosurface points using bi-cubic polynomials. The isosurfaces are rendered with standard light-source shading and optional levels of translucency, surrounded by translucent free faces of the structure.The method generates isosurfaces on an element-by-element basis, without reference at display time to the behavior of neighboring elements. It is intended for high speed display-time processing of either static or varying isosurface values.
Astronomy from large databases: scientific objectives and methodological approaches
Authors: F. Murtagh
Venue: ACM SIGMOD Record (1988)

The role of databases is increasing continually in astronomy. So too is the need for applicable analysis methods to use on large collections of data. The need, for example, for suitable statistical tools and for experimentation in knowledge based approaches are both related to the growing quantities of astronomical data. The latter areas, and of course astrophysics, &mdash; the &ldquo;scientific objectives and methodological approaches&rdquo; part of the title &mdash; were the initial aim of this conference. But it is clear also that there is an urgent need to coordinate technical database issues. In all of these aspects, the papers in the proceedings volume resulting from this conference will be found to provide valuable introductory and reference material.
Computational objects in object-oriented data models
Authors: Jianhua Zhu, David Maier
Venue: Proceedings of the second international workshop on Database programming languages (1989)

Computational objects &mdash; objects with functional interpretations &mdash; are a valuable addition to structural objects in object-oriented data models for engineering CAD/CAM applications. We argue that the graph reduction technique from functional programming can be naturally blended with data models supporting complex objects and be used as a basis towards adding computational semantics to structural semantics in such data models. We present such an effort in an object-oriented data model: TEDM. We discuss a design of the graph memory, an implementation of a computational engine in Prolog, and the semantics of mixing pattern matching, reduction and imperative action in data manipulation languages.
Expert dictionaries: knowledge based tools for explanation and maintenance of complex application environments
Authors: Franca Garzotto, Paolo Paolini
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

The paper describes a new type of tool, which has been defined to support complex applications (such as the ones typically found in office environments). The relevant features of this tool are the following:it collects &ldquo;domain&rdquo; (also called &ldquo;deep&rdquo;) knowledge (relevant for the application domain), and uses it to explain the application &ldquo;behaviour&rdquo;, either automated or notit makes use of an extensional representation of the domain knowledge based on Hypertextsit can support the activity of maintenance (of the application) and of training (to understand how the application works). We have chosen for the tool the name &ldquo;Expert Dictionary&rdquo;. A first implementation of this tool for a specific application target (document generation) has been carried on with Hypertalk, the programming language of Hypercard.
FRESH, an expert system design tool on APL2
Authors: J. W. B. Vermeulen, E. R. K. Spoor
Venue: ACM SIGAPL APL Quote Quad (1990)

The emergence of commercially available expert system shells has opened up new avenues for large scale development of expert systems. However, this challenge also generates a new problem area concerned with ways of integrating such developments with existing information modelling environments. Expert system shells and conventional systems originate from distinct research areas with mutually differing modelling-views. These differences retard the natural incorporation of the new technology in existing environments. To attack this problem, a migration path is required. The fundamentals of expert systems shells should be carefully grafted upon existing modelling views in order to bridge the gap. This contribution describes the expert system design tool FRESH (Frame Relationship Expert-system SHell) and its underlying principles. The fundamentals of FRESH closely resemble those of the Entity-Relationship (ER) approach to information modelling. Some necessary adjustments, which enable knowledge representation, fit in naturally, without having the modelling view drift away from its origin. FRESH has been implemented in APL2, exploiting the language's state of the art data structures and interactive capabilities. Also, APL2 provides excellent opportunities to interface expert system technology to traditional management information systems.
Logic circuit design with the aid of an automated reasoning program
Authors: R. B. Abhyankar, B. Humpert
Venue: ACM SIGDA Newsletter (1988)

As an example of a logic circuit design problem, we consider the two-inverter puzzle [1] which may be stated as follows:Using any number of AND, OR gates but no more than two NOT gates (inverters), design a logic circuit with three inputs i1, i2, i3 and three outputs o1, o2, 03 such that o1=NOT (il), o2=NOT (i2), o3=NOT (i3).
Computer aided concurrent design for printed wiring boards
Authors: C. C. Martin, K. K. Hutchison
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

The design and fabrication cycle of Printed Wiring Boards (PWB) continues to expand. As designs become more complex, the possibility for first-pass correctness is reduced because the communication between engineers becomes more difficult due to the segregation of design knowledge into specific areas of expertise. The complexity of todays designs require more specialized knowledge for each phase in the product development cycle. The time now spent in the redesign cycles could be dramatically reduced if the knowledge now embedded in the support groups could be made available to the engineer up front. This paper presents an approach for reducing the time and cost required to produce a first-pass PWB design by building an integrated engineering support environment that aids the designer in simultaneously engineering both the design and fabrication stages.
Incremental foresighted local compaction
Authors: P. Wijaya, V. H. Allan
Venue: Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture (1989)

Under timing constraints, local compaction may fail because of poor scheduling decisions. Su [SDWX87] uses foresight to avoid some of the poor scheduling decisions. However, the foresight takes a considerable amount of time. In this paper the Incremental Foresight algorithm is introduced. Experiments using four different target architectures show that the Incremental Foresight algorithm works as well as foresight, and saves around 48 percent of the excess time.
Distributed processing of logic programs
Authors: Ouri Wolfson, Avi Silberschatz
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

This paper is concerned with the issue of parallel evaluation of logic programs. To address this issue we define a new concept of predicate decomposability. If a predicate is decomposable, it means that the load of evaluating it can be divided among a number of processors, without a need for communication among them. This in turn results in a very significant speed-up of the evaluation process. We completely characterize three classes of single rule programs (sirups) with respect to decomposability nonrecursive, linear, and simple chain programs. All three classes were studied previously in various contexts. We establish that nonrecursive programs are decomposable, whereas for the other two classes we determine which ones are, and which ones are not decomposable. We also establish two sufficient conditions for sirup decomposability.
High performance parallel architectures
Authors: R. E. Anderson
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

In this paper the author describes current high performance parallel computer architectures. A taxonomy is presented to show computer architecture from the user programmer's point-of-view. The effects of the taxonomy upon the programming model are described. Some current architectures are described with respect to the taxonomy. Finally, some predictions about future systems are presented.
Exploiting data parallelism in signal processing on a dataflow machine
Authors: P. Nitezki
Venue: ACM SIGARCH Computer Architecture News (1989)

This paper will show that the massive data parallelism inherent to most signal processing tasks may be easily mapped onto the parallel structure of a data flow machine. A special system called STRUCTFLOW has been designed to optimize the static data flow model for hardware efficiency and low latency. The same abstractions from the general purpose data flow model that lead to a quasi systolic operation of the processing elements make explicit flow control of the data tokens as they pass through the arcs of the flow graph obsolete. We will describe the architecture of the system and discuss the restrictions on the structure of the flow graphs.