International Professional University of Technology in Nagoya Repository
Not a member yet
15131 research outputs found
Sort by
La fin des frais d'itinérance dans l'Union européenne en 2017, est-ce la panacée ?
No full textDepuis le 15 juin 2017, les frais d'itinérance sont interdits sur l'Union européenne. L'itinérance sans frais est-elle totale? Les utilisateurs sont-ils nécessairement bénéficiaires grâce à cette mesure? Nous discutons ici les risques associés
Crosstalk analysis of printed circuits with many uncertain parameters using sparse polynomial chaos metamodels
No full textInternational audienc
Prédiction de défauts dans les arbres du parc végétal Grenoblois et préconisations pour les futures plantations
No full textNational audienceNous décrivons dans cet article notre réponse au défi EGC 2017. Une analyse exploratoire des données a tout d’abord permis de comprendre les distributions des différentes variables et de détecter de fortes corrélations. Nous avons défini deux variables supplémentaires à partir des variables du jeu de données. Plusieurs algorithmes de classification supervisée ont été expérimentés pour répondre à la tâche numéro 1 du défi. Les performances ont été évaluées par validation croisée. Cela nous a permis de sélectionner les meilleurs classifieurs uni-label et multi-label. Autant sur la tâche uni-label que multi-label, le meilleur classifieur dépasse les références d’environ 2%. Nous avons également exploré la tâche numéro 2 du défi. D’une part, des règles d’association ont été recherchées. D’autre part, le jeu de données a été enrichi avec des connaissances telles que des données climatiques (pluviométrie, température, vent) ou des données taxonomiques dans le domaine de la botanique (famille, ordre, super-ordre). En outre, des données géographiques et cartographiques sont exploitées dans un outil de visualisation d’une partie des données sur les arbres
Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols (extended version)
No full textInternational audienceThe TAMARIN prover is a state-of-the-art protocol verification tool. It supports verification of both trace and equivalence properties, a rich protocol specification language that includes support for global, mutable state and allows the user to specify cryptographic primitives as an arbitrary subterm convergent equational theory, in addition to several built-in theories, which include, among others, Diffie-Hellman exponentiation. In this paper, we improve the underlying theory and the tool to allow for more general user-specified equational theories: our extension supports arbitrary convergent equational theories that have the finite variant property, making TAMARIN the first tool to support at the same time this large set of user-defined equational theories, protocols with global mutable state, an unbounded number of sessions, and complex security properties. We demonstrate the effectiveness of this generalization by analyzing several protocols that rely on blind signatures, trapdoor commitment schemes, and ciphertext prefixes that were previously out of scope
Handling conflicts in uncertain ontologies using deductive argumentation
No full textInternational audienceOntologies can represent knowledge in a structured and formally well-understood way, which is crucial for information sharing. However, in practice, it is often difficult to have an error-free ontology. Conflicts can occur due to modeling errors or ontology merging and evolution. Moreover, uncertainty can happen because of modeling choices or the lack of confidence for a constructed ontology. Argumentation frameworks for knowledge bases reasoning and management have received extensive interests in the field of Artificial Intelligence in recent years. In this paper, we propose a unified framework to handle conflicts in uncertain ontologies with the use of deductive argumentation. Different from existing approaches, we introduce a stronger notion of conflict that covers both inconsistency and incoherence, where the latter is a special contradiction that can occur in an ontology. The unified approach spreads uncertainty degrees throughout argumentation trees and the enriched argument structure leads us to two novel inference relations. We then present a method to compute (counter)-arguments as well as argumentation trees in the context of uncertain ontologies based on the developments of three notions called minimal conflicting subontologies, maximal nonconflicting subontologies, and prudent justification
Webstrates for the Future Web?
No full textInternational audienceWebstrates presents an alternative take on the future of web use and development. In Webstrates, changes to the Document Object Model (DOM) of webpages (called webstrates) are persisted across reloads and synchronized to other clients of the same webstrate. This includes changes to embedded JavaScript and CSS. With Webstrates we demonstrate one possible direction for the future web that we hope can inspire and foster discussion at the ProWeb 2017 workshop. We will gladly demonstrate Webstrates at the workshop and illustrate best programming practices for it. Further, we would like to discuss open issues (e.g. programming language support, collaborative programming, fine-grained permis- sions, handling large datasets, and other advances in the future of web programming) from which we believe future versions of Webstrates and its community will greatly benefit
Plasma Lab Statistical Model Checker: Architecture, Usage and Extension
No full textInternational audiencePlasma Lab is a modular statistical model checking (SMC) platform that facilitates multiple SMC algorithms and multiple modelling and query languages. Plasma Lab may be used as a stand-alone tool with a graphical development environment or invoked from the command line for high performance scripting applications. This tutorial first presents an overview of Plasma Lab architecture, modelling languages and algorithms. Then we present the usage of the tool to design models and perform various experiments Finally we propose a tutorial on how to develop a new plugin for Plasma Lab
A method for increasing the rate of parametric convergence in the problem of identification of the sinusoidal signal parameters
No full textInternational audienc
A 3D Bayesian Computed Tomography Reconstruction Algorithm with Gauss-Markov-Potts Prior Model and its Application to Real Data
No full textInternational audienceIterative reconstruction methods in Computed Tomography (CT) are known to provide better image quality than analytical methods but they are not still applied in many fields because of their computational cost. In the last years, Graphical Processor Units (GPU) have emerged as powerful devices in order to parallelize calculations, but the efficiency of their use is conditionned on applying algorithms that can be massively parallelizable. Moreover, in non-destructive testing (NDT) applications, a segmentation of the reconstructed volume is often needed in order to have an accurate diagnosis on the material health, but performing a segmentation after the reconstruction introduces uncertainties in the diagnosis from both the reconstruction and the segmentation algorithms. In this paper, we propose an iterative reconstruction method for 3D CT that performs a joint reconstruction and segmentation of the controlled object in NDT for industrial applications. The method is based on a 3D Gauss-Markov-Potts prior model in Bayesian framework, which has shown its effective use in many image restoration and super-resolution problems. First, we briefly describe this model, before deriving the expression of the joint posterior distribution of all the unknowns. Next, an effective maximization of this distribution is presented. We use a ray-driven projector and a voxel-driven backprojector implemented on GPU. The algorithm is developed so it can be massively parallelized. * The authors are grateful to Lionel Gay and Nicolas Cochennec for having provided the real IQI phantom used to test the method. They would also like to thank Thomas Boulay for his contribution to the implementation of the projector and the backprojector on GPU. 2 C. Chapdelaine, A. Mohammad-Djafari, N. Gac, E. Parra / 3D Bayesian CT with Gauss-Markov-Potts prior model Finally, we present our results on simulated and real phantoms. In addition, we investigate further reconstruction quality indicators in order to compare our results with other methods
A simple-to-use BDI architecture for agent-based modeling and simulation
No full textWith the increase of computing power and the development of userfriendly multi-agent simulation frameworks, social simulations have become increasingly realistic. However, most agent architectures in these simulations use simple reactive models. Cognitive architectures face two main obstacles: their complexity for the field-expert modeler, and their computational cost. In this paper, we propose a new cognitive agent architecture based on the BDI (Belief-Desire-Intention) paradigm integrated into the GAMA modeling platform. Based on the GAML modeling language, this architecture was designed to be simpleto- use for modelers, flexible enough to manage complex behaviors, and with low computational cost. This architecture is illustrated with a simulation of the evolution of land use in the Mekong Delta