ppxscal/embedding_network huggingface dataset:
Providing a differentiated quality of service in a World Wide Web server
Authors: Nikolaos Vasiliou, Hanan Lutfiyya
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

This paper presents a strategy of extending a Web server to be able to differentiate between requests in different classes. This is required because most Web servers are unable to do this by themselves. We present our strategy and its design along with some initial performance results.
Accordion summarization for end-game browsing on PDAs and cellular phones
Authors: Orkut Buyukkokten, Hector Garcia-Molina, Andreas Paepcke
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

We demonstrate a new browsing technique for devices with small displays such as PDAs or cellular phones. We concentrate on end-game browsing, where the user is close to or on the target page. We make browsing more efficient and easier by Accordion Summarization. In this technique the Web page is first represented as a short summary. The user can then drill down to discover relevant parts of the page. If desired, keywords can be highlighted and exposed automatically. We discuss our techniques, architecture, interface facilities, and the result of user evaluations. We measured a 57% improvement in browsing speed and 75% reduction in input effort.
Morphable Surface Models
Authors: Christian R. Shelton
Venue: International Journal of Computer Vision (2000)

We describe a novel automatic technique for finding a dense correspondence between a pair of n-dimensional surfaces with arbitrary topologies. This method employs a different formulation than previous correspondence algorithms (such as optical flow) and includes images as a special case. We use this correspondence algorithm to build Morphable Surface Models (an extension of Morphable Models) from examples. We present a method for matching the model to new surfaces and demonstrate their use for analysis, synthesis, and clustering.
Remark on Romberg quadrature
Authors: A. M. Krasun, W. Prager
Venue: Communications of the ACM (1965)

A modified form of Romberg quadrature is described, which is less sensitive to the accumulation of rounding errors than the customary one.
Achieving 550 MHz in an ASIC methodology
Authors: D. G. Chinnery, B. Nikolic, K. Keutzer
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

Typically, good automated ASIC designs may be two to five times slower than handcrafted custom designs. At last year's DAC this was examined and causes of the speed gap between custom circuits and ASICs were identified. In particular, faster custom speeds are achieved by a combination of factors: good architecture with well-balanced pipelines; compact logic design; timing overhead minimization; careful floorplanning, partitioning and placement; dynamic logic; post-layout transistor and wire sizing; and speed binning of chips. Closing the speed gap requires improving these same factors in ASICs, as far as possible. In this paper we examine a practical example of how these factors may be improved in ASICs. In particular we show how techniques commonly found in custom design were applied to design a high-speed 550 MHz disk drive read channel in an ASIC design flow.
Experience report: using RESOLVE/C++ for commercial software
Authors: Joseph E. Hollingsworth, Lori Blankenship, Bruce W. Weide
Venue: ACM SIGSOFT Software Engineering Notes (2000)

Academic research sometimes suffers from the &ldquo;ivory tower&rdquo; problem: ideas that sound good in theory do not necessarily work well in practice. An example of research that potentially could impact practice over the next few years is a novel set of component-based software engineering design principles, known as the RESOLVE discipline. This discipline has been taught to students for several years [23], and previous papers (e.g., [24]) have reported on student-sized software projects constructed using it. Here, we report on a substantial commercial product family that was engineered using the same principles &mdash; an application that we designed, built, and continue to maintain for profit, not as part of a research project. We discuss the impact of adhering to a very prescriptive set of design principles and explain our experience with the resulting applications. Lessons learned should benefit others who might be considering adopting such a component-based software engineering discipline in the future.
Quo Vadimus: computer science in a decade
Authors: J. F. Traub
Venue: Communications of the ACM (1981)

A panel discussion was held during the third biennial meeting of chairmen of Ph.D.-granting computer science departments in June, 1978 at Snowbird, Utah, a meeting sponsored by the Computer Science Board. Invitees from industry and government were also present. A report was prepared from tapes made of the discussion (Department of Computer Science, Carnegie-Mellon University: Report #CMU-CS-80-127, June 1980). It contained all the prepared statements of the panelists, lightly edited, and the panelists' discussion in its entirety. A selection of the audience discussion was also included, rather heavily edited. The following presentation is derived from that report.
Analysis of boundary representation model rectification
Authors: Guoling Shen, Takis Sakkalis, Nicholas Patrikalakis
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

Defects in boundary representation models often lead to system errors in modeling software and associated applications. This paper analyzes the model rectification problem of manifold boundary models, and argues that a rectify-by-reconstruction approach is needed in order to reach the global optimal solution. The restricted face boundary reconstruction problem is shown to be NP-hard. Based on this, the solid boundary reconstruction problem is also shown to be NP-hard.
An Approximation Theory for Strongly Stabilizing Solutions to the Operator LQ Riccati Equation
Authors: J. C. Oostveen, R. F. Curtain, K. Ito
Venue: SIAM Journal on Control and Optimization (2000)

The linear-quadratic (LQ) control problem is considered for a class of infinite-dimensional systems with bounded input and output operators, that are not exponentially stabilizable, but only strongly stabilizable. A sufficient condition for the existence of a minimizing control and of a stabilizing solution to the associated LQ Riccati equation is given. The main contribution of this paper is the convergence of the stabilizing solutions of a sequence of finite-dimensional Riccati equations to the strongly stabilizing solution of the infinite-dimensional Riccati equation. The result is applied to a model of propagation of sound waves in a one-dimensional wave-guide.
Fast and simple character classes and bounded gaps pattern matching, with application to protein searching
Authors: Gonzalo Navarro, Mathieu Raffinot
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

The problem of fast searching of a pattern that contains Classes of characters and Bounded size Gaps (CBG) in a text has a wide range of applications, among which a very important one is protein pattern matching (for instance, one PROSITE protein site is associated with the CBG [RK] &mdash; x(2, 3) &mdash; [DE] &mdash; x(2, 3) &mdash; Y, where the brackets match any of the letters inside, and x(2, 3) a gap of length between 2 and 3). Currently, the only way to search a CBG in a text is to convert it into a full regular expression (RE). However, a RE is more sophisticated than a CBG, and searching it with a RE pattern matching algorithm complicates the search and makes it slow. This is the reason why we design in this article two new practical CBG matching algorithms that are much simpler and faster than all the RE search techniques. The first one looks exactly once at each text character. The second one does not need to consider all the text characters and hence it is usually faster than the first one, but in bad cases may have to read the same text character more than once. We then propose a criterion based on the form of the CBG to choose a-priori the fastest between both. We performed many practical experiments using the PROSITE database, and all them show that our algorithms are the fastest in virtually all cases.
On the number of congruent simplices in a point
Authors: Pankaj K. Agarwal, Micha Sharir
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

We derive improved bounds on the number of k-dimensional simplices spa nned by a set of n points in $\reals^d$ that are congruent to a given $k$-simplex, for $k\le d-1$. Let $f_k^{(d)} (n)$ be the maximum number of $k$-simplices spanned by a set of $n$ points in $\reals^d$ that are congruent to a given $k$-simplex. We prove that $f_2^{(3)}(n) = O(n^{5/3}\cdot 2^{O(\alpha^2(n))})$, $f_2^{(4)} (n) = O(n^{2+\eps})$, $f_2^{(5)} (n) = \Theta(n^{7/3})$, and $f_3^{(4)} (n) = O(n^{9/4+\eps})$. We also derive a recurrence to bound $f_k^{(d)} (n)$ for arbitrary values of $k$ and $d$, and use it to derive the bound $f_k^{(d)} (n) = O(n^{d/2})$ for $d \le 7$ and $k \le d-2$. Following Erd{\H o}s and Purdy, we conjecture that this bound holds for larger values of $d$ as well, and for $k\le d-2$.
First-Order System Least-Squares for the Helmholtz Equation
Authors: B. Lee, T. A. Manteuffel, S. F. McCormick, J. Ruge
Venue: SIAM Journal on Scientific Computing (1999)

This paper develops a multilevel least-squares approach for the numerical solution of the complex scalar exterior Helmholtz equation. This second-order equation is first recast into an equivalent first-order system by introducing several "field" variables. A combination of scaled L2 and H-1 norms is then applied to the residual of this system to create a least-squares functional. It is shown that, in an appropriate Hilbert space, the homogeneous part of this functional is equivalent to a squared graph norm, that is, a product norm on the space of individual variables. This equivalence to a norm that decouples the variables means that standard finite element discretization techniques and standard multigrid solvers can be applied to obtain optimal performance. However, this equivalence is not uniform in the wavenumber k, which can signal degrading performance of the numerical solution process as k increases. To counter this difficulty, we obtain a result that characterizes the error components causing performance degradation. We do this by defining a finite-dimensional subspace of these components on whose orthogonal complement k-uniform equivalence is proved for this functional and an analogous functional that is based only on L2 norms. This subspace equivalence motivates a nonstandard multigrid method that attempts to achieve optimal convergence uniformly in k. We report on numerical experiments that empirically confirm k-uniform optimal performance of this multigrid solver. We also report on tests of the error in our discretization that seem to confirm optimal accuracy that is free of the so-called pollution effect.
Parallel Computation of Wavelet Transforms Using the Lifting Scheme
Authors: Patricia González, José C. Cabaleiro, Tomás F. Pena
Venue: The Journal of Supercomputing (2001)

The lifting scheme &lsqb;14&rsqb; is a method for construction of biorthogonal wavelets and fast computation of the corresponding wavelet transforms. This paper describes a message&ndash;passing parallel implementation in which high efficiency is achieved by a modified data&ndash;swapping approach allowing communications to overlap computations. The method illustrated by application to Haar and Daubechies (D4) wavelets. Timing and speed&ndash;up results for the Cray T3E and the Fujitsu AP3000 are presented.
A CMOS Voltage to Current Converter for Low Voltage Applications
Authors: Donald T. Comer, David J. Comer
Venue: Analog Integrated Circuits and Signal Processing (2001)

This correspondence introduces two circuit ideas which are applied to the design of a voltage to current converter circuit for application in analog CMOS circuits. The ideas are aimed at achieving an output current which is set by a precision reference voltage and achieving a high output impedance without the use of a cascode connection. The resulting circuit achieves a fast settling time and requires a minimum bias headroom voltage, making it suitable for use in low voltage battery-powered designs.
Fast recovery of evolutionary trees with thousands of nodes
Authors: Miklós Csőrős
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2) time using O(n) working space. In the general Markov model of evolution the algorithm recovers the topology successfully with (1 &mdash; &Ogr;(1)) probability from sequences with polynomial length in n. Moreover, for almost all trees, our algorithm achieves the same success probability on polylogarithmic sample sizes. The theoretical results are supported by simulation experiments involving trees with 500, 1895, and 3135 leaves. The topologies of the trees are recovered with high success from 2000 bp DNA sequences.
Assembly programming on a virtual computer
Authors: Pierre A. von Kaenel
Venue: Journal of Computing Sciences in Colleges (2001)

This paper introduces the VPC Assembler, a Windows 95/98 assembly programming environment that targets the Virtual PC, a simulator of a small computer system based on the Intel 8086 architecture [1]. The assembler provides an editor, a debugger, and views of the assembly program&AElig;s variables, the CPU&AElig;s registers, and the Virtual PC&AElig;s output. The VPC Assembler was designed as a learning tool for courses that introduce assembly programming or for courses, such as computer architecture or organization, that briefly cover the fundamentals of assembly.
Bounds for Codes Identifying Vertices in the Hexagonal Grid
Authors: Gérard D. Cohen, Iiro Honkala, Antoine Lobstein, Gilles Zémor
Venue: SIAM Journal on Discrete Mathematics (2000)

In an undirected graph G=(V,E), a subset $C \subseteq V$ is called an identifying code if the sets $B_1(v) \cap C$ consisting of all elements of C within distance one from the vertex v are nonempty and different. We take G to be the infinite hexagonal grid and show that the density of any identifying code is at least 16/39 and that there is an identifying code of density 3/7.
Issues with using Ravenscar and the Ada distributed systems annex for high-integrity systems
Authors: Neil Audsley, Andy Wellings
Venue: ACM SIGAda Ada Letters (2001)

The Distributed Systems Annex (DSA) was designed for general-purpose distributed systems programming. This paper explores the practical use of the DSA in terms of high-integrity real-time distributed systems. In particular, it defines a high-integrity subset of the DSA and considers how such a subset can be implemented using SPARK and Ravenscar.
On proxy agents, mobility, and web access
Authors: Anupam Joshi
Venue: Mobile Networks and Applications (2000)

With the emerging need for ubiquitous access to information, web access from mobile clients is gaining increasing importance. Unfortunately, the underlying protocols of the web are not designed to support operations from a resource poor platform in a low bandwidth, disconnection prone environment. Efforts to create systems to support mobile browsing have typically been proxy&dash;based. However, such solutions have recently been criticized due to their non&dash;scalability. Developments in ad hoc networking also threaten the viability of proxy&dash;based approaches. In this paper, we critically examine the proxy&dash;based approach and its place in mobile access to the web in particular, and networked multimedia information in general. We argue for a hybrid approach that uses both proxy&dash;based and end&ndash;end techniques as appropriate, suggest when each is more appropriate, and present a preliminary implementation.
An executive system implemented as a finite-state automaton
Authors: Roy E. Heistand
Venue: Communications of the ACM (1964)

The 473L command and control system used by the Air Force permits many operators to access large data files through the use of a computer. The man-machine interface is satisfied by several communication consoles from which operators may enter queries and view replies. A data link permits remote stations to send messages, status reports and inventories directly to the computer. The information received over the online data link is used to update the data files which are stored on disk. The 473L programming system is divided into an Executive Control Program and five components with different processing priorities. These priorities permit the system to be most sensitive to the console inputs and permit the operators at all the consoles to time share the central processor. The Executive Control Program provides for the orderly transitions of control among the programming system components. The major emphasis of the paper is on the technique of using the definition of a finite-state automaton for organizing the Executive Control Program.
Rejuvenating experimental computer science: a report to the National Science Foundation and others
Authors: Jerome A. Feldman, William R. Sutherland
Venue: Communications of the ACM (1979)

This report is based on the results of an NSF sponsored workshop held in Washington, D.C. on November 2, 1978. The co-authors of the report are: Gordon Bell, Digital Equipment Corporation; Bernard A. Galler, University of Michigan; Patricia Goldberg, IBM Corporation; John Hamblen, University of Missouri at Rolla; Elliot Pinson, Bell Telephone Laboratories; and Ivan Sutherland, California Institute of Technology. Also participating in the workshop were representatives of NSF and other government agencies. In addition to the authors, a number of other people have contributed to the contents of this report. In preparation for the original workshop, all doctorate-granting computer science departments in the nation were asked for comments and suggestions on the problems of experimental computer science. A version of the current report dated January 15 was circulated to these departments and to a number of industrial and government groups for criticism. The editors and authors of this final version gratefully acknowledge the contribution of a large number of other people at all stages in the preparation of the report. [Note: Following this presentation of the report, there is a position paper on the crisis in experimental computer science written by the ACM Executive Committee.]
Code extension in ASCII
Authors: S. Gorn
Venue: Communications of the ACM (1966)

The American Standard Code for Information Interchange (ASCII) contains a number of control characters associated with the principle of code extension, that is, with the representation of information which cannot be directly represented by means of the characters in the Code. The manner of use of these characters has not previously been completely described. This paper presents a set of mutually consistent philosophies regarding code extension applications, and suggests a corollary set of doctrines for the application of the code extension characters. Distinctions are drawn between code extension and such other concepts as &ldquo;graphic substitution&rdquo; or &ldquo;syntactic representation&rdquo; which are often used to meet similar requirements. Also covered are certain topics which are not truly concerned with code extension but which are often linked with it in discussion on code applications. The material in this paper is equally applicable in principle to the (proposed) ISO international 7-bit code for information interchange.
Detection, analysis and rendering of audience reactions in distributed multimedia performance
Authors: Nikitas M. Sgouros
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

Recent advances in distributed multimedia technologies encourage the development of interactive performance systems. These systems allow multiple users to take part in a performance either as players or spectators and influence its development in real time. However, in order for these applications to become effective they have to provide meaningful interaction capabilities and adequate means of expression to all the participants. This research provide an interaction framework that seeks to address these requirements. In particular, the system allows players and spectators to exchange messages during the performance. These messages describe player actions and audience reactions. Furthermore, the framework monitors the development of the event and analyzes the behavior of the participants in order to: (i) detect and render shared audience reactions (ii) achieve a high degree of audience engagement. Finally, the system synchronizes the presentation of audience reactions with performance developments at each site. This method has been applied in MISSION, a multi-player game on the Web.
Achieving per-flow fair rate allocation in Diffserv
Authors: Na Li, Marissa Borrego, San-Qi Li
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2001)

This article addresses the fundamental issue of providing per-flow fairness. In particular, it focuses on fairness within the Diffserv framework. We propose the Fair Allocation Derivative Estimation (FADE) algorithm for estimating flow fair share in the absence of per-flow information. FADE calculates fair share feedback using a modified quasi-Newton method. This efficient method for estimating fair share provides a more precise model than other existing fairness estimation approaches. As such, it is able to more accurately estimate fair share and quickly converge to the proper rate. The simulation compares FADE to other proposals. The results demonstrate the overall effectiveness of the algorithm.
A proposal for a computer-based interactive scientific community
Authors: David Pager
Venue: Communications of the ACM (1972)

Because of the problems created by the explosion of papers in the mathematical sciences and the drawbacks that this places on research, it is suggested that a tree of all mathematical results and terminology be maintained in a multiterminal computer system. Users of the system can store in the computer an updated file of their current knowledge, and on selecting a paper to read, they can obtain from the computer the minimum subtree of theorems required to bring them from what they already know to the background knowledge which the paper assumes. Under certain conditions, means are also provided for the contribution of useful comments by the readers of a work and for interaction between commentators and with the author. This paper describes how the system can be organized and the role required of readers, writers, and commentators.