Author: "INRIA Rocquencourt" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"INRIA Rocquencourt"' showing total 1,367 results

Start Over Author "INRIA Rocquencourt"

1,367 results on '"INRIA Rocquencourt"'

1. A data and operation model for advanced database systems

Author: INRIA-Rocquencourt, Danforth, Scott, Simon, Eric, Siekmann, Jörg, editor, Goos, G., editor, Hartmanis, J., editor, Papazoglou, Michael P., editor, and Zeleznikow, John, editor
Published: 1992
Full Text: View/download PDF

2. Imaginary Bicyclic Biquadratic Function Fields in Characteristic Two

Author: Aubry, Yves and Le Brigand, Dominique
Published: 1999
Full Text: View/download PDF

3. Domain Decomposition and Skeleton Programming with OCamlP3l

Author: Clément, F., Martin, V., INRIA-Rocquencourt}, Vodicka, A., Di Cosmo, R., and Weis, P.
Subjects: ddc:004
Published: 2006

4. A stochastic conflict detection model revisited

Author: Inria Rocquencourt, Karine Blin, Karim Zeghal, Frédéric Bonnans, Claude Martini, Eric Hoffmanf, and Marianne Akian
Subjects: Set (abstract data type), Acceleration, Probabilistic method, Dimension (vector space), Position (vector), Computer science, Statistical model, Position error, Air traffic control, Algorithm, Simulation
Abstract: This paper addresses the theoretical issue of the uncertainty modelling to enhance conflict estimation for air traffic control. One of the important aspect is to identify and evaluate the impact on the positioning error of its different components: position, velocity, and acceleration error. To set up such a model, the major difficulty identified is to make explicit the dynamic of aircraft position that includes uncertainties. A possible enhancement of the classical probabilistic model of error by introducing a dynamic dimension to the position error model is proposed. This new position error model is generic and can thus be used for different probabilistic methods. Moreover, as shown in the paper, this new model can be tuned to reproduce the results used in reference and validated on real traffic.
Published: 2000

5. Advances in Feature Selection with Mutual Information

Author: UCL - FSA/ELEC - Département d'électricité, INRIA - Rocquencourt, UCL - FSA/INMA - Département d'ingénierie mathématique, Verleysen, Michel, Rossi, Fabrice, François, Damien, UCL - FSA/ELEC - Département d'électricité, INRIA - Rocquencourt, UCL - FSA/INMA - Département d'ingénierie mathématique, Verleysen, Michel, Rossi, Fabrice, and François, Damien
Abstract: The selection of features that are relevant for a prediction or classification problem is an important problem in many domains involving high-dimensional data. Selecting features helps fighting the curse of dimensionality, improving the performances of prediction or classification methods, and interpreting the application. In a nonlinear context, themutual information is widely used as relevance criterion for features and sets of features. Nevertheless, it suffers from at least three major limitations: mutual information estimators depend on smoothing parameters, there is no theoretically justified stopping criterion in the feature selection greedy procedure, and the estimation itself suffers from the curse of dimensionality. This chapter shows how to deal with these problems. The two first ones are addressed by using resampling techniques that provide a statistical basis to select the estimator parameters and to stop the search procedure. The third one is addressed by modifying the mutual information criterion into a measure of how features are complementary (and not only informative) for the problem at hand.
Published: 2009

6. Estimation de redondance pour le clustering de variables spectrales

Author: UCL - FSA/INMA - Département d'ingénierie mathématique, UCL - FSA/ELEC - Département d'électricité, INRIA-Rocquencourt - Projet AxIS, François, Damien, Krier, Catherine, Rossi, Fabrice, Verleysen, Michel, UCL - FSA/INMA - Département d'ingénierie mathématique, UCL - FSA/ELEC - Département d'électricité, INRIA-Rocquencourt - Projet AxIS, François, Damien, Krier, Catherine, Rossi, Fabrice, and Verleysen, Michel
Abstract: La réduction du nombre de variables spectrales dans un problème de modélisation permet souvent de construire un modèle plus simple, plus performant, et apporte en sus une information sur les ‘fréquences utiles’ à la prédiction, auxquelles on peut trouver une interprétation. Ce papier propose une approche pour la sélection de bandes de fréquences (variables spectrales consécutives) à l’aide d’un clustering hiérarchique qui prend en compte la variable à prédire pour effectuer le regroupement des variables. La méthode est basée sur l’estimateur par plus proche voisins de l’information mutuelle. La méthode est illustrée sur deux jeux de données réels.
Published: 2008

7. Estimation de redondance conditionnelle par information mutuelle, application au clustering de variables spectrales

Author: UCL - FSA/INMA - Département d'ingénierie mathématique, UCL - FSA/ELEC - Département d'électricité, INRIA-Rocquencourt - Projet AxIS, François, Damien, Krier, Catherine, Rossi, Fabrice, Verleysen, Michel, UCL - FSA/INMA - Département d'ingénierie mathématique, UCL - FSA/ELEC - Département d'électricité, INRIA-Rocquencourt - Projet AxIS, François, Damien, Krier, Catherine, Rossi, Fabrice, and Verleysen, Michel
Abstract: La réduction du nombre de variables spectrales dans un problème de modélisation permet souvent de construire un modèle plus simple, plus performant, et apporte en sus une information sur les ‘fréquences utiles’ à la prédiction, auxquelles on peut trouver une interprétation. Ce papier propose une approche pour la sélection de bandes de fréquences (variables spectrales consécutives) à l’aide d’un clustering hiérarchique qui prend en compte la variable à prédire pour effectuer le regroupement des variables. La méthode est basée sur l’estimateur par plus proche voisins de l’information mutuelle. Des expériences sur deux jeux de données montrent l’intérêt de la méthode, à la fois par rapport à la PLS construite sur toutes les variables et par rapport à un clustering des variables qui ne tiendraient pas compte de la variable à prédire.
Published: 2007

8. Feature clustering and mutual information for the selection of variables in spectral data

Author: UCL - FSA/ELEC - Département d'électricité, UCL - FSA/INMA - Département d'ingénierie mathématique, INRIA-Rocquencourt - Projet AxIS, Krier, Catherine, François, Damien, Rossi, Fabrice, Verleysen, Michel, UCL - FSA/ELEC - Département d'électricité, UCL - FSA/INMA - Département d'ingénierie mathématique, INRIA-Rocquencourt - Projet AxIS, Krier, Catherine, François, Damien, Rossi, Fabrice, and Verleysen, Michel
Abstract: Spectral data often have a large number of highly-correlated features, making feature selection both necessary and uneasy. A methodology combining hierarchical constrained clustering of spectral variables and selection of clusters by mutual information is proposed. The clustering allows reducing the number of features to be selected by grouping similar and consecutive spectral variables together, allowing an easy interpretation. The approach is applied to two datasets related to spectroscopy data from the food industry.
Published: 2007

9. Experiments with OLSR Routing in a MANET

Author: CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE AT INRIA ROCQUENCOURT (FRANCE), Adjih, Cedric, Minet, Pascale, Plesse, Thierry, Laouiti, Anis, Plakoo, Adokoe, Badel, Marc, Muehlethaler, Paul, Jacquet, Philippe, Lecomte, Jerome, CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE AT INRIA ROCQUENCOURT (FRANCE), Adjih, Cedric, Minet, Pascale, Plesse, Thierry, Laouiti, Anis, Plakoo, Adokoe, Badel, Marc, Muehlethaler, Paul, Jacquet, Philippe, and Lecomte, Jerome
Abstract: Wireless ad-hoc networks (MANETs) are autonomous, self-configuring and adaptive networks. Their ability to adapt themselves to dynamic, random and rapidly changing multihop topologies is given by a multihop routing protocol. In this paper, we describe experiments made with a real MANET consisting of 18 nodes implementing the OLSR routing protocol operating over radio with IEEE 802.11 hardware. More precisely, we report measurements that were made in the areas of (i) the speed of deployment, (ii) the adaptability to topology changes, (iii) the mobility support, and (iv) the dependability. Measures show that a MANET equipped with OLSR routing meets most requirements of future applications such as rescue applications or military tactical applications in urban context., Presented at the Symposium on Military Communications organised by the Information Systems Technology Panel (IST) in Rome, Italy on 18-19 Apr 2005 and published in proceedings of the same, Paper 23, Dec 2006. Prepared in cooperation with the Centre D'Electronique de L'Armement, Bruz, France. See also ADM202750, RTO-MP-IST-054, Military Communications (Les communications militaires) The original document contains color images.
Published: 2006

10. Sélection de groupes de variables spectrales par information mutuelle grâce à une représentation spline

Author: INRIA-Rocquencourt - Projet AxIS, UCL - FSA/ELEC - Département d'électricité, UCL - FSA/INMA - Département d'ingénierie mathématique, Rossi, Fabrice, François, Damien, Wertz, Vincent, Verleysen, Michel, INRIA-Rocquencourt - Projet AxIS, UCL - FSA/ELEC - Département d'électricité, UCL - FSA/INMA - Département d'ingénierie mathématique, Rossi, Fabrice, François, Damien, Wertz, Vincent, and Verleysen, Michel
Published: 2005

11. Heavy Traffic Analysis of AIMD Models

Author: CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE AT INRIA ROCQUENCOURT (FRANCE), Altman, Eitan, Kushner, Harold J., CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE AT INRIA ROCQUENCOURT (FRANCE), Altman, Eitan, and Kushner, Harold J.
Abstract: We study heavy traffic asymptotics of many Additive Increase Multiplicative Decrease (AIMD) connections sharing a common router in the presence of other uncontrolled traffic, called "mice". The system is scaled by speed and average number of sources. With appropriate scalings of the packet rate and buffer content, an approximating delayed diffusion model is derived. By heavy traffic we mean that there is relatively little spare capacity in the operating regime. In contrast to previous scaled models, the randomness due to the mice or number of connections is not averaged, and plays its natural and dominant role. The asymptotic heavy traffic model allows us to analyze buffer and loss management policies of early marking or discarding as a function of the queue size and/or the total input rate and to choose a nearly optimal function via use of an appropriate limiting optimal control problem, captures the essential features of the physical problem, and can guide us to good operating policies. After studying the asymptotics of a large number of persistent AIMD connections we also handle the asymptotic of finite AIMD connections whose number varies as connections arrive and leave. The data illustrate some of the advantages of the approach.
Published: 2004

12. Unidirectional Blocks and Ectopic FOCI Induced by Coupling an Ishemic and a Normal Ventricular Cell

Author: CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE AT INRIA ROCQUENCOURT (FRANCE), Landau, M., Bardou, A., CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE AT INRIA ROCQUENCOURT (FRANCE), Landau, M., and Bardou, A.
Abstract: This study deals with the behavioral zones of a system composed of a normal myocardial cell (NC) coupled by an electric resistance R to an ischemic, depolarized by an added steady current I, (DC) cell. When varying I, we evidenced 3 levels of stationary solutions corresponding to low (L), medium (M) and high (H) values of the resting potential. In the L zone, we evidenced unidirectional block (LJB) effects with respectively 2 (R=20) or 1 (R=50) thresholds of depolarization, From 2 Hopf bifurcation points, emerge branches of periodic solutions corresponding to ectopic foci (EF) coexisting with L or M types of resting potential. In these zones, we found again UB effects with, in case of propagation, a locking of the system to a rhythmic activity. This theoretical study represents a unified approach of some types of UB and EF related to ischemia., Papers from 23rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society, October 25-28, 2001, held in Istanbul, Turkey. See also ADM001351 for entire conference on cd-rom.
Published: 2001

13. CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems

Author: ARLES (INRIA Rocquencourt) ; INRIA, Computer Science Department [Dortmund] ; Technische Universitaet Dortmund, Uppsala University ; Uppsala University, Computing Department [Lancaster] ; Lancaster University, Computing Science Laboratory - Oxford University ; University of Oxford, University of L'Aquila [Italy] (UNIVAQ) ; University of L'Aquila, Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Issarny, Valérie, Steffen, Bernhard, Jonsson, Bengt, Blair, Gordon, Grace, Paul, Kwiatkowska, Marta, Calinescu, Radu, Inverardi, Paola, Tivoli, Massimo, Bertolino, Antonia, Sabetta, Antonino, ARLES (INRIA Rocquencourt) ; INRIA, Computer Science Department [Dortmund] ; Technische Universitaet Dortmund, Uppsala University ; Uppsala University, Computing Department [Lancaster] ; Lancaster University, Computing Science Laboratory - Oxford University ; University of Oxford, University of L'Aquila [Italy] (UNIVAQ) ; University of L'Aquila, Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Issarny, Valérie, Steffen, Bernhard, Jonsson, Bengt, Blair, Gordon, Grace, Paul, Kwiatkowska, Marta, Calinescu, Radu, Inverardi, Paola, Tivoli, Massimo, Bertolino, Antonia, and Sabetta, Antonino
Abstract: International audience, The CONNECT European project that started in February 2009 aims at dropping the interoperability barrier faced by today's distributed systems. It does so by adopting a revolutionary approach to the seamless networking of digital systems, that is, synthesizing on the fly the connectors via which networked systems communicate. CONNECT investigates formal foundations for connectors together with associated automated support for learning, reasoning about and adapting the interaction behavior of networked systems.

14. On-the-fly Interoperability through Automated Mediator Synthesis and Monitoring?

Author: Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, Dipartimento di Informatica [Italy] (DI) ; Università degli Studi dell'Aquila, ARLES (INRIA Rocquencourt) ; INRIA, CONNECT, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Bertolino, Antonia, Inverardi, Paola, Issarny, Valérie, Sabetta, Antonino, Spalazzese, Romina, Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, Dipartimento di Informatica [Italy] (DI) ; Università degli Studi dell'Aquila, ARLES (INRIA Rocquencourt) ; INRIA, CONNECT, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Bertolino, Antonia, Inverardi, Paola, Issarny, Valérie, Sabetta, Antonino, and Spalazzese, Romina
Abstract: International audience, Interoperability is a key and challenging requirement in today's and future systems, which are often characterized by an extreme level of heterogeneity. To build an interoperability solution between the networked systems populating the environment, both their functional and non-functional requirements have to be met. Because of the continuous evolution of such systems, mechanisms that are fixed a-priori are inadequate to achieve interoperability. In such challenging settings, on-the-fly approaches are best suited. This paper presents, as an interoperability solution, an approach that integrates an automated technique for the synthesis of mediator protocols with a monitoring mechanism. The former aims to provide interoperability taking care of functional characteristics of the networked systems, whereas the latter makes it possible to assess the non-functional characteristics of the connected system.

15. Experiment scenarios, prototypes and report - Iteration 2

Author: AMBIENTIC ; Ambientic, ARLES (INRIA Rocquencourt) ; INRIA, Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, Computing Department [Lancaster] ; Lancaster University, Thales Research and Technology [Palaiseau] ; THALES, Computing Laboratory (OUCL) ; University of Oxford, Uppsala University ; Uppsala University, Dipartimento di Informatica [Italy] (DI) ; Università degli Studi dell'Aquila, Connect, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Andriescu, Emil, Bennaceur, Amel, Bertolino, Antonia, Grace, Paul, Huynh, Trân, Kwiatkowska, Marta, Jonsson, Bengt, Léger, Antoine, Pathak, Animesh, Raverdy, Pierre-Guillaume, Saadi, Rachid, Speicys-Cardoso, Roberto, Sykes, Daniel, Tivoli, Massimo, AMBIENTIC ; Ambientic, ARLES (INRIA Rocquencourt) ; INRIA, Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, Computing Department [Lancaster] ; Lancaster University, Thales Research and Technology [Palaiseau] ; THALES, Computing Laboratory (OUCL) ; University of Oxford, Uppsala University ; Uppsala University, Dipartimento di Informatica [Italy] (DI) ; Università degli Studi dell'Aquila, Connect, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Andriescu, Emil, Bennaceur, Amel, Bertolino, Antonia, Grace, Paul, Huynh, Trân, Kwiatkowska, Marta, Jonsson, Bengt, Léger, Antoine, Pathak, Animesh, Raverdy, Pierre-Guillaume, Saadi, Rachid, Speicys-Cardoso, Roberto, Sykes, Daniel, and Tivoli, Massimo
Abstract: The task of WP6 is to evaluate the CONNECT technologies under realistic situations. To achieve this goal, WP6 concentrated its 3rd year effort on the development of a main scenario in the context of GMES, which requires the connection of highly heterogeneous and independently built systems provided by the industry partners. The resulting scenario allows the consortium to assess the validity of CONNECT claims and to investigate the exploitation of CONNECT technologies in the context of the integration of real systems. Another objective of this report is to provide a first assessment of CONNECT solutions against the project's objectives stated in the DoW. The proposed assessment spans: (i) the project's overall objective of enabling on-the-fly interoperability among heterogeneous networked systems as well as (ii) the project's specific objectives related to the foundations and associated enablers to be elaborated for learning and reasoning about the interaction behaviours of networked systems and for synthesizing mediators so as to make systems interoperate.

16. Revised CONNECT Architecture

Author: AMBIENTIC ; Ambientic, ARLES (INRIA Rocquencourt) ; INRIA, Computing Department [Lancaster] ; Lancaster University, Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, School of Electronics Engineering and Computer Science [Beijing] (EECS) ; Peking University, University of Dortmund ; Universität Dortmund, Connect, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Andriescu, Emil, Bennaceur, Amel, S. Blair, Gordon, Calabro, Antonello, Speicys Cardoso, Roberto, Cavallaro, Luca, Georgantas, Nikolaos, Grace, Paul, Issarny, Valerie, Ma, Yun, Merten, Maik, Nostro, Nicola, Nundloll, Vatsala, Guillaume Raverdy, Pierre, Saadi, Rachid, Sykes, Daniel, AMBIENTIC ; Ambientic, ARLES (INRIA Rocquencourt) ; INRIA, Computing Department [Lancaster] ; Lancaster University, Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, School of Electronics Engineering and Computer Science [Beijing] (EECS) ; Peking University, University of Dortmund ; Universität Dortmund, Connect, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Andriescu, Emil, Bennaceur, Amel, S. Blair, Gordon, Calabro, Antonello, Speicys Cardoso, Roberto, Cavallaro, Luca, Georgantas, Nikolaos, Grace, Paul, Issarny, Valerie, Ma, Yun, Merten, Maik, Nostro, Nicola, Nundloll, Vatsala, Guillaume Raverdy, Pierre, Saadi, Rachid, and Sykes, Daniel
Abstract: Interoperability remains a fundamental challenge when connecting heterogeneous systems which encounter and spontaneously communicate with one another in pervasive computing environments. This challenge is exasperated by the highly heterogeneous technologies employed by each of the interacting parties, i.e., in terms of hardware, operating system, middleware protocols, and application protocols. The key aim of the CONNECT project is to drop this heterogeneity barrier and achieve universal interoperability. Here we report on the revised CONNECT architecture, highlighting the integration of the work carried out to integrate the CONNECT enablers developed by the different partners; in particular, we present the progress of this work towards a finalised concrete architecture. In the third year this architecture has been enhanced to: i) produce concrete CONNECTors, ii) match networked systems based upon their goals and intent, and iii) use learning technologies to find the affordance of a system. We also report on the application of the CONNECT approach to streaming based systems, further considering exploitation of CONNECT in the mobile environment.

17. Dynamic connector synthesis: revised prototype implementation

Author: ARLES (INRIA Rocquencourt) ; INRIA, Dipartimento di Informatica [Italy] (DI) ; Università degli Studi dell'Aquila, Connect, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Bennaceur, Amel, Cavallaro, Luca, Inverardi, Paola, Issarny, Valerie, Spalazzese, Romina, Sykes, Daniel, Tivoli, Massimo, ARLES (INRIA Rocquencourt) ; INRIA, Dipartimento di Informatica [Italy] (DI) ; Università degli Studi dell'Aquila, Connect, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Bennaceur, Amel, Cavallaro, Luca, Inverardi, Paola, Issarny, Valerie, Spalazzese, Romina, Sykes, Daniel, and Tivoli, Massimo
Abstract: The CONNECT Integrated Project aims at enabling continuous composition of Networked Systems (NSs) to respond to the evolution of functionalities provided to and required from the networked environment. CONNECT aims at dropping the interoperability barrier by adopting a revolutionary approach to the seamless networking of digital systems, that is, synthesizing on-the-fly the connectors via which networked systems communicate. The resulting emergent connectors are effectively synthesized according to the behavioral semantics of application- down to middleware-layer protocols run by the interacting parties.

18. Consolidated dependability framework

Author: Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, Istituto di Informatica e Telematica (IIT-CNR) ; Consiglio Nazionale delle Ricerche, Dipartimento di Informatica [Italy] (DI) ; Università degli Studi dell'Aquila, ARLES (INRIA Rocquencourt) ; INRIA, Computing Laboratory (OUCL) ; University of Oxford, Dipartimento di Matematica [Roma TRE] ; Università degli Studi Roma TRE, Connect, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Bertolino, Antonia, Calabro, Antonello, Chiaradonna, Silvano, Costa, Gabriele, Di Giandomenico, Felicita, Di Marco, Antinisca, Fusani, Mario, Issarny, Valerie, Itria, Massimiliano, Lonetti, Francesca, Kwiatkowska, Marta, Marchetti, Eda, Martinelli, Fabio, Masci, Paolo, Matteucci, Ilaria, Morisset, Charles, Nostro, Nicola, Qu, Hongyang, Saadi, Rachid, Vaccarelli, Anna, Wiegand, Luca, Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo" (ISTI) ; CNR, Istituto di Informatica e Telematica (IIT-CNR) ; Consiglio Nazionale delle Ricerche, Dipartimento di Informatica [Italy] (DI) ; Università degli Studi dell'Aquila, ARLES (INRIA Rocquencourt) ; INRIA, Computing Laboratory (OUCL) ; University of Oxford, Dipartimento di Matematica [Roma TRE] ; Università degli Studi Roma TRE, Connect, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Bertolino, Antonia, Calabro, Antonello, Chiaradonna, Silvano, Costa, Gabriele, Di Giandomenico, Felicita, Di Marco, Antinisca, Fusani, Mario, Issarny, Valerie, Itria, Massimiliano, Lonetti, Francesca, Kwiatkowska, Marta, Marchetti, Eda, Martinelli, Fabio, Masci, Paolo, Matteucci, Ilaria, Morisset, Charles, Nostro, Nicola, Qu, Hongyang, Saadi, Rachid, Vaccarelli, Anna, and Wiegand, Luca
Abstract: The aim of CONNECT is to achieve universal interoperability between heterogeneous Networked Systems. For this, the non-functional properties required at each side of the connection going to be established, which we refer to by the one inclusive term "CONNECTability", must be fulfilled. In Deliverable D5.1 we conceived the conceptual models at the foundation of CONNECTability. In D5.2 we then presented a first version of the approaches and of their respective enablers that we developed for assuring CONNECTability both at synthesis time and at run-time. In this deliverables, we present the advancements and contributions achieved in the third year, which include: - a refinement of the CONNECT Property Meta-Model, with a preliminary implementation of a Model-to-Code translator; - an enhanced implementation of the Dependability&Performance analysis Enabler, supporting stochastic verification and state-based analysis, that is enriched with mechanisms for providing feedback to the Synthesis enabler based on monitor's run-time observations; - a fully running version of the Security Enabler, following the Security-by-Contract-with-Trust methodology, for the monitoring and enforcement of CONNECT related security policies; - a complete (XML) definition of the Trust Model Description Language, an editor and the corresponding implementation of supporting tools to be integrated into the Trust Management Enabler.

19. Model-driven engineering of middleware-based ubiquitous services

Author: SeaGroup ; University of L'Aquila, Dipartimento di Elettronica e Informazione ; Politecnico di Milano, ARLES (INRIA Rocquencourt) ; INRIA, European Project : 257178, ICT, FP7-ICT-2009-5, CHOREOS(2010), Autili, Marco, Caporuscio, Mauro, Issarny, Valérie, Berardinelli, Luca, SeaGroup ; University of L'Aquila, Dipartimento di Elettronica e Informazione ; Politecnico di Milano, ARLES (INRIA Rocquencourt) ; INRIA, European Project : 257178, ICT, FP7-ICT-2009-5, CHOREOS(2010), Autili, Marco, Caporuscio, Mauro, Issarny, Valérie, and Berardinelli, Luca
Abstract: International audience

20. A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules

Author: Laboratoire d'Informatique de Nantes Atlantique (LINA) ; CNRS - Université de Nantes - École Nationale Supérieure des Mines - Nantes, SICS ; Swedish Institute of Computer Science, CONTRAINTES (INRIA Rocquencourt) ; INRIA, Springer-Verlag, Beldiceanu, Nicolas, Carlsson, Mats, Martin, Julien, Laboratoire d'Informatique de Nantes Atlantique (LINA) ; CNRS - Université de Nantes - École Nationale Supérieure des Mines - Nantes, SICS ; Swedish Institute of Computer Science, CONTRAINTES (INRIA Rocquencourt) ; INRIA, Springer-Verlag, Beldiceanu, Nicolas, Carlsson, Mats, and Martin, Julien
Abstract: International audience, A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules

21. A new variational method for erythrocyte velocity estimation in wide-field imaging in-vivo

Author: Sylvain Takerkart, Ivo Vanzetta, Guillaume S. Masson, Olivier Faugeras, Thomas Deneux, Weizmann Institute of Science [Rehovot, Israël], Institut de neurosciences cognitives de la méditerranée - UMR 6193 (INCM), Université de la Méditerranée - Aix-Marseille 2-Centre National de la Recherche Scientifique (CNRS), NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), Weizmann Institute for Science [Rehovot], Institut de neurosciences cognitives de la méditerranée - UMR 6193 ( INCM ), Université de la Méditerranée - Aix-Marseille 2-Centre National de la Recherche Scientifique ( CNRS ), Inria Sophia Antipolis - Méditerranée ( CRISAM ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique ( Inria ) -École normale supérieure - Paris ( ENS Paris ) -Université Nice Sophia Antipolis ( UNS ), Université Côte d'Azur ( UCA ) -Université Côte d'Azur ( UCA ) -Centre National de la Recherche Scientifique ( CNRS ), Equipe Autre (hors R&D), Sciences et Technologies de la Musique et du Son (STMS), Institut de Recherche et Coordination Acoustique/Musique (IRCAM)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche et Coordination Acoustique/Musique (IRCAM)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Institut de Neurosciences de la Timone (INT), Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), InVibe, and Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Male, Erythrocytes, Computer science, Tracking (particle physics), [SCCO]Cognitive science, [SPI]Engineering Sciences [physics], 0302 clinical medicine, Microscopy, Image Processing, Computer-Assisted, Computer vision, ComputingMilieux_MISCELLANEOUS, Cerebral Cortex, 0303 health sciences, Radiological and Ultrasound Technology, Fluorescence, Computer Science Applications, medicine.anatomical_structure, Cerebral blood flow, Trajectory, Benchmark (computing), Biological system, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Algorithms, Blood Flow Velocity, [ MATH.MATH-GM ] Mathematics [math]/General Mathematics [math.GM], Optical flow, [SCCO.COMP]Cognitive science/Computer science, Image processing, 03 medical and health sciences, Optical imaging, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], medicine, Animals, Rats, Wistar, Electrical and Electronic Engineering, 030304 developmental biology, Radon transform, Pixel, business.industry, [SCCO.NEUR]Cognitive science/Neuroscience, Blood flow, Rats, Functional imaging, Red blood cell, Microscopy, Fluorescence, Multiphoton, Microvessels, Artificial intelligence, business, 030217 neurology & neurosurgery, Software
Abstract: International audience; Measuring erythrocyte velocity in individual microvessels has important applications for biomedical and functional imaging. Recent multiphoton fluorescence microscopy approaches require injecting fluorescent tracers; moreover, only one or few vessels can be imaged at a time. To overcome these shortcomings, we used CCD-based optical imaging of intrinsic absorption changes in macroscopic vascular networks to record erythrocytes' trajectories over several mm2 of cortical surface. We then demonstrate the feasibility of erythrocyte velocity estimation from such wide-field data, using two robust, independent, algorithms. The first one is a recently published Radon transform-based algorithm that estimates erythrocyte velocity locally. We adapt it to data obtained in wide-field imaging and show, for the first time, its performance on such datasets. The second ("fasttrack") algorithm is novel. It is based on global energy minimization techniques to estimate the full spatiotemporal erythrocytes' trajectories inside vessels. We test the two algorithms on both simulated and biological data, obtained in rat cerebral cortex in a spreading depression experiment. On vessels with medium-slow erythrocyte velocities both algorithms performed well, allowing their usage as benchmark one for another. However, our novel fasttrack algorithm outperformed the other one for higher velocities, as encountered in the arterial network.
Published: 2011

22. Development of a reduced n-heptane oxidation mechanism for HCCI combustion modeling

Author: Noel, L [University Pierre et Marie Curie, INRIA Rocquencourt, B.P. 105, 78153 Le Chesnay Cedex (France)]
Published: 2006
Full Text: View/download PDF

23. Computing electronic structures: A new multiconfiguration approach for excited states

Author: Lewin, Mathieu [CERMICS, Ecole Nationals des Ponts et Chaussees, 6 and 8 Avenue Blaise Pascal, Cite Descartes, 77455 Marne-La-Vallee Cedex 2 (France) and INRIA Rocquencourt, MICMAC Project, Domaine de Voluceau, B.P. 105, 78 150 Le Chesnay (France)]
Published: 2006
Full Text: View/download PDF

24. Shock-to-detonation transition of nitromethane: Time-resolved emission spectroscopy measurements

Author: Chavent, Guy [INRIA-Rocquencourt, BP105, F-78153 Le Chesnay Cedex (France)]
Published: 2006
Full Text: View/download PDF

25. Model-Based Clustering and Classification for Data Science: With Applications in R

Author: Charles Bouveyron, Gilles Celeux, T. Brendan Murphy, Adrian E. Raftery, Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Modèles et algorithmes pour l’intelligence artificielle (MAASAI), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Laboratoire Jean Alexandre Dieudonné (LJAD), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria), Statistique mathématique et apprentissage (CELESTE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de Mathématiques d'Orsay (LMO), Université Paris-Sud - Paris 11 (UP11)-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-Centre National de la Recherche Scientifique (CNRS), University College Dublin [Dublin] (UCD), Department of Statistics, University of Washington [Seattle], ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019), Laboratoire Jean Alexandre Dieudonné (JAD), Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Laboratoire Jean Alexandre Dieudonné (JAD), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Laboratoire Jean Alexandre Dieudonné (JAD), Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Nice Sophia Antipolis (... - 2019) (UNS), Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), INRIA Rocquencourt, and Centre National de la Recherche Scientifique (CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Saclay
Subjects: 010104 statistics & probability, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 02 engineering and technology, 0101 mathematics, 01 natural sciences, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: International audience
Published: 2019

26. DEcomposed Software Pipelining: A new perspective and a new approach

Author: Su, B [INRIA-Rocquencourt Domaine de Voluceau, Le Chesnay (France)]
Published: 1994
Full Text: View/download PDF

27. Leveraging the Power of the Crowd and Offloading Urban IoT Networks to Extend their Lifetime

Author: Valérie Issarny, Geraldine Texier, Advanced technologies for operated networks ( ADOPNET ), Université de Rennes 1 ( UR1 ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ) -RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES ( IRISA_D2 ), Institut de Recherche en Informatique et Systèmes Aléatoires ( IRISA ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ) -Université de Rennes 1 ( UR1 ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ) -Institut de Recherche en Informatique et Systèmes Aléatoires ( IRISA ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ), Département Systèmes Réseaux, Cybersécurité et Droit du numérique ( SRCD ), IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ), Inria@SiliconValley (INRIA) ( Inria@SiliconValley ), INRIA Rocquencourt (INRIA), Département Systèmes Réseaux, Cybersécurité et Droit du numérique (IMT Atlantique - SRCD), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Advanced technologies for operated networks (ADOPNET), Université de Rennes (UR)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Inria@SiliconValley (Inria@SiliconValley), Stanford University-University of California [Santa Cruz] (UC Santa Cruz), University of California (UC)-University of California (UC)-Institut National de Recherche en Informatique et en Automatique (Inria)-University of California [Santa Barbara] (UC Santa Barbara), University of California (UC)-University of California [San Diego] (UC San Diego), University of California (UC)-Ministère de l'Europe et des Affaires étrangères (MEAE)-University of Southern California (USC)-CITRIS-University of California [Irvine] (UC Irvine), University of California (UC), Middleware on the Move (MIMOVE), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec, Stanford University-University of Southern California (USC)-Institut National de Recherche en Informatique et en Automatique (Inria)-University of California [Santa Barbara] (UCSB), University of California-University of California-University of California [San Diego] (UC San Diego), University of California-Ministère de l'Europe et des Affaires étrangères (MEAE)-CITRIS-University of California [Santa Cruz] (UCSC), University of California-University of California [Irvine] (UCI), University of California, Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
Subjects: Discrete mathematics, IoT, Computer science, business.industry, [ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI], 05 social sciences, Crowdsensing, 050801 communication & media studies, 020206 networking & telecommunications, 02 engineering and technology, WSN, Power (physics), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Mobile sink, 0508 media and communications, [ INFO.INFO-MC ] Computer Science [cs]/Mobile Computing, 11. Sustainability, 0202 electrical engineering, electronic engineering, information engineering, Internet of Things, business, Urban space, Wireless sensor network, Routing
Abstract: The widespread deployment of connected Things in our cities allows for the enhanced management of the urban space. However, due to environmental constraints, the connected Things are often battery-powered, which affects the lifetime of the $\mathrm {I}\mathrm {o}\mathrm {T}$ Networks. We believe that the urban $\mathrm {I}\mathrm {o}\mathrm {T}$ networks must leverage the power of the crowd, leading to combine the fixed urban $\mathrm {I}\mathrm {o}\mathrm {T}$ networks with the crowdsensing capabilities of the citizens' smartphones. That is, we integrate the offloading of a portion of the traffic generated by the fixed network to mobile crowdsensing devices that also contribute with relevant urban observations (e.g., for noise pollution monitoring). This paper highlights the key technical features of the resulting solution, whose evaluation shows that we are able to extend the lifetime of the battery-operated $\mathrm {I}\mathrm {o}\mathrm {T}$ network by a up to 7 factor.
Published: 2018

28. Exact Event-Driven Implementation for Recurrent Networks of Stochastic Perfect Integrate-and-Fire Neurons

Author: Jonathan Touboul, Marcelo O. Magnasco, Thibaud Taillefumier, Laboratory of Mathematical Physics, Rockefeller University [New York], NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)
Subjects: Theoretical computer science, Discretization, Computer science, Nerve net, Cognitive Neuroscience, Models, Neurological, 03 medical and health sciences, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], 0302 clinical medicine, Arts and Humanities (miscellaneous), Neural ensemble, medicine, Animals, Humans, Stochastic neural network, 030304 developmental biology, Neurons, 0303 health sciences, Quantitative Biology::Neurons and Cognition, Brain, Models, Theoretical, Highly sensitive, medicine.anatomical_structure, Neuronal interaction, Neural Networks, Computer, Nerve Net, Algorithms, 030217 neurology & neurosurgery, Coding (social sciences)
Abstract: International audience; In vivo cortical recording reveals that indirectly driven neural assemblies can produce reliable and temporally precise spiking patterns in response to stereotyped stimulation. This suggests that despite being fundamentally noisy, the collective activity of neurons conveys information through temporal coding. Stochastic integrate-and-fire models delineate a natural theoretical framework to study the interplay of intrinsic neural noise and spike timing precision. However, there are inherent difficulties in simulating their networks' dynamics in silico with standard numerical discretization schemes. Indeed, the well-posedness of the evolution of such networks requires temporally ordering every neuronal interaction, whereas the order of interactions is highly sensitive to the random variability of spiking times. Here, we answer these issues for perfect stochastic integrate-and-fire neurons by designing an exact event-driven algorithm for the simulation of recurrent networks, with delayed Dirac-like interactions. In addition to being exact from the mathematical standpoint, our proposed method is highly efficient numerically. We envision that our algorithm is especially indicated for studying the emergence of polychronized motifs in networks evolving under spike-timing-dependent plasticity with intrinsic noise.
Published: 2012

29. The relative contribution of noise and adaptation to competition during tri-stable motion perception

Author: Meso, Andrew Isaac, Rankin, James, Faugeras, Olivier, Kornprobst, Pierre, Masson, Guillaume, Bournemouth University [Poole] (BU), Institut de Neurosciences de la Timone (INT), Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), Center for Neural Science [New York] (CNS), New York University [New York] (NYU), NYU System (NYU)-NYU System (NYU), Mathématiques pour les Neurosciences (MATHNEURO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Biologically plausible Integrative mOdels of the Visual system : towards synergIstic Solutions for visually-Impaired people and artificial visiON (BIOVISION), ANR-10-BLAN-1432,VISAFIX,Instabilité fonctionnelle durant la fixation oculaire : conséquences motrices et perceptives(2010), ANR-13-SHS2-0006,SPEED,Traitement de la vitesse dans les scènes visuelles naturelles, European Project: 227747,EC:FP7:ERC,ERC-2008-AdG,NERVI(2009), European Project: 318723,EC:FP7:ICT,FP7-ICT-2011-8,MATHEMACS(2012), European Project: 269921,EC:FP7:ICT,FP7-ICT-2009-6,BRAINSCALES(2011), ANR-13-BSH2-0006,SPEED,Traitement de la vitesse dans les scènes visuelles naturelles(2013), Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Mathematical and Computational Neuroscience (NEUROMATHCOMP), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Alexandre Dieudonné (JAD), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), NEUROMATHCOMP, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris)-Université Nice Sophia Antipolis (... - 2019) (UNS), Kornprobst, Pierre, BLANC - Instabilité fonctionnelle durant la fixation oculaire : conséquences motrices et perceptives - - VISAFIX2010 - ANR-10-BLAN-1432 - BLANC - VALID, Blanc 2013 - Traitement de la vitesse dans les scènes visuelles naturelles - - SPEED2013 - ANR-13-BSH2-0006 - Blanc 2013 - VALID, From single neurons to visual perception - NERVI - - EC:FP7:ERC2009-01-01 - 2013-12-31 - 227747 - VALID, MATHEmatics of Multi-level Anticipatory Complex Systems - MATHEMACS - - EC:FP7:ICT2012-10-01 - 2015-09-30 - 318723 - VALID, and Brain-inspired multiscale computation in neuromorphic hybrid systems - BRAINSCALES - - EC:FP7:ICT2011-01-01 - 2015-03-31 - 269921 - VALID
Subjects: [SCCO]Cognitive science, Eye movements, Competition model, Multistable motion perception, [SCCO.NEUR]Cognitive science/Neuroscience, [SCCO.NEUR] Cognitive science/Neuroscience, [SCCO.PSYC]Cognitive science/Psychology, [SDV.NEU.SC]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]/Cognitive Sciences, [SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC], Adaptation, Noise, [SDV.NEU.SC] Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]/Cognitive Sciences, ComputingMilieux_MISCELLANEOUS
Abstract: International audience; Animals exploit antagonistic interactions for sensory processing and these can cause oscillations between competing states. Ambiguous sensory inputs yield such perceptual multi-stability. Despite numerous empirical studies using binocular rivalry or plaid pattern motion, the driving mechanisms behind the spontaneous transitions between alternatives remain unclear. In the current work, we used a tri-stable barberpole motion stimulus combining empirical and modelling approaches to elucidate the contributions of noise and adaptation to underlying competition. We first robustly characterised the coupling between perceptual reports of transitions and continuously recorded eye direction, identifying a critical window of 480ms before button presses within which both measures were most strongly correlated. Second, we identified a novel non monotonic relationship between stimulus contrast and average perceptual switching rate with an initially rising rate before a gentle reduction at higher contrasts. A neural fields model of the underlying dynamics introduced in previous theoretical work and incorporating noise and adaptation mechanisms was adapted, extended and empirically validated. Noise and adaptation contributions were confirmed to dominate at the lower, and higher, contrasts respectively. Model simulations with two free parameters, controlling adaptation dynamics and direction thresholds, captured the measured mean transition rates for participants. We verified the shift from noise dominated towards adaptation-driven in both the eye direction distributions and inter-transition duration statistics. This work combines modelling and empirical evidence to demonstrate the signal strength dependent interplay between noise and adaptation during tri- stability. We propose that the findings generalise beyond the barberpole stimulus case to ambiguous perception in continuous feature spaces.
Published: 2016

30. A Markovian event-based framework for stochastic spiking neural networks

Author: Olivier Faugeras, Jonathan Touboul, NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)
Subjects: FOS: Computer and information sciences, Refractory period, Computer science, Spike train, Action Potentials, Synaptic Transmission, Synapse, 0302 clinical medicine, Neurons, Membrane potential, 0303 health sciences, Artificial neural network, Markov Chains, Sensory Systems, medicine.anatomical_structure, symbols, Excitatory postsynaptic potential, Probability distribution, Neurons and Cognition (q-bio.NC), Spike (software development), Algorithm, Cognitive Neuroscience, Markov process, Mathematics - Statistics Theory, Statistics Theory (math.ST), Inhibitory postsynaptic potential, Statistics - Applications, 03 medical and health sciences, Cellular and Molecular Neuroscience, symbols.namesake, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], FOS: Mathematics, medicine, Animals, Humans, Applications (stat.AP), Stochastic neural network, 030304 developmental biology, Spiking neural network, Stochastic Processes, Quantitative Biology::Neurons and Cognition, Markov chain, Synaptic integration, Neural Inhibition, Quantitative Biology - Neurons and Cognition, FOS: Biological sciences, Linear Models, Neural Networks, Computer, Neuron, Nerve Net, 030217 neurology & neurosurgery
Abstract: International audience; In spiking neural networks, the information is conveyed by the spike times, that depend on the intrinsic dynamics of each neuron, the input they receive and on the connections between neurons. In this article we study the Markovian nature of the sequence of spike times in stochastic neural networks, and in particular the ability to deduce from a spike train the next spike time, and therefore produce a description of the network activity only based on the spike times regardless of the membrane potential process. To study this question in a rigorous manner, we introduce and study an event-based description of networks of noisy integrate-and-fire neurons, i.e. that is based on the computation of the spike times. We show that the firing times of the neurons in the networks constitute a Markov chain, whose transition probability is related to the probability distribution of the interspike interval of the neurons in the network. In the cases where the Markovian model can be developed, the transition probability is explicitly derived in such classical cases of neural networks as the linear integrate-and-fire neuron models with excitatory and inhibitory interactions, for different types of synapses, possibly featuring noisy synaptic integration, transmission delays and absolute and relative refractory period. This covers most of the cases that have been investigated in the event-based description of spiking deterministic neural networks.
Published: 2011

31. Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix

Author: Ibtihel Ben Gharbia, J. Charles Gilbert, and INRIA Rocquencourt, Domaine de Voluceau, BP 105, 78153 Le Chesnay Cedex
Subjects: General Mathematics, Numerical analysis, Nonsmooth function, 49J5249M1590C33, Linear complementarity problem, Complementarity (physics), Combinatorics, Piecewise linear function, symbols.namesake, Newton's method, P-matrix, Nonconvergence, symbols, [INFO]Computer Science [cs], Uniqueness, M-matrix, Algorithm, Software, Mathematics
Abstract: International audience; The plain Newton-min algorithm to solve the linear complementarity problem (LCP for short) 0 ≤ x ⊥ (Mx+q) ≥ 0 can be viewed as a nonsmooth Newton algorithm without globalization technique to solve the system of piecewise linear equations min(x,Mx+q)=0, which is equivalent to the LCP. When M is an M-matrix of order n, the algorithm is known to converge in at most n iterations. We show in this paper that this result no longer holds when M is a P-matrix of order ≥ 3, since then the algorithm may cycle. P-matrices are interesting since they are those ensuring the existence and uniqueness of the solution to the LCP for an arbitrary q. Incidentally, convergence occurs for a P-matrix of order 1 or 2.
Published: 2011

32. Modeling the notion of program testing; application to test set generation

Author: Luc Bougé, Laboratoire Informatique Théorique et Programmation (LITP), Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), Université Pierre et Marie Curie - Paris VI, Bernard Robinet, Projet Langages de l'INRIA Rocquencourt, and Centre National de la Recherche Scientifique (CNRS)-Université Paris Diderot - Paris 7 (UPD7)-Université Pierre et Marie Curie - Paris 6 (UPMC)
Subjects: Program testing, Automatic test set generation, Test de programmes, Sémantique, génération automatique de jeu de tests, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Semantics
Abstract: Ce travail présente une modélisation originale de la notion de test de programmes, à partir de la logique égalitaire du premier ordre. Plusieurs applications concernant notamment les types abstraits algébriques et la validation automatique de spécifications sont proposées.À partir d'une étude intuitive de la notion de test, nous dégageons la notion de processus de test, fondée sur le principe du couplage.Nous définissions la notion de jeu de tests sur un contexte de test. Ses propriétés mathématiques sont étudiées: fiabilité, validité, absence de biais, acceptabilité. Plusieurs ordres partiels sont définis: finesses absolue et asymptotique. Les équivalences déduites donnent lieu à des théorèmes importants.Une méthode de pratique de test est construite à partir de cette théorie et appliquée à un programme de tri. Cette méthode est particulièrement adaptée à la validation d'un axiome d'un type abstrait algébrique sur une algèbre. Un exemple est présenté, et l'implantation d'un outil expérimental utilisant cette méthode, réalisé à titre expérimental, est décrite.De nombreuses annexes sont jointes: un résumé des travaux antérieurs sur le problème, une bibliographie sur la validation des programmes par test, une introduction à la logique du premier ordre et un listage partiel de l'implantation réalisée.
Published: 1982

33. Adaptive Hausdorff distances and dynamic clustering of symbolic interval data

Author: Renata M. C. R. de Souza, Yves Lechevallier, Francisco de A. T. de Carvalho, Marie Chavent, Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS), Usage-centered design, analysis and improvement of information systems (AxIS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), INRIA Rocquencourt, and Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Mathematical optimization, Rand index, Single-linkage clustering, 02 engineering and technology, Interval (mathematics), [STAT.OT]Statistics [stat]/Other Statistics [stat.ML], 01 natural sciences, Symbolic data analysis, 010104 statistics & probability, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Artificial Intelligence, interval data, 0202 electrical engineering, electronic engineering, information engineering, adaptive distances, 0101 mathematics, Cluster analysis, k-medians clustering, Mathematics, k-medoids, Hausdorff distance, dynamic clustering, ComputingMethodologies_PATTERNRECOGNITION, Signal Processing, 020201 artificial intelligence & image processing, Computer Vision and Pattern Recognition, Algorithm, Software
Abstract: This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocation algorithms involving the construction of the clusters at each iteration and the identification of a suitable representation or prototype (means, axes, probability laws, groups of elements, etc.) for each cluster by locally optimizing an adequacy criterion that measures the fitting between the clusters and their corresponding representatives. In this paper, each pattern is represented by a vector of intervals. Adaptive Hausdorff distances are the measures used to compare two interval vectors. Adaptive distances at each iteration change for each cluster according to its intra-class structure. The advantage of these adaptive distances is that the clustering algorithm is able to recognize clusters of different shapes and sizes. To evaluate this method, experiments with real and synthetic interval data sets were performed. The evaluation is based on an external cluster validity index (corrected Rand index) in a framework of a Monte Carlo experiment with 100 replications. These experiments showed the usefulness of the proposed method.
Published: 2006

34. A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger

Author: Gérard Huet, INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), Linguistic signs, grammar and meaning: computational logic for natural language (SIGNES), INRIA Futurs, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Sciences et Technologies - Bordeaux 1-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Bordeaux Montaigne-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Sciences et Technologies - Bordeaux 1 (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Bordeaux Montaigne (UBM)-Centre National de la Recherche Scientifique (CNRS), and Retoré, Christian
Subjects: Correctness, Computer science, media_common.quotation_subject, 02 engineering and technology, Lexicon, computer.software_genre, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Programming style, Sandhi, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, [SHS.LANGUE]Humanities and Social Sciences/Linguistics, ComputingMilieux_MISCELLANEOUS, media_common, Functional programming, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Finite-state machine, Programming language, business.industry, Data structure, [SHS.LANGUE] Humanities and Social Sciences/Linguistics, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], 020201 artificial intelligence & image processing, Artificial intelligence, business, computer, Software, Natural language processing, Natural language
Abstract: We present the Zen toolkit for morphological and phonological processing of natural languages. This toolkit is presented in literate programming style, in the Pidgin ML subset of the Objective Caml functional programming language. This toolkit is based on a systematic representation of finite state automata and transducers as decorated lexical trees. All operations on the state space data structures use the zipper technology, and a uniform sharing functor permits systematic maximum sharing as dags. A particular case of lexical maps is specially convenient for building invertible morphological operations such as inflected forms dictionaries, using a notion of differential word. As a particular application, we describe a general method for tagging a natural language text given as a phoneme stream by analysing possible euphonic liaisons between words belonging to a lexicon of inflected forms. The method uses the toolkit methodology by constructing a non-deterministic transducer, implementing rational rewrite rules, by mechanical decoration of a trie representation of the lexicon index. The algorithm is linear in the size of the lexicon. A coroutine interpreter is given, and its correctness and completeness are formally proved. An application to the segmentation of Sanskrit by sandhi analysis is demonstrated.
Published: 2005

35. VNR-GA: Elastic Virtual Network Reconfiguration Algorithm based on Genetic Meteheuristic

Author: Dab , B., Fajjari , I., Aitsaadi , N., Pujolle , G., CIR, Laboratoire Images, Signaux et Systèmes Intelligents ( LISSI ), Université Paris-Est Créteil Val-de-Marne - Paris 12 ( UPEC UP12 ) -Université Paris-Est Créteil Val-de-Marne - Paris 12 ( UPEC UP12 ), VirtuOR, INRIA Rocquencourt, and Institut National de Recherche en Informatique et en Automatique ( Inria )
Subjects: [ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Abstract: International audience; Cloud Computing offers elasticity and enhances resource utilisation. This is why its success strongly depends on the efficiency of the physical resource management. This paper deals with dynamic resource reconfiguration to achieve high resource utilisation and to increase Cloud providers income. We propose a new adaptive virtual network resource reconfiguration strategy named VNR-GA to handle dynamic users' needs and to adapt virtual resource allocation according to the applications' requirements. The proposed algorithm VNR-GA is based on Genetic metaheuristic and takes advantage of resources migration techniques to recompute the resource allocation of instantiated virtual networks. In order to optimally adapt the resource allocation according to customers' needs growth, the main idea behind the proposal is to sequentially generate populations of reconfiguration solutions that minimise both the migration and mapping cost and then select the best reconfiguration solution. VNR-GA is validated by extensive simulations and compared to the most prominent related strategy found in literature (i.e., SecondNet). The results obtained show that VNR-GA reduces the rejection rate of i) virtual networks and ii) resource upgrade requests and thus enhances Cloud Provider revenue and customer satisfaction. Moreover, reconfiguration cost is minimised since our proposal reduces both the amount of migrated resources and their new mapping cost.
Published: 2013

36. Horizons of fractional Brownian surfaces

Author: Kenneth J. Falconer, J. Lévy Véhel, Mathematical Institute, University of St Andrews [Scotland]-Mathematical Institute, INRIA Rocquencourt, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Surface (mathematics), Fractional Brownian motion, General Mathematics, Horizon, 010102 general mathematics, Mathematical analysis, General Engineering, General Physics and Astronomy, 02 engineering and technology, 01 natural sciences, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], Fractal, Mathematics::Probability, Brownian surface, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Almost surely, 0101 mathematics, Maxima, Brownian motion, Mathematics
Abstract: International audience; We investigate the conjecture that the horizon of an index alpha fractional Brownian surface has (almost surely) the same Hölder exponents as the surface itself, with corresponding relationships for fractal dimensions. We establish this formally for the usual Brownian surface (where alpha = 1/ 2 ), and also for other alpha, 0 < alpha< 1, assuming a hypothesis concerning maxima of index alpha Brownian motion. We provide computational evidence that the conjecture is indeed true for all alpha.
Published: 2000

37. Three-dimensional metamorphosis: a survey

Author: Francis Lazarus, Anne Verroust, SIGNAL-IMAGE-COMMUNICATION (SIC), Université de Poitiers-Centre National de la Recherche Scientifique (CNRS), INRIA Rocquencourt, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Computer science, business.industry, 020207 software engineering, 02 engineering and technology, Object (computer science), Computer Graphics and Computer-Aided Design, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], GeneralLiterature_MISCELLANEOUS, Computer graphics, Morphing, Software, Industrial design, Human–computer interaction, Computer graphics (images), Component (UML), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Computer Vision and Pattern Recognition, User interface, Metamorphosis Shape transformation Interpolation Computer animation Geometric modeling, business, Computer animation, ComputingMethodologies_COMPUTERGRAPHICS
Abstract: International audience; A metamorphosis or a (3D) morphing is the process of continuously transforming one object into another. 2D and 3D morphing are popular in computer animation, industrial design, and growth simulation. Since there is no intrinsic solution to the morphing problem, user interaction can be a key component of a morphing software. Many morphing techniques have been proposed in recent years for 2D and 3D objects. We present a survey of the various 3D approaches, giving special attention to the user interface. We show how the approaches are intimately related to the object representations. We conclude by sketching some morphing strategies for the future.
Published: 1998

38. Interplay between synaptic delays and propagation delays in neural fields equations

Author: Veltz, Romain, NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), This research was partially supported by the European Union Seventh Framework Programme (FP7/2007- 2013) under grant agreement no. 269921 (BrainScaleS) and by the ERC advanced grant NerVi no. 227747, INRIA, European Project: 269921,EC:FP7:ICT,FP7-ICT-2009-6,BRAINSCALES(2011), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS)
Subjects: [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]
Abstract: Neural fields equations describe the activity of neural populations at a mesoscopic level. Although the early derivation of these equations introduced space dependent delays coming from the finite speed of signal propagation along axons, there has been few studies concerning their role in shaping the dynamics of neural activity. This is mainly due to the lack of analytical tractable models. On the other hand, constant delays have to be introduced to model the synaptic transmission and the spike initiation dynamics. By incorporating the two kind of delays in the neural fields equations, we are able to find the Hopf bifurcation curves analytically as well as the normal forms of the main bifurcations. This allows an in-depth study of two different types of connectivity that reveals a surprisingly rich dynamical portrait because the connectivity and the space dependent delays couple dynamically. In particular, the shape of the connectivity strongly influences the spatiotemporal dynamics.; Les équations de masses neurales décrivent l'activité de populations neurales au niveau mésoscopique. Bien que les délais de propagation, issus de la vitesse de propagation finie des signaux le long des axones, aient été incorporés dans les premières équations, il y a peu d'études concernant leur rôle dans l'établissement de l'activité neurale. Cela est principalement lié au manque de modèles analytiques. D'un autre côté, les délais constants ont été introduits pour modéliser la transmission synaptique et la dynamique de l'initiation du potentiel d'action. En prenant en compte ces deux types de délais dans les équations de masses neurales, nous donnons des formules analytiques pour les courbes de bifurcation de Hopf ainsi que pour les coefficients de différentes formes normales. Ces formules permettent une étude en profondeur de deux types de connectivités qui révèle une dynamique extrêmement riche liée au fait que la connectivité et les délais, fonctions de l'espace, se couplent de façon dynamique. Ainsi, la forme de la connectivité affecte fortement la dynamique.
Published: 2013

39. Spike Train Statistics from Empirical Facts to Theory: The Case of the Retina

Author: Cessac, Bruno, Palacios, Adrian, NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Centro Interdisciplinario de Neurociencia de Valparaiso (CINV), Universidad de Valparaiso [Chile], ERC grant Nervi 227747, Frédéric Cazals and Pierre Kornprobst, Centro de Neurociencia, Valparaiso, Chili, European Project: 269921,EC:FP7:ICT,FP7-ICT-2009-6,BRAINSCALES(2011), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS)
Subjects: retina, genetic structures, Quantitative Biology::Neurons and Cognition, Neural Networks, [SDV.NEU.NB]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]/Neurobiology, education, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], Spike statitsics, sense organs, eye diseases
Abstract: International audience; This chapter focuses on methods from statistical physics and probability theory allowing the analysis of spike trains in neural networks. Taking as an example the retina we present recent works attempting to understand how retina ganglion cells encode the information transmitted to the visual cortex via the optical nerve, by analyzing their spike train statistics. We compare the maximal entropy models used in the literature of retina spike train analysis to rigorous results establishing the exact form of spike train statistics in conductance-based Integrate-and-Fire neural networks.
Published: 2013

40. Écoulement rhéofluidifiant dans un coude et une bifurcation plane symétrique. Application à l'écoulement sanguin dans la grande circulation

Author: Marc Thiriet, G. Martin-Borret, Frédéric Hecht, MEthodes NUmériques pour les Sciences de l'INgénieur (MENUSIN), INRIA Rocquencourt, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: 010101 applied mathematics, Physics, [PHYS.HIST]Physics [physics]/Physics archives, 0206 medical engineering, General Engineering, General Physics and Astronomy, 02 engineering and technology, 0101 mathematics, 020601 biomedical engineering, 01 natural sciences, Humanities
Abstract: Des simulations numériques d'écoulement stationnaire laminaire de fluide, dont le comportement rhéologique est rhéofluidifiant, ont été effectuées dans un coude (angle de courbure de 90 degrés, rapport de courbure de 1/10) et une bifurcation plane symétrique (angle de bifurcation de 70 degrés, rapport des sections de 0,8). La méthode des éléments finis a été employée. le fluide est supposé suivre un comportement newtonien généralisé, représenté par la loi de Carreau, adaptée aux faits d'observation. Les champs de grandeurs hydrodynamiques sont comparés aux champs obtenus lorsque le comportement est newtonien. Tout modèle d'écoulement de sang doit, a priori, prendre en compte le comportement non-newtonien du fluide. Toutefois, cet impératif est discuté lorsque l'investigation porte sur les gros troncs artériels.
Published: 1996

41. Reduced modeling of PEM Fuel cell with the aim of supervision and diagnosis by impedance spectroscopy

Author: Safa, Mohamad, SIgnals and SYstems in PHysiology & Engineering (SISYPHE), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), Université Paris Sud - Paris XI, and Pierre-Alexandre Bliman
Subjects: PEM fuel cell, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], Electrochemical reaction networks, Pile à combustible, Impedance spectroscopy, Modélisation réduite, Balance harmonique, Réseaux électrochimiques, Reduced modeling, Harmonic balance, Spectroscopie d'impédance
Abstract: This PhD thesis focuses on reduced modeling of PEM fuel cell for supervision and diagnosis by impedance spectroscopy. The first part of the document presents the principle of the PEM fuel cell, as well as the state of the art of modeling and of the methods for supervision and diagnosis. The multiscale dynamic model published in 2005 by A.A. Franco is particularly detailed and serves as a starting point. It is simplified, in order to obtain a system of partial differential equations in a single spatial dimension. The second part is devoted to harmonic analysis of the PEM Fuel cell. Inspired by classical work on the geometric analysis of electrochemical reactions networks, a model compatible with thermodynamics is obtained. This class of dynamic systems allows establishing, for such a network, an analytical formula of the impedance of the anode and the cathode of the PEM fuel cell. A complete model of the cell is obtained by connecting these elements to the membrane, diffuse layers and gas diffusion layer. The previous models assumed the PEM Fuel cell represented by a single, homogeneous, cell. In order to describe the possible spatial heterogeneities, we finally propose a result of reduced modeling for the impedance of a cell network. This model approximates the overall impedance of the network by a "mean cell", connected to two cells, put in "serial" and "parallel", and representative of the deviations from the average.; Cette thèse porte sur la modélisation des piles à combustible à membrane d'échange de protons (PEMFC), en vue de leur surveillance et de leur diagnostic par spectroscopie d'impédance. La première partie du document présente le principe de fonctionnement de ces piles, ainsi que l'état de l'art de la modélisation et des méthodes de surveillance et diagnostic. Le modèle physique multi échelle particulièrement détaillé publié en 2005 par A.A. Franco sert de point de départ. Il est simplifié de façon à aboutir à un système d'équations aux dérivées partielles en une unique dimension spatiale. L'objectif principal de la seconde partie est l'analyse harmonique du fonctionnement de la pile. En s'inspirant de travaux classiques sur l'analyse géométrique de réseaux de réactions électrochimiques, un modèle réduit compatible avec la thermodynamique est obtenu. Cette classe de systèmes dynamiques permet de déterminer, pour un tel réseau, une formule analytique de l'impédance de l'anode et de la cathode d'une pile PEMFC. Un modèle complet de la pile est obtenu en connectant ces éléments à des éléments représentant la membrane, les couches diffuses et les couches de diffusion des gaz. Les modèles précédents supposent la pile représentée par une cellule unique et homogène. Afin de permettre d'en décrire les hétérogénéités spatiales, nous proposons finalement un résultat de modélisation réduite d'un réseau de cellules représentées par leur impédance. Ce modèle approxime l'impédance globale du réseau par une "cellule moyenne", connectée à deux cellules "série" et "parallèle" représentatives d'écart par rapport à la moyenne.
Published: 2012

42. Modélisation réduite de la pile à combustible en vue de la surveillance et du diagnostic par spectroscopie d'impédance

Author: Safa, Mohamad, SIgnals and SYstems in PHysiology & Engineering (SISYPHE), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), Université Paris Sud - Paris XI, and Pierre-Alexandre Bliman
Subjects: PEM fuel cell, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], Electrochemical reaction networks, Pile à combustible, Impedance spectroscopy, Modélisation réduite, Balance harmonique, Réseaux électrochimiques, Reduced modeling, Harmonic balance, Spectroscopie d'impédance
Abstract: This PhD thesis focuses on reduced modeling of PEM fuel cell for supervision and diagnosis by impedance spectroscopy. The first part of the document presents the principle of the PEM fuel cell, as well as the state of the art of modeling and of the methods for supervision and diagnosis. The multiscale dynamic model published in 2005 by A.A. Franco is particularly detailed and serves as a starting point. It is simplified, in order to obtain a system of partial differential equations in a single spatial dimension. The second part is devoted to harmonic analysis of the PEM Fuel cell. Inspired by classical work on the geometric analysis of electrochemical reactions networks, a model compatible with thermodynamics is obtained. This class of dynamic systems allows establishing, for such a network, an analytical formula of the impedance of the anode and the cathode of the PEM fuel cell. A complete model of the cell is obtained by connecting these elements to the membrane, diffuse layers and gas diffusion layer. The previous models assumed the PEM Fuel cell represented by a single, homogeneous, cell. In order to describe the possible spatial heterogeneities, we finally propose a result of reduced modeling for the impedance of a cell network. This model approximates the overall impedance of the network by a "mean cell", connected to two cells, put in "serial" and "parallel", and representative of the deviations from the average.; Cette thèse porte sur la modélisation des piles à combustible à membrane d'échange de protons (PEMFC), en vue de leur surveillance et de leur diagnostic par spectroscopie d'impédance. La première partie du document présente le principe de fonctionnement de ces piles, ainsi que l'état de l'art de la modélisation et des méthodes de surveillance et diagnostic. Le modèle physique multi échelle particulièrement détaillé publié en 2005 par A.A. Franco sert de point de départ. Il est simplifié de façon à aboutir à un système d'équations aux dérivées partielles en une unique dimension spatiale. L'objectif principal de la seconde partie est l'analyse harmonique du fonctionnement de la pile. En s'inspirant de travaux classiques sur l'analyse géométrique de réseaux de réactions électrochimiques, un modèle réduit compatible avec la thermodynamique est obtenu. Cette classe de systèmes dynamiques permet de déterminer, pour un tel réseau, une formule analytique de l'impédance de l'anode et de la cathode d'une pile PEMFC. Un modèle complet de la pile est obtenu en connectant ces éléments à des éléments représentant la membrane, les couches diffuses et les couches de diffusion des gaz. Les modèles précédents supposent la pile représentée par une cellule unique et homogène. Afin de permettre d'en décrire les hétérogénéités spatiales, nous proposons finalement un résultat de modélisation réduite d'un réseau de cellules représentées par leur impédance. Ce modèle approxime l'impédance globale du réseau par une "cellule moyenne", connectée à deux cellules "série" et "parallèle" représentatives d'écart par rapport à la moyenne.
Published: 2012

43. Floor the Ceil & Ceil the Floor: Revisiting AIMD Evaluation

Author: Ashwin Rao, Arnaud Legout, Bruno Cessac, Walid Dabbous, Protocols and applications for the Internet (PLANETE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS)
Subjects: ACM: C.: Computer Systems Organization/C.4: PERFORMANCE OF SYSTEMS/C.4.3: Modeling techniques, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Sensitivity, Fairness, AIMD, Efficiency, Integer Arithmetic, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation
Abstract: Additive Increase Multiplicative Decrease (AIMD) is a widely used congestion control algorithm that is known to be fair and efficient in utilizing the network resources. In this paper, we revisit the performance of the AIMD algorithm under realistic conditions by extending the seminal model of Chui~\etal. We show that under realistic conditions the fairness and efficiency of AIMD is sensitive to changes in network conditions. Surprisingly, the root cause of this sensitivity comes from the way the congestion window is rounded during a multiplicative decrease phase. For instance, the floor function is often used to round the congestion window value because either kernel implementations or protocol restrictions mandate to use integers to maintain system variables. To solve the sensitivity issue, we provide a simple solution that is to alternatively use the floor and ceiling functions in the computation of the congestion window during a multiplicative decrease phase, when the congestion window size is an odd number. We observe that with our solution the efficiency improves and the fairness becomes one order of magnitude less sensitive to changes in network conditions.
Published: 2012

44. A center manifold result for delayed neural fields equations

Author: Veltz, Romain, Faugeras, Olivier, NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), This research was partially supported by the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 269921 (BrainScaleS) and by the ERC advanced grant NerVi no. 227747., INRIA, European Project: 269921,EC:FP7:ICT,FP7-ICT-2009-6,BRAINSCALES(2011), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS)
Subjects: [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA]
Abstract: We develop a framework for the study of delayed neural fields equations and prove a center manifold theorem for these equations. Specific properties of delayed neural fields equations make it impossible to apply existing methods from the literature concerning center manifold results for functional differential equations. Our approach for the proof of the center manifold theorem uses the original combination of results from Vanderbauwhede etal. together with a theory of linear functional differential equations in a history space larger than the commonly used set of time-continuous functions.
Published: 2012

45. Mean-field description and propagation of chaos in networks of Hodgkin-Huxley and FitzHugh-Nagumo neurons

Author: Olivier Faugeras, Javier Baladron, Jonathan Touboul, Diego Fasoli, NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Labex MemoLife, École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Ecole Superieure de Physique et de Chimie Industrielles de la Ville de Paris (ESPCI Paris), Université Paris sciences et lettres (PSL)-Collège de France (CdF (institution)), Centre interdisciplinaire de recherche en biologie (CIRB), Université Paris sciences et lettres (PSL)-Collège de France (CdF (institution))-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Collège de France (CdF (institution))-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM), Nonlinear Analysis for Biology and Geophysical flows (BANG), Laboratoire Jacques-Louis Lions (LJLL), Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), This work was partially supported by the ERC grant #227747 NerVi, the FACETSITN Marie-Curie Initial Training Network #237955 and the IP project BrainScaleS #269921, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Collège de France (CdF (institution))-Ecole Superieure de Physique et de Chimie Industrielles de la Ville de Paris (ESPCI Paris), Université Paris sciences et lettres (PSL), Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), and BMC, Ed.
Subjects: propagation of chaos, neural assemblies, Population, Neuroscience (miscellaneous), 01 natural sciences, 010305 fluids & plasmas, 010104 statistics & probability, Stochastic differential equation, Theoretical physics, Simultaneous equations, Kolmogorov equations (Markov jump process), 0103 physical sciences, [SDV.NEU] Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC], 0101 mathematics, education, Mathematics, education.field_of_study, Partial differential equation, Quantitative Biology::Neurons and Cognition, Independent equation, McKean-Vlasov equations, Research, mean-field limits, Mathematical analysis, Delay differential equation, mean-ﬁeld limits, neural networks, stochastic differential equations, FitzHugh-Nagumo neurons, Hodgkin–Huxley model, Hodgkin-Huxley neurons, [SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC], Fokker-Planck equations
Abstract: We derive the mean-field equations arising as the limit of a network of interacting spiking neurons, as the number of neurons goes to infinity. The neurons belong to a fixed number of populations and are represented either by the Hodgkin-Huxley model or by one of its simplified version, the FitzHugh-Nagumo model. The synapses between neurons are either electrical or chemical. The network is assumed to be fully connected. The maximum conductances vary randomly. Under the condition that all neurons’ initial conditions are drawn independently from the same law that depends only on the population they belong to, we prove that a propagation of chaos phenomenon takes place, namely that in the mean-field limit, any finite number of neurons become independent and, within each population, have the same probability distribution. This probability distribution is a solution of a set of implicit equations, either nonlinear stochastic differential equations resembling the McKean-Vlasov equations or non-local partial differential equations resembling the McKean-Vlasov-Fokker-Planck equations. We prove the well-posedness of the McKean-Vlasov equations, i.e. the existence and uniqueness of a solution. We also show the results of some numerical experiments that indicate that the mean-field equations are a good representation of the mean activity of a finite size network, even for modest sizes. These experiments also indicate that the McKean-Vlasov-Fokker-Planck equations may be a good way to understand the mean-field dynamics through, e.g. a bifurcation analysis. Mathematics Subject Classification (2000):60F99, 60B10, 92B20, 82C32, 82C80, 35Q80.
Published: 2012

46. Streaming an image through the eye: The retina seen as a dithered scalable image coder

Author: Masmoudi, Khaled, Antonini, Marc, Kornprobst, Pierre, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe IMAGES-CREATIVE, Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), INRIA, Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS)
Subjects: bio-inspired signal coding, retina, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, spiking neuron, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], A/D conversion, [SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC], Static image compression, dithering, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, scalability
Abstract: We propose the design of an original scalable image coder/decoder that is in- spired from the mammalians retina. Our coder accounts for the time-dependent and also non- deterministic behavior of the actual retina. The present work brings two main contributions: As a first step, (i) we design a deterministic image coder mimicking most of the retinal processing stages and then (ii) we introduce a retinal noise in the coding process, that we model here as a dither signal, to gain interesting perceptual features. Regarding our first contribution, our main source of inspiration will be the biologically plausible model of the retina called Virtual Retina. The coder that we propose has two stages. The first stage is an image transform which is performed by the outer layers of the retina. Here we model it by filtering the image with a bank of difference of Gaussians with time-delays. The second stage is a time-dependent analog-to-digital conversion which is performed by the inner layers of the retina. The main novelty of this coder is to show that the time-dependent behavior of the retina cells could ensure, in an implicit way, scalability and bit allocation. Regarding our second contribution, we reconsider the inner layers of the retina. We emit a possible interpretation for the non-determinism observed by neurophysiologists in their output. For this sake, we model the retinal noise that occurs in these layers by a dither signal. The dithering process that we propose adds several interesting features to our image coder. The dither noise whitens the reconstruction error and decorrelates it from the input stimuli. Further- more, integrating the dither noise in our coder allows a faster recognition of the fine details of the image during the decoding process. Our present paper goal is twofold. First, we aim at mimicking as closely as possible the retina for the design of a novel image coder while keeping encouraging performances. Second, we bring a new insight concerning the non-deterministic behavior of the retina.; Nous proposons un nouveau codeur/décodeur d'images dynamique qui est inspiré de la rétine des mammifères. Notre codeur tient compte du comportement à la fois dépen- dant du temps mais aussi non-déterministe de la rétine réelle. Le présent travail apporte deux contributions principales: (i) Dans un premier temps, nous concevons un codeur d'images à comportement déterministe qui mime la plupart des étapes de traitement de la rétine et puis (ii), nous introduisons un bruit rétinien dans le processus de codage, que nous modélisons ici comme une signal de dithering, pour acquérir des fonctionnalités perceptuelles intéressantes. En ce qui concerne notre première contribution, notre principale source d'inspiration sera le modèle biologiquement plausible de la rétine appelée Virtual Retina. Le codeur que nous proposons comporte deux étapes. La première étape est une transformation de l'image qui est effectuée par les couches externes de la rétine. Ici nous le modélisons par filtrage de l'image avec une banc de différences de gaussiennes retardées dans le temps. La deuxième étape est une fonction du temps analogique-numérique de conversion qui est effectuée par les couches internes de la rétine. La principale nouveauté de ce codeur est de montrer que le comportement dépendant du temps de cellules de la rétine pourrait assurer, l'allocation de débit et la scalabilité d'une manière implicite. Concernant notre deuxième contribution, nous réexaminons les couches internes de la rétine. Nous émettons une interprétation possible pour le non-déterminisme de leur sortie tel qu'observé observé par les neurophysiologistes. Pour cette cause, nous modélisons le bruit rétinienne qui survient dans ces couches par un signal de dithering. Le processus de dithering que nous proposons ajoute plusieurs fonctionnalités intéressantes à notre codeur d'images. Le bruit de dithering rend blanc le spectre de l'erreur de reconstruction et la décorréle des stimuli d'entrée. Par ailleurs, l'intégration du bruit de dithering dans notre codeur permet une recon- naissance plus rapide des détails fins de l'image pendant le processus de décodage. Notre objectif dans le présent travail est double. Tout d'abord, nous cherchons à imiter le plus fidèlement pos- sible la rétine pour la conception d'un codeur image original tout en gardant des performances encourageantes. Deuxièmement, nous apportons une nouvelle vision concernant le comportement non-déterministe de la rétine.
Published: 2012

47. Noise-induced behaviors in neural mean field dynamics

Author: Olivier Faugeras, Jonathan Touboul, Geoffroy Hermann, NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Mathematical and Computational Neuroscience (NEUROMATHCOMP), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Alexandre Dieudonné (JAD), Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS)
Subjects: neural mass models, Collective behavior, noise, Dynamical systems theory, Gaussian, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], Dynamical Systems (math.DS), 01 natural sciences, Noise (electronics), 010305 fluids & plasmas, mean field equations, 03 medical and health sciences, symbols.namesake, 0302 clinical medicine, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], 0103 physical sciences, FOS: Mathematics, Applied mathematics, Mathematics - Dynamical Systems, Empirical process, Mathematics, Quantitative Biology::Neurons and Cognition, Ode, dynamical systems, Mean field theory, Quantitative Biology - Neurons and Cognition, FOS: Biological sciences, Modeling and Simulation, symbols, Probability distribution, Neurons and Cognition (q-bio.NC), bifurcations, 030217 neurology & neurosurgery, Analysis
Abstract: International audience; The collective behavior of cortical neurons is strongly affected by the presence of noise at the level of individual cells. In order to study these phenomena in large-scale assemblies of neurons, we consider networks of firing-rate neurons with linear intrinsic dynamics and nonlinear coupling, belonging to a few types of cell populations and receiving noisy currents. Asymptotic equations as the number of neurons tends to infinity (mean field equations) are rigorously derived based on a probabilistic approach. These equations are implicit on the probability distribution of the solutions which generally makes their direct analysis difficult. However, in our case, the solutions are Gaussian, and their moments satisfy a closed system of nonlinear ordinary differential equations (ODEs), which are much easier to study than the original stochastic network equations, and the statistics of the empirical process uniformly converge towards the solutions of these ODEs. Based on this description, we analytically and numerically study the influence of noise on the collective behaviors, and compare these asymptotic regimes to simulations of the network. We observe that the mean field equations provide an accurate description of the solutions of the network equations for network sizes as small as a few hundreds of neurons. In particular, we observe that the level of noise in the system qualitatively modifies its collective behavior, producing for instance synchronized oscillations of the whole network, desynchronization of oscillating regimes, and stabilization or destabilization of stationary solutions. These results shed a new light on the role of noise in shaping collective dynamics of neurons, and gives us clues for understanding similar phenomena observed in biological networks.
Published: 2012

48. Localized states in an unbounded neural field equation with smooth firing rate function: a multi-parameter analysis

Author: Faye, Grégory, Rankin, James, Chossat, Pascal, NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Jean Alexandre Dieudonné (JAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), INRIA, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS), and Université Nice Sophia Antipolis (... - 2019) (UNS)
Subjects: Numerical continuation, Quantitative Biology::Neurons and Cognition, Orbital stability, Normal form, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], Neural eld equation, Reversible Hopf-bifurcation, Localized state
Abstract: The existence of spatially localized solutions in neural networks is an important topic in neuroscience as these solutions are considered to characterize working (short-term) memory. We work with an unbounded neural network represented by the neural field equation with smooth firing rate function and a wizard hat spatial connectivity. Noting that stationary solutions of our neural field equation are equivalent to homoclinic orbits in a related fourth order ordinary differential equation, we apply normal form theory for a reversible Hopf bifurcation to prove the existence of localized solutions; further, we present results concerning their stability. Numerical continuation is used to compute branches of localized solution that exhibit snaking-type behaviour. We describe in terms of three parameters the exact regions for which localized solutions persist.
Published: 2012

49. Three applications of GPU computing in neuroscience

Author: Olivier Faugeras, Diego Fasoli, Javier Baladron Pezoa, NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)
Subjects: Brain modeling, Speedup, General Computer Science, GPUs, Computer science, Numerical models, computer system, 02 engineering and technology, Computational science, neuroscience, 03 medical and health sciences, 0302 clinical medicine, Mathematical model, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], graphics processing units, 0202 electrical engineering, electronic engineering, information engineering, parallel and vector implementations, Visualization, Computational neuroscience, General Engineering, Computational modeling, GPU computing, scientific computing, 020201 artificial intelligence & image processing, General-purpose computing on graphics processing units, 030217 neurology & neurosurgery
Abstract: International audience; Three scenarios outlined here show the benefits of using a computer system with multiple GPUs in theoretical neuroscience. In each instance, it's clear that the GPU speedup considerably helps answer a scientific or technological question.
Published: 2012

50. Gibbs distribution analysis of temporal correlations structure in retina ganglion cells

Author: Bruno Cessac, Olivier Marre, Adrian G. Palacios, Juan Carlos Vasquez, Michael J. Berry, NEUROMATHCOMP, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Unité de neurosciences intégratives et computationnelles (UNIC), Centre National de la Recherche Scientifique (CNRS), Centro Interdisciplinario de Neurociencia de Valparaiso (CINV), Universidad de Valparaiso [Chile], Princeton University, Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS-PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)
Subjects: Retinal Ganglion Cells, genetic structures, [PHYS.PHYS.PHYS-BIO-PH]Physics [physics]/Physics [physics]/Biological Physics [physics.bio-ph], Models, Neurological, Wavelet Analysis, Urodela, FOS: Physical sciences, Markov model, 01 natural sciences, Article, Synchronization, 03 medical and health sciences, 0302 clinical medicine, Physiology (medical), 0103 physical sciences, medicine, Animals, Physics - Biological Physics, Statistical physics, 010306 general physics, Mathematics, Retina, Models, Statistical, Quantitative Biology::Neurons and Cognition, General Neuroscience, Principle of maximum entropy, Boltzmann distribution, medicine.anatomical_structure, Biological Physics (physics.bio-ph), Quantitative Biology - Neurons and Cognition, FOS: Biological sciences, Neurons and Cognition (q-bio.NC), Ising model, Spike (software development), Pairwise comparison, Algorithms, Photic Stimulation, 030217 neurology & neurosurgery
Abstract: We present a method to estimate Gibbs distributions with \textit{spatio-temporal} constraints on spike trains statistics. We apply this method to spike trains recorded from ganglion cells of the salamander retina, in response to natural movies. Our analysis, restricted to a few neurons, performs more accurately than pairwise synchronization models (Ising) or the 1-time step Markov models (\cite{marre-boustani-etal:09}) to describe the statistics of spatio-temporal spike patterns and emphasizes the role of higher order spatio-temporal interactions., Comment: To appear in J. Physiol. Paris
Published: 2012

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Publication Type

Journal

Database

Publisher

1,367 results on '"INRIA Rocquencourt"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources