ppxscal/embedding_network huggingface dataset:
A time series-based approach for power management in mobile processors and disks
Authors: Xiaotao Liu, Prashant Shenoy, Weibo Gong
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

In this paper, we present a time series-based approach for managing power in mobile processors and disks that see multimedia workloads. Since multimedia applications impose soft real-time constraints, a key goal of our approach is to reduce energy consumption of multimedia applications without degrading performance. We present simple statistical techniques based on time series to dynamically compute the processor and I/O demands of multimedia applications and present techniques to dynamically vary the voltage settings and rotational speeds of mobile processors and disks, respectively. We implement our approaches in the Linux kernel running on a Sony Transmeta laptop and in a trace-driven simulator. Our experiments show that, compared to the traditional system-wide CPU voltage scaling approaches, our technique can achieve up to a 38.6% energy saving while delivering good performance to applications. Simulation results for our disk power management technique show a 20.3% reduction in energy consumption without any significant performance loss when compared to a traditional disk power management scheme.
Optimizing OpenMP programs on software distributed shared memory systems
Authors: Seung-Jai Min, Ayon Basumallik, Rudolf Eigenmann
Venue: International Journal of Parallel Programming (2003)

This paper describes compiler techniques that can translate standard OpenMP applications into code for distributed computer systems. OpenMP has emerged as an important model and language extension for shared-memory parallel programming. However, despite OpenMP's success on these platforms, it is not currently being used on distributed system. The long-term goal of our project is to quantify the degree to which such a use is possible and develop supporting compiler techniques. Our present compiler techniques translate OpenMP programs into a form suitable for execution on a Software DSM system. We have implemented a compiler that performs this basic translation, and we have studied a number of hand optimizations that improve the baseline performance. Our approach complements related efforts that have proposed language extensions for efficient execution of OpenMP programs on distributed systems. Our results show that, while kernel benchmarks can show high efficiency of OpenMP programs on distributed systems, full applications need careful consideration of shared data access patterns. A naive translation (similar to OpenMP compilers for SMPs) leads to acceptable performance in very few applications only. However, additional optimizations, including access privatization, selective touch, and dynamic scheduling, resulting in 31% average improvement on our benchmarks.
A lower bound for testing juntas
Authors: Hana Chockler, Dan Gutfreund
Venue: Information Processing Letters (2004)

We show an Ω(m) lower bound on the number of queries required to test whether a Boolean function depends on at most m out of its n variables. This improves a previously known lower bound for testing this property. Our proof is simple and uses only elementary techniques.
Factoring polynomials via polytopes
Authors: Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to present an algorithm for factoring bivariate polynomials which is able to exploit to some extent the sparsity of polynomials. We give details of an implementation which we used to factor randomly chosen sparse and composite polynomials of high degree over the binary field.
Dynamics of hot-potato routing in IP networks
Authors: Renata Teixeira, Aman Shaikh, Tim Griffin, Jennifer Rexford
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, a router selects the one with the closest egress point, based on the intradomain path cost. Under such hot-potato routing, an intradomain event can trigger BGP routing changes. To characterize the influence of hot-potato routing, we conduct controlled experiments with a commercial router. Then, we propose a technique for associating BGP routing changes with events visible in the intradomain protocol, and apply our algorithm to AT&T's backbone network. We show that (i) hot-potato routing can be a significant source of BGP updates, (ii) BGP updates can lag 60 seconds or more behind the intradomain event, (iii) the number of BGP path changes triggered by hot-potato routing has a nearly uniform distribution across destination prefixes, and (iv) the fraction of BGP messages triggered by intradomain changes varies significantly across time and router locations. We show that hot-potato routing changes lead to longer delays in forwarding-plane convergence, shifts in the flow of traffic to neighboring domains, extra externally-visible BGP update messages, and inaccuracies in Internet performance measurements.
Implementation of Multiple-Valued Flip-Flips Using Pass Transistor Logic
Authors: Hafiz Hasan Babu, Moinul Islam Zaber, Mazder Rahman, Rafiquil Islam
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper presents the realization of multiple-valued flip-flops (MVFF) using Pass Transistor logic. Realization of MVFF has been discussed by many authors. The existing techniques are mainly extensions of binary flip-flops, based on CMOS or TTL logic. We propose here, two different design techniques for MVFF realized by pass transistors, which can be a promising alternative to static CMOS for deep sub-micron design. We have introduced a novel circuit consisting of multiple valued pass transistors which we call 'logical sum circuit'. This particular circuit is used as the elementary design component for our second approach in MVFF design. Our proposed MVFF circuits can be attractive for its inherent lesser power and component demands in comparison with existing techniques using MOS or TTL logic.
Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
Authors: M. J. D. Powell
Venue: Mathematical Programming: Series A and B (2004)

Quadratic models of objective functions are highly useful in many optimization algorithms. They are updated regularly to include new information about the objective function, such as the difference between two gradient vectors. We consider the case, however, when each model interpolates some function values, so an update is required when a new function value replaces an old one. We let the number of interpolation conditions, m say, be such that there is freedom in each new quadratic model that is taken up by minimizing the Frobenius norm of the second derivative matrix of the change to the model. This variational problem is expressed as the solution of an (m+n+1)&#x00d7;(m+n+1) system of linear equations, where n is the number of variables of the objective function. Further, the inverse of the matrix of the system provides the coefficients of quadratic Lagrange functions of the current interpolation problem. A method is presented for updating all these coefficients in ({m+n}2) operations, which allows the model to be updated too. An extension to the method is also described that suppresses the constant terms of the Lagrange functions. These techniques have a useful stability property that is investigated in some numerical experiments.
Preference Elicitation and Query Learning
Authors: Avrim Blum, Jeffrey Jackson, Tuomas Sandholm, Martin Zinkevich
Venue: The Journal of Machine Learning Research (2004)

In this paper we explore the relationship between "preference elicitation", a learning-style problem that arises in combinatorial auctions, and the problem of learning via queries studied in computational learning theory. Preference elicitation is the process of asking questions about the preferences of bidders so as to best divide some set of goods. As a learning problem, it can be thought of as a setting in which there are multiple target concepts that can each be queried separately, but where the goal is not so much to learn each concept as it is to produce an "optimal example". In this work, we prove a number of similarities and differences between two-bidder preference elicitation and query learning, giving both separation results and proving some connections between these problems.
Stress-induced leakage current at low field in NMOS and PMOS devices with ultra-thin nitrided gate Oxide
Authors: M. Fadlallah, G. Ghibaudo, M. Bidaud, O. Simonetti, F. Guyader
Venue: Microelectronic Engineering (2004)

To support the International Technology Roadmap for Semiconductors, equivalent thickness of the gate dielectric will need to be 1.0-1.5 nm by 2004. Due to increased power consumption, intrinsic device reliability, and circuit instabilities associated with SiO2 of this thickness, a high-permittivity gate dielectric (e.g., Si3N4, HfSixOy, ZrO2) with low leakage current and at least equivalent capacitance, performance, and reliability will be required. In this work, we investigate the stress-induced leakage current (SILC) at low field for both PMOS and NMOS with ultra-thin nitrided gate oxide with thickness of 1.6 nm. C-V measurements are used to extract the oxide thickness (Tox) and the substrate doping (Np), which must be corrected for this range of oxide thickness. The SILC generation kinetics after constant voltage stress is shown to be related to that of interface or near-interface oxide traps and to the concentration of the atoms of nitrogen near to the interface. Moreover, the situation in PMOS is just contrary to the NMOS. We attribute this to the different barrier lowering in conduction band and valence band.
An interactive clustering-based approach to integrating source query interfaces on the deep Web
Authors: Wensheng Wu, Clement Yu, AnHai Doan, Weiyi Meng
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

An increasing number of data sources now become available on the Web, but often their contents are only accessible through query interfaces. For a domain of interest, there often exist many such sources with varied coverage or querying capabilities. As an important step to the integration of these sources, we consider the integration of their query interfaces. More specifically, we focus on the crucial step of the integration: accurately matching the interfaces. While the integration of query interfaces has received more attentions recently, current approaches are not sufficiently general: (a) they all model interfaces with flat schemas; (b) most of them only consider 1:1 mappings of fields over the interfaces; (c) they all perform the integration in a blackbox-like fashion and the whole process has to be restarted from scratch if anything goes wrong; and (d) they often require laborious parameter tuning. In this paper, we propose an interactive, clustering-based approach to matching query interfaces. The hierarchical nature of interfaces is captured with ordered trees. Varied types of complex mappings of fields are examined and several approaches are proposed to effectively identify these mappings. We put the human integrator back in the loop and propose several novel approaches to the interactive learning of parameters and the resolution of uncertain mappings. Extensive experiments are conducted and results show that our approach is highly effective.
A Delay Based Backoff Scheme to Support M-Commerce Over Wireless Local Area Network
Authors: Xiaohui Li, Weidong Kou, Nai'an Liu, Yuxia Xiao, Xiang Sun
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The focus of this paper is on a delay based backoff scheme to support m-commerce over wireless local area network (WLAN). Based on the Distributed Coordination Function (DCF) and the Enhanced DCF (EDCF) mechanisms in IEEE 802.11 and 802.11e, a novel backoff scheme is proposed. The scheme is to solve the problem of the packets loss and the decrease of performance due to the increasing contention window (CW) when there are continuous failure transmissions. In the proposed scheme, the CW of a packet will change dynamically with different delay for the different traffics. The performance of the new scheme is also discussed with simulation results. The results show that it helps m-commerce applications that handle text, image, and video simultaneously.
Fighting against two adversaries: page migration in dynamic networks
Authors: Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D, which is stored in one of the processors. During runtime, processors access unit size data items from the page, and the system is allowed to move the page from one processor to another in order to minimize the total communication cost.This problem was considered in the online setting numerous times by many researchers, and some online algorithms were proven to achieve a cost within a constant factor of the optimal offline solution. However, all results were achieved under the assumption that the communication costs between processors were fixed during the execution of the whole process.In this paper we consider a model in which the communication costs can change in each time step, but the pace of the changes is restricted. This is typical in mobile networks, and also models the dynamics of networks that are not exclusively dedicated to the page migration.If both changes of the network and the request sequence are given by some adversarial entity, we prove a tight bound on the competitive ratio of the problem. However, the size of this ratio motivates us to assume that the changes of communication costs are modeled by some stochastic process, and an adversary dictates only which processor issues a request. To analyze such a hybrid case, we introduce the notion of expected competitive ratio and prove that, for the case where constant number of processors perform a random walk on a torus or on a mesh of diameter √D, it is O(log2 D).
Software for Automatic Detection and Monitoring of Fluorescent Lesions in Mice
Authors: S. Foucher, M. Lalonde, L. Gagnon, A.-M. Steff
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Detection and monitoring of fluorescent lesions in mice is usually performed manually withthe help of image manipulation commercial software. The task is often daunting due to the huge amount of images and the degradation of the fluorescent signal over time. We have developed a software which aims at automatically detecting lesions based on a color analysis and segmentation of the images. The software provides tools that are used to assess the fluorescence decay rate over time using robust regression techniques.
CONFESS " An Incentive Compatible Reputation Mechanism for the Online Hotel Booking Industry
Authors: Radu Jurca, Boi Faltings
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Reputation mechanisms provide a promising alternative to the traditional security methods for preventing malicious behavior in online transactions. However, obtaining correct reputation information is not trivial. In the absence of objective authorities (or trusted third parties) which can oversee every transaction, mechanism designers have to ensure that it is rational for the participating parties to report the truth. In this paper we describe a complete reputation mechanism for the online hotel booking industry that is efficient (i.e. the equilibrium behavior is cooperative) and incentive compatible. Our mechanism discovers the true outcome of an interaction by analyzing the two reports coming from the agents involved in the interaction. Based on side payments, such a mechanism makes it profitable for long-run agents to commit to always report the truth.
A study of TaN film field electron emitter material by a Kelvin probe force microscope
Authors: Kenta Miya, Masahiro Sasaki, Shigehiko Yamamoto, Yasuhito Gotoh, Yoshinori Kawamura, Junzo Ishikawa
Venue: Microelectronic Engineering (2004)

Kelvin probe force microscope (KPFM), which is an application of the non-contact atomic force microscope, allows us to observe the images of the microscopic contact potential difference (CPD) between tip and sample and the surface topographic image, simultaneously. In this paper, we examine using KPFM the nanometer scale features of the CPD distribution and the topography of TaN thin films fabricated by various methods. The TaN film fabricated with the ion beam assisted deposition method shows substantial work function and topographic distributions in tens of nanometer scale. However, microscopic features that are responsible for the observed higher electron emission properties of TaN films fabricated by radio frequency magnetron sputtering are not found.
Normal-Based Simplification Algorithm for Meshes
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

This paper presents a new edge collapsing-based simplificationalgorithm for meshes. It is based on the variationof the vectors that are normal to faces around the collapsingedge. Its main novelty is that it uses the same criterionto choose and validate the collapsing edge. Besides, atthe best knowledge of the authors, it is the fastest simplification algorithm found in the literature using the edge collapseoperation. This simplification algorithm, in conjunctionwith its inverse algorithm (i.e. refinement algorithm),allows the automatic creation of a multiresolution schema,i.e. a sequence of meshes at different resolutions. Additionally,it makes a good trade-off between time performanceand mesh quality.
Implementing Simple Replication Protocols using CORBA Portable Interceptors and Java Serialization
Authors: Taha Bennani, Laurent Blain, Ludovic Courtes, Jean-Charles Fabre, Marc-Olivier Killijian, Eric Marsden, Francois Taiani
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The goal of this paper is to assess the value of simplefeatures that are widely available in off-the-shelf CORBAand Java platforms for the implementation of fault-tolerancemechanisms in industry-grade systems. Thiswork builds on knowledge gained at LAAS from previouswork on the prototyping of reflective fault tolerantframeworks. We describe how we used the interceptionand state capture mechanisms that are available inCORBA and Java to implement a simple replicationstrategy on a small middleware-based system built uponGNU/Linux and JOrbacus. We discuss the benefits andthe limits of the resulting system from a practical point of view.
Managing a portfolio of overlay paths
Authors: Daria Antonova, Arvind Krishnamurthy, Zheng Ma, Ravi Sundaram
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneously. We consider the problem of computing a set of paths and the relative amounts of data conveyed through them in order to provide the desired level of performance for data streams. Given the expectation, variance, and covariance of an appropriate metric of interest for overlay links, we attempt to solve the underlying resource allocation problem by applying methods used in managing a finance portfolio. We observe that the flow allocation problem requires constrained application of these methods, and we discuss the tractability of enforcing the constraints. We finally present some simulation results to evaluate the effectiveness of our proposed techniques.
A multistrategy approach for digital text categorization from imbalanced documents
Authors: M. Dolores del Castillo, José Ignacio Serrano
Venue: ACM SIGKDD Explorations Newsletter (2004)

The goal of the research described here is to develop a multistrategy classifier system that can be used for document categorization. The system automatically discovers classification patterns by applying several empirical learning methods to different representations for preclassified documents belonging to an imbalanced sample. The learners work in a parallel manner, where each learner carries out its own feature selection based on evolutionary techniques and then obtains a classification model. In classifying documents, the system combines the predictions of the learners by applying evolutionary techniques as well. The system relies on a modular, flexible architecture that makes no assumptions about the design of learners or the number of learners available and guarantees the independence of the thematic domain.
Walking with and without walking: perception of distance in large-scale urban areas in reality and in virtual reality
Authors: Michael M. Popp, Edna Platzer, Matthias Eichner, Marion Schade
Venue: Presence: Teleoperators and Virtual Environments (2004)

The perception of distance when walking through an urban area depends on several factors. In addition to knowledge of the physical length of a route based on known parameters such as the walking speed and the time or number of steps, this paper also discusses external factors such as the visual appearance and details of the route and internal factors such as the physiological effort or emotional states during the walk. It is not clear which of the latter factors are stored in memory and are used to estimate a perceived distance. The hypothesis of distance estimation on the basis of perceived and remembered effort is held by several researchers. The reported experiments tried to clarify that question with research in actual reality and virtual reality. In doing so, we were able to separate the component of real walking from other sources that possibly affect distance estimation. In addition, this work demonstrates the power of experiments in VR compared with equivalent experiments in reality.
A Proposed Mechanism for Super-Pipelined Instruction-Issue for ILP Stack Machines
Authors: Chris Bailey
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

A resurgence of interest in hardware stack-machine architectures, in which an implicitly addressed operand stack mode of computation is used, has followed closely in the wake of the growth of Java technology. However hardware for direct execution of stack-based machine level operations suffer from a lack of development in areas of advanced machine architecture, in particular where instruction-level parallelism is concerned. In this paper the author proposes a mechanism for super-pipelined issue of stack-based instructions to support an in-order issue policy with out-of-order completion, and introduces some preliminary results in order to illustrate possible trade-offs and issues likely to be valuable focal points for a full performance assessment in future work.