ppxscal/embedding_network huggingface dataset:
Application performance in the QLinux multimedia operating system
Authors: Vijay Sundaram, Abhishek Chandra, Pawan Goyal, Prashant Shenoy, Jasleen Sahni, Harrick Vin
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

In this paper, we argue that conventional operating systems need to be enhanced with predictable resource management mechanisms to meet the diverse performance requirements of emerging multimedia and web applications. We present QLinux&mdash;a multimedia operating system based on the Linux kernel that meets this requirement. QLinux employs hierarchical schedulers for fair, predictable allocation of processor, disk and network bandwidth, and accounting mechanisms for appropriate charging of resource usage. We experimentally evaluate the efficacy of these mechanisms using benchmarks and real-world applications. Our experimental results show that (i) emerging applications can indeed benefit from predictable allocation of resources, and (ii) the overheads imposed by the resource allocation mechanisms in QLinux are small. For instance, we show that the QLinux CPU scheduler can provide predictable performance guarantees to applications such as web servers and MPEG players, albeit at the expense of increasing the scheduling overhead. We conclude from our experiments that the benefits due to the resource management mechanisms in QLinux outweigh their increased overheads, making them a practical choice for conventional operating systems.
Updating a master file&mdash;yet one more time
Authors: J. Inglis
Venue: Communications of the ACM (1981)

For several years I have been teaching a file updating algorithm which is essentially the same as that in Dwyer's admirable paper [1]. There is one unjustified objection to the algorithm that perceptive students and people with batch processing experience almost invariably raise and which is not addressed by Dwyer. The objection is based on a situation which arises in a batch processing environment with several users, where key-ordered sequential update is used.
Synchronous Bandwidth Allocation for Real-Time Communications with the Timed-Token MAC Protocol
Authors: Ching-Chih Han, Kang G. Shin, Chao-Ju Hou
Venue: IEEE Transactions on Computers (2001)

One of the key issues in tailoring the timed-token MAC protocol for real-time applications is synchronous bandwidth allocation (SBA), whose objective is to meet both the protocol and deadline constraints. The former constraint requires that the total time allocated to all nodes for transmitting synchronous messages should not exceed the target token rotation time. The latter constraint requires that the minimum time available for a node to transmit its synchronous messages before their deadlines should be no less than the maximum message transmission time. Several nonoptimal local SBA schemes and an optimal global SBA scheme have been proposed [1], [2], [3], [8], [17], [29]. Local SBA schemes use only information available locally to each node and are thus preferred to global schemes because of their lower network-management overhead. If optimal local SBA schemes, if any, can be devised, they will be superior to their global counterparts both in performance and in ease of network management. In this paper, we formally prove that there does not exist any optimal local SBA scheme. We also propose an optimal global SBA scheme which has an $O(nM)$ polynomial-time worst-case complexity, where $n$ is the number of synchronous message streams in the system and $M$ is the time complexity for solving a linear programming problem with $3n$ constraints and $n$ variables.
Robust Linear and Support Vector Regression
Authors: Olvi L. Mangasarian, David R. Musicant
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

The robust Huber M-estimator, a differentiable cost function that is quadratic for small errors and linear otherwise, is modeled exactly, in the original primal space of the problem, by an easily solvable simple convex quadratic program for both linear and nonlinear support vector estimators. Previous models were significantly more complex or formulated in the dual space and most involved specialized numerical algorithms for solving the robust Huber linear estimator [3], [6], [12], [13], [14], [23], [28]. Numerical test comparisons with these algorithms indicate the computational effectiveness of the new quadratic programming model for both linear and nonlinear support vector problems. Results are shown on problems with as many as 20,000 data points, with considerably faster running times on larger problems.
An intelligent user interface for mixed-initiative multi-source travel planning
Authors: Martin Frank, Maria Muslea, Jean Oh, Steve Minton, Craig Knoblock
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

Amixed-initiative plannerin our context is one in which either the human or the computer can spontaneously provide the content of the same input fields. A multi-source planneris one that accesses multiple external information sources in parallel, using separate threads. This type of highly dynamic user interface is desirable but presents a challenge in "keeping the user in control" because it can be confusing to understand which fields of the form currently "belong" to the user, which ones "belong" to the system, how these two interact, and when and how their ownership changes.
Spatio-temporal visualization of urban crimes on a GIS grid
Authors: Suresh K. Lodha, Arvind K. Verma
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

We present several techniques for visualizing the temporal dimension of a Geographic Information System. Techniques include (i) pseudo-colored time-window display, (ii) side-by-side height bars, (iii) stacked time-aggregated cumulative bars, (iv) stacked order-preserving bus, (v) vertical time dimension, and (vi) multi-layered display. These techniques are presented in the context of an urban crime mapping application and extend the existing visualization techniques employed in this field. We discuss merits and demerits of the proposed and existing techniques as well as issues related to aggregating the sampled data on a grid. The graphical display and the user interface is achieved through the use of VRML and vrmlscript. Our approach highlights the efforts to combine geographic information visualization with WordWideWeb technologies.
Acquisition and Propagation of Spatial Constraints Based on Qualitative Information
Authors: Takushi Sogo, Hiroshi Ishiguro, Toru Ishida
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

In robot navigation, one of the important and fundamental issues is to find positions of landmarks or vision sensors located around the robot. This paper proposes a method for reconstructing qualitative positions of multiple vision sensors from qualitative information observed by the vision sensors, i.e., motion directions of moving objects. In order to directly acquire the qualitative positions of points, the method proposed in this paper iterates the following steps: 1) observing motion directions (left or right) of moving objects with the vision sensors, 2) classifying the vision sensors into spatially classified pairs based on the motion directions, 3) acquiring three point constraints, and 4) propagating the constraints. Compared with the previous methods, which reconstruct the environment structure from quantitative measurements and acquire qualitative representations by abstracting it, this paper focuses on how to acquire qualitative positions of landmarks from low-level, simple, and reliable information (that is, ¿qualitative¿). The method has been evaluated with simulations and also verified with observation errors.
Querying websites using compact skeletons
Authors: Anand Rajaraman, Jeffrey D. Ullmann
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

Several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or XML documents. Much research has been devoted to this problem, resulting in several research prototypes and commercial implementations. Such systems rely on wrappers that provide relational or other structured interfaces to websites. Traditionally, wrappers have been constructed by hand on a per-website basis, constraining the scalability of the system. We introduce a website structure inference mechanism called compact skeletons that is a step in the direction of automated wrapper generation. Compact skeletons provide a transformation from websites or other hierarchical data, such as XML documents, to relational tables. We study several classes of compact skeletons and provide polynomial-time algorithms and heuristics for automated construction of compact skeletons from websites. Experimental results show that our heuristics work well in practice. We also argue that compact skeletons are a natural extension of commercially deployed techniques for wrapper construction.
The benefits and costs of DyC's run-time optimizations
Authors: Brian Grant, Markus Mock, Matthai Philipose, Craig Chambers, Susan J. Eggers
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

DyC selectively dynamically compiles programs during their execution, utilizing the run-time-computed values of variables and data structures to apply optimizations that are based on partial evaluation. The dynamic optimizations are preplanned at static compile time in order to reduce their run-time cost; we call this staging. DyC's staged optimizations include (1) an advanced binding-time analysis that supports polyvariant specialization (enabling both single-way and multiway complete loop unrolling), polyvariant division, static loads, and static calls, (2) low-cost, dynamic versions of traditional global optimizations, such as zero and copy propagation and dead-assignment elimination, and (3) dynamic peephole optimizations, such as strength reduction. Because of this large suite of optimizations and its low dynamic compilation overhead, DyC achieves good performance improvements on programs that are larger and more complex than the kernels previously targeted by other dynamic compilation systems. This paper evaluates the benefits and costs of applying DyC's optimizations. We assess their impact on the performance of a variety of small to medium-sized programs, both for the regions of code that are actually transformed and for the entire application as a whole. Our study includes an analysis of the contribution to performance of individual optimizations, the performance effect of changing the applications' inputs, and a detailed accounting of dynamic compilation costs.
Automatic extension of an ATN knowledge base
Authors: Gail E. Kaiser
Venue: Communications of the ACM (1981)

A computer program is described that acquires much of its knowledge from conversations among operators on Morse code radio networks. The system consists of a learning component and a language understander. The learning component extends a &lsquo;core&rsquo; augmented transition network (ATN) knowledge base by generalizing from sentences taken from scripts of actual conversations. The extensions enable the understanding component to process a large number of sentences that are syntactically and semantically similar to the examples.
Average binary search length for dense ordered lists
Authors: Ivan Flores, George Madpis
Venue: Communications of the ACM (1971)

A binary search is effective only when the list searched is ordered. It is efficient only when the list is dense&mdash;i.e. when records are in contiguous locations. It is easy to show that the maximum number of looks for a search L is given by [1]. L = [log2N+1], (1) where N is the number of records in the list and the square bracket means &ldquo;integral part of.&rdquo;
Computation of Legendre series coefficients
Authors: Robert Piessens
Venue: Communications of the ACM (1974)

LEGSER approximates the first N + 1 coefficients Bn of the Legendre series expansion of a function &fnof;(x) having known Chebyshev series coefficients An. Several algorithms are available for the computation of coefficients An of the truncated Chebyshev series expansion on [-1, 1] &fnof;(x) &sime; &sum;&prime;Nn=0 AnTn(x), (1) where &sum;&prime; donotes a sum whose first term is halved. The commonly used algorithms are based on the orthogonal property of summation of the Chebyshev polynomials [1]. The application of the analogous property of the Legendre polynomials for the calculation of the coefficients Bn of the expansion &fnof;(x) &sime; &sum;Nn=0 BnPn(x) (2) is less suitable for practical use since it requires the abscissas and weights of the Gauss-Legendre quadrature formulas [2].
Learning and reasoning by analogy
Authors: Patrick H. Winston
Venue: Communications of the ACM (1980)

We use analogy when we say something is a Cinderella story and when we learn about resistors by thinking about water pipes. We also use analogy when we learn subjects like economics, medicine, and law. This paper presents a theory of analogy and describes an implemented system that embodies the theory. The specific competence to be understood is that of using analogies to do certain kinds of learning and reasoning. Learning takes place when analogy is used to generate a constraint description in one domain, given a constraint description in another, as when we learn Ohm's law by way of knowledge about water pipes. Reasoning takes place when analogy is used to answer questions about one situation, given another situation that is supposed to be a precedent, as when we answer questions about Hamlet by way of knowledge about Macbeth.
Optimal and approximate computation of summary statistics for range aggregates
Authors: Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Marin J. Strauss
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

Fast estimates for aggregate queries are useful in database query optimization, approximate query answering and online query processing. Hence, there has been a lot of focus on &ldquo;selectivity estimation&rdquo;, that is, computing summary statistics on the underlying data and using that to answer aggregate queries fast and to a reasonable approximation. We present two sets of results for range aggregate queries, which are amongst the most common queries. First, we focus on a histogram as summary statistics and present algorithms for constructing histograms that are provably optimal (or provably approximate) for range queries; these algorithms take (pseudo-) polynomial time. These are the first known optimality or approximation results for arbitrary range queries; previously known results were optimal only for restricted range queries (such as equality queries, hierarchical or prefix range queries). Second, we focus on wavelet-based representations as summary statistics and present fast algorithms for picking wavelet statistics that are provably optimal for range queries. No previously-known wavelet-based methods have this property. We perform an experimental study of the various summary representations show the benefits of our algorithms over the known methods.
Loop Shifting for Loop Compaction
Authors: Alain Darte, Guillaume Huard
Venue: International Journal of Parallel Programming (2000)

The idea of decomposed software pipelining is to decouple the software pipelining problem into a cyclic scheduling problem without resource constraints and an acyclic scheduling problem with resource constraints. In terms of loop transformation and code motion, the technique can be formulated as a combination of loop shifting and loop compaction. Loop shifting amounts to moving statements between iterations thereby changing some loop independent dependences into loop carried dependences and vice versa. Then, loop compaction schedules the body of the loop considering only loop independent dependences, but taking into account the details of the target architecture. In this paper, we show how loop shifting can be optimized so as to minimize both the length of the critical path and the number of dependences for loop compaction. The first problem is well-known and can be solved by an algorithm due to Leiserson and Saxe. We show that the second optimization (and the combination with the first one) is also polynomially solvable with a fast graph algorithm, variant of minimum-cost flow algorithms. Finally, we analyze the improvements obtained on loop compaction by experiments on random graphs.
The development of the MU5 computer system
Authors: R. N. Ibbett, P. C. Capon
Venue: Communications of the ACM (1978)

Following a brief outline of the background of the MU5 project, the aims and ideas for MU5 are discussed. A description is then given of the instruction set, which includes a number of features conducive to the production of efficient compiled code from high-level language source programs. The design of the processor is then traced from the initial ideas for an associatively addressed &ldquo;name store&rdquo; to the final multistage pipeline structure involving a prediction mechanism for instruction prefetching and a function queue for array element accessing. An overall view of the complete MU5 complex is presented together with a brief indication of its performance.
Numerical Simulation of Unsteady Incompressible Flow (\em Re \protect\boldmath $\leq$ 9500) on the Curvilinear Half-Staggered Mesh
Authors: Alan George, Lan Chieh Huang, Wei-Pai Tang, Ya Dan Wu
Venue: SIAM Journal on Scientific Computing (1999)

In this paper, we continue our efforts toward numerical simulation of high $Re$ ($1000 \leq Re \leq 9500$) unsteady incompressible flows with the finite difference method on the curvilinear half-staggered mesh. The finite difference scheme and the projection method for the numerical solution of the incompressible Navier--Stokes equations in primitive variables was proposed and verified in [L. C. Huang, J. Comput. Math, to appear]. Here we derive the discrete Poisson equation on the curvilinear half-staggered mesh and discuss its properties. For unsteady complex flow simulation, rapid solution of this equation is crucial; the multilevel one-way dissection methods offer effective solutions. Numerical simulation of high $Re$ flows around circular and aerofoil-shaped cylinders show our method to be efficient and robust.
Precise extraction of ultra deep submicron interconnect parasitics with parameterizable 3D-modeling: invited talk
Authors: Martin R. Frerichs
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Manufacturing induced optimizations in the mask preparation step by layout post processing and fabrication inherent imperfections, like trapezoidal interconnect cross sections or variations of the dielectric interlayer thickness, lead to increased mismatches between the layout based timing and signal integrity characterizations and the corresponding Silicon-based behavior measurable after fabrication. Thus, to ensure timing closure between silicon and layout, DAM (Design For Manufacturability) related optimizations need to be taken care of when performing the parasitics extraction step. An example will be given where the mismatch between measurement and layout based extraction data can be demonstrated already for a 0.25um technology. It will further be shown that the inclusion of simplified process features by applying parameterized 3D-modeling will render sufficiently accurate extraction results. The proposed methodology is in addition efficient enough to handle complex layouts. Thus for all practical purposes parameterized 3D-modeling closes the gap between TCAD tools delivering highest accuracy, but limited to relatively small structures, and more powerful, but insufficiently accurate, standard full chip, layout based extraction tools.
Computer rendering of stochastic models
Authors: Alain Fournier, Don Fussell, Loren Carpenter
Venue: Communications of the ACM (1982)

A recurrent problem in generating realistic pictures by computers is to represent natural irregular objects and phenomena without undue time or space overhead. We develop a new and powerful solution to this computer graphics problem by modeling objects as sample paths of stochastic processes. Of particular interest are those stochastic processes which previously have been found to be useful models of the natural phenomena to be represented. One such model applicable to the representation of terrains, known as &ldquo;fractional Brownian motion,&rdquo; has been developed by Mandelbrot. The value of a new approach to object modeling in computer graphics depends largely on the efficiency of the techniques used to implement the model. We introduce a new algorithm that computes a realistic, visually satisfactory approximation to fractional Brownian motion in faster time than with exact calculations. A major advantage of this technique is that it allows us to compute the surface to arbitrary levels of details without increasing the database. Thus objects with complex appearances can be displayed from a very small database. The character of the surface can be controlled by merely modifying a few parameters. A similar change allows complex motion to be created inexpensively.
Autonomous mobile manipulators managing perception and failures
Authors: Alberto Finzi, Fiora Pirri, Marco Pirrone, Massimo Romano, Milko Vaccaro
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

We present a control system for autonomous mobile manipulators based on a theory of actions integrated with a theory of perception and failures. The system applies to autonomous manipulators built for simple missions like building towers of blocks, collecting balls of paper and putting them into a bin, or clearing obstacles from a path. For these application domains we have built three autonomous agents: ArmHand0, ArmHandONE and A.R.R.I.G.O. The core of the system is a high level program controlling the on-line agent behaviour: while a goal is not achieved, it selects a task from a library of possible subplans and executes it. The task, when correctly chosen, must lead to a subgoal position. At the end of each task execution, visual perception is used to monitor the coherence between the configuration of the domain and the configuration entailed as a consequence of the execution of the task. In case of a misalignment between the predicted state and the perceived one, a diagnostic procedure is activated.
Boosting Very-High Radix Division with Prescaling and Selection by Rounding
Authors: Paolo Montuschi, Tomás Lang
Venue: IEEE Transactions on Computers (2001)

An extension of the very-high radix division with prescaling and selection by rounding is presented. This extension consists of increasing the effective radix of the implementation by obtaining a few additional bits of the quotient per iteration, without increasing the complexity of the unit to obtain the prescaling factor or the delay of an iteration. As a consequence, for some values of the effective radix, it permits an implementation with a smaller area and the same execution time than the original scheme. Details of the algorithm and the implementation are presented. Estimations of the execution time and area are given for 54-bit and 114-bit quotients and compared with those of other division units.