Search results for "METHODOLOGIE"
showing 10 items of 2141 documents
The PASSI and Agile PASSI MAS Meta-models Compared with a Unifying Proposal
2005
A great number of processes for multi-agent systems design have been presented in last years to support the different approaches to agent-oriented design; each process is specific for a particular class of problems and it instantiates a specific MAS meta-model. These differences produce inconsistences and overlaps: a MAS meta-model may define a term not referred by another, or the same term can be used with a different meaning. We think that the lack of a standardization may cause a significant delay to the diffusion of the agent paradigm outside research context. Working for this unification goal, it is also necessary to define in unambiguous way the terms of the agent model and their rela…
THE TOPOLOGY OF BASIN BOUNDARIES IN A CLASS OF THREE-DIMENSIONAL DYNAMICAL SYSTEMS
1996
We will develop new methods to determine the topology of the basin boundary in a class of three-dimensional dynamical systems. One approach is to approximate the basin boundary by backward integration. Unfortunately, there are dynamical systems where it is hard to approximate the basin boundary by a numerical backward integration algorithm. We will introduce topological methods which will provide new information about the structure of the basin boundary. The topological invariants which we will use can be numerically computed.
Weaving words for textile museums: the development of the linked SILKNOW thesaurus.
2022
Abstract The cultural heritage domain in general and silk textiles, in particular, are characterized by large, rich and heterogeneous data sets. Silk heritage vocabulary comes from multiple sources that have been mixed up across time and space. This has led to the use of different terminology in specialized organizations in order to describe their artefacts. This makes data interoperability between independent catalogues very difficult. To address these issues, SILKNOW created a multilingual thesaurus related to silk textiles. It was carried out by experts in textile terminology and art historians and computationally implemented by experts in text mining, multi-/cross-linguality and semanti…
SMART: Unique splitting-while-merging framework for gene clustering
2014
© 2014 Fa et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Successful clustering algorithms are highly dependent on parameter settings. The clustering performance degrades significantly unless parameters are properly set, and yet, it is difficult to set these parameters a priori. To address this issue, in this paper, we propose a unique splitting-while-merging clustering framework, named "splitting merging awareness tactics" (SMART), which does not require any a priori knowledge of either the number …
Computation Cluster Validation in the Big Data Era
2017
Data-driven class discovery, i.e., the inference of cluster structure in a dataset, is a fundamental task in Data Analysis, in particular for the Life Sciences. We provide a tutorial on the most common approaches used for that task, focusing on methodologies for the prediction of the number of clusters in a dataset. Although the methods that we present are general in terms of the data for which they can be used, we offer a case study relevant for Microarray Data Analysis.
Data Analysis and Bioinformatics
2007
Data analysis methods and techniques are revisited in the case of biological data sets. Particular emphasis is given to clustering and mining issues. Clustering is still a subject of active research in several fields such as statistics, pattern recognition, and machine learning. Data mining adds to clustering the complications of very large data-sets with many attributes of different types. And this is a typical situation in biology. Some cases studies are also described.
Structural clustering of millions of molecular graphs
2014
We propose an algorithm for clustering very large molecular graph databases according to scaffolds (i.e., large structural overlaps) that are common between cluster members. Our approach first partitions the original dataset into several smaller datasets using a greedy clustering approach named APreClus based on dynamic seed clustering. APreClus is an online and instance incremental clustering algorithm delaying the final cluster assignment of an instance until one of the so-called pending clusters the instance belongs to has reached significant size and is converted to a fixed cluster. Once a cluster is fixed, APreClus recalculates the cluster centers, which are used as representatives for…
Calcification is not the Achilles' heel of cold-water corals in an acidifying ocean
2015
Ocean acidification is thought to be a major threat to coral reefs: laboratory evidence and CO2 seep research has shown adverse effects on many coral species, although a few are resilient. There are concerns that cold-water corals are even more vulnerable as they live in areas where aragonite saturation (?ara) is lower than in the tropics and is falling rapidly due to CO2 emissions. Here, we provide laboratory evidence that net (gross calcification minus dissolution) and gross calcification rates of three common cold-water corals, Caryophyllia smithii, Dendrophyllia cornigera, and Desmophyllum dianthus, are not affected by pCO2 levels expected for 2100 (pCO2 1058 ?atm, ?ara 1.29), and nor a…
The dual equivalence of equations and coequations for automata
2015
The transition structure α : X ? X A of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. We use this algebra-coalgebra duality as a common perspective for the study of equations and coequations. For every automaton ( X , α ) , we define two new automata: free ( X , α ) and cofree ( X , α ) representing, respectively, the greatest set of equations and the smallest set of coequations satisfied by ( X , α ) . Both constructions are shown to be functorial. Our main result is that the restrictions of free and cofree to, respectively, preformations of languages and to quotients A * / C of A * with respect to a congr…
Look at them and they will notice you : Distractor-independent attentional capture by direct gaze in change blindness
2018
Humans have shown a detection advantage of direct vs. averted gaze stimuli in visual search tasks. However, instead of attentional capture by direct gaze, the detection advantage in visual search may depend on attention-grabbing potential of the distractor stimuli to which the target needs to be compared. We investigated attentional capture by direct gaze using the change blindness paradigm, in which successful detection does not require comparison between the target and the distractor items. Participants detected a masked gaze direction change in one of four simultaneously presented schematic faces. The distractor gaze directions were systematically varied across three experiments. Changes…