ppxscal/embedding_network huggingface dataset:
Improving the speed and scalability of distributed simulations of sensor networks
Authors: Zhong-Yi Jin, Rajesh Gupta
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Distributed simulation techniques are commonly used to improve the speed and scalability of wireless sensor network simulators. However, accurate simulations of dynamic interactions of sensor network applications incur large synchronization overheads and severely limit the performance of existing distributed simulators. In this paper, we present two novel techniques that significantly reduce such overheads by minimizing the number of sensor node synchronizations during simulations. These techniques work by exploiting radio and MAC specific characteristics without reducing simulation accuracy. In addition, we present a new probing mechanism that makes it possible to exploit any potential application specific characteristics for synchronization reductions. We implement and evaluate these techniques in a cycle accurate distributed simulation framework that we developed based on Avrora. In our experiments, the radio-level technique achieves a speedup of 2 to 3 times in simulating 1-hop networks with 32 to 256 nodes. With default backoffs, theMAC-level technique achieves a speedup of 1.1 to 1.3 times in the best case scenarios of simulating 32 and 64 nodes. In our multi-hop flooding tests, together they achieve a speedup of 1.5 to 1.8 times in simulating networks with 36 to 144 nodes. The experiments also demonstrate that the speedups can be significantly larger as the techniques scale with the number of processors and radio-off/MAC-backoff time.
Approximate solutions of interactive dynamic influence diagrams using model clustering
Authors: Yifeng Zeng, Prashant Doshi, Qiongyu Chen
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Interactive dynamic influence diagrams (I-DIDs) offer a transparent and semantically clear representation for the sequential decision-making problem over multiple time steps in the presence of other interacting agents. Solving I-DlDs exactly involves knowing the solutions of possible models of the other agents, which increase exponentially with the number of time steps. We present a method of solving I-DlDs approximately by limiting the number of other agents' candidate models at each time step to a constant. We do this by clustering the models and selecting a representative set from the clusters. We discuss the error bound of the approximation technique and demonstrate its empirical performance.
Towards Proactive Policies Supporting Event-Based Task Delegation
Authors: Khaled Gaaloul, Philip Miseldine, François Charoy
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Delegation mechanisms are receiving increasing interest from the research community. Task delegation is a mechanism that supports organisational flexibility in the human-centric workflow systems, and ensures delegation of authority in access control systems. In this paper, we consider task delegation as an advanced security mechanism supporting policy decision. We define an approach to support dynamic delegation of authority within an access control framework. The novelty consists of reasoning on authorisation dependently on task delegation events, and specifies them in terms of delegation policies. When one of these events changes, our access policy decision may change proactively implying dynamic delegation of authority. Existing work on access control systems remain stateless and do not consider this perspective. We highlight such limitations, and propose a task delegation framework to support proactive enforcement of delegation policies.
Culture and Communication Behavior: A Research Based on the Artifact Development Analysis
Authors: Masaaki Kurosu, Ayako Hashizume
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Authors focused on the use of the cell phone by senior people and young people living in the urban area and the rural area in Japan and in the US. The result of the questionnaire research showed that there are differences in the use of the cell phone and other communication media depending on the situation. These differences are related to the difference of the culture: nation culture, region culture, and generation culture.
Surprise-based developmental learning and experimental results on robots
Authors: Nadeesha Ranasinghe, Wei-Min Shen
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

Learning from surprises and unexpected situations is a capability that is critical for developmental learning. This paper describes a promising approach in which a learner robot engages in a cyclic learning process consisting of “prediction, action, observation, analysis (of surprise) and adaptation”. In particular, the robot always predicts the consequences of its actions, detects surprises whenever there is a significant discrepancy between the prediction and the observed reality, analyzes the surprises for causes, and uses the analyzed knowledge to adapt to the unexpected situations. We tested this approach on a modular robot learning how to navigate and recover from unexpected changes in sensors, actions, goals, and environments. The results are very encouraging.
The Cultural Logic of Computation
Authors: David Golumbia
Venue:  (2009)

Advocates of computers make sweeping claims for their inherently transformative power: new and different from previous technologies, they are sure to resolve many of our existing social problems, and perhaps even to cause a positive political revolution. In The Cultural Logic of Computation, David Golumbia, who worked as a software designer for more than ten years, confronts this orthodoxy, arguing instead that computers are cultural all the way downthat there is no part of the apparent technological transformation that is not shaped by historical and cultural processes, or that escapes existing cultural politics. From the perspective of transnational corporations and governments, computers benefit existing power much more fully than they provide means to distribute or contest it. Despite this, our thinking about computers has developed into a nearly invisible ideology Golumbia dubs computationalisman ideology that informs our thinking not just about computers, but about economic and social trends as sweeping as globalization. Driven by a programmers knowledge of computers as well as by a deep engagement with contemporary literary and cultural studies and poststructuralist theory, The Cultural Logic of Computation provides a needed corrective to the uncritical enthusiasm for computers common today in many parts of our culture. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Ontology Personalization: An Approach Based on Conceptual Prototypicality
Authors: Xavier Aimé, Frédéric Furst, Pascale Kuntz, Francky Trichet
Venue: Advances in Web and Network Technologies, and Information Management: APWeb/WAIM 2009 International Workshops: WCMT 2009, RTBI 2009, DBIR-ENQOIR 2009, PAIS 2009, Suzhou, China, April 2-4, 2009, Revised Selected Papers (2009)

With the current emergence of Cognitive Sciences and the development of Knowledge Management applications in Social and Human Sciences, Subjective Knowledge becomes an unavoidable subject and a real challenge, which must be integrated and developed in Ontology Engineering and Ontology-based Information Retrieval. This paper introduces a new approach dedicated to the Personalization of a Domain Ontology. Inspired by works in Cognitive Psychology, our work is based on a process which aims at capturing the user-sensitive degree of truth of the categorisation process, that is the one which is really perceived by the end-user. Practically, this process consists in decorating the Specialisation/Generalisation links (i.e. the ISA links) of the hierarchy of concepts with a specific gradient. As this gradient is defined according to the three aspects of the semiotic triangle (i.e. intensional, extensional and expressional dimension), we call it Semiotic-based Prototypicality Gradient. It enrichs the initial formal semantics of an ontology by adding a pragmatics defined according to a context of use which depends on parameters like culture, educational background and/or emotional context of the end-user.
Modeling Incremental Information of Topographic Database Based on OEM
Authors: Zhu Huaji, Wu Huarui, Ma Shaojuan
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The distribution of the update information of topographic database is still one of the main open challenges for many data producers. The incremental method is transfer of a data set that is restricted to objects which have been changed since the last transfer. This paper focuses on the modeling and description of incremental information, which is the precondition of distribution. In order to accomplish this task, firstly we analyze the characteristics of incremental information of topographic database. By analysis, we find out that the incremental information is semi-structured by nature. In this respect, this paper investigates the use of SSD (semi-structured data) models--an innovative approach recently developed in Information Technology--for modeling incremental information. A framework for the representation of geographic entities in OEM (Object Exchange Model), a popular model for semi-structured data, is introduced. Additionally, it is shown how to map the OEM representation of incremental information to XML (eXtensible Markup Language) description. Using XML to describe incremental information can help users understand this kind of information and update their databases. A simplified case study in the application domain of the distribution of topographical data is examined closely.
Inferring Meta-covariates in Classification
Authors: Keith Harris, Lisa Mcmillan, Mark Girolami
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

This paper develops an alternative method for gene selection that combines model based clustering and binary classification. By averaging the covariates within the clusters obtained from model based clustering, we define "meta-covariates" and use them to build a probit regression model, thereby selecting clusters of similarly behaving genes, aiding interpretation. This simultaneous learning task is accomplished by an EM algorithm that optimises a single likelihood function which rewards good performance at both classification and clustering. We explore the performance of our methodology on a well known leukaemia dataset and use the Gene Ontology to interpret our results.
A graph theoretical foundation for integrating RDF ontologies
Authors: Octavian Udrea, Yu Deng, Edna Ruckhaus, V. S. Subrahmanian
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

RDF ontologies are rapidly increasing in number. We study the problem of integrating two RDF ontologies under a given set H of Horn clauses that specify semantic relationships between terms in the ontology, as well as under a given set of negative constraints. We formally define the notion of a "witness" to the integrability of two RDF ontologies under such constraints. A witness represents a way of integrating the ontologies together. We define a "minimal" witnesses and provide the polynomial CROW (Computing RDF Ontology Witness) algorithm to find a witness. We report on the performance of CROW both on DAML, SchemaWeb and Onto-Broker ontologies as well as on synthetically generated data. The experiments show that CROW works very well on real-life ontologies and scales to massive ontologies.
Datapath Synthesis for Standard-Cell Design
Authors: Reto Zimmermann
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

Datapath synthesis for standard-cell design goes through extraction of arithmetic operations from RTL code, high-level arithmetic optimizations and netlist generation. Numerous architectures and optimization strategies exist that result in circuit implementations with very different performance characteristics. This work summarizes the circuit architectures and techniques used in a commercial synthesis tool to optimize cell-based datapath netlists for timing, area and power.
Dynamic Languages Integration Path for Telecom Applications
Authors: Amer Hasanovic, Nermin Suljanovic, Aljo Mujcic, Radovan Sernec
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

The paper presents an approach to integrate dynamic programming languages with IMS application servers. Existing Java-based platforms for telecom applications are surveyed. Specific steps of integration of Ruby and JEE server are given. A proof of concept application is developed and deployed on an open-source Java Enterprise server.
An Advanced NoP Selection Strategy for Odd-Even Routing Algorithm in Network-on-Chip
Authors: Minghua Tang, Xiaola Lin
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

The Odd-Even (OE) [5] routing strategy has greatly improved the degree of adaptiveness over other adaptive routing strategies. It depends on an efficient selection strategy to achieve the potential performance of the improved adaptiveness. Asica et al. [3] proposed a NoP selection strategy, which aims to make use of such adaptiveness. However, there exists deficiency when applying it with the Odd-Even routing algorithm. The adaptiveness could not be fully achieved because they ignored the turnable location restricted by the routing algorithm. In this paper, we improved the NoP selection strategy, termed Advanced NoP (ANoP), so that all paths from the source node to the destination node could be traversed evenly. Simulation results show that the ANoP could improve performance in the average packet latency up to 22% over the NoP averagely.
Development of a Lightweight Middleware Technologies Supporting Mobile Agents
Authors: Gu Su Kim, Jaegon Kim, Hyun-Jin Cho, Won-Taek Lim, Young Ik Eom
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

The mobile agent technology is considered to be very useful for ubiquitous environments. But in order to apply the mobile agent concept to ubiquitous devices, the mobile agent platform should be lightweight because the devices in ubiquitous environments have very limited computing resources. Normally, the ubiquitous devices have J2ME CLDC environments. But this environment has very limited functionality and does not support reflection, dynamic class loading, object serialization, and so on. Therefore, it is very hard to develop the mobile agent platform over the standard J2ME CLDC environments. We have developed the lightweight mobile agent platform, called mMAP, for PDAs with J2ME CDC and have developed the proxy platform, called SAP, for the mobile phone with J2ME CLDC/MIDP. SAP manages the proxy agent, called shadow agent, which is created for each mobile agent in the mMAP. The cooperation between the two platforms allows us to control the mobile agents through the mobile phone.
CMAC: An energy-efficient MAC layer protocol using convergent packet forwarding for wireless sensor networks
Authors: Sha Liu, Kai-Wei Fan, Prasun Sinha
Venue: ACM Transactions on Sensor Networks (TOSN) (2009)

Low duty cycle operation is critical to conserve energy in wireless sensor networks. Traditional wake-up scheduling approaches either require periodic synchronization messages or incur high packet delivery latency due to the lack of any synchronization. To simultaneously achieve the seemingly contradictory goals of energy efficiency and low latency, the design of a new low duty-cycle MAC layer protocol called Convergent MAC (CMAC) is presented. CMAC avoids synchronization overhead while supporting low latency. By using zero communication when there is no traffic, CMAC allows sensor nodes to operate at very low duty cycles. When carrying traffic, CMAC first uses anycast to wake up forwarding nodes, and then converges gradually from route-suboptimal anycast with unsynchronized duty cycling to route-optimal unicast with synchronized scheduling. To validate our design and provide a usable module for the research community, CMAC has been implemented in TinyOS and evaluated on the Kansei testbed consisting of 105 XSM nodes. The results show that CMAC at 1&percnt; duty cycle significantly outperforms BMAC at 1&percnt; in terms of latency, throughput and energy efficiency. The performance of CMAC is also compared with other protocols using simulations, in which the results show for 1&percnt; and lower duty cycles, CMAC exhibits similar throughput and latency as CSMA/CA using much less energy, and outperforms SMAC, DMAC and GeRaF in almost all aspects.
Expert review method in game evaluations: comparison of two playability heuristic sets
Authors: Hannu Korhonen, Janne Paavilainen, Hannamari Saarenpää
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

The expert review method is not yet widely adopted in game evaluations, although it has been used successfully in productivity software evaluations for years. In order to use the method effectively, there need to be playability heuristics that take into account the characteristics of the videogames. There are a few playability heuristic sets available, but they have several differences, and they have not been compared to discover their strengths and weaknesses in game evaluations. In this paper, we report on a first study comparing two playability heuristic sets when evaluating the playability of a videogame. The results indicate that the heuristics can assist the evaluators in evaluating both the user interface and the gameplay aspects of the game. However, playability heuristics need to be developed further before they can be utilized by the practitioners. Especially, the clarity and comprehensibility of the heuristics need to be improved, and the optimal number of heuristics is still open.
Fuzzy Control System for Intelligent Car
Authors: Xiao-feng Wan, Yi-si Xing, Li-xiang Cai
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Fuzzy control system of intelligent car is designed. The control system selects the 16-bit microcontroller unit MC9S12DG128 produced by Freescale Semiconductor Company as the core controller; employs COMS camera to detect the location and movement direction of the intelligent car; applys photoelectric encoder to examine the car’s speed; makes use of fuzzy control algorithm to adjust DC motor’s speed and steering gear’s direction. The experimental result indicates that the design of the intelligent car system is feasible.
Fast and Robust Image Registration for 3D Face Modeling
Authors: Yu Weiwei
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

One method of 3D face modeling is constructing a subspace of 3D face image by a set of persons’ 3D face image. It is crucial to register each 3D face image with a reference face image. The current state of the art in image registration is best represented by the well-known iterative closest point (ICP) algorithm and numerous variations on it. Although this method is effective in many domains, it nevertheless suffers from two key limitations: It is not robust to outliers arising from noise and its run time is too long to be applied in real-time systems. To avoid these problems, this paper presents a fast and robust ICP algorithm. The robustness is ensured by improved M-estimator, whose function is defined over a novel residual norm. In addition, because the correspondence matching stage of ICP is usually the one that takes the longest, applications that require ICP to run quickly must choose the matching algorithm with the fastest performance. So we present a fast matching algorithm that has potential application to real-time 3D face model acquisition. Experimental results on 60 persons’ 3D scan face data show the improvements realized in this paper.
Coercion Resistant End-to-end Voting
Authors: Ryan W. Gardner, Sujata Garera, Aviel D. Rubin
Venue: Financial Cryptography and Data Security: 13th International Conference, FC 2009, Accra Beach, Barbados, February 23-26, 2009. Revised Selected Papers (2009)

End-to-end voting schemes have shown considerable promise for allowing voters to verify that tallies are accurate. At the same time, the threat of coercion has generally been considered only when voting devices are honest, and in many schemes, voters can be forced or incentivized to cast votes of an adversary's choice. In this paper, we examine the issue of voter coercion and identify one example method for coercing voters in a scheme by Benaloh. To address such attacks, we present a formal definition of coercion resistance for end-to-end voting. We then present a new scheme, extended from Benaloh's, that is provably coercion resistant. In addition to providing accuracy and coercion resistance, our scheme emphasizes ease-of-use for the voter.
Generalized Bayes minimax estimation of the normal mean matrix with unknown covariance matrix
Authors: Hisayuki Tsukuma
Venue: Journal of Multivariate Analysis (2009)

This paper addresses the problem of estimating the normal mean matrix in the case of unknown covariance matrix. This problem is solved by considering generalized Bayesian hierarchical models. The resulting generalized Bayes estimators with respect to an invariant quadratic loss function are shown to be matricial shrinkage equivariant estimators and the conditions for their minimaxity are given.
Embodied construction grammar as layered modal languages
Authors: Anders Søgaard
Venue: Proceedings of the Third Workshop on Scalable Natural Language Understanding (2006)

One can think of scalability in terms of complexity or granularity, but in both cases, modal languages seem to be of interest: Modal languages are robustly decidable, and they encode in a natural way the idea of refinement by layering, which implies scalability in terms of granularity. The contribution of this paper is to introduce the general technique of translating problems of scalable natural language understanding into layered modal languages; for illustration, a translation is sketched for Embodied Construction Grammar (ECG). On the basis of this translation, an upper bound on the complexity of ECG is established: the universal recognition problem of ECG is solvable in EXPTIME (if some dynamic resetting is assumed). If the use of the evokes-operator is polynomially bound, the recognition problem turns NP-complete.