11 research outputs found
On the uniform boundedness of the solutions of systems of reaction-diffusion equations
We consider a system of reaction-diffusion equations for which the uniform boundedness of the solutions can not be derived by existing methods. The system may represent, in particular, an epidemic model describing the spread of an infection disease within a population. We present an argument allowing to establish the global existence and the uniform boundedness of the solutions of the considered system
SHREC2020 track:Multi-domain protein shape retrieval challenge
Proteins are natural modular objects usually composed of several domains, each domain bearing a specific function that is mediated through its surface, which is accessible to vicinal molecules. This draws attention to an understudied characteristic of protein structures: surface, that is mostly unexploited by protein structure comparison methods. In the present work, we evaluated the performance of six shape comparison methods, among which three are based on machine learning, to distinguish between 588 multi-domain proteins and to recreate the evolutionary relationships at the proteinand species levels of the SCOPe database.
The six groups that participated in the challenge submitted a total of 15 sets of results. We observed that the performance of all the methods significantly decreases at the species level, suggesting that shape-only protein comparison is challenging for closely related proteins. Even if the dataset is limited in size (only 588 proteins are considered whereas more than 160,000 protein structures are experimentally solved), we think that this work provides useful insights into the current shape comparison methods performance, and highlights possible limitations to large-scale applications due to the computational cost
Performance evaluation of a distributed clustering approach for spatial datasets
The analysis of big data requires powerful, scalable, and accurate data analytics techniques that the traditional data mining and
machine learning do not have as a whole. Therefore, new data analytics frameworks are needed to deal with the big data challenges such as
volumes, velocity, veracity, variety of the data. Distributed data mining
constitutes a promising approach for big data sets, as they are usually
produced in distributed locations, and processing them on their local
sites will reduce significantly the response times, communications, etc. In
this paper, we propose to study the performance of a distributed clustering, called Dynamic Distributed Clustering (DDC). DDC has the ability
to remotely generate clusters and then aggregate them using an efficient
aggregation algorithm. The technique is developed for spatial datasets.
We evaluated the DDC using two types of communications (synchronous
and asynchronous), and tested using various load distributions. The experimental results show that the approach has super-linear speed-up,
scales up very well, and can take advantage of the recent programming
models, such as MapReduce model, as its results are not affected by the
types of communication
Reseaux systoliques pour le calcul des composantes connexes et la triangularisation des matrices bandes
SIGLECNRS-CDST / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc