ppxscal/embedding_network huggingface dataset:
Magic counting methods
Authors: Domenico Sacca, Carlo Zaniolo
Venue: ACM SIGMOD Record (1987)

The problem considered is that of implementing recursive queries, expressed in a logic-based language, by efficient fixpoint computations. In particular, the situation is studied where the initial bindings in the recursive predicate can be used to restrict the search space and ensure safety of execution. Two key techniques previously proposed to solve this problem are (i) the highly efficient counting method, and (ii) the magic set method which is safe in a wider range of situations than (i). In this paper, we present a family of methods, called the magic counting methods, that combines the advantages of (i) and (ii). This is made possible by the similarity of the strategies used by the counting method and the magic set method for propagating the bindings. This paper introduces these new methods, examines their computational complexity, and illustrates the trade-offs between the family members and their superiority with respect to the old methods.
A microprogrammable architecture with quasi time-transparent structured control
Authors: M. S. Tudruj, R. F. Gajda
Venue: Proceedings of the 18th annual workshop on Microprogramming (1985)

The paper is concerned with efficient implementation of evolved modular and structured microprogramming. A microprogrammable architecture is presented that permits designing hierarchical complicated modular microprograms at two distinct levels: the global control and the data processing level. The architecture is based on two cooperating microprogram control units that separately store and perform control and executive microinstructions and microcode modules. The control organization of an implementing computer is presented which assures the quasi time-transparency of modular control in microprograms during the microprogram execution. This is achieved by parallel functioning of constituent control units, that permits preparing in advance addresses of executive modules referenced by control microinstructions. The efficient implementation of control statements of high level languages and microprogramming at the assembler language level for the proposed architecture are also discussed in the paper.
Type-checking Smalltalk
Authors: Ralph E. Johnson
Venue: ACM SIGPLAN Notices (1986)

Although most attempts to speed-up Smalltalk have focused on providing more efficient interpreters, code optimization is probably necessary for further increases in speed. A type-system for Smalltalk is a prerequisite for building an optimizing compiler. Unfortunately, none of the type-systems so far proposed for Smalltalk are adequate; they either cause nearly all Smalltalk programs to be type incorrect, allow run-time type errors, or do not provide enough information for optimization. This paper presents a type-system for Smalltalk that is suitable for code optimization.
Category structures
Authors: Gerald Gazda, Geoffrey K. Pullum, Robert Carpenter, Ewan Klein, Thomas E. Hukari, Robert D. Levine
Venue: Computational Linguistics (1988)

This paper outlines a simple and general notion of syntactic category on a metatheoretical level, independent of the notations and substantive claims of any particular grammatical framework. We define a class of formal objects called "category structures" where each such object provides a constructive definition for a space of syntactic categories. A unification operation and subsumption and identity relations are defined for arbitrary syntactic categories. In addition, a formal language for the statement of constraints on categories is provided. By combining a category structure with a set of constraints, we show that one can define the category systems of several well-known grammatical frameworks: phrase structure grammar, tagmemics, augmented phrase structure grammar, relational grammar, transformational grammar, generalized phrase structure grammar, systemic grammar, categorial grammar, and indexed grammar. The problem of checking a category for conformity to constraints is shown to be solvable in linear time. This work provides in effect a unitary class of data structures for the representation of syntactic categories in a range of diverse grammatical frameworks. Using such data structures should make it possible for various pseudo-issues in natural language processing research to be avoided. We conclude by examining the questions posed by set-valued features and sharing of values between distinct feature specifications, both of which fall outside the scope of the formal system developed in this paper.
Doubly Linked Ring Networks
Authors: D. Z. Du, D. F. Hsu, F. K. Hwang
Venue: IEEE Transactions on Computers (1985)

We consider networks of processors where each processor either has one in-link and one out-link, or two in-links and two out-links. We study three properties of such networks: 1) diameter, 2) connectivity, and 3) the ring property. We propose a class of networks which seem to achieve the optimum as far as these three properties are concerned.
Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs
Authors: Jack J. Dongarra, Jeremy Du Croz, Sven Hammarling, Richard J. Hanson
Venue: ACM Transactions on Mathematical Software (TOMS) (1988)

This paper describes a model implementation and test software for the Level 2 Basic Linear Algebra Subprograms (Level 2 BLAS). Level 2 BLAS are targeted at matrix-vector operations with the aim of providing more efficient, but portable, implementations of algorithms on high-performance computers. The model implementation provides a portable set of FORTRAN 77 Level 2 BLAS for machines where specialized implementations do not exist or are not required. The test software aims to verify that specialized implementations meet the specification of Level 2 BLAS and that implementations are correctly installed.
Reconfiguration Algorithms for Interconnection Networks
Authors: A. Y. Oruc, M. Yaman Oruc, Norman Balabanian
Venue: IEEE Transactions on Computers (1985)

The correspondence examines the functional relations within a class of multistage interconnection networks. It is known that these networks are not rearrangeable. This fact has led to some research on interconnection network relations. The correspondence deals with one aspect of this research, namely, that of constructing an equivalence map between two interconnection networks. Procedures are given to test whether two such networks are equivalent. Whenever they are, these procedures also produce a map to conjugate one network onto the other.
RUBRIC: A System for Rule-Based Information Retrieval
Authors: Brian P. McCune, Richard M. Tong, Jeffrey S. Dean, Daniel G. Shapiro
Venue: IEEE Transactions on Software Engineering (1985)

A research prototype software system for conceptual information retrieval has been developed. The goal of the system, called RUBRIC, is to provide more automated and relevant access to unformatted textual databases. The approach is to use production rules from artificial intelligence to define a hierarchy of retrieval subtopics, with fuzzy context expressions and specific word phrases at the bottom. RUBRIC allows the definition of detailed queries starting at a conceptual level, partial matching of a query and a document, selection of only the highest ranked documents for presentation to the user, and detailed explanation of how and why a particular document was selected. Initial experiments indicate that a RUBRIC rule set better matches human retrieval judgment than a standard Boolean keyword expression, given equal amounts of effort in defining each. The techniques presented may be useful in stand-alone retrieval systems, front-ends to existing information retrieval systems, or real-time document filtering and routing.
Computing with polynomials given by straight-line programs I: greatest common divisors
Authors: E Kaltofen
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

We develop algorithms on multivariate polynomials represented by straight-line programs for the greatest common divisor problem and conversion to sparse representation. Our algorithms are in random polynomial-time for the usual coefficient fields and output with controllably high probability the correct result which for the GCD problem is a straight-line program determining the GCD of the inputs and for the conversion algorithm is the sparse representation of the input. The algorithms only require an a priori bound for the total degrees of the inputs. Over rational numbers the conversion algorithm also needs a bound on the size of the polynomial coefficients. As specializations we get, e.g., random polynomial-time algorithms for computing the sparse GCD of polynomial determinants or for computing the sparse solution of a linear system whose coefficients are given by formulas.
Multicommodity flows in planar undirected graphs and shortest paths
Authors: H Suzuki, T Nishizeki, N Saito
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

This paper deals with the multicommodity flow problems for two classes of planar undirected graphs. The first class C12 consists of graphs in which each source-sink pair is located on one of two specified face boundaries. The second class C01 consists of graphs in which some of the source-sink pairs are located on a specified face boundary and all the other pairs share a common sink located on the boundary. We show that the multicommodity flow problem for a graph in C12 (resp. C01) can be reduced to the shortest path problem for an undirected (resp. a directed) graph obtained from the dual of the original undirected graph.
A discrete heuristics approach to predictive evaluation of semi-custom IC layouts
Authors: A. A. Minai, R. D. Williams, F. W. Blake
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

The significant computational requirements of VLSI layout suggest that it may be desirable to estimate the feasibility of a task before actually performing the task. The system described in this paper uses a discrete heuristics approach to estimate the future quality of a semi-custom layout before any placement or routing is done. It does this evaluation with respect to critical parameters such as routability, area utilization, and wire length, using heuristics arranged in a discrete graph structure. The system can handle user-specified non-rectangular layout shapes. Its rule-based structure allows easy observation and modification of individual heuristics for the purposes of &ldquo;fine tuning.&rdquo; The system also detects potential problems and suggests possible solutions.
An algorithm for finding Hamilton cycles in random graphs
Authors: B Bollobás, T I Fenner, A M Frieze
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

This paper describes a polynomial time algorithm HAM that searches for Hamilton cycles in undirected graphs. On a random graph its asymptotic probability of success is that of the existence of such a cycle. If all graphs with n vertices are considered equally likely, then using dynamic programming on failure leads to an algorithm with polynomial expected time. Finally, it is used in an algorithm for solving the symmetric bottleneck travelling salesman problem with probability tending to 1, as n tends to &infin;.
Why ROSE is fast: Five optimizations in the design of an experimental database system for CAD/CAM applications
Authors: Martin Hardwick
Venue: ACM SIGMOD Record (1987)

ROSE is an experimental database system for CAD/CAM applications that organizes a database into entries and relationships. The data model of ROSE is an extension of the relational model and the data manipulation language is an extension of the relational algebra. Internally, ROSE is organized so that it can use operating system services to implement database system services. In this paper we describe five optimizations that have helped to make ROSE a fast database system for CAD/CAM.
Complete logical routings in computer mail systems
Authors: P. Martin, D. Tsichritzis
Venue: ACM Transactions on Information Systems (TOIS) (1986)

The logical routing of a message in a computer mail system involves the identification and location of the set of intended recipients for that message. This function is carried out by the naming and addressing mechanism of the mail system. An important property of that mechanism is that it should be able to identify and locate all the intended recipients of a message, so that, once submitted, a message will not become lost or stuck in the system. We first discuss message addressing schemes, which are a framework for dealing with the naming and addressing problem. Message addressing schemes can also serve as a basis for the analysis of some of the properties of logical message routing within a system. We examine the conditions necessary for a complete message addressing scheme, that is, one that guarantees to deliver all possible messages.
Transaction commitment at minimal communication cost
Authors: A. Segall, O. Wolfson
Venue: Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1987)

We consider the communication protocol for transaction commitment in a distributed database. Specifically, the connection between the structure of communication among the participating sites, and the communication network topology is investigated. In order to do so, the cost of transaction commitment is defined as the number of network hops that messages of the protocol must traverse. We establish the necessary cost for transaction commitment, and show that it is also sufficient. A simple distributed algorithm is presented to prove sufficiency. Our algorithm is also time-efficient, and in order to prove that we show that the timing of our algorithm is optimal within a natural class of commit-protocols.
Measurement and modeling of computer reliability as affected by system activity
Authors: R. K. Iyer, D. J. Rossetti, M. C. Hsueh
Venue: ACM Transactions on Computer Systems (TOCS) (1986)

This paper demonstrates a practical approach to the study of the failure behavior of computer systems. Particular attention is devoted to the analysis of permanent failures. A number of important techniques, which may have general applicability in both failure and workload analysis, are brought together in this presentation. These include: smeared averaging of the workload data, clustering of like failures, and joint analysis of workload and failures. Approximately 17 percent of all failures affecting the CPU were estimated to be permanent. The manifestation of a permanent failure was found to be strongly correlated with the level and type of workload prior to the failure. Although, in strict terms, the results only relate to the manifestation of permanent failures and not to their occurrence, there are strong indications that permanent failures are both caused and discovered by increased activity. More measurements and experiments are necessary to determine their respective contributions to the measured workload/failure relationship.
Cost-benefit methodology for office systems
Authors: Peter G. Sassone
Venue: ACM Transactions on Information Systems (TOIS) (1987)

The time savings times salary (TSTS) approach is a widely used methodology for the financial justification of office information systems, yet its theoretical basis is largely unexplored. In this paper, we identify its underlying economic model, including five critical assumptions. We find that the model, though somewhat restrictive, is not unreasonable. However, we find that the time-saving-times-salary calculation, per se, is implicitly based on a very particular assumption about how saved time will be used. This assumption has neither a behavioral nor normative basis, and we conclude that the TSTS calculation is not meaningful in most cases. An alternate approach, the hedonic wage model, is proposed. This model overcomes most of the deficiencies of the TSTS approach, although it has somewhat greater data requirements and computational complexity. A case study illustrating the use of the hedonic wage model is presented.
High-Speed Computers of the Soviet Union
Authors: Peter Wolcott, Seymour, E. Goodman
Venue: Computer (1988)

An overview is given of high-speed-computer projects in the USSR from the mid-1960s to the present. It covers the BESM-6, El'brus, the M-10, MARS, the ES-1766, the PS-x000, the TAGREI programmable architecture multiprocessor, and the IPM multiprocessor. The state of scientific computing in the USSR and the impact of recent political and organizational changes are discussed.
Database hosting in strongly-typed programming languages
Authors: Martin Bever, Peter C. Lockemann
Venue: ACM Transactions on Database Systems (TODS) (1985)

Database system support has become an essential part of many computer applications, which have extended beyond the more traditional commercial applications to, among others, engineering applications. Correspondingly, application programming with the need to access databases has progressively shifted to scientifically oriented languages. Modern developments in these languages are characterized by advanced mechanisms for the liberal declaration of data types, for type checking, and facilities for modularization of large programs. The present paper examines how a DBMS can be accessed from such a language in a way that conforms to its syntax and utilizes its type-checking facilities, without modifying the language specification itself, and hence its compilers. The basic idea is to rely on facilities for defining modules as separately compilable units, and to use these to declare user-defined abstract data types. The idea is demonstrated by an experiment in which a specific DBMS (ADABAS) is hosted in the programming language (LIS). The paper outlines a number of approaches and their problems, shows how to embed the DML into LIS, and how a more user-oriented DML can be provided in LIS.
The Tinkertoy Graphical Programming Environment
Authors: Mark Edel
Venue: IEEE Transactions on Software Engineering (1988)

The Tinkertoy graphical interface to Lisp is described, in which programs are 'built' rather than written, out of icons and flexible interconnections. It represents a computer/user interface that can easily exceed the interaction speed of the best text-based language editors and command languages. It also provides a consistent framework for interaction across both editing and command execution. Moreover, because programs are represented graphically, structures that do not naturally conform to the text medium can be clearly described, the new kinds of information can be incorporated into programs and program elements.
Performance measurement of paging behavior in multiprogramming systems
Authors: M. I. Malkawi, J. H. Patel
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

This paper presents empirical results on the performance of CD, a compiler directed memory management policy, and the Working Set policy in a multiprogramming system. A description of the multiprogramming model used in the experiments is also presented. The results show that CD outperforms WS in terms of fault rate, space time cost, and throughput characteristics. Moreover, WS is shown to lack controllability. Two anomaly types are reported in this paper, both of which are exhibited by WS but not by CD.
Completeness and incompleteness of trace-based network proof systems
Authors: J. Widom, D. Gries, F. B. Schneider
Venue: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1987)

Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two examples are presented to show its inherent incompleteness. Surprisingly, both examples consist of only one process, indicating that network composition is not a cause of incompleteness. Axioms necessary and sufficient for the relative completeness of a trace logic are then presented.
Object identity
Authors: Setrag N. Khoshafian, George P. Copeland
Venue: ACM SIGPLAN Notices (1986)

Identity is that property of an object which distinguishes each object from all others. Identity has been investigated almost independently in general-purpose programming languages and database languages. Its importance is growing as these two environments evolve and merge.We describe a continuum between weak and strong support of identity, and argue for the incorporation of the strong notion of identity at the conceptual level in languages for general purpose programming, database systems and their hybrids. We define a data model that can directly describe complex objects, and show that identity can easily be incorporated in it. Finally, we compare different implementation schemes for identity and argue that a surrogate-based implementation scheme is needed to support the strong notion of identity.
Optimal simulations between mesh-connected arrays of processors
Authors: S. Rao Kosaraju, Mikhail J. Atallah
Venue: Journal of the ACM (JACM) (1988)

Let G and H be two mesh-connected arrays of processors, where G = g1, X g2 X &hellip; X g1, H = h1 x h2 x &hellip; x hd, and g1 &hellip; g1 &le; h1 &hellip; hd. The problem of simulating G by H is considered and the best possible simulation in terms of the gi's and hi's is characterized by giving such a simulation and proving its optimality in the worst-case sense. Also the same bound on the average cost of encoding the edges of G as distinct paths in H is established.
The all-geodesic furthest neighbor problem for simple polygons
Authors: S. Suri
Venue: Proceedings of the third annual symposium on Computational geometry (1987)

We present an &Ogr;(n logn) time and &Ogr; (n) space algorithm for the following problem in a simple polygon P with n vertices: For each vertex u of P, find another vertex &pgr;(u) that is furthest from u, where the distance between two points is measured by the length of the shortest internal path connecting them in P. As a corollary, the longest internal path in P, called the geodesic diameter, also can be found within the same time and space bound. All the previously known algorithms for computing the geodesic diameter have required &OHgr;(n2) time in the worst case, e.g. see Chazelle [5], Reif and Storer [16] and Toussaint [19].
Compression and ranking
Authors: A Goldberg, M Sipser
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

A complexity-theoretic approach to the classical data compression problem is to define a notion of language compression by a machine in a certain complexity class, and to study language classes compressible under the above definition. Languages that can be compressed efficiently (e.g. by a probabilistic polynomial time machine) are of special interest. We define the notion of language compressibility, and show that sufficiently sparse &ldquo;easy&rdquo; languages (e.g. polynomial time) can be compressed efficiently. We also define a notion of ranking (which is an optimal compression) and show that some &ldquo;very easy&rdquo; languages (e.g. unambiguous context-free languages) can be ranked efficiently. We exhibit languages which cannot be compressed or ranked efficiently. The notion of compressibility is closely related to Kolmogorov complexity and randomness. We discuss this relationship and the complexity-theoretic implications of our results.