International Professional University of Technology in Nagoya Repository
Not a member yet
15131 research outputs found
Sort by
Antibacterial glass-ionomer cement restorative materials: A critical review on the current status of extended release formulations
No full textInternational audienc
Neighborhood-Based Label Propagation in Large Protein Graphs
No full textInternational audienceUnderstanding protein function is one of the keys to understanding life at the molecular level. It is also important in several scenarios including human disease and drug discovery. In this age of rapid and affordable biological sequencing, the number of sequences accumulating in databases is rising with an increasing rate. This presents many challenges for biologists and computer scientists alike. In order to make sense of this huge quantity of data, these sequences should be annotated with functional properties. UniProtKB consists of two components: i) the UniProtKB/Swiss-Prot database containing protein sequences with reliable information manually reviewed by expert bio-curators and ii) the UniProtKB/TrEMBL database that is used for storing and processing the unknown sequences. Hence, for all proteins we have available the sequence along with few more information such as the taxon and some structural domains. Pairwise similarity can be defined and computed on proteins based on such attributes. Other important attributes, while present for proteins in Swiss-Prot, are often missing for proteins in TrEMBL, such as their function and cellular localization. The enormous number of protein sequences now in TrEMBL calls for rapid procedures to annotate them automatically. In this work, we present DistNBLP, a novel Distributed Neighborhood-Based Label Propagation approach for large-scale annotation of proteins. To do this, the functional annotations of reviewed proteins are used to predict those of non-reviewed proteins using label propagation on a graph representation of the protein database. DistNBLP is built on top of the "akka" toolkit for building resilient distributed message-driven applications
Efficient Privacy-Preserving Adversarial Learning in Decentralized Online Social Networks
No full textInternational audienceIn the last decade we have witnessed a more than prolific growth of online social media content in sites designed for online social interactions. These systems have been traditionally designed as centralized silos, which unfortunately suffer from abusive behavior ranging from spam, cyberbullying to even censorship. This paper investigates the utility of supervised learning techniques for abuse detection in future decentralized settings, where less metadata remains available for use in learning algorithms. We present a method that uses a privacy-preserving protocol to exchange a fingerprint of the neighborhood of a pair of nodes, namely sender and receiver. Our method extracts social graph metadata to form a subset of key features, namely neighborhood knowledge, some of which we approximate to reduce communication and computational requirements of such a protocol. In our benchmarking we show that such a data minimization approach can obtain features 13% faster while providing similar or, as with the SVM classifier, even better abuse detection rates with just approximated Private Set Intersection
Interfaces cerveau-ordinateur pour la reeducation post-AVC : apport d'un environnement de stimulation affordant.
No full textCe rapport fait état de mon travail réalisé au cours de mon projet recherche au sein de l’équipe Neurosys au Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), à Nancy. Les accidents vasculaires cérébraux (AVC) constituent un problème social grandissant. Dans ce contexte, aux vues des méthodes de rééducation actuelles ainsi que des avancées technologiques, de nouvelles méthodes pour aider les personnes qui ont subi un AVC sont possibles. Grasp'it est un protocole de rééducation des personnes qui ont été victimes d'AVC par EEG (électroencéphalogrammes) et se sert notamment d'une interface virtuelle 3D sous Unreal Engine pour le feedback. Dans ce document est détaillée l'évolution de l'interface utilisée par Grasp'it, les fonctionnalités rajoutées, le changement de l'indice visuel et les réflexions pour les évolutions futurs avec l'aide des Serious Games, afin de concevoir le protocole le plus performant et le plus agréable possible
La triangulation de Delaunay d'un échantillon aléatoire d'un bon échantillon a une taille linéaire
No full textA good sample is a point set such that any ball of radius contains a constant number of points. The Delaunay triangulation of a good sample is proved to have linear size, unfortunately this is not enough to ensure a good time complexity of the randomized incremental construction of the Delaunay triangulation. In this paper we prove that a random Bernoulli sample of a good sample has a triangulation of linear size. This result allows to prove that the randomized incremental construction needs an expected linear size and an expected time.Un bon échantillon est un ensemble de points tel que toute boule de rayon contienne un nombre constant de points.Il est démontré que la triangulation de Delaunay d'un bon échantillon a une taille linéaire, malheureusement cela ne suffit pas à assurerune bonne complexité à la construction incrémentale randomisée de latriangulation de Delaunay.Dans ce rapport, nous démontrons que la triangulation d'un échantillon aléatoire de Bernoullid'un bon échantillon a une taille linéaire. Nous en déduisonsque la construction incrémentale randomisée peut être faite en temps et espace
Data Collection in Population Protocols with Non-uniformly Random Scheduler
No full textContrary to many previous studies on population protocols using the uniformly random scheduler, we consider a more general non-uniform case. Here, pair-wise interactions between agents (moving and communicating devices) are assumed to be drawn non-uniformly at random. While such a scheduler is known to be relevant for modeling many practical networks, it is also known to make the formal analysis more difficult. This study concerns data collection, a fundamental problem in mobile sensor networks (one of the target networks of population protocols). In this problem, pieces of information given to the agents (e.g., sensed values) should be delivered eventually to a predefined sink node without loss or duplication. Following an idea of the known deterministic protocol TTF solving this problem, we propose an adapted version of it and perform a complete formal analysis of execution times in expectation and with high probability (w.h.p.). We further investigate the non-uniform model and address the important issue of energy consumption. The goal is to improve TTF in terms of energy complexity, while still keeping good time complexities (in expectation and w.h.p.). Namely, we propose a new parametrized protocol for data collection, called lazy TTF, and present a study showing that a good choice of the protocol parameters can improve energy performances (compared to TTF), at a slight expense of time performance
Statistical Information Propagation Across Operators for Dynamic Power Estimation on FPGAs
No full textInternational audiencePerformance, cost and energy consumption are the main key features to evaluate any embedded system. Low power system is needed then power optimization process is required. To optimize the power dissipation of an embedded system we have to estimate the power consumption first. This paper presents a new power estimation approach at early design phases which is based on the decomposition of a digital system into basic operators. Each operator has its own model which estimates the switching activity and the power consumption. By interconnecting several operators, statistical information like switching activities and percentage of logic high is then propagated to enable a global power estimation of a given system. The approach consists in simply adding the individual power consumption of each operator. The methodology has been evaluated in a use-case. The preliminary results indicate a promising speedup of the design process with less than 8.0% of error comparing to the classical power estimation tools
Simplexité et modèles opérationnels
No full textInternational audienceLa simplexité est considérée comme la capacité du vivant à ressaisir sa propre complexité et celle de l’environnement dont il fait partie afin d’agir, de vivre. Aujourd’hui des domaines très différents viennent puiser leur inspiration dans les sciences du vivant, de la cognition et dans les neurosciences pour une refondation nécessaire afin d’inventer des nouvelles formes d’organisation individuelle et collective, respectueuses des temps nécessaires pour comprendre, pour instaurer des relations durables et fiables. La simplexité appelle la bienveillance, pour écouter et pour parler en confiance. Pour faire de la subjectivité et des emotions une source de valeur. Il s’agit d’une alternative aux approches mécanistes et segmentées. Donner un socle expérimental au concept de simplexité permet d’identifier ce qui, alliant sobriété et imagination dans le quotidien de l’exercice de différents métiers, est déjà simplexe ou pourrait le devenir. La conviction commune des auteurs de ce volume se manifeste dans l’importance accordée à l’acte qui concrétise la capacité et la responsabilité humaine de créer, de transformer. C’est aussi la précision sur laquelle repose toute charpente, toute architecture, que celle-ci soit matérielle ou immatérielle.Cet ouvrage interdisciplinaire réunit des contributions qui explorent le sens qu’il est possible de donner à la simplexité. Il en ressort à la fois le potentiel de ce concept et sa fragilité, à l’image des organismes vivants eux-mêmes qui, fragiles sont également robustes
Systèmes de Crypto-Compression basés Chaos en Temps Réel et Portablespour Architectures embarquées Efficaces
No full textImage and video protection have gained a lot of momentum over thelast decades. In this work, first we designed and realized in anefficient and secure way a pseudo-chaotic number generator(PCNG) implemented in sequential and parallel (with P-threads)versions. Based on these PCNGs, two central applications weredesigned, implemented and analyzed. The former application dealswith the realization of a random number generator (RNG) basedPCNG, and the obtained results are very promising. The latterapplication concerns the realization of a chaos-based stream cipher.The cryptographic analysis and the statistical study of the realizedchaotic systems show their robustness against known attacks. Thisresult is due to the proposed recursive architecture which has astrong non-linearity a technique of disturbance, and a chaoticmultiplexing. The computation performance indicate their use in realtime applications. Second, based on the previous chaotic system,we designed and implemented in effective manner a real time jointcrypto-compression system for embedded architecture. Anend-to-end selective encryption solution that protects privacy in theHEVC video content is realized. Then, a ROI encryption isperformed at the CABAC bin string level for the most sensitiveHEVC parameters including motion vectors and transformcoefficients. The format compliant encryption of Intra PredictionModes has been also investigated. It increases a little bit the bitrate. Subjective evaluation and objective rate-distortion-complexitytests showed that the proposed solution performs a protection ofprivacy in the HEVC video content with a small overhead in bit rateand coding complexity.La protection des images et vidéos est une problématique cruciale.Dans ce travail nous avons d’abord, conçu et réalisé d’une façonefficace et sécurisée un générateur de nombre pseudo-chaotique(PCNG) mis en oeuvre en séquentielle et en parallèle par P-threads.Basé sur ces PCNGs, deux applications centrales ont été conçues,mises en oeuvre et analysées. La première traite la réalisation d’ungénérateur de nombre aléatoire et les résultats obtenus sont trèsprometteurs. La deuxième concerne la réalisation d’un système dechiffrement/déchiffrement par flux. L’analyse cryptographique dessystèmes chaotiques réalisés montrent leur robustesse contre desattaques connues. Ce résultat est dû à la structure récursiveproposée qui intègre une forte non-linéarité, une technique deperturbation et un multiplexage chaotique. La performance obtenueen complexité de calcul indique leurs utilisations dans desapplications temps réel. Ensuite, basé sur le système chaotiqueprécédent, nous avons conçu et mis en oeuvre efficacement unsystème de crypto-compression pour des applications temps réel etportable pour architectures embarquées. Une solution dechiffrement par flux sélectif des contenus vidéo HEVC est réalisée.Puis, un chiffrement d’une région d’intérêt est effectué au niveauCABAC pour les paramètres les plus sensibles incluant desvecteurs de mouvement et des coefficients transformés. Le formatle chiffrage conforme de Modes de Prédiction Intra a été aussivérifié. L’évaluation subjective et des tests de complexité d’altérationde taux objectifs ont montré que la solution proposée sécurise lecontenu vidéo avec un débit binaire et une complexité de codagelégèrement augmentés
MapMosaic: Dynamic Layer Compositing for Interactive Geovisualization
No full textInternational audienceGIS software applications and other mapping tools enable users to correlate data from multiple layers and gain insight from the resulting visualizations. However, most of these applications only feature basic, monolithic layer compositing techniques. These techniques do not always support users effectively in their tasks, as we observed during interviews with GIS experts. We introduce MapMosaic, a novel approach based on dynamic visual compositing that enables users to interactively create and manipulate local composites of multiple vector and raster map layers, taking into account the semantics and attribute values of objects and fields in the composit-ing process. We evaluate MapMosaic's interaction model against that of QGIS (a widely-used desktop GIS) and MAPublisher (a professional cartography tool) using the " Cognitive Dimensions " framework and through an analytical comparison, showing that MapMosaic's model is more flexible and can support users more effectively in their tasks. We also report on feedback obtained from experts, which further confirms the potential of this highly dynamic approach to map layer compositing