ppxscal/embedding_network huggingface dataset:
Dynamic Threshold Control-Based Adaptive Message Filtering in Mobile Sensor Networks
Authors: Sung Ho Jang, Yong Beom Ma, Jong Sik Lee
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

The communication traffic for continuous data aggregation and location update is the main reason of short-lived mobile sensor networks because the energy consumption of sensor nodes is caused by the transmission of messages. For effective communication traffic management in mobile sensor networks, this paper proposes an dynamic threshold control-based adaptive message filtering method which utilizes diverse node parameters reflecting characteristics of mobile nodes, such as mobility and battery availability. In the proposed filtering method, each sensor node in a sensor filed filters out messages based on its distance threshold. In order to adjust the distance threshold by the condition of each node adaptively and dynamically, fuzzy logic is applied to the proposed filtering method. Empirical results approve that the proposed filtering method achieves more improved performance than existing filtering methods.
Key Technique Analysis of the Management Information System for Provincial Mineral Resources Based on ArcGIS
Authors: Shengjun Zhong, Zhufang Wang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

The methodology and key technology of provincial information system of mine resources planning and management based on ArcGIS were discussed. Taking Liaoning province as an example, the paper described how to develop mine resources management system in province, city and county levers, according to the requirement of the second round mine resources planning suggested by Ministry of Land and resources. The development of the above mentioned system provided a successful scheme for the management of mine resources of our country.
Store Buffer Design for Multibanked Data Caches
Authors: Enrique Torres, Pablo Ibanez, Victor Vinals-Yu fera, Jose Maria Llaberia
Venue: IEEE Transactions on Computers (2009)

This paper focuses on how to design a Store Buffer (STB) well suited to first-level multibanked data caches. The goal is to forward data from in-flight stores into dependent loads within the latency of a cache bank. Taking into account the store lifetime in the processor pipeline and the data forwarding behavior, we propose a particular two-level STB design in which forwarding is done speculatively from a distributed first-level STB made of extremely small banks, whereas a centralized, second-level STB enforces correct store-load ordering. Besides, the two-level STB admits two simplifications that leave performance almost unchanged. Regarding the second-level STB, we suggest to remove its data forwarding capability, while for the first-level STB, it is possible to: 1) remove the instruction age checking and 2) compare only the less significant address bits. Experimentation covers both integer and floating point codes executing in dynamically scheduled processors. Following our guidelines and running SPEC-2K over an 8-way processor, a two-level STB with four 8-entry banks in the first level performs similar to an ideal, single-level STB with 128-entry banks working at the first-level cache latency. Also, we show that the proposed two-level design is suitable for a memory-latency-tolerant processor.
Advanced Clockgating Schemes for Fused-Multiply-Add-Type Floating-Point Units
Authors: Jochen Preiss, Maarten Boersma, Silvia Melitta Mueller
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

The paper introduces fine-grain clockgating schemes for fused multiply-add-type floating-point units (FPU). The clockgating is based on instruction type, precision and operand values. The presented schemes focus on reducing the power at peak performance, where each FPU stage is used in nearly every cycle and conventional schemes have little impact on the power consumption. Depending on the instruction mix, the schemes allow to turn off 18% to 74%of the register bits. Even for the worst case instruction 18% to 37% of the FPU are shut down depending on the data patterns.
Enumerations and Completely Decomposable Torsion-Free Abelian Groups
Authors: Alexander G. Melnikov
Venue: Theory of Computing Systems (2009)

We study possible degree spectra of completely decomposable torsion-free Abelian groups.
IVAN --- Intelligent Interactive Virtual Agent Narrators
Authors: Ivan Gregor, Michael Kipp, Jan Miksatko
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Multimodal user interfaces are becoming more and more important in human---machine communication. Essential representatives of such interfaces are virtual agents that aim to act like humans in the way they employ gestures, facial expression, posture and prosody to convey their emotions in face-to-face communication. Furthermore, if we employ a presentation team [1] to convey facts, the performance becomes more entertaining for the audience. Distinct characters should have different roles and personality profiles. Moreover if we integrate interaction capabilities for the user, the system becomes more personalized and enjoyable.
Edge-Based Image Compression with Homogeneous Diffusion
Authors: Markus Mainberger, Joachim Weickert
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

It is well-known that edges contain semantically important image information. In this paper we present a lossy compression method for cartoon-like images that exploits information at image edges. These edges are extracted with the Marr---Hildreth operator followed by hysteresis thresholding. Their locations are stored in a lossless way using JBIG. Moreover, we encode the grey or colour values at both sides of each edge by applying quantisation, subsampling and PAQ coding. In the decoding step, information outside these encoded data is recovered by solving the Laplace equation, i.e. we inpaint with the steady state of a homogeneous diffusion process. Our experiments show that the suggested method outperforms the widely-used JPEG standard and can even beat the advanced JPEG2000 standard for cartoon-like images.
Fault-Free Cycles in Conditional Faulty Folded Hypercubes
Authors: Che-Nan Kuo, Sun-Yuan Hsieh
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

An n-dimensional folded hypercube FQ n is an attractive variance of an n-dimensional hypercube Q n , which is obtained by a standard hypercube with some extra edges established between its vertices. FQ n for any odd n is known to be bipartite. In this paper, for any FQ n (n ¿ 2) with at most 2n ¿ 3 faulty edges in which each vertex is incident with at least two fault-free edges, we prove that there exists a fault-free cycle of every even length from 4 to 2 n , and when n ¿ 2 is even, there also exists a fault-free cycle of every odd length from n + 1 to 2 n ¿ 1. The result is optimal with respect to the number of edges faults tolerated.
Designing Cognition-Centric Smart Room Predicting Inhabitant Activities
Authors: A. L. Ronzhin, A. A. Karpov, I. S. Kipyatkova
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Assignment of easy-to-use and well-timed services staying invisible for a user is one of important features of ambient intelligent. Multimodal user interface capable to perceive speech, movements, poses and gestures of participants in order to determinate their needs provides the natural and intuitively understandable way of interaction with the developed intelligent meeting room. Awareness of the room about spatial position of the participants, their current activities, roles in a current event, their preferences helps to predict more accurately the intentions and needs of participants. Technological framework, equipment and description of technologies applied to the intelligent meeting room are presented. Some scenarios and data structures used for a formalization of context and behavior information from practical human-human, human-machine and machine-machine interaction are discussed.
Abracadabra: wireless, high-precision, and unpowered finger input for very small mobile devices
Authors: Chris Harrison, Scott E. Hudson
Venue: Proceedings of the 22nd annual ACM symposium on User interface software and technology (2009)

We present Abracadabra, a magnetically driven input technique that offers users wireless, unpowered, high fidelity finger input for mobile devices with very small screens. By extending the input area to many times the size of the device's screen, our approach is able to offer a high C-D gain, enabling fine motor control. Additionally, screen occlusion can be reduced by moving interaction off of the display and into unused space around the device. We discuss several example applications as a proof of concept. Finally, results from our user study indicate radial targets as small as 16 degrees can achieve greater than 92% selection accuracy, outperforming comparable radial, touch-based finger input.
Copy number variation has little impact on bead-array-based measures of DNA methylation
Authors: E. Andrés Houseman, Brock C. Christensen, Margaret R. Karagas, Margaret R. Wrensch, Heather H. Nelson, Joseph L. Wiemels, Shichun Zheng, John K. Wiencke, Karl T. Kelsey, Carmen J. Marsit
Venue: Bioinformatics (2009)

Motivation: Integration of various genome-scale measures of molecular alterations is of great interest to researchers aiming to better define disease processes or identify novel targets with clinical utility. Particularly important in cancer are measures of gene copy number DNA methylation. However, copy number variation may bias the measurement of DNA methylation. To investigate possible bias, we analyzed integrated data obtained from 19 head and neck squamous cell carcinoma (HNSCC) tumors and 23 mesothelioma tumors. Results: Statistical analysis of observational data produced results consistent with those anticipated from theoretical mathematical properties. Average beta value reported by Illumina GoldenGate (a bead-array platform) was significantly smaller than a similar measure constructed from the ratio of average dye intensities. Among CpGs that had only small variations in measured methylation across tumors (filtering out clearly biological methylation signatures), there were no systematic copy number effects on methylation for three and more than four copies; however, one copy led to small systematic negative effects, and no copies led to substantial significant negative effects. Conclusions: Since mathematical considerations suggest little bias in methylation assayed using bead-arrays, the consistency of observational data with anticipated properties suggests little bias. However, further analysis of systematic copy number effects across CpGs suggest that though there may be little bias when there are copy number gains, small biases may result when one allele is lost, and substantial biases when both alleles are lost. These results suggest that further integration of these measures can be useful for characterizing the biological relationships between these somatic events. Contact: E_Andres_Houseman@brown.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Texture Segmentation by Contractive Decomposition and Planar Grouping
Authors: Anders Bjorholm Dahl, Peter Bogunovich, Ali Shokoufandeh
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

Image segmentation has long been an important problem in the computer vision community. In our recent work we have addressed the problem of texture segmentation, where we combined top-down and bottom-up views of the image into a unified procedure. In this paper we extend our work by proposing a modified procedure which makes use of graphs of image regions. In the top-down procedure a quadtree of image region descriptors is obtained in which a novel affine contractive transformation based on neighboring regions is used to update descriptors and determine stable segments. In the bottom-up procedure we form a planar graph on the resulting stable segments, where edges are present between vertices representing neighboring image regions. We then use a vertex merging technique to obtain the final segmentation. We verify the effectiveness of this procedure by demonstrating results which compare well to other recent techniques.
Reducing particle filtering complexity for 3D motion capture using dynamic Bayesian networks
Authors: Cédric Rose, Jamal Saboune, François Charpillet
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distributions. The dimensionality of the problem remains a limitation of these approaches due to the growing number of particles required for the exploration of the state space. Computer vision problems such as 3D motion tracking are an example of complex monitoring problems which have a high dimensional state space and observation functions with high computational cost. In this article we focus on reducing the required number of particles in the case of monitoring tasks where the state vector and the observation function can be factored. We introduce a particle filtering algorithm based on the Dynamic Bayesian network (DBN) formalism which takes advantage of a factored representation of the state space for efficiently weighting and selecting the particles. We illustrate the approach on a simulated and a realworld 3D motion tracking tasks.
Personalizing PageRank for word sense disambiguation
Authors: Eneko Agirre, Aitor Soroa
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

In this paper we propose a new graph-based method that uses the knowledge in a LKB (based on WordNet) in order to perform unsupervised Word Sense Disambiguation. Our algorithm uses the full graph of the LKB efficiently, performing better than previous approaches in English all-words datasets. We also show that the algorithm can be easily ported to other languages with good results, with the only requirement of having a wordnet. In addition, we make an analysis of the performance of the algorithm, showing that it is efficient and that it could be tuned to be faster.
Privacy-Aware Location Database Service for Granular Queries
Authors: Shinsaku Kiyomoto, Keith M. Martin, Kazuhide Fukushima
Venue: Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks (2009)

Future mobile markets are expected to increasingly embrace location-based services. This paper presents a new system architecture for location-based services, which consists of a location database and distributed location anonymizers. The service is privacy-aware in the sense that the location database always maintains a degree of anonymity. The location database service permits three different levels of query and can thus be used to implement a wide range of location-based services. Furthermore, the architecture is scalable and employs simple functions that are similar to those found in general database systems.
Color Quantization Based on PCA and Kohonen SOFM
Authors: D. Mavridis, N. Papamarkos
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

A method for initializing optimally Kohonen's Self-Organizing Feature Maps (SOFM) of a fixed zero neighborhood radius for use in color quantization is presented. Standard SOFM is applied to the projection of the input image pixels onto the plane spanned by the two largest principal components and to pixels of the original image defined by the smallest principal component via a thresholding procedure. The neuron values which emerge initialize the final SOFM of a fixed zero neighborhood radius that performs the color quantization of the original image. Experimental results show that the proposed method is able to produce smaller quantization errors than standard SOFM and other existing color quantization methods.
The Art of Agent-Oriented Modeling
Authors: Leon Sterling, Kuldar Taveter
Venue: Intelligent Robotics And Autonomous Agents (2009)

Today, when computing is pervasive and deployed over a range of devices by a multiplicity of users, we need to develop computer software to interact with both the ever-increasing complexity of the technical world and the growing fluidity of social organizations. The Art of Agent-Oriented Modeling presents a new conceptual model for developing software systems that are open, intelligent, and adaptive. It describes an approach for modeling complex systems that consist of people, devices, and software agents in a changing environment (sometimes known as distributed sociotechnical systems). The authors take an agent-oriented view, as opposed to the more common object-oriented approach. Thinking in terms of agents (which they define as the human and man-made components of a system), they argue, can change the way people think of software and the tasks it can perform. The book offers an integrated and coherent set of concepts and models, presenting the models at three levels of abstraction corresponding to a motivation layer (where the purpose, goals, and requirements of the system are described), a design layer, and an implementation layer. It compares platforms by implementing the same models in four different languages; compares methodologies by using a common example; includes extensive case studies; and offers exercises suitable for either class use or independent study. Intelligent Robotics and Autonomous Agents series
FastM in WMN: A Fast Mobility Support Extension for Wireless Mesh Networks
Authors: Luís Couto, João Paulo Barraca, Susana Sargento, Rui L. Aguiar
Venue: Proceedings of the 2009 Second International Conference on Advances in Mesh Networks (2009)

In this paper we present a new extension to proactive routing protocols using a fast mobility extension, FastM, with the purpose of increasing handover performance in Wireless Mesh Networks. With this new extension a new concept is created to integrate information between neighbor wireless mesh routers, managing locations of clients associated to wireless mesh routers in a certain neighborhood, and avoiding packet loss during handover. The proposed mobility protocol is able to optimize the handover process without imposing any modifications to the current IEE 802.11 MAC protocol and use unmodified clients. Results show the improved efficiency of the proposed scheme: metrics such as disconnection time, throughput, packet loss and control overhead are largely improved when compared to previous approaches.
Unsupervised information extraction approach using graph mutual reinforcement
Authors: Hany Hassan, Ahmed Hassan, Ossama Emam
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

Information Extraction (IE) is the task of extracting knowledge from unstructured text. We present a novel unsupervised approach for information extraction based on graph mutual reinforcement. The proposed approach does not require any seed patterns or examples. Instead, it depends on redundancy in large data sets and graph based mutual reinforcement to induce generalized "extraction patterns". The proposed approach has been used to acquire extraction patterns for the ACE (Automatic Content Extraction) Relation Detection and Characterization (RDC) task. ACE RDC is considered a hard task in information extraction due to the absence of large amounts of training data and inconsistencies in the available data. The proposed approach achieves superior performance which could be compared to supervised techniques with reasonable training data.
Software Architecture Design and Implementation of Document Filter System
Authors: Guanghui Zhao, Dan Liu, Huazhu Song, Chengming Zou
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

The paper proposed the importance of document filtration system for scientific and technological personnel, and then gave a solution of filtering system at the perspective of software architecture. Finally, this paper provided a complete implementation of filtering system base on the analysis and the design, proving the feasibility of this architecture and our framework.
An Empirical Study on Mobile Banking Adoption: The Role of Trust
Authors: Zhenhua Liu, Qingfei Min, Shaobo Ji
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Mobile banking is an emerging service that not only facilitates our life, but also creates great opportunities for mobile operators, device manufactures, and especially for banks. To better understand individual’s intention to adopt mobile banking, this paper integrates trust into Technology Acceptance Model (TAM), and examined the role of trust based on a multi-dimensional perspective. Results from a survey of 438 respondents indicated that: 1) trust primarily works as an indirect antecedent of user’s intention to adopt mobile banking through its impact on perceived usefulness (PU), which is the primary direct indicator of intention; 2) the shape of individual’s general trust is mainly affected by three dimensions (trust in technologies, trust in vendors and structural assurance); 3) structural assurance is the most important facets of individual’s general trust. Finally, implications for improving the adoption of mobile banking are discussed.
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
Authors: Katarzyna Paluch, Marcin Mucha, Aleksander Mądry
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We give a deterministic combinatorial 7/9-approximation algorithm for the symmetric maximum traveling salesman problem.
Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques
Authors: Charles Bouillaguet, Pierre-Alain Fouque
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

In this paper, we present some preliminary results on the security of the RadioGatúnhash function. RadioGatúnhas an internal state of 58 words, and is parameterized by the word size, from one to 64 bits. We mostly study the one-bit version of RadioGatúnsince according to the authors, attacks on this version also affect the reasonably-sized versions. On this toy version, we revisit the claims of the designers and first improve some results. Secondly, given a differential path, we show how to find a message pair colliding more efficiently than the strategy proposed by the authors using algebraic techniques. We experimented this strategy on the one-bit version since we can efficiently find differential path by brute force. Even though the complexity of this collision attack is higher than the general security claim on RadioGatún¿1 ¿, it is still less than the birthday paradox on the size of the internal state.