ppxscal/embedding_network huggingface dataset:
Dynamic storage allocation for an information retrieval system
Authors: Burnett H. Sams
Venue: Communications of the ACM (1961)

This paper presents an information retrieval problem whose programming solution included dynamic storage allocation. Allocatable machine code is defined, and an assembly program to produce allocatable machine code is described. The work reported on was done as part of Project ACSI-MATIC1 which is concerned with the application of computer techniques to the activities of certain headquarters military intelligence operations of the U.S. Army [1, 2].
An automatic object-oriented parser generator for Ada
Authors: Martin C. Carlisle
Venue: ACM SIGAda Ada Letters (2000)

Although many parser generator tools (aka compiler compilers) are available, very few create a parse tree. Instead, the user must add actions to the grammar to create the parse tree. This is a tedious, mechanical task, which could easily be automated. We propose a simple scheme to map a grammar to an object-oriented hierarchy, and provide a tool, called AdaGOOP, that creates lexer and parser specifications complete with all of the actions necessary to create the parse tree.
Coaching a simulated soccer team by opponent model recognition
Authors: Patrick Riley, Manuela Veloso
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

In multiagent domains with adversarial and cooperative agents, team agents should be adaptive to the current environment and opponent. We introduce an online method to provide the agents with team plans that a &ldquo;coach&rdquo; agent generates in response to the specific opponents. The coach agent is equipped with a number of pre-defined opponent models. The coach is then able to quickly select between different models online by using a naive Bayes style algorithm, making the planning adaptive to the current adversary. The coach uses a Simple Temporal Network to represent team plans as coordinated movements among the multiple agents and it searches for an opponent-dependent plan for its teammates. This plan is then communicated to the agents, who execute the plan in a distributed fashion. The system is fully implemented in a simulated robotic soccer domain.
A faster implementation of the Goemans-Williamson clustering algorithm
Authors: Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Prize Collecting Travelling Salesman, 2-Edge Connected Subgraph etc. On a graph with n nodes and m edge, our implementation gives &Ogr; (k(n + m) log2 n) time approximation algorithms for all these problems at the expense of a slight additive degradation of 1/nk in the approximation factor, for any constant k.
The influence of browsers on evaluators or, continuations to program web servers
Authors: Christian Queinnec
Venue: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000)

While developing the software of a browser-operated educational CD-ROM, we had to face a number of problems. This paper presents these problems and the solutions we found. Amusingly, most of our solutions rely on continuations. Are browsers and multimedia the future of continuations?Through their "Back" button or "Clone window" menu item, browsers have powerful abilities that force servers to take care of multiply and simultaneously answered questions. A comprehensive tool to apprehend these problems as well as to solve them is to view these abilities as operators acting on the continuations of the computation performed by servers.Thematical trails are provided to walk through the CD-ROM but do not prevent students to wander elsewhere. A trail may contain choices or quizzes so the rest of the trail should adapt to the walked part. We consider the trail as a computation and the position of the student as a continuation within that computation.Moreover this paper advocates a computation-centric view of servers (in opposition to the usual page-centric view) where interactions with users suspend the computation into continuations that may be later resumed. This approach is superior because the continuation reifies, automatically and without errors, the whole state of the computation.
Timestamp snooping: an approach for extending SMPs
Authors: Milo M. K. Martin, Daniel J. Sorin, Anastassia Ailamaki, Alaa R. Alameldeen, Ross M. Dickson, Carl J. Mauer, Kevin E. Moore, Manoj Plakal, Mark D. Hill, David H. Wood
Venue: ACM SIGPLAN Notices (2000)

Symmetric multiprocessor (SMP) servers provide superior performance for the commercial workloads that dominate the Internet. Our simulation results show that over one-third of cache misses by these applications result in cache-to-cache transfers, where the data is found in another processor's cache rather than in memory. SMPs are optimized for this case by using snooping protocols that broadcast address transactions to all processors. Conversely, directory-based shared-memory systems must indirectly locate the owner and sharers through a directory, resulting in larger average miss latencies.This paper proposes timestamp snooping, a technique that allows SMPs to i) utilize high-speed switched interconnection networks and ii) exploit physical locality by delivering address transactions to processors and memories without regard to order. Traditional snooping requires physical ordering of transactions. Timestamp snooping works by processing address transactions in a logical order. Logical time is maintained by adding a few bits per address transaction and having network switches perform a handshake to ensure on-time delivery. Processors and memories then reorder transactions based on their timestamps to establish a total order.We evaluate timestamp snooping with commercial workloads on a 16-processor SPARC system using the Simics full-system simulator. We simulate both an indirect (butterfly) and a direct (torus) network design. For OLTP, DSS, web serving, web searching, and one scientific application, timestamp snooping with the butterfly network runs 6-28% faster than directories, at a cost of 13-43% more link traffic. Similarly, with the torus network, timestamp snooping runs 6-29% faster for 17-37% more link traffic. Thus, timestamp snooping is worth considering when buying more interconnect bandwidth is easier than reducing interconnect latency.
Itanium processor clock design
Authors: U. Desai, S. Tam, R. Kim, J. Zhang, S. Rusu
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

The Itanium processor is Intel's first 64-bit microprocessor [1] and features a highly parallel architecture fabricated using the 0.18um process. This higher integration of features requires a significant silicon real estate and high clock loading. These factors, coupled with more prominent on-die variations because of reduced device geometries, call for special techniques to manage the clock design. The Itanium processor employs very well balanced clock routing along with distributed deskew buffers (DSK) to achieve low skew. The ItaniumTM processor also includes additional features to aid performance tuning and timing debug. This paper highlights the salient features of the Itanium processor clock design and presents clock characterization data from initial silicon.
Criteria for acceptable abstracts
Authors: Harold Borko
Venue: Communications of the ACM (1962)

Recently, a personal reaction to a published abstract started a study which may lead to criteria for abstracts. This particular abstract seemed inadequate to those who were familiar with the original journal article. This brought up the question of how the adequacy of an abstract is determined. Is it a matter of opinion, or is it a measure of excellence? Assuming it is the latter, are the means for measuring it specified?
FAST-SP: a fast algorithm for block placement based on sequence pair
Authors: Xiaoping Tang, D. F. Wong
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper we present FAST-SP which is a fast block placement algorithm based on the sequence-pair placement representation. FAST-SP has two significant improvements over previous sequence-pair based placement algorithms: 1) FAST-SP translates each sequence pair to its corresponding block placement in O(n log log n) time based on a fast longest common subsequence computation. This is much faster than the traditional O(n2) method by first constructing horizontal and vertical constraint graphs and then performing longest path computations. As a result, FAST-SP can examine more sequence pairs and obtain a better placement solution in less runtime. 2) FAST-SP can handle placement constraints such as pre-placed constraint, range constraint, and boundary constraint. No previous sequence-pair based algorithms can handle range constraint and boundary constraint. Fast evaluation in O(n log log n) time is still valid in the presence of placement constraints and a novel cost function which unifies the evaluation of feasible and infeasible sequence pairs is used. We have implemented FAST-SP and obtained excellent experimental results. For all MCNC benchmark block placement problems, we have obtained the best results ever reported in the literature (including those reported by algorithms based on O-tree and B*-tree) with significantly less runtime. For example, the best known result for ami49 (36.8 mm2) was obtained by a B*-tree based algorithm using 4752 seconds, and FAST-SP obtained a better result (36.5 mm2) in 31 seconds.
Quadratic search for hash tables of sizes P n
Authors: A. Frank Ackerman
Venue: Communications of the ACM (1974)

It has previously been claimed [1 and 2] that the quadratic hash table search method of Maurer cannot usefully be applied to tables of size 2n. This is not so; the method can in fact be applied to tables of size pn for any prime p. It is shown below that rather simple conditions on the coefficients suffice to guarantee that all table locations will be examined once and only once. Specifically, if the equation is k + bi2 + ai mod pn (*) where k is the initial hash address and 0 &le; i < pn, then, if p divides b but not a, the range of values is all the least positive residues of pn. To prove that all values are covered, we consider some fixed value, say k + bi20 + ai0 mod pn and ask, what conditions must be true if the congruence equation k + bi2 + ai &equiv; k + bi02 + ai0 mod pn is to have solutions i, 0 &le; i < pn, other than i0?
Data manipulation and programming problems in automatic information retrieval
Authors: G. Salton
Venue: Communications of the ACM (1966)

Automatic information retrieval programs require the manipulation of a variety of different data structures, including linear text, sparse matrices, and tree or list structures. The main data manipulations to be performed in automatic information systems are first briefly reviewed. A variety of data representations which have been used to describe structured information are then examined, and the characteristics of various processing languages are outlined in the light of the procedures requiring implementation. Advantages and disadvantages of these programming languages for the retrieval application are examined, and suggestions are made for the design of programming facilities to aid in information retrieval.
Control structures in Illiac IV Fortran
Authors: Robert E. Millstein
Venue: Communications of the ACM (1973)

As part of an effort to design and implement a Fortran compiler on the ILLIAC IV, an extended Fortran, called IVTRAN, has been developed. This language provides a means of expressing data and control structures suitable for exploiting ILLIAC IV parallelism. This paper reviews the hardware characteristics of the ILLIAC and singles out unconventiona features which could be expected to influence langluage (and compiler) design. The implications of these features for data layout and algorithm structure are discussed, and the conclusion is drawn that data allocation rather than code structuring is the crucial ILLIAC optimization problem. A satisfactory method of data allocation is then presented. Language structures to utilize this storage method and express parallel algorithms are described.
Dynamic multi-path routing: asymptotic approximation and simulations
Authors: Xun Su, Gustavo de Veciana
Venue: Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2001)

In this paper we study the dynamic multi-path routing problem. We focus on an operating regime where traffic flows arrive at and depart from the network in a bursty fashion, and where the delays involved in link state advertisement may lead to "synchronization" effects that adversely impact the performance of dynamic single-path routing schemes.We start by analyzing a simple network of parallel links, where the goal is to minimize the average increase in network congestion on the time scale of link state advertisements. We consider an asymptotic regime leading to an optimization problem permitting closed-form analysis of the number of links over which dynamic multi-path routing should be conducted. Based on our analytical result we examine three types of dynamic routing schemes, and identify a robust policy, i.e., routing the traffic to a set of links with loads within a factor of the least loaded, that exhibits robust performance. We then propose a similar policy for mesh networks and show by simulation some of its desirable properties. The main results suggest that our proposal would provide significant performance improvement for high speed networks carrying bursty traffic flows.
On feature distributional clustering for text categorization
Authors: Ron Bekkerman, Ran El-Yaniv, Naftali Tishby, Yoad Winter
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

We describe a text categorization approach that is based on a combination of feature distributional clusters with a support vector machine (SVM) classifier. Our feature selection approach employs distributional clustering of words via the recently introducedinformation bottleneck method, which generates a more efficientword-clusterrepresentation of documents. Combined with the classification power of an SVM, this method yields high performance text categorization that can outperform other recent methods in terms of categorization accuracy and representation efficiency. Comparing the accuracy of our method with other techniques, we observe significant dependency of the results on the data set. We discuss the potential reasons for this dependency.
An Analog VLSI, Scale Invariant Method for Edge Detection
Authors: D. M. Wilson
Venue: Analog Integrated Circuits and Signal Processing (2000)

A simple technique for detecting adjustable contrast in a visual scene is presented. The circuit elements can be used to detect contrast in any array of sensors or processing elements where spatial relationships among neighboring elements define contrast or the presence of an edge. This technique eliminates the need for a differential pair, thereby allowing more than two inputs to be compared for contrast in a single processing step. The circuit elements first smooth erroneous edges in the array through the use of a resistive network, then, the mean (scaled by an adjustable amount) of a pixel and its neighbors is compared to the harmonic mean of the same pixels to detect the presence of contrast within the pixel neighborhood. Comparison between the mean and harmonic mean allows the detection of contrast to be scale-invariant as long as the transistors remain in subthreshold operation. This circuit offers the massively parallel processing inherent to focal plane processing within an 18% fill factor in a 2 &mu;m process, 6.8 &mu;W typical power dissipation per element, and 0.67 ms response time at low power subthreshold operation. Results for a proof of concept, 8\times8 array of pixels with light inputs, as well as a purely electronic input, 4\times4 array are presented.
Computational geometry for sculpture
Authors: George W. Hart
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

This presentation illustrates examples of my geometric sculpture and o utlines certain design techniques. I apply methods from the field of computational geometry to the creation of forms which are aesthetic objects.I am a full- time sculptor creating works that manifest what I call the geometric aesthetic. This aesthetic celebrates the beauty of geometry and spatial rationality. I seek to produce novel forms which engage the viewer visually and have an underlying coherence based on symmetric three- dimensional mathematical structures. Internal relationships between the components of a sculpture can provide a depth to the work, leading the viewer to return again and again, each time seeing deeper into the piece. In addition, the viewer is led to ask questions of a mathematical nature about the patterns he or she finds.In the design of such sculpture, there are many issues of calculation to be addressed. I work constructively, assembling parts that are either common household objects or carefully formed abstract shapes. Exact lengths and angles must be worked out for these components to fit together appropriately. But there are also many free parameters that I may vary in seeking an ideal design.Physical models are sometimes sufficient, but often I write software to allow me to explore the design space of a sculpture. This makes me a user of computational geometry methods, applying appropriate techniques for each problem. However, unlike most computational geometers, my concerns are for an expedient result which I find aesthetically valid, rather than efficient general purpose algorithms. Iterative numerical methods are often satisfactory.Figures 1-11 illustrate a variety of recent works and references [1]-[13] provide some further details.
Incorporating tutorial strategies into an intelligent assistant
Authors: Jim R. Davies, Abigail S. Gertner, Neal Lesh, Charles Rich, Candace L. Sidner, Jeff Rickel
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

Computer tutors and intelligent software assistants have traditionally been thought of as different kinds of systems. However tutors and assistants share many properties. We have incorporated tutorial strategies into an intelligent assistant based on the COLLAGEN architecture. We are working on an agent, named Triton, which teaches and helps users with the graphical user interface of an air travel planning system. We found that the collaborative model underlying COLLAGEN is an excellent foundation for both an assistant and a tutor, and that both modes of interaction can be implemented in the same system with different parameter settings.
Another Method for Constructing t-EC/AUED Codes
Authors: Sulaiman Al-Bassam
Venue: IEEE Transactions on Computers (2000)

An improved method to construct $t$-EC/AUED ($t$ error-correcting and all unidirectional error detecting codes) is presented. In some cases, the new method improves the best known $t$-EC/AUED codes. Furthermore, the construction does not require complementation of codewords except the all zero and the all ones words.
Operating Systems: On overcoming high-priority paralysis in multiprogramming systems: a case history
Authors: David F. Stevens
Venue: Communications of the ACM (1968)

High-priority paralysis is the degradation that can occur in multiprogramming systems when scheduling is based primarily on preassigned priorities. It can be alleviated by modifying the scheduling algorithm to maximize the number of programs active at one time. The case history given in this paper indicates two general methods by which simultaneity can be increased. Possible refinements in the scheduling algorithm for future improvements are considered briefly.
An academic program providing realistic training in software engineering
Authors: Stavros N. Busenberg, Wing C. Tam
Venue: Communications of the ACM (1979)

An academic program at Harvey Mudd College, called the Clinic program, brings projects from industry on campus to be studied and solved by student teams. The objective of the Clinic is to provide students, working as small teams under careful faculty supervision, an opportunity to work on real world problems of sufficient magnitude and complexity. Under this program, students can acquire essential skills of software engineering, such as team work, software project management, software design methodology, and communication skills, in a realistic environment. Sample software projects undertaken by the Clinic are described. Experience so far has shown that the program is a viable transition from an academic to industrial world.
A geocast architecture for mobile cellular networks
Authors: Beongku An, Symeon Papavassiliou, Ali N. Akansu
Venue: Proceedings of NGC 2000 on Networked group communication (2000)

In this paper, we address the geocasting problem for cellular mobile networks. The crucial components to support geocasting services are, the geolocation mechanism, dispersion of the geolocation information, and geocast message routing and delivery. We present a cellular architecture to support geocasting with minimal overhead signaling, subject to the quality of service requirements of the particular geocast applications.
Simulation of the 3 dimensional cascade flow with numerical wind tunnel (NWT)
Authors: Takashi Nakamura, Toshiyuki Iwamiya, Masahiro Yoshida, Yuichi Matsuo, Masahiro Fukuda
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

The NWT was reinforced to get 280 GFLOPS of theoretical peak performance with the addition of 26 PEs to the original 140 PEs. On a CFD simulation of jet engine compressor, we attained active performance speed of 111 GFLOPS using 160 PEs.
Spectral Analysis of Fokker--Planck and Related Operators Arising From Linear Stochastic Differential Equations
Authors: Daniel Liberzon, Roger W. Brockett
Venue: SIAM Journal on Control and Optimization (2000)

We study spectral properties of certain families of linear second-order differential operators arising from linear stochastic differential equations. We construct a basis in the Hilbert space of square-integrable functions using modified Hermite polynomials, and obtain a representation for these operators from which their eigenvalues and eigenfunctions can be computed. In particular, we completely describe the spectrum of the Fokker--Planck operator on an appropriate invariant subspace of rapidly decaying functions. The eigenvalues of the Fokker--Planck operator provide information about the speed of convergence of the corresponding probability distribution to steady state, which is important for stochastic estimation and control applications. We show that the operator families under consideration can be realized as solutions of differential equations in the double bracket form on an operator Lie algebra, which leads to a simple expression for the flow of their eigenfunctions.