ppxscal/embedding_network huggingface dataset:
Feature selection using linear classifier weights: interaction with classification models
Authors: Dunja Mladenić, Janez Brank, Marko Grobelnik, Natasa Milic-Frayling
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This paper explores feature scoring and selection based on weights from linear classification models. It investigates how these methods combine with various learning models. Our comparative analysis includes three learning algorithms: Naïve Bayes, Perceptron, and Support Vector Machines (SVM) in combination with three feature weighting methods: Odds Ratio, Information Gain, and weights from linear models, the linear SVM and Perceptron. Experiments show that feature selection using weights from linear SVMs yields better classification performance than other feature weighting methods when combined with the three explored learning algorithms. The results support the conjecture that it is the sophistication of the feature weighting method rather than its apparent compatibility with the learning algorithm that improves classification performance.
Flow sampling under hard resource constraints
Authors: Nick Duffield, Carsten Lund, Mikkel Thorup
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Many network management applications use as their data traffic volumes differentiated by attributes such as IP address or port number. IP flow records are commonly collected for this purpose: these enable determination of fine-grained usage of network resources. However, the increasingly large volumes of flow statistics incur concomitant costs in the resources of the measurement infrastructure. This motivates sampling of flow records.This paper addresses sampling strategy for flow records. Recent work has shown that non-uniform sampling is necessary in order to control estimation variance arising from the observed heavy-tailed distribution of flow lengths. However, while this approach controls estimator variance, it does not place hard limits on the number of flows sampled. Such limits are often required during arbitrary downstream sampling, resampling and aggregation operations employed in analysis of the data.This paper proposes a correlated sampling strategy that is able to select an arbitrarily small number of the "best" representatives of a set of flows. We show that usage estimates arising from such selection are unbiased, and show how to estimate their variance, both offline for modeling purposes, and online during the sampling itself. The selection algorithm can be implemented in a queue-like data structure in which memory usage is uniformly bounded during measurement. Finally, we compare the complexity and performance of our scheme with other potential approaches.
High probability analysis of the condition number of sparse polynomial systems
Authors: Gregorio Malajovich, J. Maurice Rojas
Venue: Theoretical Computer Science (2004)

Let f := (f1 ..... fn) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/ε. The bound depends on an integral of a differential form on a toric manifold and admits a simple explicit upper bound when the Newton polytopes (and underlying variances) are all identical.We also consider polynomials with real coefficients and give bounds for the expected number of real roots and (restricted) condition number. Using a Kähler geometric framework throughout, we also express the expected number of roots of f inside a region U as the integral over U of a certain mixed volume form, thus recovering the classical mixed volume when U = (C*)n.
Emulating low-priority transport at the application layer: a background transfer service
Authors: Peter Key, Laurent Massoulié, Bing Wang
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefetching. Although the design of such a service is reasonably easy when the underlying network supports service differentiation, it becomes more challenging without such network support. We describe an application level approach to designing a low priority service -- one that is 'lower than best-effort' in the context of the current Internet. We require neither network support nor changes to TCP. Instead, we use a receive window control to limit the transfer rate of the application, and the optimal rate is determined by detecting a change-point. We motivate this joint control-estimation problem by considering a fluid-based optimisation framework, and describe practical solutions, based on stochastic approximation and binary search techniques. Simulation results demonstrate the effectiveness of the approach.
Visualizations and Analyses of Elementary School Students' Actions on Squeak Environments
Authors: Tetsuo Ogino, Hideyuki Takada, Yahiko Kambayashi
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

With the spread of computers and networks into schools,it becomes more and more important to make them usefulfor education. We are currently working on the projectof holding Squeak workshops in schools. In these workshops,students try to make their original works, but thereis no method to see the building process of their works andshare their ideas. In this paper, we propose an action historymodel for managing user operations on SqueakToys. In themodel, the object manipulation events for the SqueakToysapplication level are captured and stored with the associationsto mouse and keyboard events for the operating systemlevel, so that we can focus on the important part of thebuilding process. We have also designed the playback functionof action histories at varying speed, as a visualizationof action histories. In addition, analysis on the action historiesand its utilization are discussed.
Reconstruction Techniques in the Image Analysis of Islamic Mosaics from the Alhambra
Authors: Francisco Albert Gil, Jose Maria Gomis, Jose Miguel Valiente
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents a methodology for tile imagereconstruction. This methodology is integrated in acomputer tool providing automatic image analysis.Both, the reconstruction and analysis methodologiesare based on the application of the scientific theory ofsymmetry groups and are part of an integratedmanagement system for pattern design in the tileindustries. As image analysis advances, information isobtained concerning design structure that will allow usto restitute (recover missing motifs), unify (choosebetween different motifs that should be equal) andstandardize (adjust motifs exactly to their symmetryaxes and rotation centers). This methodology for tileimage reconstruction has been tried with differentislamic mosaics from the Alhambra (Granada, Spain).Results based on these are given in this paper.
Using CITIDEL to develop and share class plans
Authors: Lillian N. Cassel, Edward A. Fox, JAN Lee, Manuel A. Pérez-Quiñones, Deborah Knox, John Impagliazzo, Lee Giles
Venue: ACM SIGCSE Bulletin (2004)

This demonstration will illustrate the use of existing and proposed tools in CITIDEL for finding existing resources to integrate into a course and for developing well structured descriptions of class and laboratory activities for sharing with the computing community.
A Content Aware Integer Register File Organization
Authors: Gonzalez Gonzalez, Adrian Cristal, Daniel Ortega, Alexander Veidenbaum, Mateo Valero
Venue: ACM SIGARCH Computer Architecture News (2004)

A register file is a critical component of a modernsuperscalar processor.It has a large number of entriesand read/write ports in order to enable high levels ofinstruction parallelism.As a result, the register file'sarea, access time, and energy consumption increasedramatically, significantly affecting the overallsuperscalar processor's performance and energyconsumption.This is especially true in 64-bitprocessors.This paper presents a new integer register fileorganization, which reduces energy consumption,area, and access time of the register file with a minimal effect on overall IPC.This is accomplished byexpoiting a new concept, partial value locality, whichis defined as occurence of mutiple live valueinstances identical in a subset of their bits.A possibleimplementation of the new register file is describedand shown to obtain proposed optimized register filedesigns.Overall, an energy reduction of over 50%, a18% decreas in area, and a 15% reduction in the accesstime are achieved in the new register file.Theenergy and area savings are achieved with a 1.7%reduction in IPC for integer applications and anegligible 0.3% in numerical applications, assumingthe same clock frequency.A performance increase ofup to 13% is possible if the clcok frequency can beincreases due to a reduction in the register file accesstime.This approach enables other, very promisingoptimizations, three of which are outlined in the paper.
Finite element approximation of spectral acoustic problems on curved domains
Authors: Erwin Hern&#x00e1;ndez, Rodolfo Rodr&#x00ed;guez
Venue: Numerische Mathematik (2004)

This paper deals with the finite element approximation of the displacement formulation of the spectral acoustic problem on a curved non convex two-dimensional domain &#x03a9;. Convergence and error estimates are proved for Raviart-Thomas elements on a discrete polygonal domain &#x03a9;h ***inline equation*** &#x03a9; in the framework of the abstract spectral approximation theory. Similar results have been previously proved only for polygonal domains. Numerical tests confirming the theoretical results are reported.
Almost Sure Convergence of the Minimum Bipartite Matching Functional in Euclidean Space
Authors: H. Boutet de Monvel, C. Martin
Venue: Combinatorica (2002)

Let L N = L MBM (X 1, . . .,X N ;Y 1, . . . , Y N ) be the minimum length of a bipartite matching between two sets of points in R d , where X 1,...,X N , . . . and Y 1, . . . , Y N , . . . are random points independently and uniformly distributed in [0, 1] d . We prove that for d &#x2265; 3, L N /N 1&#x2212;1/d converges with probability one to a constant &#x03b2; MBM (d) > 0 as N &#x2192; &#x221e;.
Heuristic transporter routing model for manufacturing facility design
Authors: Heung-Suk Hwang
Venue: Computers and Industrial Engineering (2004)

In this study, a transporter routing problem is analyzed and adapted for use in manufacturing facility design. Given fixed facility layout and predetermined material flow paths, this study determines the minimum number of transporters required to transfer material within a given manufacturing facility with minimal handling effort. The manufacturing facility design problem is particularly complex and involves the sub-problems such as design of the material network and the transporter routing problem, which provides the fleet size and the routing of each transporter over the flow network. The problem is formulated as an integer program. To solve the problem, we used a heuristic and integrated vehicle routing model. We also developed a heuristic solution program and several tests along with an industrial example to indicate the effectiveness of this method.
Parallel SQL execution in Oracle 10g
Authors: Thierry Cruanes, Benoit Dageville, Bhaskar Ghosh
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

This paper describes the new architecture and optimizations for parallel SQL execution in the Oracle 10g database. Based on the fundamental shared-disk architecture underpinning Oracle's parallel SQL execution engine since Oracle7, we show in this paper how Oracle's engine responds to the challenges of performing in new grid-computing environments. This is made possible by using advanced optimization techniques, which enable Oracle to exploit data and system architecture dynamically without being constrained by them. We show how we have evolved and re-architected our engine in Oracle 10g to make it more efficient and manageable by using a single global parallel plan model.
A Static Low-Power, High-Performance 32-bit Carry Skip Adder
Authors: Kai Chirca, Michael Schulte, John Glossner, Haoran Wang, Suman Mamidi, Pablo Balzola, Stamatis Vassiliadis
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In this paper, we present a full-static carry-skip adder designed to achieve low power dissipation and high-performance operation. To reduce the adder's delay and power consumption, the adder is divided into variable-sized blocks that balance the inputs to the carry chain. The optimum block sizes for minimizing the critical path delay with complementary carry generation are achieved. Within blocks, highly optimized carry look-ahead logic, which computes block generate and block propagate signals, is used to further decrease delay. The adder architecture decreases power consumption by reducing the number of logic levels, glitches, and transistors. To achieve balanced delay, input bits are grouped unevenly in the carry chain. This grouping reduces active power by minimizing extraneous glitches and transitions. The adder has been implemented in 130nm CMOS technology. At 1.2V and 25C, typical performance is 1.086GHz and power dissipation normalized to 600MHz operation is 0.786mW.
Performance analysis of assembly systems with highlift stations: a practical approach
Authors: John Leung, K. K. Lai
Venue: Computers and Industrial Engineering (2004)

One common problem associated with automatic assembly systems is that some assembly operations may have relatively long cycle times. As a consequence, the productivity, as determined by the operations with the longest cycle time, can be significantly reduced. Therefore, a special form of parallel workstation known as a highlift station was developed to improve the performance of an automatic assembly system. In this paper, we present a simple analytical model that can help engineers to estimate the performance of highlift stations. This model is particularly useful at the design stage, as only approximate results are necessary for selecting the configuration.
Stochastic programming duality: &#x221e; multipliers for unbounded constraints with an application to mathematical finance
Authors: Lisa A. Korf
Venue: Mathematical Programming: Series A and B (2004)

A new duality theory is developed for a class of stochastic programs in which the probability distribution is not necessarily discrete. This provides a new framework for problems which are not necessarily bounded, are not required to have relatively complete recourse, and do not satisfy the typical Slater condition of strict feasibility. These problems instead satisfy a different constraint qualification called &#x2018;direction-free feasibility&#x2019; to deal with possibly unbounded constraint sets, and &#x2018;calmness&#x2019; of a certain finite-dimensional value function to serve as a weaker condition than strict feasibility to obtain the existence of dual multipliers. In this way, strong duality results are established in which the dual variables are finite-dimensional, despite the possible infinite-dimensional character of the second-stage constraints. From this, infinite-dimensional dual problems are obtained in the space of essentially bounded functions. It is then shown how this framework could be used to obtain duality results in the setting of mathematical finance.
CAMRIT: Control-based Adaptive Middleware for Real-time Image Transmission
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Real-time image transmission is crucial to an emergingclass of distributed embedded systems operating in opennetwork environments. Examples include avionics missionre-planning over Link-16, security systems based on wirelesscamera networks, and online collaboration using cameraphones. Meeting image transmission deadlines is akey challenge in such systems due to unpredictable networkconditions. In this paper, we present CAMRIT, a Control-basedAdaptive Middleware framework for Real-time ImageTransmission in distributed real-time embedded systems.CAMRIT features a distributed feedback control loop thatmeets image transmission deadlines by dynamically adjustingthe quality of image tiles. We derive an analytic modelthat captures the dynamics of a distributed middleware architecture.A control theoretic methodology is applied tosystematically design a control algorithm with analytic assuranceof system stability and performance, despite uncertaintiesin network bandwidth. Experimental results demonstratethat CAMRIT can provide robust real-time guaranteesfor a representative application scenario.
Measuring ineffectiveness
Authors: Ellen M. Voorhees
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

An evaluation methodology that targets ineffective topics is needed to support research on obtaining more consistent retrieval across topics. Using average values of traditional evaluation measures is not an appropriate methodology because it emphasizes effective topics: poorly performing topics' scores are by definition small, and they are therefore difficult to distinguish from the noise inherent in retrieval evaluation. We examine two new measures that emphasize a system's worst topics. While these measures focus on different aspects of retrieval behavior than traditional measures, the measures are less stable than traditional measures and the margin of error associated with the new measures is large relative to the observed differences in scores.
A New Based-on-Artificial-Intelligence Framework for Behavioral Animation of Virtual Actors
Authors: Andres Iglesias, Francisco Luengo
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

The realistic animation of the behavior of virtual actors emulating human beings has been a very dynamic field of research during the last few years. A major goal is to create a behavioral system for the virtual actors so that they behave as realistic as possible. Among the large number of different techniques to solve this problem, those based on Artificial Intelligence (AI) do represent a powerful (but not well explored yet) approach. In this paper, we present a new framework for behavioral animation of virtual actors. The framework applies several Artificial Intelligence techniques (neural networks, expert systems, fuzzy logic, K-means) to build a sophisticated behavioral system so that the actors can take intelligent decisions by themselves. The paper describes the general framework, its main components and how these AI techniques have been effectively applied to this purpose. Some programming issues, the main steps of the simulation flow and some illustrative examples are also analyzed in this paper.
Lower bounds for local search by quantum arguments
Authors: Scott Aaronson
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hypercube 0,1n, we show a lower bound of Ω(2n/4/n) on the number of queries needed by a quantum computer to solve this problem. More surprisingly, our approach, based on Ambainis's quantum adversary method, also yields a lower bound of Ω(2n/2/n2) on the problem's classical randomized query complexity. This improves and simplifies a 1983 result of Aldous. Finally, in both the randomized and quantum cases, we give the first nontrivial lower bounds for finding local minima on grids of constant dimension d≥3.
Efficient Scheduling Heuristics for GridRPC Systems
Authors: Yves Caniou, Emmanuel Jeannot
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper we examine several scheduling heuristicsfor GridRPC middleware relying on the time-shared model(a server can execute more than one task at a time). Ourwork is based on a forecast module called the 'HistoricalTrace Manager' (HTM), which is able to predict durationsof tasks in the system. We show that the predictionsperformed by the HTM are very accurate. The five proposedscheduling heuristics use these predictions to mapsubmitted tasks to servers. Experimental simulation resultsshow that they are able to outperform the well-known MCTheuristic for several metrics (makespan but also sumflow,max-stretch, etc.) and therefore provide a better quality ofservice for the client.
A Practical Analysis of Low-Density Parity-Check Erasure Codes for Wide-Area Storage Applications
Authors: James S. Plank, Michael G. Thomason
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

As peer-to-peer and widely distributed storage systemsproliferate, the need to perform efficient erasure coding,instead of replication, is crucial to performance and efficiency.Low-Density Parity-Check (LDPC) codes havearisen as alternatives to standard erasure codes, such asReed-Solomon codes, trading off vastly improved decodingperformance for inefficiencies in the amount of datathat must be acquired to perform decoding. The scoresof papers written on LDPC codes typically analyze theircollective and asymptotic behavior. Unfortunately, theirpractical application requires the generation and analysisof individual codes for finite systems.This paper attempts to illuminate the practical considerationsof LDPC codes for peer-to-peer and distributedstorage systems. The three main types of LDPC codesare detailed, and a huge variety of codes are generated,then analyzed using simulation. This analysis focuses onthe performance of individual codes for finite systems,and addresses several important heretofore unansweredquestions about employing LDPC codes in real-world systems.
Permuting in place: analysis of two stopping rules
Authors: Alois Panholzer, Helmut Prodinger, Marko Riedel
Venue: Journal of Algorithms (2004)

Permuting in place has been first analyzed by Knuth. It uses the cycle structure of the permutation. The elements of an array to be permuted are only moved when one sees a cycle leader (smallest element in its cycle). So the essential part of such an algorithm is to test an element i about whether it is a cycle leader.Recently, Keller [Inform. Process. Lett. 81 (2002) 119-125] introduced two stopping rules: "If the last cycle leader has been detected, all elements have been moved, and no further tests are necessary" (heuristic 1), respectively "If only r elements have not been moved, then proceeding along a cycle is only useful for r steps" (heuristic 2).We analyze the average costs of these modifications applied to the standard algorithm of Knuth; they are (n + 2)Hn - 5n/2 - 1/2 ∼ n log n and respectively ((2n + 1)/4)H|(n-1)/2| + (1/2)H2⌊(n+1)/2⌋ - (1/2)(⌊(n + 1)/2⌋ - ⌊n/2⌋) - (n+1)/2 ∼ (n/2) log n, as opposed to (n + 1)Hn - 2n ∼ n logn in the classical case.