ppxscal/embedding_network huggingface dataset:
The LATEX legacy: 2.09 and all that
Authors: Chris Rowley
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

The second edition of The Manual [23] begins: `LATEX is a system for typesetting documents. Its first widely available version, mysteriously numbered 2.09, appeared in 1985.' It is too early for a complete critical assessment of the impact of LATEX 2.09 because its world-wide effects on many aspects of many cultures, not least scientific publication, remain strong after 15 years&mdash;and that itself is significant in a technological world where a mere 15 months of fame can make and break an idea. Therefore this paper provides simply a review and evaluation of the relationship between TEX, LATEX and some of the major technical developments in the world of quality automated formatting since the publication of LATEX 2.09 in 1985. It is is neither definitive nor comprehensive but I hope it is informative.
Toward friendly user MIS implementation
Authors: Gerardine DeSanctis, James F. Courtney
Venue: Communications of the ACM (1983)

Recent management information systems (MIS) and computer science literature advocates the development of &ldquo;user-friendly&rdquo; systems as a means of overcoming implementation problems. However, implementation research suggests that it is not enough that the technology be friendly to the user. The user must also be friendly to the system. In formulating solutions to implementation problems, the field of organization development (OD) may serve as a knowledge base for practitoners and researchers. OD and MIS share common goals, common theoretical foundations, and common problems. Consequently, OD techniques may be useful in alleviating certain behavioral problems encountered in MIS implementation. OD concepts and techniques such as planned organizational change, survey feedback, group diagnostic meetings, communication training, role negotiation, and training labs may be used when implementing or changing systems. The premise is that use of these measures will lead to more successful MIS projects.
Orderings for Factorized Sparse Approximate Inverse Preconditioners
Authors: Michele Benzi, Miroslav Tuma
Venue: SIAM Journal on Scientific Computing (1999)

The influence of reorderings on the performance of factorized sparse approximate inverse preconditioners is considered. Some theoretical results on the effect of orderings on the fill-in and decay behavior of the inverse factors of a sparse matrix are presented. It is shown experimentally that certain reorderings, like minimum degree and nested dissection, can be very beneficial. The benefit consists of a reduction in the storage and time required for constructing the preconditioner, and of faster convergence of the preconditioned iteration in many cases of practical interest.
Two-dimensional substring indexing
Authors: Paolo Ferragina, Nick Koudas, Divesh Srivastava, S. Muthukrishnan
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

As databases have expanded in scope to storing string data (XML documents, product catalogs), it has become increasingly important to search databases based on matching substrings, often on multiple, correlated dimensions. While string B-trees are I/O optimal in one dimension, no index structure with non-trivial query bounds is known for two-dimensional substring indexing. In this paper, we present a technique for two-dimensional substring indexing based on a reduction to the geometric problem of identifying common colors in two ranges containing colored points. We develop an I/O efficient algorithm for solving the common colors problem, and use it to obtain an I/O efficient (poly-logarithmic query time) algorithm for the two-dimensional substring indexing problem. Our techniques result in a family of secondary memory index structures that trade space for time, with no loss of accuracy. We show how our technique can be practically realized using a combination of string B-trees and R-trees.
Three-layer bubble-sorting-based nonManhattan channel routing
Authors: Jin-Tai Yan
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2000)

It is well known that a nonManhattan channel router can use fewer routing tracks, and is never worse than a Manhattan router in a channel. To my knowledge, a three-layer bubble-sorting-based nonManhattan channel routing problem is always solved by the solution in a two-layer bubble-sorintg-based nonManhattan channel routing problem. Recently, an O(kn2) heuristic algorithm [Chaudhary et al. 1991] and an O(kn2) optimal algorithm [Chen et al. 1994] have been proposed, where k is the number of two-layer routing tracks and n is the number of terminals in a bubble-sorintg-based nonManhattan channel. In this paper we propose an optimal three-layer bubble-sorintg-based nonManhattan routing algorithm to minimize the number of three-layer routing tracks. Furthermore, the time complexity of theis optimal algorithm is proven to be in O(hn) time, where h is the number of three-layer routing tracks and n is the number of terminals in a bubble-sorting-based nonManhattan channel.
Migrating Autonomous Objects in a WAN Environment
Authors: Natalija Krivokapić, Markus Islinger, Alfons Kemper
Venue: Journal of Intelligent Information Systems (2000)

Along with the fast progress the interconnection of computer systems makes the need for enterprise-wide distributed solutions grows. These systems have to support hundreds or even thousands of sites located all over the world. The distances between the sites will impose high communication costs on distributed activities thus significantly increasing their response times. This problem can be alleviated through migrating objects to the sites where they are needed. However, migration in such systems cannot be managed globally. Therefore, we present a migration protocol for (autonomous) objects which enables them autonomously to decide whether or not and which site to migrate to, thus making the system self-tuning. We also present two migration strategies objects can use to derive their migration decisions. The first one finds the optimal placement for an object while the second strategy in some cases returns a sub-optimal location but induces lower computation costs. The two strategies are evaluated through benchmarks in a distributed system of autonomous objects. The experiments show a significant decrease in communication costs when migration is employed.
Similarity-based retrieval of temporal documents
Authors: Prakash Yamuna, K. Selçuk Candan
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

In this paper, we describe a similarity-based retrieval framework that addresses the challenges associated with the temporal nature of multimedia documents. Multimedia documents consist of multiple media objects and a set of specifications (eg. temporal) that tie these objects together. Therefore, we describe similarity/dissimilarity measures that aim to capture document authors' intensions. We use a prioritized constraint-based framework to evaluate these measures. We also develop algorithms that efficiently compute these measures for special cases.
Weighted derivation trees
Authors: Michael C. Loui
Venue: Communications of the ACM (1976)

The nodes of a weighted derivation tree are associated with weighting functions over the vocabulary of a context-free grammar. An algorithm is presented for constructing the optimal derivation tree having the same structure as a given weighted derivation tree. In addition, the correctness of the algorithm is established. The method may be applied to problems involving probabilistic parsing or combinatorial optimization.
Beyond the red brick wall (panel): challenges and solutions in 50nm physical design
Authors: Hidetoshi Onodera, Andrew B. Kahng, Wayne W.-M. Dai, Sani R. Nassif, Juho Kim, Akira Tanabe, Toshihiro Hattori
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Aggressive technology scaling will push us into a 50nm regime within a decade. Most entries in current ITRS for the technology node are painted out in red, indicating "No know solutions". In the physical implementation domain, we are facing severe challenges in various aspects such as interconnect performance degradation, signal integrity, reliability, manufacturing variability, etc. These challenges will continue to grow for the future. In this panel, our panelists will present their own view of the most difficult challenges in the 50nm regime, and possible solutions to break through the red brick wall as well, followed by a live discussion on the approaches we should take for successful 50nm physical implementation.
A decision matrix as the basis for a simple data input routine
Authors: G. J. Vasilakos
Venue: Communications of the ACM (1962)

Currently a great deal of time and effort is being spent on the development of bigger and better compiler languages, multiprogram executive systems, etc. Since the implementation of of new methods and procedures is not instantaneous, but rather occurs by an evolutionary process, we should be concerned also with the problem of maintaining, improving and incorporating new ideas into existing systems. It is with this somewhat neglected area that the author is interested. A method employing a decision matrix is presented for the handling of a standard systems programming problem, that of providing a data input routine.
Thread-level parallelism and interactive performance of desktop applications
Authors: Krisztián Flautner, Rich Uhlig, Steve Reinhardt, Trevor Mudge
Venue: ACM SIGPLAN Notices (2000)

Multiprocessing is already prevalent in servers where multiple clients present an obvious source of thread-level parallelism. However, the case for multiprocessing is less clear for desktop applications. Nevertheless, architects are designing processors that count on the availability of thread-level parallelism. Unlike server workloads, the primary requirement of interactive applications is to respond to user events under human perception bounds rather than to maximize end-to-end throughput. In this paper we report on the thread-level parallelism and interactive response time of a variety of desktop applications. By tracking the communication between tasks, we can focus our measurements on the portions of the benchmark's execution that have the greatest impact on the user. We find that running our benchmarks on a dual-processor machine improves response time of mouse-click events by as much as 36%, and 22% on average---out of a maximum possible 50%. The benefits of multiprocessing are even more apparent when background tasks are considered. In our experiments, running a simple MP3 playback program in the background increases response time by 14% on a uniprocessor while it only increases the response time on a dual processor by 4%. When response times are fast enough for further improvements to be imperceptible, the increased idle time after interactive episodes could be exploited to build systems that are more power efficient.
Scheduling time-constrained instructions on pipelined processors
Authors: Allen Leung, Krishna V. Palem, Amir Pnueli
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2001)

In this work we investigate the problem of scheduling instructions on idealized microprocessors with multiple pipelines, in the presence of precedence constraints, release-times, deadlines, and latency constraints. A latency of lij specifies that there must be at least lij time-steps between the completion time of instruction i and the start time of instruction j. A latency of lij=&minus;1 can be used to specify that j may be scheduled concurrently with i but not earlier. We present a generic algorithm that runs in O(n2logn&agr;(n)+ne) time, given n instructions and e edges in the precedence DAG, where &agr;(n) is the functional inverse of the Ackermann function. Our algorithm can be used to construct feasible schedules for various classes of instances, including instances with the following configurations: (1) one pipeline, with individual release-times and deadlines and where the latencies between instructions are restricted to 0 and 1; (2) m pipelines, with individual release-times and deadlines, and monotone-interval order precedences; (3) two pipelines with latencies of &minus;1 or 0, and release-times and deadlines; (4) one pipeline, latencies of 0 or 1 and individual processing times that are at least one; (5) m pipelines, intree precedences, constant latencies, and deadlines; (6) m pipelines, outtree precedences, constant latencies, and release-times. For instances with deadlines, optimal schedules that minimize the maximal tardiness can be constructed using binary search, in O(log n) iterations of our algorithm. We obtain our results using backward scheduling, a very general relaxation method, which extends, unifies, and clarifies many previous results on instruction scheduling for pipelined and parallel machines.
Unirational fields of transcendence degree one and functional decomposition
Authors: Jamie Gutierrez, Rosario Rubio, David Sevilla
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

In this paper we present an algorithm to compute all unirational fields of transcendence degree one, containing a given finite set of multivariate rational functions. In particular, we provide an algorithm to decompose a multivariate rational function f of the form f = g(h), where g is univariate rational function and h a multivariate one.
Extracting library-based object-oriented applications
Authors: Peter F. Sweeney, Frank Tip
Venue: ACM SIGSOFT Software Engineering Notes (2000)

In an increasingly popular model of software distribution, software is developed in one computing environment and deployed in other environments by transfer over the internet. Extraction tools perform a static whole-program analysis to determine unused functionality in applications in order to reduce the time required to download applications. We have identified a number of scenarios where extraction tools require information beyond what can be inferred through static analysis: software distributions other than complete applications, the use of reflection, and situations where an application uses separately developed class libraries. This paper explores these issues, and introduces a modular specification language for expressing the information required for extraction. We implemented this language in the context of Jax, an industrial-strength application extractor for Java, and present a small case study in which different extraction scenarios are applied to a commercially available library-based application.
Ignoring perfect knowledge in-the-world for imperfect knowledge in-the-head
Authors: Wayne D. Gray, Wai-Tat Fu
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Memory can be internal or external - knowledge in-the-world or knowledge in-the-head. Making needed information available in an interface may seem the perfect alternative to relying on imperfect memory. However, the rational analysis framework (Anderson, 1990) suggests that least-effort tradeoffs may lead to imperfect performance even when perfect knowledge in-the-world is readily available. The implications of rational analysis for interactive behavior are investigated in two experiments. In experiment 1 we varied the perceptual-motor effort of accessing knowledge in-the-world as well as the cognitive effort of retrieving items from memory. In experiment 2 we replicated one of the experiment 1 conditions to collect eye movement data. The results suggest that milliseconds matter. Least-effort tradeoffs are adopted even when the absolute difference in effort between a perceptual-motor versus a memory strategy is small, and even when adopting a memory strategy results in a higher error rate and lower performance.
Information Retrieval: Recovery of disk contents after system failure
Authors: Peter C. Lockemann, W. Dale Knutsen
Venue: Communications of the ACM (1968)

A method is discussed by which, after a system malfunction, the contents of disk files can be restored to their status at the time of the failure.
Sphere packings and generative
Authors: Thomas C. Hales
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

In 1998, the oldest problem in discrete geometry, the 400-year old Kep ler conjecture, was solved. The conjecture asserts that the familiar cannonball packing of balls achieves the greatest density of any possible packing. The proof of the conjecture was unusually long, requiring nearly 300 pages of careful reasoning, 3 gigabytes of stored data, and 40,000 lines of specialized computer code. The computer verifications required for the proof were carried out over a period of years.This lecture will propose a new, vastly simplified, intuitive solution of the Kepler conjecture based on ideas from the field of generative programming.
Algorithm design by successive transformation
Authors: Norman Neff
Venue: Journal of Computing Sciences in Colleges (2001)

Algorithms courses are typically organized either by application area or by design technique. Each of these organizations has its strength, but neither effectively reflects the fact that sophisticated algorithms are not designed in a single pass. This paper describes and gives an example of the strategy of successive transformation, in which a sequence of algorithms is generated to solve a single problem. Design of algorithms by successive transformation requires more time per problem, since each problem requires multiple phases of analysis. To the extent that this method is used, the breadth of the course in terms of areas and algorithms is reduced. However, we assert that at least a few such experiences are indispensable, because such painstaking analysis is representative of algorithm design as it really is, and because successive transformation is an excellent way to show students the power of theory to improve applications.
I/O-efficient algorithms for graphs of bounded treewidth
Authors: Anil Maheshwari, Norbert Zeh
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We present I/O-efficient algorithms for the single source shortest path problem and NP-hard problems on graphs of bounded treewidth. The main step in these algorithms is a method to compute a tree-decomposition for the given graph I/O-efficiently.
A Nonlinear Multigrid Solver for a Semi-Lagrangian Potential Vorticity-Based Shallow-Water Model on the Sphere
Authors: John W. Ruge, Yong Li, Steve McCormick, Achi Brandt, J. R. Bates
Venue: SIAM Journal on Scientific Computing (1999)

In an earlier paper, we developed a new formulation of the shallow-water equations on the sphere, based on the semi-Lagrangian advection of potential vorticity. An important feature of our two-time-level model is that forward extrapolation of the nonlinear terms is avoided. In this paper, we develop a multigrid algorithm for solving the resulting system of three coupled nonlinear equations. We include a discussion of basic multigrid methods, along with some more advanced techniques required for the development of the multigrid scheme for this system. Results are presented showing that usual optimal multigrid efficiency is obtained.
Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
Authors: Xiaoling Sun, Duan Li
Venue: Mathematics of Operations Research (2000)

A logarithmic-exponential dual formulation is proposed in this paper for bounded integer programming problems. This new dual formulation possesses an asymptotic strong duality property and guarantees the identification of an optimal solution of the primal problem. These prominent features are achieved by exploring a novel nonlinear Lagrangian function, deriving an asymptotic zero duality gap, investigating the unimodality of the associated dual function and ensuring the primal feasibility of optimal solutions in the dual formulation. One other feature of the logarithmicexponential dual formulation is that no actual dual search is needed when parameters are set above certain threshold-values.
AgentSalon: facilitating face-to-face knowledge exchange through conversations among personal agents
Authors: Yasuyuki Sumi, Kenji Mase
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper presents a system called AgentSalon, which facilitates face-to-face knowledge exchange and discussion by people having shared interests, in museums, schools, offices, academic conferences, etc. This system was designed as a sub-system of our ongoing project to construct a personal agent system for tour guidance and knowledge sharing among users. AgentSalon has a big screen for two to five users. The screen shows conversations among animated agents belonging to the users. The personal agent usually runs on our mobile guidance system, called PalmGuide, and guides its user according to his/her individual interests and touring records. When users connect their PalmGuides with AgentSalon by infrared, their personal agents with their personal information migrate to AgentSalon and engage in automated conversation. Contents of the conversation include opinion exchange about tour experiences, mutual recommendations of exhibits on behalf of the users, etc. By observing a chat of the agents, users can effectively obtain appropriate topics: that is, tempts them to follow the chat. This paper shows the first prototype of AgentSalon provided to participants in an academic conference.
Is this a quadrisected mesh?
Authors: Gabriel Taubin
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

In this paper we introduce a fast and efficient linear time and space algorithm to detect and reconstruct uniform Loop subdivision structure, or triangle quadrisection, in irregular triangular meshes. Instead of a naive sequential traversal algorithm, and motivated by the concept of covering surface in Algebraic Topology, we introduce a new algorithm based on global connectivity properties of the covering mesh. We consider two main applications for this algorithm. The first one is to enable interactive modelling systems that support Loop subdivision surfaces, to use popular interchange file formats which do not preserve the subdivision structure, such as VRML, without loss at information. The second application is to improve the compression efficiency of existing lossless connectivity compression schemes, by optimally compressing meshes with Loop subdivision connectivity. Extensions to other popular uniform subdivision schemes such as Catmull-Clark and Doo-Sabin, are relatively straightforward but will be studied elsewhere.
Scale effects in steering law tasks
Authors: Johnny Accot, Shumin Zhai
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Interaction tasks on a computer screen can technically be scaled to a much larger or much smaller sized input control area by adjusting the input device's control gain or the control-display (C-D) ratio. However, human performance as a function of movement scale is not a well concluded topic. This study introduces a new task paradigm to study the scale effect in the framework of the steering law. The results confirmed a U-shaped performance-scale function and rejected straight-line or no-effect hypotheses in the literature. We found a significant scale effect in path steering performance, although its impact was less than that of the steering law's index of difficulty. We analyzed the scale effects in two plausible causes: movement joints shift and motor precision limitation. The theoretical implications of the scale effects to the validity of the steering law, and the practical implications of input device size and zooming functions are discussed in the paper.