Institution
French Institute for Research in Computer Science and Automation
Government•Le Chesnay, France•
About: French Institute for Research in Computer Science and Automation is a government organization based out in Le Chesnay, France. It is known for research contribution in the topics: Context (language use) & Population. The organization has 13012 authors who have published 38653 publications receiving 1318995 citations. The organization is also known as: INRIA & Institute for national research in information science and automatic control.
Papers published on a yearly basis
Papers
More filters
•
TL;DR: This paper presents a Poisson-convergence result for a broad range of stationary (including lattice) networks subject to log-normal shadowing of increasing variance and proves the invariance of the Poisson limit with respect to the distribution of the additional shadowing or fading.
Abstract: An almost ubiquitous assumption made in the stochastic-analytic study of the quality of service in cellular networks is Poisson distribution of base stations. It is usually justified by various irregularities in the real placement of base stations, which ideally should form the hexagonal pattern. We provide a different and rigorous argument justifying the Poisson assumption under sufficiently strong log-normal shadowing observed in the network, in the evaluation of a natural class of the typical-user service-characteristics including its SINR. Namely, we present a Poisson-convergence result for a broad range of stationary (including lattice) networks subject to log-normal shadowing of increasing variance. We show also for the Poisson model that the distribution of all these characteristics does not depend on the particular form of the additional fading distribution. Our approach involves a mapping of 2D network model to 1D image of it "perceived" by the typical user. For this image we prove our convergence result and the invariance of the Poisson limit with respect to the distribution of the additional shadowing or fading. Moreover, we present some new results for Poisson model allowing one to calculate the distribution function of the SINR in its whole domain. We use them to study and optimize the mean energy efficiency in cellular networks.
214 citations
••
TL;DR: The model-validation approach has been applied to the analysis of the network controlling the nutritional stress response in Escherichia coli and is supported by a new version of the computer tool Genetic Network Analyzer (GNA).
Abstract: Motivation: The modeling and simulation of genetic regulatory networks have created the need for tools for model validation. The main challenges of model validation are the achievement of a match between the precision of model predictions and experimental data, as well as the efficient and reliable comparison of the predictions and observations.
Results: We present an approach towards the validation of models of genetic regulatory networks addressing the above challenges. It combines a method for qualitative modeling and simulation with techniques for model checking, and is supported by a new version of the computer tool Genetic Network Analyzer (GNA). The model-validation approach has been applied to the analysis of the network controlling the nutritional stress response in Escherichia coli.
Availability: GNA and the model of the stress response network are available at http://www-helix.inrialpes.fr/gna
Contact: Hidde.de-Jong@inrialpes.fr
214 citations
••
TL;DR: In this article, a development methodology that separates IoT application development into different concerns and provides a conceptual framework to develop an application, and a development framework that implements the development methodology to support actions of stakeholders.
214 citations
••
TL;DR: This model provides a generic high-level view of the interplays between NFκB pro-survival pathway, RIP1-dependent necrosis, and the apoptosis pathway in response to death receptor-mediated signals and expands the understanding of how cell fate decision is made.
Abstract: Cytokines such as TNF and FASL can trigger death or survival depending on cell lines and cellular conditions. The mechanistic details of how a cell chooses among these cell fates are still unclear. The understanding of these processes is important since they are altered in many diseases, including cancer and AIDS. Using a discrete modelling formalism, we present a mathematical model of cell fate decision recapitulating and integrating the most consistent facts extracted from the literature. This model provides a generic high-level view of the interplays between NFkappaB pro-survival pathway, RIP1-dependent necrosis, and the apoptosis pathway in response to death receptor-mediated signals. Wild type simulations demonstrate robust segregation of cellular responses to receptor engagement. Model simulations recapitulate documented phenotypes of protein knockdowns and enable the prediction of the effects of novel knockdowns. In silico experiments simulate the outcomes following ligand removal at different stages, and suggest experimental approaches to further validate and specialise the model for particular cell types. We also propose a reduced conceptual model implementing the logic of the decision process. This analysis gives specific predictions regarding cross-talks between the three pathways, as well as the transient role of RIP1 protein in necrosis, and confirms the phenotypes of novel perturbations. Our wild type and mutant simulations provide novel insights to restore apoptosis in defective cells. The model analysis expands our understanding of how cell fate decision is made. Moreover, our current model can be used to assess contradictory or controversial data from the literature. Ultimately, it constitutes a valuable reasoning tool to delineate novel experiments.
214 citations
••
TL;DR: A brief introduction to the field of gossiping in distributed systems is presented, by providing a simple framework and using that framework to describe solutions for various application domains.
Abstract: Gossip-based algorithms were first introduced for reliably disseminating data in large-scale distributed systems. However, their simplicity, robustness, and flexibility make them attractive for more than just pure data dissemination alone. In particular, gossiping has been applied to data aggregation, overlay maintenance, and resource allocation. Gossiping applications more or less fit the same framework, with often subtle differences in algorithmic details determining divergent emergent behavior. This divergence is often difficult to understand, as formal models have yet to be developed that can capture the full design space of gossiping solutions. In this paper, we present a brief introduction to the field of gossiping in distributed systems, by providing a simple framework and using that framework to describe solutions for various application domains.
213 citations
Authors
Showing all 13078 results
Name | H-index | Papers | Citations |
---|---|---|---|
Cordelia Schmid | 135 | 464 | 103925 |
Bernt Schiele | 130 | 568 | 70032 |
Francis Bach | 110 | 484 | 54944 |
Jian Sun | 109 | 360 | 239387 |
Pascal Fua | 102 | 614 | 49751 |
Nicholas Ayache | 97 | 624 | 43140 |
Olivier Bernard | 96 | 790 | 37878 |
Laurent D. Cohen | 94 | 417 | 42709 |
Peter Sturm | 93 | 548 | 39119 |
Guy Orban | 93 | 455 | 26178 |
Sebastien Ourselin | 91 | 1116 | 34683 |
François Fleuret | 91 | 936 | 42585 |
Katrin Amunts | 89 | 438 | 35069 |
Tamer Basar | 88 | 977 | 34903 |
Nassir Navab | 88 | 1375 | 41537 |