ppxscal/embedding_network huggingface dataset:
A portable user interface for a scientific programming environment
Authors: Vincent A. Guarna, Yogesh Gaur
Venue: Proceedings of the 1st annual ACM SIGGRAPH symposium on User Interface Software (1988)

The subject of integrated programming environments for scientific computing has become very popular over the last few years. Environments such as Rn [CCHK87] are being constructed to help coordinate the disjoint activities of editing, debugging, and performance tuning typically seen in the program development cycle. One key aspect of an integrated development setting is the library of user interface tools which are available to the environment builders. Projects such as Andrew [MSCH86] have begun to construct reusable user interface libraries for client applications. This paper describes the interface tool kit for the Faust project being conducted at the University of Illinois. Faust is targeted at building a coherent development environment for scientific applications through the use of a library of portable user interface utilities.
An efficient hybrid algorithm for incremental data flow analysis
Authors: Thomas J. Marlowe, Barbara G. Ryder
Venue: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

Our exhaustive and incremental hybrid data flow analysis algorithms, based on iteration and elimination techniques, are designed for incremental update of a wide variety of monotone data flow problems in response to source program changes. Unlike previous incremental iterative methods, this incremental algorithm efficiently computes precise and correct solutions. We give theoretical results on the imprecision of restarting iteration for incremental update by fixed point iteration which provided motivation for our algorithm design. Described intuitively, the main algorithm idea is to factor the data flow solution on strong connected components of the flow graph into local and external parts, solving for the local parts by iteration and propagating these effects on the condensation of the flow graph to obtain the entire data flow solution. The incremental hybrid algorithm re-performs those algorithm steps affected by the program changes.
Neural agents - a frame of mind
Authors: S. S. Adams, A. K. Nabi
Venue: ACM SIGPLAN Notices (1989)

Several recent theories have been advanced to model complex heuristic behavior. From Minsky's Society of Mind to neural networks, these theories all share a common architecture consisting of many highly connected elements that together exhibit sophisticated macro behavior. This paper describes NeuralAgents, a framework developed in Smalltalk-80 that combines the high level interaction and collaboration of rule-based agents with the topological connectivity of neural nets. The Client-Facilitator-Consultant model for agencies will be presented, along with the object oriented design and implementation of the NeuralAgents system. PetWorld, an animated environment for the simulation of animal behavior is presented as an example application.
Application of REDUCE system for analyzing consistency of systems of P.D.E.'s
Authors: V. G. Ganzha, S. V. Meleshko, V. P. Shelest
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

A consistency analysis of differential equation systems involves a sequence of differential - algebraic operations. At present there are know two methods: the Cartan's and the Riquier-Janet-Kuranishi(RJK) method which are equivalent. The implementation of the both of the methods with the purpose of their practical application leads to large symbolic computations which often cannot be performed without a computer. The problem on the consistency investigation of a specific overdetermined system was solved in [1] with the aid of a computer. More recently, a number of computer codes implementing the both of the above methods on a computer have been developed (for example [2]). In the present paper we propose a realization of the RJK algorithm the REDUCE system [3]. One of RJK algorithm advantages over Cartan's algorithm is that there is no need to go over to exterior differential equation. It is, therefore more economical, particularly in the use of computer memory, which, in the problem at hand, is very important. The proposed version of the computer code enables us to investigate only the systems of quasilinear first - order differential equations. This limitation is not very restrictive, because the non-linearity is taken into account only in the process of the computation of the ranks of matrices. The REDUCE program was also used by the present authors for the extraction and construction of exact solutions of the equation systems from the continuum mechanics. New results were obtained with the aid of a computer. V.S. Shurygin and N.N. Yanenko: On the computer implementation of algebraic-differential algorithms. Problemy Kibernetik, Vyp. 6, 1961. V.G. Ganzha, S.V. Meleshko, F.A. Murzin, V.P. Shapeev, N.N Yanenko: Realization on computer of an algorithm for studying the consistency of partial differential equations. Dokl. Acad. Nauk SSSR, vol. 261, No 5, 1981. [3]. A.C. Hearn: REDUCE User's Manual. 1985.
Finite difference time domain solution of electromagnetic scattering on the hypercube
Authors: R. H. Calalo, J. R. Lyons, W. A. Imbriale
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

Electromagnetic fields interacting with a dielectric or conducting structure produce scattered electromagnetic fields. To model the fields produced by complicated, volumetric structures, the finite difference time domain (FDTD) method employs an iterative solution to Maxwell's time dependent curl equations. Implementations of the FDTD method intensively use memory and perform numerous calculations per time step iteration. We implemented an FDTD code on the California Institute of Technology/Jet Propulsion Laboratory Mark III Hypercube. This code allows us to solve problems requiring as many as 2,048,000 unit cells on a 32 node Hypercube. For smaller problems, the code produces solutions in a fraction of the time to solve the same problems on sequential computers.
The role of mathematics in the computer science curriculum
Authors: James Bradley
Venue: ACM SIGCSE Bulletin (1988)

There has been much debate in the past few years about the appropriate mathematics requirements for an undergraduate computer science major. The discussion has focused primarily on two issues: (1) the underlying mathematical content of computer science courses and (2) the content of mathematics courses which would serve as appropriate cognate requirements for computer science major programs. While this discussion has been helpful, it has been too narrowly focused--it has not started from an understanding of the relationship between the disciplines of mathematics and computer science, but rather has sought to identify mathematical prerequisites that computer science majors need in order to take existing computer science courses. This paper is a small step in seeking to apply an understanding of the relationship between the disciplines of mathematics and computer science to the undergraduate computer science curriculum.
Derivation from first principles of belief values generated in networks by message passing
Authors: W. Amsbury, P. R. Harrison
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

Some basic assumptions about the propagation of belief in the normal mode operation of system components in an arithmetic network are identified. They lead naturally to a message passing paradigm that propagates local computations throughout the system, and they are applicable to the quantification of reasoning in the presence of uncertainty in other contexts.
Chemical equilibrium systems as numerical test problems
Authors: Keith Meintjes, Alexander P. Morgan
Venue: ACM Transactions on Mathematical Software (TOMS) (1990)

A system of nonlinear equations has been used as a test case by at least two authors. This system is purported to describe the equilibrium of the products of hydrocarbon combustion. The given system does not describe the stated physical problem, a fact which invalidates it as a test of solution methods for chemical equilibrium systems. In this note, the problem is correctly stated and then solved by the method of element variables.
An electron beam test system linked with a CAD database
Authors: F. Komatsu, M. Miyoshi, T. Sano, K. Okumura
Venue: Microelectronic Engineering (1988)

In this paper, the advantages of shorter setup time and ease of operation achieved by linking a CAD system to an electron beam test system are presented. More specifically, by referring to mask pattern data in a CAD database, automatic positioning can be achieved within an accuracy of 0.25 @mm to match any designated target position specified on the terminal screen. In addition, automatic generation of a circuit test vector can be realized with a significant decrease in the required setup time.
Treating failure as state
Authors: L. Wong, B. C. Ooi
Venue: ACM SIGPLAN Notices (1990)

Typical failure handling schemes for statement based (or imperative) languages are not very satisfactory. A bold simple alternative is suggested in this report. The new scheme allows failure to be treated at more appropriate time and place.
A Cache-Based Natural Language Model for Speech Recognition
Authors: R. Kuhn, R. De Mori
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Speech-recognition systems must often decide between competing ways of breaking up the acoustic input into strings of words. Since the possible strings may be acoustically similar, a language model is required; given a word string, the model returns its linguistic probability. Several Markov language models are discussed. A novel kind of language model which reflects short-term patterns of word use by means of a cache component (analogous to cache memory in hardware terminology) is presented. The model also contains a 3g-gram component of the traditional type. The combined model and a pure 3g-gram model were tested on samples drawn from the Lancaster-Oslo/Bergen (LOB) corpus of English text. The relative performance of the two models is examined, and suggestions for the future improvements are made.
The editorial role in developing an online user interface
Authors: Deborah Dameron
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1990)

As the quality of online systems escalates as a marketing issue, the Editor becomes proportionately more important to the development of a usable and consistent user interface. Editors are vital to the development of a quality user interface for any online system, be it a software product, its accompanying help, or more extensive online documentation. Editors negotiate for quality, lending an experienced eye for detail to each stage of product development, working as part of the Development Team to build a consistent product that meets user needs.
LEW: Learning by Watching
Authors: P. Constant, S. Matwin, F. Oppacher
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

LEW (learning by watching), a machine learning system, is described. It was designed for knowledge acquisition in cooperation with an expert. LEW learns from examples of problem-solution (or question-answer) pairs by generalizing on differences in those pairs. In this sense, it belongs to the family of inductive learning methods. It provides for using background knowledge through the environment component of problem-solution pairs, thereby making constructive learning possible. The user can control the extent of the generalizations performed by LEW. The learning method is incremental and, to some extent, noise-resistant. The authors give an informal overview of the knowledge representation and the basic learning algorithm of LEW and indicate that the system's design meets the stated criteria and enables it to give helpful assistance, even in situations characterized by noisy or conflicting information and by lack of extensive background knowledge. The theory behind LEW is presented, along with rigorous definitions of its fundamental concepts and a general description of its learning algorithm. LEW's functioning with some larger examples, one from the QUIZ Advisor domain and another from the domain of block-world planning, is illustrated. The authors compare LEW with several other knowledge acquisition tools and introduce a precise characterization of learning from near misses and a near-miss metric. Possible extensions and enhancements to the system are noted.
Secure Query-Processing Strategies
Authors: T. F. Keefe, Bhavani Thuraisingham, W. T. Tsai
Venue: Computer (1989)

Strategies for secure query processing multilevel-security database management systems are proposed. They are carried out by query modification, a technique that has been used for enforcing integrity constraints and providing view mechanisms. The technique consists of replacing the query the user presents with one that, when evaluated, will perform the desired function. In the case of a view mechanism, the names of views referenced in the query are replaced by the definitions of the views in terms of base relations. The basic strategy and two variants-adding environmental information and using graphs-are described. The performance of the strategies is examined.
An aperiodic storage scheme to reduce memory conflicts in vector processors
Authors: S. Weiss
Venue: ACM SIGARCH Computer Architecture News (1989)

One of the most noticeable differences between the CRAY-2 and its predecessors, the CRAY-1 and the CRAY X-MP, is a significantly longer memory path. This is a consequence of increasing the size of the memory at the expense of the bank access time. With a longer memory path, the impact of bank conflicts becomes more apparent. In this paper we study a storage strategy for vector processors that has the following properties: (1) it is aperiodic, (2) it tends to distribute references more uniformly over the memory banks, (3) the implementation of the addressing hardware is straightforward, and (4) the delay added to the memory path is minimal. The first two properties help in reducing the frequency of bank conflicts.
Concept based retrieval in classical IR systems
Authors: H. P. Giger
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

This paper describes some aspects of a project with the aim of developing a user-friendly interface to a classical Information Retrieval (IR) System in order to improve the effectiveness of retrieval. The character by character approach to IR has been abandoned in favor of an approach based on the meaning of both the queries and the texts containing the information to be sought. The concept space, locally derived from a thesaurus, is used to represent a query as well as documents retrieved in atomic concept units. Dependencies between the search terms are taken into account. The meanings of the query and the retrieved documents (results of Elementary Logical Conjuncts (ELCs)) are compared. The ranking method on the semantical level is used in connection with existing data of a classical IR system. The user enters queries without using complex Boolean expressions.
Resource Sharing Interconnection Networks in Multiprocessors
Authors: J.-Y. Juang, B. W. Wah
Venue: IEEE Transactions on Computers (1989)

Circuit-switched interconnection networks for resource sharing in multiprocessors are studied. Resource scheduling in systems with such an interconnection network entails the efficient search for a mapping from requesting processors to free resources such that circuit blockages in the network are minimized and resources are maximally used. The optimal mapping is obtained by transforming the scheduling problems into various network flow problems to which existing algorithms can be applied. A distributed architecture to realize a maximum flow algorithm using token propagations is described. The method is applicable to any general loop-free network configuration in which the requesting processors and free resources can be partitioned into two disjoint subsets.
The design and implementation of an extendible deductive database system
Authors: J. Kierman, C. Maindreville, E. Simon
Venue: ACM SIGMOD Record (1989)

This paper presents the design and implementation of a deductive database system. RDL1, is the production rule language for this system. This language is an extension of logic based languages towards the support of updates and complex domains. Different features of this language are described with its applications. The general architecture of the system is presented highlighting integration with a relational database system. Then, three original features of the system are discussed: extensibility through the definition of end user data types, query optimization techniques, and the extensibility of the control strategy. Future improvements and extensions conclude the paper.
Accurate color reproduction for computer graphics applications
Authors: Bruce J. Lindbloom
Venue: ACM SIGGRAPH Computer Graphics (1989)

A method is presented for accurate color reproduction among a wide variety of display devices. The method is very general, in that it may be applied to virtually any color display device. Its generality has been demonstrated by application to color monitors, film recorders, electronic pre-press systems and color hardcopy devices. The algorithm has been used to accurately translate between device dependent and device independent color specifications and to translate from one device dependent color specification to another.The method separates the color reproduction process into two distinct components: device characterization, which accounts for the colorimetric properties of each class of display device, and device calibration, which accounts for local variations from one instance of a device to another.A companded RGB color space is introduced, which is used with trivariate parametric polynomial volumes (i.e. hyperpatches) to perform accurate color transformations.A color separation algorithm is presented which converts companded RGB to and from the subtractive printing colors (cyan, magenta, yellow, black) using gray component replacement.
Load balancing loosely synchronous problems with a neural network
Authors: G. C. Fox, W. Furmanski
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

Hopfield and Tank have introduced the use of neural networks for the solution of optimization problems such as the traveling salesman problem. Here we show how to generalize this method to decompose loosely synchronous problems onto parallel machines and in particular the hypercube. In this case, decomposition or load balancing can be formulated graph theoretically in terms of optimal partitioning of the computational graph into N = 2d subgraphs. The algorithm has a suggestive spin system interpretation, with the ferromagnetic interaction minimizing the communication and the long range paramagnetic force balancing the load. The optimal fixed point of the network is in the Higgs phase of the magnet, with the domains of constant spontaneous magnetization representing the optimal decomposition map. The method is fast, reliable and admits various simple implementations: sequential, concurrent on the hypercube, analog on the neural network with adaptive weights (&ldquo;learning&rdquo;). We analyze the sequential performance of various mean field based network algorithms and we compare the network approach with the statistical Monte Carlo technique of simulated annealing.
Reducing unpredictability in Ada executions
Authors: F. Mazzanti
Venue: ACM SIGAda Ada Letters (1989)

One of the most drastic examples of uncertainty of a program execution is surely that of an unrecoverable run-time error causing the failure of the whole program.This kind of failure is possible also in the case of Ada, and is allowed by the occurrence of a particular class of run-time errors for which there is no requirement on Ada compilers or interpreters to provide either a static or run-time detection. When one of these undetected errors occurs the program execution is said to become "erroneous" (i.e. no more governed by Ada rules) and and its effect is considered "unpredictable". An unrecoverable failure of the whole program (e.g. caused by a memory protection violation, or by a run-time system internal error) is just one of the possible symptoms of the program erroneousness.A study on the possible ways to cope with this kind of errors has been carried out inside the activity of the EEC MAP project n. 755 "SFD-APSE". In particular, the attention has been concentrated on the possibility of detecting at run time the occurrence of erroneous executions and on the possibility of recovering from them in a safe way.In this paper the project results are shortly summarized and the possible directions for further activity are pointed out.
Amdahl Multiple-Domain Architecture
Authors: Robert W. Doran
Venue: Computer (1988)

A description is given of extensions to the architecture of Amdahl's first mainframe computers, which were hard-wired implementations of the IBM System/370 architecture, and the why's and how's of their development are examined. The latest architecture helps maintain compatibility with a changing standard. Its multiple-domain facility allows multiple operating systems to share one mainframe system.
Dynamic Fault Reconfiguration in a Mesh-Connected MIMD Environment
Authors: M. U:9AK. Uyar, A. P. Reeves
Venue: IEEE Transactions on Computers (1988)

The near-neighbor problem is characterized by many iterations of a parallel matrix operation in which each matrix element is recomputed as a function of itself and its immediately adjacent near neighbors. Several highly parallel computer systems have been designed with the near-neighbor class of problems as the target application. As the number of processors in evolving parallel computer systems increases, the capability of fault tolerance to processor failures becomes more important. The authors show how fault tolerance can be efficiently achieved on an MIMD (multiple-instruction, multiple-data-stream) computer system for the near-neighbor problem by task redistribution. The techniques discussed minimize the extra data transfers and/or the extra computation in the system with faulty processors and links.
Uniform self-stabilizing rings
Authors: J. E. Burns, Jan K. Pachl
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1989)

A self-stabilizing system has the property that, no matter how it is perturbed, it eventually returns to a legitimate configuration. Dijkstra originally introduced the self-stabilization problem and gave several solutions for a ring of processors in his 1974 Communications of the ACM paper. His solutions use a distinguished processor in the ring, which effectively acts as a controlling element to drive the system toward stability. Dijkstra has observed that a distinguished processor is essential if the number of processors in the ring is composite. We show, by presenting a protocol and proving its correctness, that there is a self-stabilizing system with no distinguished processor if the size of the ring is prime. The basic protocol uses &THgr; (n2) states in each processor when n is the size of the ring. We modify the basic protocol to obtain one that uses &THgr; (n2/ln n) states.