Search · four archives
Search · four archives
14 papers · ranked by Valyu relevance
Jae Kyoung Kim, Krešimir Josić, Matthew R. Bennett
Background The quasi steady-state approximation (QSSA) is frequently used to reduce deterministic models of biochemical networks. The resulting equations provide a simplified description of the network in terms of non-elementary reaction functions (e.g. Hill functions). Such deterministic reductions are frequently a…
Dieyan Liang, Hong Shen, Lin Chen
We formulate and analyze a generic coverage optimization problem arising in wireless sensor networks with sensors of limited mobility. Given a set of targets to be covered and a set of mobile sensors, we seek a sensor dispatch algorithm maximizing the covered targets under the constraint that the maximal moving…
Michal Dory, Mohsen Ghaffari, Saeed Ilchi
We describe a simple deterministic $O \varepsilon ^{-1}\log \Delta $ round distributed algorithm for $2\alpha +11 + \varepsilon $ approximation of minimum weighted dominating set on graphs with arboricity at most $\alpha$. Here $\Delta$ denotes the maximum degree. We also show a lower bound proving that this round…
Loïc Marrec, Claudia Bank, Thibault Bertrand
Population growth is a fundamental process in ecology and evolution. The population size dynamics during growth are often described by deterministic equations derived from kinetic models. Here, we simulate several population growth models and compare the size averaged over many stochastic realizations with the…
Seth H. Weinberg, Gregory D. Smith
Cardiac myocyte calcium signaling is often modeled using deterministic ordinary differential equations (ODEs) and mass-action kinetics. However, spatially restricted “domains” associated with calcium influx are small enough (e.g., 10−17 liters) that local signaling may involve 1-100 calcium ions. Is it appropriate to…
Steve N'Guyen, Clément Moulin-Frier, Jacques Droulez, Matteo G. A. Paris
'Matteo G. A. Paris'] We propose a new approach for solving a class of discrete decision making problems under uncertainty with positive cost. This issue concerns multiple and diverse fields such as engineering, economics, artificial intelligence, cognitive science and many others. Basically, an agent has to choose a…
Yoshihito Kazashi, Fabio Nobile
An existence result is presented for the dynamical low rank (DLR) approximation for random semi-linear evolutionary equations. The DLR solution approximates the true solution at each time instant by a linear combination of products of deterministic and stochastic basis functions, both of which evolve over time. A key…
Song Yang, Stojan Trajanovski, Fernando A. Kuipers
Background Solving the shortest path and min-cut problems are key in achieving high-performance and robust communication networks. Those problems have often been studied in deterministic and uncorrelated networks both in their original formulations as well as in several constrained variants. However, in real-world…
Benjamin Krakoff, Susan M. Mniszewski, Christian F. A. Negre, Itay Hen
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix which is based on solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of symmetric matrices; It can compute the eigenvector/eigenvalue pair…
Siavash Ameli, Shawn C. Shadden
\usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textbf{A} + t\textbf{B}$$\end{document} A + t B Authors: ['Siavash Ameli' 'Shawn C. Shadden'] We develop heuristic…
Bruno Ordozgoiti, Ananth Mahadevan, Antonis Matakos, Aristides Gionis
When searching for information in a data collection, we are often interested not only in finding relevant items, but also in assembling a diverse set, so as to explore different concepts that are present in the data. This problem has been researched extensively. However, finding a set of items with minimal pairwise…
Alexander Henzi, Alexandre Mösching, Lutz Dümbgen
In the context of estimating stochastically ordered distribution functions, the pool-adjacent-violators algorithm (PAVA) can be modified such that the computation times are reduced substantially. This is achieved by studying the dependence of antitonic weighted least squares fits on the response vector to be…
Lorenzo Finesso, Peter Spreij
Given a positive definite covariance matrix $\widehat{\Sigma}$ of dimension n, we approximate it with a covariance of the form $HH^\top +D$, where H has a prescribed number $k 0$ is diagonal. The quality of the approximation is gauged by the I-divergence between the zero mean normal laws with covariances…
Dario Cattaruzza, Alessandro Abate, Peter Schrammel, Daniel Kroening
Reachability analysis of dynamical models is a relevant problem that has seen much progress in the last decades, however with clear limitations pertaining to the nature of the dynamics and the soundness of the results. This article focuses on sound safety verification of unbounded-time (infinite-horizon) linear…