ppxscal/embedding_network huggingface dataset:
AGiDS: A Grid-Based Strategy for Distributed Skyline Query Processing
Authors: João B. Rocha-Junior, Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg
Venue: Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems (2009)

Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. A challenging problem is to support skyline queries in distributed environments, where data is scattered over independent sources. The query response time of skyline processing over distributed data depends on the amount of transferred data and the query processing cost at each server. In this paper, we propose AGiDS, a framework for efficient skyline processing over distributed data. Our approach reduces significantly the amount of transferred data, by using a grid-based data summary that captures the data distribution on each server. AGiDS consists of two phases to compute the result: in the first phase the querying server gathers the grid-based summary, whereas in the second phase a skyline request is sent only to the servers that may contribute to the skyline result set asking only for the points of non-dominated regions. We provide an experimental evaluation showing that our approach performs efficiently and outperforms existing techniques.
A two electrode C-NiO Nafion amperometric sensor for NO2 detection
Authors: A. Fort, C. Lotti, M. Mugnaini, R. Palombari, S. Rocchi, V. Vignoli
Venue: Microelectronics Journal (2009)

In this paper, the authors propose a new and simple Nafion-based NO"2 amperometric sensor, a dedicated measurement system, and a measurement protocol. The system has a linear response to NO"2 concentration, and a sensitivity up to 90nA/ppm. Moreover, the developed sensor shows a satisfactory repeatability and a low cross-sensitivity to common interfering gases such as CO and oxygen.
High Performance Matrix Multiplication on Many Cores
Authors: Nan Yuan, Yongbin Zhou, Guangming Tan, Junchao Zhang, Dongrui Fan
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Moore's Law suggests that the number of processing cores on a single chip increases exponentially. The future performance increases will be mainly extracted from thread-level parallelism exploited by multi/many-core processors (MCP). Therefore, it is necessary to find out how to build the MCP hardware and how to program the parallelism on such MCP. In this work, we intend to identity the key architecture mechanisms and software optimizations to guarantee high performance for multithreaded programs. To illustrate this, we customize a dense matrix multiplication algorithm on Godson-T MCP as a case study to demonstrate the efficient synergy and interaction between hardware and software. Experiments conducted on the cycle-accurate simulator show that the optimized matrix multiplication could obtain 97.1% (124.3GFLOPS) of the peak performance of Godson-T.
Nonlinear Dynamic Behaviors of Single Disk Symmetrical Flexible Rotor-Bearing System
Authors: Rong Dai, Yongfang Zhang, Yanjun Lu, Di Hei
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The effect of calculation perturbation is compensated at each calculation step of Newmark method, and a new numerical method for determining unbalanced responses ofdynamic systems is obtained. The proposed method is employedto analyze nonlinear dynamic behaviors of single disk symmetrical flexible rotor-bearing system. It is shown that the proposed method has high precision by comparison of numerical results using Runge-Kutta method and the proposed method. Numerical examples reveal complex nonlinear behaviors such as periodic, quasi-periodic, co-existing solutions and so on.
The Key Theorem of Statistical Learning Theory with Fuzzy Samples
Authors: Liu Yang, Hu Shicheng, Dong Kaikun, Li Bin, Xu Yongdong
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

The key theorem of statistical learning theory provides a theoretical basis for the applied research of support vector machine etc., so it is one of the most important theorems in learning theory. By combining fuzzy set with statistical learning theory, the key theorem of learning theory is generalized. We replace random samples with fuzzy samples. Fuzzy empirical risk minimization principle is proposed. And the key theorem of statistical learning theory with fuzzy samples is proven.
Fighting Insomnia: A Secure Wake-Up Scheme for Wireless Sensor Networks
Authors: Rainer Falk, Hans-Joachim Hof
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Sleep deprivation attacks are still an unsolved but critical problem in sensor networks. They aim on quickly exhausting energy reserves of battery-powered sensor nodes by continuously sending messages to the node, preventing the attacked node to switch to an energy-saving sleep state. Sleep deprivation attacks come also in the form of sending traffic that causes a sleeping node to wake-up. Sleep deprivation attacks have the potential to lessen the lifetime of typical sensor nodes from years to days or even hours. One important communication standard for sensor networks is IEEE 802.15.4 that defines cryptographic protection of frames. While many attacks like eavesdropping or modification of frames are covered by the available security mechanisms, these mechanisms do not address sleep deprivation attacks. This paper proposes a secure wake-up scheme that activates a sensor node by a secure wake-up radio from a sleep state only if messages from an authenticated and legitimate node are pending. A lightweight security verification scheme is used that can easily be performed without requiring the node to change to active state.
SemEval-2010 task 2: cross-lingual lexical substitution
Authors: Ravi Sinha, Diana McCarthy, Rada Mihalcea
Venue: Proceedings of the Workshop on Semantic Evaluations: Recent Achievements and Future Directions (2009)

In this paper we describe the SemEval-2010 Cross-Lingual Lexical Substitution task, which is based on the English Lexical Substitution task run at SemEval-2007. In the English version of the task, annotators and systems had to find an alternative substitute word or phrase for a target word in context. In this paper we propose a task where the target word and contexts will be in English, but the substitutes will be in Spanish. In this paper we provide background and motivation for the task and describe how the dataset will differ from a machine translation task and previous word sense disambiguation tasks based on parallel data. We describe the annotation process and how we anticipate scoring the system output. We finish with some ideas for participating systems.
Research on the Application of Improved Hybrid Genetic Algorithm in Open Vehicle Routing Problem
Authors: Ren Chunyu, Li Shiwei, Yue Bing
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Open vehicle route problem of logistics distribution is the important step optimizing logistics distribution. According to the traditional genetic algorithm shortcomings of slowly convergent speed, weakly partial searching ability and easily premature, therefore, hybrid genetic algorithm is used to get the optimization solution, namely, use dualistic coding so as to simplify the problem and improve the searching efficiency of genetic algorithm. The individual amount control choice strategy so as to guard the diversity of group. Improved ordinal crossover operators can avoid destroying good gene parts during the course of ordinal crossover so as that the algorithm can be convergent to the optimization as whole. Finally, the good performance of improved algorithm can be proved by experiment calculation and concrete examples.
Distributed Intelligent Systems: A Coordination Perspective, 1st edition
Authors: Abdellah Bedrouni, Ranjeev Mittu, Abdeslem Boukhtouta, Jean Berger
Venue:  (2009)

Distributed Intelligent Systems: A Coordination Perspective addresses and comprehensively answers commonly asked questions about coordination in agent-oriented distributed systems. Characterizing the state-of-the-art research in the field of coordination with regard to the development of distributed agent-oriented systems is a particularly complex endeavour, as the space of available approaches is indeed considerable, and research is independently conducted in a great number of domains. While existing books deal with specific aspects of coordination, the major contribution of this book lies in the attempt to provide an in-depth review covering a wide range of issues regarding multi-agent coordination in Distributed Artificial Intelligence. In addition to reporting various sources of confusion, this book outlines the existence of a plethora of strategies and techniques adapted to different problems, agent-oriented systems, environments, and domains. In short, the current book identifies the absence of a single unified approach in addressing multi-agent coordination problems arising in any system or organization. This book, written by world-class leaders in this field, dedicates itself to providing a state-of-the-art review of current coordination strategies and techniques. The book also describes a broad range of application domains which implement many of the coordination strategies and techniques from the field of multi-agent systems. The application domains include defense, transportation, health care, telecommunication and e-business. Based on current practical deployed applications and existing capabilities, this book also identifies and thoroughly examines trends, challenges, and future agent-oriented research directions. Key features: Unveils the lack of coherence and order that characterizes the area of research pertaining to coordination of distributed intelligent systems Examines coordination models, frameworks, strategies and techniques to enable the development of distributed intelligent agent-oriented systems. Provides specific recommendations to realize more widespread deployment of agent-based systems Distributed Intelligent Systems: A Coordination Perspective is designed for a professional audience composed of practitioners and researchers in industry. This book is also suitable as a reference or secondary textbook for advanced-level students in computer science and engineering.
Efficient Implementation of Carry-Save Adders in FPGAs
Authors: Javier Hormigo, Manuel Ortiz, Francisco Quiles, Francisco J. Jaime, Julio Villalba, Emilio L. Zapata
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

Most Field Programmable Gate Array (FPGA) devices have a special fast carry propagation logic intended to optimize addition operations. Theredundant adders do not easily fit into this specialized carry-logic and, consequently, they require double hardware resources than carry propagate adders, while showing a similar delay for small size operands. Therefore, carry-save adders are not usually implemented on FPGA devices, although they are very useful in ASIC implementations. In this paper we study efficient implementations of carry-save adders on FPGA devices, taking advantage of the specialized carry-logic. We show that it is possible to implement redundant adderswith a hardware cost close to that of a carry propagate adder. Specifically, for 16 bits and bigger wordlengths, redundant adders are clearly faster and have an area requirement similar to carry propagate adders. Among all the redundant adders studied, the 4:2 compressor is the fastest one, presents the best exploitation of the logic resources within FPGA slices and the easiest way to adapt classical algorithms to efficiently fit FPGA resources.
Improving mid-range reordering using templates of factors
Authors: Hieu Hoang, Philipp Koehn
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We extend the factored translation model (Koehn and Hoang, 2007) to allow translations of longer phrases composed of factors such as POS and morphological tags to act as templates for the selection and reordering of surface phrase translation. We also reintroduce the use of alignment information within the decoder, which forms an integral part of decoding in the Alignment Template System (Och, 2002), into phrase-based decoding. Results show an increase in translation performance of up to 1.0% bleu for out-of-domain French-English translation. We also show how this method compares and relates to lexicalized reordering.
Visualizing Shear Stress in G&ouml;rtler Vortex Flow
Authors: Tandiono, S. H. Winoto, D. A. Shah
Venue: Journal of Visualization (2009)

Shear stress distributions were obtained from velocity measurements in a concave surface boundary layer flow in the presence of G&ouml;rtler vortices by means of a single hot-wire probe for several streamwise (x) locations. A set of vertical wires of 0.20 mm diameter were positioned at a distance of 10 mm upstream from the leading edge of a concave surface of radius of curvature R = 1.0 m to pre-set the wavelength of the vortices so to obtain the most amplified wavelength G&ouml;rtler vortices. Consequently, the wavelength of the vortices was set equal to the wire spacing and preserved downstream. In addition to the high shear regions near the wall, one positive peak at the head of the mushroom-like structures and two relatively weak negative peaks at the vicinity of the low-speed streaks are found in the iso-&part;u/&part;y contours. They are believed to be related to the formation of the inflectional point in the velocity profile across boundary layer. The occurrence of the inflection points in the spanwise distributions of streamwise velocity component u is associated with the appearance of the second peak of the &part;u/&part;z shear near the boundary layer edge. The nonlinear effect of G&ouml;rtler instability is to increase the wall shear stress, and further enhancement beyond the turbulent values is due to the presence of secondary instability.
Hello World! Computer Programming for Kids and Other Beginners
Authors: Warren Sande, Carter Sande
Venue:  (2009)

"Computer programming is a powerful tool for children to 'learn learning,' that is, to learn the skills of thinking and problem-solving...Children who engage in programming transfer that kind of learning to other things."--Nicholas Negroponte, the man behind the One Laptop Per Child project that hopes to put a computer in the hands of every child on earth, January 2008 Your computer won't respond when you yell at it. Why not learn to talk to your computer in its own language? Whether you want to write games, start a business, or you're just curious, learning to program is a great place to start. Plus, programming is fun! Hello World! provides a gentle but thorough introduction to the world of computer programming. It's written in language a 12-year-old can follow, but anyone who wants to learn how to program a computer can use it. Even adults. Written by Warren Sande and his son, Carter, and reviewed by professional educators, this book is kid-tested and parent-approved. You don't need to know anything about programming to use the book. But you should know the basics of using a computer--e-mail, surfing the web, listening to music, and so forth. If you can start a program and save a file, you should have no trouble using this book.
Defining strong privacy for RFID
Authors: Ari Juels, Stephen A. Weis
Venue: ACM Transactions on Information and System Security (TISSEC) (2009)

In this work, we consider privacy in Radio Frequency IDentification (RFID) systems. Our contribution is twofold: (i) We propose a simple, formal definition of strong privacy useful for basic analysis of RFID systems, as well as a different (weaker) definition applicable to multiverifier systems; (ii) We apply our definition to reveal vulnerabilities in several proposed privacy-enhancing RFID protocols; and (iii) We formally analyze and suggest improvements to hash-locks, one of the first privacy-enhancing RFID protocols in the literature.
An Introduction to High-Level Synthesis
Authors: Philippe Coussy, Daniel D. Gajski, Michael Meredith, Andres Takach
Venue: IEEE Design Test (2009)

Editor's note:High-level synthesis raises the design abstraction level and allows rapid generation of optimized RTL hardware for performance, area, and power requirements. This article gives an overview of state-of-the-art HLS techniques and tools.&#x2014;Tim Cheng, Editor in Chief
Automatically Structuring Text for Audio Learning
Authors: Barbara Leporini, Maria Claudia Buzzi, Marina Buzzi, Giulio Mori
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

In recent years podcasting has been in great demand as a recreation and a learning tool. In this paper we describe the design and implementation of a system for automatically converting documents to structured audio. Our prototype is a Web-based service for preparing structured audio material to download on portable mp3 players. The on-line service is especially designed to aid users with special needs, such as the visually impaired. Ultimately, this would enhance comprehension for all.
Joint Affine and Illumination Estimation Using Scale Manipulation Features
Authors: Kobi Bentolila, Joseph M. Francos
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

We present a novel image transform called Scale Manipulation Features (SMF). The transform calculates affine invariant features of objects in a global manner and avoids using any sort of edge detection. The transform can be used for registration of affine transformed images in the presence of non homogenous illumination changes and for estimation of the illumination changes. The computational load of the method is relatively low since it is linear in the data size. In this paper we introduce the transform and demonstrate its applications for illumination compensation and for object registration in the presence of an affine geometric transformation and varying illumination.
Towards a Linear Combination of Dichotomizers by Margin Maximization
Authors: Claudio Marrocco, Mario Molinara, Maria Teresa Ricamato, Francesco Tortorella
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

When dealing with two-class problems the combination of several dichotomizers is an established technique to improve the classification performance. In this context the margin is considered a central concept since several theoretical results show that improving the margin on the training set is beneficial for the generalization error of a classifier. In particular, this has been analyzed with reference to learning algorithms based on boosting which aim to build strong classifiers through the combination of many weak classifiers. In this paper we try to experimentally verify if the margin maximization can be beneficial also when combining already trained classifiers. We have employed an algorithm for evaluating the weights of a linear convex combination of dichotomizers so as to maximize the margin of the combination on the training set. Several experiments performed on publicly available data sets have shown that a combination based on margin maximization could be particularly effective if compared with other established fusion methods.
Matching Hierarchies of Deformable Shapes
Authors: Nadia Payet, Sinisa Todorovic
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

This paper presents an approach to matching parts of deformable shapes. Multiscale salient parts of the two shapes are first identified. Then, these parts are matched if their immediate properties are similar, the same holds recursively for their subparts, and the same holds for their neighbor parts. The shapes are represented by hierarchical attributed graphs whose node attributes encode the photometric and geometric properties of corresponding parts, and edge attributes capture the strength of neighbor and part-of interactions between the parts. Their matching is formulated as finding the subgraph isomorphism that minimizes a quadratic cost. The dimensionality of the matching space is dramatically reduced by convexifying the cost. Experimental evaluation on the benchmark MPEG-7 and Brown datasets demonstrates that the proposed approach is robust.
Reflection of a Year Long Model-Driven Business and UI Modeling Development Project
Authors: Noi Sukaviriya, Senthil Mani, Vibha Sinha
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Model-driven software development enables users to specify an application at a high level --- a level that better matches problem domain. It also promises the users with better analysis and automation. Our work embarks on two collaborating domains --- business process and human interactions --- to build an application. Business modeling expresses business operations and flows then creates business flow implementation. Human interaction modeling expresses a UI design, its relationship with business data, logic, and flow, and can generate working UI. This double modeling approach automates the production of a working system with UI and business logic connected. This paper discusses the human aspects of this modeling approach after a year long of building a procurement outsourcing contract application using the approach --- the result of which was deployed in December 2008. The paper discusses in multiple areas the happy endings and some heartache. We end with insights on how a model-driven approach could do better for humans in the process.
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
Authors: Łukasz Kowalik, Marcin Mucha
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

In this paper, we study the asymmetric traveling salesman problem (ATSP) with strengthened triangle inequality, i.e. for some $\gamma\in [\frac{1}{2},1)$ the edge weights satisfy w(u,v) ≤ γ(w(u,x) + w(x,v)) for all distinct vertices u,v,x. We present two approximation algorithms for this problem. The first one is very simple and has approximation ratio $\frac{1}{2(1-\gamma)}$, which is better than all previous results for all $\gamma \in (\frac{1}{2},1)$. The second algorithm is more involved but it also gives a much better approximation ratio: $\frac{2-\gamma}{3(1-\gamma)}+O(\frac{1}{n})$ when γ > γ 0, and $\frac{1}{2}(1+\gamma)^2 + \epsilon$ for any ε> 0 when γ ≤ γ 0, where γ 0 &asymp; 0.7003.
Improvements in analogical learning: application to translating multi-terms of the medical domain
Authors: Philippe Langlais, François Yvon, Pierre Zweigenbaum
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

Handling terminology is an important matter in a translation workflow. However, current Machine Translation (MT) systems do not yet propose anything proactive upon tools which assist in managing terminological databases. In this work, we investigate several enhancements to analogical learning and test our implementation on translating medical terms. We show that the analogical engine works equally well when translating from and into a morphologically rich language, or when dealing with language pairs written in different scripts. Combining it with a phrase-based statistical engine leads to significant improvements.