ppxscal/embedding_network huggingface dataset:
A database design for graphical models
Authors: Susi Dulli, Vitaliano Milanese
Venue: ACM SIGPLAN Notices (1990)

In this paper we present an engineering data management system, that is a database which is supposed to store and support the manipulation of data about solid geometry objects. Some technical aspects are particularly addressed, which are related to the modeling environment, system architecture and data manipulation language.
Usage parameter control and bandwidth allocation methods for ATM-based B-ISDN
Authors: Naoaki Yamanaka, Youichi Sato, Ken-ichi Sato
Venue: ACM SIGCOMM Computer Communication Review (1992)

This paper proposes a ATM traffic management scheme that utilizes a deterministic source traffic descriptor, a deterministic Usage Parameter Control (UPC) algorithm and a conservative statistical bandwidth allocation method. The scheme not only guarantees the QOS of all connections but also allows for large statistical multiplexing gain. The proposed method, therefore, creates an effective B-ISDN that offers cost-effective broadband variable bit-rate services.
The volume common to two congruent circular cylinders
Authors: W. A. Beyer, L. R. Fawcett, L. P. Hartem, B. K. Swartz
Venue: Journal of Symbolic Computation (1992)

This paper derives two formulae for the volume of the set of points common to the interiors of two congruent circular cylinders in general position. One formula involves incomplete elliptic integrals and the other formula involves complete elliptic integrals. A series is derived for the complete elliptic function formula. Some of the work was done on the symbol manipulator MACSYMA.
Memory, control and communications synthesis for scheduled algorithms
Authors: Douglas M. Grant, Peter B. Denyer
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper explores a method of grouping individual memory requirements from a hardware-constrained schedule of an algorithm, such that control and communications may be optimised. A new representation of memory requirements is introduced to explain the method. The technique may also be used to allocate operations to hardware resources. This, and control and communication optimisation are illustrated with an example.
Computer algebra in spacetime embedding
Authors: Waldir L. Roque, Renato P. Dos Santos
Venue: Journal of Symbolic Computation (1991)

In this paper we describe an algorithm to determine the vectors normal to a space-time V"4 embedded in a pseudo-Euclidean manifold M"4"+"n. An application of this algorithm is given considering the Schwarzchild spacetime geometry embedded in a G dimensional pseudo-Euclidean manifold, using the algebraic computing system REDUCE.
Difficulties in fitting scientific data
Authors: Charles B. Dunham
Venue: ACM SIGNUM Newsletter (1990)

The major potential difficulties in obtaining parameters of a model from scientific observations are discussed in the context of the theory of best approximation.
The turn model for adaptive routing
Authors: Christopher J. Glass, Lionel M. Ni
Venue: ACM SIGARCH Computer Architecture News (1992)

We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimal or nonminimal, and maximally adaptive. A unique feature of this model is that it is not based on adding physical or virtual channels to network topologies (though it can be applied to networks with extra channels). Instead, the model is based on analyzing the directions in which packets can turn in a network and the cycles that the turns can form. Prohibiting just enough turns to break all of the cycles produces routing algorithms that are deadlock free, livelock free, minimal or nonminimal, and maximally adaptive for the network. In this paper, we focus on the two most common network topologies for wormhole routing, n-dimensional mesh, just a quarter of the turns must be prohibited to prevent deadlock. The remaining three quarters of the turns permit partial adaptiveness in routing. Partially adaptive routing algorithms are described for 2D meshes, n-dimensional meshes, k-ary n-cubes, and hypercubes. Simulations of partially adaptive and nonadaptive routing algorithms for 2D meshes and hypercubes show that which algorithm has the lowest latencies and highest sustainable throughput depends on the pattern of message traffic. For nonuniform traffic, partially adaptive routing algorithms perform better than non-adaptive ones.
Commitment-Based Software Development
Authors: William Mark, Sherman Tyler, James McGuire, Jon Schlossberg
Venue: IEEE Transactions on Software Engineering (1992)

During the development of a system, software modules can be viewed in terms of their commitments: the constraints imposed by their own structure and behavior, and by their relationships with other modules (in terms of resource consumption, data requirements. etc.). The Comet system uses explicit representation and reasoning with commitments to aid the software design and development process-in particular, to lead software developers to make decisions that result in reuse. Developers can examine the commitments that must be met in order to include an existing module, and can explore how commitments change when modules are modified. Comet has been applied to the domain of sensor-based tracker software.
Extraction of redundancy-free programs from constructive natural deduction proofs
Authors: Yukihide Takayama
Venue: Journal of Symbolic Computation (1991)

Executable codes can be extracted from constructive proofs by using realizability interpretation. However, realizability also generates redundant codes that have no significant computational meaning. This redundancy causes heavy runtime overheads and is one of the obstacles in applying realizability to practical systems that realize the mathematical programming paradigm. This paper presents a method to eliminate redundancy by analysing proof trees as preprocessing of realizability interpretation. According to the declaration given to the theorem that is proved, each node of the proof tree is marked automatically to show which part of the realizer is needed. This procedure does not always work well. This paper also gives an analysis of the procedure and techniques to resolve critical cases. The method is studied in simple constructive logic with primitive types, mathematical induction and its q-realizability interpretation. As an example, the extraction of a prime number checker program is given.
Anaphora resolution in slot grammar
Authors: Shalom Lappin, Michael McCord
Venue: Computational Linguistics (1990)

We present three algorithms for resolving anaphora in Slot Grammar: (1) an algorithm for interpreting elliptical VPs in antecedent-contained deletion structures, subdeletion constructions, and intersentential cases; (2) a syntactic filter on pronominal coreference; and (3) an algorithm for identifying the binder of an anaphor (reflexive pronoun or the reciprocal phrase "each other"). These algorithms operate on the output of a Slot Grammar parser, and, like the parser, they run in Prolog. The VP anaphora algorithm implements an S-structure analysis of VP ellipsis that we argue provides a more unified and empirically motivated treatment of VP anaphora resolution than analyses that attempt to interpret elliptical VPs at a level of logical form. Each algorithm can operate independently of the others, and we have incorporated each into an integrated anaphora resolution component. The interpreted elliptical VP structures that the VP anaphora algorithm produces provide the input to the two NP anaphora resolution procedures. The integrated anaphora resolution component provides a powerful syntactically driven module for generating partially interpreted representations that can serve as input to semantic and discourse interpretation systems.
Faster uniquely represented dictionaries
Authors: Arne Anderson, Thomas Ottmann
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

The authors present a solution to the dictionary problem where each subset of size n of an ordered universe is represented by a unique structure, containing a (unique) binary search tree. The structure permits the execution of search, insert, and delete operations in O(n/sup 1/3/) time in the worst case. They also give a general lower bound, stating that for any unique representation of a set in a graph of, bounded outdegree, one of the operations search or update must require a cost of Omega (n/sup 1/3/) Therefore, the result sheds new light on previously claimed lower bounds for unique binary search tree representations.
A VLSI Modulo m Multiplier
Authors: Giuseppe Alia, Enrico Martinelli
Venue: IEEE Transactions on Computers (1991)

A novel method to compute the exact digits of the modulo m product of integers is proposed, and a modulo m multiply structure is defined. Such a structure can be implemented by means of a few fast VLSI binary multipliers, and a response time of about 150-200 ns to perform modular multiplications with moduli up to 32767 can be reached. A comparison to ROM-based structures is also provided. The modular multiplier has been evaluated asymptotically, according to the VLSI complexity theory, and it turned out to be an optimal design. This structure can be used to implement a residue multiplier in arithmetic structures using residue number systems (RNSs). The complexity of this residue multiplier has been evaluated and lower complexity figures than for ROM-based multiply structures have been obtained under several hypotheses on RNS parameters.
A dynamic hash method with signature
Authors: F. Cesarini, G. Soda
Venue: ACM Transactions on Database Systems (TODS) (1991)

We present a dynamic external hash method that allows retrieval of a record by only one access to mass storage while maintaining a high load factor. The hash function is based on generalized spiral storage. Both primary and overflow records are allocated to the same file, and file expansion depends on being able to allocate every overflow chain to one bucket. An in-core index, built by means of a signature function, discriminates between primary and overflow records and assures one access to storage in the case of either successful or unsuccessful searching. Simulation results confirm the good expected performance.
Communication complexity towards lower bounds on circuit depth
Authors: Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiří Sgall
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

M. Karchmer et al. (1991) considered the circuit depth complexity of n-bit Boolean function constructed by composing up to d=log n/log log n levels of k=log-n-bit Boolean functions. Any such function is in AC/sup 1/. They conjecture that circuit depth is additive under composition, which would imply that any (bounded fan-in) circuit for this problem requires dk in Omega (log/sup 2/ n/log log n) depth. This would separate AC/sup 1/ from NC/sup 1/. They recommend using the communication game characterization of circuit depth. They suggest an intermediate problem which they call the universal composition relation. An almost optimal lower bound of dk-O(d/sup 2/(k log k)/sup 1/2/) is given for this problem. In addition, a proof, directly in terms of communication complexity, that there is a function on k bits requiring Omega (k) circuit depth is presented.
The establishment and application of a metric for graphical design language (abstract)
Authors: John W. Olson, Herbert E. Longenecker,  Jr.
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

The concept of a graphical design language as a tool for implementing problem solving and algorithm design independent of any specific code language is extremely attractive with reference to initial instruction in algorithm design. The verification of the methodology requires an acceptable reliable metric to validate that the graphical design language approach does improve the ability of problem solvers. Current software engineering metrics have primarily concentrated on attempting to predict development overhead or to evaluate the final software product. Using an environment (DATA) (Doran Longenecker 1989) (Doran Longenecker 1990) which focuses on the crucial role of data in the algorithm design process, the goal remains the establishment of an instrument to test the algorithm design skills of problem solvers trained with DATA versus those trained using traditional methods (flow charting, pseudo-code, Nassi-Schneiderman charts, etc.). A stable metric applicable to graphical design languages in general is an obvious requirement. The approach to developing the metric involves application of the prototype instrument to groups of students through a series of courses aimed at bringing the students through problem solving and algorithm design to programmed implementation of algorithms. The performance of the groups will provide the data for calibrating the metric validating its reliability. The metric is then to be used to measure the impact on performance of the DATA teaching environment. In the papers cited, the need for the DATA environment and the apparent impact have been demonstrated. The natural next phase calls for the development of the metric.
Formal Specification of a Look Manager
Authors: K. T. Narayana, Sanjeev Dharap
Venue: IEEE Transactions on Software Engineering (1990)

A formal specification of the look manager of a dialog system is presented. The look manager deals with the presentation of visual aspects of objects and the editing of those visual aspects. A formal model for specifying the look of objects based on the notion of texturing objects is presented. The texturing model is built from the observed real-life use of overlays of slides. The specification takes as a given hypothesis an invariant relation between the logical display of objects and their layout on the physical screen. The look on the screen is characterized as an invariant ideal show relation. The formalization achieves modularity for the look manager. The specifications are written using the Z notation. The experiment is an integral part of a larger effort in the formal design of a dialog system. It shows that the state-based specification methodology Z is very well suited for description of graphical interface software. Further, the formal specification yields insight into the inherent complexity of building graphical interfaces and their associated displays.
The role of computer software in numerical analysis teaching
Authors: John Carroll
Venue: ACM SIGNUM Newsletter (1992)

We consider some key issues in the use of computer software in Numerical Analysis teaching. By first examining the role of the computer in education, we consider how the teaching of numerical analysis is enhanced through the introduction of computer software. Practical issues such as programming language requirements and sources of numerical software are reviewed. We also consider the different ways in which textbooks and software have been combined to provide a single teaching tool. The potential for interaction between symbolic and numerical computation is also considered and one particular symbolic algebra package is briefly reviewed. Another mode of software usage within the teaching framework is that of interactive environments and, here, we concentrate on two well-known packages, MATLAB [50] and CLAM [34]. Finally we present the experiences of some Numerical Analysis teachers as they outline individual approaches to efficient use of software in their respective syllabi.
Resource binding&mdash;a universal approach to parallel programming
Authors: Honda Shing, Lionel M. Ni
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

The suitability of a parallel programming paradigm on a particular parallel architecture often greatly influences the overall system performance. This report presents the parallel programming paradigm, resource binding, which offers an architecture independent environment for various parallel computation models. The resource binding technique, with a simple set of primitives, enables a flexible and consistent way of handling process synchronization, shared resource management, and other problems in parallel programming. High portability can be maintained without losing performance. For a clear introduction to the technique, comparisons are made among resource binding and other well-defined schemes such as semaphore, monitor, message passing and Linda.
Computing minimal spanning subgraphs in linear time
Authors: Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Tarjan
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, find a minimal spanning subgraph of G with property P. We describe two related algorithms for this problem and prove their correctness under some rather weak assumptions about P. We devise a general technique for analyzing the worst-case behavior of these algorithms. By applying the technique to 2-edge-connectivity and biconnectivity, we obtain an &OHgr;(m + n log n) lower bound on the worst-case running time of the algorithms for these two properties, thus settling open questions posed earlier with regard to these properties. We then describe refinements of the basic algorithms that yield the first linear-time algorithms for finding a minimal 2-edge-connected spanning subgraph and a minimal biconnected spanning subgraph of a graph.
Algorithmic mapping of neural network Models onto Parallel SIMD Machines
Authors: Wei-Ming Lin, Viktor K. Prasanna, K. Wojtek Przytula
Venue: IEEE Transactions on Computers (1991)

Implementations of neural networks on programmable massively parallel computers are addressed. The methods are based on a graph theoretic approach and are applicable to a large class of networks in which the computations can be described by means of matrix and vector operations. A detailed characterization of the target machine is provided. Two mappings are presented. The first is designed for a processor array consisting of a very large number of small processing units. The neurons and the nonzero synaptic weights are assigned to the processors in a predetermined order, one per processor. The data transfers between processors containing neurons and weights are implemented using a novel routing algorithm. The second mapping is designed for the data array of size N*N and a smaller processor array of size P*P, P>>N, i.e., it addresses the partitioned case. These mappings are applicable to most of the mesh-connected single-instruction-multiple-data (SIMD) machines.
Using continuations to implement thread management and communication in operating systems
Authors: Richard P. Draves, Brian N. Bershad, Richard F. Rashid, Randall W. Dean
Venue: ACM SIGOPS Operating Systems Review (1991)

We have improved the performance of the Mach 3.0 operating system by redesigning its internal thread and interprocess communication facilities to use continuations as the basis for control transfer. Compared to previous versions of Mach 3.0, our new system consumes 85% less space per thread. Cross-address space remote procedure calls execute 14% faster. Exception handling runs over 60% faster.In addition to improving system performance, we have used continuations to generalize many control transfer optimizations that are common to operating systems, and have recast those optimizations in terms of a single implementation methodology. This paper describes our experiences with using continuations in the Mach operating system.
An analysis of vector space models based on computational geometry
Authors: Z. W. Wang, S. K. M. Wong, Y. Y. Yao
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

This paper analyzes the properties, structures and limitations of vector-based models for information retrieval from the computational geometry point of view. It is shown that both the pseudo-cosine and the standard vector space models can be viewed as special cases of a generalized linear model. More importantly, both the necessary and sufficient conditions have been identified, under which ranking functions such as the inner-product, cosine, pseudo-cosine, Dice, covariance and product-moment correlation measures can be used to rank the documents. The structure of the solution region for acceptable ranking is analyzed and an algorithm for finding all the solution vectors is suggested.
A Trellis-based algorithm for estimating the parameters of a hidden stochastic context-free grammar
Authors: Julian Kupiec
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

The paper presents a new algorithm for estimating the parameters of a hidden stochastic context-free grammar. In contrast to the Inside/Outside (I/O) algorithm it does not require the grammar to be expressed in Chomsky normal form, and thus can operate directly on more natural representations of a grammar. The algorithm uses a trellis-based structure as opposed to the binary branching tree structure used by the I/O algorithm. The form of the trellis is an extension of that used by the Forward/Backward algorithm, and as a result the algorithm reduces to the latter for components that can be modeled as finite-state networks. In the same way that a hidden Markov model (HMM) is a stochastic analogue of a finite-state network, the representation used by the new algorithm is a stochastic analogue of a recursive transition network, in which a state may be simple or itself contain an underlying structure.
Conflict Resolution as Discovery in Particle Physics
Authors: Sakir Kocabas
Venue: Machine Learning (1991)

In this paper we focus on the general problem of identifying and resolving conflicts such as inconsistency and incompleteness in scientific discovery. The underlying idea is that conflicts in empirical knowledge can lead to new discoveries, provided that they are clearly identified. Our observations are based on the behavior and the results of an incremental discovery program, BR-3. The system models the discoveries of a series of quantum laws by physicists in this century. BR-3's discoveries are directed by a small set of consistency and completeness constraints. We evaluate the system in terms of its knowledge representation, discovery operators, and their behavior, and we describe its relation to other work in scientific discovery.
Measuring the informativeness of a retrieval process
Authors: Jean Tague-Sutcliffe
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

Evaluation of information retrieval systems should be based on measures of the information provided by the retrieval process, &ldquo;informativeness&rdquo; measures which take into account the interactive and full-text nature of present-day systems and the different types of questions which are asked of them. Desirable properties for an informativeness measure are developed, including context sensitivity, user centrality, and logarithmic response. A hypergraph-based framework for measuring the informativeness of a retrieval process is presented and a measure developed which satisfies the desired properties. The measure is compared to previously developed information measures and illustrated via an application.