ppxscal/embedding_network huggingface dataset:
Mobility management in IP-based Wireless Sensor Networks
Authors: T. Camilo, P. Pinto, A. Rodrigues, J. Sa Silva, F. Boavida
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Mobility is one of the most important issues in next generation networks. As Wireless Sensor Networks are becoming the next elements of the future Internet, it is crucial to study new models that also support mobility of these nodes. This paper presents and studies three paradigms to support mobility in sensor nodes. This study is supported by prototyping. As a result a set of proposals are proposed and discussed. The work presented in this paper proposes the use of IP in wireless sensor networks as a unifying protocol and it is in compliance with the IETF 6LowPAN group.
A task specification language for bootstrap learning
Authors: Ian Fasel, Michael Quinlan, Peter Stone
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Traditionally, research in the reinforcement learning (RL) community has been devoted to developing domain-independent algorithms such as SARSA [13], Q-learning [16], prioritized sweeping [8], or LSPI [6], that are designed to work for any given state space and action space. However, the modus operandi in RL research has been for a human expert to re-code each learning environment, including defining the actions and state features, as well as specifying the algorithm to be used. Typically each new RL experiment is run by explicitly calling a new program (even when learning can be biased by previous learning experiences, as in transfer learning [10, 15, 14]). Thus, while standards have developed for describing and testing individual RL algorithms (e.g., RL-Glue [17]), no such standards have developed for the problem of describing complete tasks to a preexisting agent.
Location aware applications for smart cities with Google maps and GIS tools
Authors: Siak Chuan Tan, On Wong
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

The release of internet mapping API like Google maps had changed the way many location aware systems works, this paper will look into how location visualization tools can make use of this new way in providing location service. As part of an effort to enhance a digital city, we apply visualization tools to a real estate system as a study into the usefulness of Google maps and GIS. The result can be used to provide more services which will in turn form a better featured digital city. Location Aware Real estate agent (LARE), a real estate agent which uses the latest technology in GIS and internet mapping systems to become a very powerful agent based system. LARE uses different technologies like 3-d modeling with VRML, local maps with GIS shapefiles, and even online maps with Google maps.
Assessing phylogenetic motif models for predicting transcription factor binding sites
Authors: John Hawkins, Charles Grant, William Stafford Noble, Timothy L. Bailey
Venue: Bioinformatics (2009)

Motivation: A variety of algorithms have been developed to predict transcription factor binding sites (TFBSs) within the genome by exploiting the evolutionary information implicit in multiple alignments of the genomes of related species. One such approach uses an extension of the standard position-specific motif model that incorporates phylogenetic information via a phylogenetic tree and a model of evolution. However, these phylogenetic motif models (PMMs) have never been rigorously benchmarked in order to determine whether they lead to better prediction of TFBSs than obtained using simple position weight matrix scanning. Results: We evaluate three PMM-based prediction algorithms, each of which uses a different treatment of gapped alignments, and we compare their prediction accuracy with that of a non-phylogenetic motif scanning approach. Surprisingly, all of these algorithms appear to be inferior to simple motif scanning, when accuracy is measured using a gold standard of validated yeast TFBSs. However, the PMM scanners perform much better than simple motif scanning when we abandon the gold standard and consider the number of statistically significant sites predicted, using column-shuffled ‘random’ motifs to measure significance. These results suggest that the common practice of measuring the accuracy of binding site predictors using collections of known sites may be dangerously misleading since such collections may be missing ‘weak’ sites, which are exactly the type of sites needed to discriminate among predictors. We then extend our previous theoretical model of the statistical power of PMM-based prediction algorithms to allow for loss of binding sites during evolution, and show that it gives a more accurate upper bound on scanner accuracy. Finally, utilizing our theoretical model, we introduce a new method for predicting the number of real binding sites in a genome. The results suggest that the number of true sites for a yeast TF is in general several times greater than the number of known sites listed in the Saccharomyces cerevisiae Database (SCPD). Among the three scanning algorithms that we test, the MONKEY algorithm has the highest accuracy for predicting yeast TFBSs. Contact: j.hawkins@imb.uq.edu.au
Plenary lecture 11: non-linear approaches on dynamics of multibody mechanical systems with advanced computing tools
Authors: Carmen Debeleac
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

The study deal with non-linear approaches in dynamic behaviour analysis for multibody mechanical systems by using advanced computing and simulation tools. The main application of this work consist by dynamics estimation of some construction equipments during their technological processes, with strong various and intensive dynamic working states. The proposed methodology is capable to simulate the non-linear characteristics of interaction between machine and terrain, and involve some innovative modelling and computing tools. The analysis are based on derived MIMO technique, and provide a strong method to treat a large set both of the inputs - as an external disturbances, and of the outputs - as undesirable equipment movements. Non-linear and multibody approaches, through their realistic modelling specific methods, leads to a high efficacy on dynamic behaviour evaluation, with direct impact in optimization of design and exploitation of technological equipments.
An Efficient and Flexible Scheme to Support Biometric-Based and Role-Based Access Control
Authors: Deholo Nali, Carlisle Adams, Ali Miri
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

Introduced at EuroCrypt'05, threshold attribute-based encryption (thABE) is a subclass of identity-based encryption which views each identity as a set of descriptive attributes. In order to decrypt a ciphertext c encrypted for a set ω of attributes, users must have attribute keys associated with a sufficiently large subset of ω. Applications of thABE include both biometric-based and role-based cryptographic access control. This paper presents an efficient and flexible thABE scheme which is provably secure in the random oracle model. Let d be a minimal number of attributes which a decryptor must have to decipher a ciphertext. The proposed scheme requires only two pairings for decryption (instead of d pairings as in the original thABE scheme). Moreover, the new scheme enables system engineers to specify various threshold values for distinct sets of attributes. Therefore, this paper describes a practical cryptographic mechanism to support both biometric-based and role-based access control.
Synthesis and characterization of magnetic nanosized Fe3O4/MnO2composite particles
Authors: Zhang Shu, Shulin Wang
Venue: Journal of Nanomaterials (2009)

Using the prepared Fe3O4 particles of 10 nm-25nm as magnetic core, we synthesized Fe3O4/MnO2 composite particles with MnO2 as the shell by homogeneous precipitation. Their structure and morphology were characterized by X-ray diffraction (XRD), X-Ray photoelectron spectroscopy (XPS), transmission electronic microscopy (TEM), Fourier transform infrared spectra (FTIR), and vibration-sample magnetometer (VSM). We show that with urea as precipitant transparent and uniform MnO2 coating of ca.3 nm thick on Fe3O4, particles can be obtained. The composite particles have better dispersivity than the starting materials, and exhibit super-paramagnetic properties and better chemical adsorption ability with saturated magnetization of 33.5 emu/g. Decoloration experiment of methyl orange solution with Fe3O4/MnO2 composite suggested that the highest decoloration rate was 94.33% when the pH of methyl orange solution was 1.3 and the contact time was 50 minutes. So this kind of Fe3O4/MnO2 composite particle not only has super-paramagnetic property, but also good ability of chemical adsorption.
Semantic Matching Using the UMLS
Authors: Jetendr Shamdasani, Tamás Hauer, Peter Bloodsworth, Andrew Branson, Mohammed Odeh, Richard Mcclatchey
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

Traditional ontology alignment techniques enable equivalence relationships to be established between concepts in two ontologies with some confidence value. With semantic matching, however, it is possible to identify not only equivalence (¿) relationships between concepts, but less general ($\sqsubseteq$) and more general relationships ($\sqsupseteq$). This is beneficial since more expressive relationships can be discovered between ontologies thus helping us to resolve heterogeneity between differing semantic representations at a finer level of granularity. This work concerns the application of semantic matching to the medical domain. We have extended the SMatch algorithm to function in the medical domain with the use of the UMLS metathesaurus as the background resource, hence removing its previous reliance on WordNet, which does not cover the medical domain in a satisfactory manner. We describe the steps required to extend the SMatch algorithm to the medical domain for use with UMLS. We test the accuracy of our approach on subsets of the FMA and MeSH ontologies, with both precision and recall showing the accuracy and coverage of different versions of our algorithm on each dataset.
CLARIN and Free Open Source Finite-State Tools
Authors: Kimmo Koskenniemi, Anssi Yli-Jyrä
Venue: Proceeding of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008 (2009)

A new emerging European research infrastructure called CLARIN and a related project called HFST are briefly described. HFST has built a programming interface on top of some existing open source finite-state packages such as SFST and OpenFST. In order to verify its utility, HFST has built open source tools on top of this HFST interface. These tools create lexical transducers, compile morphophonological two-level rules and combine them into a transducer lexicon. The tools have been tested against independently created with full-scale lexicons and rules for Northern Sámi and Lule Sámi languages which have more complicated lexical and morphophonological structure than most other European languages.
Spatial Multiagent Student Diagnosis
Authors: Carine Webber
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

In this paper we describe the spatial multiagent student diagnosis and we apply it to student modelling in a multiagent learning environment. The spatial multiagent diagnosis is an approach where multiple agents share a n-dimensional space of possible diagnoses, self-organise themselves and reach together an state characterising a particular diagnosis. Usually a diagnosis task is run by a powerful entity able to observe, make hypothesis and come up with a diagnosis describing the state of the process being observed. Diagnosis may however be a complex task when it comprehends the observation of multiple controls, sensors and variables. In this context, it is appropriated to conceive the diagnosis task as a group decision problem, where agents (representing sensors, control and variables) collectively take decisions in order to characterise the state of the observed process. Following this perspective, the proposed approach is described and its evaluation is as well discussed in this paper.
Overhead and Segmentation Mismatch Effect on Bluetooth WPAN Performance
Authors: M. J. Moron, R. Luque, E. Casilari, A. Diaz-Estrella
Venue: Wireless Personal Communications: An International Journal (2009)

Currently, Bluetooth is the most widely used technology for Wireless Personal Area Networks (WPAN). Quality-of-Service (QoS) support is critical to ensure bandwidth maximization for mobile applications based on this WPAN technology. The overhead introduced by the different layers of Bluetooth protocol may have a serious impact on WPAN performance. However, most studies of Bluetooth performance neglect this overhead and assume that data are directly transmitted over L2CAP (Logical Link Control and Adaptation Protocol) or even HCI (Host Controller Interface) layers. In fact, this option is not feasible in most Bluetooth applications, as they integrate actual devices that implement a particular Bluetooth profile, usually SPP (Serial Port Profile). The use of profiles cannot be disregarded as they guarantee the interoperability between devices from different vendors. The aim of this paper is to characterise the performance of a Bluetooth WPAN (specifically the end-to-end delay and the throughput) when profiles are utilised. This study takes into account the overhead added by the protocols taking part in the transmission of user data. This paper also explores the effect of segmentation mismatch that may appear when the maximum size for data in each layer of the architecture is different. The analysis has been focused on SPP and PAN (Personal Area Networks) profiles. In the case of the PAN profile, the study concludes that the network performance decreases for user data sizes greater than 1,472 bytes, since the excessive overhead added by the network layer is increased by the IP (Internet Protocol) fragmentation. In the case of SPP, an inappropriate choice of the maximum data unit at RFCOMM (Radio Frequency Communication for Serial Cable Emulation Protocol based on ETSI TS 07.10) and L2CAP layers can also heavily affect the transmission delay.
SAS Statistics Data Analysis Certification Questions: Unofficial SAS Data analysis Certification and Interview Questions
Authors: Terry Sanchez-Clark
Venue:  (2007)

The Ultimate Reference & Learning Guide for SAS Statistics careers! Over 150 Certification Questions, Answers, and Explanations It's clear that SAS Statistics is the future for analysis of large data sets in public and private enterprise - but finding good reference materials can be difficult. Now, for the first time, a world class SAS consultant shares his knowledge and understanding of this complex topic. SAS Statistics Data Analysis Certification Questions guides you easily through your learning process. From helping you to assess your SAS Statistics skills, to helping screen candidates for your SAS positions, SAS Statistics Data Analysis Interview Questions will help you understand what you really need to know. This book is organized around several areas of SAS Statistics: SAS Base Programming, understanding commonly used statistics and The SAS9 certification exam. More than just a rehash of SAS documentation and sales presentations, each question is based on implementation project know-how gained on high-profile SAS Statistics Data Analysis projects. SAS Base Programming SAS9 Certification Commonly Used Statistics 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
Geometric Modeling and Algebraic Geometry, 1st edition
Authors: Bert Jttler, Ragni Piene
Venue:  (2007)

The two fields of Geometric Modeling and Algebraic Geometry, though closely related, are traditionally represented by two almost disjoint scientific communities. Both fields deal with objects defined by algebraic equations, but the objects are studied in different ways. This contributed book presents, in 12 chapters written by leading experts, recent results which rely on the interaction of both fields. Some of these results have been obtained in the frame of the European GAIA II project (IST 2001-35512) entitled Intersection algorithms for geometry-based IT applications using approximate algebraic methods.
Metadata Extraction and Retrieval Methods for Taste-impressions with Bio-sensing Technology
Authors: Hanako Kariya, Yasushi Kiyoki
Venue: Proceeding of the 2008 conference on Information Modelling and Knowledge Bases XIX (2008)

In this paper, we present a new generation food information retrieval by Taste-impression equipped with bio-sensing technology. The aim of our method is to realize the computing environment for one of the un-discussed basic human perception: sense of taste. Our method extracts Taste-impression metadata automatically by using sensor outputs retrieved from a taste sensor, according to 1) user's desirable abstraction levels of terms expressing Taste-impression and 2) characteristic features of foods, such as a type, a nationality, and a theme. We call those characteristics of foods and drinks, “Taste Scope”. By extracting Taste Scope dependent metadata applying a bio-sensing technology, our method transforms sensor outputs expressing primitive taste elements into meaningful Taste-impression metadata and computes correlations between target foods (or drinks) and a query described in Taste-impression. Users can intuitively search any kinds of information regarding foods and drinks on the basis of abstract Taste-impression preferences with user's desired granularity. We clarify the feasibility and effectiveness of our method by showing several experimental results.
The cost of stability in weighted voting games
Authors: Yoram Bachrach, Reshef Meir, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

One key question in cooperative game theory is that of coalitional stability. A coalition in such games is stable when no subset of the agents in it has a rational incentive to leave the coalition. Finding a division of the gains of the coalition (an imputation) lies at the heart of many cooperative game theory solution concepts, the most prominent of which is the core. However, some coalitional games have empty cores, and any imputation in such a game is unstable. We investigate the possibility of stabilizing the coalitional structure using external payments. In this case, a supplemental payment is offered to the grand coalition by an external party which is interested in having the members of the coalition work together. The sum of this payment plus the gains of the coalition, called the coalition's "adjusted gains", may be divided among the members of the coalition in a stable manner. We call a division of the adjusted gains a super-imputation, and define the cost of stability (CoS) as the minimal sum of payments that stabilizes the coalition. We examine the cost of stability in weighted voting games, where each agent has a weight, and a coalition is successful if the sum of its weights exceeds a given threshold. Such games offer a simple model of decision making in political bodies, and of cooperation in multiagent settings. We show that it is coNP-complete to test whether a super-imputation is stable, but show that if either the weights or payments of agents are bounded then there exists a polynomial algorithm for this problem. We provide a polynomial approximation algorithm for computing the cost of stability.
A potential field based formation control methodology for robot swarms
Authors: Kimon Valavanis
Venue:  (2008)

A novel methodology is presented for organizing swarms of robots into a formation utilizing artificial potential fields generated from normal and sigmoid functions. These functions construct the surface which swarm members travel on, controlling the overall swarm geometry and the individual member spacing. Nonlinear limiting functions are defined to provide tighter swarm control by modifying and adjusting a set of control variables forcing the swarm to behave according to set constraints, formation and member spacing. The swarm function and limiting functions are combined to control swarm formation, orientation, and swarm movement as a whole. Parameters are chosen based on desired formation as well as user defined constraints. This approach compared to others, is simple, computationally efficient, scales well to different swarm sizes, to heterogeneous systems, and to both centralized and decentralized swarm models. Simulation results are presented for a swarm of four and ten particles following circle, ellipse and wedge formations. Experimental results are also included with a swarm of four unmanned ground vehicles (UGV) as well as UGV swarm and unmanned aerial vehicle (UAV) coordination.
Rob and the BCS SGAI
Authors: Ann Macintosh
Venue: Proceeding of the 2006 conference on Rob Milne: A Tribute to a Pioneering AI Scientist, Entrepreneur and Mountaineer (2006)

This essay describes the impressive organisational and communication skills and tenacity displayed by Rob during his voluntary work the British Computer Society's Specialist Group on Artificial Intelligence-SGAI. The chapter centres around Rob's work and enthusiasm for the Group and its associated annual conference. It explores Rob's interest in show-casing applications of AI techniques to support industry and finance and, I hope, helps to explain Rob's passion to go to Cambridge every winter (or rather almost every winter, there was one when he chose California instead and none us could quite understand why) for the past n years --the exact number now lost in the depths of time.
The Kodak Most Basic Book of Digital Printing, Updated Edition
Authors: Jenni Bidner
Venue:  (2007)

Print it! Kodak, the company every photographer trusts, presents the second, updated edition of its Most Basic Book of Digital Printing. Not only does it include all the most up-to-date Kodak software versions, but also Kodaks exciting new, economical all-in-one printers and inkjet solutions. This is technology made simple and effective, and this guide shows how to make the most of it. All the information on choosing equipment is here, plus advice on digitalizing photos, using scanners creatively, image resolution, resizing, and more. Find out how to make test prints to ensure proper settings, experiment with available papers, and repair problems in the computer. To bring newcomers up to speed, there are definitions of key vocabulary, plus plenty of photos, charts, and illustrations. 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