ppxscal/embedding_network huggingface dataset:
Practical and efficient point insertion scheduling method for parallel guaranteed quality delaunay refinement
Authors: Andrey N. Chernikov, Nikos P. Chrisochoides
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

We describe a parallel scheduler, for guaranteed quality parallel mesh generation and refinement methods. We prove a sufficient condition for the new points to be independent, which permits the concurrent insertion of more than two points without destroying the conformity and Delaunay properties of the mesh. The scheduling technique we present is much more efficient than existing coloring methods and thus it is suitable for practical use. The condition for concurrent point insertion is based on the comparison of the distance between the candidate points against the upper bound on triangle circumradius in the mesh. Our experimental data show that the scheduler introduces a small overhead (in the order of 1--2% of the total execution time) it requires local and structured communication compared to irregular, variable and unpredictable communication of the other existing practical parallel guaranteed quality mesh generation and refinement method. Finally, on a cluster of more than 100 workstations using a simple (block) decomposition our data show that we can generate about 900 million elements in less than 300 seconds.
Intersection and Linking Numbers in Oriented Matroids
Authors: Paula Carvalho, Ant&#x00f3;nio Guedes de Oliveira
Venue: Discrete Computational Geometry (2004)

We introduce for oriented matroids a generalization of the concepts of intersection and linking numbers in Euclidean space, with most of their main properties (see Wu). As an application, we reprove a result of Brehm in a slightly extended form.
Mechanisms of charge modulation in the floating body of triple-well nMOSFET capacitor-less DRAMs
Authors: A. Villaret, R. Ranica, P. Masson, P. Malinge, P. Mazoyer, P. Candelier, F. Jacquet, S. Cristoloveanu, T. Skotnicki
Venue: Microelectronic Engineering (2004)

We report on the modeling and characterization of the memory effect observed on triple-well nMOSFETs. First, the mechanisms of charge injection, localization and retention in the floating p-well of triple-well nMOSFETs are investigated and a new model is proposed. Then several electrical characterization set-ups are discussed. Finally, modeled and measured data are compared at room temperature.
Arithmetic Coding Architecture for H.264/AVC CABAC Compression System
Authors: Roberto R. Osorio, Javier D. Bruguera
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In this paper we propose an efficient implementation of CABAC's binary arithmetic coder and context management system. CABAC is the Context Adaptive Binary Arithmetic Coder used in new H.264/AVC video standard. Arithmetic coding allows a significant enhancement in compression. However, implementation complexity is a drawback due to hardware cost and slowness. In this paper we show the need for a hardware implementation of arithmetic coding in current video compression systems. We propose a fast and efficient implementation of the encoding algorithm. We prove that memory accesses constitute a bottleneck and propose solutions that apply to the encoding algorithm and context management system. As a result, a fast architecture is presented, able to process one symbol per cycle.
Incentive-Compatible Social Choice
Authors: Boi Faltings
Venue: Proceedings of the Intelligent Agent Technology, IEEE/WIC/ACM International Conference (2004)

Many situations present a social choice problem where different self-interested agents have to agree on joint, coordinated decisions.For example, power companies have to agre on how to use the power grid, and airlines have to agree on how to schedule takeoffs and landings. Mechanisms for social choice are called incentive-compatible when cooperative behavior is optimal for all parties.The most well-known examples of incentive-compatible mechanisms are auctions.However, the party that receives the auction revenue has an incentive to manipulate the outcome to increase the revenue.For example, a power grid operator has an interest to reduce capacity and drive up prices.Conversely, if it provides sufficient capacity to every user it derives no revenue to cover its costs. We present a novel mechanism for social choice that is incentive-compatible without generating a payment surplus. We give several examples of applications where it solves the social choice problem without unwanted incentives, and provides significantly better overall utility than any other known mechanism.
Exploiting Resonant Behavior to Reduce Inductive Noise
Authors: Michael D. Powell, T. N. Vijaykumar
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

Inductive noise in high-performance microprocessors is a reliabilityissue caused by variations in processor current (di/dt)which are converted to supply-voltage glitches by impedances inthe power-supply network. Inductive noise has been addressed byusing decoupling capacitors to maintain low impedance in thepower supply over a wide range of frequencies. However, evenwell-designed power supplies exhibit (a few) peaks of high impedanceat resonant frequencies caused by RLC resonant loops. Previousarchitectural proposals adjust current variations bycontrolling instruction fetch and issue, trading off performanceand energy for noise reduction. However, the proposals do notconsider some conceptual issues and have implementation challenges.The issues include requiring fast response, responding tovariations that do not threaten the noise margins, or respondingto variations only at the resonant frequency while the range ofhigh impedance extends to a resonance band around the resonantfrequency. While previous schemes reduce the magnitude of variations,our proposal, called resonance tuning, changes the frequencyof current variations away from the resonance band to anon-resonant frequency to be absorbed by the power supply.Because inductive noise is a resonance problem, resonance tuningreacts only to repeated variations in the resonance band, andnot to isolated variations. Reacting after a few repetitions allowsmore time for the response and reduces unnecessary responses,decreasing performance and energy loss.
Multi-Minimisations for Shape Control of Fully Free-Form Deformation Features
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Fully Free Form Deformation Features (¿-F¿) have beenproposed to overcome the limits of low-levelmanipulations of free form surfaces. They correspond toshapes obtained by deformation of a surface partaccording to geometric constraints. In our approach, a ¿-F¿ is a result of the indirect manipulation of externalforces applied to the nodes of a bar network coupled tothe control polyhedron of a B-spline surface. The solutionof the equation system corresponding to the constraintspecifications, often under-constrained, requires thedefinition of an optimisation problem where an additionalobjective function has to be minimised. In this paper wepropose a new formulation of this optimisation problemwhere the proposed objective functions can be defined asa multiple combination of various local quantities. Theycan be related either to the geometry of the bar network(e.g. the length of a bar or the displacement of a node), orto its mechanical magnitudes (e.g. the external forceapplied at a node or a bar deformation energy). Differenttypes of combinations are also proposed and classifiedaccording to the induced level of multi-minimisations. Inthis way the shape of a ¿-F¿ can be controlled globally,with a unique minimisation, or locally with differentminimisations applied to sub-domains of the surface.
The Marching Intersections algorithm for merging range images
Authors: Claudio Rocchini, Paolo Cignoni, Fabio Ganovelli, Claudio Montani, Paolo Pingi, Roberto Scopigno
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

A new algorithm for the integration of partially overlapping range images into a triangular mesh is presented. The algorithm consists of three main steps: it locates the intersections between the range surfaces and a reference grid chosen by the user, then merges all nearly coincident and redundant intersections according to a proximity criterion, and, finally, reconstructs the merged surface(s) from the filtered intersection set. Compared with previous methods, which adopt a volumetric approach, our algorithm shows lower computational costs and improves the accuracy of the surfaces produced. It takes into account the quality of the input measurements and is able to patch small holes corresponding to the parts of the 3D scanned object that were not observed by the acquisition device. The algorithm has been tested on several datasets of range maps; graphical and numeric results are reported.
Back to the future?
Authors: Keith Mander
Venue: ACM SIGCSE Bulletin (2004)

The way in which universities moved from an elite system of education in the 1960s to a more inclusive system of education in the 1990s has been a great success story. Computer Science has played its part, becoming a subject taught in some form in almost every university in the developed world. Those of us who were in the subject at the start of its significant growth remember the battles to get Computer Science recognised as an acceptable academic subject, and the ways in which it subsequently came to dominate many of the more traditional subjects in a university's portfolio. But as we move into the 21st century universities are entering the most volatile and turbulent time for higher education since the early 1980s, and the dangers for Computer Science are acute.For the first time in its history Computer Science is not expanding; other disciplines are encroaching on its territory; the science base (at least in English schools) is in decline; the computing industry is tentative. We are now seeing 18-year-old students with at least 10 years computing experience, who can write flawless code while holding a dozen simultaneous e-conversations and watching the TV. In their highly parallel universe, they find "hello world" uninteresting (even if it has a browser interface). They are natural collaborators - wired, extrovert and hyper-social; they are digital natives whereas their teachers are digital immigrants.How will Computer Science survive the current turmoil? What can the past tell us about the future?
How to pick a winner: a look at software methodologies
Authors: Girish Parikh
Venue: ACM SIGSOFT Software Engineering Notes (1983)

Selecting the "right" software methodology may save you a fortune in the long run. Consider these figures: Several studies indicate that maintenance consumes 67% of the software life cycle: the remaining 33% is development. Once a software system becomes operational. It may be used for five to 20 years (some IBM 1401 programs are still around).Consider the result if a methodology helps you save at least 10% in total life-cycle costs. This savings may result in different ways. For example, depending on the methodology, you may spend more on the front-end development cycle (in the design stage) and save 20% on the subsequent maintenance, including repairs and enhancements.Keep an open mind when choosing a methodology. Be willing to learn and discover no matter what your position---president or programmer. Remember that a highly promoted or well-known methodology is not necessarily the best.Professionals should learn more than one methodology, since one may not be suitable for every application. To save on training costs and to standardize, organizations may select one major methodology and use another when an application demands. When possible, methodologies may be judiciously combined. Large companies may have methodology specialists, while small companies might use outside consultants specializing in the appropriate methodology.Most methodologies can be divided into two major groups: functional and data-structured. With the first type, data flow analyses (for instance.
Simulation and parameter estimation of dynamics of synaptic depression
Authors: F. Aristizabal, M. I. Glavinovi&#x010d;
Venue: Biological Cybernetics (2004)

Synaptic release was simulated using a Simulink sequential storage model with three vesicular pools. Modeling was modular and easily extendable to the systems with greater number of vesicular pools, parallel input, or time-varying parameters. Given an input (short or long tetanic trains, patterned or random stimulation) and the storage model, the vesicular release, the replenishment of various vesicular pools, and the vesicular content of all pools could be simulated for the time-invariant and time-varying storage systems. From the input stimuli and either a noiseless or a noisy output, the parameters of such storage systems could also be estimated using the optimization technique that minimizes in the least square sense the error between the observed release and the predicted release. All parameters of the storage model could be evaluated with sufficiently long input&#x2013;output data pairs. Not surprisingly, the parameters characterizing the processes near the release locus, such as the fractional release and the size of the immediately available pool and its coupling to the small store, as well as the state variables associated with the immediately available pool, such as its vesicular content and replenishment, could be determined with fewer stimuli. The possibility of estimating parameters with random inputs extends the applicability of the method to in vivo synapses with the physiological inputs. The parameter estimation was also possible under the time-variant, but slowly changing, conditions as well as for open systems that are part of larger vesicular storage systems but whose parameters can either not be reliably determined or are of no interest. The quality of parameter estimation was monitored continuously by comparing the observed and predicted output and/or estimated parameters with the true values. Finally, the method was tested experimentally using the rat phrenic-diaphragm neuromuscular junction.
Privacy and confidentiality management for the microaggregation disclosure control method: disclosure risk and information loss measures
Authors: Traian Marius Truta, Farshad Fotouhi, Daniel Barth-Jones
Venue: Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003)

In this paper, we first introduce minimal, maximal and weighted disclosure risk measures for microaggregation disclosure control method. Our disclosure risk measures are more applicable to real-life situations, compute the overall disclosure risk, and are not linked to a target individual. After defining those disclosure risk measures, we then introduce an information loss measure for microaggregation. The minimal disclosure risk measure represents the percentage of records, which can be correctly identified by an intruder based on prior knowledge of key attribute values. The maximal disclosure risk measure considers the risk associated with probabilistic record linkage for records that are not unique in the masked microdata. The weighted disclosure risk measure allows the data owner to compute the risk of disclosure based on weights associated with different clusters of records. Information loss measure, introduced in this paper, extends the existing measure proposed by Domingo-Ferrer, and captures the loss of information at record level as well as from the statistical integrity point of view. Using simulated medical data in our experiments, we show that the proposed disclosure risk and information loss measures perform as expected in real-life situations.
Toward better weighting of anchors
Authors: David Hawking, Trystan Upstill, Nick Craswell
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Okapi BM25 scoring of anchor text surrogate documents has been shown to facilitate effective ranking in navigational search tasks over web data. We hypothesize that even better ranking can be achieved in certain important cases, particularly when anchor scores must be fused with content scores, by avoiding length normalisation and by reducing the attentuation of scores associated with high tf. Preliminary results are presented.
The Effect of Music on the Perception of Display Rate and Duration of Animated Sequences: An Experimental Study
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

Itýs currently impossible, even on modern graphicshardware to compute high fidelity graphics of complexscenes in real time. As we are producing the graphicsfor human observers it may be possible to exploitlimitations of the human perceptual system to improvethe quality/rendering time ratio. When confronted withmultisensory input the human has to divide his/hercognitive resources between the different sensorystimuli. This paper presents an independent samplesexperiment on the influence of musical tempo andemotional suggestiveness of music on the perceptionmotion and time duration in a computer graphicsenvironment. The purpose of this work is to investigatewhether music would be a significant distractor,allowing us to render at a slower frame rate withoutany perceivable difference for the user. No overallmain effect of fast tempo/exciting music was revealed,while slow tempo/relaxing music resulted in longerduration estimations and slower perceived temporalrates.
Sums of squares of polynomials and their applications
Authors: Pablo A. Parrilo
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

A multivariate polynomial is a sum of squares (SOS) if it can be written as a sum of squares of other polynomials, i.e., p(x) = ∑ q2;i;(x), q_i(x) ε R[x;1;, …, x;n;].If p(x) is SOS then p(x) ≥ 0 for all x ε &Ropf; n, thus making the sum of squares condition a quite natural sufficient test for polynomial nonnegativity.The existence of a decomposition of a multivariate polynomial as a sum of squares is a basic question in pure and applied mathematics. Its rich algebraic and geometric structure has been analyzed in detail in the past, notably by Reznick and coauthors [1], but until very recently the computational implications have not been fully explored. In the last few years there have been some very interesting new developments surrounding sums of squares, that have produced a wide array of results linking foundational questions in real algebra with computational possibilities arising from convex optimization. The possibility of effective computation of SOS decompositions also has important practical consequences, as they can be used in the formulation of easily verifiable certificates of the emptiness of semialgebraic sets via the Positivstellensatz, a central result in real algebraic geometry.In this talk we present an overview of this novel research area, that combines symbolic and numeric techniques from real algebra and optimization. Particularly exciting is the recent availability of efficient approaches, based on convex optimization, for its effective computation. Most of them employ semidefinite programming (SDP) [5] as the essential computational tool. SDP is a class of optimization problems, where the feasible set is the intersection of an affine subspace and the convex cone of positive semidefinite matrices. We will review the basics of SDP, emphasizing its algebraic characterization and properties, as well as some interesting open problems.Along the way, we will learn how to compute sum of squares decompositions for multivariate polynomials using semidefinite programming, how to certify the results using rounding techniques, and how to obtain structured infeasibility certificates for real solutions of systems of polynomial equations and inequalities. The developed techniques unify and generalize many well-known existing methods.The methods introduced in [3, 4] have been significantly strengthened to exploit problem-specific algebraic and numerical structure; see for instance [2]. The basic ideas and algorithms, as well as these recent extensions, will be illustrated with examples drawn from a broad range of domains, including dynamical systems, geometric theorem proving and quantum mechanics.
Middleware Specialization for Memory-Constrained Networked Embedded Systems
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

General purpose middleware has been shown to be effectiveoff-the-shelf, in meeting diverse functional requirementsfor a wide range of distributed systems. However,middleware customization is necessary for many networkedembedded systems because of the resource constraints inthe networked nodes. In this paper, we demonstrate thatreduced middleware footprint can be achieved while maintainingreal-time properties of applications running on suchsystems. We also give evidence that empirical measurementusing a representative application is crucial to guide (1)selection of feature subsets from general purpose middlewareand (2) trade-offs among different dimensions of designmetrics including real-time, footprint, and portability.
An Intelligent Information System for Organizing Online Text Documents
Authors: Han-Joon Kim, Sang-Goo Lee
Venue: Knowledge and Information Systems (2004)

This paper describes an intelligent information system for effectively managing huge amounts of online text documents (such as Web documents) in a hierarchical manner. The organizational capabilities of this system are able to evolve semi-automatically with minimal human input. The system starts with an initial taxonomy in which documents are automatically categorized, and then evolves so as to provide a good indexing service as the document collection grows or its usage changes. To this end, we propose a series of algorithms that utilize text-mining technologies such as document clustering, document categorization, and hierarchy reorganization. In particular, clustering and categorization algorithms have been intensively studied in order to provide evolving facilities for hierarchical structures and categorization criteria. Through experiments using the Reuters-21578 document collection, we evaluate the performance of the proposed clustering and categorization methods by comparing them to those of well-known conventional methods.
Premium usability: getting the discount without paying the price
Authors: Jeff Sauro
Venue: interactions (2004)

The debate rages. "Formal usability testing costs too much," says one side. "We need methodological rigor," maintains the other. "You can find the important problems with just five users," insists the first. "Such a small number doesn't give us reliable results," counters the second.<br><br>And never the twain shall meet.<br><br>Or will they? In this Whiteboard, Jeff Sauro explores the issues and gives us some ideas for maintaining the statistical validity of our usability testing as we reduce its costs.---Elizabeth Buie
Online algorithms for network design
Authors: Adam Meyerson
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer networks (wired and wireless) as well as many other applications. In most cases the natural applications involve changing sets of communicating nodes, making the online model essential for addressing them.