ppxscal/embedding_network huggingface dataset:
Extractors with weak random seeds
Authors: Ran Raz
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We show how to extract random bits from two or more independent weak random sources in cases where only one source is of linear min-entropy and all other sources are of logarithmic min-entropy. Our main results are as follows: A long line of research, starting by Nisan and Zuckerman[14], gives explicit constructions of seeded-extractors, that is, extractors that use a short seed of truly random bits to extract randomness from a weak random source. For every such extractor E, with seed of length d, we construct an extractor E′, with seed of length d′=O(d), that achieves the same parameters as E but only requires the seed to be of min-entropy larger than (1⁄2+δ) •d′ (rather than fully random), where δ is an arbitrary small constant. Fundamental results of Chor and Goldreich and Vazirani [6,21] show how to extract Ω(n) random bits from two (independent) sources of length n and min-entropy larger than (1⁄2δ) • n, where δ is an arbitrary small constant. We show how to extract Ω(n) random bits (with optimal probability of error) when only one source is of min-entropy (1⁄2+δ) •n and the other source is of logarithmic min entropy.3 A recent breakthrough of Barak, Impagliazzo and Wigderson[4] shows how to extract Ω(n) random bits from a constant number of (independent) sources of length n and min-entropy larger than δ n, where δ is an arbitrary small constant. We show how to extract Ω (n) random bits (with optimal probability of error) when only one source is of min-entropy δ n and all other (constant number of) sources are of logarithmic min-entropy.A very recent result of Barak, Kindler, Shaltiel, Sudakov and Wigderson[5] shows how to extract a constant number of random bits from three (independent) sources of length n and min-entropy larger than δn, where δ is an arbitrary small constant. We show how to extract Ω(n)/ random bits, with sub-constant probability of error, from one source of min-entropy δ n and two sources of logarithmic min-entropy.In the same paper, Barak, Kindler, Shaltiel, Sudakov and Wigderson[5] give an explicit coloring of the complete bipartite graph of size 2n x 2n with two colors, such that there is no monochromatic subgraph of size larger than 2δn x 2 2δn, where δ is an arbitrary small constant. We give an explicit coloring of the complete bipartite graph of size 2n x 2n with a constant number of colors, such that there is no monochromatic subgraph of size larger than 2δn x n5.We also give improved constructions of mergers and condensers. In particular, We show that using a constant number of truly random bits, one can condense a source of length n and min-entropy rate δ into a source of length Ω (n) and min-entropy rate 1-δ, where δ is an arbitrary small constant.We show that using a constant number of truly random bits, one can merge a constant number of sources of length n, such that at least one of them is of min-entropy rate 1-δ, into one source of length Ω(n) and min-entropy rate slightly less than 1-δ, where δ is any small constant.
Comparing Rank and Score Combination Methods for Data Fusion in Information Retrieval
Authors: D. Frank Hsu, Isak Taksa
Venue: Information Retrieval (2005)

Combination of multiple evidences (multiple query formulations, multiple retrieval schemes or systems) has been shown (mostly experimentally) to be effective in data fusion in information retrieval. However, the question of why and how combination should be done still remains largely unanswered. In this paper, we provide a model for simulation and a framework for analysis in the study of data fusion in the information retrieval domain. A rank/score function is defined and the concept of a Cayley graph is used in the design and analysis of our framework. The model and framework have led us to better understanding of the data fusion phenomena in information retrieval. In particular, by exploiting the graphical properties of the rank/score function, we have shown analytically and by simulation that combination using rank performs better than combination using score under certain conditions. Moreover, we demonstrated that the rank/score function might be used as a predictive variable for the effectiveness of combination of multiple evidences.
Camera talk: making the camera a partial participant
Authors: K. K. Lamberty, Janet L. Kolodner
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In this paper, we describe how encouraging children to talk to the camera can structure their behavior and provide them opportunity for reflection. Encouraging "camera talk," interactions directed at the camera, can effectively elicit verbal comments from children participants. We describe a study in which children participants were told that they could tell the camera anything they wanted to about the designs they were making using a piece of educational software, but not to behave in a disruptive manner for the camera. By allowing children to interact with the camera in a particular way, rather than encouraging them to ignore its presence, we were able to elicit information about some children's design activities, thoughts, and struggles. The camera became an integral part of the socio-technical system for some children. This method may be useful to researchers interested in what children are thinking about in-the-moment as they work with software.
Exploiting Temporal Uncertainty in the Distributed Simulation of Time Petri Nets
Authors: F. Cicirelli, Angelo Furfaro, Libero Nigro
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

This paper proposes a kernel for the distributed simulation of real-time systems modelled by Merlin and Farberýs Time Petri Nets (TPN). The realization depends on Temporal Uncertainty Time Warp (TUTW), a novel time warp algorithm capable of exploiting temporal uncertainty in general optimistic simulations. A key feature of the application rests on the fact that TPN models naturally exhibit a certain degree of temporal uncertainty which the TUTW control engine can exploit to achieve good speedup without impairing accuracy of the simulation output. Usefulness of the achieved TUTW/TPN kernel is demonstrated by simulation experiments on a real-time system example.
A detailed power model for field-programmable gate arrays
Authors: Kara K. W. Poon, Steven J. E. Wilton, Andy Yan
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2005)

Power has become a critical issue for field-programmable gate array (FPGA) vendors. Understanding the power dissipation within FPGAs is the first step in developing power-efficient architectures and computer-aided design (CAD) tools for FPGAs. This article describes a detailed and flexible power model which has been integrated in the widely used Versatile Place and Route (VPR) CAD tool. This power model estimates the dynamic, short-circuit, and leakage power consumed by FPGAs. It is the first flexible power model developed to evaluate architectural tradeoffs and the efficiency of power-aware CAD tools for a variety of FPGA architectures, and is freely available for noncommercial use. The model is flexible, in that it can estimate the power for a wide variety of FPGA architectures, and it is fast, in that it does not require extensive simulation, meaning it can be used to explore a large architectural space. We show how the model can be used to investigate the impact of various architectural parameters on the energy consumed by the FPGA, focusing on the segment length, switch block topology, lookuptable size, and cluster size.
A Parallel-Line Detection Algorithm Based on HMM Decoding
Authors: Yefeng Zheng, Huiping Li, David Doermann
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

The detection of groups of parallel lines is important in applications such as form processing and text (handwriting) extraction from rule lined paper. These tasks can be very challenging in degraded documents where the lines are severely broken. In this paper, we propose a novel model-based method which incorporates high-level context to detect these lines. After preprocessing (such as skew correction and text filtering), we use trained Hidden Markov Models (HMM) to locate the optimal positions of all lines simultaneously on the horizontal or vertical projection profiles, based on the Viterbi decoding. The algorithm is trainable so it can be easily adapted to different application scenarios. The experiments conducted on known form processing and rule line detection show our method is robust, and achieves better results than other widely used line detection methods.
Elimination of Anticipation of a Class of Singular 2D Roesser Models by State Feedbacks
Authors: T. Kaczorek
Venue: Multidimensional Systems and Signal Processing (2005)

Necessary and sufficient conditions for the anticipation of a class of singular 2D Roesser models are established. Two methods of elimination of the anticipation of the model by suitable choice of feedback gain matrices are proposed. The methods are illustrated by numerical examples.
Optimizing the Memory Bandwidth with Loop Fusion
Authors: Paul Marchal, Jose Ignacio Gomez, Francky Catthoor
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

The memory bandwidth largely determines the performance and energy cost of embedded systems. At the compiler level, several techniques improve the memory bandwidth at the scope of a basic block, but often fail to exploit all. We propose a technique to optimize the memory bandwidth across the boundaries of a basic block. Our technique incrementally fuses loops to better use the available bandwidth. The resulting performance depends on how the data is assigned to the memories of the memory layer. At the same time, the assignment also strongly influences the energy cost. Therefore, we combine in our approach the fusion and assignment decisions. Designers can use our output to trade-off the energy cost with the systemýs performance.
Extracting word sequence correspondences with support vector machines
Authors: Kengo Sato, Hiroaki Saito
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

This paper proposes a learning and extracting method of word sequence correspondences from non-aligned parallel corpora with Support Vector Machines, which have high ability of the generalization, rarely cause over-fit for training samples and can learn dependencies of features by using a kernel function. Our method uses features for the translation model which use the translation dictionary, the number of words, part-of-speech, constituent words and neighbor words. Experiment results in which Japanese and English parallel corpora are used archived 81.1% precision rate and 69.0% recall rate of the extracted word sequence correspondences. This demonstrates that our method could reduce the cost for making translation dictionaries.
Why matrix manipulation should be done in C++
Authors: W. Douglas Maurer
Venue: Journal of Computing Sciences in Colleges (2004)

We show here how the technique of overloaded function call in C++ may be used in making matrix manipulations easier to understand, even when these involve specialized matrix representations. Such representations include sparse matrices, packed Boolean matrices, tridiagonal matrices, and arrays of pointers to arrays; and these may start with m00 or with m11. In all these cases, we may use the notation m (i, j) (with parentheses, not square brackets) to denote mij The overloaded function call is available in C++ and in no other language, and this is why matrix manipulation should be done in C++. In many cases an auxiliary construction, that of the reference class, is necessary in order to allow matrix elements to be changed as well as used.
The proof of a conjecture of Bouabdallah and Sotteau
Authors: Min Xu, Xinmin Hou, Jun-Ming Xu
Venue: Networks (2004)

Let G be a connected graph of order n. A routing in G is a set of n&lpar;n - 1&rpar; fixed paths for all ordered pairs of vertices of G. The edge-forwarding index of G, &pi;&lpar;G&rpar;, is the minimum of the maximum number of paths specified by a routing passing through any edge of G taken over all routings in G, and &pi;&Delta;,n is the minimum of &pi;&lpar;G&rpar; taken over all graphs of order n with maximum degree at most &Delta;. To determine &pi;n-2p-1,n for 4p &plus; 2&lceil;p&sol;3&rceil; &plus; 1 &le; n &le; 6p, A. Bouabdallah and D. Sotteau proposed the following conjecture in &lsqb;On the edge forwarding index problem for small graphs, Networks 23 &lpar;1993&rpar;, 249&ndash;255&rsqb;. The set 3 &times; &lcub;1, 2, &hellip; , &lceil;&lpar;4p&rpar;&sol;3&rceil;&rcub; can be partitioned into 2p pairs plus singletons such that the set of differences of the pairs is the set 2 &times; &lcub;1, 2, &hellip; , p&rcub;. This article gives a proof of this conjecture and determines that &pi;n-2p-1,n is equal to 5 if 4p &plus; 2&lceil;p&sol;3&rceil; &plus; 1 &le; n &le; 6p and to 8 if 3p &plus; &lceil;p&sol;3&rceil; &plus; 1 &le; n &le; 3p &plus; &lceil;&lpar;3p&rpar;&sol;5&rceil; for any p &ge; 2. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;4&rpar;, 292&ndash;296 2004
Subspace Analysis Using Random Mixture Models
Authors: Xiaogang Wang, Xiaoou Tang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since they are all based on a single Gaussian model, a global linear subspace often fails to deliver good performance on the data set with complex intrapersonal variation. They also have to face the problem caused by high dimensional face feature vector and the difficulty in finding optimal parameters for subspace analysis. In this paper, we develop a random mixture model to improve Bayes and LDA subspace analysis. By clustering the intrapersonal difference, the complex intrapersonal variation manifold is learned by a set of local linear intrapersonal subspaces. To boost the system performance, we construct multiple low dimensional subspaces by randomly sampling on the high dimensional feature vector and randomly selecting the parameters for subspace analysis. The effectiveness of our method is demonstrated by experiments on the AR face database containing 2340 face images.
Fast estimation of fractal dimension and correlation integral on stream data
Authors: Angeline Wong, Leejay Wu, Phillip B. Gibbons, Christos Faloutsos
Venue: Information Processing Letters (2005)

In this paper we give a very space-efficient, yet fast method for estimating the fractal dimensionality of the points in a data stream. Algorithms to estimate the fractal dimension exist, such as the straightforward quadratic algorithm and the faster O(N log N) or even O(N) box-counting algorithms. However, the sub-quadratic algorithms require Ω(N) space. In this paper, we propose an algorithm that computes the fractal dimension in a single pass, using a constant amount of memory relative to data cardinality. Experimental results on synthetic and real world data sets demonstrate the effectiveness of our algorithm.
The Design of a Secure and Pervasive Multimodal Web System
Authors: S. Ernest Chang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

While most users currently receive web services from web browser interfaces, pervasive computing is emerging and offering new ways of accessing Internet applications from any device at any location [1, 2], by utilizing various modes of interfaces to interact with their end users. The PC and its back-end servers remain important in a pervasive system, and the technology could involve new ways of interfacing with a PC and/or various types of gateways to back-end servers. In this research, cellular phone was used as the pervasive device for accessing an Internet application prototype, a multimodal web system (MWS), through voice user interface technology [3]. This paper describes how MWS was designed to provide a secure interactive voice channel using an Apache web server, a voice server, and a Java servlet engine. It was also shown that multimodal user-interface pages can be generated by using XSLT stylesheet which transforms XML documents into various formats including XHTML, WML, and VoiceXML.
Design by Contract: A Simple Technique for Improving the Quality of Software
Authors: Mark Bolstad
Venue: Proceedings of the 2004 Users Group Conference (2004)

At its heart, Design by Contract (DbC)[Meyer97] is a technique for expressing the relationship between a software routine (the supplier) and the callers of that routine (the clients). DbC is inspired by commercial relationships and business contracts that formally express the rightsand obligations binding a client and a supplier. DbC provides a clean, easy-to-implement technique that specifies the roles and constraints applying to a routine, and ultimately, will improve the quality of any software with minimal additional cost. In this paper we will define what DbC is, how it can benefit any software, and show several examples of software developed at ARL MSRC that use DbC.
Traffic matrices: balancing measurements, inference and modeling
Authors: Augustin Soule, Anukool Lakhina, Nina Taft, Konstantina Papagiannaki, Kave Salamatian, Antonio Nucci, Mark Crovella, Christophe Diot
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Traffic matrix estimation is well-studied, but in general has been treated simply as a statistical inference problem. In practice, however, network operators seeking traffic matrix information have a range of options available to them. Operators can measure traffic flows directly; they can perform partial flow measurement, and infer missing data using models; or they can perform no flow measurement and infer traffic matrices directly from link counts. The advent of practical flow measurement makes the study of these tradeoffs more important. In particular, an important question is whether judicious modeling, combined with partial flow measurement, can provide traffic matrix estimates that are signficantly better than previous methods at relatively low cost. In this paper we make a number of contributions toward answering this question. First, we provide a taxonomy of the kinds of models that may make use of partial flow measurement, based on the nature of the measurements used and the spatial, temporal, or spatio-temporal correlation exploited. We then evaluate estimation methods which use each kind of model. In the process we propose and evaluate new methods, and extensions to methods previously proposed. We show that, using such methods, small amounts of traffic flow measurements can have significant impacts on the accuracy of traffic matrix estimation, yielding results much better than previous approaches. We also show that different methods differ in their bias and variance properties, suggesting that different methods may be suited to different applications.
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
Authors: David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried Toussaint
Venue: Discrete Computational Geometry (2005)

Given a set R of red points and a set B of blue points, the nearest-neighbour decision rule classifies a new point q as red (respectively, blue) if the closest point to q in R &#x22c3; B comes from R (respectively, B). This rule implicitly partitions space into a red set and a blue set that are separated by a red-blue decision boundary. In this paper we develop output-sensitive algorithms for computing this decision boundary for point sets on the line and in &#x211d;2. Both algorithms run in time O(n log k), where k is the number of points that contribute to the decision boundary. This running time is the best possible when parameterizing with respect to n and k.
TinyDB: an acquisitional query processing system for sensor networks
Authors: Samuel R. Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong
Venue: ACM Transactions on Database Systems (TODS) (2005)

We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination, and execution. We evaluate these issues in the context of TinyDB, a distributed query processor for smart sensor devices, and show how acquisitional techniques can provide significant reductions in power consumption on our sensor devices.
Split closure and intersection cuts
Authors: Kent Andersen, G&#x00e9;rard Cornu&#x00e9;jols, Yanjun Li
Venue: Mathematical Programming: Series A and B (2005)

In the seventies, Balas introduced intersection cuts for a Mixed Integer Linear Program (MILP), and showed that these cuts can be obtained by a closed form formula from a basis of the standard linear programming relaxation. In the early nineties, Cook, Kannan and Schrijver introduced the split closure of a MILP, and showed that the split closure is a polyhedron. In this paper, we show that the split closure can be obtained using only intersection cuts. We give two different proofs of this result, one geometric and one algebraic. The result is then used to provide a new proof of the fact that the split closure of a MILP is a polyhedron. Finally, we extend the result to more general disjunctions.
Power and cost aware localized routing with guaranteed delivery in unit graph based ad hoc networks: Research Articles
Authors: Ivan Stojmenovic, Susanta Datta
Venue: Wireless Communications Mobile Computing (2004)

In a localized routing algorithm, each node currently holding a message makes forwarding decision solely based on the position information about itself, its neighbors and destination. In a unit graph, two nodes can communicate if and only if the distance between them is no more than the transmission radius, which is the same for each node. This paper proposes localized routing algorithms, aimed at minimizing total power for routing a message or maximizing the total number of routing tasks that a network can perform before a partition. The algorithms are combinations of known greedy power and&#x002F;or cost aware localized routing algorithms and an algorithm that guarantees delivery. A shortcut procedure is introduced in later algorithm to enhance its performance. Another improvement is to restrict the routing to nodes in a dominating set. These improvements require two-hop knowledge at each node. The efficiency of proposed algorithms is verified experimentally by comparing their power savings, and the number of routing tasks a network can perform before a node loses all its energy, with the corresponding shortest weighted path algorithms and localized algorithms that use fixed transmission power at each node. Significant energy savings are obtained, and feasibility of applying power and cost-aware localized schemes is demonstrated. Copyright &copy; 2004 John Wiley & Sons, Ltd.