pinecone/core-2020-05-10-deduplication huggingface dataset:
Relaxing goodness is still good

Polygonal hybrid systems (SPDIs) are planar hybrid systems, whose dynamics are defined in terms of constant differential inclusions, one for each of a number of polygonal regions partitioning the plane. The reachability problem for SPDIs is known to be decidable, but depends on the <em>goodness</em>assumption -- which states that the dynamics do not allow a trajectory to both enter and leave a region through the same edge. In this paper we extend the decidability result to <em>generalised SPDIs</em>(GSPDI), SPDIs not satisfying the goodness assumption, and give an algorithmic solution to decide reachability of such systems.peer-reviewe
A social and emotional model for obtaining believable emergent behaviors

Proceeding of: 13th International Conference, AIMSA 2008, Varna, Bulgaria, September 4-6, 2008This paper attempts to define an emotional model for virtual agents that behave autonomously in social worlds. We adopt shallow modeling based on the decomposition of the emotional state in two qualities: valence (pleasantness or hedonic value) and arousal (bodily activation) and, also, for the agent personality based on the five factors model (openness, conscientiousness, extroversion, agreeableness and neuroticism). The proposed model aims to endow agents with a satisfactory emotional state achieved through the social actions, i.e. the development of social abilities. Psychology characterizes these social abilities for: using the language as a tool (verbal and nonverbal communication), being learned, producing reciprocal reward among the individuals involved in the communication and for depending on the individual features. We have implemented our model in the framework of a computer game, AI-live, to show its validity.Publicad
Infinite Runs in Weighted Timed Automata with Energy Constraints

International audienceWe~study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the accumulated weight. More specifically, we~consider automata equipped with positive and negative weights on transitions and locations, corresponding to the production and consumption of some resource (\emphe.g.~energy). We~ask the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints (\emphe.g.~remains between~\(0\) and some given upper-bound). We~also consider a game version of the above, where certain transitions may be uncontrollable
Bad news on decision problems for patterns

This is a journal article. It was published in Lecture Notes in Computer Science [© Springer Verlag] and the definitive version is available at: www.springerlink.comWe study the inclusion problem for pattern languages, which\ud
is shown to be undecidable by Jiang et al. (J. Comput. System Sci. 50,\ud
1995). More precisely, Jiang et al. demonstrate that there is no effective\ud
procedure deciding the inclusion for the class of all pattern languages\ud
over all alphabets. Most applications of pattern languages, however, consider\ud
classes over fixed alphabets, and therefore it is practically more\ud
relevant to ask for the existence of alphabet-specific decision procedures.\ud
Our first main result states that, for all but very particular cases, this\ud
version of the inclusion problem is also undecidable. The second main\ud
part of our paper disproves the prevalent conjecture on the inclusion\ud
of so-called similar E-pattern languages, and it explains the devastating\ud
consequences of this result for the intensive previous research on the\ud
most prominent open decision problem for pattern languages, namely\ud
the equivalence problem for general E-pattern languages
Physicality and cooperative design

CSCW researchers have increasingly come to realize that the material work setting and its population of artefacts play a crucial part in coordination of distributed or co-located work. This paper uses the notion of physicality as a basis to understand cooperative work. Using examples from an ongoing fieldwork on cooperative design practices, it provides a conceptual understanding of physicality and shows that material settings and co-workers’ working practices play an important role in understanding the physicality of cooperative design
Inclusion of video information for detection of acoustic events using the fuzzy integral

When applied to interactive seminars, the detection of acoustic events from only audio information shows a large amount of errors, which are mostly due to the temporal overlaps of sounds. Video signals may be a useful additional source of information to cope with that problem for particular events. In this work, we aim at improving the detection of steps by using two audio-based Acoustic Event Detection (AED) systems, with SVM and HMM, and a video-based AED system, which employs the output of a 3D video tracking algorithm. The fuzzy integral is used to fuse the outputs of the three detection systems. Experimental results using the CLEAR 2007 evaluation data show that video information can be successfully used to improve the results of audio-based AED.Peer ReviewedPostprint (published version
Improving a leaves automatic recognition process using PCA

In this work we present a simulation of a recognition process with
perimeter characterization of a simple plant leaves as a unique discriminating
parameter. Data coding allowing for independence of leaves size and orientation
may penalize performance recognition for some varieties. Border description
sequences are then used, and Principal Component Analysis (PCA) is applied in
order to study which is the best number of components for the classification task,
implemented by means of a Support Vector Machine (SVM) System. Obtained
results are satisfactory, and compared with [4] our system improves the
recognition success, diminishing the variance at the same time
Data integration issues in the reconstruction of the genome-scale metabolic model of Zymomonas mobillis

Genome-scale model reconstruction represents a major tool in the field of Metabolic
Engineering .This paper reports on a study about data integration issues in the process of genome-
scale reconstruction of the metabolic model of the bacterium Zymomonas mobilis, a
promising organism for bioethanol production. Data is retrieved from the Entrez Gene, KEGG,
BioCyc and Brenda databases, and the several processes involved in data integration from these
sources are described, as well as the data quality issues.Fundação para a Ciência e a Tecnologia (FCT) - POCI/BIO/60139/2004, PhD grant ref. SFRH/BD/41763/200
Modelling fed-batch fermentation processes: An approach based on artificial neural networks

Publicado em "2nd International Workshop on Practical Applications of Computational Biology and Bioinformatics (IWPACBB 2008)", ISBN 978-3-540-85860-7Artificial Neural Networks (ANNs) have shown to be powerful tools for solving several problems which, due to their complexity, are extremely difficult to unravel with other methods. Their capabilities of massive parallel processing and learning from the environment make these structures ideal for prediction of nonlinear events. In this work, a set of computational tools are proposed, allowing researchers in Biotechnology to use ANNs for the modelling of fed-batch fermentation processes. The main task is to predict the values of kinetics parameters from the values of a set of state variables. The tools were validated with two case studies, showing the main functionalities of the application.This work was supported by the Portuguese FCT under project POSC/EIA/59899/2004
Radix-R FFT and IFFT factorizations for parallel implementation

Two radix-R regular interconnection pattern families of factorizations for both the FFT and the IFFT -also known as parallel or Pease factorizations- are reformulated and presented. Number R is any power of 2 and N, the size of the transform, any power of R. The first radix-2 parallel FFT algorithm -one of the two known radix-2 topologies- was proposed by Pease. Other authors extended the Pease parallel algorithm to different radix and other particular solutions were also reported. The presented families of factorizations for both the FFT and the IFFT are derived from the well-known Cooley-Tukey factorizations, first, for the radix-2 case, and then, for the general radix-R case. Here we present the complete set of parallel algorithms, that is, algorithms with equal interconnection pattern stage-to-stage topology. In this paper the parallel factorizations are derived by using a unified notation based on the use of the Kronecker product and the even-odd permutation matrix to form the rest of permutation matrices. The radix-R generalization is done in a very simple way. It is shown that, both FFT and IFFT share interconnection pattern solutions. This view tries to contribute to the knowledge of fast parallel algorithms for the case of FFT and IFFT but it can be easily applied to other discrete transforms.Peer ReviewedPostprint (published version
Extending Korf's ideas on the pursuit problem

The prey-predator pursuit problem is referenced many times in literature. It is a generic multi-agent problem whose solutions could by applied to many particular instances. Solutions proposed usually apply non-supervised learning algorithms to train prey and predators. Most of these solutions criticize the greedy algorithm originally proposed by Korf. However, we believe that the improvement obtained by these new proposals does not pay off with relation to their complexity.
The method used by Korf is a natural way to surround a prey without explicit communication between predators. The knowledge one predator has about others is
limited just to what it can see. In Korf’s model, agents are able to see the complete world at once. In this paper we propose to start from Korf’s ideas and extend them to improve his model. First, we propose a simple extension of Korf’s fitness function
and we consider the problems related to a partial view of the world. Second, we
propose a communication protocol to partially overcome them. The final results
suggest that more work needs to be done, and we propose a way to follow-on
Quality of information in the context of ambient assisted living

Série : Advances in Soft Computing, vol. 50With the use of new computational technologies and novel methodologies
for problem solving, recurring to the use of Group Decision Support Systems,
normally the problem of incomplete information is marginalized as if we were living
in an ideal world. Common sense tells us that in the precise time a decision is make
it is impossible to know all the information regarding to it, however decisions must
be made. What we propose, in the ambit of the VirtualECare project, is a possible
solution to decision making, through the use of Group Decision Support Systems,
aware of incomplete information but, even so, able to make decisions based in the
quality of the information and its source
CARM: Composable, Adaptive Resource Management system in ubiquitous computing environments

Presently heterogeneous devices provided with several communications interfaces\ud
are everywhere, with this, we are increasingly coming in contact with ”shared”\ud
computer-enhanced devices such as cars, portable media players, or home appliances,\ud
commonly called ubiquitous computing environments. These environments require special properties that traditional computing does not support, such as a proper resource management which plays an important role in pervasive computing where adaptation\ud
and dynamic reconfiguration of resources take place. This work presents a new adaptive\ud
resource management approach that supports adaptation for the required resources.\ud
We use a component-based model to abstract system’s ubiquitous resources in a transparent and uniform way to the applications.Peer ReviewedPostprint (published version
Extended bluetooth naming for empowered presence and situated interaction with public displays

The paradigm of proximity-based discovery and communication enabled
by Bluetooth technology can be very relevant in Ambient Intelligence as an
enabler for situated interaction. In this work, we explore the use of Bluetooth naming
as a key driver for situated interaction around public displays. Our approach to
the use of Bluetooth naming extends beyond self-exposure and introduces support
for simple commands in the name that can trigger actions on the displays. Our
specific objective is to evaluate the usability of this interaction technique and uncover
any guidelines for its usage. We have conducted a study combining a trial in
a public bar and a set of usability interviews. The results obtained confirm Bluetooth
Extended Naming as an easily adoptable technique for situated interaction
and suggest some recommendations to improve its effectiveness
Clustering XML Documents Using Closed Frequent Subtrees: A Structural Similarity Approach

This paper presents the experimental study conducted over the INEX 2007 Document Mining Challenge corpus employing a frequent subtree-based incremental clustering approach. Using the structural information of the XML documents, the closed frequent subtrees are generated. A matrix is then developed representing the closed frequent subtree distribution in documents. This matrix is used to progressively cluster the XML documents. In spite of the large number of documents in INEX 2007 Wikipedia dataset, the proposed frequent subtree-based incremental clustering approach was successful in clustering the documents
GPX : ad-hoc queries and automated link discovery in the Wikipedia

The INEX 2007 evaluation was based on the Wikipedia collection in XML format. In this\ud
paper we describe some modifications to the GPX search engine and the approach taken in the Ad-hoc\ud
and the Link-the-Wiki tracks. The GPX retrieval strategy is based on the construction of a collection\ud
sub-tree, consisting of all nodes that contain one or more of the search terms. Nodes containing search\ud
terms are assigned a score using the GPX ranking scheme which incorporates an extended TF-IDF\ud
variant. In earlier version of GPX scores were recursively propagated from text containing nodes,\ud
through ancestors, all the way to the document root of the XML tree. In this paper we describe a\ud
simplification whereby the score of each node is computed directly, doing away with the score\ud
propagation mechanism. Preliminary results indicate improved performance. The GPX search engine\ud
was used in the Link-the-Wiki track to identify prospective incoming links to new Wikipedia pages. We\ud
also describe a simple and efficient approach to the identification of prospective outgoing links in new\ud
Wikipedia pages. We present preliminary evaluation results
Generalized joint linear complexity of linear recurring multisequences

The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems.\ud
Extensive research  has been carried out on the joint linear complexity of $N$-periodic multisequences using tools from\ud
Discrete Fourier transform. Each $N$-periodic multisequence can be identified with a single $N$-periodic sequence\ud
over an appropriate extension field. It has been demonstrated that the linear complexity of this sequence, the so called\ud
generalized joint linear complexity of the multisequence, may be considerably smaller than the joint linear complexity, which is not desirable for vectorized stream ciphers.\ud
Recently new methods have been developed and results of greater generality on the joint linear complexity of\ud
multisequences consisting of linear recurring sequences have been obtained. In this paper, using these new methods, we investigate\ud
the relations between the generalized joint linear complexity and the joint linear complexity of\ud
multisequences consisting of linear recurring sequences.\u
Building a Narrative Based Requirements Engineering Mediation Model

???The original publication is available at www.springerlink.com???. Copyright Springer. DOI: 10.1007/978-3-540-85936-9_1This paper presents a narrative-based Requirements Engineering (RE) mediation model to help RE practitioners to effectively identify, define, and resolve conflicts of interest, goals, and requirements. With SPI community, there is a common belief that social, human, and organizational issues significantly impact on the effectiveness of the software process improvement in general and requirements engineering process in particularly. Conflicts among different stakeholders are an important human and social issue that needs more research attention in the SPI and RE community. By drawing on the conflict resolution literature and IS literature, we argue that conflict resolution in RE is a mediated process, in which a requirements engineer can act as a mediator among different stakeholders. To address socio-psychological aspect of the conflict in RE and SPI, Winslade and Monk (2000)???s narrative mediation model is introduced, justified, and translated into the context of RE
A geometric constraint over k-dimensional objects and shapes subject to business rules

This report presents a global constraint that enforces rules written\ud
 in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rules are rewritten to Quantifier-Free Presburger Arithmetic (QFPA) formulas. Secondly, such\ud
 formulas are compiled to generators of k-dimensional forbidden sets. Such generators are a generalization of the indexicals of cc(FD). Finally, the forbidden sets generated by such indexicals are\ud
 aggregated by a sweep-based algorithm and used for filtering. The business rules allow to express a great variety of packing and placement constraints, while admitting efficient and effective filtering of the domain variables of the k-dimensional object, without the need to use spatial data structures. The constraint was used to directly encode the packing knowledge of a major car manufacturer and tested on a set of real packing problems under these rules, as well as on a packing-unpacking problem
Edge matching puzzles as hard SAT/CSP benchmarks

Recently, edge matching puzzles, an NP-complete problem, have rececived, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem
instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques
Evolutionary optimization with dynamic fidelity computational models

In this paper, we propose an evolutionary framework for model fidelity control that decides, at runtime, the appropriate fidelity level of the computational model, which is deemed to be computationally less expensive, to be used in place of the exact analysis code as the search progresses. Empirical study on an aerodynamic airfoil design problem based on a Memetic Algorithm with Dynamic Fidelity Model (MA-DFM) demonstrates that improved quality solution and efficiency are obtained over existing evolutionary schemes. © 2008 Springer-Verlag Berlin Heidelberg
Formation control of multiple robots using parametric and implicit representations

A novel method is presented for formation control of a group\ud
of autonomous mobile robots using parametric and implicit descriptions\ud
of the desired formation. Shape formation is controlled by using potential\ud
fields generated from Implicit Polynomial (IP) representations and\ud
the control for keeping the desired shape is designed using Elliptical\ud
Fourier Descriptors (EFD). Coordination of the robots is modeled by\ud
linear springs between each robot and its nearest two neighbors. This\ud
approach offers more flexibility in the formation shape and scales well\ud
to different swarm sizes and to heterogeneous systems. The method is\ud
simulated on robot groups with different sizes to form various formation\ud
shapes
New algorithms to map asymmetries of 3D surfaces

International audienceIn this paper, we propose a set of new generic automated processing tools to characterise the local asymmetries of anatomical structures (represented by surfaces) at an individual level, and within/between populations. The building bricks of this toolbox are: 1) a new algorithm for robust, accurate, and fast estimation of the symmetry plane of grossly symmetrical surfaces, and 2) a new algorithm for the fast, dense, non-linear matching of surfaces. This last algorithm is used both to compute dense individual asymmetry maps on surfaces, and to register these maps to a common template for population studies. We show these two algorithms to be mathematically well-grounded, and provide some validation experiments. Then we propose a pipeline for the statistical evaluation of local asymmetries within and between populations. Finally we present some results on real data
Customized design of hearing aids using statistical shape learning

3D shape modeling is a crucial component of rapid prototyping systems\ud
that customize shapes of implants and prosthetic devices to a patient’s\ud
anatomy. In this paper, we present a solution to the problem of customized 3D\ud
shape modeling using a statistical shape analysis framework. We design a novel\ud
method to learn the relationship between two classes of shapes, which are related\ud
by certain operations or transformation. The two associated shape classes are\ud
represented in a lower dimensional manifold, and the reduced set of parameters\ud
obtained in this subspace is utilized in an estimation, which is exemplified by a\ud
multivariate regression in this paper.We demonstrate our method with a felicitous\ud
application to estimation of customized hearing aid devices
Interactive Simulation of Embolization Coils: Modeling and Experimental Validation

The original publication is available at www.springerlink.comInternational audienceCoil embolization offers a new approach to treat aneurysms. This medical procedure is namely less invasive than an open-surgery as it relies on the deployment of very thin platinum-based wires with the aneurysm through the arteries. When performed intracranially, this procedure must be particularly accurate and therefore carefully planned and performed by experienced radiologists. A simulator of the coil deployment represents an interesting and helpful tool for the physician by providing information on the coil behavior. In this paper, an original modeling is proposed to obtain interactive and accurate simulations of coil deployment. The model takes into account geometric nonlinearities and uses a shape memory formulation to describe its complex geometry. An experimental validation is performed in a contact-free environment to identify the mechanical properties of the coil and to quantitatively compare the simulation with the real data. Computational performances are also measured to insure an interactive simulation