ppxscal/embedding_network huggingface dataset:
Hormone-Inspired Cooperative Control for Multiple UAVs Wide Area Search
Authors: Hui Peng, Yuan Li, Lin Wang, Lincheng Shen
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Teams of unmanned aerial vehicles (UAVs) are well suited to perform a search mission where multiple unknown targets located over a wide area. It is an important research area in cooperative control. Hormones are the common biological mechanism that enables cells to communicate and coordinate without central units. In this paper, we combine digital hormone mechanisms with recent search map method to provide a more effective way for multiple UAVs cooperative search. By using this extended map, single UAV can make local path decisions and coordinate their search behavior with neighboring UAVs via digital hormones information. UAV teams can display a better area searching ability without central command and control. Simulation results demonstrate the efficiency of the proposed approach.
Divisible E-Cash Systems Can Be Truly Anonymous
Authors: Sébastien Canard, Aline Gouget
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

This paper presents an off-line divisible e-cash scheme where a user can withdraw a divisible coin of monetary value 2 L that he can parceled and spend anonymously and unlinkably. We present the construction of a security tag that allows to protect the anonymity of honest users and to revoke anonymity only in case of cheat for protocols based on a binary tree structure without using a trusted third party. This is the first divisible e-cash scheme that provides both full unlinkability and anonymity without requiring a trusted third party.
Securing Workflows with XACML, RDF and BPEL
Authors: Vijayant Dhankhar, Saket Kaushik, Duminda Wijesekera
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

The XACML is the access controller of the World Wide Web (WWW). The current reference implementation has a single policy decision point and a policy enforcement point. If XACML policies are used to control workflow among cooperating web services, such as those envisioned in more contemporary languages like (BPEL), it requires coordination to be policy compliant. We propose the necessary enhancements required to do so by passing contextual information that are needed for the requester to evaluate an access control decision as opposed to the standard four decision values of permit, deny, indeterminate to make a decision and an unforeseeable error occurred during evaluation. Proposed contextual information is sufficient to coordinate and if necessary synchronize among coordinating policy enforcement points distributed among the WWW. We show how the contextual information can be constructed and verified using the Resource Description Framework (RDF) and the coordination implemented using BPEL.
Note-taker: enabling students who are legally blind to take notes in class
Authors: David Hayden, Dirk Colbry, John A. Black,  Jr., Sethuraman Panchanathan
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

The act of note-taking is a key component of learning in secondary and post-secondary classrooms. Students who take notes retain information from classroom lectures better, even if they never refer to those notes afterward. However, students who are legally blind, and who wish to take notes in their classrooms are at a disadvantage. Simply equipping classrooms with lecture recording systems does not substitute for note taking, since it does not actively engage the student in note-taking during the lecture. In this paper we detail the problems encountered by one math and computer science student who is legally blind, and we present our proposed solution: the CUbiC Note-Taker, which is a highly portable device that requires no prior classroom setup, and does not require lecturers to adapt their presentations. We also present results from two case studies of the Note-Taker, totaling more than 200 hours of in-class use.
Modeling Techniques Used in Addressing the Quality of Software
Authors: Peter A. Keiller, Thomas A. Mazzuchi, Marlon Mejias
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

In many organizations, the quality of newly developed code is measured after the code is shipped. In this paper, strategies are defined using modeling techniques to improve/determine the quality of the code during the different stages of the software life cycle. The management and implementation of the software process (which is looked at as following three major phases) is outlined together with some related modeling tools and methodologies. The different phases are discussed and some of the required measures are noted. The approach is centered on a large software development organization whose software is developed in house using a client/server architecture for the production and test environments.
A 3D fully parallel surface-thinning algorithm
Authors: Kálmán Palágyi
Venue: Theoretical Computer Science (2008)

The thinning is an iterative layer by layer erosion until only the ''skeletons'' of the objects are left. This paper presents a thinning algorithm for extracting medial surfaces from 3D binary pictures. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. An efficient implementation of the proposed algorithm on conventional sequential computers is given and the topological correctness for (26, 6) binary pictures is proved.
Non-uniform fractional tessellation
Authors: Jacob Munkberg, Jon Hasselgren, Tomas Akenine-Möller
Venue: Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware (2008)

We present a technique that modifies the tessellator in current graphics hardware so that the result is a more uniformly distributed tessellation in screen space. For increased flexibility, vertex tessellation weights are introduced. Our results show that the tessellation quality is improved at a moderate cost.
MobiPADS: A Reflective Middleware for Context-Aware Mobile Computing
Authors: Alvin T. S. Chan
Venue: IEEE Transactions on Software Engineering (2003)

Traditionally, middleware technologies, such as CORBA, Java RMI, and Microsoft's DCOM, have provided a set of distributed computing services that essentially abstract the underlying network services to a monolithic "black box. In a mobile operating environment, the fundamental assumption of middleware abstracting a unified distributed service for all types of applications operating over a static network infrastructure is no longer valid. In particular, mobile applications are not able to leverage the benefits of adaptive computing to optimize its computation based on current contextual situations. In this paper, we introduce the Mobile Platform for Actively Deployable Service (MobiPADS) system. MobiPADS is designed to support context-aware processing by providing an executing platform to enable active service deployment and reconfiguration of the service composition in response to environments of varying contexts. Unlike most mobile middleware, MobiPADS supports dynamic adaptation at both the middleware and application layers to provide flexible configuration of resources to optimize the operations of mobile applications. Within the MobiPADS system, services (known as mobilets) are configured as chained service objects to provide augmented services to the underlying mobile applications so as to alleviate the adverse conditions of a wireless environment.
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
Authors: David Frutos Escrig, Miguel Palomino, Ignacio Fábregas
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For that we show how to relate the underlying powerset and probabilistic distributions functors with the multiset functor by means of adequate natural transformations. This leads us to the general topic that we investigate in the paper: a natural transformation from a functor F to another G transforms F-bisimulations into G-bisimulations but, in general, it is not possible to express G-bisimulations in terms of F-bisimulations. However, they can be characterized by considering Hughes and Jacobs' notion of simulation, taking as the order on the functor F the equivalence induced by the epi-mono decomposition of the natural transformation relating F and G. We also consider the case of alternating probabilistic systems where non-deterministic and probabilistic choices are mixed, although only in a partial way, and extend all these results to categorical simulations.
What's New in Wolfram's New Kind of Science?
Authors: Leon Chua
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Wolframfs monumental best seller entitled gA new kind of scienceh was based almost entirely on brute-force computer simulations. In sharp contrast, this lecture presents a rigorous analytical theory based on attractors from a nonlinear dynamics perspective. New results and concepts to be presented include the partitioning (via Felix Kleinfs Vierergruppe) of all 256 local Boolean rules studied empirically by Wolfram into 88 global equivalence classes, one of which contains 4 topologically-conjugate rules capable of universal computation, and endowed with a 1/f spectrum. Another major result is the rigorous characterization of the time-asymptotic dynamics (attractors) of 112 local rules via an explicit generalized Bernoulli shift formula. Even more surprising, we have discovered the attractors of 170 local rules are blessed with the remarkable property of time-reversality. For such rules, the past evolution in time can be recovered from the future evolutions of a corresponding gtwinh rule. Only 86 local rules exhibit an garrow of timeh. One of our most fascinating discoveries is a new phenomenon, dubbed an gIsle of Eden,h having no counter part in hyperbolic differential equations, which has neither a past, nor a future! In addition to providing a mathematical foundation for brainlike dynamics, the discoveries cited above provide simple dynamical mechanism for mimicking many exotic phenomena from brain science, quantum physics, cosmology, etc.
Semi-external LTL Model Checking
Authors: Stefan Edelkamp, Peter Sanders, Pavel Šimeček
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

In this paper we establish c-bit semi-external graph algorithms, --- i.e., algorithms which need only a constant number c of bits per vertex in the internal memory. In this setting, we obtain new trade-offs between time and space for I/O efficient LTL model checking. First, we design a c-bit semi-external algorithm for depth-first search. To achieve a low internal memory consumption, we construct a RAM-efficient perfect hash function from the vertex set stored on disk. We give a similar algorithm for double depth-first search, which checks for presence of accepting cycles and thus solves the LTL model checking problem. The I/O complexity of the search itself is proportional to the time for scanning the search space. For on-the-fly model checking we apply iterative-deepening strategy known from bounded model checking.
Integrating m-learning with e-learning
Authors: Shahid Islam Wains, Waqar Mahmood
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

Wireless and mobile technology has transformed the didactic world. M-Learning is an emerging field which blends wireless technology and mobile computing to educate the world. This study investigates the effectiveness and viability of cellular technology to teach and train distance learners. The research answers following questions with reference to distance learning in Pakistan but not limited to it: Is this feasible to use cellular technology to educate people on mass scale? How can cellular technology help the Government of Pakistan face the challenge of providing education for all? What can be the motivations for the use of cellular technology instead of TV, radio and internet? What can be the limitations that may hinder the use of mobile devices for learning purpose? The distance learning models of Allama Iqbal Open University of Pakistan (AIOU) and Virtual University of Pakistan (VU) are studied to address the readiness of M-Learning environment in such universities. It is found that cellular technology can increase the efficacy of distance education. It is well suited to teach the language skills and information technology courses. We can use cellular technology as a supplement to the existing learning technologies to reaching huge student masses, in a timely and cost effective manner, through a variety of devices and over a diverse terrain.
Challenges to Machine Learning: Relations Between Reality and Appearance
Authors: John Mccarthy
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Machine learning research, e.g. as described in [4], has as its goal the discovery of relations among observations, i.e. appearances. This is inadequate for science, because there is a reality behind appearance, e.g. material objects are built up from atoms. Atoms are just as real as dogs, only harder to observe, and the atomic theory arose long before there was any idea of how big atoms were. This article discusses how atoms were discovered, as an example of discovering the reality behind appearance. We also present an example of the three-dimensional reality behind a two-dimensional appearance, and how that reality is inferred by people and might be inferred by computer programs. Unfortunately, it is necessary to discuss the philosophy of appearance and reality, because the mistaken philosophy of taking the world (or particular phenomena) as a structure of sense data has been harmful in artificial intelligence and machine learning research, just as behaviorism and logical positivism harmed psychology.
Identity-Based Key-Insulated Signature Without Random Oracles
Authors: Jian Weng, Shengli Liu, Kefei Chen, Changshe Ma
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Traditional identity-based signature schemes typically rely on the assumption that secret keys are kept perfectly secure. However, with more and more cryptographic primitives are deployed on insecure devices such as mobile devices, key-exposure seems inevitable. No matter how strong the identity-based signature scheme is, once the secret key is exposed, its security is entirely lost. Therefore, how to deal with this problem in identity-based signatures is a worthwhile challenge. In this paper, applying Dodis et al.'s key-insulation mechanism, we propose a new ID-based key-insulated signature scheme. What makes our scheme attractive is that it is provably secure without random oracles.
Property-Based TPM Virtualization
Authors: Ahmad-Reza Sadeghi, Christian Stüble, Marcel Winandy
Venue: Proceedings of the 11th international conference on Information Security (2008)

Today, virtualization technologies and hypervisors celebrate their rediscovery. Especially migration of virtual machines (VMs) between hardware platforms provides a useful and cost-effective means to manage complex IT infrastructures. A challenge in this context is the virtualization of hardware security modules like the Trusted Platform Module (TPM) since the intended purpose of TPMs is to securely link software and the underlying hardware. Existing solutions for TPM virtualization, however, have various shortcomings that hinder the deployment to a wide range of useful scenarios. In this paper, we address these shortcomings by presenting a flexible and privacy-preserving design of a virtual TPM that in contrast to existing solutions supports different approaches for measuring the platform's state and for key generation, and uses property-based attestation mechanisms to support software updates and VM migration. Our solution improves the maintainability and applicability of hypervisors supporting hardware security modules like TPM.
An Evolutionary Perspective on Approximate RDF Query Answering
Authors: Christophe Guéret, Eyal Oren, Stefan Schlobach, Martijn Schut
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

RDF is increasingly being used to represent large amounts of data on the Web. Current query evaluation strategies for RDF are inspired by databases, assuming perfect answers on finite repositories. In this paper, we focus on a query method based on evolutionary computing, which allows us to handle uncertainty, incompleteness and unsatisfiability, and deal with large datasets, all within a single conceptual framework. Our technique supports approximate answers with "anytime" behaviour. We present scalability results and next steps for improvement.
Access Control Model Based on RDB Security Policy for OWL Ontology
Authors: Dongwon Jeong, Yixin Jing, Doo-Kwon Baik
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Most of information has been storing and managing in relational databases and there are many researches to store OWL ontologies. In this situation, a study on efficient access control model using relational security model is required. The paper proposes a novel access control model for OWL ontologies in relational database systems. The access control is realized through evaluating queries against an OWL data view. On one hand, the OWL data view prevents the sensitive information revealed to unauthorized users. On the other hand it considers the inference ability of users. An empirical study verifies the effectiveness of our approach.
Hybrid Index for Metric Space Databases
Authors: Mauricio Marin, Veronica Gil-Costa, Roberto Uribe
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

We present an index data structure for metric-space databases. The proposed method has the advantage of allowing an efficient use of secondary memory. In the case of index entirely loaded in main memory our strategy achieves competitive performance. Our experimental study shows that the proposed index outperforms other strategies known to be efficient in practice. A valuable feature of the proposal is that the index can be dynamically updated once constructed.
The Shannon Entropy-Based Node Placement for Enrichment and Simplification of Meshes
Authors: Vladimir Savchenko, Maria Savchenko, Olga Egorova, Ichiro Hagiwara
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper, we present a novel simple method based on the idea of exploiting the Shannon entropy as a measure of the inter-influence relationships between neighboring nodes of a mesh to optimize node locations. The method can be used in a pre-processing stage for subsequent studies such as finite element analysis by providing better input parameters for these processes. Experimental results are included to demonstrate the functionality of our method.
Using Topic Maps for Visually Exploring Various Data Sources in a Web-Based Environment
Authors: Eicke Godehardt, Nadeem Bhatti
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

Today every company and every single person owns a lot of data. However, easy ways for exploration and navigation are not very widespread. Especially, if complex relations between these data are defined and the amount of data becomes bigger, an easy to use interface is necessary.This paper describes a topic map viewer, which is easy embeddable into websites to offer none-experts an innovative way to find new and relevant information. To display even huge information spaces in a web environment, this paper describes two concepts supporting scalability are explained, namely data exchange and visualization. For the data exchange between client and server pre-fetching mechanism is introduced to load data in small chunks. Garbage collection complements this to prevent overloading of the viewer by unloading not needed topics. Furthermore the clustering concept for the visualization is used to handle the huge amount of information.
Shedding Light on a Troublesome Issue in NLIDBS
Authors: Rodolfo Pazos, René Santaolalaya S., Juan C. Rojas P., Joaquín Pérez O.
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

A natural language interface to databases (NLIDB) without help mechanisms that permit clarifying queries is prone to incorrect query translation. In this paper we draw attention to a problem in NLIDBs that has been overlooked and has not been dealt with systematically: word economy; i.e., the omission of words when expressing a query in natural language (NL). In order to get an idea of the magnitude of this problem, we conducted experiments on EnglishQuery when applied to a corpora of economized-wording queries. The results show that the percentage of correctly answered queries is 18%, which is substantially lower than those obtained with corpora of regular queries (53%---83%). In this paper we describe a typification of problems found in economized-wording queries, which has been used to implement domain-independent dialog processes for an NLIDB in Spanish. The incorporation of dialog processes in an NLIDB permits users to clarify queries in NL, thus improving the percentage of correctly answered queries. This paper presents the tests of a dialog manager that deals with four types of query problems, which permits to improve the percentage of correctly answered queries from 60% to 91%. Due to the generality of our approach, we claim that it can be applied to other domain-dependent or domain-independent NLIDBs, as well as other NLs such as English, French, Italian, etc.
An Agent-Based Coupling Platform for Complex Automata
Authors: Jan Hegewald, Manfred Krafczyk, Jonas Tölke, Alfons Hoekstra, Bastien Chopard
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

The ability to couple distinct computational models of science and engineering systems is still a recurring challenge when developing multiphysics applications.The applied coupling technique is often dictated by various constraints (such as hard- and software requirements for the submodels to be coupled). This may lead to different coupling strategies/implementations in case a submodel has to be replaced in an existing coupled setup.Additional efforts are required when it comes to multiscale coupling. At least one of the submodels has to be modified to provide a matching interface on a specific spatial and temporal scale.In the present paper we describe a generic coupling mechanism/framework to reduce these common problems and to facilitate the development of multiscale simulations consisting of a multitude of submodels.The resulting implementation allows the coupling of legacy as well as dedicated codes with only minor adjustments. As the system is being build upon the JADE library, our platform fully supports computations on distributed heterogeneous hardware.We discuss the platform's capabilities by demonstrating the coupling of several cellular-automata kernels to model a coupled transport problem.