ppxscal/embedding_network huggingface dataset:
Optimal aggregation algorithms for middleware
Authors: Ronald Fagin, Amnon Lotem, Moni Naor
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under that attribute, sorted by grade (highest grade first). There is some monotone aggregation function, or combining rule, such as min or average, that combines the individual grades to obtain an overall grade. To determine objects that have the best overall grades, the naive algorithm must access every object in the database, to find its grade under each attribute. Fagin has given an algorithm (&ldquo;Fagin's Algorithm&rdquo;, or FA) that is much more efficient. For some distributions on grades, and for some monotone aggregation functions, FA is optimal in a high-probability sense. We analyze an elegant and remarkably simple algorithm (&ldquo;the threshold algorithm&rdquo;, or TA) that is optimal in a much stronger sense than FA. We show that TA is essentially optimal, not just for some monotone aggregation functions, but for all of them, and not just in a high-probability sense, but over every database. Unlike FA, which requires large buffers (whose size may grow unboundedly as the database size grows), TA requires only a small, constant-size buffer. We distinguish two types of access: sorted access (where the middleware system obtains the grade of an object in some sorted list by proceeding through the list sequentially from the top), and random access (where the middleware system requests the grade of object in a list, and obtains it in one step). We consider the scenarios where random access is either impossible, or expensive relative to sorted access, and provide algorithms that are essentially optimal for these cases as well.
Operations on sparse relations
Authors: H. B. Hunt,  III, J. D. Ullman
Venue: Communications of the ACM (1977)

Various computations on relations, Boolean matrices, or directed graphs, such as the computation of precedence relations for a context-free grammar, can be done by a practical algorithm that is asymptotically faster than those in common use. For example, how to compute operator precedence or Wirth-Weber precedence relations in O(n2) steps is shown, as well as how to compute linear precedence functions in O(n) steps, where n is the size of a grammar. The heart of the algorithms is a general theorem giving sufficient conditions under which an expression whose operands are sparse relations and whose operators are composition, transitive closure, union, and inverse, can be computed efficiently.
Designing a trace format for heap allocation events
Authors: Trishul Chilimbi, Richard Jones, Benjamin Zorn
Venue: ACM SIGPLAN Notices (2001)

Dynamic storage allocation continues to play an important role in the performance and correctness of systems ranging from user productivity software to high-performance servers. While algorithms for dynamic storage allocation have been studied for decades, much of the literature is based on measuring the performance of benchmark programs unrepresentative of many important allocation-intensive workloads. Furthermore, to date no standard has emerged or been proposed for publishing and exchanging representative allocation workloads. In this paper, we describe a preliminary design of a trace format for such workloads and investigate its effectiveness at representing large allocation traces. Our proposal allows for a flexible encoding of information in the trace to achieve greater compression. We evaluate our preliminary design in two dimensions. First, we measure how effective these encodings are at reducing trace size. Second we consider how a meta-level specification language could be used to describe such formats and to generate trace readers and writers automatically.
Pseudo pin assignment with crosstalk noise control
Authors: C.-C. Chang, J. Cong
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

This paper presents a new pseudo pin assignment (PPA) algorithm with crosstalk noise control in multi-layer gridless general-area routing. We propose a two-step approach that considers obstacles and minimizes the estimated number of vias under crosstalk noise constraints. Without crosstalk noise control in PPA, the average noise after detailed routing of our test cases is 0.13-0.22 VDD with up to 8% of nets larger than 0.3 VDD. However, if the noise constraint of each net is set of 0.3 VDD in PPA, the average noise reduces 15% -31% to 0.11-0.15 VDD with no crosstalk noise violations. Even without rip-out and reroute, the detailed routing completion rate is 95%-99% and the ratio of vias to nets is only 0.7-1.2.
Teaching future verification engineers: the forgotten side of logic design
Authors: Fusun Ozguner, Duane Marhefka, Joanne DeGroat, Bruce Wile, Jennifer Stofer, Lyle Hanrahan
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

This paper describes a senior/graduate level course in hardware logic verification being offered by The Ohio State University in cooperation with IBM. The need for the course is established through the growing importance of logic verification to users of custom logic designs. We discuss the short-term and long-term goals for the course, and describe the course content and format. The course relies heavily on lab projects to illustrate the main concepts. Three projects and a final project review are described.
An algorithm for equivalence declarations
Authors: Bruce W. Arden, Bernard A. Galler, Robert M. Graham
Venue: Communications of the ACM (1961)

Many algebraic translators provide the programmer with a limited ability to allocate storage. Of course one of the most desirable features of these translators is the extent to which they remove the burden of storage allocation from the programmer. Nevertheless, there are situations in which one wishes to make certain vectors and arrays contiguous, coincident, or overlapping. This is made possible in FORTRAN by the use of COMMON and EQUIVALENCE statements, in MAD by the use of PROGRAM COMMON, ERASABLE, and EQUIVALENCE statements, etc.
The Size of a Graph Without Topological Complete Subgraphs
Authors: M. Cera, A. Diánez, A. Márquez
Venue: SIAM Journal on Discrete Mathematics (2000)

In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n not containing a subgraph homeomorphic to the complete graph of order p. Further, for ${\left \lceil \frac{2n+5}{3}\right \rceil}\leq p
Efficient and effective metasearch for text databases incorporating linkages among documents
Authors: Clement Yu, Weiyi Meng, Wensheng Wu, King-Lup Liu
Venue: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)

Linkages among documents have a significant impact on the importance of documents, as it can be argued that important documents are pointed to by many documents or by other important documents. Metasearch engines can be used to facilitate ordinary users for retrieving information from multiple local sources (text databases). There is a search engine associated with each database. In a large-scale metasearch engine, the contents of each local database is represented by a representative. Each user query is evaluated against he set of representatives of all databases in order to determine the appropriate databases (search engines) to search (invoke) In previous word, the linkage information between documents has not been utilized in determining the appropriate databases to search. In this paper, such information is employed to determine the degree of relevance of a document with respect to a given query. Specifically, the importance (rank) of each document as determined by the linkages is integrated in each database representative to facilitate the selection of databases for each given query. We establish a necessary and sufficient condition to rank databases optimally, while incorporating the linkage information. A method is provided to estimate the desired quantities stated in the necessary and sufficient condition. The estimation method runs in time linearly proportional to the number of query terms. Experimental results are provided to demonstrate the high retrieval effectiveness of the method.
Orchestrating a mixed reality performance
Authors: Boriana Koleva, Ian Taylor, Steve Benford, Mike Fraser, Chris Greenhalgh, Holger Schnädelbach, Dirk vom Lehn, Christian Heath, Ju Row-Farr, Matt Adams
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

A study of a professional touring mixed reality performance called Desert Rain yields insights into how performers orchestrate players' engagement in an interactive experience. Six players at a time journey through an extended physical and virtual set. Each sees a virtual world projected onto a screen made from a fine water spray. This acts as a traversable interface, supporting the illusion that performers physically pass between real and virtual worlds. Live and video-based observations of Desert Rain, coupled with interviews with players and the production team, have revealed how the performers create conditions for the willing suspension of disbelief, and how they monitor and intervene in the players experience without breaking their engagement. This involves carefully timed performances and &ldquo;off-face&rdquo; and &ldquo;virtual&rdquo; interventions. In turn, these are supported by the ability to monitor players' physical and virtual activity through asymmetric interfaces.
The Bengal Database Replication System
Authors: Todd Ekenstam, Charles Matheny, Peter Reiher, Gerald J. Popek
Venue: Distributed and Parallel Databases (2001)

Mobile computers often suffer from limited connectivity, or even complete lack of network access. Moreover, in wireless networks some machines are often more accessible to mobile computers than others are. Ideally, nomadic users want the same quality and speed of database access as when they are well connected to the network. Replicated databases meet this need by allowing each mobile machine to carry its own copy of key data. But existing replicated systems are not well suited for all nomadic scenarios. Certain important mobile computing situations require optimistic peer-oriented database replication. The Bengal Database Replication System has these characteristics and was designed to operate in difficult nomadic conditions. This paper presents the design assumptions of the system, describes its architecture, presents performance data on its operation, and discusses future enhancements for the system. The paper also contrasts the system to other replicated databases, concentrating on their suitability for nomadic computing. The Bengal technology can play an important role in the development of highly scalable, highly available, fault-tolerant database systems.
Architecture-dependent operating system project sequence
Authors: John L. Donaldson
Venue: ACM SIGCSE Bulletin (2001)

Developing hands-on programming projects for a course on operating systems is a challenge. A wide variety of methods have been used and reported on at past SIGCSE meetings. A good summary of some of these projects can be found in [5]. One approach is to build a rudimentary operating system kernel from the bottom up. This approach necessarily involves some architecture-dependent coding. In this paper, the author describes his experience with such a project sequence based on the Intel protected mode architecture.
Syntax-directed interpretation of classes of pictures
Authors: R. Narasimhan
Venue: Communications of the ACM (1966)

A descriptive scheme for classes of pictures based on labeling techniques using parallel processing algorithms was proposed by the author some years ago. Since then much work has been done in applying this to bubble chamber pictures. The parallel processing simulator, originally written for an IBM 7094 system, has now been rewritten for a CDC 3600 system. This paper describes briefly the structure of syntactic descriptive models by considering their specific application to bubble chamber pictures. How the description generated in this phase can be embedded in a larger &ldquo;conversation&rdquo; program is explained by means of a certain specific example that has been worked out. A partial generative grammar for &ldquo;handwritten&rdquo; English letters is given, as are also a few computer-generated outputs using this grammar and the parallel processing simulator mentioned earlier.
Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
Authors: Tuugrul Dayar, William J. Stewart
Venue: SIAM Journal on Scientific Computing (1999)

Experimental results for large, sparse Markov chains, especially the ill-conditioned nearly completely decomposable (NCD) ones, are few. We believe there is need for further research in this area, specifically to aid in the understanding of the effects of the degree of coupling of NCD Markov chains and their nonzero structure on the convergence characteristics and space requirements of iterative solvers. The work of several researchers has raised the following questions that led to research in a related direction: How must one go about partitioning the global coefficient matrix into blocks when the system is NCD and a two-level iterative solver (such as block SOR) is to be employed? Are block partitionings dictated by the NCD form of the stochastic one-step transition probability matrix necessarily superior to others? Is it worth investigating alternative partitionings? Better yet, for a fixed labeling and partitioning of the states, how does the performance of block SOR (or even that of point SOR) compare to the performance of the iterative aggregation-disaggregation (IAD) algorithm? Finally, is there any merit in using two-level iterative solvers when preconditioned Krylov subspace methods are available? We seek answers to these questions on a test suite of 13 Markov chains arising in 7 applications.
The rototack: designing a computationally-enhanced craft item
Authors: Tom Wrensch, Glenn Blauvelt, Mike Eisenberg
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

This paper describes our progress in creating a device called a rototack. In its design, the rototack is an example of a computationally-enhanced craft item: a small, robust, inexpensive, and versatile &mdash; but also programmable &mdash; physical object for use in a variety of educational and home crafting projects. In particular, the tack is a source of rotational motion, suitable for turning light objects or for powering (e.g.) cams, gears, and linkages in complex, user-defined patterns. We describe the engineering decisions and trade-offs involved in creating our current prototype of the tack; discuss the central issues in creating a programming language and environment for the device; and sketch a variety of potential uses to which the tack might be put.
A buddy system variation for disk storage allocation
Authors: Warren Burton
Venue: Communications of the ACM (1976)

A generalization of the buddy system for storage allocation is described. The set of permitted block sizes {SIZEi}ni=0 must satisfy the condition SIZEi = SIZEi-1 + SIZEi-k(i) where k may be any meaningful integral-valued function. This makes it possible to force logical storage blocks to coincide with physical storage blocks, such as tracks and cylinders.
Training Algorithm with Incomplete Data for Feed-ForwardNeural Networks
Authors: Song-Yee Yoon, Soo-Young Lee
Venue: Neural Processing Letters (1999)

A new algorithm is developed to train feed-forward neural networks for non-linear input-to-output mappings with small incomplete data in arbitrary distributions. The developed Training-EStimation-Training (TEST) algorithm consists of 3 steps, i.e., (1) training with the complete portion of the training data set, (2) estimation of the missing attributes with the trained neural networks, and (3) re-training the neural networks with the whole data set. Error back propagation is still applicable to estimate the missing attributes. Unlike other training methods with missing data, it does not assume data distribution models which may not be appropriate for small training data. The developed TEST algorithm is first tested for the Iris benchmark data. By randomly removing some attributes from the complete data set and estimating the values latter, accuracy of the TEST algorithm is demonstrated. Then it is applied to the Diabetes benchmark data, of which about 50% contains missing attributes. Compared with other existing algorithms, the proposed TEST algorithm results in much better recognition accuracy for test data.
Mutual recursion in Algol 60 using restricted compilers
Authors: M. Stella Atkins
Venue: Communications of the ACM (1973)

The Elliott (I.C.L.) Algol 60 compiler contains a restriction on the sequence of declarations such that no identifier may be used before it is declared. This means that direct mutual recursion between procedures declared in the same blockhead is not possible.
Managing application program maintenance expenditures
Authors: Tor Guimaraes
Venue: Communications of the ACM (1983)

Program maintenance represents a major portion of the total expenditures on application programs. Despite the attention this subject has received in the MIS literature, new guidelines to action in this area remain of great interest to practitioners. A large number of variables thought to be determinants of application program maintenance expenditure have been studied through the inspection of application portfolios and personal interviews with top computer executives and systems development personnel. Based on the results, recommendations are made on how to reduce application program maintenance expenditures.
An automatic loader for subroutine nests
Authors: Herbert Kanner
Venue: Communications of the ACM (1964)

A method for automatic loading of library subroutines, which can be adapted to operate in conjunction with any conventional two-pass assembler is described. The method is specifically designed to cope with a nested library structure.
On the application of the process of equalization of maxima to obtain rational approximation to certain modified Bessel functions
Authors: I. Gargantini
Venue: Communications of the ACM (1966)

The second Remes algorithm as originally established for polynomials, may converge or not when the approximating functions are rational. However, the few results known in this domain show how efficient the algorithm can be to obtain approximations with a small error, much more than in the polynomial case, in which the best approximation can be very nearly approached directly by a series development. The aim of this paper is to investigate the limitations of the applicability of certain extensions of the algorithm to the case where the approximations are rational as well as to present some numerical results.
A framework for the simulation of agents with emotions
Authors: Ana L. C. Bazzan, Rafael H. Bordini
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The Iterated Prisoner's Dilemma (IPD) has been used as a paradigm for studying the emergence of cooperation among individual agents. Many computer experiments show that cooperation does arise under certain conditions. However, little attention has been paid to aspects of emotions in this context. The goal of this work is thus to develop a framework for modelling agents with emotions. It allows the design of such agents, which interact with neighbours or their social groups. This paper describes a scenario in which agents may have various types of emotions, and which uses the IPD as a metaphor for social interactions. We compare our results with standard ones achieved in the scenario of a two-dimensional array of either cooperators or defectors, without any kind of emotion involved. Our results show that the ratio of cooperators is slightly higher when agents make decisions using emotions. This might be explained by the fact that agents are not so short-sighted in that they always either cooperate or defect. Rather, their flexibility increases when they are able to use emotions to decide which course of action to take during the game.
Survey of coded character representation
Authors: R. W. Bemer
Venue: Communications of the ACM (1960)

Technical Committee 97 of the International Standards Organization (ISO) is concerned with standards in data processing. The American Standards Association holds the secretariat of this committee. Sectional Committee X3 of A.S.A. is responsible for national data processing standards in the U. S.
Compact labeling schemes for ancestor queries
Authors: Serge Abiteboul, Haim Kaplan, Tova Milo
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We consider the following problem. Give a rooted tree T, label the nodes of T in the most compact way such that given the labels of two nodes one can determine in constant time, by looking only at the labels, if one node is an ancestor of the other. The best known labeling scheme is rather straightforward and uses labels of size at most 2 log n, where n is the number of vertices In the tree. Our main result in this paper is a labeling scheme with maximum label size close to 3/2 log n. Our motivation for studying this problem is enhancing the performance of Web search engines. In the context of this application each indexed document is a tree and the labels of all trees are maintained in main memory. Therefore even small improvements in the maximum label size are important. There are no lower bounds known for this problem except for an obvious lower bound of log n that follows from the fact that different vertices must have different labels. The question whether one can find even shorter labels remains an intriguing open question.
Boot with GRUB
Authors: Wayne Marshall
Venue: Linux Journal (2001)

Run multiple OSes with free GRUB.
Algorithm 420: hidden-line plotting program [J6]
Authors: Hugh Williamson
Venue: Communications of the ACM (1972)

HIDE produces a two-dimensional representation of a surface or figure by plotting segments of a succession of curves; each curve is plotted where it is not hidden by any of the curves previously plotted (that is, where it does not fall below any of them as they appear in the two-dimensional representation).
Algorithm 414: Chebyshev approximation of continuous functions by a Chebyshev system of functions
Authors: G. H. Golub, L. B. Smith
Venue: Communications of the ACM (1971)

The second algorithm of Remez can be used to compute the minimax approximation to a function, &fnof;(x), by a linear combination of functions, {Qi(x)}n0, which form a Chebyshev system. The only restriction on the function to be approximated is that it be continuous on a finite interval [a,b]. An Algol 60 procedure is given, which will accomplish the approximation. This implementation of the second algorithm of Remez is quite general in that the continuity of &fnof;(x) is all that is required whereas previous implementations have required differentiability, that the end points of the interval be &ldquo;critical points,&rdquo; and that the number of &ldquo;critical points&rdquo; be exactly n + 2. Discussion of the method used and of its numerical properties is given as well as some computational examples of the use of the algorithm. The use of orthogonal polynomials (which change at each iteration) as the Chebyshev system is also discussed.