pinecone/core-2020-05-10-deduplication huggingface dataset:
Producing Enactable Protocols in Artificial Agent Societies

This paper draws upon our previous work [7, 16] in which we proposed the organisation of services around the concept of artificial agent societies and presented a framework for representing roles and protocols using LTSs. The agent would apply for a role in the society, which would result in its participation in a number of protocols. We advocated the use of the games-based metaphor for describing the protocols and presented a framework for assessing the admission of the agent to the society on the basis of its competence. In this work we look at the subsequent question: what information should the agent receive upon entry?. We can not provide it with the full protocol because of security and overload issues. Therefore, we choose to only provide the actions pertinent to the protocols that the role the agent applied for participates in the society. We employ branching bisimulation for producing a protocol equivalent to the original one with all actions not involving the role translated into silent (τ) actions. However, this approach sometimes results in non-enactable protocols. In this case, we need to repair the protocol by adding the role in question as a recipient to certain protocol messages that were causing the problems. We present three different approaches for repairing protocols, depending on the number of messages from the original protocol they modify. The modified protocol is adopted as the final one and the agent is given the role automaton that is derived from the branching bisimulation process
Coalition-Oriented Sensing in Wireless Sensor Networks.

Wireless Sensor Networks are generally composed of a large number of nodes that monitor their surrounding area. The monitoring capacity of sensors gets altered by the changing conditions of the environment and the sensors¿ internal state. Sensor coalitions, in which only the leader transmits information to a sink node, are a means to save resources when the conditions of the environment are similar around the sensors in the coalition. In this paper we analyse and formalise such sensor coalitions and propose an algorithm for coalition formation that allows the sensors to self-organise with the purpose of performing a good monitoring of the environment while maximising the life span of the sensor network as a whole. The algorithm uses the quality of the information fused at the coalition leader and the remaining energy of the sensors as the basic parameters to alter coalition membership and leadership.Peer Reviewe
Environment Characterization for Non-Recontaminating Frontier-Based Robotic Exploration

This paper addresses the problem of obtaining a concise description of a physical environment for robotic exploration. We aim to determine the number of robots required to clear an environment using non-recontaminating exploration. We introduce the medial axis as a configuration space and derive a mathematical representation of a continuous environment that captures its underlying topology and geometry. We show that this representation provides a concise description of arbitrary environments, and that reasoning about points in this representation is equivalent to reasoning about robots in physical space. We leverage this to derive a lower bound on the number of required pursuers. We provide a transformation from this continuous representation into a symbolic representation. Finally, we present a generalized pursuit-evasion algorithm. Given an environment we can compute how many pursuers we need, and generate an optimal pursuit strategy that will guarantee the evaders are detected with the minimum number of pursuers.Singapore-MIT Alliance for Research and Technology Center (Future Urban Mobility Project)United States. Air Force Office of Scientific Research (Award FA9550-08-1-0159)National Science Foundation (U.S.) (Award CNS-0715397)National Science Foundation (U.S.) (Award CCF-0726514)National Science Foundation (U.S.) (Grant 0735953
A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry

International audienceThis paper presents a formalization of Grassmann-Cayley algebra that has been done in the COQ proof assistant. The formalization is based on a data structure that represents elements of the algebra as complete binary trees. This allows to define the algebra products recursively. Using this formalization, published proofs of Pappus' and Desargues' theorem are interactively derived. A method that automatically proves projective geometric theorems is also translated successfully into the proposed formalization
Extending Logic Programs with Description Logic Expressions for the Semantic Web

Recently much attention has been directed to extending logic  programming with description logic (DL) expressions, so that logic programs  have access to DL knowledge bases and thus are able to reason  with ontologies in the Semantic Web. In this paper, we propose a new  extension of logic programs with DL expressions, called normal DL logic  programs. In a normal DL logic program arbitrary DL expressions are  allowed to appear in rule bodies and atomic DL expressions (i.e., atomic  concepts and atomic roles) allowed in rule heads. We extend the key condition  of well-supportedness for normal logic programs under the standard  answer set semantics to normal DL logic programs and define an  answer set semantics for DL logic programs which satisfies the extended  well-supportedness condition. We show that the answer set semantics for  normal DL logic programs is decidable if the underlying description logic  is decidable (e.g. SHOIN or SROIQ).Griffith Sciences, Griffith School of EngineeringFull Tex
On the computation of the geodesic distance with an application to dimensionality reduction in a neuro-oncology problem

Manifold learning models attempt to parsimoniously describe multivariate data through a low-dimensional manifold embedded in data space. Similarities between points along this manifold are often expressed as Euclidean distances. Previous research has shown that these similarities are better expressed as geodesic distances. Some problems concerning the computation of geodesic distances along the manifold have to do with time and storage restrictions related to the graph representation of the manifold. This paper provides different approaches to the computation of the geodesic distance and the implementation of Dijkstra’s shortest path algorithm, comparing their performances. The optimized procedures are bundled into a software module that is embedded in a dimensionality reduction method, which is applied to MRS data from human brain tumours. The experimental results show that the proposed implementation explains a high proportion of the data variance with a very small number of extracted features, which should ease the medical interpretation of subsequent results obtained from the reduced datasets.Peer ReviewedPostprint (published version
How to 'Make a bridge to the new town' using OntoAccess

Business-critical legacy applications often rely on relational databases to sustain daily operations. Introducing Semantic Web technology in newly developed systems is often difficult, as these systems need to run in tandem with their predecessors and cooperatively read and update existing data.A common pattern is to incrementally migrate data from a legacy system to its successor by running the new system in parallel, with a data bridge in between. Existing approaches that can be deployed as a data bridge in theory, restrict Semantic Web-enabled applications to read legacy data in practice, disallowing update operations completely.This paper explains how our RDB-to-RDF platform OntoAccess can be used to transition legacy systems into Semantic Web-enabled applications. By means of a case study, we exemplify how we successfully made a bridge between one of our own large-scale legacy systems and its long-term replacement. We elaborate on challenges we faced during the migration process and how we were able to overcome them
Wavelet Algorithm for Circuit Simulation

We present a new adaptive circuit simulation algorithm based on spline
wavelets. The unknown voltages and currents are expanded into a wavelet
representation, which is determined as solution of nonlinear equations derived
from the circuit equations by a Galerkin discretization. The spline wavelet
representation is adaptively refined during the Newton iteration. The resulting
approximation requires an almost minimal number of degrees of freedom, and in
addition the grid refinement approach enables very efficient numerical
computations. Initial numerical tests on various types of electronic circuits
show promising results when compared to the standard transient analysis
Asymptotics of a small liquid drop on a cone and plate rheometer

A cone and a plate rheometer is a laboratory apparatus used to measure the viscosity and other related parameters of a non-Newtonian liquid subject to an applied force. A small drop, of order millimetres, of the liquid is located between the horizontal plate and the shallow cone of the rheometer. Rotation of the cone ensues, the liquid begins to flow and the plate starts to rotate. Liquid parameters are inferred based on the difference in the applied rotational force and the resulting rotational force of the plate. To describe the flow of the drop, the initial drop configuration, before rotation commences, must be determined. The equilibrium drop profile is given by the solution to the well-known nonlinear Young-Laplace equation. We formulate asymptotic solutions for the drop profile based on the small Bond number. The modelling of the drop exhibits a rich asymptotic structure consisting of five distinct scalings which are resolved via the method matched asymptotics
A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve

The sparse matrix–vector (SpMV) multiplication is an important kernel in many applications. When the sparse matrix used is unstructured, however, standard SpMV multiplication implementations typically are inefficient in terms of cache usage, sometimes working at only a fraction of peak performance. Cache-aware algorithms take information on specifics of the cache architecture as a parameter to derive an efficient SpMV multiply. In contrast, cache-oblivious algorithms strive to obtain efficiency regardless of cache specifics. In earlier work in this latter area, Haase et al. (2007) use the Hilbert curve to order nonzeroes in the sparse matrix. They obtain speedup mainly when multiplying against multiple (up to eight) right-hand sides simultaneously. We improve on this by introducing a new datastructure, called Bi-directional Incremental Compressed Row Storage (BICRS). Using this datastructure to store the nonzeroes in Hilbert order, speedups of up to a factor two are attained for the SpMV multiplication y = Ax on sufficiently large, unstructured matrices.status: publishe
The role of coordination analysis in software integration projects

Available for individual study only.What sort of component coordination strategies emerge in a software integration process? How can such strategies be discovered and further analysed? How close are they to the coordination component of the envisaged architectural model which was supposed to guide the integration process? This paper introduces a framework in which such questions can be discussed and illustrates its use by describing part of a real case-study. The approach is based on a methodology which enables semi-automatic discovery of coordination patterns from source code, combining generalized slicing techniques and graph manipulationThis research was partially supported by Fct in the context of the Mondrian project, under contract PTDC/EIA-CCO/108302/200
Software quality management improvement through mentoring: an exploratory study from GSD projects

Proceeding of: OTM 2011 Workshops: Confederated InternationalWorkshops and Posters: EI2N+NSF ICE, ICSP+INBAST, ISDE, ORM, OTMA, SWWS+MONET+SeDeS, and VADER 2011, Hersonissos, Crete, Greece, October 17-21, 2011Software Quality Management (SQM) is a set of processes and procedures designed to assure the quality of software artifacts along with their development process. In an environment in which software development is evolving to a globalization, SQM is seen as one of its challenges. Global Software Development is a way to develop software across nations, continents, cultures and time zones. The aim of this paper is to detect if mentoring, one of the lead personnel development tools, can improve SQM of projects developed under GSD. The results obtained in the study reveal that the influence of mentoring on SQM is just temperate
Towards a framework for work package allocation for GSD

Proceeding of: Proceeding of: OTM 2011 Workshops: Confederated International Workshops and Posters: EI2N+NSF ICE, ICSP+INBAST, ISDE, ORM, OTMA, SWWS+MONET+SeDeS, and VADER 2011, Hersonissos, Crete, Greece, October 17-21, 2011Global software development is an inexorable trend in the software industry. The impact of the trend in conventional software development can be found in many of its aspects. One of them is task or work package allocation. Task allocation was traditionally driven by resource competency and availability but GSD introduces new complexities to this process including time-zones differences, costs and cultural differences. In this work a report on the construction of a framework for work-package allocation within GSD projects is presented. This framework lies on three main pillars: individual and organizational competency, organizational customization and sound assessment methods.This work is supported by the Spanish Centro para el Desarrollo
Tecnológico Industrial (CDTI) under the Eureka Project E! 6244 PROPS-Tour and
the national cooperation project SEM-IDi (IDI-20091150)
Dimensional analysis and dimensional reasoning.

This chapter explores some of the ways physical dimensions, such as length, mass and time, impact on the work of scientists and engineers. Two main themes are considered: dimensional analysis, which involves deriving algebraic expressions to relate quantities based on their dimensions; and dimensional rea-soning, a more general and often more subtle approach to problem solving. The method of dimensional analysis is discussed both in terms of its practical applica-tion (including the derivation of physical formulae, the planning of experiments, and the investigation of self-similar systems and scale models) and its conceptual contribution. The connection between dimensions and the fundamental concept of orthogonality is also described. In addition to these important uses of dimensions, it is argued that dimensional reasoning (using dimensionless comparisons to sim-plify models, the application of dimensional homogeneity to check for algebraic consistency, and the ‘mapping-out’ of solutions in terms of parameter space) forms the implicit foundation of nearly all theoretical work and plays a central role in the way scientists and engineers think about problems and communicate ideas
A Topological Study of Chaotic Iterations. Application to Hash Functions

International audienceChaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its topological behavior is proposed. It is stated that, in addition to being chaotic as defined in the Devaney's formulation, this tool possesses the property of topological mixing. Additionally, its level of sensibility, expansivity, and topological entropy are evaluated. All of these properties lead to a complete unpredictable behavior for the chaotic iterations. As it only manipulates binary digits or integers, we show that it is possible to use it to produce truly chaotic computer programs. As an application example, a truly chaotic hash function is proposed in two versions. In the second version, an artificial neural network is used, which can be stated as chaotic according to Devaney
Multivariate Correlation Analysis Technique Based on Euclidean Distance Map for Network Traffic Characterization

The quality of feature has significant impact on the performance of detection techniques used for Denial-of-Service (DoS) attack. The features that fail to provide accurate characterization for network traffic records make the techniques suffer from low accuracy in detection. Although researches have been conducted and attempted to overcome this problem, there are some constraints in these works. In this paper, we propose a technique based on Euclidean Distance Map (EDM) for optimal feature extraction. The proposed technique runs analysis on original feature space (first-order statistics) and extracts the multivariate correlations between the first-order statistics. The extracted multivariate correlations, namely second-order statistics, preserve significant discriminative information for accurate characterizations of network traffic records, and these multivariate correlations can be the high-quality potential features for DoS attack detection. The effectiveness of the proposed technique is evaluated using KDD CUP 99 dataset and experimental analysis shows encouraging results
PMG-pro: a model-driven development method of service-based applications

Published version of a chapter published in the book: SDL 2011: Integrating System and Software Modeling. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-25264-8_12In the Internet of Things, billions of networked and software-driven devices will be connected to the Internet. They can communicate and cooperate with each other to form a composite system. In this paper, we propose PMG-pro (present, model, generate and provide), a language independent, bottom-up and model-driven method for the development of such composite system. We envision that all devices in the Internet of Things provide their functionalities as services. From a service description, a service presenter generates source code (i.e., for the service invocations) and uses an abstract graphical representation to represent a service. The code is connected to the abstract graphical service representation. A service abstractor constructs the abstract graphical representations even more abstract in hierarchical service taxonomy. Software developers use the abstract graphical service presentations to specify new service-based applications, while the source code is used for the automation of code generation
Using the relaxed plan heuristic to select goals in oversubscription planning problems

Oversubscription planning (OSP) appears in many
real problems where  nding a plan achieving all goals is infeasi-
ble. The objective is to  nd a feasible plan reaching a goal sub-
set while maximizing some measure of utility. In this paper, we
present a new technique to select goals \a priori" for problems in
which a cost bound prevents all the goals from being achieved.
It uses estimations of distances between goals, which are com-
puted using relaxed plans. Using these distances, a search in
the space of subsets of goals is performed, yielding a new set of
goals to plan for. A revised planning problem can be created and
solved, taking into account only the selected goals. We present
experiments in six di erent domains with good results.This work has been partially supported by MICIIN TIN2008-06701-C03-03 and
CCG10-UC3M/TIC-5597 projects.Publicad
Multiscale extension of the gravitational approach to edge detection

The multiscale techniques for edge detection aim to combine the advantages of small and large scale methods, usually by blending their results. In this work we introduce a method for the multiscale extension of the Gravitational Edge Detector based on a t-norm T. We smoothen the image with a Gaussian filter at different scales then perform inter-scale edge tracking. Results are included illustrating the improvements resulting from the application of the multiscale approach in both a quantitative and a qualitative way
Combining neighbourhoods in fuzzy job shop problems

Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2011(14th. 2011. La Laguna, Spain)In the sequel, we propose a new neighbourhood structure for local search for the fuzzy job shop scheduling problem, which is a variant of the well-known job shop problem, where uncertain durations are modelled as fuzzy numbers and the objective is to minimise the expected makespan of the resulting schedule. The new neighbourhood structure is based on changing the position of a task in a critical block. We provide feasibility conditions and a makespan estimate which allows to select only feasible and promising neighbours. The experimental results illustrate the success of our proposal in reducing expected makespan within a memetic algorithm. The experiments also show that combining the new structure with an existing neighbourhood from the literature considering both neighborhoods at the same time, provides the best result
Weighted tardiness minimization in job shops with setup times by hybrid genetic algorithm

Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2011 (14th. 2011. La Laguna, España)In this paper we confront the weighted tardiness minimization in the job shop scheduling problem with sequence-dependent setup times. We start by extending an existing disjunctive graph model used for makespan minimization to represent the weighted tardiness problem. Using this representation, we adapt a local search neighborhood originally defined for makespan minimization. The proposed neighborhood structure is used in a genetic algorithm hybridized with a simple tabu search method. This algorithm is quite competitive with state-of-the-art methods in solving problem instances from several datasets of both classical JSP and JSP with setup time
The VoiceApp System: Speech Technologies to Access the Semantic Web

Proceedings of: 14th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2011, La Laguna, Spain, November 7-11, 2011Maximizing accessibility is not always the main objective in the design of web applications, specially if it is concerned with facilitating access for disabled people. In this paper we present the VoiceApp
multimodal dialog system, which enables to access and browse Internet by means of speech. The system consists of several modules that provide different user experiences on the web. Voice Dictionary allows the
multimodal access to the Wikipedia encyclopedia, Voice Pronunciations has been developed to facilitate the learning of new languages by means of games with words and images, whereas Voice Browser provides a fast
and effective multimodal interface to the Google web search engine. All the applications in the system can be accessed multimodally using traditional graphic user interfaces such as keyboard and mouse, and/or by
means of voice commands. Thus, the results are accessible also for motorhandicapped and visually impaired users and are easier to access by any user in small hand-held devices where graphical interfaces are in some
cases difficult to employ.Research funded by projects CICYT TIN 2008-06742-C02-02/TSI, CICYT TEC 2008-06732-C02-02/TEC, CAM CONTEXTS (S2009/TIC-1485), and DPS 2008-07029-C02-02.Publicad
Multi-variate quickest detection of significant change process

The paper deals with a mathematical model of a surveillance system based on a net of sensors. The signals acquired by each node of the net are Markovian process, have two different transition probabilities, which depends on  the presence or absence of a intruder nearby. The detection of the transition probability change at one node should be confirmed by a detection of similar change at some other sensors. Based on a simple game the model of a fusion center is then constructed. The aggregate function defined on the net is the background of the definition of a non-cooperative stopping game which is a model of the multivariate disorder detection