ppxscal/embedding_network huggingface dataset:
Linear Algebra Approach to Neural Associative Memories and Noise performance of Neural Classifiers
Authors: Vladimir Cherkassky, Karen Fassett, Nikolaos Vassilas
Venue: IEEE Transactions on Computers (1991)

The authors present an analytic evaluation of saturation and noise performance for a large class of associative memories based on matrix operations. The importance of using standard linear algebra techniques for evaluating noise performance of associative memories is emphasized. The authors present a detailed comparative analysis of the correlation matrix memory and the generalized inverse memory construction rules for auto-associative memory and neural classifiers. Analytic results for the noise performance of neural classifiers that can store several prototypes in one class are presented. The analysis indicates that for neural classifiers the simple correlation matrix memory provides better noise performance than the more complex generalized inverse memory.
Performance Analysis of Real-Time Software Supporting Fault-Tolerant Operation
Authors: Krishna Kant
Venue: IEEE Transactions on Computers (1990)

Analyzing the performance of real-time control systems featuring mechanisms for online recovery from software faults is discussed. The application is assumed to consist of a number of interacting cyclic processes. The underlying hardware is assumed to be a multiprocessor, possibly with a separate control processor. The software structure is assumed to use design diversity along with forward and/or backward recovery. A detailed but efficiently solvable model for predicting various performance and reliability characteristics is developed. One of the key ideas used in modeling is hierarchical decomposition, which enables computation of level-oriented performance parameters in an efficient manner. The model is general, and adaptable for a number of useful special cases.
Computing and verifying depth orders
Authors: Mark de Berg, Mark Overmars, Otfried Schwarzkopf
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

A depth order on a set of objects is an order such that object a comes before object a&prime; in the order when a&prime; lies behind a&prime;, or, in other words, when a is (partially) hidden by a&prime; by a&prime;. We present efficient algorithms for the computation and verification of depth orders of sets of n rods in 3&ndash;space. Our algorithms run in time O(n4/3+&egr;), for any fixed &egr; > 0). If all rods are axis-parallel, or, more generally, have only a constant number of different orientations, then the sorting algorithm runs in O(n log2 n) time. The algorithms can be generalized to handle triangles and other polygons instead of rods. They are based on a general framework for computing and verifying linear extensions of implicitly defined binary relations.
On solutions of linear ordinary differential equations in their coefficient field
Authors: Manuel Bronstein
Venue: Journal of Symbolic Computation (1992)

We describe a rational algorithm for finding the denominator of any solution of a linear ordinary differential equation in its coefficient field. As a consequence, there is now a rational algorithm for finding all such solutions when the coefficients can be built up from the rational functions by finitely many algebraic and primitive adjunctions. This also eliminates one of the computational bottlenecks in algorithms that either factor or search for Liouvillian solutions of such equations with Liouvillian coefficients.
Extending the Notion of a Window System to Audio
Authors: Lester F. Ludwig, Michael Cohen, Natalio Pincever
Venue: Computer (1990)

With audio's increasing importance in computer applications, users will soon need presentation, management and organizational capabilities similar to visual window systems to avoid a confusing cacophony of multiple audio sources sounding at once. The ways in which an audio window system could be used are described. These include multimedia documents, spatial data management systems, and teleconferencing. The signal processing methods used to create hierarchical and spatial distribution among nearly arbitrary (not pure sine wave) audio sources are discussed. A prototype system, combining hierarchical and spatial processing functions with a computer-controlled switch, software and human input devices, is presented. Two envisioned implementations, a terminal-based system and a network-based server, are described. Preliminary work suggests that an effective audio window system needs much less complexity and fewer levels of digital signal processing precision than the current prototype.
Optimal sample cost residues for differential database batch query problems
Authors: Dan E. Willard
Venue: Journal of the ACM (JACM) (1991)

In many computing applications, there are several equivalent algorithms capable of performing a particular task, and no one is the most efficient under all statistical distributions of the data. In such contexts, a good heuristic is to take a sample of the database and use it to guess which procedure is likely to be the most efficient. This paper defines the very general notion of a differentiable query problem and shows that the ideal sample size for guessing the optimal choice of algorithm is O(N2/3) for all differential problems involving approximately N executing steps.
Bottleneck Steiner Trees in the Plane
Authors: M. Sarrafzadeh, C. K. Wong
Venue: IEEE Transactions on Computers (1992)

A Steiner tree with maximum-weight edge minimized is called a bottleneck Steiner tree (BST). The authors propose a Theta ( mod rho mod log mod rho mod ) time algorithm for constructing a BST on a point set rho , with points labeled as Steiner or demand; a lower bound, in the linear decision tree model, is also established. It is shown that if it is desired to minimize further the number of used Steiner points, then the problem becomes NP-complete. It is shown that when locations of Steiner points are not fixed the problem remains NP-complete; however, if the topology of the final tree is given, then the problem can be solved in Theta ( mod rho mod log mod rho mod ) time. The BST problem can be used, for example, in VLSI layout, communication network design, and (facility) location problems.
Signal representation, attribute extraction and, the use of distinctive features for phonetic classification
Authors: Helen M. Meng, Victor W. Zue, Hong C. Leung
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

The study reported in this paper addresses three issues related to phonetic classification: 1) whether it is important to choose an appropriate signal representation, 2) whether there are any advantages in extracting acoustic attributes over directly using the spectral information, and 3) whether it is advantageous to introduce an intermediate set of linguistic units, i.e. distinctive features. To restrict the scope of our study, we focused on 16 vowels in American English, and investigated classification performance using an artificial neural network with nearly 22,000 vowels tokens from 550 speakers excised from the TIMIT corpus. Our results indicate that 1) the combined outputs of Seneff's auditory model outperforms five other representations with both undegraded and noisy speech, 2) acoustic attributes give similar performance to raw spectral information, but at potentially considerable computational savings, and 3) the distinctive feature representation gives similar performance to direct vowel classification, but potentially offers a more flexible mechanism for describing context dependency.
Design automation research at The University of Wisconsin&mdash;Madison
Authors: J. Beetem, D. Dietmeyer, Y. Hu, R. Jain, C. Kime, P. Ramanathan, K. Saluja
Venue: ACM SIGDA Newsletter (1991)

The University of Wisconsin - Madison has a large design automation research program with activities in many DA and CAD areas. The primary thrusts are in Testing, High- and Low-Level Synthesis, AI-based CAD, Rapid Implementation of CAD tools, Design Methodologies, and CAD System Issues. This document describes recent and current DA projects. The reader is encouraged to contact the investigators for more information about specific projects.
Building monitors with UNIX and C
Authors: Neil Dunstan
Venue: ACM SIGCSE Bulletin (1991)

An outline is given for structuring concurrent programs written in C under UNIX System V using the concept of monitors. It is shown how a monitor can be implemented in UNIX System V using the semaphore and shared memory facilities. Monitors are a common topic in the studies of concurrent programming and operating systems.
A laboratory for building computers
Authors: Richard J. Reid
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

A workstation laboratory allows undergraduate students to build complete, functioning computers--in simulation. The simulation extends down to the gate and signal levels, with effective modeling of delays and transitions, so reasonable assurance of the validity of the designs can be obtained. The computers constructed in this laboratory are complete with peripheral equipment including tapes and disks, and the students furnish a rudimentary operating system. The student operating-systems receive executable binary objects on the tapes, transfer them to the disk, and initiate their execution. The executable objects and the operating system are produced by a standard C compiler. Students must limit their C-language source code and data types used so the compile binaries will be executable on the 16-bit wide, Motorola 680X0-like computer they construct. The computers are constructed in an hierarchical manner from the gates and medium-scale components available in the digital simulator used in this laboratory.
Subtyping and assignment in database programming languages
Authors: Richard Connor, David McNally, Ronald Morrison
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

Our focus of interest is in the integration of programming languages and database management systems. In particular, the integration of type systems and data models is considered. One tension in this integration occurs when a type system with subtype inheritance is combined with a data model which contains mutable values. A description of some well-known problems in such systems is given. This is followed by a classification of possible trade-offs between the safety of static checking, normally required by type systems, and the flexibility of dynamic checking, normally found in data models. At each stage in the classification decreasing static safety is traded for an increasing class of correct programs which may be written. The purpose of this classification is to allow a DBPL designer to understand the implications of any particular type system with both subtyping and mutable values.
Challenges in obtaining peak parallel performance with a convex C240, a parallel vector processor
Authors: Patrick McGehearty
Venue: ACM SIGMETRICS Performance Evaluation Review (1990)

The behavior of the Linpack 300x300 benchmark is examined in the context of a parallel vector machine architecture. Detailed evaluation is performed with respect to the Convex C240. Issues relating to algorithm design and system characteristics are discussed in the context of the Linpack implementation.
OPIUM: a debugging environment for Prolog development and debugging research
Authors: Mireille Ducassé, Anna-Maria Emde
Venue: ACM SIGSOFT Software Engineering Notes (1991)

Opium is an extensible debugging environment for PROLOG providing high-level debugging facilities for programmers and debugging experts.
The characterization of two scientific workloads using the CRAY X-MP performance monitor
Authors: Elizabeth Williams, C. Thomas Myers, Rebecca Koskela
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

The weekend production period on a CRAY X-MP was monitored for several months at each of two supercomputing sites. The hardware performance monitor available on the X-MP was used to collect the data at each site. Various metrics are computed using the measured data. These metrics include rates, such as mops and Mflops, percent vectorization, average vector lengths, memory reference rates, memory contention, the operation mix, I/O rates, hardware metrics such as operations per clock period, and percentage of time waiting to issue an instruction that is waiting on some hardware component. These metrics are used in evaluating the performance of the workloads and the X-MP architecture. These metrics may also give insight into the design of similar register based architectures and may be useful in parameterizing models in future work.
Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2/sup m/)
Authors: M. Anwarul Hasan, Vijay K. Bhargava
Venue: IEEE Transactions on Computers (1992)

A systolic structure for bit-serial division over the field GF(2/sup m/) is developed. Consideration is given to avoid global data communications and dependency of the time step duration on m. This is important for applications where the value of m is large. The divider requires only three basic processors and one simple control signal and its circuit and time complexities are proportional to m/sup 2/ and m, respectively. It does not depend on the irreducible polynomial and can be expanded easily. Moreover, with m additional simple processors, a bit-serial systolic multiplier is developed which uses part of the divider structure. This is advantageous from the implementation point of view, as both the divider and multiplier can be fabricated on a single chip, resulting in a reduction of area.
A proposal for incremental dialogue evaluation
Authors: Madeleine Bates, Damaris Ayuso
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

The SLS community has made progress recently toward evaluating SLS systems that deal with dialogue, but there is still considerable work that needs to be done in this area. Our goal is to develop incremental ways to evaluate dialogue processing, not just going from Class D1 (dialogue pairs) to Class D2 (dialogue triples), but measuring aspects of dialogue processing other than length. We present two suggestions; one for extending the common evaluation procedures for dialogues, and one for modifying the scoring metric.
A proposal for lexical disambiguation
Authors: George A. Miller, Daniel A. Teibel
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

A method of sense resolution is proposed that is based on WordNet, an on-line lexical database that incorporates semantic relations (synonymy, antonymy, hyponymy, meronymy, causal and troponymic entailment) as labeled pointers between word senses. With WordNet, it is easy to retrieve sets of semantically related words, a facility that will be used for sense resolution during text processing, as follows. When a word with multiple senses is encountered, one of two procedures will be followed. Either, (1) words related in meaning to the alternative senses of the polysemous word will be retrieved; new strings will be derived by substituting these related words into the context of the polysemous word; a large textual corpus will then be searched for these derived strings; and that sense will be chosen that corresponds to the derived string that is found most often in the corpus. Or, (2) the context of the polysemous word will be used as a key to search a large corpus; all words found to occur in that context will be noted; WordNet will then be used to estimate the semantic distance from those words to the alternative senses of the polysemous word; and that sense will be chosen that is closest in meaning to other words occurring in the same context. If successful, this procedure could have practical applications to problems of information retrieval, mechanical translation, intelligent tutoring systems, and elsewhere.
Research in MIS&mdash;points of work and reference: a replication and extension of the Culnan and Swanson study
Authors: Myun J. Cheon, Choong, C. Lee, Varun Grover
Venue: ACM SIGMIS Database (1992)

This study replicates and extends Culnan and Swanson's study (1986) of bibliographic citations in MIS and its foundational fields in order to assess the emergence of MIS as a distinct discipline. Academic researchers, particularly those endeavoring to make advances in knowledge which build upon prior research, benefit by being able to recognize cumulative research traditions. Progress toward building and MIS identity and cumulative research tradition is measured through statistical analyses of reference patterns during the past decade in ten selected journals. Four hypotheses are tested which reveal that although MIS is still less established than its referent disciplines, maturation has occurred through systematic knowledge development and the existence of a cumulative body of research.
Algorithm 691: Improving QUADPACK automatic integration routines
Authors: Paola Favati, Grazia Lotti, Francesco Romani
Venue: ACM Transactions on Mathematical Software (TOMS) (1991)

Two automatic adaptive integrators from QUADPACK (namely, QAG, and QAGS) are modified by substituting the Gauss-Kronrod rules used for local quadrature with recursive monotone stable (RMS) formulas. Extensive numerical tests, both for one-dimensional and two-dimensional integrals, show that the resulting programs are faster, perform less functional evaluations, and are more suitable
Reliance on correlation data for complexity metric use and validation
Authors: Stephen MacDonell
Venue: ACM SIGPLAN Notices (1991)

This paper reports the results of an experiment to illustrate the hazards of using correlation data as the sole determinant for software metric use and validation. Three widely cited complexity metrics have been examined in relation to the frequency of software development errors.
Report on the ChI'90 workshop on computer-human interaction in aerospace systems
Authors: Sharon Irving, Christine M. Mitchell
Venue: ACM SIGCHI Bulletin (1991)

The purpose of the CHI'90 workshop was to explore issues facing designers and users of decision support systems in real-time, high-risk aerospace systems, such as aviation, satellite control and shuttle support. The workshop focused on the following issues: bull; how do we model the user/operator in complex time-critical environments bull; how do we design the human-computer interaction (displays, controls, and aids to ensure that the user is integrated into the decision process bull; what comprises an intelligent computer interface for a supervisory controller bull; how do we provide timely context-sensitive information in real time without overloading or distracting the human operator bull; how do we design operator aids/tutors using knowledge-based technology that enhance the human-computer interaction and overall system effectiveness rather than replacing the human decision maker.
Performance Analysis of a Message-Oriented Knowledge-Base
Authors: Wang-Chan Wong, Tatsuya Suda, Lubomir Bic
Venue: IEEE Transactions on Computers (1990)

A message-driven model for function-free Horn logic is presented, where the knowledge base is represented as a network of logical processing elements communicating with one another exclusively through messages. The lack of centralized control and centralized memory makes this model suitable for implementation on highly parallel asynchronous computer architecture. The performance of this message-driven system is analyzed and compared to that of a sequential resolution scheme using backtracking. Closed-form expressions for both approaches are derived.
CONS should not CONS its arguments, or, a lazy alloc is a smart alloc
Authors: Henry G. Baker
Venue: ACM SIGPLAN Notices (1992)

Lazy allocation is a model for allocating objects on the execution stack of a high-level language which does not create dangling references. Our model provides safe transportation into the heap for objects that may survive the deallocation of the surrounding stack frame. Space for objects that do not survive the deallocation of the surrounding stack frame is reclaimed without additional effort when the stack is popped. Lazy allocation thus performs a first-level garbage collection, and if the language supports garbage collection of the heap, then our model can reduce the amortized cost of allocation in such a heap by filtering out the short-lived objects that can be more efficiently managed in LIFO order. A run-time mechanism called result expectation further filters out unneeded results from functions called only for their effects. In a shared-memory multi-processor environment, this filtering reduces contention for the allocation and management of global memory.Our model performs simple local operations, and is therefore suitable for an interpreter or a hardware implementation. Its overheads for functional data are associated only with assignments, making lazy allocation attractive for mostly functional programming styles. Many existing stack allocation optimizations can be seen as instances of this generic model, in which some portion of these local operations have been optimized away through static analysis techniques.Important applications of our model include the efficient allocation of temporary data structures that are passed as arguments to anonymous procedures which may or may not use these data structures in a stack-like fashion. The most important of these objects are functional arguments (funargs), which require some run-time allocation to preserve the local environment. Since a funarg is sometimes returned as a first-class value, its lifetime can survive the stack frame in which it was created. Arguments which are evaluated in a lazy fashion (Scheme delays or "suspensions") are similarly handled. Variable-length argument "lists" themselves can be allocated in this fashion, allowing these objects to become "first-class". Finally, lazy allocation correctly handles the allocation of a Scheme control stack, allowing Scheme continuations to become first-class values.
Optimization Using Neural Networks
Authors: Gene A. Tagliarini, J. Fury Christ, Edward W. Page
Venue: IEEE Transactions on Computers (1991)

The design of feedback (or recurrent) neural networks to produce good solutions to complex optimization problems is discussed. The theoretical basis for applying neural networks to optimization problems is reviewed, and a design rule that serves as a primitive for constructing a wide class of constraints is introduced. The use of the design rule is illustrated by developing a neural network for producing high-quality solutions to a probabilistic resource allocation task. The resulting neural network has been simulated on a high-performance parallel processor that has been optimized for neural network simulation.
Algorithm 689: Discretized collocation and iterated collocation for nonlinear Volterra integral equations of the second kind
Authors: J. G. Blom, H. Brunner
Venue: ACM Transactions on Mathematical Software (TOMS) (1991)

This paper describes a FORTRAN code for calculating approximate solutions to systems of nonlinear Volterra integral equations of the second kind. The algorithm is based on polynomial spline collocation, with the possibility of combination with the corresponding iterated collocation. It exploits certain local superconvergence properties for the error estimation and the stepsize strategy.