ppxscal/embedding_network huggingface dataset:
Optimal prefetching via data compression (extended abstract)
Authors: Jeffrey Scott Vitter, P. Krishnan
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A form of the competitive philosophy is applied to the problem of prefetching to develop an optimal universal prefetcher in terms of fault ratio, with particular applications to large-scale databases and hypertext systems. The algorithms are novel in that they are based on data compression techniques that are both theoretically optimal and good in practice. Intuitively, in order to compress data effectively, one has to be able to predict feature data well, and thus good data compressors should be able to predict well for purposes of prefetching. It is shown for powerful models such as Markov sources and mth order Markov sources that the page fault rates incurred by the prefetching algorithms presented are optimal in the limit for almost all sequences of page accesses.
Random DFA's can be approximately learned from sparse uniform examples
Authors: Kevin J. Lang
Venue: Proceedings of the fifth annual workshop on Computational learning theory (1992)

Approximate inference of finite state machines from sparse labeled examples has been proved NP-hard when an adversary chooses the target machine and the training set [Ang78, KV89, PW89]. We have, however, empirically found that DFA's are approximately learnable from sparse data when the target machine and training set are selected at random.
Rationale for the proposed standard for package of real and complex type declarations and basic operations for Ada (including vector and matrix types)
Authors: Graham S. Hodgson
Venue: ACM SIGAda Ada Letters (1991)

This paper supplements the "Proposed Standard for Packages of Real and Complex Type Declarations and Basic Operations for Ada (including Vector and Matrix Types)", to be submitted by the ISO-IEC/JCT1/SC22/WG9 (Ada) Numerics Rapporteur Group. Based on recommendations made jointly by the Ada-Europe Numerics Working Group and the ACM SIGAda Numerics Working Group, the proposed real and complex vector and matrix standard is the third of several anticipated secondary standards to address the interrelated issues of portability, efficiency and robustness of numerical software written in Ada. Its purpose, features and development are outlined in this commentary.
Creating programming projects with visual impact
Authors: James Robergé
Venue: ACM SIGCSE Bulletin (1992)

One of the challenges facing educators in computer science is to develop programming projects which not only engage students intellectually, but which also excite and motivate them. Given the highly visual orientation of today's students, if is important that we consider not only the conceptual underpinnings of our programming projects, but also their visual impact. This paper focuses upon a set of programming projects which use the traditional elements from a data structures course to produce visually engaging applications.
Extending CLOS towards logic programming: a proposal
Authors: Vincenzo Loia, Michel Quaggetto
Venue: ACM SIGPLAN OOPS Messenger (1993)

Prolog, because of its weakness in describing structured objects, has always benefited from a mixing with an OO paradigm maybe more than other languages. Logic programming seems to be complementary with OO programming. This paper presents a proposal of an extension of CLOS towards logic programming. We show how it has been possible to introduce in CLOS a set of new mechanisms which allow the execution of Prolog programs. The paper outlines how the CLOS approach resulted in a very useful and powerful framework to increase flexibility, expressivity and elegance in Prolog design.
LAPACK: a portable linear algebra library for high-performance computers
Authors: E. Anderson, Z. Bai, J. Dongarra, A. Greenbaum, A. McKenney, J. Du Croz, S. Hammerling, J. Demmel, C. Bischof, D. Sorensen
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

The goal of the LAPACK project is to design and implement a portable linear algebra library for efficient use on a variety of high-performance computers. The library is based on the widely used LINPACK and EISPACK packages for solving linear equations, eigenvalue problems, and linear least-squares problems, but extends their functionality in a number of ways. The major methodology for making the algorithms run faster is to restructure them to perform block matrix operations (e.g., matrix-matrix multiplication) in their inner loops. These block operations may be optimized to exploit the memory hierarchy of a specific architecture. The LAPACK project is also working on new algorithms that yield higher relative accuracy for a variety of linear algebra problems.
Performance Evaluation of Parallel Systems by Using Unbounded Generalized Stochastic Petri Nets
Authors: Mercedes Granda, José M. Drake, José A. Gregorio
Venue: IEEE Transactions on Software Engineering (1992)

Methods of calculating efficiently the performance measures of parallel systems by using unbounded generalized stochastic Petri nets are presented. An explosion in the number of states to be analyzed occurs when unbounded places appear in the model. The state space of such nets is infinite, but it is possible to take advantage of the natural symmetries of the system to aggregate the states of the net and construct a finite graph of lumped states which can easily be analyzed. With the methods developed, the unbounded places introduce a complexity similar to that of safe places of the net. These methods can be used to evaluate models of open parallel systems in which unbounded places appear; systems which are k-bounded but are complex and have large values of k can also be evaluated in an appropriate way. From the steady-state solution of the model, it is possible to obtain automatically the performance measures of parallel systems represented by this type of net.
A Noninterference Monitoring and Replay Mechanism for Real-Time Software Testing and Debugging
Authors: J. J. P. Tsai, K.-Y. Fang, H.-Y. Chen, Y.-D. Bi
Venue: IEEE Transactions on Software Engineering (1990)

A noninterference monitoring and replay mechanism using the recorded execution history of a program to control the replay of the program behavior and guarantee the reproduction of its errors is presented. Based on this approach, a noninterference monitoring architecture has been developed to collect the program execution data of a target real-time software system without affecting its execution. A replay mechanism designed to control the reproduction of the program behavior as well as the examination of the states of the target system and its behavior is presented. The monitoring system has been implemented using a Motorola 68000 computer in a Unix system environment. An example is used to illustrate how the mechanism detects timing errors of real-time software systems.
A time dependent multimedia document as an advanced communication media
Authors: Takeshi Yoneda, Yutaka Matsushita
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

A method for formally specifying a structure of TDMD(Time Dependent Multimedia Document) is proposed. TDMD can include voice, video, test, graphics and image. Prototype system is implemented in which an interchanged document structure is parsed and each component of the document can be presented at intended time at appropriate position.
Bellman strikes again!: the growth rate of sample complexity with dimension for the nearest neighbor classifier
Authors: Santosh S. Venkatesh, Robert R. Snapp, Demetri Psaltis
Venue: Proceedings of the fifth annual workshop on Computational learning theory (1992)

The finite sample performance of a nearest neighbor classifier is analyzed for a two-class pattern recognition problem. An exact integral expression is derived for the m-sample risk Rm given that a reference m-sample of labeled points, drawn independently from Euclidean n-space according to a fixed probability distri bution, is available to the classifier. For a family of smooth distributions, it is shown that the m-sample risk Rm has a complete asymptotic expansion ******, where ** denotes the nearest neighbor risk in the infinite sample limit. Explicit definitions of the expansion coefficents are given in terms of the underlying distribution. As the convergence rate of **** dramatically slows down as n increases, this analysis provides an analytic validation of Bellman's curse of dimensionality. Numerical simulations corroborating the formal results are included. The rates of convergence for less restrictive families of distributions are also discussed.
The MINDS system: using context and dialog to enhance speech
Authors: Sheryl R. Young
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

Contextual knowledge has traditionally been used in multi-sentential textual understanding systems. In contrast, this paper describes a new approach toward using contextual, dialog-based knowledge for speech recognition. To demonstrate this approach, we have built MINDS, a system which uses contextual knowledge to predictively generate expectations about the conceptual content that may be expressed in a system user's next utterance. These expectations are expanded to constrain the possible words which may be matched from an incoming speech signal. To prevent system rigidity and allow for diverse user behavior, the system creates layered predictions which range from very specific to very general. Each time new information becomes available from the ongoing dialog, MINDS generates a different set of layered predictions for processing the next utterance. The predictions contain constraints derived from the contextual, dialog level knowledge sources and each prediction is translated into a grammar usable by our speech recognizer, SPHINX. Since speech recognizers use grammars to dictate legal word sequences and to constrain the recognition process, the dynamically generated grammars reduce the number of word candidates considered by the recognizer. The results demonstrate that speech recognition accuracy is greatly enhanced through the use of predictions.
Improving DQDB behaviour: combining bandwidth balancing and priority mechanism
Authors: Jürgen Röthig
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

DQDB is a new standard for MANs. In this paper we first present the DQDB standard. Previous investigations have shown that the combination of BWB and the priority mechanism in a DQDB network does not work correctly. We shall analyze that behaviour and develop some solutions to overcome the problems. The principle ideals of the proposed solutions were developed by the way when focusing on aspects of network management [Ro&uml;thig 91]. They were shortly outlined and published in [Seitz 91]. In this paper they shall be explained in detail and simulation results shall show how the various mechanisms affect DQDB behaviour.
Rationale and design of BULK
Authors: Steve Rozen, Dennis Shasha
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

BULK is a very-high-level persistent programming language and environment for prototyping and implementing database applications. BULK provides sets and sequences as primitive type constructors, provides high-level operations on them, and allows programmers to define application-oriented bulk types, e.g. syntax trees, bond portfolios, or (geographic) maps. BULK encourages separation of correctness and efficiency concerns by distinguishing logical type from representation. BULK supports a three-step development paradigm consisting of (i) prototyping, (ii) intensive analysis, optimization, and data structure selection by the compiler to achieve efficiency, and (iii) if efficiency is still inadequate, hot-spot refinement [CGK89]. (In hot-spot refinement developers remove performance bottlenecks by providing the compiler with more information, by directing its optimization efforts, or by re-implementation.) Step (i) focuses on correctness, steps (ii) and (iii) on efficiency. Our goal is an implementation that can usually achieve acceptable efficiency by step (ii) and that provides a tractable interface for hot-spot refinement.
An Information Retrieval Approach for Automatically Constructing Software Libraries
Authors: Yoëlle S. Maarek, Daniel M. Berry, Gail E. Kaiser
Venue: IEEE Transactions on Software Engineering (1991)

A technology for automatically assembling large software libraries which promote software reuse by helping the user locate the components closest to her/his needs is described. Software libraries are automatically assembled from a set of unorganized components by using information retrieval techniques. The construction of the library is done in two steps. First, attributes are automatically extracted from natural language documentation by using an indexing scheme based on the notions of lexical affinities and quantity of information. Then a hierarchy for browsing is automatically generated using a clustering technique which draws only on the information provided by the attributes. Due to the free-text indexing scheme, tools following this approach can accept free-style natural language queries.
An ada object-based analysis and design approach
Authors: Neal L. Walters
Venue: ACM SIGAda Ada Letters (1991)

Cost and quality are becoming increasingly important for companies developing software for the Federal Government. Since much of the software developed for the Government must he written in Ada, software engineers and managers are searching to improve the process of developing Ada systems.Based on the potential of object-oriented methods-better maintainability, reusability, and intellectual control for large complex systems-we have implemented and are continuing to evolve a real-time object-oriented approach for developing Ada systems. Our process borrows heavily from the work of others and offers unique techniques for expressing object behavior, verifying and validating the object-oriented models, and mapping the object-oriented requirements model to Ada constructs. The approach we present in this paper incorporates object-oriented methods for both requirements analysis and Ada design, and focuses on: bull;Ada considerations for the object-oriented models bull;Transitioning from the requirements analysis model to Ada design with a minimum of corner-turning bull;Real-time behavior specifications for object services bull;A common method for verifying the requirements analysis model and validating the design model.
A Gröbner basis technique for Padé approximation
Authors: Patrick Fitzpatrick, John Flynn
Venue: Journal of Symbolic Computation (1992)

We consider solving for a and b the congruence a=bh mod I, where a, b and h are (multivariable) polynomials and I is a polynomial ideal. This is a generalization of the well-known problem of Pade approximation of which decoding Hensel codes is a special case. We show how Grobner bases of modules may be used to generalize the Euclidean algorithm method of solution of the 1-variable problem.
Macro processing in high-level languages
Authors: Alexander Sakharov
Venue: ACM SIGPLAN Notices (1992)

A macro language is proposed. It enables macro processing in high-level programming languages. Macro definitions in this language refer to the grammars of the respective programming languages. These macros introduce new constructs in programming languages. It is described how to automatically generate macro processors from macro definitions and programming language grammars written in the lex-yacc format. Examples of extending high-level languages by means of macros are given.
Progress in building user interface toolkits: the world according to XIT
Authors: Jürgen Herczeg, Hubertus Hohl, Matthias Ressel
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

User interface toolkits and higher-level tools built on top of them play an ever increasing part in developing graphical user interfaces. This paper describes the XIT system, a user interface development tool for the X Window System, based on Common Lisp, comprising user interface toolkits as well as high-level interactive tools organized into a layered architecture. We especially focus on the object-oriented design of the lower-level toolkits and show how advanced features for describing automatic screen layout, visual feedback, application links, complex interaction, and dialog control, usually not included in traditional user interface toolkits, are integrated.
New placement and global routing algorithms for standard cell layouts
Authors: Masato Edahiro, Takeshi Yoshimura
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

New placement and global routing algorithms are proposed for standard cell layouts. The placement algorithm, called the hierarchical clustering with min-cut exchange (HCME), is effective to avoid being trapped in local optimum solutions. The global routing algorithm does not route the nets one by one and therefore, the results are independent of the net order and channel order. In this algorithm, channel width is minimized under a cost function, in which the trade-off between the minimization of net lengths and the minimization of the number of tracks is considered. These algorithms are simple and highly efficient. This is confirmed by computational experiments.
Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation
Authors: Gabriel Taubin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The author addresses the problem of parametric representation and estimation of complex planar curves in 2-D surfaces in 3-D, and nonplanar space curves in 3-D. Curves and surfaces can be defined either parametrically or implicitly, with the latter representation used here. A planar curve is the set of zeros of a smooth function of two variables x-y, a surface is the set of zeros of a smooth function of three variables x-y-z, and a space curve is the intersection of two surfaces, which are the set of zeros of two linearly independent smooth functions of three variables x-y-z For example, the surface of a complex object in 3-D can be represented as a subset of a single implicit surface, with similar results for planar and space curves. It is shown how this unified representation can be used for object recognition, object position estimation, and segmentation of objects into meaningful subobjects, that is, the detection of 'interest regions' that are more complex than high curvature regions and, hence, more useful as features for object recognition.
On the relation between resolution based and completion based theorem proving
Authors: Rolf Socher
Venue: Journal of Symbolic Computation (1991)

Completion theorem proving, as proposed by J. Hsiang (1982), is based on the observation that proving a first order formula is equivalent to solving an equational system over a boolean polynomial ring. The latter can be accomplished, by completing the set of rewrite rules obtained from the equational system. This method's basic deduction rule is the generation of a new rule from a divergent critical pair obtained by superposition of two rules. This paper relates superposition to the resolution rule, which is the basis of resolution theorem proving, extending Dietrich's result on the correspondence between completion and resolution from Horn clauses to arbitrary clauses. It is shown that each completion deduction that follows Hsiang's N-strategy can be partitioned into sequences of superpositions that correspond to hyperresolution steps. However, such a correspondence does not exist for arbitrary completion deductions: There is a class of clause sets that preclude resolution refutations using each clause only once - a result which was given by R. Shostak - but admit completion refutations with this property, that is, such a completion refutation is shorter than any resolution refutation can be. Furthermore, we show by means of Shostak's theorem that the language of rings and ideals is well suited for short and elegant proofs of theorems about resolution deductions.
Introducing the fuzzy paradigm using Prolog
Authors: D. M. Kaminski
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

This artificial intelligence project introduces students to an alternative to the traditional &ldquo;crisp&rdquo; paradigm of computer science through the use of fuzzy sets and linguistic variables for modeling natural language expressions. A fuzzy/linguistic meta-language is built on Prolog. This helps them to explore some of the problems encountered in the human/computer interface of bridging the fuzzy, imprecise symbolic world of natural language and the computer's crisp, numeric world.
An optimal parallel algorithm for detecting weak visibility of a simple polygon
Authors: Danny Z. Chen
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

The problem of detecting the weak visibility of an n-vertex simple polygon P is that of finding whether or not P is weakly visible from one of its edges and (if it is) identifying every edge from which P is weakly visible. In this paper, we present an optimal parallel algorithm for solving this problem. Our algorithm runs in O(log n) time using O(n/log n) processors in the CREW-PRAM computational model, and is very different from the sequential algorithms for this problem. This algorithm also enables us to optimally solve, in parallel, several other problems on weakly visible polygons.
Stability, Availability, and Response in Network File Service
Authors: Jason Gait
Venue: IEEE Transactions on Software Engineering (1991)

A network file system called Multifile is described. It meets response, availability, and stability requirements as primitive functions. Multifile has a high degree of responsiveness because its component parts compete among themselves to service file requests; it has high availability because it maintains multiple copies of files; and it exhibits stable behavior over wise range of system parameters. The responsiveness of Multifile to read requests improves as the number of pages per request rises, implying that read ahead pages can profitably be cached at client sites. The throughput of Multifile improves as the request size increases and as the number of clients increases. As server load increases, the responsiveness of Multifile to read requests is stable in most configurations. The throughput of writes is unstable as the number of pages in the wire request rises, implying that write back pages should not be cached at client sites. The scale of events in file service is dominated by disk activity, so lost message exceptions do not occur frequently enough to affect file service; however, duplicate message exceptions are a factor in performance.
Finding the repeated median regression line
Authors: Andrew Stein, Michael Werman
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

The repeated median regression line is a robust regression estimate, having a maximal 50% breakdown point. This paper presents an O(n(log n)2) algorithm for finding the repeated median regression line through n points in the plane.