ppxscal/embedding_network huggingface dataset:
FreeLoader: Scavenging Desktop Storage Resources for Scientific Data
Authors: Sudharshan S. Vazhkudai, Xiaosong Ma, Vincent W. Freeh, Jonathan W. Strickland, Nandan Tammineedi, Stephen L. Scott
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

High-end computing is suffering a data deluge from experiments, simulations, and apparatus that creates overwhelming application dataset sizes. End-user workstations-despite more processing power than ever before-are ill-equipped to cope with such data demands due to insufficient secondary storage space and I/O rates. Meanwhile, a large portion of desktop storage is unused. We present the FreeLoader framework, which aggregates unused desktop storage space and I/O bandwidth into a shared cache/scratch space, for hosting large, immutable datasets and exploiting data access locality. Our experiments show that FreeLoader is an appealing low-cost solution to storing massive datasets, by delivering higher data access rates than traditional storage facilities. In particular, we present novel data striping techniques that allow FreeLoader to efficiently aggregate a workstation's network communication bandwidth and local I/O bandwidth. In addition, the performance impact on the native workload of donor machines is small and can be effectively controlled.
Predicting relative performance of classifiers from samples
Authors: Rui Leite, Pavel Brazdil
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

This paper is concerned with the problem of predicting relative performance of classification algorithms. It focusses on methods that use results on small samples and discusses the shortcomings of previous approaches. A new variant is proposed that exploits, as some previous approaches, meta-learning. The method requires that experiments be conducted on few samples. The information gathered is used to identify the nearest learning curve for which the sampling procedure was carried out fully. This in turn permits to generate a prediction regards the relative performance of algorithms. Experimental evaluation shows that the method competes well with previous approaches and provides quite good and practical solution to this problem.
Embroidering Electrical Interconnects with Conductive Yarn for The Integration of Flexible Electronic Modules into Fabric
Authors: Torsten Linz, Christine Kallmayer, Rolf Aschenbrenner, Herbert Reichl
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper shows how common embroidery can be used to integrate electronics into textile environment in a light and cost efficient way. A mechanism has been developed to embroider through flexible electronic modules using conductive yarn, thus creating an interconnection with other modules like sensors, batteries, textile keyboards, etc. Mold encapsulation has been found to improve the electrical contact and support the reliability of the whole system.
On Absolute Stability and Semi-Active Control of a Magnetorheological Fluid Vibration Suppression System
Authors: Ganesh B. Maganti, S. N. Singh, Woosoon Yim
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

This paper treats the question of absolute stability and control of a two degree-of-freedom vibration suppression system. For the position control and vibration suppression of the payload, a magnetorheological (MR) fluid damper is chosen. First, it is shown that for any arbitrarily time varying input current, the system is absolutely stable. Then a nonlinear inverse (feedback linearizing) control law is designed.
Profitable services in an uncertain world
Authors: Florentina I. Popovici, John Wilkes
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

In a service-oriented, utility-computing, Grid-like world, service providers will execute jobs on behalf of their clients on systems rented from resource providers. This poses many challenges to the service provider, such as choosing which jobs to admit, when to run them, whether to execute them on one system or many, and how many resources to rent. To complicate matters, the service provider may experience resource uncertainty an inability to get the resources it needs or expects. The result will be sub-optimal choices of which jobs to accept and when to run them, and the service provider may have to pay penalties to its clients. Using an economics-based approach, we have developed scheduling policies that systematically address these problems. We show that the new policies deliver significantly more profit (or added value) than ones oblivious to such concerns.
Spatial Clustering of Chimpanzee Locations for Neighborhood Identification
Authors: Sandeep Mane, Carson Murray, Shashi Shekhar, Jaideep Srivastava, Anne Pusey
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Since 1960, the chimpanzees (Pan troglodytes) of Gombe National Park, Tanzania, have been studied by behavioral ecologists, including Jane Goodall. Data have been collected for more than 40 years and are being analyzed by researchers in order to increase our understanding of the social structure of chimpanzees. In this paper, we consider the following question of interest to behavioral ecologists — "Does clustering exist among female chimpanzees in terms of their spatial locations?" The analysis of this question will help behavioral ecologists to learn about the space use and the social interactions between female chimpanzees. The data collected for this analysis are marked spatial point patterns over the park. Current spatial clustering methods lack the ability to handle such marked point patterns directly. This paper presents a novel application of spatial point pattern analysis and data mining techniques to the ecological problem of clustering female chimpanzees. We found that Ripley's K-function provides a powerful statistical tool for evaluating clustering behavior among spatial point patterns. We then proposed two clustering approaches for marked point patterns using the K-function. Experimental results using the proposed clustering methods provide significant insight into the dynamics of female chimpanzee space use and into the overall social stucture of the species. In addition, the proposed methods can be extended to also include temporal information.
Fast Adaptive Inter Mode Decision Method in H.264 Based on Spatial Correlation
Authors: Bin Feng, Guang-xi Zhu, Wen-yu Liu
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The computation complexity of H.264 is so large that make it difficult to be used in practical applications especially in real time environment. In this paper, a fast adaptive inter modes decision method is proposed to reduce the complexity of H.264 encoder. Firstly the candidate inter modes can be limited in a small mode group (MG) by using the characteristics of the motion compensated residual image. Then the most probable mode (MPM) of the MB is predicted on the basis of the modes of the neighboring macroblocks. The overlapped mode groups and dynamic adjusted thresholds adopted in the proposed method can make the best mode lies within the chosen MG with great possibility which leads to extensively computation reduction with acceptable loss in quality. The experimental results show that the proposed method can save the encoding time up to 64% on average with -0.45dB performance degradation.
Online Hierarchical Clustering in a Data Warehouse Environment
Authors: Elke Achtert, Christian Bohm, Hans-Peter Kriegel, Peer Kroger
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Many important industrial applications rely on data mining methods to uncover patterns and trends in large data warehouse environments. Since a data warehouse is typically updated periodically in a batch mode, the mined patterns have to be updated as well. This requires not only accuracy from data mining methods but also fast availability of up-to-date knowledge, particularly in the presence of a heavy update load. To cope with this problem, we propose the use of online data mining algorithms which permanently store the discovered knowledge in suitable data structures and enable an efficient adaptation of these structures after insertions and deletions on the raw data. In this paper, we demonstrate how hierarchical clustering methods can be reformulated as online algorithms based on the hierarchical clustering method OPTICS, using a density estimator for data grouping. We also discuss how this algorithmic schema can be specialized for efficient online single-link clustering. A broad experimental evaluation demonstrates that the efficiency is superior with significant speed-up factors even for large bulk insertions and deletions.
Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols
Authors: Yee Wei Law, Lodewijk van Hoesel, Jeroen Doumen, Pieter Hartel, Paul Havinga
Venue: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (2005)

A typical wireless sensor node has little protection against radio jamming. The situation becomes worse if energy-efficient jamming can be achieved by exploiting knowledge of the data link layer. Encrypting the packets may help prevent the jammer from taking actions based on the content of the packets, but the temporal arrangement of the packets induced by the nature of the protocol might unravel patterns that the jammer can take advantage of even when the packets are encrypted. By looking at the packet interarrival times in three representative MAC protocols, S-MAC, LMAC and B-MAC, we derive several jamming attacks that allow the jammer to jam S-MAC, LMAC and B-MAC energy-efficiently. The jamming attacks are based on realistic assumptions. The algorithms are described in detail and simulated. The effectiveness and efficiency of the attacks are examined. Careful analysis of other protocols belonging to the respective categories of S-MAC, LMAC and B-MAC reveal that those protocols are, to some extent, also susceptible to our attacks. The result of this investigation provides new insights into the security considerations of MAC protocols.
Convergence of Adaptive Finite Element Methods for General Second Order Linear Elliptic PDEs
Authors: Khamron Mekchay, Ricardo H. Nochetto
Venue: SIAM Journal on Numerical Analysis (2005)

We prove convergence of adaptive finite element methods (AFEMs) for general (nonsymmetric) second order linear elliptic PDEs, thereby extending the result of Morin, Nochetto, and Siebert [{\it SIAM J. Numer.\ Anal.}, 38 (2000), pp. 466--488; {\it SIAM Rev.}, 44 (2002), pp. 631--658]. The proof relies on quasi-orthogonality, which accounts for the bilinear form not being a scalar product, together with novel error and oscillation reduction estimates, which now do not decouple. We show that AFEMs are a contraction for the sum of energy error plus oscillation. Numerical experiments, including oscillatory coefficients and {both coercive and noncoercive} convection-diffusion PDE, illustrate the theory and yield optimal meshes.
Element Matching by Concatenating Linguistic-Based Matchers and Constraint-Based Matcher
Authors: Jingtao Zhou, Shusheng Zhang, Mingwei Wang, Han Zhao, Chao Zhang, Peng Li, Xiaofeng Dong, Kefei Wang
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Although a lot of previous work on schema matching has developed many partial automatic matches for specific application domains, combining multiple match techniques enables achieving high accuracy for a large variety of match circumstances. In this context, we present a schema-based element matching approach1 that concatenates linguistic-based matchers and a constraint-based matcher. We propose a basic processing of our element level match approach in terms of a sequence of linguistic-based match and constraint-based match. We also provide a composite element name matcher to automatically combine linguistic-based match algorithms with a maximum priority strategy, and a neural network matcher to categorize elements of schemas by using element constraints with results from composite name matcher for joint consideration of multiple criteria. The concatenation of composite name matcher and neural network matcher enable our approach to adapt to more complex matching circumstance.
On Complex Codimension-One Foliations Transverse Fibrations
Authors: Bruno Scárdua
Venue: Journal of Dynamical and Control Systems (2005)

We study codimension-one holomorphic foliations which are transverse to fibrations and, therefore, are conjugate to suspensions of groups of Möbius transformations. For the general case, we assume that there exists an invariant transverse measure. The existence of such an invariant transverse measure is proved for the case where there is a leaf with the subexponential growth or the basis has an amenable fundamental group. This result applies, e.g., for the study of amenable Lie group actions on complex projective spaces.
On Base Station Selection for Anycast Flow Routing in Energy-Constrained Wireless Sensor Networks
Authors: Y. Thomas Hou, Yi Shi, Hanif D. Sherali
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Energy constraints have had a significant impact on the design and operation of wireless sensor networks. In this paper, we investigate base station selection (or anycast) problem in wireless sensor networks. We consider a wireless sensor network having multiple base stations (data sink nodes), where each source node must send all its locally generated data to only one base station. To maximize the network lifetime, it is essential to optimally match each source node to a particular base station in addition to finding an optimal routing solution. We propose a polynomial time heuristic for optimal base station selection for anycast via a sequential fixing procedure, under the assumption that the bit rate from each source node is constant. Through extensive simulation results, we show that this heuristic has excellent performance behavior and is a tight low bound that is very close to optimal solution for the original optimization problem.
Data persistence in sensor networks: towards optimal encoding for data recovery in partial network failures
Authors: Abhinav Kamra, Jon Feldman, Vishal Misra, Dan Rubenstein
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Sensor networks consist of a number of sensors spread across a geographical area. Each sensor has communication capability and some level of intelligence for signal processing and networking of data. Each sensor node in the network routinely 'senses' and stores data from its immediate environment. An important requirement of the sensor network is that the collected data be disseminated to the proper end users. In some cases, there are fairly strict requirements on this communication. For example, the detection of an intruder in a surveillance network should be immediately communicated to the police authorities. Each sensor node also has some storage capacity to store the collected data or to assemble the data prior to communicating it to another node.
Effects of ALD HfO2 thickness on charge trapping and mobility
Authors: J. H. Sim, S. C. Song, P. D. Kirsch, C. D. Young, R. Choi, D. L. Kwong, B. H. Lee, G. Bersuker
Venue: Microelectronic Engineering (2005)

The effects of HfO2 thickness on charge trapping and mobility were investigated. The impact of fast transient electron trapping on DC measurements results in underestimating channel carrier mobility. Scaling the physical thickness of the HfO2 dielectric causes less charge trapping and higher mobility. A HfO2-based high-k solution requires fine-tuning the thickness of the high-k film to maintain a balance between electron trapping in thicker films and increased leakage current in thinner films.
Low-cost High-bandwidth Tree Network for PC Clusters based on Tagged-VLAN Technology
Authors: Shinichi Miura, Taisuke Boku, Mitsuhisa Sato, Daisuke Takahashi, Takayuki Okamoto
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In the present paper, we propose a practical and feasible method to construct VLAN-based Fat Tree network that provides wide bisection bandwidth on a tree network constructed with cheap Layer-2 Gigabit Ethernet switches for high-performance PC clusters. The proposed method provides a complete flat IP address space with multiple upperlevel links and switches to configure a fat tree based on simple routing by IEEE 802.1q tagged VLAN. We modified the pseudo device driver for tagged VLAN on the Linux operating system so as to implement an enhanced control feature in IEEE 802.1q frames in order to build a large-scale fat tree. As a result of preliminary performance evaluation on a small cluster, we confirmed that the proposed system works correctly without increasing the overhead and an ordinary MPI library can be applied without modification to provide wide bisection bandwidth on the system.
Performance Improvement of Configurable Processor Architectures Using a Variable Clock Period
Authors: Bill Pontikakis, Francois-R. Boyer, Yvon Savaria
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Programmable and configurable processors are becoming increasingly popular for embedded wearable devices. In configurable processors technology it is a common practice to define specialized instructions in order to boost the performance of the device. These instructions may not fit in a single clock period and therefore, may require two clock periods for completion of a given task. In the past, we have proposed a method to generate a clock where each cycle can have a different length, and in this paper we will investigate the performance gain it can give compared to standard clocking. Using our variable fractional clock period method, a gain of more than 10% in performance is easily obtained, with a maximum of 21%, compared to current best clocking techniques used in extensible configurable processors. We also show that the overall speedup of our method follows the well known Amdahl¿s law, but without quantization of the acceleration factor.
Robust position-force control of robot manipulator in contact with linear dynamic environment
Authors: Branko Karan
Venue: Robotica (2005)

The paper presents a control scheme for simultaneous control of position and force of robot manipulator in contact with an elastodynamic environment. The control makes the assumption that interaction force between the robot and environment is adequately modeled by a second-order linear model with constant coefficients, and its implementation requires the knowledge of only boundary values of the environment parameters. It is shown that, provided that robot dynamics is exactly modeled, the scheme ensures asymptotic convergence of errors along nominal trajectories characterized by constant prescribed interaction forces and constant prescribed velocities along the contact surface.
Multi-Chain Multi-Leader Based Data Aggregationand and the Evaluation Metric QoDA
Authors: Zhang Xi-huang, Xu Wen-bo
Venue: Proceedings of the IEEE International Workshop (2005)

In chain based wireless sensor network(WSN), some particular nodes called leaders aggregate the information get from its queue node and send to a base station periodically. Due to the limited battery life, energy efficiency is becoming a major challenging problem in these power-constrained networks. Chain-based protocols construct a transmission chain connecting all nodes to save energy dissipation of data transmission. After reviewing several existing chain-based protocols, a multi-chain multi-leader (MCML) based scheme is suggested, which is implemented by an Minimum Total Energy Algorithm for chain construction. This algorithm uses a sequence of insertions to add the least amount of energy consumption to the whole chain. It consumes less transmission power compared to the closest neighbor algorithm. In addition, a entropy based metric, the Quality of Data Aggregation (QoDA), is defined to evaluate the performance of WSN.
Visualizing Audio in Group Table Conversation
Authors: Karrie Karahalios, Tony Bergstrom
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

In this work, we create social visualizations of aural group conversation. These visualizations are tailored to a table setting. Examples of such settings are a family sitting about a table eating dinner or colleagues sitting about a table in a meeting. The form of the visualization is highly coupled to its function. People sit about the table structure and see their conversation visualized on the table surface as they speak. Using this physical structure, we present two graphical table interfaces. The first interface depicts the rhythm and conversational patterns in table top interaction; the second visualization extends this theme by incorporating a voting mechanism to highlight agreement and disagreement in spoken interaction. The visualizations evolve over time to create an evocative, graphical, interactive snapshot of the entire conversation within that table space.
A Capability-Based Access Control Architecture for Multi-Domain Publish/Subscribe Systems
Authors: Lauri I. W. Pesonen, David M. Eyers, Jean Bacon
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Publish/subscribe has emerged as an attractive communication paradigm for building Internet-wide distributed systems by decoupling message senders from receivers. So far most of the research on publish/subscribe has focused on efficient event routing, event filtering, and composite event detection. Very little research has been published regarding securing publish/subscribe systems. In this paper we present a capability-based access control architecture that enables multiple domains to co-operate in order to build a shared, wide-scale publish/subscribe system. Our architecture employs SPKI authorisation certificates for delegating access control responsibilities to access control services within independent domains in order to balance security and scalability. The architecture supports controlling access both for new event brokers joining the broker network as well as for clients accessing the publish/subscribe API.
Wire-length prediction using statistical techniques
Authors: J. L. Wong, A. Davoodi, V. Khandelwal, A. Srivastava, M. Potkonjak
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

We address the classic wire-length estimation problem and propose a new statistical wire-length estimation approach that captures the probability distribution function of net lengths after placement and before routing. The wire-length prediction model was developed using a combination of parametric and non-parametric statistical techniques. The model predicts not only the length of the net using input parameters extracted from the floorplan of a design, but also probability distributions that a net with given characteristics obtained after placement will have a particular length. The model is validated using both learn-and-test and resubstitution techniques. The model can be used for a variety of purposes, including the generation of a large number of statistically sound and therefore realistic instances of designs. We applied the net models to the probabilistic buffer insertion problem and obtained substantial improvement in net delay after routing.