ppxscal/embedding_network huggingface dataset:
Geometric Algebra for Computer Science: An Object-Oriented Approach to Geometry
Authors: Leo Dorst, Daniel Fontijne, Stephen Mann
Venue:  (2009)

In fields such as robotics, computer graphics, and computer games, it is necessary to compute complex interactions of objects in virtual 3D worlds. In a virtual world, there may be thousands of these objects interacting with each other in real-time. Linear algebra (vector math) is traditionally used to perform these calculations, but linear algebra requires long and complex computer programs to implement and can create very difficult programming challenges. Developers of real-time applications spend a lot of time trying to squeeze the last ounce of performance out of them. Geometric algebra (GA) is a new and compact way of representing the geometry of these objects that makes the computation and the programming of them much easier. Once only the domain of academic researchers, this book introduces GA to programmers, shows how it extends from linear algebra, and describes how to model geometries using GA. The last part of the book describes techniques for creating applications. A companion website link is included with GaViewer, a program written in C that allows programming experiments with GA. Geometric Algebra for Computer Science describes what many feel will be the future of geometrical computation. * The first book on Geometric Algebra for programmers in computer graphics and entertainment computing * Written by leaders in the field providing essential information on this new technique for 3D graphics * This full color book includes a website with GAViewer, a program to experiment with GA
Flexible teamwork in behavior-based robots
Authors: Gal A. Kaminka, Inna Frenkel
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

A key challenge in deploying teams of robots in real-world applications is to automate the control of teamwork, such that the designer can focus on the taskwork. Existing teamwork architectures seeking to address this challenge are monolithic, in that they commit to interaction protocols at the architectural level, and do not allow the designer to mix and match protocols for a given task. We present BITE, a behavior-based teamwork architecture that automates collaboration in physical robots, in a distributed fashion. BITE separates task behaviors that control a robot's interaction with its task, from interaction behaviors that control a robot's interaction with its teammates. This distinction provides for flexibility and modularity in terms of the interactions used by teammates to collaborate effectively. It also allows BITE to synthesize and significantly extend existing teamwork architectures. BITE also incorporates key lessons learned in applying multi-agent teamwork architectures in physical robot teams. We present empirical results from experiments with teams of Sony AIBO robots executing BITE, and discuss the lessons learned.
Localized Sensor Self-deployment with Coverage Guarantee in Complex Environment
Authors: Xu Li, Nathalie Mitton, Isabelle Ryl, David Simplot
Venue: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks (2009)

In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has higher priority to be covered than a distant one. A localized sensor self-deployment algorithm, named Greedy-Rotation-Greedy (GRG) [9], has recently been proposed for constructing optimal focused coverage. The previous work assumed obstacle-free environment and focused on theoretical aspects. In this paper, we remove this strong assumption and extend GRG to practical settings. We equip with a novel obstacle "penetration" technique and give it the important obstacle avoidance capability. The new version of GRG is referred to as GRG/OP. Through simulation, we evaluate its performance in comparison with plain GRG.
A Genre-Aware Approach to Focused Crawling
Authors: Guilherme T. De Assis, Alberto H. Laender, Marcos André Gonçalves, Altigran S. Da Silva
Venue: World Wide Web (2009)

Focused crawlers have as their main goal to crawl Web pages that are relevant to a specific topic or user interest, playing an important role for a great variety of applications. In general, they work by trying to find and crawl all kinds of pages deemed as related to an implicitly declared topic. However, users are often not simply interested in any document about a topic, but instead they may want only documents of a given type or genre on that topic to be retrieved. In this article, we describe an approach to focused crawling that exploits not only content-related information but also genre information present in Web pages to guide the crawling process. This approach has been designed to address situations in which the specific topic of interest can be expressed by specifying two sets of terms, the first describing genre aspects of the desired pages and the second related to the subject or content of these pages, thus requiring no training or any kind of preprocessing. The effectiveness, efficiency and scalability of the proposed approach are demonstrated by a set of experiments involving the crawling of pages related to syllabi of computer science courses, job offers in the computer science field and sale offers of computer equipments. These experiments show that focused crawlers constructed according to our genre-aware approach achieve levels of F1 superior to 88%, requiring the analysis of no more than 65% of the visited pages in order to find 90% of the relevant pages. In addition, we experimentally analyze the impact of term selection on our approach and evaluate a proposed strategy for semi-automatic generation of such terms. This analysis shows that a small set of terms selected by an expert or a set of terms specified by a typical user familiar with the topic is usually enough to produce good results and that such a semi-automatic strategy is very effective in supporting the task of selecting the sets of terms required to guide a crawling process.
Predictions with Confidence in Applications
Authors: Mikhail Dashevskiy, Zhiyuan Luo
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

Many applications require predictions with confidence. We are interested in Confidence Machines which are algorithms that can provide some measure on how confident they are that their output is correct. Confidence Machines are quite general and there are many algorithms solving the problem of prediction with confidence. As predictors we consider Venn Probability Machines and Conformal Predictors. Both of these algorithms rely on an underlying algorithm for prediction and in this paper we use two simple algorithms, namely the Nearest Neighbours and Nearest Centroid algorithms. Our aim is to provide some guidelines on how to choose the most suitable algorithm for a practical application where confidence is needed.
A Feature Weighed Clustering Based Key-Frames Extraction Method
Authors: Hua Man, Jiang Peng
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Video key-frame extraction using unsupervised clustering is an effective method to get key-frame from video clips. When multi-features are used to cluster frames, different features usually have different weight and importance. This paper introduces a feature weight based clustering method which detects the optimize cluster number and performs clustering at the same time. Starting with an over-specified number of clusters, similarly clusters are merged by weighed-distance of clusters and the dispersion of key-frame. At last, the key-frames are extracted as nearest to the cluster centers. Experimental results show encouraging results compared with the traditional methods.
Types, Maps and Separation Logic
Authors: Rafal Kolanski, Gerwin Klein
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

This paper presents a separation-logic framework for reasoning about low-level C code in the presence of virtual memory. We describe our abstract, generic Isabelle/HOL framework for reasoning about virtual memory in separation logic, and we instantiate this framework to a precise, formal model of ARMv6 page tables. The logic supports the usual separation logic rules, including the frame rule, and extends separation logic with additional basic predicates for mapping virtual to physical addresses. We build on earlier work to parse potentially type-unsafe, system-level C code directly into Isabelle/HOL and further instantiate the separation logic framework to C.
Plant Leaf Identification Using Multi-scale Fractal Dimension
Authors: André R. Backes, Odemir M. Bruno
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Taxonomical classification of plants is a very complex and time-consuming task. This is mostly due to the great biodiversity of species and the fact of most measures extracted from plants are traditionally performed manually. This paper presents a novel approach to plant identification based on leaf texture. Initially, the texture is modelled as a surface, so complexity analysis using Multi-scale fractal dimension can be performed over the generated surface, resulting in a feature vector which represents texture complexity in terms of the spatial scale. Yielded results show the potential of the approach, which overcomes traditional texture analysis methods, such as Co-occurrence matrices, Gabor filters and Fourier descriptors.
Texture Editing Using Frequency Swap Strategy
Authors: Michal Haindl, Vojtěch Havlíček
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

A fully automatic colour texture editing method is proposed, which allows to synthesise and enlarge an artificial texture sharing anticipated properties from its parent textures. The edited colour texture maintains its original colour spectrum while its frequency is modified according to one or more target template textures. Edited texture is synthesised using a fast recursive model-based algorithm. The algorithm starts with edited and target colour texture samples decomposed into a multi-resolution grid using the Gaussian-Laplacian pyramid. Each band pass colour factors are independently modelled by their dedicated 3D causal autoregressive random field models (CAR). We estimate an optimal contextual neighbourhood and parameters for each of the CAR submodel. The synthesised multi-resolution Laplacian pyramid of the edited colour texture is replaced by the synthesised template texture Laplacian pyramid. Finally the modified texture pyramid is collapsed into the required fine resolution colour texture. The primary benefit of these multigrid texture editing models is their ability to produce realistic novel textures with required visual properties capable of enhancing realism in various texture application areas. 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
Distributed Systems Security: Issues, Processes and Solutions
Authors: Abhijit Belapurkar, Anirban Chakrabarti, Harigopal Ponnapalli, Niranjan Varadarajan, Srinivas Padmanabhuni, Srikanth Sundarrajan
Venue:  (2009)

How to solve security issues and problems arising in distributed systems. Security is one of the leading concerns in developing dependable distributed systems of today, since the integration of different components in a distributed manner creates new security problems and issues. Service oriented architectures, the Web, grid computing and virtualization form the backbone of todays distributed systems. A lens to security issues in distributed systems is best provided via deeper exploration of security concerns and solutions in these technologies. Distributed Systems Security provides a holistic insight into current security issues, processes, and solutions, and maps out future directions in the context of todays distributed systems. This insight is elucidated by modeling of modern day distributed systems using a four-tier logical model host layer, infrastructure layer, application layer, and service layer (bottom to top). The authors provide an in-depth coverage of security threats and issues across these tiers. Additionally the authors describe the approaches required for efficient security engineering, alongside exploring how existing solutions can be leveraged or enhanced to proactively meet the dynamic needs of security for the next-generation distributed systems. The practical issues thereof are reinforced via practical case studies. Distributed Systems Security: Presents an overview of distributed systems security issues, including threats, trends, standards and solutions. Discusses threats and vulnerabilities in different layers namely the host, infrastructure, application, and service layer to provide a holistic and practical, contemporary view of enterprise architectures. Provides practical insights into developing current-day distributed systems security using realistic case studies. This book will be of invaluable interest to software engineers, developers, network professionals and technical/enterprise architects working in the field of distributed systems security. Managers and CIOs, researchers and advanced students will also find this book insightful.
A New Incremental Fuzzy PD+Fuzzy ID Fuzzy Controller
Authors: Qingchun Li, Deyao Shen
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The PID fuzzy controller is fallen into one-dimension, two-dimension and three-dimension one in terms of structure, among which the two-dimension PID fuzzy controller is the most popular one. Based on these methods, a new two-dimension PID fuzzy controller, namely incremental fuzzy PD+ fuzzy ID is put forward. By comparing the illustration of the fuzzy PD and fuzzy ID, the conclusion that the two corresponding fuzzy control rules are similar is reached. The theoretical analysis shows that the PID fuzzy controller possesses the feature of non-linearity besides that of the traditional PID controller. The simulation research result shows that its control feature is better than that of the fuzzy PI and the conventional PID controller
Robust Authentication Using Physically Unclonable Functions
Authors: Keith B. Frikken, Marina Blanton, Mikhail J. Atallah
Venue: Proceedings of the 12th International Conference on Information Security (2009)

In this work we utilize a physically unclonable function (PUF) to improve resilience of authentication protocols to various types of compromise. As an example application, we consider users who authenticate at an ATM using their bank-issued PUF and a password. We present a scheme that is provably secure and achieves strong security properties. In particular, we ensure that (i) the user is unable to authenticate without her device; (ii) the device cannot be used by someone else to successfully authenticate as the user; (iii) the device cannot be duplicated (e.g., by a bank employee); (iv) an adversary with full access to the bank's personal and authentication records is unable to impersonate the user even if he obtains access to the device before and/or after the setup; (v) the device does not need to store any information. We also give an extension that endows the solution with emergency capabilities: if a user is coerced into opening her secrets and giving the coercer full access to the device, she gives the coercer alternative secrets whose use notifies the bank of the coercion in such a way that the coercer is unable to distinguish between emergency and normal operation of the protocol.
Online Discovery and Refinement of Novel Genes Using GeneScope
Authors: Hasan Jamil, J. Jesmin
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

We present a novel gene finding and validation tool, called GeneScope, which is capable of finding and validating genes declaratively by autonomously integrating heterogeneous online resources. GeneScope also supports user defined concepts to articulate gene structures, and refine existing concepts toward the discovery of the intended genes. The system relies upon a new string query language called StriQL and the prototype has been implemented using the LifeDB database system. We also report the discovery of two new alternative splice variants of the human telomerase reverse transcriptase (hTERT) gene and their validation using GeneScope. We demonstrate that GeneScope’s declarativity now makes it possible for users to engage in large scale and speculative gene discovery with little or no cost. The relatively effortless discovery of the hTERT genes using GeneScope affirms this claim.
Secret Image Sharing with Reversible Steganography
Authors: Chin-Chen Chang, Pei-Yu Lin, Chi-Shiang Chan
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

The significant essentialof secret image sharing approaches is that the revealed content of the secret image must be lossless. Moreover, the distorted stego images can be reverted to the original cover image. In order to achieve these purposes, we first transform the secret pixels into the m-ary notational system. Then, the information data used to reconstruct original pixels from camouflaged pixels are calculated. The information data and transformed secret data are shared using the (t, n)-threshold sharing scheme. In this way, we can retrieve the lossless secret image and reverse the stego image to the original image. According to the experiments, the shadows can be successfully camouflaged in the cover image, and the stego images have satisfactory quality. Moreover, our scheme allows for a large capacity of embedded secret data.
Representational scripting effects on group performance
Authors: B. Slof, G. Erkens, P. A. Kirschner
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

This study investigated the effects of a tool designed for supporting the online collaborative performance of learners carrying out complex learning tasks. Appropriate collaborative cognitive activities may be evoked by structuring the whole learning task into phases and providing congruent external representations for each stage (i.e., representational scripting). It was hypothesized that this combination would lead to increased individual learning and better results for the collaborative task. In groups, 47 secondary education students worked on a complex business-economics problem in four experimental conditions, namely one where groups received task-congruent representations for all stages and three where they received one of the representations for all three phases (task-incongruent). The results indicate that groups that received task-congruent representations in a phased order scored higher on the collaborative task, though this did not result in increased individual learning.
Convergence analysis of a global optimization algorithm using stochastic differential equations
Authors: Panos Parpas, Berç Rustem
Venue: Journal of Global Optimization (2009)

We establish the convergence of a stochastic global optimization algorithm for general non-convex, smooth functions. The algorithm follows the trajectory of an appropriately defined stochastic differential equation (SDE). In order to achieve feasibility of the trajectory we introduce information from the Lagrange multipliers into the SDE. The analysis is performed in two steps. We first give a characterization of a probability measure (¿) that is defined on the set of global minima of the problem. We then study the transition density associated with the augmented diffusion process and show that its weak limit is given by ¿.
On the complexity of non-projective data-driven dependency parsing
Authors: Ryan McDonald, Giorgio Satta
Venue: Proceedings of the 10th International Conference on Parsing Technologies (2007)

In this paper we investigate several non-projective parsing algorithms for dependency parsing, providing novel polynomial time solutions under the assumption that each dependency decision is independent of all the others, called here the edge-factored model. We also investigate algorithms for non-projective parsing that account for nonlocal information, and present several hardness results. This suggests that it is unlikely that exact non-projective dependency parsing is tractable for any model richer than the edge-factored model.
Attention and Motivation in Hypermedia Systems
Authors: Francisco V. Cipolla Ficarra, Miguel Cipolla-Ficarra
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

We present the results of a heuristic analysis of a set of multimedia off-line systems aimed at boosting the mental skills of the users through reflexes, maths, etc. To this purpose two metrics have been created to assess the motivation of the users and the degree of help implicit in the multimedia system. The metrics are based on a group of primitives aiming at increasing the communicability of commercial multimedia systems and targeted to the public at large, regardless of age and previous experience in the use of computers.
Synthesis for Structure Rewriting Systems
Authors: Łukasz Kaiser
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in which a state is described by an arbitrary finite structure, and changes of the state are represented by structure rewriting rules, a generalisation of term and graph rewriting. Both the environment and the controller are allowed to change the structure in this way, and the question we ask is how a strategy for the controller that ensures a given property can be synthesised.We focus on one particular class of structure rewriting rules, namely on separated structure rewriting, a limited syntactic class of rules. To counter this restrictiveness, we allow the property to be ensured by the controller to be specified in a very expressive logic: a combination of monadic second-order logic evaluated on states and the modal μ-calculus for the temporal evolution of the whole system. We show that for the considered class of rules and this logic, it can be decided whether the controller has a strategy ensuring a given property, and in such case a finite-memory strategy can be synthesised. Additionally, we prove that the same holds if the property is given by a monadic second-order formula to be evaluated on the limit of the evolution of the system. 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