Approximating distributions in stochastic learning.
Leen, Todd K; Friel, Robert; Nielsen, David
2012-08-01
On-line machine learning algorithms, many biological spike-timing-dependent plasticity (STDP) learning rules, and stochastic neural dynamics evolve by Markov processes. A complete description of such systems gives the probability densities for the variables. The evolution and equilibrium state of these densities are given by a Chapman-Kolmogorov equation in discrete time, or a master equation in continuous time. These formulations are analytically intractable for most cases of interest, and to make progress a nonlinear Fokker-Planck equation (FPE) is often used in their place. The FPE is limited, and some argue that its application to describe jump processes (such as in these problems) is fundamentally flawed. We develop a well-grounded perturbation expansion that provides approximations for both the density and its moments. The approach is based on the system size expansion in statistical physics (which does not give approximations for the density), but our simple development makes the methods accessible and invites application to diverse problems. We apply the method to calculate the equilibrium distributions for two biologically-observed STDP learning rules and for a simple nonlinear machine-learning problem. In all three examples, we show that our perturbation series provides good agreement with Monte-Carlo simulations in regimes where the FPE breaks down. Copyright © 2012 Elsevier Ltd. All rights reserved.
Trajectory averaging for stochastic approximation MCMC algorithms
Liang, Faming
2010-10-01
The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400-407]. After five decades of continual development, it has developed into an important area in systems control and optimization, and it has also served as a prototype for the development of adaptive algorithms for on-line estimation and control of stochastic systems. Recently, it has been used in statistics with Markov chain Monte Carlo for solving maximum likelihood estimation problems and for general simulation and optimizations. In this paper, we first show that the trajectory averaging estimator is asymptotically efficient for the stochastic approximation MCMC (SAMCMC) algorithm under mild conditions, and then apply this result to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305-320]. The application of the trajectory averaging estimator to other stochastic approximationMCMC algorithms, for example, a stochastic approximation MLE algorithm for missing data problems, is also considered in the paper. © Institute of Mathematical Statistics, 2010.
Approximating stochastic biochemical processes with Wasserstein pseudometrics.
Thorsley, D; Klavins, E
2010-05-01
Modelling stochastic processes inside the cell is difficult due to the size and complexity of the processes being investigated. As a result, new approaches are needed to address the problems of model reduction, parameter estimation, model comparison and model invalidation. Here, the authors propose addressing these problems by using Wasserstein pseudometrics to quantify the differences between processes. The method the authors propose is applicable to any bounded continuous-time stochastic process and pseudometrics between processes are defined only in terms of the available outputs. Algorithms for approximating Wasserstein pseudometrics are developed from experimental or simulation data and demonstrate how to optimise parameter values to minimise the pseudometrics. The approach is illustrated with studies of a stochastic toggle switch and of stochastic gene expression in E. coli.
Approximation methods for stochastic petri nets
Jungnitz, Hauke Joerg
1992-01-01
Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay
Simultaneous perturbation stochastic approximation for tidal models
Altaf, M.U.
2011-05-12
The Dutch continental shelf model (DCSM) is a shallow sea model of entire continental shelf which is used operationally in the Netherlands to forecast the storm surges in the North Sea. The forecasts are necessary to support the decision of the timely closure of the moveable storm surge barriers to protect the land. In this study, an automated model calibration method, simultaneous perturbation stochastic approximation (SPSA) is implemented for tidal calibration of the DCSM. The method uses objective function evaluations to obtain the gradient approximations. The gradient approximation for the central difference method uses only two objective function evaluation independent of the number of parameters being optimized. The calibration parameter in this study is the model bathymetry. A number of calibration experiments is performed. The effectiveness of the algorithm is evaluated in terms of the accuracy of the final results as well as the computational costs required to produce these results. In doing so, comparison is made with a traditional steepest descent method and also with a newly developed proper orthogonal decompositionbased calibration method. The main findings are: (1) The SPSA method gives comparable results to steepest descent method with little computational cost. (2) The SPSA method with little computational cost can be used to estimate large number of parameters.
Convergence Rates of Finite Difference Stochastic Approximation Algorithms
2016-06-01
Chung, On a stochastic approximation method, Annals of Mathematical Statis- tics, 25 (1954), pp. 463-483. 5. R. W. Conway, Some tactical problems in...Dynamic Systems, Kluwer Academic Publishers, Boston, 1991. 18. H. Kesten, Accelerated stochastic approximation, Annals of Mathematical Statistics, 29...1958), pp. 41-59. 19. J. Kiefer and J. Wolfowitz. Stochastic estimation of the maximum of a regression function, Annals of Mathematical Statistics, 23
Page 1 Stochastic approximation algorithms. Overview and recent ...
Indian Academy of Sciences (India)
Control 34:377-397. Puterman M. 1994 Markov decision processes (New York: John Wiley). Rachev S, Ruschendorf L 1995 Probability metrics and recursive algorithms. Adv. Appl. Probab. 27: 770-799. Ripley B 1987 Stochastic simulation (New York: John Wiley). Robbins H, Monro 1951 A stochastic approximation method.
Reinforcement Learning: Stochastic Approximation Algorithms for Markov Decision Processes
Krishnamurthy, Vikram
2015-01-01
This article presents a short and concise description of stochastic approximation algorithms in reinforcement learning of Markov decision processes. The algorithms can also be used as a suboptimal method for partially observed Markov decision processes.
Global Stochastic Properties of Dynamic Models and their Linear Approximations
A.M. Babus (Ana Maria); C.G. de Vries (Casper)
2010-01-01
textabstractThe dynamic properties of micro based stochastic macro models are often analyzed through a linearization around the associated deterministic steady state. Recent literature has investigated the error made by such a deterministic approximation. Complementary to this literature we
Approximate Model Checking of Stochastic COWS
Quaglia, Paola; Schivo, Stefano
2010-01-01
Given the description of a model and a probabilistic formula, approximate model checking is a verification technique based on statistical reasoning that allows answering whether or not the model satisfies the formula. Only a subset of the properties that can be analyzed by exact model checking can
Computing gap free Pareto front approximations with stochastic search algorithms.
Schütze, Oliver; Laumanns, Marco; Tantar, Emilia; Coello, Carlos A Coello; Talbi, El-Ghazali
2010-01-01
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The focus was on obtaining a finite approximation that captures the entire solution set in some suitable sense, which was defined by the concept of epsilon-dominance. Though bounds on the quality of the limit approximation-which are entirely determined by the archiving strategy and the value of epsilon-have been obtained, the strategies do not guarantee to obtain a gap free approximation of the Pareto front. That is, such approximations A can reveal gaps in the sense that points f in the Pareto front can exist such that the distance of f to any image point F(a), a epsilon A, is "large." Since such gap free approximations are desirable in certain applications, and the related archiving strategies can be advantageous when memetic strategies are included in the search process, we are aiming in this work for such methods. We present two novel strategies that accomplish this task in the probabilistic sense and under mild assumptions on the stochastic search algorithm. In addition to the convergence proofs, we give some numerical results to visualize the behavior of the different archiving strategies. Finally, we demonstrate the potential for a possible hybridization of a given stochastic search algorithm with a particular local search strategy-multi-objective continuation methods-by showing that the concept of epsilon-dominance can be integrated into this approach in a suitable way.
Improved stochastic approximation methods for discretized parabolic partial differential equations
Guiaş, Flavius
2016-12-01
We present improvements of the stochastic direct simulation method, a known numerical scheme based on Markov jump processes which is used for approximating solutions of ordinary differential equations. This scheme is suited especially for spatial discretizations of evolution partial differential equations (PDEs). By exploiting the full path simulation of the stochastic method, we use this first approximation as a predictor and construct improved approximations by Picard iterations, Runge-Kutta steps, or a combination. This has as consequence an increased order of convergence. We illustrate the features of the improved method at a standard benchmark problem, a reaction-diffusion equation modeling a combustion process in one space dimension (1D) and two space dimensions (2D).
Approximation scheme based on effective interactions for stochastic gene regulation
Ohkubo, Jun
2010-01-01
Since gene regulatory systems contain sometimes only a small number of molecules, these systems are not described well by macroscopic rate equations; a master equation approach is needed for such cases. We develop an approximation scheme for dealing with the stochasticity of the gene regulatory systems. Using an effective interaction concept, original master equations can be reduced to simpler master equations, which can be solved analytically. We apply the approximation scheme to self-regulating systems with monomer or dimer interactions, and a two-gene system with an exclusive switch. The approximation scheme can recover bistability of the exclusive switch adequately.
Strong and weak approximation of semilinear stochastic evolution equations
Kruse, Raphael
2014-01-01
In this book we analyze the error caused by numerical schemes for the approximation of semilinear stochastic evolution equations (SEEq) in a Hilbert space-valued setting. The numerical schemes considered combine Galerkin finite element methods with Euler-type temporal approximations. Starting from a precise analysis of the spatio-temporal regularity of the mild solution to the SEEq, we derive and prove optimal error estimates of the strong error of convergence in the first part of the book. The second part deals with a new approach to the so-called weak error of convergence, which measures the distance between the law of the numerical solution and the law of the exact solution. This approach is based on Bismut’s integration by parts formula and the Malliavin calculus for infinite dimensional stochastic processes. These techniques are developed and explained in a separate chapter, before the weak convergence is proven for linear SEEq.
On stochastic approximation algorithms for classes of PAC learning problems
Energy Technology Data Exchange (ETDEWEB)
Rao, N.S.V.; Uppuluri, V.R.R.; Oblow, E.M.
1994-03-01
The classical stochastic approximation methods are shown to yield algorithms to solve several formulations of the PAC learning problem defined on the domain [o,1]{sup d}. Under some assumptions on different ability of the probability measure functions, simple algorithms to solve some PAC learning problems are proposed based on networks of non-polynomial units (e.g. artificial neural networks). Conditions on the sizes of these samples required to ensure the error bounds are derived using martingale inequalities.
Use of a linearization approximation facilitating stochastic model building
Svensson, Elin M.; Karlsson, Mats O.
2014-01-01
The objective of this work was to facilitate the development of nonlinear mixed effects models by establishing a diagnostic method for evaluation of stochastic model components. The random effects investigated were between subject, between occasion and residual variability. The method was based on a first-order conditional estimates linear approximation and evaluated on three real datasets with previously developed population pharmacokinetic models. The results were assessed based on the agre...
Numerical approximation of random periodic solutions of stochastic differential equations
Feng, Chunrong; Liu, Yu; Zhao, Huaizhong
2017-10-01
In this paper, we discuss the numerical approximation of random periodic solutions of stochastic differential equations (SDEs) with multiplicative noise. We prove the existence of the random periodic solution as the limit of the pull-back flow when the starting time tends to -∞ along the multiple integrals of the period. As the random periodic solution is not explicitly constructible, it is useful to study the numerical approximation. We discretise the SDE using the Euler-Maruyama scheme and modified Milstein scheme. Subsequently, we obtain the existence of the random periodic solution as the limit of the pull-back of the discretised SDE. We prove that the latter is an approximated random periodic solution with an error to the exact one at the rate of √{Δ t} in the mean square sense in Euler-Maruyama method and Δ t in the Milstein method. We also obtain the weak convergence result for the approximation of the periodic measure.
Validity conditions for moment closure approximations in stochastic chemical kinetics.
Schnoerr, David; Sanguinetti, Guido; Grima, Ramon
2014-08-28
Approximations based on moment-closure (MA) are commonly used to obtain estimates of the mean molecule numbers and of the variance of fluctuations in the number of molecules of chemical systems. The advantage of this approach is that it can be far less computationally expensive than exact stochastic simulations of the chemical master equation. Here, we numerically study the conditions under which the MA equations yield results reflecting the true stochastic dynamics of the system. We show that for bistable and oscillatory chemical systems with deterministic initial conditions, the solution of the MA equations can be interpreted as a valid approximation to the true moments of the chemical master equation, only when the steady-state mean molecule numbers obtained from the chemical master equation fall within a certain finite range. The same validity criterion for monostable systems implies that the steady-state mean molecule numbers obtained from the chemical master equation must be above a certain threshold. For mean molecule numbers outside of this range of validity, the MA equations lead to either qualitatively wrong oscillatory dynamics or to unphysical predictions such as negative variances in the molecule numbers or multiple steady-state moments of the stationary distribution as the initial conditions are varied. Our results clarify the range of validity of the MA approach and show that pitfalls in the interpretation of the results can only be overcome through the systematic comparison of the solutions of the MA equations of a certain order with those of higher orders.
Local Approximation and Hierarchical Methods for Stochastic Optimization
Cheng, Bolong
In this thesis, we present local and hierarchical approximation methods for two classes of stochastic optimization problems: optimal learning and Markov decision processes. For the optimal learning problem class, we introduce a locally linear model with radial basis function for estimating the posterior mean of the unknown objective function. The method uses a compact representation of the function which avoids storing the entire history, as is typically required by nonparametric methods. We derive a knowledge gradient policy with the locally parametric model, which maximizes the expected value of information. We show the policy is asymptotically optimal in theory, and experimental works suggests that the method can reliably find the optimal solution on a range of test functions. For the Markov decision processes problem class, we are motivated by an application where we want to co-optimize a battery for multiple revenue, in particular energy arbitrage and frequency regulation. The nature of this problem requires the battery to make charging and discharging decisions at different time scales while accounting for the stochastic information such as load demand, electricity prices, and regulation signals. Computing the exact optimal policy becomes intractable due to the large state space and the number of time steps. We propose two methods to circumvent the computation bottleneck. First, we propose a nested MDP model that structure the co-optimization problem into smaller sub-problems with reduced state space. This new model allows us to understand how the battery behaves down to the two-second dynamics (that of the frequency regulation market). Second, we introduce a low-rank value function approximation for backward dynamic programming. This new method only requires computing the exact value function for a small subset of the state space and approximate the entire value function via low-rank matrix completion. We test these methods on historical price data from the
Use of a linearization approximation facilitating stochastic model building.
Svensson, Elin M; Karlsson, Mats O
2014-04-01
The objective of this work was to facilitate the development of nonlinear mixed effects models by establishing a diagnostic method for evaluation of stochastic model components. The random effects investigated were between subject, between occasion and residual variability. The method was based on a first-order conditional estimates linear approximation and evaluated on three real datasets with previously developed population pharmacokinetic models. The results were assessed based on the agreement in difference in objective function value between a basic model and extended models for the standard nonlinear and linearized approach respectively. The linearization was found to accurately identify significant extensions of the model's stochastic components with notably decreased runtimes as compared to the standard nonlinear analysis. The observed gain in runtimes varied between four to more than 50-fold and the largest gains were seen for models with originally long runtimes. This method may be especially useful as a screening tool to detect correlations between random effects since it substantially quickens the estimation of large variance-covariance blocks. To expedite the application of this diagnostic tool, the linearization procedure has been automated and implemented in the software package PsN.
Bayesian phylogeny analysis via stochastic approximation Monte Carlo.
Cheon, Sooyoung; Liang, Faming
2009-11-01
Monte Carlo methods have received much attention in the recent literature of phylogeny analysis. However, the conventional Markov chain Monte Carlo algorithms, such as the Metropolis-Hastings algorithm, tend to get trapped in a local mode in simulating from the posterior distribution of phylogenetic trees, rendering the inference ineffective. In this paper, we apply an advanced Monte Carlo algorithm, the stochastic approximation Monte Carlo algorithm, to Bayesian phylogeny analysis. Our method is compared with two popular Bayesian phylogeny software, BAMBE and MrBayes, on simulated and real datasets. The numerical results indicate that our method outperforms BAMBE and MrBayes. Among the three methods, SAMC produces the consensus trees which have the highest similarity to the true trees, and the model parameter estimates which have the smallest mean square errors, but costs the least CPU time.
Bayesian phylogeny analysis via stochastic approximation Monte Carlo
Cheon, Sooyoung
2009-11-01
Monte Carlo methods have received much attention in the recent literature of phylogeny analysis. However, the conventional Markov chain Monte Carlo algorithms, such as the Metropolis-Hastings algorithm, tend to get trapped in a local mode in simulating from the posterior distribution of phylogenetic trees, rendering the inference ineffective. In this paper, we apply an advanced Monte Carlo algorithm, the stochastic approximation Monte Carlo algorithm, to Bayesian phylogeny analysis. Our method is compared with two popular Bayesian phylogeny software, BAMBE and MrBayes, on simulated and real datasets. The numerical results indicate that our method outperforms BAMBE and MrBayes. Among the three methods, SAMC produces the consensus trees which have the highest similarity to the true trees, and the model parameter estimates which have the smallest mean square errors, but costs the least CPU time. © 2009 Elsevier Inc. All rights reserved.
A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem
Wang, Zhen; Du, Donglei; Xu, Dachuan
We present a combinatorial primal-dual 7-approximation algorithm for the k-level stochastic facility location problem, the stochastic counterpart of the standard k-level facility location problem. This approximation ratio is slightly worse than that of the primal-dual 6-approximation for the standard k-level facility location problem [3] because of the extra stochastic assumption. This new result complements the recent non-combinatorial 3-approximation algorithm for the same problem by Wang et al [21].
Cheon, Sooyoung
2013-02-16
Importance sampling and Markov chain Monte Carlo methods have been used in exact inference for contingency tables for a long time, however, their performances are not always very satisfactory. In this paper, we propose a stochastic approximation Monte Carlo importance sampling (SAMCIS) method for tackling this problem. SAMCIS is a combination of adaptive Markov chain Monte Carlo and importance sampling, which employs the stochastic approximation Monte Carlo algorithm (Liang et al., J. Am. Stat. Assoc., 102(477):305-320, 2007) to draw samples from an enlarged reference set with a known Markov basis. Compared to the existing importance sampling and Markov chain Monte Carlo methods, SAMCIS has a few advantages, such as fast convergence, ergodicity, and the ability to achieve a desired proportion of valid tables. The numerical results indicate that SAMCIS can outperform the existing importance sampling and Markov chain Monte Carlo methods: It can produce much more accurate estimates in much shorter CPU time than the existing methods, especially for the tables with high degrees of freedom. © 2013 Springer Science+Business Media New York.
MALDI-TOF Baseline Drift Removal Using Stochastic Bernstein Approximation
Directory of Open Access Journals (Sweden)
Howard Daniel
2006-01-01
Full Text Available Stochastic Bernstein (SB approximation can tackle the problem of baseline drift correction of instrumentation data. This is demonstrated for spectral data: matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF data. Two SB schemes for removing the baseline drift are presented: iterative and direct. Following an explanation of the origin of the MALDI-TOF baseline drift that sheds light on the inherent difficulty of its removal by chemical means, SB baseline drift removal is illustrated for both proteomics and genomics MALDI-TOF data sets. SB is an elegant signal processing method to obtain a numerically straightforward baseline shift removal method as it includes a free parameter that can be optimized for different baseline drift removal applications. Therefore, research that determines putative biomarkers from the spectral data might benefit from a sensitivity analysis to the underlying spectral measurement that is made possible by varying the SB free parameter. This can be manually tuned (for constant or tuned with evolutionary computation (for .
Controlled Nonlinear Stochastic Delay Equations: Part I: Modeling and Approximations
Energy Technology Data Exchange (ETDEWEB)
Kushner, Harold J., E-mail: hjk@dam.brown.edu [Brown University, Applied Math (United States)
2012-08-15
This two-part paper deals with 'foundational' issues that have not been previously considered in the modeling and numerical optimization of nonlinear stochastic delay systems. There are new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. There are two basic and interconnected themes for these models. The first, dealt with in this part, concerns the definition of admissible control. The classical definition of an admissible control as a nonanticipative relaxed control is inadequate for these models and needs to be extended. This is needed for the convergence proofs of numerical approximations for optimal controls as well as to have a well-defined model. It is shown that the new classes of admissible controls do not enlarge the range of the value functions, is closed (together with the associated paths) under weak convergence, and is approximatable by ordinary controls. The second theme, dealt with in Part II, concerns transportation equation representations, and their role in the development of numerical algorithms with much reduced memory and computational requirements.
Longitudinal functional principal component modelling via Stochastic Approximation Monte Carlo
Martinez, Josue G.
2010-06-01
The authors consider the analysis of hierarchical longitudinal functional data based upon a functional principal components approach. In contrast to standard frequentist approaches to selecting the number of principal components, the authors do model averaging using a Bayesian formulation. A relatively straightforward reversible jump Markov Chain Monte Carlo formulation has poor mixing properties and in simulated data often becomes trapped at the wrong number of principal components. In order to overcome this, the authors show how to apply Stochastic Approximation Monte Carlo (SAMC) to this problem, a method that has the potential to explore the entire space and does not become trapped in local extrema. The combination of reversible jump methods and SAMC in hierarchical longitudinal functional data is simplified by a polar coordinate representation of the principal components. The approach is easy to implement and does well in simulated data in determining the distribution of the number of principal components, and in terms of its frequentist estimation properties. Empirical applications are also presented.
Directory of Open Access Journals (Sweden)
Mourad Kerboua
2014-12-01
Full Text Available We introduce a new notion called fractional stochastic nonlocal condition, and then we study approximate controllability of class of fractional stochastic nonlinear differential equations of Sobolev type in Hilbert spaces. We use Hölder's inequality, fixed point technique, fractional calculus, stochastic analysis and methods adopted directly from deterministic control problems for the main results. A new set of sufficient conditions is formulated and proved for the fractional stochastic control system to be approximately controllable. An example is given to illustrate the abstract results.
Stochastic mean payoff games: smoothed analysis and approximation schemes
Boros, Endre; Elbassioni, Khaled; Fouz, Mahmoud; Gurvich, Vladimir; Makino, Kazuhisa; Manthey, Bodo; Aceto, L.; Henzinger, M.; Sgall, J.
2011-01-01
In this paper, we consider two-player zero-sum stochastic mean payoff games with perfect information modeled by a digraph with black, white, and random vertices. These BWR-games games are polynomially equivalent with the classical Gillette games, which include many well-known subclasses, such as
Stochastic Approximations and Monotonicity of a Single Server Feedback Retrial Queue
Directory of Open Access Journals (Sweden)
Mohamed Boualem
2012-01-01
Full Text Available This paper focuses on stochastic comparison of the Markov chains to derive some qualitative approximations for an M/G/1 retrial queue with a Bernoulli feedback. The main objective is to use stochastic ordering techniques to establish various monotonicity results with respect to arrival rates, service time distributions, and retrial parameters.
Amalina Nisa Ariffin, Noor; Rosli, Norhayati; Syahidatul Ayuni Mazlan, Mazma; Samsudin, Adam
2017-09-01
Recently, modelling the biological systems by using stochastic differential equations (SDEs) are becoming an interest among researchers. In SDEs the random fluctuations are taking into account, which resulting to the complexity of finding the exact solution of SDEs and contribute to the increasing number of research focusing in finding the best numerical approach to solve the systems of SDEs. This paper will examine the performance of 4-stage stochastic Runge-Kutta (SRK4) and specific stochastic Runge-Kutta (SRKS) methods with order 1.5 in approximating the solution of stochastic model in biological system. A comparative study of SRK4 and SRKS method will be presented in this paper. The non-linear biological model will be used to examine the performance of both methods and the result of numerical experiment will be discussed.
Distributed Stochastic Approximation for Constrained and Unconstrained Optimization
Bianchi, Pascal
2011-01-01
In this paper, we analyze the convergence of a distributed Robbins-Monro algorithm for both constrained and unconstrained optimization in multi-agent systems. The algorithm searches local minima of a (nonconvex) objective function which is supposed to coincide with a sum of local utility functions of the agents. The algorithm under study consists of two steps: a local stochastic gradient descent at each agent and a gossip step that drives the network of agents to a consensus. It is proved that i) an agreement is achieved between agents on the value of the estimate, ii) the algorithm converges to the set of Kuhn-Tucker points of the optimization problem. The proof relies on recent results about differential inclusions. In the context of unconstrained optimization, intelligible sufficient conditions are provided in order to ensure the stability of the algorithm. In the latter case, we also provide a central limit theorem which governs the asymptotic fluctuations of the estimate. We illustrate our results in the...
Directory of Open Access Journals (Sweden)
Meili Li
2015-01-01
Full Text Available The approximate controllability of semilinear neutral stochastic integrodifferential inclusions with infinite delay in an abstract space is studied. Sufficient conditions are established for the approximate controllability. The results are obtained by using the theory of analytic resolvent operator, the fractional power theory, and the theorem of nonlinear alternative for Kakutani maps. Finally, an example is provided to illustrate the theory.
Relative entropy minimizing noisy non-linear neural network to approximate stochastic processes.
Galtier, Mathieu N; Marini, Camille; Wainrib, Gilles; Jaeger, Herbert
2014-08-01
A method is provided for designing and training noise-driven recurrent neural networks as models of stochastic processes. The method unifies and generalizes two known separate modeling approaches, Echo State Networks (ESN) and Linear Inverse Modeling (LIM), under the common principle of relative entropy minimization. The power of the new method is demonstrated on a stochastic approximation of the El Niño phenomenon studied in climate research. Copyright © 2014 Elsevier Ltd. All rights reserved.
Fitting Social Network Models Using Varying Truncation Stochastic Approximation MCMC Algorithm
Jin, Ick Hoon
2013-10-01
The exponential random graph model (ERGM) plays a major role in social network analysis. However, parameter estimation for the ERGM is a hard problem due to the intractability of its normalizing constant and the model degeneracy. The existing algorithms, such as Monte Carlo maximum likelihood estimation (MCMLE) and stochastic approximation, often fail for this problem in the presence of model degeneracy. In this article, we introduce the varying truncation stochastic approximation Markov chain Monte Carlo (SAMCMC) algorithm to tackle this problem. The varying truncation mechanism enables the algorithm to choose an appropriate starting point and an appropriate gain factor sequence, and thus to produce a reasonable parameter estimate for the ERGM even in the presence of model degeneracy. The numerical results indicate that the varying truncation SAMCMC algorithm can significantly outperform the MCMLE and stochastic approximation algorithms: for degenerate ERGMs, MCMLE and stochastic approximation often fail to produce any reasonable parameter estimates, while SAMCMC can do; for nondegenerate ERGMs, SAMCMC can work as well as or better than MCMLE and stochastic approximation. The data and source codes used for this article are available online as supplementary materials. © 2013 American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America.
Schmidt, Deena R; Thomas, Peter J
2014-04-17
Mathematical models of cellular physiological mechanisms often involve random walks on graphs representing transitions within networks of functional states. Schmandt and Galán recently introduced a novel stochastic shielding approximation as a fast, accurate method for generating approximate sample paths from a finite state Markov process in which only a subset of states are observable. For example, in ion-channel models, such as the Hodgkin-Huxley or other conductance-based neural models, a nerve cell has a population of ion channels whose states comprise the nodes of a graph, only some of which allow a transmembrane current to pass. The stochastic shielding approximation consists of neglecting fluctuations in the dynamics associated with edges in the graph not directly affecting the observable states. We consider the problem of finding the optimal complexity reducing mapping from a stochastic process on a graph to an approximate process on a smaller sample space, as determined by the choice of a particular linear measurement functional on the graph. The partitioning of ion-channel states into conducting versus nonconducting states provides a case in point. In addition to establishing that Schmandt and Galán's approximation is in fact optimal in a specific sense, we use recent results from random matrix theory to provide heuristic error estimates for the accuracy of the stochastic shielding approximation for an ensemble of random graphs. Moreover, we provide a novel quantitative measure of the contribution of individual transitions within the reaction graph to the accuracy of the approximate process.
Stochastic model simulation using Kronecker product analysis and Zassenhaus formula approximation.
Caglar, Mehmet Umut; Pal, Ranadip
2013-01-01
Probabilistic Models are regularly applied in Genetic Regulatory Network modeling to capture the stochastic behavior observed in the generation of biological entities such as mRNA or proteins. Several approaches including Stochastic Master Equations and Probabilistic Boolean Networks have been proposed to model the stochastic behavior in genetic regulatory networks. It is generally accepted that Stochastic Master Equation is a fundamental model that can describe the system being investigated in fine detail, but the application of this model is computationally enormously expensive. On the other hand, Probabilistic Boolean Network captures only the coarse-scale stochastic properties of the system without modeling the detailed interactions. We propose a new approximation of the stochastic master equation model that is able to capture the finer details of the modeled system including bistabilities and oscillatory behavior, and yet has a significantly lower computational complexity. In this new method, we represent the system using tensors and derive an identity to exploit the sparse connectivity of regulatory targets for complexity reduction. The algorithm involves an approximation based on Zassenhaus formula to represent the exponential of a sum of matrices as product of matrices. We derive upper bounds on the expected error of the proposed model distribution as compared to the stochastic master equation model distribution. Simulation results of the application of the model to four different biological benchmark systems illustrate performance comparable to detailed stochastic master equation models but with considerably lower computational complexity. The results also demonstrate the reduced complexity of the new approach as compared to commonly used Stochastic Simulation Algorithm for equivalent accuracy.
Hutzenthaler, Martin
2015-01-01
Many stochastic differential equations (SDEs) in the literature have a superlinearly growing nonlinearity in their drift or diffusion coefficient. Unfortunately, moments of the computationally efficient Euler-Maruyama approximation method diverge for these SDEs in finite time. This article develops a general theory based on rare events for studying integrability properties such as moment bounds for discrete-time stochastic processes. Using this approach, the authors establish moment bounds for fully and partially drift-implicit Euler methods and for a class of new explicit approximation method
Approximation and inference methods for stochastic biochemical kinetics—a tutorial review
Schnoerr, David; Sanguinetti, Guido; Grima, Ramon
2017-03-01
Stochastic fluctuations of molecule numbers are ubiquitous in biological systems. Important examples include gene expression and enzymatic processes in living cells. Such systems are typically modelled as chemical reaction networks whose dynamics are governed by the chemical master equation. Despite its simple structure, no analytic solutions to the chemical master equation are known for most systems. Moreover, stochastic simulations are computationally expensive, making systematic analysis and statistical inference a challenging task. Consequently, significant effort has been spent in recent decades on the development of efficient approximation and inference methods. This article gives an introduction to basic modelling concepts as well as an overview of state of the art methods. First, we motivate and introduce deterministic and stochastic methods for modelling chemical networks, and give an overview of simulation and exact solution methods. Next, we discuss several approximation methods, including the chemical Langevin equation, the system size expansion, moment closure approximations, time-scale separation approximations and hybrid methods. We discuss their various properties and review recent advances and remaining challenges for these methods. We present a comparison of several of these methods by means of a numerical case study and highlight some of their respective advantages and disadvantages. Finally, we discuss the problem of inference from experimental data in the Bayesian framework and review recent methods developed the literature. In summary, this review gives a self-contained introduction to modelling, approximations and inference methods for stochastic chemical kinetics.
Approximation and inference methods for stochastic biochemical kinetics - a tutorial review
Schnoerr, David; Grima, Ramon
2016-01-01
Stochastic fluctuations of molecule numbers are ubiquitous in biological systems. Important examples include gene expression and enzymatic processes in living cells. Such systems are typically modelled as chemical reaction networks whose dynamics are governed by the Chemical Master Equation. Despite its simple structure, no analytic solutions to the Chemical Master Equation are known for most systems. Moreover, stochastic simulations are computationally expensive, making systematic analysis and statistical inference a challenging task. Consequently, significant effort has been spent in recent decades on the development of efficient approximation and inference methods. This article gives an introduction to basic modelling concepts as well as an overview of state of the art methods. First, we motivate and introduce deterministic and stochastic models for chemical networks, and give an overview of simulation and exact solution methods. Next, we discuss several approximation methods, including the chemical Langev...
Yosida approximations of stochastic differential equations in infinite dimensions and applications
Govindan, T E
2016-01-01
This research monograph brings together, for the first time, the varied literature on Yosida approximations of stochastic differential equations (SDEs) in infinite dimensions and their applications into a single cohesive work. The author provides a clear and systematic introduction to the Yosida approximation method and justifies its power by presenting its applications in some practical topics such as stochastic stability and stochastic optimal control. The theory assimilated spans more than 35 years of mathematics, but is developed slowly and methodically in digestible pieces. The book begins with a motivational chapter that introduces the reader to several different models that play recurring roles throughout the book as the theory is unfolded, and invites readers from different disciplines to see immediately that the effort required to work through the theory that follows is worthwhile. From there, the author presents the necessary prerequisite material, and then launches the reader into the main discussi...
Indian Academy of Sciences (India)
IAS Admin
RESONANCE | December 2013. Herbert Robbins. Courtesy: Wikipedia. * T Z Lai and D Siegmund, The Contributions of Herbert Robbins to Mathematical Statistics, Statistical Science,. 1(2), pp.276–284, May 1986. The problem that motivated Robbins and Monro was that of finding the root of a nonlinear function given its.
An approximation algorithm for a facility location problem with stochastic demands
Bumb, A.F.; van Ommeren, Jan C.W.
2004-01-01
In this article we propose, for any $\\epsilon>0$, a $2(1+\\epsilon)$-approximation algorithm for a facility location problem with stochastic demands. This problem can be described as follows. There are a number of locations, where facilities may be opened and a number of demand points, where requests
An approximation algorithm for a facility location problem with stochastic demands and inventories
Gabor, A.F.; van Ommeren, Jan C.W.
2006-01-01
We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating
An approximation algorithm for a facility location problem with inventories and stochastic demands
Bumb, A.F.; van Ommeren, Jan C.W.; Megiddo, N.; Xu, Y.; Zhu, B.
2005-01-01
In this article we propose, for any $\\varepsilon$ > 0, a 2(1 + $\\varepsilon$)-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. The
2014-01-01
Mathematical models of cellular physiological mechanisms often involve random walks on graphs representing transitions within networks of functional states. Schmandt and Galán recently introduced a novel stochastic shielding approximation as a fast, accurate method for generating approximate sample paths from a finite state Markov process in which only a subset of states are observable. For example, in ion-channel models, such as the Hodgkin–Huxley or other conductance-based neural models, a nerve cell has a population of ion channels whose states comprise the nodes of a graph, only some of which allow a transmembrane current to pass. The stochastic shielding approximation consists of neglecting fluctuations in the dynamics associated with edges in the graph not directly affecting the observable states. We consider the problem of finding the optimal complexity reducing mapping from a stochastic process on a graph to an approximate process on a smaller sample space, as determined by the choice of a particular linear measurement functional on the graph. The partitioning of ion-channel states into conducting versus nonconducting states provides a case in point. In addition to establishing that Schmandt and Galán’s approximation is in fact optimal in a specific sense, we use recent results from random matrix theory to provide heuristic error estimates for the accuracy of the stochastic shielding approximation for an ensemble of random graphs. Moreover, we provide a novel quantitative measure of the contribution of individual transitions within the reaction graph to the accuracy of the approximate process. PMID:24742077
Directory of Open Access Journals (Sweden)
Yanli Zhou
2013-01-01
Full Text Available Stochastic delay differential equations with jumps have a wide range of applications, particularly, in mathematical finance. Solution of the underlying initial value problems is important for the understanding and control of many phenomena and systems in the real world. In this paper, we construct a robust Taylor approximation scheme and then examine the convergence of the method in a weak sense. A convergence theorem for the scheme is established and proved. Our analysis and numerical examples show that the proposed scheme of high order is effective and efficient for Monte Carlo simulations for jump-diffusion stochastic delay differential equations.
Liang, Faming
2014-04-03
Simulated annealing has been widely used in the solution of optimization problems. As known by many researchers, the global optima cannot be guaranteed to be located by simulated annealing unless a logarithmic cooling schedule is used. However, the logarithmic cooling schedule is so slow that no one can afford to use this much CPU time. This article proposes a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo algorithm. Under the framework of stochastic approximation, it is shown that the new algorithm can work with a cooling schedule in which the temperature can decrease much faster than in the logarithmic cooling schedule, for example, a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural network training and protein-folding. The numerical results indicate that the new algorithm can significantly outperform simulated annealing and other competitors. Supplementary materials for this article are available online.
Energy Technology Data Exchange (ETDEWEB)
Kushner, Harold J., E-mail: hjk@dam.brown.edu [Brown University, Applied Math (United States)
2012-08-15
This is the second part of a work dealing with key issues that have not been addressed in the modeling and numerical optimization of nonlinear stochastic delay systems. We consider new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. Part I was concerned with issues concerning the class of admissible controls and their approximations, since the classical definitions are inadequate for our models. This part is concerned with transportation equation representations and their approximations. Such representations of nonlinear stochastic delay models have been crucial in the development of numerical algorithms with much reduced memory and computational requirements. The representations for the new models are not obvious and are developed. They also provide a template for the adaptation of the Markov chain approximation numerical methods.
Liu, Jie; Sun, Xingsheng; Han, Xu; Jiang, Chao; Yu, Dejie
2015-05-01
Based on the Gegenbauer polynomial expansion theory and regularization method, an analytical method is proposed to identify dynamic loads acting on stochastic structures. Dynamic loads are expressed as functions of time and random parameters in time domain and the forward model of dynamic load identification is established through the discretized convolution integral of loads and the corresponding unit-pulse response functions of system. Random parameters are approximated through the random variables with λ-probability density function (PDFs) or their derivative PDFs. For this kind of random variables, Gegenbauer polynomial expansion is the unique correct choice to transform the problem of load identification for a stochastic structure into its equivalent deterministic system. Just via its equivalent deterministic system, the load identification problem of a stochastic structure can be solved by any available deterministic methods. With measured responses containing noise, the improved regularization operator is adopted to overcome the ill-posedness of load reconstruction and to obtain the stable and approximate solutions of certain inverse problems and the valid assessments of the statistics of identified loads. Numerical simulations demonstrate that with regard to stochastic structures, the identification and assessment of dynamic loads are achieved steadily and effectively by the presented method.
Classification in postural style based on stochastic process modeling.
Denis, Christophe
2014-01-01
We address the statistical challenge of classifying subjects as hemiplegic, vestibular or normal based on complex trajectories obtained through two experimental protocols designed to evaluate potential deficits in postural control. The classification procedure involves a dimension reduction step where the complex trajectories are summarized by finite-dimensional summary measures based on a stochastic process model for a real-valued trajectory. This allows us to retrieve from the trajectories information relative to their temporal dynamic. A leave-one-out evaluation yields a 79% performance of correct classification for a total of n=70 subjects, with 22 hemiplegic (31%), 16 vestibular (23%) and 32 normal (46%) subjects.
Annealing evolutionary stochastic approximation Monte Carlo for global optimization
Liang, Faming
2010-04-08
In this paper, we propose a new algorithm, the so-called annealing evolutionary stochastic approximation Monte Carlo (AESAMC) algorithm as a general optimization technique, and study its convergence. AESAMC possesses a self-adjusting mechanism, whose target distribution can be adapted at each iteration according to the current samples. Thus, AESAMC falls into the class of adaptive Monte Carlo methods. This mechanism also makes AESAMC less trapped by local energy minima than nonadaptive MCMC algorithms. Under mild conditions, we show that AESAMC can converge weakly toward a neighboring set of global minima in the space of energy. AESAMC is tested on multiple optimization problems. The numerical results indicate that AESAMC can potentially outperform simulated annealing, the genetic algorithm, annealing stochastic approximation Monte Carlo, and some other metaheuristics in function optimization. © 2010 Springer Science+Business Media, LLC.
Transport of radionuclides in stochastic media. Pt. 1: The quasi-asymptotic approximation
Energy Technology Data Exchange (ETDEWEB)
Devooght, J.; Smidts, O.F. [Universite Libre de Bruxelles (Belgium). Service de Metrologie Nucleaire
1996-04-01
A three-dimensional quasi-asymptotic approximate equation is developed for the transport of radionuclides in a stochastic velocity field. This approximation is derived from an integro-differential equation of transport in stochastic media, commonly encountered in hydrogeology. The quasi-asymptotic equation turns out to be a generalised Telegrapher`s equation as found by Williams in the particular context of fractured media. We obtain the Telegrapher`s equation without specifying the causes responsible for the random velocity field. Our model may thus be applied in porous media as well as in fractured media. We give the developments leading to the analytical solution of the three-dimensional Telegrapher`s equation for constant parameters. This solution is then visualised for a source in the form of a square wave. (Author).
Wu, Fuke; Tian, Tianhai; Rawlings, James B; Yin, George
2016-05-07
The frequently used reduction technique is based on the chemical master equation for stochastic chemical kinetics with two-time scales, which yields the modified stochastic simulation algorithm (SSA). For the chemical reaction processes involving a large number of molecular species and reactions, the collection of slow reactions may still include a large number of molecular species and reactions. Consequently, the SSA is still computationally expensive. Because the chemical Langevin equations (CLEs) can effectively work for a large number of molecular species and reactions, this paper develops a reduction method based on the CLE by the stochastic averaging principle developed in the work of Khasminskii and Yin [SIAM J. Appl. Math. 56, 1766-1793 (1996); ibid. 56, 1794-1819 (1996)] to average out the fast-reacting variables. This reduction method leads to a limit averaging system, which is an approximation of the slow reactions. Because in the stochastic chemical kinetics, the CLE is seen as the approximation of the SSA, the limit averaging system can be treated as the approximation of the slow reactions. As an application, we examine the reduction of computation complexity for the gene regulatory networks with two-time scales driven by intrinsic noise. For linear and nonlinear protein production functions, the simulations show that the sample average (expectation) of the limit averaging system is close to that of the slow-reaction process based on the SSA. It demonstrates that the limit averaging system is an efficient approximation of the slow-reaction process in the sense of the weak convergence.
Picard Approximation of Stochastic Differential Equations and Application to LIBOR Models
DEFF Research Database (Denmark)
Papapantoleon, Antonis; Skovmand, David
The aim of this work is to provide fast and accurate approximation schemes for the Monte Carlo pricing of derivatives in LIBOR market models. Standard methods can be applied to solve the stochastic differential equations of the successive LIBOR rates but the methods are generally slow. Our...... exponential to quadratic using truncated expansions of the product terms. We include numerical illustrations of the accuracy and speed of our method pricing caplets, swaptions and forward rate agreements....
Approximate Dual Averaging Method for Multiagent Saddle-Point Problems with Stochastic Subgradients
Directory of Open Access Journals (Sweden)
Deming Yuan
2014-01-01
Full Text Available This paper considers the problem of solving the saddle-point problem over a network, which consists of multiple interacting agents. The global objective function of the problem is a combination of local convex-concave functions, each of which is only available to one agent. Our main focus is on the case where the projection steps are calculated approximately and the subgradients are corrupted by some stochastic noises. We propose an approximate version of the standard dual averaging method and show that the standard convergence rate is preserved, provided that the projection errors decrease at some appropriate rate and the noises are zero-mean and have bounded variance.
A Numerical Approximation Framework for the Stochastic Linear Quadratic Regulator on Hilbert Spaces
Energy Technology Data Exchange (ETDEWEB)
Levajković, Tijana, E-mail: tijana.levajkovic@uibk.ac.at, E-mail: t.levajkovic@sf.bg.ac.rs; Mena, Hermann, E-mail: hermann.mena@uibk.ac.at [University of Innsbruck, Department of Mathematics (Austria); Tuffaha, Amjad, E-mail: atufaha@aus.edu [American University of Sharjah, Department of Mathematics (United Arab Emirates)
2017-06-15
We present an approximation framework for computing the solution of the stochastic linear quadratic control problem on Hilbert spaces. We focus on the finite horizon case and the related differential Riccati equations (DREs). Our approximation framework is concerned with the so-called “singular estimate control systems” (Lasiecka in Optimal control problems and Riccati equations for systems with unbounded controls and partially analytic generators: applications to boundary and point control problems, 2004) which model certain coupled systems of parabolic/hyperbolic mixed partial differential equations with boundary or point control. We prove that the solutions of the approximate finite-dimensional DREs converge to the solution of the infinite-dimensional DRE. In addition, we prove that the optimal state and control of the approximate finite-dimensional problem converge to the optimal state and control of the corresponding infinite-dimensional problem.
On the optimal polynomial approximation of stochastic PDEs by galerkin and collocation methods
Beck, Joakim
2012-09-01
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with stochastic coefficients. The problem is rewritten as a parametric PDE and the functional dependence of the solution on the parameters is approximated by multivariate polynomials. We first consider the stochastic Galerkin method, and rely on sharp estimates for the decay of the Fourier coefficients of the spectral expansion of u on an orthogonal polynomial basis to build a sequence of polynomial subspaces that features better convergence properties, in terms of error versus number of degrees of freedom, than standard choices such as Total Degree or Tensor Product subspaces. We consider then the Stochastic Collocation method, and use the previous estimates to introduce a new class of Sparse Grids, based on the idea of selecting a priori the most profitable hierarchical surpluses, that, again, features better convergence properties compared to standard Smolyak or tensor product grids. Numerical results show the effectiveness of the newly introduced polynomial spaces and sparse grids. © 2012 World Scientific Publishing Company.
Sanz, Luis; Alonso, Juan Antonio
2017-12-01
In this work we develop approximate aggregation techniques in the context of slow-fast linear population models governed by stochastic differential equations and apply the results to the treatment of populations with spatial heterogeneity. Approximate aggregation techniques allow one to transform a complex system involving many coupled variables and in which there are processes with different time scales, by a simpler reduced model with a fewer number of 'global' variables, in such a way that the dynamics of the former can be approximated by that of the latter. In our model we contemplate a linear fast deterministic process together with a linear slow process in which the parameters are affected by additive noise, and give conditions for the solutions corresponding to positive initial conditions to remain positive for all times. By letting the fast process reach equilibrium we build a reduced system with a lesser number of variables, and provide results relating the asymptotic behaviour of the first- and second-order moments of the population vector for the original and the reduced system. The general technique is illustrated by analysing a multiregional stochastic system in which dispersal is deterministic and the rate growth of the populations in each patch is affected by additive noise.
Gaussian and Affine Approximation of Stochastic Diffusion Models for Interest and Mortality Rates
Directory of Open Access Journals (Sweden)
Marcus C. Christiansen
2013-10-01
Full Text Available In the actuarial literature, it has become common practice to model future capital returns and mortality rates stochastically in order to capture market risk and forecasting risk. Although interest rates often should and mortality rates always have to be non-negative, many authors use stochastic diffusion models with an affine drift term and additive noise. As a result, the diffusion process is Gaussian and, thus, analytically tractable, but negative values occur with positive probability. The argument is that the class of Gaussian diffusions would be a good approximation of the real future development. We challenge that reasoning and study the asymptotics of diffusion processes with affine drift and a general noise term with corresponding diffusion processes with an affine drift term and an affine noise term or additive noise. Our study helps to quantify the error that is made by approximating diffusive interest and mortality rate models with Gaussian diffusions and affine diffusions. In particular, we discuss forward interest and forward mortality rates and the error that approximations cause on the valuation of life insurance claims.
Stochastic Optimization of Economic Dispatch for Microgrid Based on Approximate Dynamic Programming
DEFF Research Database (Denmark)
Shuai, Hang; Fang, Jiakun; Ai, Xiaomeng
2018-01-01
This paper proposes an approximate dynamic programming (ADP) based approach for the economic dispatch (ED) of microgrid with distributed generations (DGs). The time-variant renewable generation, electricity price and the power demand are considered as stochastic variables in this work. An ADP based...... of historical prediction error distribution to reduce the influence of inaccurate forecast on the system operation. Numerical simulations demonstrate the effectiveness of the proposed approach. The near-optimal decision obtained by ADPED is very close to the global optimality. And it can be adaptive to both day...
On the use of stochastic approximation Monte Carlo for Monte Carlo integration
Liang, Faming
2009-03-01
The stochastic approximation Monte Carlo (SAMC) algorithm has recently been proposed as a dynamic optimization algorithm in the literature. In this paper, we show in theory that the samples generated by SAMC can be used for Monte Carlo integration via a dynamically weighted estimator by calling some results from the literature of nonhomogeneous Markov chains. Our numerical results indicate that SAMC can yield significant savings over conventional Monte Carlo algorithms, such as the Metropolis-Hastings algorithm, for the problems for which the energy landscape is rugged. © 2008 Elsevier B.V. All rights reserved.
Renewal-process approximation of a stochastic threshold model for electrical neural stimulation.
Bruce, I C; Irlicht, L S; White, M W; O'Leary, S J; Clark, G M
2000-01-01
In a recent set of modeling studies we have developed a stochastic threshold model of auditory nerve response to single biphasic electrical pulses (Bruce et al., 1999c) and moderate rate (less than 800 pulses per second) pulse trains (Bruce et al., 1999a). In this article we derive an analytical approximation for the single-pulse model, which is then extended to describe the pulse-train model in the case of evenly timed, uniform pulses. This renewal-process description provides an accurate and computationally efficient model of electrical stimulation of single auditory nerve fibers by a cochlear implant that may be extended to other forms of electrical neural stimulation.
Chkifa, Abdellah
2015-04-08
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that in the univariate case, the least-squares method is quasi-optimal in expectation in [A. Cohen, M A. Davenport and D. Leviatan. Found. Comput. Math. 13 (2013) 819–834] and in probability in [G. Migliorati, F. Nobile, E. von Schwerin, R. Tempone, Found. Comput. Math. 14 (2014) 419–456], under suitable conditions that relate the number of samples with respect to the dimension of the polynomial space. Here “quasi-optimal” means that the accuracy of the least-squares approximation is comparable with that of the best approximation in the given polynomial space. In this paper, we discuss the quasi-optimality of the polynomial least-squares method in arbitrary dimension. Our analysis applies to any arbitrary multivariate polynomial space (including tensor product, total degree or hyperbolic crosses), under the minimal requirement that its associated index set is downward closed. The optimality criterion only involves the relation between the number of samples and the dimension of the polynomial space, independently of the anisotropic shape and of the number of variables. We extend our results to the approximation of Hilbert space-valued functions in order to apply them to the approximation of parametric and stochastic elliptic PDEs. As a particular case, we discuss “inclusion type” elliptic PDE models, and derive an exponential convergence estimate for the least-squares method. Numerical results confirm our estimate, yet pointing out a gap between the condition necessary to achieve optimality in the theory, and the condition that in practice yields the optimal convergence rate.
Hall, Eric Joseph
2016-12-08
We derive computable error estimates for finite element approximations of linear elliptic partial differential equations with rough stochastic coefficients. In this setting, the exact solutions contain high frequency content that standard a posteriori error estimates fail to capture. We propose goal-oriented estimates, based on local error indicators, for the pathwise Galerkin and expected quadrature errors committed in standard, continuous, piecewise linear finite element approximations. Derived using easily validated assumptions, these novel estimates can be computed at a relatively low cost and have applications to subsurface flow problems in geophysics where the conductivities are assumed to have lognormal distributions with low regularity. Our theory is supported by numerical experiments on test problems in one and two dimensions.
A Resampling-Based Stochastic Approximation Method for Analysis of Large Geostatistical Data
Liang, Faming
2013-03-01
The Gaussian geostatistical model has been widely used in modeling of spatial data. However, it is challenging to computationally implement this method because it requires the inversion of a large covariance matrix, particularly when there is a large number of observations. This article proposes a resampling-based stochastic approximation method to address this challenge. At each iteration of the proposed method, a small subsample is drawn from the full dataset, and then the current estimate of the parameters is updated accordingly under the framework of stochastic approximation. Since the proposed method makes use of only a small proportion of the data at each iteration, it avoids inverting large covariance matrices and thus is scalable to large datasets. The proposed method also leads to a general parameter estimation approach, maximum mean log-likelihood estimation, which includes the popular maximum (log)-likelihood estimation (MLE) approach as a special case and is expected to play an important role in analyzing large datasets. Under mild conditions, it is shown that the estimator resulting from the proposed method converges in probability to a set of parameter values of equivalent Gaussian probability measures, and that the estimator is asymptotically normally distributed. To the best of the authors\\' knowledge, the present study is the first one on asymptotic normality under infill asymptotics for general covariance functions. The proposed method is illustrated with large datasets, both simulated and real. Supplementary materials for this article are available online. © 2013 American Statistical Association.
Weiss mean-field approximation for multicomponent stochastic spatially extended systems
Kurushina, Svetlana E.; Maximov, Valerii V.; Romanovskii, Yurii M.
2014-08-01
We develop a mean-field approach for multicomponent stochastic spatially extended systems and use it to obtain a multivariate nonlinear self-consistent Fokker-Planck equation defining the probability density of the state of the system, which describes a well-known model of autocatalytic chemical reaction (brusselator) with spatially correlated multiplicative noise, and to study the evolution of probability density and statistical characteristics of the system in the process of spatial pattern formation. We propose the finite-difference method for the numerical solving of a general class of multivariate nonlinear self-consistent time-dependent Fokker-Planck equations. We illustrate the accuracy and reliability of the method by applying it to an exactly solvable nonlinear Fokker-Planck equation (NFPE) for the Shimizu-Yamada model [Prog. Theor. Phys. 47, 350 (1972), 10.1143/PTP.47.350] and nonlinear Fokker-Planck equation [Desai and Zwanzig, J. Stat. Phys. 19, 1 (1978), 10.1007/BF01020331] obtained for a nonlinear stochastic mean-field model introduced by Kometani and Shimizu [J. Stat. Phys. 13, 473 (1975), 10.1007/BF01013146]. Taking the problems indicated above as an example, the accuracy of the method is compared with the accuracy of Hermite distributed approximating functional method [Zhang et al., Phys. Rev. E 56, 1197 (1997), 10.1103/PhysRevE.56.1197]. Numerical study of the NFPE solutions for a stochastic brusselator shows that in the region of Turing bifurcation several types of solutions exist if noise intensity increases: unimodal solution, transient bimodality, and an interesting solution which involves multiple "repumping" of probability density through bimodality. Additionally, we study the behavior of the order parameter of the system under consideration and show that the second type of solution arises in the supercritical region if noise intensity values are close to the values appropriate for the transition from bimodal stationary probability density
Comparison of different moment-closure approximations for stochastic chemical kinetics
Schnoerr, David; Sanguinetti, Guido; Grima, Ramon
2015-11-01
In recent years, moment-closure approximations (MAs) of the chemical master equation have become a popular method for the study of stochastic effects in chemical reaction systems. Several different MA methods have been proposed and applied in the literature, but it remains unclear how they perform with respect to each other. In this paper, we study the normal, Poisson, log-normal, and central-moment-neglect MAs by applying them to understand the stochastic properties of chemical systems whose deterministic rate equations show the properties of bistability, ultrasensitivity, and oscillatory behaviour. Our results suggest that the normal MA is favourable over the other studied MAs. In particular, we found that (i) the size of the region of parameter space where a closure gives physically meaningful results, e.g., positive mean and variance, is considerably larger for the normal closure than for the other three closures, (ii) the accuracy of the predictions of the four closures (relative to simulations using the stochastic simulation algorithm) is comparable in those regions of parameter space where all closures give physically meaningful results, and (iii) the Poisson and log-normal MAs are not uniquely defined for systems involving conservation laws in molecule numbers. We also describe the new software package MOCA which enables the automated numerical analysis of various MA methods in a graphical user interface and which was used to perform the comparative analysis presented in this paper. MOCA allows the user to develop novel closure methods and can treat polynomial, non-polynomial, as well as time-dependent propensity functions, thus being applicable to virtually any chemical reaction system.
Directory of Open Access Journals (Sweden)
Wang Yajun
2008-12-01
Full Text Available In order to address the complex uncertainties caused by interfacing between the fuzziness and randomness of the safety problem for embankment engineering projects, and to evaluate the safety of embankment engineering projects more scientifically and reasonably, this study presents the fuzzy logic modeling of the stochastic finite element method (SFEM based on the harmonious finite element (HFE technique using a first-order approximation theorem. Fuzzy mathematical models of safety repertories were introduced into the SFEM to analyze the stability of embankments and foundations in order to describe the fuzzy failure procedure for the random safety performance function. The fuzzy models were developed with membership functions with half depressed gamma distribution, half depressed normal distribution, and half depressed echelon distribution. The fuzzy stochastic mathematical algorithm was used to comprehensively study the local failure mechanism of the main embankment section near Jingnan in the Yangtze River in terms of numerical analysis for the probability integration of reliability on the random field affected by three fuzzy factors. The result shows that the middle region of the embankment is the principal zone of concentrated failure due to local fractures. There is also some local shear failure on the embankment crust. This study provides a referential method for solving complex multi-uncertainty problems in engineering safety analysis.
Kypraios, Theodore; Neal, Peter; Prangle, Dennis
2017-05-01
Likelihood-based inference for disease outbreak data can be very challenging due to the inherent dependence of the data and the fact that they are usually incomplete. In this paper we review recent Approximate Bayesian Computation (ABC) methods for the analysis of such data by fitting to them stochastic epidemic models without having to calculate the likelihood of the observed data. We consider both non-temporal and temporal-data and illustrate the methods with a number of examples featuring different models and datasets. In addition, we present extensions to existing algorithms which are easy to implement and provide an improvement to the existing methodology. Finally, R code to implement the algorithms presented in the paper is available on https://github.com/kypraios/epiABC. Copyright © 2016 Elsevier Inc. All rights reserved.
Gerencsér, Máté; Jentzen, Arnulf; Salimova, Diyora
2017-11-01
In a recent article (Jentzen et al. 2016 Commun. Math. Sci.14, 1477-1500 (doi:10.4310/CMS.2016.v14.n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d∈{4,5,…}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d=2) and three (d=3) space dimensions.
A study of the accuracy of moment-closure approximations for stochastic chemical kinetics.
Grima, Ramon
2012-04-21
Moment-closure approximations have in recent years become a popular means to estimate the mean concentrations and the variances and covariances of the concentration fluctuations of species involved in stochastic chemical reactions, such as those inside cells. The typical assumption behind these methods is that all cumulants of the probability distribution function solution of the chemical master equation which are higher than a certain order are negligibly small and hence can be set to zero. These approximations are ad hoc and hence the reliability of the predictions of these class of methods is presently unclear. In this article, we study the accuracy of the two moment approximation (2MA) (third and higher order cumulants are zero) and of the three moment approximation (3MA) (fourth and higher order cumulants are zero) for chemical systems which are monostable and composed of unimolecular and bimolecular reactions. We use the system-size expansion, a systematic method of solving the chemical master equation for monostable reaction systems, to calculate in the limit of large reaction volumes, the first- and second-order corrections to the mean concentration prediction of the rate equations and the first-order correction to the variance and covariance predictions of the linear-noise approximation. We also compute these corrections using the 2MA and the 3MA. Comparison of the latter results with those of the system-size expansion shows that: (i) the 2MA accurately captures the first-order correction to the rate equations but its first-order correction to the linear-noise approximation exhibits the wrong dependence on the rate constants. (ii) the 3MA accurately captures the first- and second-order corrections to the rate equation predictions and the first-order correction to the linear-noise approximation. Hence while both the 2MA and the 3MA are more accurate than the rate equations, only the 3MA is more accurate than the linear-noise approximation across all of
Menga, G.
1975-01-01
An approach, is proposed for the design of approximate, fixed order, discrete time realizations of stochastic processes from the output covariance over a finite time interval, was proposed. No restrictive assumptions are imposed on the process; it can be nonstationary and lead to a high dimension realization. Classes of fixed order models are defined, having the joint covariance matrix of the combined vector of the outputs in the interval of definition greater or equal than the process covariance; (the difference matrix is nonnegative definite). The design is achieved by minimizing, in one of those classes, a measure of the approximation between the model and the process evaluated by the trace of the difference of the respective covariance matrices. Models belonging to these classes have the notable property that, under the same measurement system and estimator structure, the output estimation error covariance matrix computed on the model is an upper bound of the corresponding covariance on the real process. An application of the approach is illustrated by the modeling of random meteorological wind profiles from the statistical analysis of historical data.
Peel, M. C.; Srikanthan, R.; McMahon, T. A.; Karoly, D. J.
2015-04-01
Two key sources of uncertainty in projections of future runoff for climate change impact assessments are uncertainty between global climate models (GCMs) and within a GCM. Within-GCM uncertainty is the variability in GCM output that occurs when running a scenario multiple times but each run has slightly different, but equally plausible, initial conditions. The limited number of runs available for each GCM and scenario combination within the Coupled Model Intercomparison Project phase 3 (CMIP3) and phase 5 (CMIP5) data sets, limits the assessment of within-GCM uncertainty. In this second of two companion papers, the primary aim is to present a proof-of-concept approximation of within-GCM uncertainty for monthly precipitation and temperature projections and to assess the impact of within-GCM uncertainty on modelled runoff for climate change impact assessments. A secondary aim is to assess the impact of between-GCM uncertainty on modelled runoff. Here we approximate within-GCM uncertainty by developing non-stationary stochastic replicates of GCM monthly precipitation and temperature data. These replicates are input to an off-line hydrologic model to assess the impact of within-GCM uncertainty on projected annual runoff and reservoir yield. We adopt stochastic replicates of available GCM runs to approximate within-GCM uncertainty because large ensembles, hundreds of runs, for a given GCM and scenario are unavailable, other than the Climateprediction.net data set for the Hadley Centre GCM. To date within-GCM uncertainty has received little attention in the hydrologic climate change impact literature and this analysis provides an approximation of the uncertainty in projected runoff, and reservoir yield, due to within- and between-GCM uncertainty of precipitation and temperature projections. In the companion paper, McMahon et al. (2015) sought to reduce between-GCM uncertainty by removing poorly performing GCMs, resulting in a selection of five better performing GCMs from
Schmandt, Nicolaus T; Galán, Roberto F
2012-09-14
Markov chains provide realistic models of numerous stochastic processes in nature. We demonstrate that in any Markov chain, the change in occupation number in state A is correlated to the change in occupation number in state B if and only if A and B are directly connected. This implies that if we are only interested in state A, fluctuations in B may be replaced with their mean if state B is not directly connected to A, which shortens computing time considerably. We show the accuracy and efficacy of our approximation theoretically and in simulations of stochastic ion-channel gating in neurons.
Dubois, Anne; Lavielle, Marc; Gsteiger, Sandro; Pigeolet, Etienne; Mentré, France
2011-09-20
In this work, we develop a bioequivalence analysis using nonlinear mixed effects models (NLMEM) that mimics the standard noncompartmental analysis (NCA). We estimate NLMEM parameters, including between-subject and within-subject variability and treatment, period and sequence effects. We explain how to perform a Wald test on a secondary parameter, and we propose an extension of the likelihood ratio test for bioequivalence. We compare these NLMEM-based bioequivalence tests with standard NCA-based tests. We evaluate by simulation the NCA and NLMEM estimates and the type I error of the bioequivalence tests. For NLMEM, we use the stochastic approximation expectation maximisation (SAEM) algorithm implemented in monolix. We simulate crossover trials under H(0) using different numbers of subjects and of samples per subject. We simulate with different settings for between-subject and within-subject variability and for the residual error variance. The simulation study illustrates the accuracy of NLMEM-based geometric means estimated with the SAEM algorithm, whereas the NCA estimates are biased for sparse design. NCA-based bioequivalence tests show good type I error except for high variability. For a rich design, type I errors of NLMEM-based bioequivalence tests (Wald test and likelihood ratio test) do not differ from the nominal level of 5%. Type I errors are inflated for sparse design. We apply the bioequivalence Wald test based on NCA and NLMEM estimates to a three-way crossover trial, showing that Omnitrope®; (Sandoz GmbH, Kundl, Austria) powder and solution are bioequivalent to Genotropin®; (Pfizer Pharma GmbH, Karlsruhe, Germany). NLMEM-based bioequivalence tests are an alternative to standard NCA-based tests. However, caution is needed for small sample size and highly variable drug. Copyright © 2011 John Wiley & Sons, Ltd.
Diffusion approximation-based simulation of stochastic ion channels: which method to use?
Directory of Open Access Journals (Sweden)
Danilo ePezo
2014-11-01
Full Text Available To study the effects of stochastic ion channel fluctuations on neural dynamics, several numerical implementation methods have been proposed. Gillespie’s method for Markov Chains (MC simulation is highly accurate, yet it becomes computationally intensive in the regime of high channel numbers. Many recent works aim to speed simulation time using the Langevin-based Diffusion Approximation (DA. Under this common theoretical approach, each implementation differs in how it handles various numerical difficulties – such as bounding of state variables to [0,1]. Here we review and test a set of the most recently published DA implementations (Dangerfield et al., 2012; Linaro et al., 2011; Huang et al., 2013a; Orio and Soudry, 2012; Schmandt and Galán, 2012; Goldwyn et al., 2011; Güler, 2013, comparing all of them in a set of numerical simulations that asses numerical accuracy and computational efficiency on three different models: the original Hodgkin and Huxley model, a model with faster sodium channels, and a multi-compartmental model inspired in granular cells. We conclude that for low channel numbers (usually below 1000 per simulated compartment one should use MC – which is both the most accurate and fastest method. For higher channel numbers, we recommend using the method by Orio and Soudry (2012, possibly combined with the method by Schmandt and Galán (2012 for increased speed and slightly reduced accuracy. Consequently, MC modelling may be the best method for detailed multicompartment neuron models – in which a model neuron with many thousands of channels is segmented into many compartments with a few hundred channels.
Diffusion approximation-based simulation of stochastic ion channels: which method to use?
Pezo, Danilo; Soudry, Daniel; Orio, Patricio
2014-01-01
To study the effects of stochastic ion channel fluctuations on neural dynamics, several numerical implementation methods have been proposed. Gillespie's method for Markov Chains (MC) simulation is highly accurate, yet it becomes computationally intensive in the regime of a high number of channels. Many recent works aim to speed simulation time using the Langevin-based Diffusion Approximation (DA). Under this common theoretical approach, each implementation differs in how it handles various numerical difficulties—such as bounding of state variables to [0,1]. Here we review and test a set of the most recently published DA implementations (Goldwyn et al., 2011; Linaro et al., 2011; Dangerfield et al., 2012; Orio and Soudry, 2012; Schmandt and Galán, 2012; Güler, 2013; Huang et al., 2013a), comparing all of them in a set of numerical simulations that assess numerical accuracy and computational efficiency on three different models: (1) the original Hodgkin and Huxley model, (2) a model with faster sodium channels, and (3) a multi-compartmental model inspired in granular cells. We conclude that for a low number of channels (usually below 1000 per simulated compartment) one should use MC—which is the fastest and most accurate method. For a high number of channels, we recommend using the method by Orio and Soudry (2012), possibly combined with the method by Schmandt and Galán (2012) for increased speed and slightly reduced accuracy. Consequently, MC modeling may be the best method for detailed multicompartment neuron models—in which a model neuron with many thousands of channels is segmented into many compartments with a few hundred channels. PMID:25404914
Approximation and inference methods for stochastic biochemical kinetics - a tutorial review
Schnoerr, David; Sanguinetti, Guido; Grima, Ramon
2017-01-01
Stochastic fluctuations of molecule numbers are ubiquitous in biological systems. Important examples include gene expression and enzymatic processes in living cells. Such systems are typically modelled as chemical reaction networks whose dynamics are governed by the Chemical Master Equation. Despite its simple structure, no analytic solutions to the Chemical Master Equation are known for most systems. Moreover, stochastic simulations are computationally expensive, making systematic analysis a...
Pettersson, Per
2013-05-01
The stochastic Galerkin and collocation methods are used to solve an advection-diffusion equation with uncertain and spatially varying viscosity. We investigate well-posedness, monotonicity and stability for the extended system resulting from the Galerkin projection of the advection-diffusion equation onto the stochastic basis functions. High-order summation-by-parts operators and weak imposition of boundary conditions are used to prove stability of the semi-discrete system.It is essential that the eigenvalues of the resulting viscosity matrix of the stochastic Galerkin system are positive and we investigate conditions for this to hold. When the viscosity matrix is diagonalizable, stochastic Galerkin and stochastic collocation are similar in terms of computational cost, and for some cases the accuracy is higher for stochastic Galerkin provided that monotonicity requirements are met. We also investigate the total spatial operator of the semi-discretized system and its impact on the convergence to steady-state. © 2013 Elsevier B.V.
A finite element approximation for the stochastic Landau-Lifshitz-Gilbert equation
Goldys, Beniamin; Le, Kim-Ngan; Tran, Thanh
2016-01-01
The stochastic Landau-Lifshitz-Gilbert (LLG) equation describes the behaviour of the magnetisation under the influence of the effective field containing random fluctuations. We first transform the stochastic LLG equation into a partial differential equation with random coefficients (without the Itô term). The resulting equation has time-differentiable solutions. We then propose a convergent θ-linear scheme for the numerical solution of the reformulated equation. As a consequence, we show the existence of weak martingale solutions to the stochastic LLG equation. A salient feature of this scheme is that it does not involve solving a system of nonlinear algebraic equations, and that no condition on time and space steps is required when θ ∈ (1/2 , 1 ]. Numerical results are presented to show the applicability of the method.
Winarti, Yuyun Guna; Noviyanti, Lienda; Setyanto, Gatot R.
2017-03-01
The stock investment is a high risk investment. Therefore, there are derivative securities to reduce these risks. One of them is Asian option. The most fundamental of option is option pricing. Many factors that determine the option price are underlying asset price, strike price, maturity date, volatility, risk free interest rate and dividends. Various option pricing usually assume that risk free interest rate is constant. While in reality, this factor is stochastic process. The arithmetic Asian option is free from distribution, then, its pricing is done using the modified Black-Scholes model. In this research, the modification use the Curran approximation. This research focuses on the arithmetic Asian option pricing without dividends. The data used is the stock daily closing data of Telkom from January 1 2016 to June 30 2016. Finnaly, those option price can be used as an option trading strategy.
A stochastic model for immunological feedback in carcinogenesis analysis and approximations
Dubin, Neil
1976-01-01
Stochastic processes often pose the difficulty that, as soon as a model devi ates from the simplest kinds of assumptions, the differential equations obtained for the density and the generating functions become mathematically formidable. Worse still, one is very often led to equations which have no known solution and don't yield to standard analytical methods for differential equations. In the model considered here, one for tumor growth with an immunological re sponse from the normal tissue, a nonlinear term in the transition probability for the death of a tumor cell leads to the above-mentioned complications. Despite the mathematical disadvantages of this nonlinearity, we are able to consider a more sophisticated model biologically. Ultimately, in order to achieve a more realistic representation of a complicated phenomenon, it is necessary to examine mechanisms which allow the model to deviate from the more mathematically tractable linear format. Thus far, stochastic models for tumor growth have almost ex...
Umut Caglar, Mehmet; Pal, Ranadip
2010-10-01
The central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid.'' However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of data in the cellular level and probabilistic nature of interactions. Probabilistic models like Stochastic Master Equation (SME) or deterministic models like differential equations (DE) can be used to analyze these types of interactions. SME models based on chemical master equation (CME) can provide detailed representation of genetic regulatory system, but their use is restricted by the large data requirements and computational costs of calculations. The differential equations models on the other hand, have low calculation costs and much more adequate to generate control procedures on the system; but they are not adequate to investigate the probabilistic nature of interactions. In this work the success of the mapping between SME and DE is analyzed, and the success of a control policy generated by DE model with respect to SME model is examined. Index Terms--- Stochastic Master Equation models, Differential Equation Models, Control Policy Design, Systems biology
A Diffusion Approximation and Numerical Methods for Adaptive Neuron Models with Stochastic Inputs.
Rosenbaum, Robert
2016-01-01
Characterizing the spiking statistics of neurons receiving noisy synaptic input is a central problem in computational neuroscience. Monte Carlo approaches to this problem are computationally expensive and often fail to provide mechanistic insight. Thus, the field has seen the development of mathematical and numerical approaches, often relying on a Fokker-Planck formalism. These approaches force a compromise between biological realism, accuracy and computational efficiency. In this article we develop an extension of existing diffusion approximations to more accurately approximate the response of neurons with adaptation currents and noisy synaptic currents. The implementation refines existing numerical schemes for solving the associated Fokker-Planck equations to improve computationally efficiency and accuracy. Computer code implementing the developed algorithms is made available to the public.
Analytic Regularity and Polynomial Approximation of Parametric and Stochastic Elliptic PDEs
2010-05-31
interest in the validity of expansions like (1.21) when the monomial basis zν is replaced by other polynomial bases. For example in the analysis of...Statement of the result In this section, we study another analytic expansion of u by changing the monomial basis to a Legendre basis. Our motivation for...term approximation than monomial expansions (see Theorem 4.1 below). We will consider two types of Legendre expansions which differ only in their
Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
Chkifa, Abdellah
2012-11-29
The numerical approximation of parametric partial differential equations is a computational challenge, in particular when the number of involved parameter is large. This paper considers a model class of second order, linear, parametric, elliptic PDEs on a bounded domain D with diffusion coefficients depending on the parameters in an affine manner. For such models, it was shown in [9, 10] that under very weak assumptions on the diffusion coefficients, the entire family of solutions to such equations can be simultaneously approximated in the Hilbert space V = H0 1(D) by multivariate sparse polynomials in the parameter vector y with a controlled number N of terms. The convergence rate in terms of N does not depend on the number of parameters in V, which may be arbitrarily large or countably infinite, thereby breaking the curse of dimensionality. However, these approximation results do not describe the concrete construction of these polynomial expansions, and should therefore rather be viewed as benchmark for the convergence analysis of numerical methods. The present paper presents an adaptive numerical algorithm for constructing a sequence of sparse polynomials that is proved to converge toward the solution with the optimal benchmark rate. Numerical experiments are presented in large parameter dimension, which confirm the effectiveness of the adaptive approach. © 2012 EDP Sciences, SMAI.
Directory of Open Access Journals (Sweden)
Huanqing Wang
2014-01-01
Full Text Available The problem of fuzzy-based direct adaptive tracking control is considered for a class of pure-feedback stochastic nonlinear systems. During the controller design, fuzzy logic systems are used to approximate the packaged unknown nonlinearities, and then a novel direct adaptive controller is constructed via backstepping technique. It is shown that the proposed controller guarantees that all the signals in the closed-loop system are bounded in probability and the tracking error eventually converges to a small neighborhood around the origin in the sense of mean quartic value. The main advantages lie in that the proposed controller structure is simpler and only one adaptive parameter needs to be updated online. Simulation results are used to illustrate the effectiveness of the proposed approach.
Non-intrusive low-rank separated approximation of high-dimensional stochastic models
Doostan, Alireza
2013-08-01
This work proposes a sampling-based (non-intrusive) approach within the context of low-. rank separated representations to tackle the issue of curse-of-dimensionality associated with the solution of models, e.g., PDEs/ODEs, with high-dimensional random inputs. Under some conditions discussed in details, the number of random realizations of the solution, required for a successful approximation, grows linearly with respect to the number of random inputs. The construction of the separated representation is achieved via a regularized alternating least-squares regression, together with an error indicator to estimate model parameters. The computational complexity of such a construction is quadratic in the number of random inputs. The performance of the method is investigated through its application to three numerical examples including two ODE problems with high-dimensional random inputs. © 2013 Elsevier B.V.
Directory of Open Access Journals (Sweden)
Varghese Mathew Vaidyan
2015-09-01
Full Text Available Present self-tuning regulator architectures based on recursive least-square estimation are computationally expensive and require large amount of resources and time in generating the first control signal due to computational bottlenecks imposed by the calculations involved in estimation stage, different stages of matrix multiplications and the number of intermediate variables at each iteration and precludes its use in applications that have fast required response times and those which run on embedded computing platforms with low-power or low-cost requirements with constraints on resource usage. A salient feature of this study is that a new modular parallel pipelined stochastic approximation-based self-tuning regulator architecture which reduces the time required to generate the first control signal, reduces resource usage and reduces the number of intermediate variables is proposed. Fast matrix multiplication, pipelining and high-speed arithmetic function implementations were used for improving the performance. Results of implementation demonstrate that the proposed architecture has an improvement in control signal generation time by 38% and reduction in resource usage by 41% in terms of multipliers and 44.4% in terms of adders compared with the best existing related work, opening up new possibilities for the application of online embedded self-tuning regulators.
Haji Ali, Abdul Lateef
2016-01-08
I discuss using single level and multilevel Monte Carlo methods to compute quantities of interests of a stochastic particle system in the mean-field. In this context, the stochastic particles follow a coupled system of Ito stochastic differential equations (SDEs). Moreover, this stochastic particle system converges to a stochastic mean-field limit as the number of particles tends to infinity. I start by recalling the results of applying different versions of Multilevel Monte Carlo (MLMC) for particle systems, both with respect to time steps and the number of particles and using a partitioning estimator. Next, I expand on these results by proposing the use of our recent Multi-index Monte Carlo method to obtain improved convergence rates.
Goldys, Beniamin; Grotowski, Joseph; Le, Kim-Ngan
2017-01-01
We propose an unconditionally convergent linear finite element scheme for the stochastic Landau--Lifshitz--Gilbert (LLG) equation with multi-dimensional noise. By using the Doss-Sussmann technique, we first transform the stochastic LLG equation into a partial differential equation that depends on the solution of the auxiliary equation for the diffusion part. The resulting equation has solutions absolutely continuous with respect to time. We then propose a convergent $\\theta$-linear scheme for...
Bhowmick, Amiya Ranjan; Bandyopadhyay, Subhadip; Rana, Sourav; Bhattacharya, Sabyasachi
2016-01-01
The stochastic versions of the logistic and extended logistic growth models are applied successfully to explain many real-life population dynamics and share a central body of literature in stochastic modeling of ecological systems. To understand the randomness in the population dynamics of the underlying processes completely, it is important to have a clear idea about the quasi-equilibrium distribution and its moments. Bartlett et al. (1960) took a pioneering attempt for estimating the moments of the quasi-equilibrium distribution of the stochastic logistic model. Matis and Kiffe (1996) obtain a set of more accurate and elegant approximations for the mean, variance and skewness of the quasi-equilibrium distribution of the same model using cumulant truncation method. The method is extended for stochastic power law logistic family by the same and several other authors (Nasell, 2003; Singh and Hespanha, 2007). Cumulant truncation and some alternative methods e.g. saddle point approximation, derivative matching approach can be applied if the powers involved in the extended logistic set up are integers, although plenty of evidence is available for non-integer powers in many practical situations (Sibly et al., 2005). In this paper, we develop a set of new approximations for mean, variance and skewness of the quasi-equilibrium distribution under more general family of growth curves, which is applicable for both integer and non-integer powers. The deterministic counterpart of this family of models captures both monotonic and non-monotonic behavior of the per capita growth rate, of which theta-logistic is a special case. The approximations accurately estimate the first three order moments of the quasi-equilibrium distribution. The proposed method is illustrated with simulated data and real data from global population dynamics database. Copyright © 2015 Elsevier Inc. All rights reserved.
DEFF Research Database (Denmark)
Rösing, Lilian Munk
2017-01-01
Defined as the tropes, figures, and grammar of the text, style is quite concrete, quite analyzable. Pure detection and identification of the tropes and figures of a text is not very interesting to literary studies, though, unless it is combined with interpretation, that is, unless you ask: What...... is the effect of those tropes and figures, how do they contribute to the signification of the text?...
Booth, Paul
2013-01-01
This paper presents an approximate replication of Milton's (2007) study on lexical profiles and learning style. Milton investigated the assumption that more frequent words are acquired before less frequent ones. Using a vocabulary recognition test ("X-Lex") to measure vocabulary size, Milton found that L2 English group profiles show…
Mantič-Lugo, Vladislav; Gallaire, François
2016-12-01
Selective noise amplifiers are characterized by large linear amplification to external perturbations in a particular frequency range despite their global linear stability. Applying a stochastic forcing with increasing amplitude, the response undergoes a strong nonlinear saturation when compared to the linear estimation. Building upon our previous work, we introduce a predictive model that describes this nonlinear dynamics, and we apply it to a canonical example of selective noise amplifiers: the backward-facing step flow. Rewriting conveniently the stochastic forcing and response in the frequency domain, the model consists in a mean flow equation coupled to the linear response to forcing at each frequency. This coupling is attained by the Reynolds stress, which is constructed by the integral in frequency of the independent responses. We generalize the model for a response to a white noise forcing δ -correlated in space and time restricting the flow dynamics to its most energetic patterns calculated from the optimal harmonic forcing and response of the flow. The model estimates accurately the response saturation when compared to direct numerical simulations, and it correctly approximates the structure of the response and the mean flow modification. It also shows that the response undergoes a selective process governed by the nonlinear gain, which promotes a response structure with an approximately single frequency and wavelength in the whole domain. These results suggest that the mean flow modification by the Reynolds stress is the key nonlinearity in the saturation process of the response to white noise.
2001-09-01
diagnosis natural language understanding circuit fault diagnosis pattern recognition machine vision nancial auditing map learning sensor...de nition of piecewise polynomial function shown in section provides the foundation for this type of approximation Schumaker proved... ACCA ACCB A ights degree of command and control FCC value is assumed to be the average of all the ACC values of the aircraft in the
Wang, Jun-Sheng; Yang, Guang-Hong
2017-07-25
This paper studies the optimal output-feedback control problem for unknown linear discrete-time systems with stochastic measurement and process noise. A dithered Bellman equation with the innovation covariance matrix is constructed via the expectation operator given in the form of a finite summation. On this basis, an output-feedback-based approximate dynamic programming method is developed, where the terms depending on the innovation covariance matrix are available with the aid of the innovation covariance matrix identified beforehand. Therefore, by iterating the Bellman equation, the resulting value function can converge to the optimal one in the presence of the aforementioned noise, and the nearly optimal control laws are delivered. To show the effectiveness and the advantages of the proposed approach, a simulation example and a velocity control experiment on a dc machine are employed.
Bianco, Raffaello; Errea, Ion; Paulatto, Lorenzo; Calandra, Matteo; Mauri, Francesco
2017-07-01
The self-consistent harmonic approximation is an effective harmonic theory to calculate the free energy of systems with strongly anharmonic atomic vibrations, and its stochastic implementation has proved to be an efficient method to study, from first-principles, the anharmonic properties of solids. The free energy as a function of average atomic positions (centroids) can be used to study quantum or thermal lattice instability. In particular the centroids are order parameters in second-order structural phase transitions such as, e.g., charge-density-waves or ferroelectric instabilities. According to Landau's theory, the knowledge of the second derivative of the free energy (i.e., the curvature) with respect to the centroids in a high-symmetry configuration allows the identification of the phase-transition and of the instability modes. In this work we derive the exact analytic formula for the second derivative of the free energy in the self-consistent harmonic approximation for a generic atomic configuration. The analytic derivative is expressed in terms of the atomic displacements and forces in a form that can be evaluated by a stochastic technique using importance sampling. Our approach is particularly suitable for applications based on first-principles density-functional-theory calculations, where the forces on atoms can be obtained with a negligible computational effort compared to total energy determination. Finally, we propose a dynamical extension of the theory to calculate spectral properties of strongly anharmonic phonons, as probed by inelastic scattering processes. We illustrate our method with a numerical application on a toy model that mimics the ferroelectric transition in rock-salt crystals such as SnTe or GeTe.
Directory of Open Access Journals (Sweden)
R.A. Zait
2016-07-01
Full Text Available In this paper, the stochastic Wiener Hermite expansion (WHE is used to find the statistical measures (mean and variance of the first order stochastic approximation (Gaussian part of the stochastic solution processes related to the nonlinear damped Duffing oscillator model which is excited randomly by white noise process. Under the application of WHE, a deterministic model is generated to simulate the statistical measures. In next stages, smi-analytical treatments are performed under applying multi-step differential transformed method (Ms-DTM and some cases study are illustrated related to the statistical properties using Mathematica10 software.
Diaz-Ruelas, Alvaro; Jeldtoft Jensen, Henrik; Piovani, Duccio; Robledo, Alberto
2016-12-01
It is well known that low-dimensional nonlinear deterministic maps close to a tangent bifurcation exhibit intermittency and this circumstance has been exploited, e.g., by Procaccia and Schuster [Phys. Rev. A 28, 1210 (1983)], to develop a general theory of 1/f spectra. This suggests it is interesting to study the extent to which the behavior of a high-dimensional stochastic system can be described by such tangent maps. The Tangled Nature (TaNa) Model of evolutionary ecology is an ideal candidate for such a study, a significant model as it is capable of reproducing a broad range of the phenomenology of macroevolution and ecosystems. The TaNa model exhibits strong intermittency reminiscent of punctuated equilibrium and, like the fossil record of mass extinction, the intermittency in the model is found to be non-stationary, a feature typical of many complex systems. We derive a mean-field version for the evolution of the likelihood function controlling the reproduction of species and find a local map close to tangency. This mean-field map, by our own local approximation, is able to describe qualitatively only one episode of the intermittent dynamics of the full TaNa model. To complement this result, we construct a complete nonlinear dynamical system model consisting of successive tangent bifurcations that generates time evolution patterns resembling those of the full TaNa model in macroscopic scales. The switch from one tangent bifurcation to the next in the sequences produced in this model is stochastic in nature, based on criteria obtained from the local mean-field approximation, and capable of imitating the changing set of types of species and total population in the TaNa model. The model combines full deterministic dynamics with instantaneous parameter random jumps at stochastically drawn times. In spite of the limitations of our approach, which entails a drastic collapse of degrees of freedom, the description of a high-dimensional model system in terms of a low
Migliorati, G.
2013-05-30
In this work we consider the random discrete L^2 projection on polynomial spaces (hereafter RDP) for the approximation of scalar quantities of interest (QOIs) related to the solution of a partial differential equation model with random input parameters. In the RDP technique the QOI is first computed for independent samples of the random input parameters, as in a standard Monte Carlo approach, and then the QOI is approximated by a multivariate polynomial function of the input parameters using a discrete least squares approach. We consider several examples including the Darcy equations with random permeability, the linear elasticity equations with random elastic coefficient, and the Navier--Stokes equations in random geometries and with random fluid viscosity. We show that the RDP technique is well suited to QOIs that depend smoothly on a moderate number of random parameters. Our numerical tests confirm the theoretical findings in [G. Migliorati, F. Nobile, E. von Schwerin, and R. Tempone, Analysis of the Discrete $L^2$ Projection on Polynomial Spaces with Random Evaluations, MOX report 46-2011, Politecnico di Milano, Milano, Italy, submitted], which have shown that, in the case of a single uniformly distributed random parameter, the RDP technique is stable and optimally convergent if the number of sampling points is proportional to the square of the dimension of the polynomial space. Here optimality means that the weighted $L^2$ norm of the RDP error is bounded from above by the best $L^\\\\infty$ error achievable in the given polynomial space, up to logarithmic factors. In the case of several random input parameters, the numerical evidence indicates that the condition on quadratic growth of the number of sampling points could be relaxed to a linear growth and still achieve stable and optimal convergence. This makes the RDP technique very promising for moderately high dimensional uncertainty quantification.
Liu, Baoshun; Zhao, Xiujian; Yu, Jiaguo; Fujishima, Akira; Nakata, Kazuya
2016-11-23
In the photocatalysis of porous nano-crystalline materials, the transfer of electrons to O 2 plays an important role, which includes the electron transport to photocatalytic active centers and successive interfacial transfer to O 2 . The slowest of them will determine the overall speed of electron transfer in the photocatalysis reaction. Considering the photocatalysis of porous nano-crystalline TiO 2 as an example, although some experimental results have shown that the electron kinetics are limited by the interfacial transfer, we still lack the depth of understanding the microscopic mechanism from a theoretical viewpoint. In the present research, a stochastic quasi-equilibrium (QE) theoretical model and a stochastic random walking (RW) model were established to discuss the electron transport and electron interfacial transfer by taking the electron multi-trapping transport and electron interfacial transfer from the photocatalytic active centers to O 2 into consideration. By carefully investigating the effect of the electron Fermi level (E F ) and the photocatalytic center number on electron transport, we showed that the time taken for an electron to transport to a photocatalytic center predicated by the stochastic RW model was much lower than that predicted by the stochastic QE model, indicating that the electrons cannot reach a QE state during their transport to photocatalytic centers. The stochastic QE model predicted that the electron kinetics of a real photocatalysis for porous nano-crystalline TiO 2 should be limited by electron transport, whereas the stochastic RW model showed that the electron kinetics of a real photocatalysis can be limited by the interfacial transfer. Our simulation results show that the stochastic RW model was more in line with the real electron kinetics that have been observed in experiments, therefore it is concluded that the photoinduced electrons cannot reach a QE state before transferring to O 2 .
Approximation Behooves Calibration
DEFF Research Database (Denmark)
da Silva Ribeiro, André Manuel; Poulsen, Rolf
2013-01-01
Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009....
Directory of Open Access Journals (Sweden)
Alla V. Makarova
2017-05-01
Full Text Available Notion of mean derivatives was introduced by Edward Nelson for the needs of stochastic mechanics (a version of quantum mechanics. Nelson introduced forward and backward mean derivatives while only their half-sum, symmetric mean derivative called current velocity, is a direct analog of ordinary velocity for deterministic processes. Another mean derivative called quadratic, was introduced by Yuri E. Gliklikh and Svetlana V. Azarina. It gives information on the diffusion coefficient of the process and using Nelson's and quadratic mean derivatives together, one can in principle recover the process from its mean derivatives. Since the current velocities are natural analogs of ordinary velocities of deterministic processes, investigation of equations and especially inclusions with current velocities is very much important for applications since there are a lot of models of various physical, economical etc. processes based on such equations and inclusions. Existence of solution theorems are obtained for stochastic differential inclusions given in terms of the so-called current velocities (symmetric mean derivatives, a direct analogs of ordinary velocity of deterministic systems and quadratic mean derivatives (giving information on the diffusion coefficient on $\\mathbb{R}^n$. Right-hand sides in both the current velocity part and the quadratic part are set-valued but satisfy some natural conditions.
Directory of Open Access Journals (Sweden)
Yanhui Li
2014-01-01
Full Text Available This paper investigates the Hankel norm filter design problem for stochastic time-delay systems, which are represented by Takagi-Sugeno (T-S fuzzy model. Motivated by the parallel distributed compensation (PDC technique, a novel filtering error system is established. The objective is to design a suitable filter that guarantees the corresponding filtering error system to be mean-square asymptotically stable and to have a specified Hankel norm performance level γ. Based on the Lyapunov stability theory and the Itô differential rule, the Hankel norm criterion is first established by adopting the integral inequality method, which can make some useful efforts in reducing conservativeness. The Hankel norm filtering problem is casted into a convex optimization problem with a convex linearization approach, which expresses all the conditions for the existence of admissible Hankel norm filter as standard linear matrix inequalities (LMIs. The effectiveness of the proposed method is demonstrated via a numerical example.
Stochastic phase transition operator.
Yamanobe, Takanobu
2011-07-01
In this study a Markov operator is introduced that represents the density evolution of an impulse-driven stochastic biological oscillator. The operator's stochastic kernel is constructed using the asymptotic expansion of stochastic processes instead of solving the Fokker-Planck equation. The Markov operator is shown to successfully approximate the density evolution of the biological oscillator considered. The response of the oscillator to both periodic and time-varying impulses can be analyzed using the operator's transient and stationary properties. Furthermore, an unreported stochastic dynamic bifurcation for the biological oscillator is obtained by using the eigenvalues of the product of the Markov operators.
Karal, David
2014-01-01
Stochastic Integrals David Karal Abstrakt In this thesis we study the Wiener process and stochastic integrals. The thesis defines the basic objects of stochastic analysis and the existence of the Wiener process and some of its properties are shown. This process is then used to con- struct the Itô stochastic integral, where the Wiener process acts as an integrator. The Itô stochastic integral is first defined for simple processes and subsequently extended to mathcalFt-progressively measurable ...
Stochastic optimization methods
Marti, Kurt
2005-01-01
Optimization problems arising in practice involve random parameters. For the computation of robust optimal solutions, i.e., optimal solutions being insensitive with respect to random parameter variations, deterministic substitute problems are needed. Based on the distribution of the random data, and using decision theoretical concepts, optimization problems under stochastic uncertainty are converted into deterministic substitute problems. Due to the occurring probabilities and expectations, approximative solution techniques must be applied. Deterministic and stochastic approximation methods and their analytical properties are provided: Taylor expansion, regression and response surface methods, probability inequalities, First Order Reliability Methods, convex approximation/deterministic descent directions/efficient points, stochastic approximation methods, differentiation of probability and mean value functions. Convergence results of the resulting iterative solution procedures are given.
Stochastic volatility and stochastic leverage
DEFF Research Database (Denmark)
Veraart, Almut; Veraart, Luitgard A. M.
This paper proposes the new concept of stochastic leverage in stochastic volatility models. Stochastic leverage refers to a stochastic process which replaces the classical constant correlation parameter between the asset return and the stochastic volatility process. We provide a systematic...... treatment of stochastic leverage and propose to model the stochastic leverage effect explicitly, e.g. by means of a linear transformation of a Jacobi process. Such models are both analytically tractable and allow for a direct economic interpretation. In particular, we propose two new stochastic volatility...... models which allow for a stochastic leverage effect: the generalised Heston model and the generalised Barndorff-Nielsen & Shephard model. We investigate the impact of a stochastic leverage effect in the risk neutral world by focusing on implied volatilities generated by option prices derived from our new...
Towards Model Checking Stochastic Process Algebra
Hermanns, H.; Grieskamp, W.; Santen, T.; Katoen, Joost P.; Stoddart, B.; Meyer-Kayser, J.; Siegle, M.
2000-01-01
Stochastic process algebras have been proven useful because they allow behaviour-oriented performance and reliability modelling. As opposed to traditional performance modelling techniques, the behaviour- oriented style supports composition and abstraction in a natural way. However, analysis of
Stochastic processes in cell biology
Bressloff, Paul C
2014-01-01
This book develops the theory of continuous and discrete stochastic processes within the context of cell biology. A wide range of biological topics are covered including normal and anomalous diffusion in complex cellular environments, stochastic ion channels and excitable systems, stochastic calcium signaling, molecular motors, intracellular transport, signal transduction, bacterial chemotaxis, robustness in gene networks, genetic switches and oscillators, cell polarization, polymerization, cellular length control, and branching processes. The book also provides a pedagogical introduction to the theory of stochastic process – Fokker Planck equations, stochastic differential equations, master equations and jump Markov processes, diffusion approximations and the system size expansion, first passage time problems, stochastic hybrid systems, reaction-diffusion equations, exclusion processes, WKB methods, martingales and branching processes, stochastic calculus, and numerical methods. This text is primarily...
Stochastic Modeling Of Biochemical Reactions
2006-11-01
STOCHASTIC MODELING OF BIOCHEMICAL REACTIONS Abhyudai Singh and João Pedro Hespanha* Department of Electrical and Computer Engineering University of...procedure for con- structing approximate stochastic models for chemical reactions used for modeling biochemical processes such as gene regulatory networks... biochemical reactions , the modeling tools developed in this paper can be applied to a very general class of stochastic systems, in particular
Mazzarella, Jo Ann; Smith, Stuart C.
Chapter 2 of a revised volume on school leadership, this chapter reviews theories of leadership style--the way a leader leads. Although most experts agree that leadership style is important, they disagree concerning style components, leaders' capabilities for changing styles, the effects of personality traits on style, and the desirability of…
Indian Academy of Sciences (India)
First page Back Continue Last page Overview Graphics. Approximation Clustering. Clustering within (1+ ε) of the optimum cost. ε is user defined tolerance. For metric spaces even approximating is. hard (below, say 30%). Euclidean k-median in fixed dimension can. be approximated in polynomial time.
Hierarchical low-rank approximation for high dimensional approximation
Nouy, Anthony
2016-01-07
Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.
Parzen, Emanuel
1962-01-01
Well-written and accessible, this classic introduction to stochastic processes and related mathematics is appropriate for advanced undergraduate students of mathematics with a knowledge of calculus and continuous probability theory. The treatment offers examples of the wide variety of empirical phenomena for which stochastic processes provide mathematical models, and it develops the methods of probability model-building.Chapter 1 presents precise definitions of the notions of a random variable and a stochastic process and introduces the Wiener and Poisson processes. Subsequent chapters examine
McKean, Henry P
2005-01-01
This little book is a brilliant introduction to an important boundary field between the theory of probability and differential equations. -E. B. Dynkin, Mathematical Reviews This well-written book has been used for many years to learn about stochastic integrals. The book starts with the presentation of Brownian motion, then deals with stochastic integrals and differentials, including the famous Itô lemma. The rest of the book is devoted to various topics of stochastic integral equations, including those on smooth manifolds. Originally published in 1969, this classic book is ideal for supplemen
Stochastic B-series and order conditions for exponential integrators
DEFF Research Database (Denmark)
Arara, Alemayehu Adugna; Debrabant, Kristian; Kværnø, Anne
2018-01-01
We discuss stochastic differential equations with a stiff linear part and their approximation by stochastic exponential integrators. Representing the exact and approximate solutions using B-series and rooted trees, we derive the order conditions for stochastic exponential integrators. The resulti...... general order theory covers both It\\^{o} and Stratonovich integration....
Variational principles for stochastic soliton dynamics
Holm, Darryl D.; Tyranowski, Tomasz M.
2016-01-01
We develop a variational method of deriving stochastic partial differential equations whose solutions follow the flow of a stochastic vector field. As an example in one spatial dimension, we numerically simulate singular solutions (peakons) of the stochastically perturbed Camassa–Holm (CH) equation derived using this method. These numerical simulations show that peakon soliton solutions of the stochastically perturbed CH equation persist and provide an interesting laboratory for investigating the sensitivity and accuracy of adding stochasticity to finite dimensional solutions of stochastic partial differential equations. In particular, some choices of stochastic perturbations of the peakon dynamics by Wiener noise (canonical Hamiltonian stochastic deformations, CH-SD) allow peakons to interpenetrate and exchange order on the real line in overtaking collisions, although this behaviour does not occur for other choices of stochastic perturbations which preserve the Euler–Poincaré structure of the CH equation (parametric stochastic deformations, P-SD), and it also does not occur for peakon solutions of the unperturbed deterministic CH equation. The discussion raises issues about the science of stochastic deformations of finite-dimensional approximations of evolutionary partial differential equation and the sensitivity of the resulting solutions to the choices made in stochastic modelling. PMID:27118922
Topology, calculus and approximation
Komornik, Vilmos
2017-01-01
Presenting basic results of topology, calculus of several variables, and approximation theory which are rarely treated in a single volume, this textbook includes several beautiful, but almost forgotten, classical theorems of Descartes, Erdős, Fejér, Stieltjes, and Turán. The exposition style of Topology, Calculus and Approximation follows the Hungarian mathematical tradition of Paul Erdős and others. In the first part, the classical results of Alexandroff, Cantor, Hausdorff, Helly, Peano, Radon, Tietze and Urysohn illustrate the theories of metric, topological and normed spaces. Following this, the general framework of normed spaces and Carathéodory's definition of the derivative are shown to simplify the statement and proof of various theorems in calculus and ordinary differential equations. The third and final part is devoted to interpolation, orthogonal polynomials, numerical integration, asymptotic expansions and the numerical solution of algebraic and differential equations. Students of both pure an...
Lukacs, Eugene; Lukacs, E
1975-01-01
Stochastic Convergence, Second Edition covers the theoretical aspects of random power series dealing with convergence problems. This edition contains eight chapters and starts with an introduction to the basic concepts of stochastic convergence. The succeeding chapters deal with infinite sequences of random variables and their convergences, as well as the consideration of certain sets of random variables as a space. These topics are followed by discussions of the infinite series of random variables, specifically the lemmas of Borel-Cantelli and the zero-one laws. Other chapters evaluate the po
Stochastic partial differential equations
Chow, Pao-Liu
2014-01-01
Preliminaries Introduction Some Examples Brownian Motions and Martingales Stochastic Integrals Stochastic Differential Equations of Itô Type Lévy Processes and Stochastic IntegralsStochastic Differential Equations of Lévy Type Comments Scalar Equations of First Order Introduction Generalized Itô's Formula Linear Stochastic Equations Quasilinear Equations General Remarks Stochastic Parabolic Equations Introduction Preliminaries Solution of Stochastic Heat EquationLinear Equations with Additive Noise Some Regularity Properties Stochastic Reaction-Diffusion Equations Parabolic Equations with Grad
Stochastic Constraint Programming
Walsh, Toby
2009-01-01
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables (which follow a probability distribution). They combine together the best features of traditional constraint satisfaction, stochastic integer programming, and stochastic satisfiability. We give a semantics for stochastic constraint programs, and propose a number...
Ant colony optimization and stochastic gradient descent.
Meuleau, Nicolas; Dorigo, Marco
2002-01-01
In this article, we study the relationship between the two techniques known as ant colony optimization (ACO) and stochastic gradient descent. More precisely, we show that some empirical ACO algorithms approximate stochastic gradient descent in the space of pheromones, and we propose an implementation of stochastic gradient descent that belongs to the family of ACO algorithms. We then use this insight to explore the mutual contributions of the two techniques.
CERN. Geneva
2015-01-01
Most physics results at the LHC end in a likelihood ratio test. This includes discovery and exclusion for searches as well as mass, cross-section, and coupling measurements. The use of Machine Learning (multivariate) algorithms in HEP is mainly restricted to searches, which can be reduced to classification between two fixed distributions: signal vs. background. I will show how we can extend the use of ML classifiers to distributions parameterized by physical quantities like masses and couplings as well as nuisance parameters associated to systematic uncertainties. This allows for one to approximate the likelihood ratio while still using a high dimensional feature vector for the data. Both the MEM and ABC approaches mentioned above aim to provide inference on model parameters (like cross-sections, masses, couplings, etc.). ABC is fundamentally tied Bayesian inference and focuses on the “likelihood free” setting where only a simulator is available and one cannot directly compute the likelihood for the dat...
Eichhorn, Ralf; Aurell, Erik
2014-04-01
'Stochastic thermodynamics as a conceptual framework combines the stochastic energetics approach introduced a decade ago by Sekimoto [1] with the idea that entropy can consistently be assigned to a single fluctuating trajectory [2]'. This quote, taken from Udo Seifert's [3] 2008 review, nicely summarizes the basic ideas behind stochastic thermodynamics: for small systems, driven by external forces and in contact with a heat bath at a well-defined temperature, stochastic energetics [4] defines the exchanged work and heat along a single fluctuating trajectory and connects them to changes in the internal (system) energy by an energy balance analogous to the first law of thermodynamics. Additionally, providing a consistent definition of trajectory-wise entropy production gives rise to second-law-like relations and forms the basis for a 'stochastic thermodynamics' along individual fluctuating trajectories. In order to construct meaningful concepts of work, heat and entropy production for single trajectories, their definitions are based on the stochastic equations of motion modeling the physical system of interest. Because of this, they are valid even for systems that are prevented from equilibrating with the thermal environment by external driving forces (or other sources of non-equilibrium). In that way, the central notions of equilibrium thermodynamics, such as heat, work and entropy, are consistently extended to the non-equilibrium realm. In the (non-equilibrium) ensemble, the trajectory-wise quantities acquire distributions. General statements derived within stochastic thermodynamics typically refer to properties of these distributions, and are valid in the non-equilibrium regime even beyond the linear response. The extension of statistical mechanics and of exact thermodynamic statements to the non-equilibrium realm has been discussed from the early days of statistical mechanics more than 100 years ago. This debate culminated in the development of linear response
Multistage stochastic optimization
Pflug, Georg Ch
2014-01-01
Multistage stochastic optimization problems appear in many ways in finance, insurance, energy production and trading, logistics and transportation, among other areas. They describe decision situations under uncertainty and with a longer planning horizon. This book contains a comprehensive treatment of today’s state of the art in multistage stochastic optimization. It covers the mathematical backgrounds of approximation theory as well as numerous practical algorithms and examples for the generation and handling of scenario trees. A special emphasis is put on estimation and bounding of the modeling error using novel distance concepts, on time consistency and the role of model ambiguity in the decision process. An extensive treatment of examples from electricity production, asset liability management and inventory control concludes the book
Temperature stochastic modeling and weather derivatives pricing ...
African Journals Online (AJOL)
... over a sufficient period to apply a stochastic process that describes the evolution of the temperature. A numerical example of a swap contract pricing is presented, using an approximation formula as well as Monte Carlo simulations. Keywords: Weather derivatives, temperature stochastic model, Monte Carlo simulation.
Crisan, Dan
2011-01-01
"Stochastic Analysis" aims to provide mathematical tools to describe and model high dimensional random systems. Such tools arise in the study of Stochastic Differential Equations and Stochastic Partial Differential Equations, Infinite Dimensional Stochastic Geometry, Random Media and Interacting Particle Systems, Super-processes, Stochastic Filtering, Mathematical Finance, etc. Stochastic Analysis has emerged as a core area of late 20th century Mathematics and is currently undergoing a rapid scientific development. The special volume "Stochastic Analysis 2010" provides a sa
Borodin, Andrei N
2017-01-01
This book provides a rigorous yet accessible introduction to the theory of stochastic processes. A significant part of the book is devoted to the classic theory of stochastic processes. In turn, it also presents proofs of well-known results, sometimes together with new approaches. Moreover, the book explores topics not previously covered elsewhere, such as distributions of functionals of diffusions stopped at different random times, the Brownian local time, diffusions with jumps, and an invariance principle for random walks and local times. Supported by carefully selected material, the book showcases a wealth of examples that demonstrate how to solve concrete problems by applying theoretical results. It addresses a broad range of applications, focusing on concrete computational techniques rather than on abstract theory. The content presented here is largely self-contained, making it suitable for researchers and graduate students alike.
Analysis of bilinear stochastic systems. [involving multiplicative noise processes
Willsky, A. S.; Marcus, S. I.; Martin, D. N.
1974-01-01
Analysis of stochastic dynamical systems that involve multiplicative (bilinear) noise processes is considered. After defining the systems of interest, the evolution of the moments of such systems, the question of stochastic stability, and estimation for bilinear stochastic systems are discussed. Both exact and approximate methods of analysis are introduced, and, in particular, the uses of Lie-theoretic concepts and harmonic analysis are discussed.
Val, Carlin; Kemp, Jess
2012-01-01
This study examines how a group's dynamic changes under the influence of different leadership styles, and determines what leadership style works best in a large group expedition. The main question identified was "What roles can a leader play in affecting the dynamic of a large group while partaking in a field expedition?" The following…
Stochastic Differential Equations
Cecconi, Jaures
2011-01-01
C. Doleans-Dade: Stochastic processes and stochastic differential equations.- A. Friedman: Stochastic differential equations and applications.- D.W. Stroock, S.R.S. Varadhan: Theory of diffusion processes.- G.C. Papanicolaou: Wave propagation and heat conduction in a random medium.- C. Dewitt Morette: A stochastic problem in Physics.- G.S. Goodman: The embedding problem for stochastic matrices.
Phenomenology of stochastic exponential growth
Pirjol, Dan; Jafarpour, Farshid; Iyer-Biswas, Srividya
2017-06-01
Stochastic exponential growth is observed in a variety of contexts, including molecular autocatalysis, nuclear fission, population growth, inflation of the universe, viral social media posts, and financial markets. Yet literature on modeling the phenomenology of these stochastic dynamics has predominantly focused on one model, geometric Brownian motion (GBM), which can be described as the solution of a Langevin equation with linear drift and linear multiplicative noise. Using recent experimental results on stochastic exponential growth of individual bacterial cell sizes, we motivate the need for a more general class of phenomenological models of stochastic exponential growth, which are consistent with the observation that the mean-rescaled distributions are approximately stationary at long times. We show that this behavior is not consistent with GBM, instead it is consistent with power-law multiplicative noise with positive fractional powers. Therefore, we consider this general class of phenomenological models for stochastic exponential growth, provide analytical solutions, and identify the important dimensionless combination of model parameters, which determines the shape of the mean-rescaled distribution. We also provide a prescription for robustly inferring model parameters from experimentally observed stochastic growth trajectories.
Modelling and application of stochastic processes
1986-01-01
The subject of modelling and application of stochastic processes is too vast to be exhausted in a single volume. In this book, attention is focused on a small subset of this vast subject. The primary emphasis is on realization and approximation of stochastic systems. Recently there has been considerable interest in the stochastic realization problem, and hence, an attempt has been made here to collect in one place some of the more recent approaches and algorithms for solving the stochastic realiza tion problem. Various different approaches for realizing linear minimum-phase systems, linear nonminimum-phase systems, and bilinear systems are presented. These approaches range from time-domain methods to spectral-domain methods. An overview of the chapter contents briefly describes these approaches. Also, in most of these chapters special attention is given to the problem of developing numerically ef ficient algorithms for obtaining reduced-order (approximate) stochastic realizations. On the application side,...
Preconditioned Stochastic Gradient Descent.
Li, Xi-Lin
2017-03-09
Stochastic gradient descent (SGD) still is the workhorse for many practical problems. However, it converges slow, and can be difficult to tune. It is possible to precondition SGD to accelerate its convergence remarkably. But many attempts in this direction either aim at solving specialized problems, or result in significantly more complicated methods than SGD. This paper proposes a new method to adaptively estimate a preconditioner, such that the amplitudes of perturbations of preconditioned stochastic gradient match that of the perturbations of parameters to be optimized in a way comparable to Newton method for deterministic optimization. Unlike the preconditioners based on secant equation fitting as done in deterministic quasi-Newton methods, which assume positive definite Hessian and approximate its inverse, the new preconditioner works equally well for both convex and nonconvex optimizations with exact or noisy gradients. When stochastic gradient is used, it can naturally damp the gradient noise to stabilize SGD. Efficient preconditioner estimation methods are developed, and with reasonable simplifications, they are applicable to large-scale problems. Experimental results demonstrate that equipped with the new preconditioner, without any tuning effort, preconditioned SGD can efficiently solve many challenging problems like the training of a deep neural network or a recurrent neural network requiring extremely long-term memories.
Empirical insights into the stochasticity of small RNA sequencing
Qin, Li-Xuan; Tuschl, Thomas; Singer, Samuel
2016-01-01
The choice of stochasticity distribution for modeling the noise distribution is a fundamental assumption for the analysis of sequencing data and consequently is critical for the accurate assessment of biological heterogeneity and differential expression. The stochasticity of RNA sequencing has been assumed to follow Poisson distributions. We collected microRNA sequencing data and observed that its stochasticity is better approximated by gamma distributions, likely because of the stochastic na...
Fourier analysis and stochastic processes
Brémaud, Pierre
2014-01-01
This work is unique as it provides a uniform treatment of the Fourier theories of functions (Fourier transforms and series, z-transforms), finite measures (characteristic functions, convergence in distribution), and stochastic processes (including arma series and point processes). It emphasises the links between these three themes. The chapter on the Fourier theory of point processes and signals structured by point processes is a novel addition to the literature on Fourier analysis of stochastic processes. It also connects the theory with recent lines of research such as biological spike signals and ultrawide-band communications. Although the treatment is mathematically rigorous, the convivial style makes the book accessible to a large audience. In particular, it will be interesting to anyone working in electrical engineering and communications, biology (point process signals) and econometrics (arma models). A careful review of the prerequisites (integration and probability theory in the appendix, Hilbert spa...
QB1 - Stochastic Gene Regulation
Energy Technology Data Exchange (ETDEWEB)
Munsky, Brian [Los Alamos National Laboratory
2012-07-23
Summaries of this presentation are: (1) Stochastic fluctuations or 'noise' is present in the cell - Random motion and competition between reactants, Low copy, quantization of reactants, Upstream processes; (2) Fluctuations may be very important - Cell-to-cell variability, Cell fate decisions (switches), Signal amplification or damping, stochastic resonances; and (3) Some tools are available to mode these - Kinetic Monte Carlo simulations (SSA and variants), Moment approximation methods, Finite State Projection. We will see how modeling these reactions can tell us more about the underlying processes of gene regulation.
Quantum simulation of a quantum stochastic walk
Govia, Luke C. G.; Taketani, Bruno G.; Schuhmacher, Peter K.; Wilhelm, Frank K.
2017-03-01
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk (QSW), which allows for incoherent movement of the walker, and therefore, directionality, is a generalization on the fully coherent quantum walk. While a QSW can always be described in Lindblad formalism, this does not mean that it can be microscopically derived in the standard weak-coupling limit under the Born-Markov approximation. This restricts the class of QSWs that can be experimentally realized in a simple manner. To circumvent this restriction, we introduce a technique to simulate open system evolution on a fully coherent quantum computer, using a quantum trajectories style approach. We apply this technique to a broad class of QSWs, and show that they can be simulated with minimal experimental resources. Our work opens the path towards the experimental realization of QSWs on large graphs with existing quantum technologies.
Stochastic differential equation model to Prendiville processes
Granita, Bahar, Arifah
2015-10-01
The Prendiville process is another variation of the logistic model which assumes linearly decreasing population growth rate. It is a continuous time Markov chain (CTMC) taking integer values in the finite interval. The continuous time Markov chain can be approximated by stochastic differential equation (SDE). This paper discusses the stochastic differential equation of Prendiville process. The work started with the forward Kolmogorov equation in continuous time Markov chain of Prendiville process. Then it was formulated in the form of a central-difference approximation. The approximation was then used in Fokker-Planck equation in relation to the stochastic differential equation of the Prendiville process. The explicit solution of the Prendiville process was obtained from the stochastic differential equation. Therefore, the mean and variance function of the Prendiville process could be easily found from the explicit solution.
Generating 3D Scenes in the style of Keith Haring
Ronfard, Rémi; Doussot, Quentin
2012-01-01
http://www.generativeart.com; International audience; Recently, interest in shape grammar models of pictorial style has been revived by the success of generative modelers for buildings and cities. Stochastic methods have been introduced for learning the parameters of shape grammars to adapt to different architectural or visual styles, including Mondrian. We extend those recent approaches for generating 3D graphics in the style of Keith Haring paintings, whose visual vocabulary is significantl...
Energy Technology Data Exchange (ETDEWEB)
Blaskiewicz, M.
2011-01-01
Stochastic Cooling was invented by Simon van der Meer and was demonstrated at the CERN ISR and ICE (Initial Cooling Experiment). Operational systems were developed at Fermilab and CERN. A complete theory of cooling of unbunched beams was developed, and was applied at CERN and Fermilab. Several new and existing rings employ coasting beam cooling. Bunched beam cooling was demonstrated in ICE and has been observed in several rings designed for coasting beam cooling. High energy bunched beams have proven more difficult. Signal suppression was achieved in the Tevatron, though operational cooling was not pursued at Fermilab. Longitudinal cooling was achieved in the RHIC collider. More recently a vertical cooling system in RHIC cooled both transverse dimensions via betatron coupling.
Lanchier, Nicolas
2017-01-01
Three coherent parts form the material covered in this text, portions of which have not been widely covered in traditional textbooks. In this coverage the reader is quickly introduced to several different topics enriched with 175 exercises which focus on real-world problems. Exercises range from the classics of probability theory to more exotic research-oriented problems based on numerical simulations. Intended for graduate students in mathematics and applied sciences, the text provides the tools and training needed to write and use programs for research purposes. The first part of the text begins with a brief review of measure theory and revisits the main concepts of probability theory, from random variables to the standard limit theorems. The second part covers traditional material on stochastic processes, including martingales, discrete-time Markov chains, Poisson processes, and continuous-time Markov chains. The theory developed is illustrated by a variety of examples surrounding applications such as the ...
Stochastic Averaging and Stochastic Extremum Seeking
Liu, Shu-Jun
2012-01-01
Stochastic Averaging and Stochastic Extremum Seeking develops methods of mathematical analysis inspired by the interest in reverse engineering and analysis of bacterial convergence by chemotaxis and to apply similar stochastic optimization techniques in other environments. The first half of the text presents significant advances in stochastic averaging theory, necessitated by the fact that existing theorems are restricted to systems with linear growth, globally exponentially stable average models, vanishing stochastic perturbations, and prevent analysis over infinite time horizon. The second half of the text introduces stochastic extremum seeking algorithms for model-free optimization of systems in real time using stochastic perturbations for estimation of their gradients. Both gradient- and Newton-based algorithms are presented, offering the user the choice between the simplicity of implementation (gradient) and the ability to achieve a known, arbitrary convergence rate (Newton). The design of algorithms...
Approximate Dynamic Programming by Practical Examples
Mes, Martijn R.K.; Perez Rivera, Arturo Eduardo; Boucherie, Richard; van Dijk, Nico M.
2017-01-01
Computing the exact solution of an MDP model is generally difficult and possibly intractable for realistically sized problem instances. A powerful technique to solve the large scale discrete time multistage stochastic control processes is Approximate Dynamic Programming (ADP). Although ADP is used
Hardwick, Robert J.; Vennin, Vincent; Byrnes, Christian T.; Torrado, Jesús; Wands, David
2017-10-01
We study the stochastic distribution of spectator fields predicted in different slow-roll inflation backgrounds. Spectator fields have a negligible energy density during inflation but may play an important dynamical role later, even giving rise to primordial density perturbations within our observational horizon today. During de-Sitter expansion there is an equilibrium solution for the spectator field which is often used to estimate the stochastic distribution during slow-roll inflation. However slow roll only requires that the Hubble rate varies slowly compared to the Hubble time, while the time taken for the stochastic distribution to evolve to the de-Sitter equilibrium solution can be much longer than a Hubble time. We study both chaotic (monomial) and plateau inflaton potentials, with quadratic, quartic and axionic spectator fields. We give an adiabaticity condition for the spectator field distribution to relax to the de-Sitter equilibrium, and find that the de-Sitter approximation is never a reliable estimate for the typical distribution at the end of inflation for a quadratic spectator during monomial inflation. The existence of an adiabatic regime at early times can erase the dependence on initial conditions of the final distribution of field values. In these cases, spectator fields acquire sub-Planckian expectation values. Otherwise spectator fields may acquire much larger field displacements than suggested by the de-Sitter equilibrium solution. We quantify the information about initial conditions that can be obtained from the final field distribution. Our results may have important consequences for the viability of spectator models for the origin of structure, such as the simplest curvaton models.
The closure approximation in the hierarchy equations.
Adomian, G.
1971-01-01
The expectation of the solution process in a stochastic operator equation can be obtained from averaged equations only under very special circumstances. Conditions for validity are given and the significance and validity of the approximation in widely used hierarchy methods and the ?self-consistent field' approximation in nonequilibrium statistical mechanics are clarified. The error at any level of the hierarchy can be given and can be avoided by the use of the iterative method.
CAM Stochastic Volatility Model for Option Pricing
Directory of Open Access Journals (Sweden)
Wanwan Huang
2016-01-01
Full Text Available The coupled additive and multiplicative (CAM noises model is a stochastic volatility model for derivative pricing. Unlike the other stochastic volatility models in the literature, the CAM model uses two Brownian motions, one multiplicative and one additive, to model the volatility process. We provide empirical evidence that suggests a nontrivial relationship between the kurtosis and skewness of asset prices and that the CAM model is able to capture this relationship, whereas the traditional stochastic volatility models cannot. We introduce a control variate method and Monte Carlo estimators for some of the sensitivities (Greeks of the model. We also derive an approximation for the characteristic function of the model.
Stochastic Blind Motion Deblurring
Xiao, Lei
2015-05-13
Blind motion deblurring from a single image is a highly under-constrained problem with many degenerate solutions. A good approximation of the intrinsic image can therefore only be obtained with the help of prior information in the form of (often non-convex) regularization terms for both the intrinsic image and the kernel. While the best choice of image priors is still a topic of ongoing investigation, this research is made more complicated by the fact that historically each new prior requires the development of a custom optimization method. In this paper, we develop a stochastic optimization method for blind deconvolution. Since this stochastic solver does not require the explicit computation of the gradient of the objective function and uses only efficient local evaluation of the objective, new priors can be implemented and tested very quickly. We demonstrate that this framework, in combination with different image priors produces results with PSNR values that match or exceed the results obtained by much more complex state-of-the-art blind motion deblurring algorithms.
Variational principles for stochastic fluid dynamics
Holm, Darryl D.
2015-01-01
This paper derives stochastic partial differential equations (SPDEs) for fluid dynamics from a stochastic variational principle (SVP). The paper proceeds by taking variations in the SVP to derive stochastic Stratonovich fluid equations; writing their Itô representation; and then investigating the properties of these stochastic fluid models in comparison with each other, and with the corresponding deterministic fluid models. The circulation properties of the stochastic Stratonovich fluid equations are found to closely mimic those of the deterministic ideal fluid models. As with deterministic ideal flows, motion along the stochastic Stratonovich paths also preserves the helicity of the vortex field lines in incompressible stochastic flows. However, these Stratonovich properties are not apparent in the equivalent Itô representation, because they are disguised by the quadratic covariation drift term arising in the Stratonovich to Itô transformation. This term is a geometric generalization of the quadratic covariation drift term already found for scalar densities in Stratonovich's famous 1966 paper. The paper also derives motion equations for two examples of stochastic geophysical fluid dynamics; namely, the Euler–Boussinesq and quasi-geostropic approximations. PMID:27547083
DEFF Research Database (Denmark)
Handberg, Kristian
2011-01-01
Postmodernismen er kommet på museum i Victoria and Alberts stort anlagte udstilling Postmodernism. Style and Subversion 1970-1990. Reportage fra en udstilling, der spænder fra filosofi til firserpop og tager den nære fortid på museum....
Foundations of infinitesimal stochastic analysis
Stroyan, KD
2011-01-01
This book gives a complete and elementary account of fundamental results on hyperfinite measures and their application to stochastic processes, including the *-finite Stieltjes sum approximation of martingale integrals. Many detailed examples, not found in the literature, are included. It begins with a brief chapter on tools from logic and infinitesimal (or non-standard) analysis so that the material is accessible to beginning graduate students.
Stochastic Control with Partial Observation and Approximation Techniques.
1987-01-01
Fltrage Non Lindalre par Morceaux Catherine Savona UN ALGORITHME DE RESOLUTION APPROCHEE POUR LE FILTRAGE LINEAIRE PAR MORCEAUX Catherine SAVONA INRIA...smoothing with high signal -to- roise ratio. To appear i n P roc. 8 ibos Coot. C.1 cSavona Filtrage linieire par morceaux, These ( 1986). (12] C. Savona Un...algrithme de resolution approchee pour le filtrage linialre par morceaux, Preprint. E£~g APPENDIX 1 Un Algorithme de Rdsolution Approchke Pour le
Numerical methods for stochastic partial differential equations with white noise
Zhang, Zhongqiang
2017-01-01
This book covers numerical methods for stochastic partial differential equations with white noise using the framework of Wong-Zakai approximation. The book begins with some motivational and background material in the introductory chapters and is divided into three parts. Part I covers numerical stochastic ordinary differential equations. Here the authors start with numerical methods for SDEs with delay using the Wong-Zakai approximation and finite difference in time. Part II covers temporal white noise. Here the authors consider SPDEs as PDEs driven by white noise, where discretization of white noise (Brownian motion) leads to PDEs with smooth noise, which can then be treated by numerical methods for PDEs. In this part, recursive algorithms based on Wiener chaos expansion and stochastic collocation methods are presented for linear stochastic advection-diffusion-reaction equations. In addition, stochastic Euler equations are exploited as an application of stochastic collocation methods, where a numerical compa...
Stochastic tools in turbulence
Lumey, John L
2012-01-01
Stochastic Tools in Turbulence discusses the available mathematical tools to describe stochastic vector fields to solve problems related to these fields. The book deals with the needs of turbulence in relation to stochastic vector fields, particularly, on three-dimensional aspects, linear problems, and stochastic model building. The text describes probability distributions and densities, including Lebesgue integration, conditional probabilities, conditional expectations, statistical independence, lack of correlation. The book also explains the significance of the moments, the properties of the
Dzhunushaliev, Vladimir
2010-01-01
Stochastic Einstein equations are considered when 3D space metric $\\gamma_{ij}$ are stochastic functions. The probability density for the stochastic quantities is connected with the Perelman's entropy functional. As an example, the Friedman Universe is considered. It is shown that for the Friedman Universe the dynamical evolution is not changed. The connection between general relativity and Ricci flows is discussed.
Hyperbolic Cross Truncations for Stochastic Fourier Cosine Series
Zhang, Zhihua
2014-01-01
Based on our decomposition of stochastic processes and our asymptotic representations of Fourier cosine coefficients, we deduce an asymptotic formula of approximation errors of hyperbolic cross truncations for bivariate stochastic Fourier cosine series. Moreover we propose a kind of Fourier cosine expansions with polynomials factors such that the corresponding Fourier cosine coefficients decay very fast. Although our research is in the setting of stochastic processes, our results are also new for deterministic functions. PMID:25147842
A random dynamical systems perspective on stochastic resonance
Cherubini, Anna Maria; Lamb, Jeroen S. W.; Rasmussen, Martin; Sato, Yuzuru
2017-07-01
We study stochastic resonance in an over-damped approximation of the stochastic Duffing oscillator from a random dynamical systems point of view. We analyse this problem in the general framework of random dynamical systems with a nonautonomous forcing. We prove the existence of a unique global attracting random periodic orbit and a stationary periodic measure. We use the stationary periodic measure to define an indicator for the stochastic resonance.
A random dynamical systems perspective on stochastic resonance
Cherubini, Anna Maria; Lamb, Jeroen S. W.; Rasmussen, Martin; Sato, Yuzuru
2015-01-01
We study stochastic resonance in an over-damped approximation of the stochastic Duffing oscillator from a random dynamical systems point of view. We analyse this problem in the general framework of random dynamical systems with a nonautonomous forcing. We prove the existence of a unique global attracting random periodic orbit and a stationary periodic measure. We use the stationary periodic measure to define an indicator for the stochastic resonance.
Numerical methods for stochastic differential equations
Kloeden, Peter; Platen, Eckhard
1991-06-01
The numerical analysis of stochastic differential equations differs significantly from that of ordinary differential equations due to the peculiarities of stochastic calculus. This book provides an introduction to stochastic calculus and stochastic differential equations, both theory and applications. The main emphasise is placed on the numerical methods needed to solve such equations. It assumes an undergraduate background in mathematical methods typical of engineers and physicists, through many chapters begin with a descriptive summary which may be accessible to others who only require numerical recipes. To help the reader develop an intuitive understanding of the underlying mathematicals and hand-on numerical skills exercises and over 100 PC Exercises (PC-personal computer) are included. The stochastic Taylor expansion provides the key tool for the systematic derivation and investigation of discrete time numerical methods for stochastic differential equations. The book presents many new results on higher order methods for strong sample path approximations and for weak functional approximations, including implicit, predictor-corrector, extrapolation and variance-reduction methods. Besides serving as a basic text on such methods. the book offers the reader ready access to a large number of potential research problems in a field that is just beginning to expand rapidly and is widely applicable.
Perspective: Stochastic algorithms for chemical kinetics.
Gillespie, Daniel T; Hellander, Andreas; Petzold, Linda R
2013-05-07
We outline our perspective on stochastic chemical kinetics, paying particular attention to numerical simulation algorithms. We first focus on dilute, well-mixed systems, whose description using ordinary differential equations has served as the basis for traditional chemical kinetics for the past 150 years. For such systems, we review the physical and mathematical rationale for a discrete-stochastic approach, and for the approximations that need to be made in order to regain the traditional continuous-deterministic description. We next take note of some of the more promising strategies for dealing stochastically with stiff systems, rare events, and sensitivity analysis. Finally, we review some recent efforts to adapt and extend the discrete-stochastic approach to systems that are not well-mixed. In that currently developing area, we focus mainly on the strategy of subdividing the system into well-mixed subvolumes, and then simulating diffusional transfers of reactant molecules between adjacent subvolumes together with chemical reactions inside the subvolumes.
Ogawa, Shigeyoshi
2017-01-01
This book presents an elementary introduction to the theory of noncausal stochastic calculus that arises as a natural alternative to the standard theory of stochastic calculus founded in 1944 by Professor Kiyoshi Itô. As is generally known, Itô Calculus is essentially based on the "hypothesis of causality", asking random functions to be adapted to a natural filtration generated by Brownian motion or more generally by square integrable martingale. The intention in this book is to establish a stochastic calculus that is free from this "hypothesis of causality". To be more precise, a noncausal theory of stochastic calculus is developed in this book, based on the noncausal integral introduced by the author in 1979. After studying basic properties of the noncausal stochastic integral, various concrete problems of noncausal nature are considered, mostly concerning stochastic functional equations such as SDE, SIE, SPDE, and others, to show not only the necessity of such theory of noncausal stochastic calculus but ...
Stochastic differential equations and numerical simulation for pedestrians
Energy Technology Data Exchange (ETDEWEB)
Garrison, J.C.
1993-07-27
The mathematical foundation of the Ito interpretation of stochastic ordinary and partial differential equations is briefly explained. This provides the basis for a review of simple difference approximations to stochastic differential equations. An example arising in the theory of optical switching is discussed.
Howard, W. C.
2005-01-01
The Four Styles narrative of Leadership is written in three sections: (1) Overview of Leadership Styles; (2) Analysis of Leadership Styles; and (3) Applications of Leadership Styles. While the primary foundation for its development was generated from more than 30 years of research and studying leadership styles in education, the secondary…
Affective Style, Humor Styles and Happiness
Directory of Open Access Journals (Sweden)
Thomas E. Ford
2014-08-01
Full Text Available The present study examined the relationships between dispositional approach and avoidance motives, humor styles, and happiness. In keeping with previous research, approach motives and the two positive humor styles (self-enhancing and affiliative positively correlated with happiness, whereas avoidance motives and the two negative humor styles (self-defeating and aggressive negatively correlated with happiness. Also, we found support for three new hypotheses. First, approach motives correlated positively with self-enhancing and affiliative humor styles. Second, avoidance motives correlated positively with self-defeating humor style, and third, the positive relationship between approach motives and happiness was mediated by self-enhancing humor style.
Memory-optimal neural network approximation
Bölcskei, Helmut; Grohs, Philipp; Kutyniok, Gitta; Petersen, Philipp
2017-08-01
We summarize the main results of a recent theory-developed by the authors-establishing fundamental lower bounds on the connectivity and memory requirements of deep neural networks as a function of the complexity of the function class to be approximated by the network. These bounds are shown to be achievable. Specifically, all function classes that are optimally approximated by a general class of representation systems-so-called affine systems-can be approximated by deep neural networks with minimal connectivity and memory requirements. Affine systems encompass a wealth of representation systems from applied harmonic analysis such as wavelets, shearlets, ridgelets, α-shearlets, and more generally α-molecules. This result elucidates a remarkable universality property of deep neural networks and shows that they achieve the optimum approximation properties of all affine systems combined. Finally, we present numerical experiments demonstrating that the standard stochastic gradient descent algorithm generates deep neural networks which provide close-to-optimal approximation rates at minimal connectivity. Moreover, stochastic gradient descent is found to actually learn approximations that are sparse in the representation system optimally sparsifying the function class the network is trained on.
Stochastic finite element method with simple random elements
Starkloff, Hans-Jörg
2008-01-01
We propose a variant of the stochastic finite element method, where the random elements occuring in the problem formulation are approximated by simple random elements, i.e. random elements with only a finite number of possible values.
Fundamentals of Stochastic Networks
Ibe, Oliver C
2011-01-01
An interdisciplinary approach to understanding queueing and graphical networks In today's era of interdisciplinary studies and research activities, network models are becoming increasingly important in various areas where they have not regularly been used. Combining techniques from stochastic processes and graph theory to analyze the behavior of networks, Fundamentals of Stochastic Networks provides an interdisciplinary approach by including practical applications of these stochastic networks in various fields of study, from engineering and operations management to communications and the physi
Acoustic wave propagation and stochastic effects in metamaterial absorbers
DEFF Research Database (Denmark)
Christensen, Johan; Willatzen, Morten
2014-01-01
We show how stochastic variations of the effective parameters of anisotropic structured metamaterials can lead to increased absorption of sound. For this, we derive an analytical model based on the Bourret approximation and illustrate the immediate connection between material disorder and attenua......We show how stochastic variations of the effective parameters of anisotropic structured metamaterials can lead to increased absorption of sound. For this, we derive an analytical model based on the Bourret approximation and illustrate the immediate connection between material disorder...
Information Anatomy of Stochastic Equilibria
Directory of Open Access Journals (Sweden)
Sarah Marzen
2014-08-01
Full Text Available A stochastic nonlinear dynamical system generates information, as measured by its entropy rate. Some—the ephemeral information—is dissipated and some—the bound information—is actively stored and so affects future behavior. We derive analytic expressions for the ephemeral and bound information in the limit of infinitesimal time discretization for two classical systems that exhibit dynamical equilibria: first-order Langevin equations (i where the drift is the gradient of an analytic potential function and the diffusion matrix is invertible and (ii with a linear drift term (Ornstein–Uhlenbeck, but a noninvertible diffusion matrix. In both cases, the bound information is sensitive to the drift and diffusion, while the ephemeral information is sensitive only to the diffusion matrix and not to the drift. Notably, this information anatomy changes discontinuously as any of the diffusion coefficients vanishes, indicating that it is very sensitive to the noise structure. We then calculate the information anatomy of the stochastic cusp catastrophe and of particles diffusing in a heat bath in the overdamped limit, both examples of stochastic gradient descent on a potential landscape. Finally, we use our methods to calculate and compare approximations for the time-local predictive information for adaptive agents.
Multivariate moment closure techniques for stochastic kinetic models
Energy Technology Data Exchange (ETDEWEB)
Lakatos, Eszter, E-mail: e.lakatos13@imperial.ac.uk; Ale, Angelique; Kirk, Paul D. W.; Stumpf, Michael P. H., E-mail: m.stumpf@imperial.ac.uk [Department of Life Sciences, Centre for Integrative Systems Biology and Bioinformatics, Imperial College London, London SW7 2AZ (United Kingdom)
2015-09-07
Stochastic effects dominate many chemical and biochemical processes. Their analysis, however, can be computationally prohibitively expensive and a range of approximation schemes have been proposed to lighten the computational burden. These, notably the increasingly popular linear noise approximation and the more general moment expansion methods, perform well for many dynamical regimes, especially linear systems. At higher levels of nonlinearity, it comes to an interplay between the nonlinearities and the stochastic dynamics, which is much harder to capture correctly by such approximations to the true stochastic processes. Moment-closure approaches promise to address this problem by capturing higher-order terms of the temporally evolving probability distribution. Here, we develop a set of multivariate moment-closures that allows us to describe the stochastic dynamics of nonlinear systems. Multivariate closure captures the way that correlations between different molecular species, induced by the reaction dynamics, interact with stochastic effects. We use multivariate Gaussian, gamma, and lognormal closure and illustrate their use in the context of two models that have proved challenging to the previous attempts at approximating stochastic dynamics: oscillations in p53 and Hes1. In addition, we consider a larger system, Erk-mediated mitogen-activated protein kinases signalling, where conventional stochastic simulation approaches incur unacceptably high computational costs.
Multivariate moment closure techniques for stochastic kinetic models
Lakatos, Eszter; Ale, Angelique; Kirk, Paul D. W.; Stumpf, Michael P. H.
2015-09-01
Stochastic effects dominate many chemical and biochemical processes. Their analysis, however, can be computationally prohibitively expensive and a range of approximation schemes have been proposed to lighten the computational burden. These, notably the increasingly popular linear noise approximation and the more general moment expansion methods, perform well for many dynamical regimes, especially linear systems. At higher levels of nonlinearity, it comes to an interplay between the nonlinearities and the stochastic dynamics, which is much harder to capture correctly by such approximations to the true stochastic processes. Moment-closure approaches promise to address this problem by capturing higher-order terms of the temporally evolving probability distribution. Here, we develop a set of multivariate moment-closures that allows us to describe the stochastic dynamics of nonlinear systems. Multivariate closure captures the way that correlations between different molecular species, induced by the reaction dynamics, interact with stochastic effects. We use multivariate Gaussian, gamma, and lognormal closure and illustrate their use in the context of two models that have proved challenging to the previous attempts at approximating stochastic dynamics: oscillations in p53 and Hes1. In addition, we consider a larger system, Erk-mediated mitogen-activated protein kinases signalling, where conventional stochastic simulation approaches incur unacceptably high computational costs.
Evolution with Stochastic Fitness and Stochastic Migration
Rice, Sean H.; Papadopoulos, Anthony
2009-01-01
Background Migration between local populations plays an important role in evolution - influencing local adaptation, speciation, extinction, and the maintenance of genetic variation. Like other evolutionary mechanisms, migration is a stochastic process, involving both random and deterministic elements. Many models of evolution have incorporated migration, but these have all been based on simplifying assumptions, such as low migration rate, weak selection, or large population size. We thus have no truly general and exact mathematical description of evolution that incorporates migration. Methodology/Principal Findings We derive an exact equation for directional evolution, essentially a stochastic Price equation with migration, that encompasses all processes, both deterministic and stochastic, contributing to directional change in an open population. Using this result, we show that increasing the variance in migration rates reduces the impact of migration relative to selection. This means that models that treat migration as a single parameter tend to be biassed - overestimating the relative impact of immigration. We further show that selection and migration interact in complex ways, one result being that a strategy for which fitness is negatively correlated with migration rates (high fitness when migration is low) will tend to increase in frequency, even if it has lower mean fitness than do other strategies. Finally, we derive an equation for the effective migration rate, which allows some of the complex stochastic processes that we identify to be incorporated into models with a single migration parameter. Conclusions/Significance As has previously been shown with selection, the role of migration in evolution is determined by the entire distributions of immigration and emigration rates, not just by the mean values. The interactions of stochastic migration with stochastic selection produce evolutionary processes that are invisible to deterministic evolutionary theory
Indian Academy of Sciences (India)
andoh
input signals, consisting of random square waves. We find that, in an optimal band of noise, the output consistently is a logical combination of the input signals: Logical Stochastic Resonance. (LSR) with K. Murali, W.L. Ditto, A. Bulsara. Physical Review Letters, March 2009. Sudeshna Sinha. Logical Stochastic Resonance ...
Stochastic Convection Parameterizations
Teixeira, Joao; Reynolds, Carolyn; Suselj, Kay; Matheou, Georgios
2012-01-01
computational fluid dynamics, radiation, clouds, turbulence, convection, gravity waves, surface interaction, radiation interaction, cloud and aerosol microphysics, complexity (vegetation, biogeochemistry, radiation versus turbulence/convection stochastic approach, non-linearities, Monte Carlo, high resolutions, large-Eddy Simulations, cloud structure, plumes, saturation in tropics, forecasting, parameterizations, stochastic, radiation-clod interaction, hurricane forecasts
A Stochastic Employment Problem
Wu, Teng
2013-01-01
The Stochastic Employment Problem(SEP) is a variation of the Stochastic Assignment Problem which analyzes the scenario that one assigns balls into boxes. Balls arrive sequentially with each one having a binary vector X = (X[subscript 1], X[subscript 2],...,X[subscript n]) attached, with the interpretation being that if X[subscript i] = 1 the ball…
Computing approximate diagnoses by using approximate entailment
Teije, A. ten; Harmelen, van F.A.H.
1996-01-01
The most widely accepted models of diagnostic reasoning are all phrased in terms of the logical consequence relations. In work in recent years, Schaerf and Cadoli have proposed efficient approximations of the classical consequence relation. The central idea of this paper is to parameterise the
Dynamic and stochastic multi-project planning
Melchiors, Philipp
2015-01-01
This book deals with dynamic and stochastic methods for multi-project planning. Based on the idea of using queueing networks for the analysis of dynamic-stochastic multi-project environments this book addresses two problems: detailed scheduling of project activities, and integrated order acceptance and capacity planning. In an extensive simulation study, the book thoroughly investigates existing scheduling policies. To obtain optimal and near optimal scheduling policies new models and algorithms are proposed based on the theory of Markov decision processes and Approximate Dynamic programming.
Master-equation approach to stochastic neurodynamics
Ohira, Toru; Cowan, Jack D.
1993-09-01
A master-equation approach to the stochastic neurodynamics proposed by Cowan [in Advances in Neural Information Processing Systems 3, edited by R. P. Lippman, J. E. Moody, and D. S. Touretzky (Morgan Kaufmann, San Mateo, 1991), p. 62] is investigated in this paper. We deal with a model neural network that is composed of two-state neurons obeying elementary stochastic transition rates. We show that such an approach yields concise expressions for multipoint moments and an equation of motion. We apply the formalism to a (1+1)-dimensional system. Exact and approximate expressions for various statistical parameters are obtained and compared with Monte Carlo simulations.
Stochastic volatility selected readings
Shephard, Neil
2005-01-01
Neil Shephard has brought together a set of classic and central papers that have contributed to our understanding of financial volatility. They cover stocks, bonds and currencies and range from 1973 up to 2001. Shephard, a leading researcher in the field, provides a substantial introduction in which he discusses all major issues involved. General Introduction N. Shephard. Part I: Model Building. 1. A Subordinated Stochastic Process Model with Finite Variance for Speculative Prices, (P. K. Clark). 2. Financial Returns Modelled by the Product of Two Stochastic Processes: A Study of Daily Sugar Prices, 1961-7, S. J. Taylor. 3. The Behavior of Random Variables with Nonstationary Variance and the Distribution of Security Prices, B. Rosenberg. 4. The Pricing of Options on Assets with Stochastic Volatilities, J. Hull and A. White. 5. The Dynamics of Exchange Rate Volatility: A Multivariate Latent Factor ARCH Model, F. X. Diebold and M. Nerlove. 6. Multivariate Stochastic Variance Models. 7. Stochastic Autoregressive...
Greenwood, Priscilla E
2016-01-01
This book describes a large number of open problems in the theory of stochastic neural systems, with the aim of enticing probabilists to work on them. This includes problems arising from stochastic models of individual neurons as well as those arising from stochastic models of the activities of small and large networks of interconnected neurons. The necessary neuroscience background to these problems is outlined within the text, so readers can grasp the context in which they arise. This book will be useful for graduate students and instructors providing material and references for applying probability to stochastic neuron modeling. Methods and results are presented, but the emphasis is on questions where additional stochastic analysis may contribute neuroscience insight. An extensive bibliography is included. Dr. Priscilla E. Greenwood is a Professor Emerita in the Department of Mathematics at the University of British Columbia. Dr. Lawrence M. Ward is a Professor in the Department of Psychology and the Brain...
A first course in stochastic processes
Karlin, Samuel
1975-01-01
The purpose, level, and style of this new edition conform to the tenets set forth in the original preface. The authors continue with their tack of developing simultaneously theory and applications, intertwined so that they refurbish and elucidate each other.The authors have made three main kinds of changes. First, they have enlarged on the topics treated in the first edition. Second, they have added many exercises and problems at the end of each chapter. Third, and most important, they have supplied, in new chapters, broad introductory discussions of several classes of stochastic processe
Energy Technology Data Exchange (ETDEWEB)
X. Frank Xu
2010-03-30
Multiscale modeling of stochastic systems, or uncertainty quantization of multiscale modeling is becoming an emerging research frontier, with rapidly growing engineering applications in nanotechnology, biotechnology, advanced materials, and geo-systems, etc. While tremendous efforts have been devoted to either stochastic methods or multiscale methods, little combined work had been done on integration of multiscale and stochastic methods, and there was no method formally available to tackle multiscale problems involving uncertainties. By developing an innovative Multiscale Stochastic Finite Element Method (MSFEM), this research has made a ground-breaking contribution to the emerging field of Multiscale Stochastic Modeling (MSM) (Fig 1). The theory of MSFEM basically decomposes a boundary value problem of random microstructure into a slow scale deterministic problem and a fast scale stochastic one. The slow scale problem corresponds to common engineering modeling practices where fine-scale microstructure is approximated by certain effective constitutive constants, which can be solved by using standard numerical solvers. The fast scale problem evaluates fluctuations of local quantities due to random microstructure, which is important for scale-coupling systems and particularly those involving failure mechanisms. The Green-function-based fast-scale solver developed in this research overcomes the curse-of-dimensionality commonly met in conventional approaches, by proposing a random field-based orthogonal expansion approach. The MSFEM formulated in this project paves the way to deliver the first computational tool/software on uncertainty quantification of multiscale systems. The applications of MSFEM on engineering problems will directly enhance our modeling capability on materials science (composite materials, nanostructures), geophysics (porous media, earthquake), biological systems (biological tissues, bones, protein folding). Continuous development of MSFEM will
Niiniluoto, Ilkka
2014-03-01
Approximation of laws is an important theme in the philosophy of science. If we can make sense of the idea that two scientific laws are "close" to each other, then we can also analyze such methodological notions as approximate explanation of laws, approximate reduction of theories, approximate empirical success of theories, and approximate truth of laws. Proposals for measuring the distance between quantitative scientific laws were given in Niiniluoto (1982, 1987). In this paper, these definitions are reconsidered as a response to the interesting critical remarks by Liu (1999).
Sparse approximation with bases
2015-01-01
This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications. The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...
Structural factoring approach for analyzing stochastic networks
Hayhurst, Kelly J.; Shier, Douglas R.
1991-01-01
The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.
AESS: Accelerated Exact Stochastic Simulation
Jenkins, David D.; Peterson, Gregory D.
2011-12-01
The Stochastic Simulation Algorithm (SSA) developed by Gillespie provides a powerful mechanism for exploring the behavior of chemical systems with small species populations or with important noise contributions. Gene circuit simulations for systems biology commonly employ the SSA method, as do ecological applications. This algorithm tends to be computationally expensive, so researchers seek an efficient implementation of SSA. In this program package, the Accelerated Exact Stochastic Simulation Algorithm (AESS) contains optimized implementations of Gillespie's SSA that improve the performance of individual simulation runs or ensembles of simulations used for sweeping parameters or to provide statistically significant results. Program summaryProgram title: AESS Catalogue identifier: AEJW_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJW_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: University of Tennessee copyright agreement No. of lines in distributed program, including test data, etc.: 10 861 No. of bytes in distributed program, including test data, etc.: 394 631 Distribution format: tar.gz Programming language: C for processors, CUDA for NVIDIA GPUs Computer: Developed and tested on various x86 computers and NVIDIA C1060 Tesla and GTX 480 Fermi GPUs. The system targets x86 workstations, optionally with multicore processors or NVIDIA GPUs as accelerators. Operating system: Tested under Ubuntu Linux OS and CentOS 5.5 Linux OS Classification: 3, 16.12 Nature of problem: Simulation of chemical systems, particularly with low species populations, can be accurately performed using Gillespie's method of stochastic simulation. Numerous variations on the original stochastic simulation algorithm have been developed, including approaches that produce results with statistics that exactly match the chemical master equation (CME) as well as other approaches that approximate the CME. Solution
Stochastic Processes in Electrochemistry.
Singh, Pradyumna S; Lemay, Serge G
2016-05-17
Stochastic behavior becomes an increasingly dominant characteristic of electrochemical systems as we probe them on the smallest scales. Advances in the tools and techniques of nanoelectrochemistry dictate that stochastic phenomena will become more widely manifest in the future. In this Perspective, we outline the conceptual tools that are required to analyze and understand this behavior. We draw on examples from several specific electrochemical systems where important information is encoded in, and can be derived from, apparently random signals. This Perspective attempts to serve as an accessible introduction to understanding stochastic phenomena in electrochemical systems and outlines why they cannot be understood with conventional macroscopic descriptions.
Fundamentals of Stochastic Filtering
Crisan, Dan
2008-01-01
The objective of stochastic filtering is to determine the best estimate for the state of a stochastic dynamical system from partial observations. The solution of this problem in the linear case is the well known Kalman-Bucy filter which has found widespread practical application. The purpose of this book is to provide a rigorous mathematical treatment of the non-linear stochastic filtering problem using modern methods. Particular emphasis is placed on the theoretical analysis of numerical methods for the solution of the filtering problem via particle methods. The book should provide sufficient
Sequential stochastic optimization
Cairoli, Renzo
1996-01-01
Sequential Stochastic Optimization provides mathematicians and applied researchers with a well-developed framework in which stochastic optimization problems can be formulated and solved. Offering much material that is either new or has never before appeared in book form, it lucidly presents a unified theory of optimal stopping and optimal sequential control of stochastic processes. This book has been carefully organized so that little prior knowledge of the subject is assumed; its only prerequisites are a standard graduate course in probability theory and some familiarity with discrete-paramet
Rodriguez-Cancio, Marcelino; Combemale, Benoit; Baudry, Benoit
2016-01-01
We introduce Approximate Unrolling, a loop optimization that reduces execution time and energy consumption, exploiting the existence of code regions that can endure some degree of approximation while still producing acceptable results. This work focuses on a specific kind of forgiving region: counted loops that map a given functions over the elements of an array. Approximate Unrolling transforms loops in a similar way Loop Unrolling does. However, unlike its exact counterpart, our optimizatio...
Saddlepoint approximation methods in financial engineering
Kwok, Yue Kuen
2018-01-01
This book summarizes recent advances in applying saddlepoint approximation methods to financial engineering. It addresses pricing exotic financial derivatives and calculating risk contributions to Value-at-Risk and Expected Shortfall in credit portfolios under various default correlation models. These standard problems involve the computation of tail probabilities and tail expectations of the corresponding underlying state variables. The text offers in a single source most of the saddlepoint approximation results in financial engineering, with different sets of ready-to-use approximation formulas. Much of this material may otherwise only be found in original research publications. The exposition and style are made rigorous by providing formal proofs of most of the results. Starting with a presentation of the derivation of a variety of saddlepoint approximation formulas in different contexts, this book will help new researchers to learn the fine technicalities of the topic. It will also be valuable to quanti...
Empirical insights into the stochasticity of small RNA sequencing
Qin, Li-Xuan; Tuschl, Thomas; Singer, Samuel
2016-04-01
The choice of stochasticity distribution for modeling the noise distribution is a fundamental assumption for the analysis of sequencing data and consequently is critical for the accurate assessment of biological heterogeneity and differential expression. The stochasticity of RNA sequencing has been assumed to follow Poisson distributions. We collected microRNA sequencing data and observed that its stochasticity is better approximated by gamma distributions, likely because of the stochastic nature of exponential PCR amplification. We validated our findings with two independent datasets, one for microRNA sequencing and another for RNA sequencing. Motivated by the gamma distributed stochasticity, we provided a simple method for the analysis of RNA sequencing data and showed its superiority to three existing methods for differential expression analysis using three data examples of technical replicate data and biological replicate data.
Doberkat, Ernst-Erich
2009-01-01
Combining coalgebraic reasoning, stochastic systems and logic, this volume presents the principles of coalgebraic logic from a categorical perspective. Modal logics are also discussed, including probabilistic interpretations and an analysis of Kripke models.
Stochastic processes inference theory
Rao, Malempati M
2014-01-01
This is the revised and enlarged 2nd edition of the authors’ original text, which was intended to be a modest complement to Grenander's fundamental memoir on stochastic processes and related inference theory. The present volume gives a substantial account of regression analysis, both for stochastic processes and measures, and includes recent material on Ridge regression with some unexpected applications, for example in econometrics. The first three chapters can be used for a quarter or semester graduate course on inference on stochastic processes. The remaining chapters provide more advanced material on stochastic analysis suitable for graduate seminars and discussions, leading to dissertation or research work. In general, the book will be of interest to researchers in probability theory, mathematical statistics and electrical and information theory.
Stochastic calculus with infinitesimals
Herzberg, Frederik
2013-01-01
Stochastic analysis is not only a thriving area of pure mathematics with intriguing connections to partial differential equations and differential geometry. It also has numerous applications in the natural and social sciences (for instance in financial mathematics or theoretical quantum mechanics) and therefore appears in physics and economics curricula as well. However, existing approaches to stochastic analysis either presuppose various concepts from measure theory and functional analysis or lack full mathematical rigour. This short book proposes to solve the dilemma: By adopting E. Nelson's "radically elementary" theory of continuous-time stochastic processes, it is based on a demonstrably consistent use of infinitesimals and thus permits a radically simplified, yet perfectly rigorous approach to stochastic calculus and its fascinating applications, some of which (notably the Black-Scholes theory of option pricing and the Feynman path integral) are also discussed in the book.
Stochastic differential equations and applications
Friedman, Avner
2006-01-01
This text develops the theory of systems of stochastic differential equations, and it presents applications in probability, partial differential equations, and stochastic control problems. Originally published in two volumes, it combines a book of basic theory and selected topics with a book of applications.The first part explores Markov processes and Brownian motion; the stochastic integral and stochastic differential equations; elliptic and parabolic partial differential equations and their relations to stochastic differential equations; the Cameron-Martin-Girsanov theorem; and asymptotic es
Logical Stochastic Optimization
Saad, Emad
2013-01-01
We present a logical framework to represent and reason about stochastic optimization problems based on probability answer set programming. This is established by allowing probability optimization aggregates, e.g., minimum and maximum in the language of probability answer set programming to allow minimization or maximization of some desired criteria under the probabilistic environments. We show the application of the proposed logical stochastic optimization framework under the probability answ...
Stochastic Models of Evolution
Bezruchko, Boris P.; Smirnov, Dmitry A.
To continue the discussion of randomness given in Sect. 2.2.1, we briefly touch on stochastic models of temporal evolution (random processes). They can be specified either via explicit definition of their statistical properties (probability density functions, correlation functions, etc., Sects. 4.1, 4.2 and 4.3) or via stochastic difference or differential equations. Some of the most widely known equations, their properties and applications are discussed in Sects. 4.4 and 4.5.
Research in Stochastic Processes
1988-08-31
completed the following reports. 1. A vector bimeasure integral with some applications [1]. A Fubini type theorem is obtained for a class of vector...extended neurons and assemblies of neurons. Fluctuation theorems for large systems of interacting diffusions. Stochastic analysis on canonical Hilbert...dimensional (nuclear space valued) diffusions. 3. Discontinuous stochastic differential equations in duals of nuclear spaces. 4. Fluctuation theorems for large
Expectation Consistent Approximate Inference
DEFF Research Database (Denmark)
Opper, Manfred; Winther, Ole
2005-01-01
We propose a novel framework for approximations to intractable probabilistic models which is based on a free energy formulation. The approximation can be understood from replacing an average over the original intractable distribution with a tractable one. It requires two tractable probability dis...
Energy Technology Data Exchange (ETDEWEB)
Heydari, M.H., E-mail: heydari@stu.yazd.ac.ir [Faculty of Mathematics, Yazd University, Yazd (Iran, Islamic Republic of); The Laboratory of Quantum Information Processing, Yazd University, Yazd (Iran, Islamic Republic of); Hooshmandasl, M.R., E-mail: hooshmandasl@yazd.ac.ir [Faculty of Mathematics, Yazd University, Yazd (Iran, Islamic Republic of); The Laboratory of Quantum Information Processing, Yazd University, Yazd (Iran, Islamic Republic of); Cattani, C., E-mail: ccattani@unisa.it [Department of Mathematics, University of Salerno, Via Ponte Don Melillo, 84084 Fisciano (Italy); Maalek Ghaini, F.M., E-mail: maalek@yazd.ac.ir [Faculty of Mathematics, Yazd University, Yazd (Iran, Islamic Republic of); The Laboratory of Quantum Information Processing, Yazd University, Yazd (Iran, Islamic Republic of)
2015-02-15
Because of the nonlinearity, closed-form solutions of many important stochastic functional equations are virtually impossible to obtain. Thus, numerical solutions are a viable alternative. In this paper, a new computational method based on the generalized hat basis functions together with their stochastic operational matrix of Itô-integration is proposed for solving nonlinear stochastic Itô integral equations in large intervals. In the proposed method, a new technique for computing nonlinear terms in such problems is presented. The main advantage of the proposed method is that it transforms problems under consideration into nonlinear systems of algebraic equations which can be simply solved. Error analysis of the proposed method is investigated and also the efficiency of this method is shown on some concrete examples. The obtained results reveal that the proposed method is very accurate and efficient. As two useful applications, the proposed method is applied to obtain approximate solutions of the stochastic population growth models and stochastic pendulum problem.
Dannenberg, Roger B.
Because music is not objectively descriptive or representational, the subjective qualities of music seem to be most important. Style is one of the most salient qualities of music, and in fact most descriptions of music refer to some aspect of musical style. Style in music can refer to historical periods, composers, performers, sonic texture, emotion, and genre. In recent years, many aspects of music style have been studied from the standpoint of automation: How can musical style be recognized and synthesized? An introduction to musical style describes ways in which style is characterized by composers and music theorists. Examples are then given where musical style is the focal point for computer models of music analysis and music generation.
Stein approximation for Itô and Skorohod integrals by Edgeworth type expansions
Privault, Nicolas
2015-01-01
We derive Edgeworth-type expansions for Skorohod and Itô integrals with respect to Brownian motion, based on cumulant operators defined by the Malliavin calculus. As a consequence we obtain Stein approximation bounds for stochastic integrals, which apply to SDE solutions and to multiple stochastic integrals.
Indirect Inference for Stochastic Differential Equations Based on Moment Expansions
Ballesio, Marco
2016-01-06
We provide an indirect inference method to estimate the parameters of timehomogeneous scalar diffusion and jump diffusion processes. We obtain a system of ODEs that approximate the time evolution of the first two moments of the process by the approximation of the stochastic model applying a second order Taylor expansion of the SDE s infinitesimal generator in the Dynkin s formula. This method allows a simple and efficient procedure to infer the parameters of such stochastic processes given the data by the maximization of the likelihood of an approximating Gaussian process described by the two moments equations. Finally, we perform numerical experiments for two datasets arising from organic and inorganic fouling deposition phenomena.
Dita Rietuma
2012-01-01
Annotation for the Doctoral Work Film Noir Style Genealogy (The Genealogy of the Film Noir Style) The doctoral work topic Film Noir Style Genealogy encompasses traditionally approved world film theory views on the concept of film noir and its related cinematographic heritage, and an exploration of its evolution and distinctive style, including – the development of film noir in the USA, Europe, and also in Latvia, within the context of both socio-political progression and the paradigm of m...
Titus, Thomas G.; And Others
1990-01-01
Results are reported from a study of the learning styles of 306 high school students. The study examined learning style characteristics (abstraction, concreteness, reflection, activity); comparisons between adolescent and adult learning styles; and differences between freshmen and seniors, males and females, and slow-track and fast-track learners.…
Pricing Arithmetic Asian Options under Hybrid Stochastic and Local Volatility
Directory of Open Access Journals (Sweden)
Min-Ku Lee
2014-01-01
Full Text Available Recently, hybrid stochastic and local volatility models have become an industry standard for the pricing of derivatives and other problems in finance. In this study, we use a multiscale stochastic volatility model incorporated by the constant elasticity of variance to understand the price structure of continuous arithmetic average Asian options. The multiscale partial differential equation for the option price is approximated by a couple of single scale partial differential equations. In terms of the elasticity parameter governing the leverage effect, a correction to the stochastic volatility model is made for more efficient pricing and hedging of Asian options.
de Villiers, Johan
2012-01-01
The approximation of a continuous function by either an algebraic polynomial, a trigonometric polynomial, or a spline, is an important issue in application areas like computer-aided geometric design and signal analysis. This book is an introduction to the mathematical analysis of such approximation, and, with the prerequisites of only calculus and linear algebra, the material is targeted at senior undergraduate level, with a treatment that is both rigorous and self-contained. The topics include polynomial interpolation; Bernstein polynomials and the Weierstrass theorem; best approximations in
Approximate calculation of integrals
Krylov, V I
2006-01-01
A systematic introduction to the principal ideas and results of the contemporary theory of approximate integration, this volume approaches its subject from the viewpoint of functional analysis. In addition, it offers a useful reference for practical computations. Its primary focus lies in the problem of approximate integration of functions of a single variable, rather than the more difficult problem of approximate integration of functions of more than one variable.The three-part treatment begins with concepts and theorems encountered in the theory of quadrature. The second part is devoted to t
Bosma, Wieb
1990-01-01
The distribution is determined of some sequences that measure how well a number is approximated by its mediants (or intermediate continued fraction convergents). The connection with a theorem of Fatou, as well as a new proof of this, is given.
Gautschi, Walter; Rassias, Themistocles M
2011-01-01
Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences. This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovia, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational alg
Lawden, M. D.
This document describes the various styles which are recommended for Starlink documents. It also explains how to use the templates which are provided by Starlink to help authors create documents in a standard style. This paper is concerned mainly with conveying the ``look and feel" of the various styles of Starlink document rather than describing the technical details of how to produce them. Other Starlink papers give recommendations for the detailed aspects of document production, design, layout, and typography. The only style that is likely to be used by most Starlink authors is the Standard style.
Convolutional Pitch Target Approximation Model for Speech Synthesis
Na, Xingyu; Garner, Philip N.
2013-01-01
In this paper, we investigate pitch contour modelling in speech synthesis based on segmental units. A convolutional pitch target approximation model is proposed. This model allows jointly stochastic modelling of framewise pitch and pitch contour of longer units, of which the intuitive relations are revealed by a convolutional target approximation filter. The pitch contour is stylized by a linear representation called pitch target. In synthesis stage, the likelihood of the framewise model and ...
Stochastic dynamics and irreversibility
Tomé, Tânia
2015-01-01
This textbook presents an exposition of stochastic dynamics and irreversibility. It comprises the principles of probability theory and the stochastic dynamics in continuous spaces, described by Langevin and Fokker-Planck equations, and in discrete spaces, described by Markov chains and master equations. Special concern is given to the study of irreversibility, both in systems that evolve to equilibrium and in nonequilibrium stationary states. Attention is also given to the study of models displaying phase transitions and critical phenomema both in thermodynamic equilibrium and out of equilibrium. These models include the linear Glauber model, the Glauber-Ising model, lattice models with absorbing states such as the contact process and those used in population dynamic and spreading of epidemic, probabilistic cellular automata, reaction-diffusion processes, random sequential adsorption and dynamic percolation. A stochastic approach to chemical reaction is also presented.The textbook is intended for students of ...
Covariant approximation averaging
Shintani, Eigo; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph
2014-01-01
We present a new class of statistical error reduction techniques for Monte-Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in $N_f=2+1$ lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte-Carlo calculations over conventional methods for the same cost.
Dynamical Cluster Approximation
Fotso, H.; Yang, S.; Chen, K.; Pathak, S.; Moreno, J.; Jarrell, M.; Mikelsons, K.; Khatami, E.; Galanakis, D.
The dynamical cluster approximation (DCA) is a method which systematically incorporates nonlocal corrections to the dynamical mean-field approximation. Here we present a pedagogical discussion of the DCA by describing it as a Φ-derivable coarse-graining approximation in k-space, which maps an infinite lattice problem onto a periodic finite-sized cluster embedded in a self-consistently determined effective medium. We demonstrate the method by applying it to the two-dimensional Hubbard model. From this application, we show evidences of the presence of a quantum critical point (QCP) at a finite doping underneath the superconducting dome. The QCP is associated with the second-order terminus of a line of first order phase separation transitions. This critical point is driven to zero temperature by varying the band parameters, generating the QCP. The effect of the proximity of the QCP to the superconducting dome is also discussed.
Covariant approximation averaging
Shintani, Eigo; Arthur, Rudy; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph
2015-06-01
We present a new class of statistical error reduction techniques for Monte Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in Nf=2 +1 lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte Carlo calculations over conventional methods for the same cost.
Introduction to Diophantine Approximation
Directory of Open Access Journals (Sweden)
Watase Yasushige
2015-06-01
Full Text Available In this article we formalize some results of Diophantine approximation, i.e. the approximation of an irrational number by rationals. A typical example is finding an integer solution (x, y of the inequality |xθ − y| ≤ 1/x, where 0 is a real number. First, we formalize some lemmas about continued fractions. Then we prove that the inequality has infinitely many solutions by continued fractions. Finally, we formalize Dirichlet’s proof (1842 of existence of the solution [12], [1].
Markov stochasticity coordinates
Energy Technology Data Exchange (ETDEWEB)
Eliazar, Iddo, E-mail: iddo.eliazar@intel.com
2017-01-15
Markov dynamics constitute one of the most fundamental models of random motion between the states of a system of interest. Markov dynamics have diverse applications in many fields of science and engineering, and are particularly applicable in the context of random motion in networks. In this paper we present a two-dimensional gauging method of the randomness of Markov dynamics. The method–termed Markov Stochasticity Coordinates–is established, discussed, and exemplified. Also, the method is tweaked to quantify the stochasticity of the first-passage-times of Markov dynamics, and the socioeconomic equality and mobility in human societies.
Foundations of stochastic analysis
Rao, M M; Lukacs, E
1981-01-01
Foundations of Stochastic Analysis deals with the foundations of the theory of Kolmogorov and Bochner and its impact on the growth of stochastic analysis. Topics covered range from conditional expectations and probabilities to projective and direct limits, as well as martingales and likelihood ratios. Abstract martingales and their applications are also discussed. Comprised of five chapters, this volume begins with an overview of the basic Kolmogorov-Bochner theorem, followed by a discussion on conditional expectations and probabilities containing several characterizations of operators and mea
Stochastic dynamics and control
Sun, Jian-Qiao; Zaslavsky, George
2006-01-01
This book is a result of many years of author's research and teaching on random vibration and control. It was used as lecture notes for a graduate course. It provides a systematic review of theory of probability, stochastic processes, and stochastic calculus. The feedback control is also reviewed in the book. Random vibration analyses of SDOF, MDOF and continuous structural systems are presented in a pedagogical order. The application of the random vibration theory to reliability and fatigue analysis is also discussed. Recent research results on fatigue analysis of non-Gaussian stress proc
Markov stochasticity coordinates
Eliazar, Iddo
2017-01-01
Markov dynamics constitute one of the most fundamental models of random motion between the states of a system of interest. Markov dynamics have diverse applications in many fields of science and engineering, and are particularly applicable in the context of random motion in networks. In this paper we present a two-dimensional gauging method of the randomness of Markov dynamics. The method-termed Markov Stochasticity Coordinates-is established, discussed, and exemplified. Also, the method is tweaked to quantify the stochasticity of the first-passage-times of Markov dynamics, and the socioeconomic equality and mobility in human societies.
Stochastic models, estimation, and control
Maybeck, Peter S
1982-01-01
This volume builds upon the foundations set in Volumes 1 and 2. Chapter 13 introduces the basic concepts of stochastic control and dynamic programming as the fundamental means of synthesizing optimal stochastic control laws.
Sparse Learning with Stochastic Composite Optimization.
Zhang, Weizhong; Zhang, Lijun; Jin, Zhongming; Jin, Rong; Cai, Deng; Li, Xuelong; Liang, Ronghua; He, Xiaofei
2017-06-01
In this paper, we study Stochastic Composite Optimization (SCO) for sparse learning that aims to learn a sparse solution from a composite function. Most of the recent SCO algorithms have already reached the optimal expected convergence rate O(1/λT), but they often fail to deliver sparse solutions at the end either due to the limited sparsity regularization during stochastic optimization (SO) or due to the limitation in online-to-batch conversion. Even when the objective function is strongly convex, their high probability bounds can only attain O(√{log(1/δ)/T}) with δ is the failure probability, which is much worse than the expected convergence rate. To address these limitations, we propose a simple yet effective two-phase Stochastic Composite Optimization scheme by adding a novel powerful sparse online-to-batch conversion to the general Stochastic Optimization algorithms. We further develop three concrete algorithms, OptimalSL, LastSL and AverageSL, directly under our scheme to prove the effectiveness of the proposed scheme. Both the theoretical analysis and the experiment results show that our methods can really outperform the existing methods at the ability of sparse learning and at the meantime we can improve the high probability bound to approximately O(log(log(T)/δ)/λT).
Chekroun, Mickaël D; Wang, Shouhong
2015-01-01
In this second volume, a general approach is developed to provide approximate parameterizations of the "small" scales by the "large" ones for a broad class of stochastic partial differential equations (SPDEs). This is accomplished via the concept of parameterizing manifolds (PMs), which are stochastic manifolds that improve, for a given realization of the noise, in mean square error the partial knowledge of the full SPDE solution when compared to its projection onto some resolved modes. Backward-forward systems are designed to give access to such PMs in practice. The key idea consists of representing the modes with high wave numbers as a pullback limit depending on the time-history of the modes with low wave numbers. Non-Markovian stochastic reduced systems are then derived based on such a PM approach. The reduced systems take the form of stochastic differential equations involving random coefficients that convey memory effects. The theory is illustrated on a stochastic Burgers-type equation.
Hamiltonian mechanics of stochastic acceleration.
Burby, J W; Zhmoginov, A I; Qin, H
2013-11-08
We show how to find the physical Langevin equation describing the trajectories of particles undergoing collisionless stochastic acceleration. These stochastic differential equations retain not only one-, but two-particle statistics, and inherit the Hamiltonian nature of the underlying microscopic equations. This opens the door to using stochastic variational integrators to perform simulations of stochastic interactions such as Fermi acceleration. We illustrate the theory by applying it to two example problems.
Prestack wavefield approximations
Alkhalifah, Tariq
2013-09-01
The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.
Approximate and Incomplete Factorizations
Chan, T.F.; Vorst, H.A. van der
1997-01-01
In this chapter, we give a brief overview of a particular class of preconditioners known as incomplete factorizations. They can be thought of as approximating the exact LU factorization of a given matrix A (e.g. computed via Gaussian elimination) by disallowing certain ll-ins. As opposed to other
Energy Technology Data Exchange (ETDEWEB)
Tollestrup, A.V.; Dugan, G
1983-12-01
Major headings in this review include: proton sources; antiproton production; antiproton sources and Liouville, the role of the Debuncher; transverse stochastic cooling, time domain; the accumulator; frequency domain; pickups and kickers; Fokker-Planck equation; calculation of constants in the Fokker-Planck equation; and beam feedback. (GHT)
Schrager, D.F.
2006-01-01
We propose a new model for stochastic mortality. The model is based on the literature on affine term structure models. It satisfies three important requirements for application in practice: analytical tractibility, clear interpretation of the factors and compatibility with financial option pricing
Stochastic Control - External Models
DEFF Research Database (Denmark)
Poulsen, Niels Kjølstad
2005-01-01
This note is devoted to control of stochastic systems described in discrete time. We are concerned with external descriptions or transfer function model, where we have a dynamic model for the input output relation only (i.e.. no direct internal information). The methods are based on LTI systems...... a section on that topic can be found in appendix....
Stochastic inflationary scalar electrodynamics
Prokopec, T.; Tsamis, N.C.; Woodard, R.P.
2008-01-01
We stochastically formulate the theory of scalar quantum electrodynamics on a de Sitter background. This reproduces the leading infrared logarithms at each loop order. It also allows one to sum the series of leading infrared logarithms to obtain explicit, nonperturbative results about the late time
Leadership styles and theories.
Giltinane, Charlotte Louise
It is useful for healthcare professionals to be able to identify the leadership styles and theories relevant to their nursing practice. Being adept in recognising these styles enables nurses to develop their skills to become better leaders, as well as improving relationships with colleagues and other leaders, who have previously been challenging to work with. This article explores different leadership styles and theories, and explains how they relate to nursing practice.
Stochastic Optimal Prediction with Application to Averaged Euler Equations
Energy Technology Data Exchange (ETDEWEB)
Bell, John [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Chorin, Alexandre J. [Univ. of California, Berkeley, CA (United States); Crutchfield, William [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
2017-04-24
Optimal prediction (OP) methods compensate for a lack of resolution in the numerical solution of complex problems through the use of an invariant measure as a prior measure in the Bayesian sense. In first-order OP, unresolved information is approximated by its conditional expectation with respect to the invariant measure. In higher-order OP, unresolved information is approximated by a stochastic estimator, leading to a system of random or stochastic differential equations. We explain the ideas through a simple example, and then apply them to the solution of Averaged Euler equations in two space dimensions.
Prestack traveltime approximations
Alkhalifah, Tariq Ali
2011-01-01
Most prestack traveltime relations we tend work with are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multi-focusing or double square-root (DSR) and the common reflection stack (CRS) equations. Using the DSR equation, I analyze the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I derive expansion based solutions of this eikonal based on polynomial expansions in terms of the reflection and dip angles in a generally inhomogenous background medium. These approximate solutions are free of singularities and can be used to estimate travetimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. A Marmousi example demonstrates the usefulness of the approach. © 2011 Society of Exploration Geophysicists.
Pumping approximately integrable systems
Lange, Florian; Lenarčič, Zala; Rosch, Achim
2017-06-01
Weak perturbations can drive an interacting many-particle system far from its initial equilibrium state if one is able to pump into degrees of freedom approximately protected by conservation laws. This concept has for example been used to realize Bose-Einstein condensates of photons, magnons and excitons. Integrable quantum systems, like the one-dimensional Heisenberg model, are characterized by an infinite set of conservation laws. Here, we develop a theory of weakly driven integrable systems and show that pumping can induce large spin or heat currents even in the presence of integrability breaking perturbations, since it activates local and quasi-local approximate conserved quantities. The resulting steady state is qualitatively captured by a truncated generalized Gibbs ensemble with Lagrange parameters that depend on the structure but not on the overall amplitude of perturbations nor the initial state. We suggest to use spin-chain materials driven by terahertz radiation to realize integrability-based spin and heat pumps.
Equations involving Malliavin calculus operators applications and numerical approximation
Levajković, Tijana
2017-01-01
This book provides a comprehensive and unified introduction to stochastic differential equations and related optimal control problems. The material is new and the presentation is reader-friendly. A major contribution of the book is the development of generalized Malliavin calculus in the framework of white noise analysis, based on chaos expansion representation of stochastic processes and its application for solving several classes of stochastic differential equations with singular data involving the main operators of Malliavin calculus. In addition, applications in optimal control and numerical approximations are discussed. The book is divided into four chapters. The first, entitled White Noise Analysis and Chaos Expansions, includes notation and provides the reader with the theoretical background needed to understand the subsequent chapters. In Chapter 2, Generalized Operators of Malliavin Calculus, the Malliavin derivative operator, the Skorokhod integral and the Ornstein-Uhlenbeck operator are introdu...
Optimization and approximation
Pedregal, Pablo
2017-01-01
This book provides a basic, initial resource, introducing science and engineering students to the field of optimization. It covers three main areas: mathematical programming, calculus of variations and optimal control, highlighting the ideas and concepts and offering insights into the importance of optimality conditions in each area. It also systematically presents affordable approximation methods. Exercises at various levels have been included to support the learning process.
Skorokhod, A. V.
1982-12-01
CONTENTSIntroduction § 1. The finite-dimensional case § 2. Stochastic semigroups in the L2-strong theory § 3. Homogeneous strongly continuous semigroups with the group of the first moments § 4. Stochastic equations of diffusion type with constant coefficients § 5. Continuous homogeneous stochastic semigroups in the presence of two moments References
Network architectural conditions for prominent and robust stochastic oscillations
Joo, Jaewook; Choi, Jinmyung
2012-02-01
Understanding relationship between noisy dynamics and biological network architecture is a fundamentally important question, particularly in order to elucidate how cells encode and process information. We analytically and numerically investigate general network architectural conditions that are necessary to generate stochastic amplified and coherent oscillations. We enumerate all possible topologies of coupled negative feedbacks in the underlying biochemical networks with three components, negative feedback loops, and mass action kinetics. Using the linear noise approximation to analytically obtain the time-dependent solution of the master equation and derive the algebraic expression of power spectra, we find that (a) all networks with coupled negative feedbacks are capable of generating stochastic amplified and coherent oscillations; (b) networks with a single negative feedback are better stochastic amplified and coherent oscillators than those with multiple coupled negative feedbacks; (c) multiple timescale difference among the kinetic rate constants is required for stochastic amplified and coherent oscillations.
Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration
Directory of Open Access Journals (Sweden)
Alberto Policriti
2009-10-01
Full Text Available We begin by reviewing a technique to approximate the dynamics of stochastic programs --written in a stochastic process algebra-- by a hybrid system, suitable to capture a mixed discrete/continuous evolution. In a nutshell, the discrete dynamics is kept stochastic while the continuous evolution is given in terms of ODEs, and the overall technique, therefore, naturally associates a Piecewise Deterministic Markov Process with a stochastic program. The speciﬁc contribution in this work consists in an increase of the ﬂexibility of the translation scheme, obtained by allowing a dynamic reconﬁguration of the degree of discreteness/continuity of the semantics. We also discuss the relationships of this approach with other hybrid simulation strategies for biochemical systems.
Low-complexity stochastic modeling of spatially evolving flows
Zare, Armin; Ran, Wei; Hack, M. J. Philipp; Jovanovic, Mihailo
2016-11-01
Low-complexity approximations of the Navier-Stokes (NS) equations are commonly used for analysis and control of turbulent flows. In particular, stochastically-forced linearized models have been successfully employed to capture structural and statistical features observed in experiments and direct simulations. In this work, we utilize stochastically-forced linearized NS equations and their parabolized equivalents to study the dynamics of flow fluctuations in transitional and turbulent boundary layers. We exploit the streamwise causality of the parabolized model to efficiently propagate statistics of stochastic disturbances into statistics of velocity fluctuations. Our study provides insight into interactions of slowly-varying base flow with streamwise streaks, oblique modes, and Tollmien-Schlichting waves. It also offers a systematic, computationally efficient framework for quantifying the influence of stochastic excitation sources (e.g., free-stream turbulence and surface roughness) on velocity fluctuations in weakly non-parallel flows.
Simulation of Stochastic Loads for Fatigue Experiments
DEFF Research Database (Denmark)
Sørensen, John Dalsgaard; Brincker, Rune
1989-01-01
A simple direct simulation method for stochastic fatigue-load generation is described in this paper. The simulation method is based on the assumption that only the peaks of the load process significantly affect the fatigue life. The method requires the conditional distribution functions of load...... process by a Markov process. Two different spectra from two tubular joints in an offshore structure (one narrow banded and one wide banded) are considered in an example. The results show that the simple direct method is quite efficient and results in a simulation speed of about 3000 load cycles per second...... ranges given the last peak values. Analytical estimates of these distribution functions are presented in the paper and compared with estimates based on a more accurate simulation method. In the more accurate simulation method samples at equidistant times are generated by approximating the stochastic load...
Style as Supplement - Supplement as Style
DEFF Research Database (Denmark)
Sørensen, Bent
, and to aim for an almost Brechtian Verfremdung-effect, but the film also uses this device as a stylistic trait to characterize something ‘essential' about Derrida and his style. Derrida strikes the same chord by insisting on drawing attention to the artificiality of the making of the film, where questions...... and deferrals. This is of course another link in the infinite Derridean chain of supplements to supplements of supplements - in his writings, his persona and the legacy of images of him left behind in the archives. How does this perpetual deferral reflect itself in Derrida's visual and verbal style...
Finite elements and approximation
Zienkiewicz, O C
2006-01-01
A powerful tool for the approximate solution of differential equations, the finite element is extensively used in industry and research. This book offers students of engineering and physics a comprehensive view of the principles involved, with numerous illustrative examples and exercises.Starting with continuum boundary value problems and the need for numerical discretization, the text examines finite difference methods, weighted residual methods in the context of continuous trial functions, and piecewise defined trial functions and the finite element method. Additional topics include higher o
Approximation and perturbation methods
Iyer, B R
1993-01-01
Few problems in nature are amenable to an exact solution and hence when one proceeds from elegant problems of theory to messy complicated problems of practice one is forced to recourse to methods of approximation and perturbation. The development of such techniques has been natural in attempts to extract physically veriﬁable consequences from either exact solutions of general relativity or from speciﬁc astrophysical systems for which an exact solution is impossible to ﬁnd. However, this should not be taken to imply giving up of mathematical rigour and an appeal to only physical intuition.
Constructing stochastic models from deterministic process equations by propensity adjustment.
Wu, Jialiang; Vidakovic, Brani; Voit, Eberhard O
2011-11-08
Gillespie's stochastic simulation algorithm (SSA) for chemical reactions admits three kinds of elementary processes, namely, mass action reactions of 0th, 1st or 2nd order. All other types of reaction processes, for instance those containing non-integer kinetic orders or following other types of kinetic laws, are assumed to be convertible to one of the three elementary kinds, so that SSA can validly be applied. However, the conversion to elementary reactions is often difficult, if not impossible. Within deterministic contexts, a strategy of model reduction is often used. Such a reduction simplifies the actual system of reactions by merging or approximating intermediate steps and omitting reactants such as transient complexes. It would be valuable to adopt a similar reduction strategy to stochastic modelling. Indeed, efforts have been devoted to manipulating the chemical master equation (CME) in order to achieve a proper propensity function for a reduced stochastic system. However, manipulations of CME are almost always complicated, and successes have been limited to relative simple cases. We propose a rather general strategy for converting a deterministic process model into a corresponding stochastic model and characterize the mathematical connections between the two. The deterministic framework is assumed to be a generalized mass action system and the stochastic analogue is in the format of the chemical master equation. The analysis identifies situations: where a direct conversion is valid; where internal noise affecting the system needs to be taken into account; and where the propensity function must be mathematically adjusted. The conversion from deterministic to stochastic models is illustrated with several representative examples, including reversible reactions with feedback controls, Michaelis-Menten enzyme kinetics, a genetic regulatory motif, and stochastic focusing. The construction of a stochastic model for a biochemical network requires the utilization
Constructing stochastic models from deterministic process equations by propensity adjustment
Directory of Open Access Journals (Sweden)
Wu Jialiang
2011-11-01
Full Text Available Abstract Background Gillespie's stochastic simulation algorithm (SSA for chemical reactions admits three kinds of elementary processes, namely, mass action reactions of 0th, 1st or 2nd order. All other types of reaction processes, for instance those containing non-integer kinetic orders or following other types of kinetic laws, are assumed to be convertible to one of the three elementary kinds, so that SSA can validly be applied. However, the conversion to elementary reactions is often difficult, if not impossible. Within deterministic contexts, a strategy of model reduction is often used. Such a reduction simplifies the actual system of reactions by merging or approximating intermediate steps and omitting reactants such as transient complexes. It would be valuable to adopt a similar reduction strategy to stochastic modelling. Indeed, efforts have been devoted to manipulating the chemical master equation (CME in order to achieve a proper propensity function for a reduced stochastic system. However, manipulations of CME are almost always complicated, and successes have been limited to relative simple cases. Results We propose a rather general strategy for converting a deterministic process model into a corresponding stochastic model and characterize the mathematical connections between the two. The deterministic framework is assumed to be a generalized mass action system and the stochastic analogue is in the format of the chemical master equation. The analysis identifies situations: where a direct conversion is valid; where internal noise affecting the system needs to be taken into account; and where the propensity function must be mathematically adjusted. The conversion from deterministic to stochastic models is illustrated with several representative examples, including reversible reactions with feedback controls, Michaelis-Menten enzyme kinetics, a genetic regulatory motif, and stochastic focusing. Conclusions The construction of a stochastic
Constructing stochastic models from deterministic process equations by propensity adjustment
2011-01-01
Background Gillespie's stochastic simulation algorithm (SSA) for chemical reactions admits three kinds of elementary processes, namely, mass action reactions of 0th, 1st or 2nd order. All other types of reaction processes, for instance those containing non-integer kinetic orders or following other types of kinetic laws, are assumed to be convertible to one of the three elementary kinds, so that SSA can validly be applied. However, the conversion to elementary reactions is often difficult, if not impossible. Within deterministic contexts, a strategy of model reduction is often used. Such a reduction simplifies the actual system of reactions by merging or approximating intermediate steps and omitting reactants such as transient complexes. It would be valuable to adopt a similar reduction strategy to stochastic modelling. Indeed, efforts have been devoted to manipulating the chemical master equation (CME) in order to achieve a proper propensity function for a reduced stochastic system. However, manipulations of CME are almost always complicated, and successes have been limited to relative simple cases. Results We propose a rather general strategy for converting a deterministic process model into a corresponding stochastic model and characterize the mathematical connections between the two. The deterministic framework is assumed to be a generalized mass action system and the stochastic analogue is in the format of the chemical master equation. The analysis identifies situations: where a direct conversion is valid; where internal noise affecting the system needs to be taken into account; and where the propensity function must be mathematically adjusted. The conversion from deterministic to stochastic models is illustrated with several representative examples, including reversible reactions with feedback controls, Michaelis-Menten enzyme kinetics, a genetic regulatory motif, and stochastic focusing. Conclusions The construction of a stochastic model for a biochemical
Library Automation Style Guide.
Gaylord Bros., Liverpool, NY.
This library automation style guide lists specific terms and names often used in the library automation industry. The terms and/or acronyms are listed alphabetically and each is followed by a brief definition. The guide refers to the "Chicago Manual of Style" for general rules, and a notes section is included for the convenience of individual…
Style and Sociolinguistic Variation.
Eckert, Penelope, Ed.; Rickford, John R., Ed.
This collection of papers by leading experts from a range of disciplines is divided into four sections. Section 1, "Anthropological Approaches," includes: (1) "'Style' as Distinctiveness: The Culture and Ideology of Linguistic Differentiation" (Judith T. Irvine); (2) "Variety, Style-Shifting, and Ideology" (Susan…
Schroeder, David H.
This study assessed the bipolarity of cognitive style for 970 clients of the Johnson O'Connor Research Foundation, a vocational guidance service. The 462 male and 508 female examinees were aged 14 to 65 years, with a median age of 24 years. Three cognitive style tests were investigated: (1) the Kagan Matching Familiar Figures Test (KMFFT); (2) the…
DEFF Research Database (Denmark)
Madsen, Lars
2008-01-01
Designing a page style has long been a pain for novice users. Some parts are easy; others need strong LATEX knowledge. In this article we will present the memoir way of dealing with page styles, including new code added to the recent version of memoir that will reduce the pain to a mild annoyance...
Stochastic Methods Based on VU-Decomposition Methods for Stochastic Convex Minimax Problems
Directory of Open Access Journals (Sweden)
Yuan Lu
2014-01-01
Full Text Available This paper applies sample average approximation (SAA method based on VU-space decomposition theory to solve stochastic convex minimax problems. Under some moderate conditions, the SAA solution converges to its true counterpart with probability approaching one and convergence is exponentially fast with the increase of sample size. Based on the VU-theory, a superlinear convergent VU-algorithm frame is designed to solve the SAA problem.
Approximate Bayesian Computation
Sunnåker, Mikael; Corander, Jukka; Foll, Matthieu; Dessimoz, Christophe
2013-01-01
Approximate Bayesian computation (ABC) constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical inference, the likelihood function is of central importance, since it expresses the probability of the observed data under a particular statistical model, and thus quantifies the support data lend to particular values of parameters and to choices among different models. For simple models, an analytical formula for the likelihood function can typically be derived. However, for more complex models, an analytical formula might be elusive or the likelihood function might be computationally very costly to evaluate. ABC methods bypass the evaluation of the likelihood function. In this way, ABC methods widen the realm of models for which statistical inference can be considered. ABC methods are mathematically well-founded, but they inevitably make assumptions and approximations whose impact needs to be carefully assessed. Furthermore, the wider application domain of ABC exacerbates the challenges of parameter estimation and model selection. ABC has rapidly gained popularity over the last years and in particular for the analysis of complex problems arising in biological sciences (e.g., in population genetics, ecology, epidemiology, and systems biology). PMID:23341757
AUTOMATIC ARCHITECTURAL STYLE RECOGNITION
Directory of Open Access Journals (Sweden)
M. Mathias
2012-09-01
Full Text Available Procedural modeling has proven to be a very valuable tool in the ﬁeld of architecture. In the last few years, research has soared to automatically create procedural models from images. However, current algorithms for this process of inverse procedural modeling rely on the assumption that the building style is known. So far, the determination of the building style has remained a manual task. In this paper, we propose an algorithm which automates this process through classiﬁcation of architectural styles from facade images. Our classiﬁer ﬁrst identiﬁes the images containing buildings, then separates individual facades within an image and determines the building style. This information could then be used to initialize the building reconstruction process. We have trained our classiﬁer to distinguish between several distinct architectural styles, namely Flemish Renaissance, Haussmannian and Neoclassical. Finally, we demonstrate our approach on various street-side images.
Stochastic porous media equations
Barbu, Viorel; Röckner, Michael
2016-01-01
Focusing on stochastic porous media equations, this book places an emphasis on existence theorems, asymptotic behavior and ergodic properties of the associated transition semigroup. Stochastic perturbations of the porous media equation have reviously been considered by physicists, but rigorous mathematical existence results have only recently been found. The porous media equation models a number of different physical phenomena, including the flow of an ideal gas and the diffusion of a compressible fluid through porous media, and also thermal propagation in plasma and plasma radiation. Another important application is to a model of the standard self-organized criticality process, called the "sand-pile model" or the "Bak-Tang-Wiesenfeld model". The book will be of interest to PhD students and researchers in mathematics, physics and biology.
Dynamic stochastic optimization
Ermoliev, Yuri; Pflug, Georg
2004-01-01
Uncertainties and changes are pervasive characteristics of modern systems involving interactions between humans, economics, nature and technology. These systems are often too complex to allow for precise evaluations and, as a result, the lack of proper management (control) may create significant risks. In order to develop robust strategies we need approaches which explic itly deal with uncertainties, risks and changing conditions. One rather general approach is to characterize (explicitly or implicitly) uncertainties by objec tive or subjective probabilities (measures of confidence or belief). This leads us to stochastic optimization problems which can rarely be solved by using the standard deterministic optimization and optimal control methods. In the stochastic optimization the accent is on problems with a large number of deci sion and random variables, and consequently the focus ofattention is directed to efficient solution procedures rather than to (analytical) closed-form solu tions. Objective an...
Dynamics of stochastic systems
Klyatskin, Valery I
2005-01-01
Fluctuating parameters appear in a variety of physical systems and phenomena. They typically come either as random forces/sources, or advecting velocities, or media (material) parameters, like refraction index, conductivity, diffusivity, etc. The well known example of Brownian particle suspended in fluid and subjected to random molecular bombardment laid the foundation for modern stochastic calculus and statistical physics. Other important examples include turbulent transport and diffusion of particle-tracers (pollutants), or continuous densities (''''oil slicks''''), wave propagation and scattering in randomly inhomogeneous media, for instance light or sound propagating in the turbulent atmosphere.Such models naturally render to statistical description, where the input parameters and solutions are expressed by random processes and fields.The fundamental problem of stochastic dynamics is to identify the essential characteristics of system (its state and evolution), and relate those to the input parameters of ...
Essentials of stochastic processes
Durrett, Richard
2016-01-01
Building upon the previous editions, this textbook is a first course in stochastic processes taken by undergraduate and graduate students (MS and PhD students from math, statistics, economics, computer science, engineering, and finance departments) who have had a course in probability theory. It covers Markov chains in discrete and continuous time, Poisson processes, renewal processes, martingales, and option pricing. One can only learn a subject by seeing it in action, so there are a large number of examples and more than 300 carefully chosen exercises to deepen the reader’s understanding. Drawing from teaching experience and student feedback, there are many new examples and problems with solutions that use TI-83 to eliminate the tedious details of solving linear equations by hand, and the collection of exercises is much improved, with many more biological examples. Originally included in previous editions, material too advanced for this first course in stochastic processes has been eliminated while treatm...
Stochastic calculus and applications
Cohen, Samuel N
2015-01-01
Completely revised and greatly expanded, the new edition of this text takes readers who have been exposed to only basic courses in analysis through the modern general theory of random processes and stochastic integrals as used by systems theorists, electronic engineers and, more recently, those working in quantitative and mathematical finance. Building upon the original release of this title, this text will be of great interest to research mathematicians and graduate students working in those fields, as well as quants in the finance industry. New features of this edition include: End of chapter exercises; New chapters on basic measure theory and Backward SDEs; Reworked proofs, examples and explanatory material; Increased focus on motivating the mathematics; Extensive topical index. "Such a self-contained and complete exposition of stochastic calculus and applications fills an existing gap in the literature. The book can be recommended for first-year graduate studies. It will be useful for all who intend to wo...
Stochastic modelling of turbulence
DEFF Research Database (Denmark)
Sørensen, Emil Hedevang Lohse
This thesis addresses stochastic modelling of turbulence with applications to wind energy in mind. The primary tool is ambit processes, a recently developed class of computationally tractable stochastic processes based on integration with respect to Lévy bases. The subject of ambit processes...... is still undergoing rapid development. Turbulence and wind energy are vast and complicated subjects. Turbulence has structures across a wide range of length and time scales, structures which cannot be captured by a Gaussian process that relies on only second order properties. Concerning wind energy, a wind...... turbine operates in the turbulent atmospheric boundary layer. In this respect, three regimes are of particular interest: modelling the turbulent wind before it interacts with the wind turbine (e.g. to be used in load simulations), modelling of the interaction of the wind with the wind turbine (e...
Isotropic stochastic rotation dynamics
Mühlbauer, Sebastian; Strobl, Severin; Pöschel, Thorsten
2017-12-01
Stochastic rotation dynamics (SRD) is a widely used method for the mesoscopic modeling of complex fluids, such as colloidal suspensions or multiphase flows. In this method, however, the underlying Cartesian grid defining the coarse-grained interaction volumes induces anisotropy. We propose an isotropic, lattice-free variant of stochastic rotation dynamics, termed iSRD. Instead of Cartesian grid cells, we employ randomly distributed spherical interaction volumes. This eliminates the requirement of a grid shift, which is essential in standard SRD to maintain Galilean invariance. We derive analytical expressions for the viscosity and the diffusion coefficient in relation to the model parameters, which show excellent agreement with the results obtained in iSRD simulations. The proposed algorithm is particularly suitable to model systems bound by walls of complex shape, where the domain cannot be meshed uniformly. The presented approach is not limited to SRD but is applicable to any other mesoscopic method, where particles interact within certain coarse-grained volumes.
Identifiability in stochastic models
1992-01-01
The problem of identifiability is basic to all statistical methods and data analysis, occurring in such diverse areas as Reliability Theory, Survival Analysis, and Econometrics, where stochastic modeling is widely used. Mathematics dealing with identifiability per se is closely related to the so-called branch of ""characterization problems"" in Probability Theory. This book brings together relevant material on identifiability as it occurs in these diverse fields.
Stochastic conditional intensity processes
DEFF Research Database (Denmark)
Bauwens, Luc; Hautsch, Nikolaus
2006-01-01
In this article, we introduce the so-called stochastic conditional intensity (SCI) model by extending Russell’s (1999) autoregressive conditional intensity (ACI) model by a latent common dynamic factor that jointly drives the individual intensity components. We show by simulations that the propos...... for a joint latent factor and show that its inclusion allows for an improved and more parsimonious specification of the multivariate intensity process...
Lenczewski, Romuald
2001-01-01
By introducing a color filtration to the multiplicity space, we extend the quantum Ito calculus on multiple symmetric Fock space to the framework of filtered adapted biprocesses. In this new notion of adaptedness,``classical'' time filtration makes the integrands similar to adapted processes, whereas ``quantum'' color filtration produces their deviations from adaptedness. An important feature of this calculus, which we call filtered stochastic calculus, is that it provides an explicit interpo...
McDonnell, Mark D; Amblard, Pierre-Olivier; Stocks, Nigel G.
2009-01-01
We introduce and define the concept of a stochastic pooling network (SPN), as a model for sensor systems where redundancy and two forms of 'noise' -- lossy compression and randomness -- interact in surprising ways. Our approach to analyzing SPNs is information theoretic. We define an SPN as a network with multiple nodes that each produce noisy and compressed measurements of the same information. An SPN must combine all these measurements into a single further compressed network output, in a w...
Stochastic Thermodynamics of Learning
Goldt, Sebastian; Seifert, Udo
2017-01-01
Virtually every organism gathers information about its noisy environment and builds models from those data, mostly using neural networks. Here, we use stochastic thermodynamics to analyze the learning of a classification rule by a neural network. We show that the information acquired by the network is bounded by the thermodynamic cost of learning and introduce a learning efficiency η ≤1 . We discuss the conditions for optimal learning and analyze Hebbian learning in the thermodynamic limit.
Stochastic modeling of thermal fatigue crack growth
Radu, Vasile
2015-01-01
The book describes a systematic stochastic modeling approach for assessing thermal-fatigue crack-growth in mixing tees, based on the power spectral density of temperature fluctuation at the inner pipe surface. It shows the development of a frequency-temperature response function in the framework of single-input, single-output (SISO) methodology from random noise/signal theory under sinusoidal input. The frequency response of stress intensity factor (SIF) is obtained by a polynomial fitting procedure of thermal stress profiles at various instants of time. The method, which takes into account the variability of material properties, and has been implemented in a real-world application, estimates the probabilities of failure by considering a limit state function and Monte Carlo analysis, which are based on the proposed stochastic model. Written in a comprehensive and accessible style, this book presents a new and effective method for assessing thermal fatigue crack, and it is intended as a concise and practice-or...
Stochasticity Modeling in Memristors
Naous, Rawan
2015-10-26
Diverse models have been proposed over the past years to explain the exhibiting behavior of memristors, the fourth fundamental circuit element. The models varied in complexity ranging from a description of physical mechanisms to a more generalized mathematical modeling. Nonetheless, stochasticity, a widespread observed phenomenon, has been immensely overlooked from the modeling perspective. This inherent variability within the operation of the memristor is a vital feature for the integration of this nonlinear device into the stochastic electronics realm of study. In this paper, experimentally observed innate stochasticity is modeled in a circuit compatible format. The model proposed is generic and could be incorporated into variants of threshold-based memristor models in which apparent variations in the output hysteresis convey the switching threshold shift. Further application as a noise injection alternative paves the way for novel approaches in the fields of neuromorphic engineering circuits design. On the other hand, extra caution needs to be paid to variability intolerant digital designs based on non-deterministic memristor logic.
Style representation in design grammars
DEFF Research Database (Denmark)
Ahmad, Sumbul; Chase, Scott Curland
2012-01-01
to be transformed according to changing design style needs. Issues of formalizing stylistic change necessitate a lucid and formal definition of style in the design language generated by a grammar. Furthermore, a significant aspect of the definition of style is the representation of aesthetic qualities attributed...... to the style. We focus on grammars for representing and generating styles of design and review the use of grammar transformations for modelling changes in style and design language. We identify a gap in knowledge in the representation of style in grammars and in driving strategic style change using grammar...
Approximation by Cylinder Surfaces
DEFF Research Database (Denmark)
Randrup, Thomas
1997-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....
DEFF Research Database (Denmark)
Møller, Jan Kloppenborg; Madsen, Henrik
This report describes methods to eliminate state dependent diffusion terms in Stochastic Differential Equations (SDEs). Transformations that leave the diffusion term of SDEs constant is important for simulation, and estimation. It is important for simulation because the Euler approximation...
Energy Technology Data Exchange (ETDEWEB)
Tartakovsky, Daniel
2013-08-30
We developed new CDF and PDF methods for solving non-linear stochastic hyperbolic equations that does not rely on linearization approximations and allows for rigorous formulation of the boundary conditions.
Monte Carlo Euler approximations of HJM term structure financial models
Björk, Tomas
2012-11-22
We present Monte Carlo-Euler methods for a weak approximation problem related to the Heath-Jarrow-Morton (HJM) term structure model, based on Itô stochastic differential equations in infinite dimensional spaces, and prove strong and weak error convergence estimates. The weak error estimates are based on stochastic flows and discrete dual backward problems, and they can be used to identify different error contributions arising from time and maturity discretization as well as the classical statistical error due to finite sampling. Explicit formulas for efficient computation of sharp error approximation are included. Due to the structure of the HJM models considered here, the computational effort devoted to the error estimates is low compared to the work to compute Monte Carlo solutions to the HJM model. Numerical examples with known exact solution are included in order to show the behavior of the estimates. © 2012 Springer Science+Business Media Dordrecht.
Preference Factoring for Stochastic Trees
Gordon Hazen
2000-01-01
Stochastic trees are extensions of decision trees that facilitate the modeling of temporal uncertainties. Their primary application has been to medical treatment decisions. It is often convenient to present stochastic trees in factored form, allowing loosely coupled pieces of the model to be formulated and presented separately. In this paper, we show how the notion of factoring can be extended as well to preference components of the stochastic model. We examine updateable-state utility, a fle...
Stochastic modelling in disability insurance
Löfdahl, Björn
2013-01-01
This thesis consists of two papers related to the stochastic modellingof disability insurance. In the first paper, we propose a stochastic semi-Markovian framework for disability modelling in a multi-period discrete-time setting. The logistic transforms of disability inception and recovery probabilities are modelled by means of stochastic risk factors and basis functions, using counting processes and generalized linear models. The model for disability inception also takes IBNR claims into con...
Bayesian posterior sampling via stochastic gradient Fisher scoring
Ahn, S.; Korattikara, A.; Welling, M.; Langford, J.; Pineau, J.
2012-01-01
In this paper we address the following question: "Can we approximately sample from a Bayesian posterior distribution if we are only allowed to touch a small mini-batch of data-items for every sample we generate?". An algorithm based on the Langevin equation with stochastic gradients (SGLD) was
Efficient Numerical Methods for Stochastic Differential Equations in Computational Finance
Happola, Juho
2017-09-19
Stochastic Differential Equations (SDE) offer a rich framework to model the probabilistic evolution of the state of a system. Numerical approximation methods are typically needed in evaluating relevant Quantities of Interest arising from such models. In this dissertation, we present novel effective methods for evaluating Quantities of Interest relevant to computational finance when the state of the system is described by an SDE.
Prestack traveltime approximations
Alkhalifah, Tariq Ali
2012-05-01
Many of the explicit prestack traveltime relations used in practice are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multifocusing, based on the double square-root (DSR) equation, and the common reflection stack (CRS) approaches. Using the DSR equation, I constructed the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I recasted the eikonal in terms of the reflection angle, and thus, derived expansion based solutions of this eikonal in terms of the difference between the source and receiver velocities in a generally inhomogenous background medium. The zero-order term solution, corresponding to ignoring the lateral velocity variation in estimating the prestack part, is free of singularities and can be used to estimate traveltimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. The higher-order terms include limitations for horizontally traveling waves, however, we can readily enforce stability constraints to avoid such singularities. In fact, another expansion over reflection angle can help us avoid these singularities by requiring the source and receiver velocities to be different. On the other hand, expansions in terms of reflection angles result in singularity free equations. For a homogenous background medium, as a test, the solutions are reasonably accurate to large reflection and dip angles. A Marmousi example demonstrated the usefulness and versatility of the formulation. © 2012 Society of Exploration Geophysicists.
Thinking Styles: Teaching and Learning Styles in Graduate Education Students
Clarke, Tricia A.; Lesh, Jennifer J.; Trocchio, Jennie S.; Wolman, Clara
2010-01-01
This study investigated the relationship between two intellectual styles approaches: Sternberg's thinking styles of teachers and Felder and Silverman's learning styles. Ninety-five graduate students majoring in special education, reading, educational leadership and curriculum, and elementary education completed the Thinking Styles in Teaching…
Approximate dynamic programming solving the curses of dimensionality
Powell, Warren B
2007-01-01
Warren B. Powell, PhD, is Professor of Operations Research and Financial Engineering at Princeton University, where he is founder and Director of CASTLE Laboratory, a research unit that works with industrial partners to test new ideas found in operations research. The recipient of the 2004 INFORMS Fellow Award, Dr. Powell has authored over 100 refereed publications on stochastic optimization, approximate dynamic programming, and dynamic resource management.
Sensitivity, robustness, and identifiability in stochastic chemical kinetics models.
Komorowski, Michał; Costa, Maria J; Rand, David A; Stumpf, Michael P H
2011-05-24
We present a novel and simple method to numerically calculate Fisher information matrices for stochastic chemical kinetics models. The linear noise approximation is used to derive model equations and a likelihood function that leads to an efficient computational algorithm. Our approach reduces the problem of calculating the Fisher information matrix to solving a set of ordinary differential equations. This is the first method to compute Fisher information for stochastic chemical kinetics models without the need for Monte Carlo simulations. This methodology is then used to study sensitivity, robustness, and parameter identifiability in stochastic chemical kinetics models. We show that significant differences exist between stochastic and deterministic models as well as between stochastic models with time-series and time-point measurements. We demonstrate that these discrepancies arise from the variability in molecule numbers, correlations between species, and temporal correlations and show how this approach can be used in the analysis and design of experiments probing stochastic processes at the cellular level. The algorithm has been implemented as a Matlab package and is available from the authors upon request.
Schauder’s fixed-point theorem in approximate controllability problems
Directory of Open Access Journals (Sweden)
Babiarz Artur
2016-06-01
Full Text Available The main objective of this article is to present the state of the art concerning approximate controllability of dynamic systems in infinite-dimensional spaces. The presented investigation focuses on obtaining sufficient conditions for approximate controllability of various types of dynamic systems using Schauder’s fixed-point theorem. We describe the results of approximate controllability for nonlinear impulsive neutral fuzzy stochastic differential equations with nonlocal conditions, impulsive neutral functional evolution integro-differential systems, stochastic impulsive systems with control-dependent coefficients, nonlinear impulsive differential systems, and evolution systems with nonlocal conditions and semilinear evolution equation.
Stochastic single-gene auto-regulation
Aquino, Tomás; Nunes, Ana
2011-01-01
A detailed stochastic model of single-gene auto-regulation is established and its solutions are explored when mRNA dynamics is fast compared with protein dynamics and in the opposite regime. The model includes all the sources of randomness that are intrinsic to the auto-regulation process. The timescale separation allows the derivation of analytic expressions for the equilibrium distributions of protein and mRNA. These distributions are shown to be well described in the continuous approximation, which is then used to discuss the qualitative features of the protein equilibrium distributions as a function of the biological parameters in the fast mRNA regime.
Efficient Estimating Functions for Stochastic Differential Equations
DEFF Research Database (Denmark)
Jakobsen, Nina Munkholt
The overall topic of this thesis is approximate martingale estimating function-based estimationfor solutions of stochastic differential equations, sampled at high frequency. Focuslies on the asymptotic properties of the estimators. The first part of the thesis deals with diffusions observed over...... of an effcient and an ineffcientestimator are compared graphically. The second part of the thesis concerns diffusions withfinite-activity jumps, observed over an increasing interval with terminal sampling time goingto infinity. Asymptotic distribution results are derived for consistent estimators of ageneral...
SELANSI: a toolbox for Simulation of Stochastic Gene Regulatory Networks.
Pájaro, Manuel; Otero-Muras, Irene; Vázquez, Carlos; Alonso, Antonio A
2017-10-11
Gene regulation is inherently stochastic. In many applications concerning Systems and Synthetic Biology such as the reverse engineering and the de novo design of genetic circuits, stochastic effects (yet potentially crucial) are often neglected due to the high computational cost of stochastic simulations. With advances in these fields there is an increasing need of tools providing accurate approximations of the stochastic dynamics of gene regulatory networks (GRNs) with reduced computational effort. This work presents SELANSI (SEmi-LAgrangian SImulation of GRNs), a software toolbox for the simulation of stochastic multidimensional gene regulatory networks. SELANSI exploits intrinsic structural properties of gene regulatory networks to accurately approximate the corresponding chemical master equation (CME) with a partial integral differential equation (PIDE) that is solved by a semi-lagrangian method with high efficiency. Networks under consideration might involve multiple genes with self and cross regulations, in which genes can be regulated by different transcription factors. Moreover, the validity of the method is not restricted to a particular type of kinetics. The tool offers total flexibility regarding network topology, kinetics and parameterization, as well as simulation options. SELANSI runs under the MATLAB environment, and is available under GPLv3 license at https://sites.google.com/view/selansi. antonio@iim.csic.es.
Supervision: Substance and Style
Gellerman, Saul W.
1976-01-01
Argues that managerial style and substance are inextricably intertwined, illustrating the discussion with excerpts from an extensive study and job analysis of first-line supervisors in a food packaging plant. (JG)
Stochastic models of intracellular transport
Bressloff, Paul C.; Newby, Jay M.
2013-01-01
The interior of a living cell is a crowded, heterogenuous, fluctuating environment. Hence, a major challenge in modeling intracellular transport is to analyze stochastic processes within complex environments. Broadly speaking, there are two basic mechanisms for intracellular transport: passive diffusion and motor-driven active transport. Diffusive transport can be formulated in terms of the motion of an overdamped Brownian particle. On the other hand, active transport requires chemical energy, usually in the form of adenosine triphosphate hydrolysis, and can be direction specific, allowing biomolecules to be transported long distances; this is particularly important in neurons due to their complex geometry. In this review a wide range of analytical methods and models of intracellular transport is presented. In the case of diffusive transport, narrow escape problems, diffusion to a small target, confined and single-file diffusion, homogenization theory, and fractional diffusion are considered. In the case of active transport, Brownian ratchets, random walk models, exclusion processes, random intermittent search processes, quasi-steady-state reduction methods, and mean-field approximations are considered. Applications include receptor trafficking, axonal transport, membrane diffusion, nuclear transport, protein-DNA interactions, virus trafficking, and the self-organization of subcellular structures.
Stochastic models of intracellular transport
Bressloff, Paul C.
2013-01-09
The interior of a living cell is a crowded, heterogenuous, fluctuating environment. Hence, a major challenge in modeling intracellular transport is to analyze stochastic processes within complex environments. Broadly speaking, there are two basic mechanisms for intracellular transport: passive diffusion and motor-driven active transport. Diffusive transport can be formulated in terms of the motion of an overdamped Brownian particle. On the other hand, active transport requires chemical energy, usually in the form of adenosine triphosphate hydrolysis, and can be direction specific, allowing biomolecules to be transported long distances; this is particularly important in neurons due to their complex geometry. In this review a wide range of analytical methods and models of intracellular transport is presented. In the case of diffusive transport, narrow escape problems, diffusion to a small target, confined and single-file diffusion, homogenization theory, and fractional diffusion are considered. In the case of active transport, Brownian ratchets, random walk models, exclusion processes, random intermittent search processes, quasi-steady-state reduction methods, and mean-field approximations are considered. Applications include receptor trafficking, axonal transport, membrane diffusion, nuclear transport, protein-DNA interactions, virus trafficking, and the self-organization of subcellular structures. © 2013 American Physical Society.
Portfolio Optimization with Stochastic Dividends and Stochastic Volatility
Varga, Katherine Yvonne
2015-01-01
We consider an optimal investment-consumption portfolio optimization model in which an investor receives stochastic dividends. As a first problem, we allow the drift of stock price to be a bounded function. Next, we consider a stochastic volatility model. In each problem, we use the dynamic programming method to derive the Hamilton-Jacobi-Bellman…
Children's Responses to Literary Style.
Henze, Mary Vance
This study undertook to determine (1) whether teaching sixth grade children elements of style would increase their pleasure in listening to "The Hobbit," (2) whether children who learned the most about style would respond the most positively to Tolkien's style, and (3) what children's preferences would be for selected examples of Tolkien's style.…
Understanding Stochastic Subspace Identification
DEFF Research Database (Denmark)
Brincker, Rune; Andersen, Palle
2006-01-01
The data driven Stochastic Subspace Identification techniques is considered to be the most powerful class of the known identification techniques for natural input modal analysis in the time domain. However, the techniques involves several steps of "mysterious mathematics" that is difficult...... to follow and to understand for people with a classical background in structural dynamics. Also the connection to the classical correlation driven time domain techniques is not well established. The purpose of this paper is to explain the different steps in the SSI techniques of importance for modal...
The stochastic quality calculus
DEFF Research Database (Denmark)
Zeng, Kebin; Nielson, Flemming; Nielson, Hanne Riis
2014-01-01
We introduce the Stochastic Quality Calculus in order to model and reason about distributed processes that rely on each other in order to achieve their overall behaviour. The calculus supports broadcast communication in a truly concurrent setting. Generally distributed delays are associated...... with the outputs and at the same time the inputs impose constraints on the waiting times. Consequently, the expected inputs may not be available when needed and therefore the calculus allows to express the absence of data.The communication delays are expressed by general distributions and the resulting semantics...
Implementation of optimal Galerkin and Collocation approximations of PDEs with Random Coefficients
Beck, Joakim
2011-12-22
In this work we first focus on the Stochastic Galerkin approximation of the solution u of an elliptic stochastic PDE. We rely on sharp estimates for the decay of the coefficients of the spectral expansion of u on orthogonal polynomials to build a sequence of polynomial subspaces that features better convergence properties compared to standard polynomial subspaces such as Total Degree or Tensor Product. We consider then the Stochastic Collocation method, and use the previous estimates to introduce a new effective class of Sparse Grids, based on the idea of selecting a priori the most profitable hierarchical surpluses, that, again, features better convergence properties compared to standard Smolyak or tensor product grids.
Carpentier, Pierre; Cohen, Guy; De Lara, Michel
2015-01-01
The focus of the present volume is stochastic optimization of dynamical systems in discrete time where - by concentrating on the role of information regarding optimization problems - it discusses the related discretization issues. There is a growing need to tackle uncertainty in applications of optimization. For example the massive introduction of renewable energies in power systems challenges traditional ways to manage them. This book lays out basic and advanced tools to handle and numerically solve such problems and thereby is building a bridge between Stochastic Programming and Stochastic Control. It is intended for graduates readers and scholars in optimization or stochastic control, as well as engineers with a background in applied mathematics.
Stochastic Runge-Kutta Software Package for Stochastic Differential Equations
Gevorkyan, M N; Korolkova, A V; Kulyabov, D S; Sevastyanov, L A
2016-01-01
As a result of the application of a technique of multistep processes stochastic models construction the range of models, implemented as a self-consistent differential equations, was obtained. These are partial differential equations (master equation, the Fokker--Planck equation) and stochastic differential equations (Langevin equation). However, analytical methods do not always allow to research these equations adequately. It is proposed to use the combined analytical and numerical approach studying these equations. For this purpose the numerical part is realized within the framework of symbolic computation. It is recommended to apply stochastic Runge--Kutta methods for numerical study of stochastic differential equations in the form of the Langevin. Under this approach, a program complex on the basis of analytical calculations metasystem Sage is developed. For model verification logarithmic walks and Black--Scholes two-dimensional model are used. To illustrate the stochastic "predator--prey" type model is us...
AA, stochastic precooling pickup
CERN PhotoLab
1980-01-01
The freshly injected antiprotons were subjected to fast stochastic "precooling". In this picture of a precooling pickup, the injection orbit is to the left, the stack orbit to the far right. After several seconds of precooling with the system's kickers (in momentum and in the vertical plane), the precooled antiprotons were transferred, by means of RF, to the stack tail, where they were subjected to further stochastic cooling in momentum and in both transverse planes, until they ended up, deeply cooled, in the stack core. During precooling, a shutter near the central orbit shielded the pickups from the signals emanating from the stack-core, whilst the stack-core was shielded from the violent action of the precooling kickers by a shutter on these. All shutters were opened briefly during transfer of the precooled antiprotons to the stack tail. Here, the shutter is not yet mounted. Precooling pickups and kickers had the same design, except that the kickers had cooling circuits and the pickups had none. Peering th...
Stochastic ferromagnetism analysis and numerics
Brzezniak, Zdzislaw; Neklyudov, Mikhail; Prohl, Andreas
2013-01-01
This monograph examines magnetization dynamics at elevated temperatures which can be described by the stochastic Landau-Lifshitz-Gilbert equation (SLLG). Comparative computational studies with the stochastic model are included. Constructive tools such as e.g. finite element methods are used to derive the theoretical results, which are then used for computational studies.
Some stochastic aspects of quantization
Indian Academy of Sciences (India)
From the advent of quantum mechanics, various types of stochastic-dynamical approach to quantum mechanics have been tried. We discuss how to utilize Nelson's stochastic quantum mechanics to analyze the tunneling phenomena, how to derive relativistic ﬁeld equations via the Poisson process and how to describe a ...
Stochastic Pi-calculus Revisited
DEFF Research Database (Denmark)
Cardelli, Luca; Mardare, Radu Iulian
2013-01-01
We develop a version of stochastic Pi-calculus with a semantics based on measure theory. We dene the behaviour of a process in a rate environment using measures over the measurable space of processes induced by structural congruence. We extend the stochastic bisimulation to include the concept...
Capasso, Vincenzo
2015-01-01
This textbook, now in its third edition, offers a rigorous and self-contained introduction to the theory of continuous-time stochastic processes, stochastic integrals, and stochastic differential equations. Expertly balancing theory and applications, the work features concrete examples of modeling real-world problems from biology, medicine, industrial applications, finance, and insurance using stochastic methods. No previous knowledge of stochastic processes is required. Key topics include: * Markov processes * Stochastic differential equations * Arbitrage-free markets and financial derivatives * Insurance risk * Population dynamics, and epidemics * Agent-based models New to the Third Edition: * Infinitely divisible distributions * Random measures * Levy processes * Fractional Brownian motion * Ergodic theory * Karhunen-Loeve expansion * Additional applications * Additional exercises * Smoluchowski approximation of Langevin systems An Introduction to Continuous-Time Stochastic Processes, Third Editio...
Stochastic Modeling of Soil Salinity
Suweis, Samir; Rinaldo, Andrea; van der Zee, Sjoerd E. A. T. M.; Maritan, Amos; Porporato, Amilcare
2010-05-01
Large areas of cultivated land worldwide are affected by soil salinity. Estimates report that 10% of arable land in over 100 countries, and nine million km2 are salt affected, especially in arid and semi-arid regions. High salinity causes both ion specific and osmotic stress effects, with important consequences for plant production and quality. Salt accumulation in the root zone may be due to natural factors (primary salinization) or due to irrigation (secondary salinization). Simple (e.g., vertically averaged over the soil depth) coupled soil moisture and salt balance equations have been used in the past. Despite their approximations, these models have the advantage of parsimony, thus allowing a direct analysis of the interplay of the main processes. They also provide the ideal starting point to include external, random hydro-climatic fluctuations in the analysis of long-term salinization trends. We propose a minimalist stochastic model of primary soil salinity, in which the rate of soil salinization is determined by the balance between dry and wet salt deposition and the intermittent leaching events caused by rainfall events. The long term probability density functions of salt mass and concentration are found by reducing the coupled soil moisture and salt mass balance equation to a stochastic differential equation driven by multiplicative Poisson noise. The novel analytical solutions provide insight on the interplay of the main soil, plant and climate parameters responsible for long-term soil salinization. In fact, soil salinity statistics are obtained as a function of climate, soil and vegetation parameters. These, in turn, can be combined with soil moisture statistics to obtain a full characterization of soil salt concentrations and the ensuing risk of primary salinization. In particular, the solutions show the existence of two quite distinct regimes, the first one where the mean salt mass remains nearly constant with increasing rainfall frequency, and the
INFERENCE AND SENSITIVITY IN STOCHASTIC WIND POWER FORECAST MODELS.
Elkantassi, Soumaya
2017-10-03
Reliable forecasting of wind power generation is crucial to optimal control of costs in generation of electricity with respect to the electricity demand. Here, we propose and analyze stochastic wind power forecast models described by parametrized stochastic differential equations, which introduce appropriate fluctuations in numerical forecast outputs. We use an approximate maximum likelihood method to infer the model parameters taking into account the time correlated sets of data. Furthermore, we study the validity and sensitivity of the parameters for each model. We applied our models to Uruguayan wind power production as determined by historical data and corresponding numerical forecasts for the period of March 1 to May 31, 2016.
Mean Field Games for Stochastic Growth with Relative Utility
Energy Technology Data Exchange (ETDEWEB)
Huang, Minyi, E-mail: mhuang@math.carleton.ca [Carleton University, School of Mathematics and Statistics (Canada); Nguyen, Son Luu, E-mail: sonluu.nguyen@upr.edu [University of Puerto Rico, Department of Mathematics (United States)
2016-12-15
This paper considers continuous time stochastic growth-consumption optimization in a mean field game setting. The individual capital stock evolution is determined by a Cobb–Douglas production function, consumption and stochastic depreciation. The individual utility functional combines an own utility and a relative utility with respect to the population. The use of the relative utility reflects human psychology, leading to a natural pattern of mean field interaction. The fixed point equation of the mean field game is derived with the aid of some ordinary differential equations. Due to the relative utility interaction, our performance analysis depends on some ratio based approximation error estimate.
Provably unbounded memory advantage in stochastic simulation using quantum mechanics
Garner, Andrew J. P.; Liu, Qing; Thompson, Jayne; Vedral, Vlatko; Gu, mile
2017-10-01
Simulating the stochastic evolution of real quantities on a digital computer requires a trade-off between the precision to which these quantities are approximated, and the memory required to store them. The statistical accuracy of the simulation is thus generally limited by the internal memory available to the simulator. Here, using tools from computational mechanics, we show that quantum processors with a fixed finite memory can simulate stochastic processes of real variables to arbitrarily high precision. This demonstrates a provable, unbounded memory advantage that a quantum simulator can exhibit over its best possible classical counterpart.
Variance decomposition in stochastic simulators
Le Maître, O. P.
2015-06-28
This work aims at the development of a mathematical and computational approach that enables quantification of the inherent sources of stochasticity and of the corresponding sensitivities in stochastic simulations of chemical reaction networks. The approach is based on reformulating the system dynamics as being generated by independent standardized Poisson processes. This reformulation affords a straightforward identification of individual realizations for the stochastic dynamics of each reaction channel, and consequently a quantitative characterization of the inherent sources of stochasticity in the system. By relying on the Sobol-Hoeffding decomposition, the reformulation enables us to perform an orthogonal decomposition of the solution variance. Thus, by judiciously exploiting the inherent stochasticity of the system, one is able to quantify the variance-based sensitivities associated with individual reaction channels, as well as the importance of channel interactions. Implementation of the algorithms is illustrated in light of simulations of simplified systems, including the birth-death, Schlögl, and Michaelis-Menten models.
Brownian motion and stochastic calculus
Karatzas, Ioannis
1998-01-01
This book is designed as a text for graduate courses in stochastic processes. It is written for readers familiar with measure-theoretic probability and discrete-time processes who wish to explore stochastic processes in continuous time. The vehicle chosen for this exposition is Brownian motion, which is presented as the canonical example of both a martingale and a Markov process with continuous paths. In this context, the theory of stochastic integration and stochastic calculus is developed. The power of this calculus is illustrated by results concerning representations of martingales and change of measure on Wiener space, and these in turn permit a presentation of recent advances in financial economics (option pricing and consumption/investment optimization). This book contains a detailed discussion of weak and strong solutions of stochastic differential equations and a study of local time for semimartingales, with special emphasis on the theory of Brownian local time. The text is complemented by a large num...
International Conference Approximation Theory XV
Schumaker, Larry
2017-01-01
These proceedings are based on papers presented at the international conference Approximation Theory XV, which was held May 22–25, 2016 in San Antonio, Texas. The conference was the fifteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 146 participants. The book contains longer survey papers by some of the invited speakers covering topics such as compressive sensing, isogeometric analysis, and scaling limits of polynomials and entire functions of exponential type. The book also includes papers on a variety of current topics in Approximation Theory drawn from areas such as advances in kernel approximation with applications, approximation theory and algebraic geometry, multivariate splines for applications, practical function approximation, approximation of PDEs, wavelets and framelets with applications, approximation theory in signal processing, compressive sensing, rational interpolation, spline approximation in isogeometric analysis, a...
Energy Technology Data Exchange (ETDEWEB)
Milligan, M.; Donohoo, P.; O' Malley, M.
2012-09-01
Wind and solar generators differ in their generation characteristics than conventional generators. The variable output and imperfect predictability of these generators face a stochastic approach to plan and operate the power system without fundamentally changing the operation and planning problems. This paper overviews stochastic modeling challenges in operations, generation planning, and transmission planning, with references to current industry and academic work. Different stochastic problem formulations, including approximations, are also discussed.
Stochastic models for surface diffusion of molecules
Energy Technology Data Exchange (ETDEWEB)
Shea, Patrick, E-mail: patrick.shea@dal.ca; Kreuzer, Hans Jürgen [Department of Physics and Atmospheric Science, Dalhousie University, Halifax, Nova Scotia B3H 3J5 (Canada)
2014-07-28
We derive a stochastic model for the surface diffusion of molecules, starting from the classical equations of motion for an N-atom molecule on a surface. The equation of motion becomes a generalized Langevin equation for the center of mass of the molecule, with a non-Markovian friction kernel. In the Markov approximation, a standard Langevin equation is recovered, and the effect of the molecular vibrations on the diffusion is seen to lead to an increase in the friction for center of mass motion. This effective friction has a simple form that depends on the curvature of the lowest energy diffusion path in the 3N-dimensional coordinate space. We also find that so long as the intramolecular forces are sufficiently strong, memory effects are usually not significant and the Markov approximation can be employed, resulting in a simple one-dimensional model that can account for the effect of the dynamics of the molecular vibrations on the diffusive motion.
Directory of Open Access Journals (Sweden)
Maša Žvelc
2007-01-01
Full Text Available Theory of attachment primarily described early relationships between a child and his caretakers. In the last twenty years there is a growing interest in adult attachment research. Theories and research findings of adult attachment stem from two different methodological approaches. The first approach measures adult attachment through Adult Attachment Interview (AAI; Main, 1991 where the attachment is assessed through the narratives of adult people of their early child experiences with their primary caretakers. The second approach measures adult attachment with the help of self-evaluative questionnaires, developed by (a Hazan and Shaver (1987 who started this approach in the field of personality and social psychology, and (b Bartholomew and Horowitz (1991. Research shows that there is significant correlation between early and adult attachment style. Attachment styles are passed from generation to generation. Basic adult attachment styles are: securely attached, preoccupied, fearful-avoidant, dismissing-avoidant and disorganized. Previous research using Barholomew and Horowitz (1991 Relationship Questionnaire on 176 Slovenian students showed that 48% students are securely attached, 29% are fearful-avoidant, 10% are dismissing-avoidant, and 13% have preoccupied attachment style. Theory of attachment is very useful for understanding the behavior and subjective experiences of children and adults. It is applicable to different contexts (psychotherapy, counseling, education .... The paper proposes further research focused on integration of adult attachment styles and types of object relations measured by Test of object relations (Žvelc, 1998 and Pictorial test of Separation and Individuation (Žvelc, 2003.
Energy Technology Data Exchange (ETDEWEB)
Silva, Milena Wollmann da; Vilhena, Marco Tullio M.B.; Bodmann, Bardo Ernst J.; Vasques, Richard, E-mail: milena.wollmann@ufrgs.br, E-mail: vilhena@mat.ufrgs.br, E-mail: bardobodmann@ufrgs.br, E-mail: richard.vasques@fulbrightmail.org [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Programa de Pos-Graduacao em Engenharia Mecanica
2015-07-01
The neutron point kinetics equation, which models the time-dependent behavior of nuclear reactors, is often used to understand the dynamics of nuclear reactor operations. It consists of a system of coupled differential equations that models the interaction between (i) the neutron population; and (II) the concentration of the delayed neutron precursors, which are radioactive isotopes formed in the fission process that decay through neutron emission. These equations are deterministic in nature, and therefore can provide only average values of the modeled populations. However, the actual dynamical process is stochastic: the neutron density and the delayed neutron precursor concentrations vary randomly with time. To address this stochastic behavior, Hayes and Allen have generalized the standard deterministic point kinetics equation. They derived a system of stochastic differential equations that can accurately model the random behavior of the neutron density and the precursor concentrations in a point reactor. Due to the stiffness of these equations, this system was numerically implemented using a stochastic piecewise constant approximation method (Stochastic PCA). Here, we present a study of the influence of stochastic fluctuations on the results of the neutron point kinetics equation. We reproduce the stochastic formulation introduced by Hayes and Allen and compute Monte Carlo numerical results for examples with constant and time-dependent reactivity, comparing these results with stochastic and deterministic methods found in the literature. Moreover, we introduce a modified version of the stochastic method to obtain a non-stiff solution, analogue to a previously derived deterministic approach. (author)
Stochastic population theories
Ludwig, Donald
1974-01-01
These notes serve as an introduction to stochastic theories which are useful in population biology; they are based on a course given at the Courant Institute, New York, in the Spring of 1974. In order to make the material. accessible to a wide audience, it is assumed that the reader has only a slight acquaintance with probability theory and differential equations. The more sophisticated topics, such as the qualitative behavior of nonlinear models, are approached through a succession of simpler problems. Emphasis is placed upon intuitive interpretations, rather than upon formal proofs. In most cases, the reader is referred elsewhere for a rigorous development. On the other hand, an attempt has been made to treat simple, useful models in some detail. Thus these notes complement the existing mathematical literature, and there appears to be little duplication of existing works. The authors are indebted to Miss Jeanette Figueroa for her beautiful and speedy typing of this work. The research was supported by the Na...
Morgan, Byron JT; Tanner, Martin Abba; Carlin, Bradley P
2008-01-01
Introduction and Examples Introduction Examples of data sets Basic Model Fitting Introduction Maximum-likelihood estimation for a geometric model Maximum-likelihood for the beta-geometric model Modelling polyspermy Which model? What is a model for? Mechanistic models Function Optimisation Introduction MATLAB: graphs and finite differences Deterministic search methods Stochastic search methods Accuracy and a hybrid approach Basic Likelihood ToolsIntroduction Estimating standard errors and correlations Looking at surfaces: profile log-likelihoods Confidence regions from profiles Hypothesis testing in model selectionScore and Wald tests Classical goodness of fit Model selection biasGeneral Principles Introduction Parameterisation Parameter redundancy Boundary estimates Regression and influence The EM algorithm Alternative methods of model fitting Non-regular problemsSimulation Techniques Introduction Simulating random variables Integral estimation Verification Monte Carlo inference Estimating sampling distributi...
Hopf Bifurcation of Compound Stochastic van der Pol System
Directory of Open Access Journals (Sweden)
Shaojuan Ma
2016-01-01
Full Text Available Hopf bifurcation analysis for compound stochastic van der Pol system with a bound random parameter and Gaussian white noise is investigated in this paper. By the Karhunen-Loeve (K-L expansion and the orthogonal polynomial approximation, the equivalent deterministic van der Pol system can be deduced. Based on the bifurcation theory of nonlinear deterministic system, the critical value of bifurcation parameter is obtained and the influence of random strength δ and noise intensity σ on stochastic Hopf bifurcation in compound stochastic system is discussed. At last we found that increased δ can relocate the critical value of bifurcation parameter forward while increased σ makes it backward and the influence of δ is more sensitive than σ. The results are verified by numerical simulations.
The critical domain size of stochastic population models.
Reimer, Jody R; Bonsall, Michael B; Maini, Philip K
2017-02-01
Identifying the critical domain size necessary for a population to persist is an important question in ecology. Both demographic and environmental stochasticity impact a population's ability to persist. Here we explore ways of including this variability. We study populations with distinct dispersal and sedentary stages, which have traditionally been modelled using a deterministic integrodifference equation (IDE) framework. Individual-based models (IBMs) are the most intuitive stochastic analogues to IDEs but yield few analytic insights. We explore two alternate approaches; one is a scaling up to the population level using the Central Limit Theorem, and the other a variation on both Galton-Watson branching processes and branching processes in random environments. These branching process models closely approximate the IBM and yield insight into the factors determining the critical domain size for a given population subject to stochasticity.
Abductive learning of quantized stochastic processes with probabilistic finite automata.
Chattopadhyay, Ishanu; Lipson, Hod
2013-02-13
We present an unsupervised learning algorithm (GenESeSS) to infer the causal structure of quantized stochastic processes, defined as stochastic dynamical systems evolving over discrete time, and producing quantized observations. Assuming ergodicity and stationarity, GenESeSS infers probabilistic finite state automata models from a sufficiently long observed trace. Our approach is abductive; attempting to infer a simple hypothesis, consistent with observations and modelling framework that essentially fixes the hypothesis class. The probabilistic automata we infer have no initial and terminal states, have no structural restrictions and are shown to be probably approximately correct-learnable. Additionally, we establish rigorous performance guarantees and data requirements, and show that GenESeSS correctly infers long-range dependencies. Modelling and prediction examples on simulated and real data establish relevance to automated inference of causal stochastic structures underlying complex physical phenomena.
Management styles and motivation.
Shearer, Dana Ann
2012-01-01
According to a review of the current literature, common managerial styles are transformational, transactional, and laissez-faire. When managers expand their leadership skills to improve the staff's morale, they must use a combination of transformational leadership behaviors and transactional contingent rewards to maximize their effectiveness on employees. A motivation theory such as Herzberg and Maslow enhances employees' motivation, morale, and satisfaction. Being able to motivate, empower, and influence staff improves satisfaction and retention levels among the team. A manager's leadership style influences motivation, morale, and retention in staff. Leaders are influenced by their educational development and the organizational culture. Organizational culture has an impact on a manager's style, which is forwarded to their followers.
INHOMOGENEOUS DIOPHANTINE APPROXIMATION WITH PRIME ...
Indian Academy of Sciences (India)
50
INHOMOGENEOUS DIOPHANTINE APPROXIMATION WITH PRIME. CONSTRAINTS. STEPHAN BAIER AND ANISH GHOSH. Abstract. We study the problem of ... this area under primality constraints. Indeed, the ...... [7] A. Ghosh, Diophantine approximation on subspaces of Rn and dynamics on homogeneous spaces, to.
Diophantine approximation in prescribed degree
Schleischitz, Johannes
2017-01-01
We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the intensely studied problem of approximation by algebraic numbers (and integers) of bounded degree. We establish the answer to a question of Bugeaud concerning approximation to transcendental real numbers by quadratic irrational numbers, and thereby we refine a resu...
Cope, Vicki; Murray, Melanie
2017-06-21
Nurses are often asked to think about leadership, particularly in times of rapid change in healthcare, and where questions have been raised about whether leaders and managers have adequate insight into the requirements of care. This article discusses several leadership styles relevant to contemporary healthcare and nursing practice. Nurses who are aware of leadership styles may find this knowledge useful in maintaining a cohesive working environment. Leadership knowledge and skills can be improved through training, where, rather than having to undertake formal leadership roles without adequate preparation, nurses are able to learn, nurture, model and develop effective leadership behaviours, ultimately improving nursing staff retention and enhancing the delivery of safe and effective care.
Example based style classification
DEFF Research Database (Denmark)
Welnicka, Katarzyna; Bærentzen, Jakob Andreas; Aanæs, Henrik
2011-01-01
We address the problem of analysis of families of shapes which can be classified according to two categories: the main one corresponding usually to the coarse shape which we call the function and the more subtle one which we call the style. The style and the function both contribute to the overal...... this similarity should be reflected across different functions. We show the usability of our methods first on the example of a number of chess sets which our method helps sort. Next, we investigate the problem of finding a replacement for a missing tooth given a database of teeth....
Cuddy, Claudia M
2002-01-01
Many nursing schools and health care journals have adopted the Publication Manual of the American Psychological Association (APA stylebook) as their guide to achieve uniformity and consistency in manuscript preparation as well as in usage and writing style. Published in 2001, the fifth edition of the APA stylebook contains 440 pages and can overwhelm someone who tries to use it for the first time. This article delineates main points in the areas of manuscript preparation, reference lists, in-text citations, and style choices.
Hughes, Grace
2016-12-14
What was the nature of the CPD activity, practice-related feedback and/or event and/or experience in your practice? The article explored different learning styles and outlined some of the models that can be used to identify them. It discussed the limitations of these models, indicating that although they can be helpful in identifying a student's preferred learning style, this is not 'fixed' and might change over time. Learning is also influenced by other factors, such as culture and age.
Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs
2011-04-01
adl`ag, and Markov time properties, and prove that the semantics of our logic is measurable. We present compositional proof rules, including rules for stochastic differential equations, and prove soundness.
Introduction to stochastic dynamic programming
Ross, Sheldon M; Lukacs, E
1983-01-01
Introduction to Stochastic Dynamic Programming presents the basic theory and examines the scope of applications of stochastic dynamic programming. The book begins with a chapter on various finite-stage models, illustrating the wide range of applications of stochastic dynamic programming. Subsequent chapters study infinite-stage models: discounting future returns, minimizing nonnegative costs, maximizing nonnegative returns, and maximizing the long-run average return. Each of these chapters first considers whether an optimal policy need exist-providing counterexamples where appropriate-and the
An introduction to probability and stochastic processes
Melsa, James L
2013-01-01
Geared toward college seniors and first-year graduate students, this text is designed for a one-semester course in probability and stochastic processes. Topics covered in detail include probability theory, random variables and their functions, stochastic processes, linear system response to stochastic processes, Gaussian and Markov processes, and stochastic differential equations. 1973 edition.
Exact constants in approximation theory
Korneichuk, N
1991-01-01
This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base
International Conference Approximation Theory XIV
Schumaker, Larry
2014-01-01
This volume developed from papers presented at the international conference Approximation Theory XIV, held April 7–10, 2013 in San Antonio, Texas. The proceedings contains surveys by invited speakers, covering topics such as splines on non-tensor-product meshes, Wachspress and mean value coordinates, curvelets and shearlets, barycentric interpolation, and polynomial approximation on spheres and balls. Other contributed papers address a variety of current topics in approximation theory, including eigenvalue sequences of positive integral operators, image registration, and support vector machines. This book will be of interest to mathematicians, engineers, and computer scientists working in approximation theory, computer-aided geometric design, numerical analysis, and related approximation areas.
DEFF Research Database (Denmark)
Ditlevsen, Susanne; Samson, Adeline
2014-01-01
Parameter estimation in multidimensional diffusion models with only one coordinate observed is highly relevant in many biological applications, but a statistically difficult problem. In neuroscience, the membrane potential evolution in single neurons can be measured at high frequency, but biophys...
Humor Styles and Leadership Styles: Community College Presidents
Carrica, Jennifer L.
2009-01-01
The purpose of this study was to explore the relationship between leadership styles (transformational, transactional, laissez-faire) and humor styles (affiliative, self-enhancing, aggressive, self-defeating) of community college presidents. Research has shown that humor and leadership styles are related and that humor may enhance interpersonal…
Leadership Style: Attitudes and Behaviors.
Hersey, Paul; Blanchard, Kenneth H.
1982-01-01
Discusses significant differences between the Grid and Situational leadership styles. Examines the difference between attitudes and behaviors, gives examples, and explores the relationship between self-perception and leadership style. (CT)
Style and creativity in design
Chan, Chiu-Shui
2015-01-01
This book looks at causative reasons behind creative acts and stylistic expressions. It explores how creativity is initiated by design cognition and explains relationships between style and creativity. The book establishes a new cognitive theory of style and creativity in design and provides designers with insights into their own cognitive processes and styles of thinking, supporting a better understanding of the qualities present in their own design. An explanation of the nature of design cognition begins this work, with a look at how design knowledge is formulated, developed, structured and utilized, and how this utilization triggers style and creativity. The author goes on to review historical studies of style, considering a series of psychological experiments relating to the operational definition, degree, measurement, and creation of style. The work conceptually summarizes the recognition of individual style in products, as well as the creation of such styles as a process before reviewing studies on cr...
Identity style and coping strategies.
Berzonsky, M D
1992-12-01
This study examined the relationship between identity style and strategies used to cope with stressors that potentially threaten one's sense of identity. Identity style refers to differences in the way individuals construct and revise or maintain their sense of identity. An informational style involves actively seeking out, evaluating, and utilizing self-relevant information. A normative style highlights the expectations and standards of significant others. A diffuse/avoidant style is characterized by procrastination and situation-specific reactions. Late-adolescent college subjects were administered measures of identity style, ways of coping with academic stressors, and test anxiety. Within this self-as-student context, subjects with diffuse and normative identity styles employed avoidant-oriented coping strategies (wishful thinking, distancing, and tension reduction). An informational style was associated with deliberate, problem-focused coping. Findings are discussed in terms of a process model of identity development.
Stochastic simulation of chemically reacting systems using multi-core processors.
Gillespie, Colin S
2012-01-07
In recent years, computer simulations have become increasingly useful when trying to understand the complex dynamics of biochemical networks, particularly in stochastic systems. In such situations stochastic simulation is vital in gaining an understanding of the inherent stochasticity present, as these models are rarely analytically tractable. However, a stochastic approach can be computationally prohibitive for many models. A number of approximations have been proposed that aim to speed up stochastic simulations. However, the majority of these approaches are fundamentally serial in terms of central processing unit (CPU) usage. In this paper, we propose a novel simulation algorithm that utilises the potential of multi-core machines. This algorithm partitions the model into smaller sub-models. These sub-models are then simulated, in parallel, on separate CPUs. We demonstrate that this method is accurate and can speed-up the simulation by a factor proportional to the number of processors available.
STOCHSIMGPU: parallel stochastic simulation for the Systems Biology Toolbox 2 for MATLAB
Klingbeil, G.
2011-02-25
Motivation: The importance of stochasticity in biological systems is becoming increasingly recognized and the computational cost of biologically realistic stochastic simulations urgently requires development of efficient software. We present a new software tool STOCHSIMGPU that exploits graphics processing units (GPUs) for parallel stochastic simulations of biological/chemical reaction systems and show that significant gains in efficiency can be made. It is integrated into MATLAB and works with the Systems Biology Toolbox 2 (SBTOOLBOX2) for MATLAB. Results: The GPU-based parallel implementation of the Gillespie stochastic simulation algorithm (SSA), the logarithmic direct method (LDM) and the next reaction method (NRM) is approximately 85 times faster than the sequential implementation of the NRM on a central processing unit (CPU). Using our software does not require any changes to the user\\'s models, since it acts as a direct replacement of the stochastic simulation software of the SBTOOLBOX2. © The Author 2011. Published by Oxford University Press. All rights reserved.
Turkle, Sherry; Papert, Seymour
1993-01-01
Case studies of elementary school and college students are used to examine the different styles of approach taken to computer programing. Introduces the term "bricoleur" to describe programers who do not take a structured approach to programing. Discusses gender differences among programers. (MDH)
DEFF Research Database (Denmark)
Dahlgaard, Jens Jørn; Nørgaard, Anders; Jakobsen, Søren
1997-01-01
Corporate success stories tend to emphasize the "great men" theory of history. But now a European research project established the managerial attributes that can turn an ordinary leader into one ideal for the pursuit of business excellence. The emergence of five leadership styles as crucial drivers...
Huitema, Dave; Van Snellenberg, Ton
Environmental policy directed at industry is changing course. 'Shared responsibility' and related concepts reflect the idea that industry and government can now work together to solve environmental problems. In our view, this change implies a shift towards a more consensual policy style. This is
Huitema, D.; van Snellenberg, A.H.L.M.
1999-01-01
Environmental policy directed at industry is changing course. 'Shared responsibility' and related concepts reflect the idea that industry and government can now work together to solve environmental problems. In our view, this change implies a shift towards a more consensual policy style. This is
Glenn, E. S.; And Others
1977-01-01
Offers an alternative methodology for studying persuasive strategies by examining the persuasive strategies selected by professional persuaders representing those cultures being studied. Analyzes the persuasive styles of United States, Soviet Union and Arab diplomats involved in international negotiations in the Security Council of the United…
Bonnici, Charles A.
2011-01-01
Many articles about school improvement talk about data-driven instruction and statistics. In the barrage of evaluative numbers, school leaders can forget that teaching and leading are arts, not sciences. Positive outcomes depend on the ambience of the school, which is a direct result of the leadership style of its principal and assistant…
Lott, Debra
2010-01-01
Louisville, Kentucky is an eclectic town of architectural styles from Greek revival to Renaissance Revival to Post modernism, not to mention an entire street dedicated to artsy mom and pop stores. Louisville is second only to the New York City Soho district in terms of the number of its cast-iron facades. Many of these building's fronts have…
Holt, Maureen
2003-01-01
Presents an art lesson used with sixth-grade students in which they painted their school mascot (a tiger) in the style of a famous artist. Explains that students selected an artist, such as Andrew Wyeth or Edvard Munch. Describes how the students created their tigers. (CMK)
Directory of Open Access Journals (Sweden)
Camelia M. Cmeciu
2009-07-01
Full Text Available Styles of Communicationeste o nouărevistăinternaţionalăcare va fipublicatăanual de Facultatea detiinţe ale Comunicării, Universitatea„Danubius” din Galaţi, în colaborare cu Comitetul de Filologie al Academieidetiinţe din Polonia, filiala Wroclaw.
An overview of grape metabolites from anabolism and catabolism during berry development, and their significance to different wine styles. For example, grape secondary metabolites, such as phenolics, have long been valuable for the organoleptic properties they impart to fruit and wine, but more recen...
Computational methods in stochastic dynamics
Papadrakakis, Manolis; Papadopoulos, Vissarion
2011-01-01
Covering what is an emerging frontier in research, this book focuses on advanced computational methods and software tools. These can be of huge assistance in tackling complex problems in stochastic dynamic and seismic analysis as well as structure design.
Stochastic Climate Theory and Modelling
Franzke, Christian L E; Berner, Judith; Williams, Paul D; Lucarini, Valerio
2014-01-01
Stochastic methods are a crucial area in contemporary climate research and are increasingly being used in comprehensive weather and climate prediction models as well as reduced order climate models. Stochastic methods are used as subgrid-scale parameterizations as well as for model error representation, uncertainty quantification, data assimilation and ensemble prediction. The need to use stochastic approaches in weather and climate models arises because we still cannot resolve all necessary processes and scales in comprehensive numerical weather and climate prediction models. In many practical applications one is mainly interested in the largest and potentially predictable scales and not necessarily in the small and fast scales. For instance, reduced order models can simulate and predict large scale modes. Statistical mechanics and dynamical systems theory suggest that in reduced order models the impact of unresolved degrees of freedom can be represented by suitable combinations of deterministic and stochast...
Path Loss Models Based on Stochastic Rays
Hu, Luoquan; Yu, Han; Chen, Yifan
2007-01-01
In this paper, two-dimensional percolation lattices are applied to describe wireless propagation environment, and stochastic rays are employed to model the trajectories of radio waves. We first derive the probability that a stochastic ray undergoes certain number of collisions at a specific spatial location. Three classes of stochastic rays with different constraint conditions are considered: stochastic rays of random walks, and generic stochastic rays with two different anomalous levels. Sub...
Energy Technology Data Exchange (ETDEWEB)
Webster, Clayton G [ORNL; Zhang, Guannan [ORNL; Gunzburger, Max D [ORNL
2012-10-01
Accurate predictive simulations of complex real world applications require numerical approximations to first, oppose the curse of dimensionality and second, converge quickly in the presence of steep gradients, sharp transitions, bifurcations or finite discontinuities in high-dimensional parameter spaces. In this paper we present a novel multi-dimensional multi-resolution adaptive (MdMrA) sparse grid stochastic collocation method, that utilizes hierarchical multiscale piecewise Riesz basis functions constructed from interpolating wavelets. The basis for our non-intrusive method forms a stable multiscale splitting and thus, optimal adaptation is achieved. Error estimates and numerical examples will used to compare the efficiency of the method with several other techniques.
Stochastic population dynamics in astrochemistry and aerosol science
Losert-Valiente Kroon, C. M.
Classical, non-equilibrium systems of diffusing species or entities undergoing depletion, evaporation and reaction processes are at the heart of many problems in Physics, Chemistry, Biology and Financial Mathematics. It is well known that fluctuations and correlations in statistical systems can have a profound influence on the macroscopic properties of the system. However, the traditional rate equations that describe the evolution of mean populations in time and space do not incorporate statistical fluctuations. This becomes an issue of great importance when population densities are low. In order to develop a stochastic description of birth-and-death processes beyond the mean field approximation I employ techniques in classical many-body Physics in a manner analogous to the treatment of quantum systems. I obtain promising results to understand and quantify the exact circumstances of the failure of the mean-field approximation in specific problems in Astrophysics, namely heterogeneous chemical reactions in interstellar clouds, and in Aerosol Science, namely heterogeneous nucleation processes, and deliver the means to manipulate the alternative stochastic framework according to the Doi-Peliti formalism. In this framework the mean population of a species is given by the average of a solution to a set of constraint equations over all realisations of the stochastic noise. The constraint equations are inhomogeneous stochastic partial differential equations with multiplicative real or complex Gaussian noise. In general, these equations cannot be solved analytically. Therefore I resort to the numerical implementation of the Doi-Peliti formalism. The main code is written in the GNU C language, some algebraic calculations are performed by means of the MapleV package. In the case of large population densities the stochastic framework renders the same results as the mean field approximation whereas for low population densities its predictions differ substantially from the
Stochastic Programming with Cauchy Distribution
Directory of Open Access Journals (Sweden)
Manas Kumar Pal
2015-12-01
Full Text Available The aim of this paper is to derive a method for solving a stochastic linear programming problem with Cauchy distribution. Assuming that the coefficients are distributed as Cauchy random variables, the stochastic linear programming is converted to a deterministic non-linear programming problem by a suitable transformation. Then an algorithm can be used to solve the resulting deterministic problem .A numerical example can be considered to illustrate the above methodology.
On solving stochastic MADM problems
Directory of Open Access Journals (Sweden)
Văduva Ion
2009-01-01
Full Text Available The paper examines a MADM problem with stochastic attributes. The transformation of a stochastic MADM problem into a cardinal problem is done by the standardization of the probability distribution of each attribute X and calculating the information of each attribute as Shannon's entropy or Onicescu's informational energy. Some well known (performant methods to solve a cardinal MADM problem are presented and a method for combining results of several methods to give a final MADM solution is discussed.
Stochastic Analysis and Related Topics
Ustunel, Ali
1988-01-01
The Silvri Workshop was divided into a short summer school and a working conference, producing lectures and research papers on recent developments in stochastic analysis on Wiener space. The topics treated in the lectures relate to the Malliavin calculus, the Skorohod integral and nonlinear functionals of white noise. Most of the research papers are applications of these subjects. This volume addresses researchers and graduate students in stochastic processes and theoretical physics.
Stochastic force in gravitational systems
Del Popolo, A.
2001-01-01
In this paper I study the probability distribution of the gravitational force in gravitational systems through numerical experiments. I show that Kandrup's (1980) and Antonuccio-Delogu & Atrio-Barandela's (1992) theories describe correctly the stochastic force probability distribution respectively in inhomogeneous and clustered systems. I find equations for the probability distribution of stochastic forces in finite systems, both homogeneous and clustered, which I use to compare the theoretic...
Stochastic optimization: beyond mathematical programming
CERN. Geneva
2015-01-01
Stochastic optimization, among which bio-inspired algorithms, is gaining momentum in areas where more classical optimization algorithms fail to deliver satisfactory results, or simply cannot be directly applied. This presentation will introduce baseline stochastic optimization algorithms, and illustrate their efficiency in different domains, from continuous non-convex problems to combinatorial optimization problem, to problems for which a non-parametric formulation can help exploring unforeseen possible solution spaces.
Strategy-Proof Stochastic Assignment
Erdil, A.
2013-01-01
I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is highly restrictive when the mechanism involves randomization. In fact, the Random Priority mechanism...
Leadership Styles and Their Consequences.
Warrick, D. D.
1981-01-01
Discusses leadership style theories and offers an integration of the theories by describing typical characteristics, skills, philosophies, and consequences associated with each major style. An experiential exercise is described which portrays the major styles and the productivity and satisfaction each is likely to produce. Nine figures accompany…
Learning styles in otolaryngology fellowships.
Varela, David A Diaz Voss; Malik, Mohammad U; Laeeq, Kulsoom; Pandian, Vinciya; Brown, David J; Weatherly, Robert A; Cummings, Charles W; Bhatti, Nasir I
2011-12-01
Previous studies have identified a predominant learning style in trainees from different specialties, more recently in otolaryngology residents. The purpose of our study was to determine a predominant learning style within otolaryngology fellowships and to identify any differences between otolaryngology fellows and residents. We conducted a survey of otolaryngology fellows at 25 otolaryngology fellowship programs accredited by the Accreditation Council for Graduate Medical Education. We emailed Kolb's Learning Style Index version 3.1 to 16 pediatric otolaryngology (PO) and 24 otology/neurotology (ON) fellows. This index is a widely used 12-item questionnaire. The participants answered each item in the questionnaire as it applied to their preferred learning style: accommodating, converging, diverging, or assimilating. Results were then analyzed and compared between each subspecialty and the previously reported preferred styles of otolaryngology residents. Ten PO and 20 ON fellows completed the survey, with an overall response rate of 75%. PO and ON fellows (60% of each group) preferred a learning style that was "balanced" across all four styles. For ON fellows, 35% preferred converging and 5% preferred accommodating styles. For PO fellows, converging and accommodating styles accounted for 20% each. It was previously reported that 74.4% of otolaryngology residents prefer either converging or accommodating styles. We believe that the fellowship training environment calls for fellows to use more than one learning style to become proficient physicians, hence the trend toward potentially developing a balanced style when at this level. Copyright © 2011 The American Laryngological, Rhinological, and Otological Society, Inc.
Strategies for Bridging Learning Styles
Birchman, J. A.; Sadowski, M. A.
2007-01-01
Regardless of the instrument used to determine learning styles, it is commonly accepted that people learn in different ways. As Professors, we tend to teach in a style that matches the way we ourselves learn. Tis may or may not match the learning styles of the students in our classroom. As Graphics educators, we cannot meet every student's…
Parenting Style Transitions and Delinquency
Schroeder, Ryan D.; Mowen, Thomas J.
2014-01-01
Parenting style has been extensively analyzed as a contributor to juvenile delinquency in the criminological literature, but no research to date has assessed the prevalence of parenting style changes during adolescence or the influence of such parenting style changes on juvenile delinquency. Drawing from the life course theory, the results show…
Cumming, D.; Fleming, G.; Schwienbacher, A.
2009-01-01
We introduce the concept of style drift to private equity investment. We present theory and evidence pertaining to style drifts in terms of a fund manager's stated focus on particular stages of entrepreneurial development. We develop a model that derives conditions under which style drifts are less
Hybrid stochastic simplifications for multiscale gene networks.
Crudu, Alina; Debussche, Arnaud; Radulescu, Ovidiu
2009-09-07
Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion [1-3] which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Hybrid simplifications can be used for onion-like (multi-layered) approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach.
Hybrid stochastic simplifications for multiscale gene networks
Directory of Open Access Journals (Sweden)
Debussche Arnaud
2009-09-01
Full Text Available Abstract Background Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. Results We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion 123 which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Conclusion Hybrid simplifications can be used for onion-like (multi-layered approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach.
Scaled hydrogenic approximation wavefunctions. [Hartree-Fock approximation
Energy Technology Data Exchange (ETDEWEB)
Shore, B.W.
1979-09-01
Although widespread use of computer codes for the solution of Schrodinger equations makes available numerical Hartree-Fock model radial wave functions, there remains persistant interest in simple analytic expressions for atomic wave functions. One such frequency favored approach employs hydrogenic functions, suitably scaled, as approximate wave functions. The following note displays typical inaccuracies to be expected from such approximations. 13 references.
Stochastic processes in gravitropism.
Meroz, Yasmine; Bastien, Renaud
2014-01-01
In this short review we focus on the role of noise in gravitropism of plants - the reorientation of plants according to the direction of gravity. We briefly introduce the conventional picture of static gravisensing in cells specialized in sensing. This model hinges on the sedimentation of statoliths (high in density and mass relative to other organelles) to the lowest part of the sensing cell. We then present experimental observations that cannot currently be understood within this framework. Lastly we introduce some current alternative models and directions that attempt to incorporate and interpret these experimental observations, including: (i) dynamic sensing, where gravisensing is suggested to be enhanced by stochastic events due to thermal and mechanical noise. These events both effectively lower the threshold of response, and lead to small-distance sedimentation, allowing amplification, and integration of the signal. (ii) The role of the cytoskeleton in signal-to-noise modulation and (iii) in signal transduction. In closing, we discuss directions that seem to either not have been explored, or that are still poorly understood.
Adaptation in stochastic environments
Clark, Colib
1993-01-01
The classical theory of natural selection, as developed by Fisher, Haldane, and 'Wright, and their followers, is in a sense a statistical theory. By and large the classical theory assumes that the underlying environment in which evolution transpires is both constant and stable - the theory is in this sense deterministic. In reality, on the other hand, nature is almost always changing and unstable. We do not yet possess a complete theory of natural selection in stochastic environ ments. Perhaps it has been thought that such a theory is unimportant, or that it would be too difficult. Our own view is that the time is now ripe for the development of a probabilistic theory of natural selection. The present volume is an attempt to provide an elementary introduction to this probabilistic theory. Each author was asked to con tribute a simple, basic introduction to his or her specialty, including lively discussions and speculation. We hope that the book contributes further to the understanding of the roles of "Cha...
AA, stochastic precooling kicker
CERN PhotoLab
1980-01-01
The freshly injected antiprotons were subjected to fast stochastic "precooling", while a shutter shielded the deeply cooled antiproton stack from the violent action of the precooling kicker. In this picture, the injection orbit is to the left, the stack orbit to the far right, the separating shutter is in open position. After several seconds of precooling (in momentum and in the vertical plane), the shutter was opened briefly, so that by means of RF the precooled antiprotons could be transferred to the stack tail, where they were subjected to further cooling in momentum and both transverse planes, until they ended up, deeply cooled, in the stack core. The fast shutter, which had to open and close in a fraction of a second was an essential item of the cooling scheme and a mechanical masterpiece. Here the shutter is in the open position. The precooling pickups were of the same design, with the difference that the kickers had cooling circuits and the pickups not. 8401150 shows a precooling pickup with the shutte...
Stacking with Stochastic Cooling
Caspers, Friedhelm
2004-01-01
Accumulation of large stacks of antiprotons or ions with the aid of stochastic cooling is more delicate than cooling a constant intensity beam. Basically the difficulty stems from the fact that the optimized gain and the cooling rate are inversely proportional to the number of particles seen by the cooling system. Therefore, to maintain fast stacking, the newly injected batch has to be strongly protected from the Schottky noise of the stack. Vice versa the stack has to be efficiently shielded against the high gain cooling system for the injected beam. In the antiproton accumulators with stacking ratios up to 105, the problem is solved by radial separation of the injection and the stack orbits in a region of large dispersion. An array of several tapered cooling systems with a matched gain profile provides a continuous particle flux towards the high-density stack core. Shielding of the different systems from each other is obtained both through the spatial separation and via the revolution frequencies (filters)....
Kallianpur, Gopinath; Hida, Takeyuki
1987-01-01
The use of probabilistic methods in the biological sciences has been so well established by now that mathematical biology is regarded by many as a distinct dis cipline with its own repertoire of techniques. The purpose of the Workshop on sto chastic methods in biology held at Nagoya University during the week of July 8-12, 1985, was to enable biologists and probabilists from Japan and the U. S. to discuss the latest developments in their respective fields and to exchange ideas on the ap plicability of the more recent developments in stochastic process theory to problems in biology. Eighteen papers were presented at the Workshop and have been grouped under the following headings: I. Population genetics (five papers) II. Measure valued diffusion processes related to population genetics (three papers) III. Neurophysiology (two papers) IV. Fluctuation in living cells (two papers) V. Mathematical methods related to other problems in biology, epidemiology, population dynamics, etc. (six papers) An important f...
Stochastic partial differential equations
Lototsky, Sergey V
2017-01-01
Taking readers with a basic knowledge of probability and real analysis to the frontiers of a very active research discipline, this textbook provides all the necessary background from functional analysis and the theory of PDEs. It covers the main types of equations (elliptic, hyperbolic and parabolic) and discusses different types of random forcing. The objective is to give the reader the necessary tools to understand the proofs of existing theorems about SPDEs (from other sources) and perhaps even to formulate and prove a few new ones. Most of the material could be covered in about 40 hours of lectures, as long as not too much time is spent on the general discussion of stochastic analysis in infinite dimensions. As the subject of SPDEs is currently making the transition from the research level to that of a graduate or even undergraduate course, the book attempts to present enough exercise material to fill potential exams and homework assignments. Exercises appear throughout and are usually directly connected ...
A constrained approach to multiscale stochastic simulation of chemically reacting systems
Cotter, Simon L.
2011-01-01
Stochastic simulation of coupled chemical reactions is often computationally intensive, especially if a chemical system contains reactions occurring on different time scales. In this paper, we introduce a multiscale methodology suitable to address this problem, assuming that the evolution of the slow species in the system is well approximated by a Langevin process. It is based on the conditional stochastic simulation algorithm (CSSA) which samples from the conditional distribution of the suitably defined fast variables, given values for the slow variables. In the constrained multiscale algorithm (CMA) a single realization of the CSSA is then used for each value of the slow variable to approximate the effective drift and diffusion terms, in a similar manner to the constrained mean-force computations in other applications such as molecular dynamics. We then show how using the ensuing Fokker-Planck equation approximation, we can in turn approximate average switching times in stochastic chemical systems. © 2011 American Institute of Physics.
Nobile, Fabio
2009-11-05
We consider the problem of numerically approximating statistical moments of the solution of a time- dependent linear parabolic partial differential equation (PDE), whose coefficients and/or forcing terms are spatially correlated random fields. The stochastic coefficients of the PDE are approximated by truncated Karhunen-Loève expansions driven by a finite number of uncorrelated random variables. After approxi- mating the stochastic coefficients, the original stochastic PDE turns into a new deterministic parametric PDE of the same type, the dimension of the parameter set being equal to the number of random variables introduced. After proving that the solution of the parametric PDE problem is analytic with respect to the parameters, we consider global polynomial approximations based on tensor product, total degree or sparse polynomial spaces and constructed by either a Stochastic Galerkin or a Stochastic Collocation approach. We derive convergence rates for the different cases and present numerical results that show how these approaches are a valid alternative to the more traditional Monte Carlo Method for this class of problems. © 2009 John Wiley & Sons, Ltd.
Finitely approximable random sets and their evolution via differential equations
Ananyev, B. I.
2016-12-01
In this paper, random closed sets (RCS) in Euclidean space are considered along with their distributions and approximation. Distributions of RCS may be used for the calculation of expectation and other characteristics. Reachable sets on initial data and some ways of their approximate evolutionary description are investigated for stochastic differential equations (SDE) with initial state in some RCS. Markov property of random reachable sets is proved in the space of closed sets. For approximate calculus, the initial RCS is replaced by a finite set on the integer multidimensional grid and the multistage Markov chain is substituted for SDE. The Markov chain is constructed by methods of SDE numerical integration. Some examples are also given.
Truthful approximations to range voting
DEFF Research Database (Denmark)
Filos-Ratsika, Aris; Miltersen, Peter Bro
We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as a non-truthful mechanism for exact social welfare......-unilateral has an approximation ratio between 0.610 and 0.611, the best ordinal mechanism has an approximation ratio between 0.616 and 0.641, while the best mixed-unilateral mechanism has an approximation ratio bigger than 0.660. In particular, the best mixed-unilateral non-ordinal (i.e., cardinal) mechanism...
Adaptive approximation of higher order posterior statistics
Lee, Wonjung
2014-02-01
Filtering is an approach for incorporating observed data into time-evolving systems. Instead of a family of Dirac delta masses that is widely used in Monte Carlo methods, we here use the Wiener chaos expansion for the parametrization of the conditioned probability distribution to solve the nonlinear filtering problem. The Wiener chaos expansion is not the best method for uncertainty propagation without observations. Nevertheless, the projection of the system variables in a fixed polynomial basis spanning the probability space might be a competitive representation in the presence of relatively frequent observations because the Wiener chaos approach not only leads to an accurate and efficient prediction for short time uncertainty quantification, but it also allows to apply several data assimilation methods that can be used to yield a better approximate filtering solution. The aim of the present paper is to investigate this hypothesis. We answer in the affirmative for the (stochastic) Lorenz-63 system based on numerical simulations in which the uncertainty quantification method and the data assimilation method are adaptively selected by whether the dynamics is driven by Brownian motion and the near-Gaussianity of the measure to be updated, respectively. © 2013 Elsevier Inc.
Network histograms and universality of blockmodel approximation.
Olhede, Sofia C; Wolfe, Patrick J
2014-10-14
In this paper we introduce the network histogram, a statistical summary of network interactions to be used as a tool for exploratory data analysis. A network histogram is obtained by fitting a stochastic blockmodel to a single observation of a network dataset. Blocks of edges play the role of histogram bins and community sizes that of histogram bandwidths or bin sizes. Just as standard histograms allow for varying bandwidths, different blockmodel estimates can all be considered valid representations of an underlying probability model, subject to bandwidth constraints. Here we provide methods for automatic bandwidth selection, by which the network histogram approximates the generating mechanism that gives rise to exchangeable random graphs. This makes the blockmodel a universal network representation for unlabeled graphs. With this insight, we discuss the interpretation of network communities in light of the fact that many different community assignments can all give an equally valid representation of such a network. To demonstrate the fidelity-versus-interpretability tradeoff inherent in considering different numbers and sizes of communities, we analyze two publicly available networks--political weblogs and student friendships--and discuss how to interpret the network histogram when additional information related to node and edge labeling is present.
Preconditioned stochastic gradient descent optimisation for monomodal image registration.
Klein, Stefan; Staring, Marius; Andersson, Patrik; Pluim, Josien P W
2011-01-01
We present a stochastic optimisation method for intensity-based monomodal image registration. The method is based on a Robbins-Monro stochastic gradient descent method with adaptive step size estimation, and adds a preconditioning matrix. The derivation of the pre-conditioner is based on the observation that, after registration, the deformed moving image should approximately equal the fixed image. This prior knowledge allows us to approximate the Hessian at the minimum of the registration cost function, without knowing the coordinate transformation that corresponds to this minimum. The method is validated on 3D fMRI time-series and 3D CT chest follow-up scans. The experimental results show that the preconditioning strategy improves the rate of convergence.
Numerical Solution of Stochastic Nonlinear Fractional Differential Equations
El-Beltagy, Mohamed A.
2015-01-07
Using Wiener-Hermite expansion (WHE) technique in the solution of the stochastic partial differential equations (SPDEs) has the advantage of converting the problem to a system of deterministic equations that can be solved efficiently using the standard deterministic numerical methods [1]. WHE is the only known expansion that handles the white/colored noise exactly. This work introduces a numerical estimation of the stochastic response of the Duffing oscillator with fractional or variable order damping and driven by white noise. The WHE technique is integrated with the Grunwald-Letnikov approximation in case of fractional order and with Coimbra approximation in case of variable-order damping. The numerical solver was tested with the analytic solution and with Monte-Carlo simulations. The developed mixed technique was shown to be efficient in simulating SPDEs.
Hopf Bifurcations of a Stochastic Fractional-Order Van der Pol System
Directory of Open Access Journals (Sweden)
Xiaojun Liu
2014-01-01
Full Text Available The Hopf bifurcation of a fractional-order Van der Pol (VDP for short system with a random parameter is investigated. Firstly, the Chebyshev polynomial approximation is applied to study the stochastic fractional-order system. Based on the method, the stochastic system is reduced to the equivalent deterministic one, and then the responses of the stochastic system can be obtained by numerical methods. Then, according to the existence conditions of Hopf bifurcation, the critical parameter value of the bifurcation is obtained by theoretical analysis. Then, numerical simulations are carried out to verify the theoretical results.
Introduction to Supersymmetric Theory of Stochastics
Directory of Open Access Journals (Sweden)
Igor V. Ovchinnikov
2016-03-01
Full Text Available Many natural and engineered dynamical systems, including all living objects, exhibit signatures of what can be called spontaneous dynamical long-range order (DLRO. This order’s omnipresence has long been recognized by the scientific community, as evidenced by a myriad of related concepts, theoretical and phenomenological frameworks, and experimental phenomena such as turbulence, 1/f noise, dynamical complexity, chaos and the butterfly effect, the Richter scale for earthquakes and the scale-free statistics of other sudden processes, self-organization and pattern formation, self-organized criticality, etc. Although several successful approaches to various realizations of DLRO have been established, the universal theoretical understanding of this phenomenon remained elusive. The possibility of constructing a unified theory of DLRO has emerged recently within the approximation-free supersymmetric theory of stochastics (STS. There, DLRO is the spontaneous breakdown of the topological or de Rahm supersymmetry that all stochastic differential equations (SDEs possess. This theory may be interesting to researchers with very different backgrounds because the ubiquitous DLRO is a truly interdisciplinary entity. The STS is also an interdisciplinary construction. This theory is based on dynamical systems theory, cohomological field theories, the theory of pseudo-Hermitian operators, and the conventional theory of SDEs. Reviewing the literature on all these mathematical disciplines can be time consuming. As such, a concise and self-contained introduction to the STS, the goal of this paper, may be useful.
Stochastic computations in cortical microcircuit models.
Directory of Open Access Journals (Sweden)
Stefan Habenschuss
Full Text Available Experimental data from neuroscience suggest that a substantial amount of knowledge is stored in the brain in the form of probability distributions over network states and trajectories of network states. We provide a theoretical foundation for this hypothesis by showing that even very detailed models for cortical microcircuits, with data-based diverse nonlinear neurons and synapses, have a stationary distribution of network states and trajectories of network states to which they converge exponentially fast from any initial state. We demonstrate that this convergence holds in spite of the non-reversibility of the stochastic dynamics of cortical microcircuits. We further show that, in the presence of background network oscillations, separate stationary distributions emerge for different phases of the oscillation, in accordance with experimentally reported phase-specific codes. We complement these theoretical results by computer simulations that investigate resulting computation times for typical probabilistic inference tasks on these internally stored distributions, such as marginalization or marginal maximum-a-posteriori estimation. Furthermore, we show that the inherent stochastic dynamics of generic cortical microcircuits enables them to quickly generate approximate solutions to difficult constraint satisfaction problems, where stored knowledge and current inputs jointly constrain possible solutions. This provides a powerful new computing paradigm for networks of spiking neurons, that also throws new light on how networks of neurons in the brain could carry out complex computational tasks such as prediction, imagination, memory recall and problem solving.
Stochastic computations in cortical microcircuit models.
Habenschuss, Stefan; Jonke, Zeno; Maass, Wolfgang
2013-01-01
Experimental data from neuroscience suggest that a substantial amount of knowledge is stored in the brain in the form of probability distributions over network states and trajectories of network states. We provide a theoretical foundation for this hypothesis by showing that even very detailed models for cortical microcircuits, with data-based diverse nonlinear neurons and synapses, have a stationary distribution of network states and trajectories of network states to which they converge exponentially fast from any initial state. We demonstrate that this convergence holds in spite of the non-reversibility of the stochastic dynamics of cortical microcircuits. We further show that, in the presence of background network oscillations, separate stationary distributions emerge for different phases of the oscillation, in accordance with experimentally reported phase-specific codes. We complement these theoretical results by computer simulations that investigate resulting computation times for typical probabilistic inference tasks on these internally stored distributions, such as marginalization or marginal maximum-a-posteriori estimation. Furthermore, we show that the inherent stochastic dynamics of generic cortical microcircuits enables them to quickly generate approximate solutions to difficult constraint satisfaction problems, where stored knowledge and current inputs jointly constrain possible solutions. This provides a powerful new computing paradigm for networks of spiking neurons, that also throws new light on how networks of neurons in the brain could carry out complex computational tasks such as prediction, imagination, memory recall and problem solving.
Directory of Open Access Journals (Sweden)
Jie Yu
2015-01-01
Full Text Available Virtual power plant (VPP is an aggregation of multiple distributed generations, energy storage, and controllable loads. Affected by natural conditions, the uncontrollable distributed generations within VPP, such as wind and photovoltaic generations, are extremely random and relative. Considering the randomness and its correlation of uncontrollable distributed generations, this paper constructs the chance constraints stochastic optimal dispatch of VPP including stochastic variables and its random correlation. The probability distributions of independent wind and photovoltaic generations are described by empirical distribution functions, and their joint probability density model is established by Frank-copula function. And then, sample average approximation (SAA is applied to convert the chance constrained stochastic optimization model into a deterministic optimization model. Simulation cases are calculated based on the AIMMS. Simulation results of this paper mathematic model are compared with the results of deterministic optimization model without stochastic variables and stochastic optimization considering stochastic variables but not random correlation. Furthermore, this paper analyzes how SAA sampling frequency and the confidence level influence the results of stochastic optimization. The numerical example results show the effectiveness of the stochastic optimal dispatch of VPP considering the randomness and its correlations of distributed generations.
Universal fuzzy integral sliding-mode controllers for stochastic nonlinear systems.
Gao, Qing; Liu, Lu; Feng, Gang; Wang, Yong
2014-12-01
In this paper, the universal integral sliding-mode controller problem for the general stochastic nonlinear systems modeled by Itô type stochastic differential equations is investigated. One of the main contributions is that a novel dynamic integral sliding mode control (DISMC) scheme is developed for stochastic nonlinear systems based on their stochastic T-S fuzzy approximation models. The key advantage of the proposed DISMC scheme is that two very restrictive assumptions in most existing ISMC approaches to stochastic fuzzy systems have been removed. Based on the stochastic Lyapunov theory, it is shown that the closed-loop control system trajectories are kept on the integral sliding surface almost surely since the initial time, and moreover, the stochastic stability of the sliding motion can be guaranteed in terms of linear matrix inequalities. Another main contribution is that the results of universal fuzzy integral sliding-mode controllers for two classes of stochastic nonlinear systems, along with constructive procedures to obtain the universal fuzzy integral sliding-mode controllers, are provided, respectively. Simulation results from an inverted pendulum example are presented to illustrate the advantages and effectiveness of the proposed approaches.
Takeshita, Tyler Y; de Jong, Wibe A; Neuhauser, Daniel; Baer, Roi; Rabani, Eran
2017-10-10
A stochastic orbital approach to the resolution of identity (RI) approximation for 4-index electron repulsion integrals (ERIs) is presented. The stochastic RI-ERIs are then applied to second order Møller-Plesset perturbation theory (MP2) utilizing a multiple stochastic orbital approach. The introduction of multiple stochastic orbitals results in an O(NAO3) scaling for both the stochastic RI-ERIs and stochastic RI-MP2, NAO being the number of basis functions. For a range of water clusters we demonstrate that this method exhibits a small prefactor and observed scalings of O(Ne2.4) for total energies and O(Ne3.1) for forces (Ne being the number of correlated electrons), outperforming MP2 for clusters with as few as 21 water molecules.
Multistage stochastic programming: A scenario tree based approach to planning under uncertainty
Defourny, Boris; Ernst, Damien; Wehenkel, Louis
2011-01-01
In this chapter, we present the multistage stochastic programming framework for sequential decision making under uncertainty. We discuss its differences with Markov Decision Processes, from the point of view of decision models and solution algorithms. We describe the standard technique for solving approximately multistage stochastic problems, which is based on a discretization of the disturbance space called scenario tree. We insist on a critical issue of the approach: the decisions can be ve...
Granita, Bahar, A.
2015-03-01
This paper discusses on linear birth and death with immigration and emigration (BIDE) process to stochastic differential equation (SDE) model. Forward Kolmogorov equation in continuous time Markov chain (CTMC) with a central-difference approximation was used to find Fokker-Planckequation corresponding to a diffusion process having the stochastic differential equation of BIDE process. The exact solution, mean and variance function of BIDE process was found.
Energy Technology Data Exchange (ETDEWEB)
Granita, E-mail: granitafc@gmail.com [Dept. Mathematical Education, State Islamic University of Sultan Syarif Kasim Riau, 28293 Indonesia and Dept. of Mathematical Science, Universiti Teknologi Malaysia, 81310,Johor (Malaysia); Bahar, A. [Dept. of Mathematical Science, Universiti Teknologi Malaysia, 81310,Johor Malaysia and UTM Center for Industrial and Applied Mathematics (UTM-CIAM) (Malaysia)
2015-03-09
This paper discusses on linear birth and death with immigration and emigration (BIDE) process to stochastic differential equation (SDE) model. Forward Kolmogorov equation in continuous time Markov chain (CTMC) with a central-difference approximation was used to find Fokker-Planckequation corresponding to a diffusion process having the stochastic differential equation of BIDE process. The exact solution, mean and variance function of BIDE process was found.
Driven microswimmers on a 2D substrate: A stochastic towed sled model
Energy Technology Data Exchange (ETDEWEB)
Marchegiani, Giampiero [Dipartimento di Fisica, Università di Camerino, I-62032 Camerino (Italy); Marchesoni, Fabio [Dipartimento di Fisica, Università di Camerino, I-62032 Camerino (Italy); Center for Phononics and Thermal Energy Science, Tongji University, Shanghai 200092 (China)
2015-11-14
We investigate, both numerically and analytically, the diffusion properties of a stochastic sled sliding on a substrate, subject to a constant towing force. The problem is motivated by the growing interest in controlling transport of artificial microswimmers in 2D geometries at low Reynolds numbers. We simulated both symmetric and asymmetric towed sleds. Remarkable properties of their mobilities and diffusion constants include sidewise drifts and excess diffusion peaks. We interpret our numerical findings by making use of stochastic approximation techniques.
Accelerated stochastic and hybrid methods for spatial simulations of reaction-diffusion systems
Rossinelli, D; Bayati, B; Koumoutsakos, P
2008-01-01
Spatial distributions characterize the evolution of reaction-diffusion models of several physical, chemical, and biological systems. We present two novel algorithms for the efficient simulation of these models: Spatial т-Leaping (Sт -Leaping), employing a unified acceleration of the stochastic simulation of reaction and diffusion, and Hybrid т-Leaping (Hт-Leaping), combining a deterministic diffusion approximation with a т-Leaping acceleration of the stochastic reactions. The algorithms are v...
Optimal causal inference: estimating stored information and approximating causal architecture.
Still, Susanne; Crutchfield, James P; Ellison, Christopher J
2010-09-01
We introduce an approach to inferring the causal architecture of stochastic dynamical systems that extends rate-distortion theory to use causal shielding--a natural principle of learning. We study two distinct cases of causal inference: optimal causal filtering and optimal causal estimation. Filtering corresponds to the ideal case in which the probability distribution of measurement sequences is known, giving a principled method to approximate a system's causal structure at a desired level of representation. We show that in the limit in which a model-complexity constraint is relaxed, filtering finds the exact causal architecture of a stochastic dynamical system, known as the causal-state partition. From this, one can estimate the amount of historical information the process stores. More generally, causal filtering finds a graded model-complexity hierarchy of approximations to the causal architecture. Abrupt changes in the hierarchy, as a function of approximation, capture distinct scales of structural organization. For nonideal cases with finite data, we show how the correct number of the underlying causal states can be found by optimal causal estimation. A previously derived model-complexity control term allows us to correct for the effect of statistical fluctuations in probability estimates and thereby avoid overfitting.
Multi-level methods and approximating distribution functions
Wilson, D.; Baker, R. E.
2016-07-01
Biochemical reaction networks are often modelled using discrete-state, continuous-time Markov chains. System statistics of these Markov chains usually cannot be calculated analytically and therefore estimates must be generated via simulation techniques. There is a well documented class of simulation techniques known as exact stochastic simulation algorithms, an example of which is Gillespie's direct method. These algorithms often come with high computational costs, therefore approximate stochastic simulation algorithms such as the tau-leap method are used. However, in order to minimise the bias in the estimates generated using them, a relatively small value of tau is needed, rendering the computational costs comparable to Gillespie's direct method. The multi-level Monte Carlo method (Anderson and Higham, Multiscale Model. Simul. 10:146-179, 2012) provides a reduction in computational costs whilst minimising or even eliminating the bias in the estimates of system statistics. This is achieved by first crudely approximating required statistics with many sample paths of low accuracy. Then correction terms are added until a required level of accuracy is reached. Recent literature has primarily focussed on implementing the multi-level method efficiently to estimate a single system statistic. However, it is clearly also of interest to be able to approximate entire probability distributions of species counts. We present two novel methods that combine known techniques for distribution reconstruction with the multi-level method. We demonstrate the potential of our methods using a number of examples.
DEFF Research Database (Denmark)
Johnsen, Christian Garmann; Olaison, Lena; Meier Sørensen, Bent
2017-01-01
This article uses the concept of style to rethink sustainable entrepreneurship. Our point of departure is the conceptual distinction between organization as style made durable and entrepreneurship as the disruption of style. We show that style is not simply an aesthetic category, but rather what...... that sustainable entrepreneurship consists of making an environmentally friendly and socially conscious style durable, but also of disrupting such a style. In order to illustrate our argument, we use the example of the sustainable smartphone producer Fairphone. In conclusion, we argue that the concept of style may...... ties different social practices together. While organization makes the connections between social practices durable, entrepreneurship disrupts such patterns. We further elucidate how organization and entrepreneurship are two intermingled processes – those of durability and disruption – that together...
Directory of Open Access Journals (Sweden)
Dra. Cristina Etayo Pérez
2008-01-01
Full Text Available This paper aims to study the management style of the Spanish advertising agencies. For this purpose, it explores the way in which the dimensions that define the nature of this concept arise in the sector chosen. The analysis begins with the definition of management style as concept followed by an exposition of its main functions and its fundamental dimensions. Then, the paper presents the methodology used to verify how these dimensions appear among managers as well as the results obtained during the fieldwork. Such methodology includes the achievement of in-depth interviews, with the help of a questionnaire of semi-structured questions, and the descriptive analysis of qualitative and quantitative information obtained from those interviews. The revision of these aspects enriches the study of management at the advertising agencies since it contributes to understand why certain actions have as a consequence one particular kind of relationship between directors and collaborators or another.
2012-01-01
The New Oxford Style Manual brings together two essential reference works in a single volume: New Hart's Rules and the New Oxford Dictionary for Writers and Editors. New Hart's Rules, Oxford's definitive guide to style, consists of 20 chapters that provide authoritative and expert advice on how to prepare copy for publication. Topics covered include how to use italic, roman, and other type treatments, numbers and dates, law and legal references, illustrations, notes and references, and bibliographies. The guidelines are complemented by the New Oxford Dictionary for Writers and Editors, which features 25,000 alphabetically arranged entries giving authoritative advice on those words and names which raise questions time and time again because of spelling, capitalization, hyphenation, or cultural and historical context. Entries give full coverage of recommended spellings, variant forms, confusable words, hyphenation, capitalization, foreign and specialist terms, proper names, and abbreviations. The dictionary a...
LINEAR MULTIFRACTIONAL STOCHASTIC VOLTERRA INTEGRO-DIFFERENTIAL EQUATIONS
Nguyen, Tien Dung
2013-01-01
In this paper we prove the variation of parameters formula for linear Volterra integro-differential equations driven by multifractional Brownian motion. To do this, an approximate result for the Stratonovich stochastic integral with respect to the multifractional Brownian motion is given. Based on our obtained results we study almost surely exponentially convergence of the solution. Also, the existence and uniqueness of the solution of a multifractional Volterra integro-differential equation ...
Approximate circuits for increased reliability
Hamlet, Jason R.; Mayo, Jackson R.
2015-08-18
Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.
Approximate circuits for increased reliability
Energy Technology Data Exchange (ETDEWEB)
Hamlet, Jason R.; Mayo, Jackson R.
2015-12-22
Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.
Situational leadership style adopted by nurses in the hospital field
Directory of Open Access Journals (Sweden)
Karen Cristina Kades Andrigue
2016-12-01
Full Text Available This study aimed to analyze Situational Leadership styles adopted by hospital nurses and their association with their personal and professional profile. This is a quantitative and descriptive study and the Hersey and Blanchard leadership model was used with nurses who work in hospitals. Data were collected through sociodemographic questionnaire and the Leadership Effectiveness and Adaptability Description. The more directive leadership style focused on persuasion was the most present. The activity sector showed a significant relation to the leadership style (p=00.1, demonstrating approximation between assistance and leadership profile. Although the population is composed of young group with a short time of performance, the predominance of the Coaching leadership style may limit the creativity and potential of team members for the focus to be focused on the task. Strategies to achieve high levels of maturity, can assist nurses in adopting more flexible leadership practices.
2015-07-01
Transfer Standard URI uniform resource identifier W3C World Wide Web Consortium XML extensible markup language XSD XML schema definition XML Style...XML Overview The XML standard is a specification produced by the World Wide Web Consortium ( W3C ), whose original intent was to provide a machine...15, July 2015 10 Figure 7. IHAL Use Schema Modularity and Composability 4.2 Schema Format Define the schema according to the W3C XML schema
Parenting styles and economics
Zilibotti, Fabrizio
2015-01-01
Does the economy influence the way people bring up their children? How can we determine and measure a child’s utility? How can parenting styles be categorized in an economic model? These are the questions that Professor Fabricio Zilibotti of the University of Zurich addressed in his honorary lecture ‘Parenting with Style’, which he delivered at the April International Academic Conference during the 5th LCSR international workshop ‘Social and Cultural Changes in Cross-National Perspective: Sub...
Rondocubism versus National Style
Directory of Open Access Journals (Sweden)
Hnídková, Vendula
2010-11-01
Full Text Available There is a range of various terms used to refer to architectural production from the period after the First World War, among the most common being 'Rondocubism' and the 'National Style'. The terminological ambiguity clearly points to the problem with the very character of the style of expression that lies behind these diverse labels. In the 1920s, figures of the interwar avant-garde were already sharply critical of the post-war decorative style, the leading figures of which were the architects Pavel Janák and Josef Gočár. While this negative stigma was later overcome, following several thematic studies, it is still possible to look for other inspiring sources outside aesthetic categories that were directed at clarifying this theme. Extensive social projects had architects employed in all sorts of artistic activities, and therefore a possible answer to what the essence of the style was is offered by the wider political and cultural context. After the foundation of the Czechoslovak Republic, the former protagonists of architectural Cubism and their colleagues from the Czechoslovak Workshop Association, Artěl and the School of Decorative Arts attained such social standing that they could effectively influence local artistic development. Through the individual conception applied to official commissions they created a visual identity of the new state system. As is apparent from their theoretical writings, they found their sources of information for ornamental decoration of buildings and craft artefacts by bonding with local tradition. This did not of course mean directly borrowing from folk-art prototypes. Advanced forms of national art were intended to help establish Czechoslovakia in the international scene and were also a conscious attempt through a more folkish form of expression to appeal to the wider strata of the population.
Optimization in engineering sciences approximate and metaheuristic methods
Stefanoiu, Dan; Popescu, Dumitru; Filip, Florin Gheorghe; El Kamel, Abdelkader
2014-01-01
The purpose of this book is to present the main metaheuristics and approximate and stochastic methods for optimization of complex systems in Engineering Sciences. It has been written within the framework of the European Union project ERRIC (Empowering Romanian Research on Intelligent Information Technologies), which is funded by the EU's FP7 Research Potential program and has been developed in co-operation between French and Romanian teaching researchers. Through the principles of various proposed algorithms (with additional references) this book allows the reader to explore various methods o
Directory of Open Access Journals (Sweden)
Hyunsun Catherine Yoon
2017-08-01
Full Text Available This paper examines the way in which news about Gangnam Style was framed in the Korean press. First released on 15th July 2012, it became the first video to pass two billion views on YouTube. 400 news articles between July 2012 and March 2013 from two South Korean newspapers - Chosun Ilbo and Hankyoreh were analyzed using the frame analysis method in five categories: industry/economy, globalization, cultural interest, criticism, and competition. The right-left opinion cleavage is important because news frames interact with official discourses, audience frames and prior knowledge which consequently mediate effects on public opinion, policy debates, social movement and individual interpretations. Whilst the existing literature on Gangnam Style took rather holistic approach, this study aimed to fill the lacuna, considering this phenomenon as a dynamic process, by segmenting different stages - recognition, spread, peak and continuation. Both newspapers acknowledged Gangnam Style was an epochal event but their perspectives and news frames were different; globalization frame was most frequently used in Chosun Ilbo whereas cultural interest frame was most often used in Hankyoreh. Although more critical approaches were found in Hankyoreh, reflecting the right-left opinion cleavage, both papers lacked in critical appraisal and analysis of Gangnam Style’s reception in a broader context of the new Korean Wave.
On the Robustness of Temporal Properties for Stochastic Models
Directory of Open Access Journals (Sweden)
Ezio Bartocci
2013-08-01
Full Text Available Stochastic models such as Continuous-Time Markov Chains (CTMC and Stochastic Hybrid Automata (SHA are powerful formalisms to model and to reason about the dynamics of biological systems, due to their ability to capture the stochasticity inherent in biological processes. A classical question in formal modelling with clear relevance to biological modelling is the model checking problem. i.e. calculate the probability that a behaviour, expressed for instance in terms of a certain temporal logic formula, may occur in a given stochastic process. However, one may not only be interested in the notion of satisfiability, but also in the capacity of a system to mantain a particular emergent behaviour unaffected by the perturbations, caused e.g. from extrinsic noise, or by possible small changes in the model parameters. To address this issue, researchers from the verification community have recently proposed several notions of robustness for temporal logic providing suitable definitions of distance between a trajectory of a (deterministic dynamical system and the boundaries of the set of trajectories satisfying the property of interest. The contributions of this paper are twofold. First, we extend the notion of robustness to stochastic systems, showing that this naturally leads to a distribution of robustness scores. By discussing two examples, we show how to approximate the distribution of the robustness score and its key indicators: the average robustness and the conditional average robustness. Secondly, we show how to combine these indicators with the satisfaction probability to address the system design problem, where the goal is to optimize some control parameters of a stochastic model in order to best maximize robustness of the desired specifications.
A Stochastic Collocation Algorithm for Uncertainty Analysis
Mathelin, Lionel; Hussaini, M. Yousuff; Zang, Thomas A. (Technical Monitor)
2003-01-01
This report describes a stochastic collocation method to adequately handle a physically intrinsic uncertainty in the variables of a numerical simulation. For instance, while the standard Galerkin approach to Polynomial Chaos requires multi-dimensional summations over the stochastic basis functions, the stochastic collocation method enables to collapse those summations to a one-dimensional summation only. This report furnishes the essential algorithmic details of the new stochastic collocation method and provides as a numerical example the solution of the Riemann problem with the stochastic collocation method used for the discretization of the stochastic parameters.
Stochastic Dynamics through Hierarchically Embedded Markov Chains
Vasconcelos, Vítor V.; Santos, Fernando P.; Santos, Francisco C.; Pacheco, Jorge M.
2017-02-01
Studying dynamical phenomena in finite populations often involves Markov processes of significant mathematical and/or computational complexity, which rapidly becomes prohibitive with increasing population size or an increasing number of individual configuration states. Here, we develop a framework that allows us to define a hierarchy of approximations to the stationary distribution of general systems that can be described as discrete Markov processes with time invariant transition probabilities and (possibly) a large number of states. This results in an efficient method for studying social and biological communities in the presence of stochastic effects—such as mutations in evolutionary dynamics and a random exploration of choices in social systems—including situations where the dynamics encompasses the existence of stable polymorphic configurations, thus overcoming the limitations of existing methods. The present formalism is shown to be general in scope, widely applicable, and of relevance to a variety of interdisciplinary problems.
A stochastic transcriptional switch model for single cell imaging data.
Hey, Kirsty L; Momiji, Hiroshi; Featherstone, Karen; Davis, Julian R E; White, Michael R H; Rand, David A; Finkenstädt, Bärbel
2015-10-01
Gene expression is made up of inherently stochastic processes within single cells and can be modeled through stochastic reaction networks (SRNs). In particular, SRNs capture the features of intrinsic variability arising from intracellular biochemical processes. We extend current models for gene expression to allow the transcriptional process within an SRN to follow a random step or switch function which may be estimated using reversible jump Markov chain Monte Carlo (MCMC). This stochastic switch model provides a generic framework to capture many different dynamic features observed in single cell gene expression. Inference for such SRNs is challenging due to the intractability of the transition densities. We derive a model-specific birth-death approximation and study its use for inference in comparison with the linear noise approximation where both approximations are considered within the unifying framework of state-space models. The methodology is applied to synthetic as well as experimental single cell imaging data measuring expression of the human prolactin gene in pituitary cells. © The Author 2015. Published by Oxford University Press.
Stochastic models: theory and simulation.
Energy Technology Data Exchange (ETDEWEB)
Field, Richard V., Jr.
2008-03-01
Many problems in applied science and engineering involve physical phenomena that behave randomly in time and/or space. Examples are diverse and include turbulent flow over an aircraft wing, Earth climatology, material microstructure, and the financial markets. Mathematical models for these random phenomena are referred to as stochastic processes and/or random fields, and Monte Carlo simulation is the only general-purpose tool for solving problems of this type. The use of Monte Carlo simulation requires methods and algorithms to generate samples of the appropriate stochastic model; these samples then become inputs and/or boundary conditions to established deterministic simulation codes. While numerous algorithms and tools currently exist to generate samples of simple random variables and vectors, no cohesive simulation tool yet exists for generating samples of stochastic processes and/or random fields. There are two objectives of this report. First, we provide some theoretical background on stochastic processes and random fields that can be used to model phenomena that are random in space and/or time. Second, we provide simple algorithms that can be used to generate independent samples of general stochastic models. The theory and simulation of random variables and vectors is also reviewed for completeness.
Nursing Students’ Preferred Learning Styles
Directory of Open Access Journals (Sweden)
Sh Salehi
2009-11-01
Full Text Available Background and purpose: Learning style is the processing of information and comprehension. If teachers present contents in a style that matches a student’s preferred learning style, academic performance and success will improve. If content retention improves it will result in an increase in thetest scores. It is also important to determine if students, as a group, fit into a particular style or a particular cycle as they move through an educational program.Methods: The study is a descriptive analytical research. Nursing Students at Isfahan Medical Sciences University completed a questionnaire formulated to assess learning styles. Analysis of variance was used to investigate the possible relationship between learning cycle and student’s grades in the curriculum (i.e. freshman, sophomore, junior, or senior. Cross tabulation was used to test for a relationship between learning style and student academic year of study in the curriculum.Results: 294 students received the Kolb LSI questionnaire. The data demonstrated that juniors preferred a converger learning style and the senior students were in the abstract conceptualization cycle of learning. There were no relationships demonstrated between other groups in the study.Conclusion: The junior and senior students appear to prefer the stage of learning involving thinking and problem analysis. When a group of students demonstrate a preference for particular learning style teachers can develop their curriculum along their learning styleKey words: LEARNING STYLES, NURSING STUDENTS, FRESHMAN, SOPHOMORE, JUNIOR, SENIOR
DEFF Research Database (Denmark)
Picchini, Umberto; Forman, Julie Lyng
2016-01-01
a nonlinear stochastic differential equation model observed with correlated measurement errors and an application to protein folding modelling. An approximate Bayesian computation (ABC)-MCMC algorithm is suggested to allow inference for model parameters within reasonable time constraints. The ABC algorithm...
Gabor, Adriana F.; van Ommeren, Jan C.W.
2006-01-01
In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present three facility location problems with stochastic demand and exponential servers, respectively inventory. We present a $(1+\\varepsilon, 1)$-reduction of
Approximation algorithms for facility location problems with discrete subadditive cost functions
Gabor, A.F.; van Ommeren, Jan C.W.
2005-01-01
In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present two facility location problems with stochastic demand and exponential servers, respectively inventory. We present a $(1+\\epsilon,1)$- reduction of the
Entrepreneurs` Cognitive and Decision Making Styles
Directory of Open Access Journals (Sweden)
Mahmoud Motvaseli
2015-12-01
Full Text Available The main purpose of this study is to explore the relation between decision-making styles which are measured by the General decision-making style (GDMS test and information processing styles which are often termed cognitive styles and are, in this study, measured by Cognitive Style Inventory. The authors directed a survey research on 162 Iranian students. Structural equation modeling techniques were used to measure the impact of cognitive styles on decision-making styles. The authors found that cognitive styles have a positive impact on decision-making styles. In spite of the abundant research on factors that affect decision-making styles, few researches have tested the relationship between cognitive styles and decision-making styles. This study examines the impact of cognitive styles on decision-making styles in Iran. This study, like most research paper studies, cannot easily be generalized. Furthermore, the results of this study could be affected by economic conditions.
Applied probability and stochastic processes
Sumita, Ushio
1999-01-01
Applied Probability and Stochastic Processes is an edited work written in honor of Julien Keilson. This volume has attracted a host of scholars in applied probability, who have made major contributions to the field, and have written survey and state-of-the-art papers on a variety of applied probability topics, including, but not limited to: perturbation method, time reversible Markov chains, Poisson processes, Brownian techniques, Bayesian probability, optimal quality control, Markov decision processes, random matrices, queueing theory and a variety of applications of stochastic processes. The book has a mixture of theoretical, algorithmic, and application chapters providing examples of the cutting-edge work that Professor Keilson has done or influenced over the course of his highly-productive and energetic career in applied probability and stochastic processes. The book will be of interest to academic researchers, students, and industrial practitioners who seek to use the mathematics of applied probability i...
Intrinsic optimization using stochastic nanomagnets
Sutton, Brian; Camsari, Kerem Yunus; Behin-Aein, Behtash; Datta, Supriyo
2017-01-01
This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state. The basic constituents are stochastic nanomagnets which switch randomly between the ±1 Ising states and can be monitored continuously with standard electronics. Their mutual interactions can be short or long range, and their strengths can be reconfigured as needed to solve specific problems and to anneal the system at room temperature. The natural laws of statistical mechanics guide the network of stochastic nanomagnets at GHz speeds through the collective states with an emphasis on the low energy states that represent optimal solutions. As proof-of-concept, we present simulation results for standard NP-complete examples including a 16-city traveling salesman problem using experimentally benchmarked models for spin-transfer torque driven stochastic nanomagnets. PMID:28295053
Relativistic analysis of stochastic kinematics
Giona, Massimiliano
2017-10-01
The relativistic analysis of stochastic kinematics is developed in order to determine the transformation of the effective diffusivity tensor in inertial frames. Poisson-Kac stochastic processes are initially considered. For one-dimensional spatial models, the effective diffusion coefficient measured in a frame Σ moving with velocity w with respect to the rest frame of the stochastic process is inversely proportional to the third power of the Lorentz factor γ (w ) =(1-w2/c2) -1 /2 . Subsequently, higher-dimensional processes are analyzed and it is shown that the diffusivity tensor in a moving frame becomes nonisotropic: The diffusivities parallel and orthogonal to the velocity of the moving frame scale differently with respect to γ (w ) . The analysis of discrete space-time diffusion processes permits one to obtain a general transformation theory of the tensor diffusivity, confirmed by several different simulation experiments. Several implications of the theory are also addressed and discussed.
Measurable Stochastics for Brane Calculus
Directory of Open Access Journals (Sweden)
Giorgio Bacci
2010-10-01
Full Text Available We give a stochastic extension of the Brane Calculus, along the lines of recent work by Cardelli and Mardare. In this presentation, the semantics of a Brane process is a measure of the stochastic distribution of possible derivations. To this end, we first introduce a labelled transition system for Brane Calculus, proving its adequacy w.r.t. the usual reduction semantics. Then, brane systems are presented as Markov processes over the measurable space generated by terms up-to syntactic congruence, and where the measures are indexed by the actions of this new LTS. Finally, we provide a SOS presentation of this stochastic semantics, which is compositional and syntax-driven.
Intrinsic optimization using stochastic nanomagnets
Sutton, Brian; Camsari, Kerem Yunus; Behin-Aein, Behtash; Datta, Supriyo
2017-03-01
This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state. The basic constituents are stochastic nanomagnets which switch randomly between the ±1 Ising states and can be monitored continuously with standard electronics. Their mutual interactions can be short or long range, and their strengths can be reconfigured as needed to solve specific problems and to anneal the system at room temperature. The natural laws of statistical mechanics guide the network of stochastic nanomagnets at GHz speeds through the collective states with an emphasis on the low energy states that represent optimal solutions. As proof-of-concept, we present simulation results for standard NP-complete examples including a 16-city traveling salesman problem using experimentally benchmarked models for spin-transfer torque driven stochastic nanomagnets.
Fundamentals of stochastic nature sciences
Klyatskin, Valery I
2017-01-01
This book addresses the processes of stochastic structure formation in two-dimensional geophysical fluid dynamics based on statistical analysis of Gaussian random fields, as well as stochastic structure formation in dynamic systems with parametric excitation of positive random fields f(r,t) described by partial differential equations. Further, the book considers two examples of stochastic structure formation in dynamic systems with parametric excitation in the presence of Gaussian pumping. In dynamic systems with parametric excitation in space and time, this type of structure formation either happens – or doesn’t! However, if it occurs in space, then this almost always happens (exponentially quickly) in individual realizations with a unit probability. In the case considered, clustering of the field f(r,t) of any nature is a general feature of dynamic fields, and one may claim that structure formation is the Law of Nature for arbitrary random fields of such type. The study clarifies the conditions under wh...
Stochastic models of cell motility
DEFF Research Database (Denmark)
Gradinaru, Cristian
2012-01-01
Cell motility and migration are central to the development and maintenance of multicellular organisms, and errors during this process can lead to major diseases. Consequently, the mechanisms and phenomenology of cell motility are currently under intense study. In recent years, a new...... interdisciplinary field focusing on the study of biological processes at the nanoscale level, with a range of technological applications in medicine and biological research, has emerged. The work presented in this thesis is at the interface of cell biology, image processing, and stochastic modeling. The stochastic...... models introduced here are based on persistent random motion, which I apply to real-life studies of cell motility on flat and nanostructured surfaces. These models aim to predict the time-dependent position of cell centroids in a stochastic manner, and conversely determine directly from experimental...
Campo, M. A.; Lopez, J. J.; Rebole, J. P.
2012-04-01
This work was carried out in north of Spain. San Sebastian A meteorological station, where there are available precipitation records every ten minutes was selected. Precipitation data covers from October of 1927 to September of 1997. Pulse models describe the temporal process of rainfall as a succession of rainy cells, main storm, whose origins are distributed in time according to a Poisson process and a secondary process that generates a random number of cells of rain within each storm. Among different pulse models, the Bartlett-Lewis was used. On the other hand, alternative renewal processes and Markov chains describe the way in which the process will evolve in the future depending only on the current state. Therefore they are nor dependant on past events. Two basic processes are considered when describing the occurrence of rain: the alternation of wet and dry periods and temporal distribution of rainfall in each rain event, which determines the rainwater collected in each of the intervals that make up the rain. This allows the introduction of alternative renewal processes and Markov chains of three states, where interstorm time is given by either of the two dry states, short or long. Thus, the stochastic model of Markov chains tries to reproduce the basis of pulse models: the succession of storms, each one composed for a series of rain, separated by a short interval of time without theoretical complexity of these. In a first step, we analyzed all variables involved in the sequential process of the rain: rain event duration, event duration of non-rain, average rainfall intensity in rain events, and finally, temporal distribution of rainfall within the rain event. Additionally, for pulse Bartlett-Lewis model calibration, main descriptive statistics were calculated for each month, considering the process of seasonal rainfall in each month. In a second step, both models were calibrated. Finally, synthetic series were simulated with calibration parameters; series
Klim, Søren; Mortensen, Stig Bousgaard; Kristensen, Niels Rode; Overgaard, Rune Viig; Madsen, Henrik
2009-06-01
The extension from ordinary to stochastic differential equations (SDEs) in pharmacokinetic and pharmacodynamic (PK/PD) modelling is an emerging field and has been motivated in a number of articles [N.R. Kristensen, H. Madsen, S.H. Ingwersen, Using stochastic differential equations for PK/PD model development, J. Pharmacokinet. Pharmacodyn. 32 (February(1)) (2005) 109-141; C.W. Tornøe, R.V. Overgaard, H. Agersø, H.A. Nielsen, H. Madsen, E.N. Jonsson, Stochastic differential equations in NONMEM: implementation, application, and comparison with ordinary differential equations, Pharm. Res. 22 (August(8)) (2005) 1247-1258; R.V. Overgaard, N. Jonsson, C.W. Tornøe, H. Madsen, Non-linear mixed-effects models with stochastic differential equations: implementation of an estimation algorithm, J. Pharmacokinet. Pharmacodyn. 32 (February(1)) (2005) 85-107; U. Picchini, S. Ditlevsen, A. De Gaetano, Maximum likelihood estimation of a time-inhomogeneous stochastic differential model of glucose dynamics, Math. Med. Biol. 25 (June(2)) (2008) 141-155]. PK/PD models are traditionally based ordinary differential equations (ODEs) with an observation link that incorporates noise. This state-space formulation only allows for observation noise and not for system noise. Extending to SDEs allows for a Wiener noise component in the system equations. This additional noise component enables handling of autocorrelated residuals originating from natural variation or systematic model error. Autocorrelated residuals are often partly ignored in PK/PD modelling although violating the hypothesis for many standard statistical tests. This article presents a package for the statistical program R that is able to handle SDEs in a mixed-effects setting. The estimation method implemented is the FOCE(1) approximation to the population likelihood which is generated from the individual likelihoods that are approximated using the Extended Kalman Filter's one-step predictions.
Approximate Implicitization Using Linear Algebra
Directory of Open Access Journals (Sweden)
Oliver J. D. Barrowclough
2012-01-01
Full Text Available We consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating-point implementation in computer-aided geometric design (CAGD systems. We unify the approaches under the names of commonly known polynomial basis functions and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.
Rollout sampling approximate policy iteration
Dimitrakakis, C.; Lagoudakis, M.G.
2008-01-01
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a
-commuting maps and invariant approximations
Directory of Open Access Journals (Sweden)
Rhoades BE
2006-01-01
Full Text Available We obtain common fixed point results for generalized -nonexpansive -commuting maps. As applications, various best approximation results for this class of maps are derived in the setup of certain metrizable topological vector spaces.
Some results in Diophantine approximation
DEFF Research Database (Denmark)
Pedersen, Steffen Højris
This thesis consists of three papers in Diophantine approximation, a subbranch of number theory. Preceding these papers is an introduction to various aspects of Diophantine approximation and formal Laurent series over Fq and a summary of each of the three papers. The introduction introduces...... the basic concepts on which the papers build. Among other it introduces metric Diophantine approximation, Mahler’s approach on algebraic approximation, the Hausdorff measure, and properties of the formal Laurent series over Fq. The introduction ends with a discussion on Mahler’s problem when considered....... The first part is about a failed attempt of applying dynamical methods to obtain results and is not part of the paper. It explains the ideas of how the real case works and what goes wrong in the case of the formal Laurent series. The second part contains the results of the paper and sketches of the proofs....
Weighted approximation with varying weight
Totik, Vilmos
1994-01-01
A new construction is given for approximating a logarithmic potential by a discrete one. This yields a new approach to approximation with weighted polynomials of the form w"n"(" "= uppercase)P"n"(" "= uppercase). The new technique settles several open problems, and it leads to a simple proof for the strong asymptotics on some L p(uppercase) extremal problems on the real line with exponential weights, which, for the case p=2, are equivalent to power- type asymptotics for the leading coefficients of the corresponding orthogonal polynomials. The method is also modified toyield (in a sense) uniformly good approximation on the whole support. This allows one to deduce strong asymptotics in some L p(uppercase) extremal problems with varying weights. Applications are given, relating to fast decreasing polynomials, asymptotic behavior of orthogonal polynomials and multipoint Pade approximation. The approach is potential-theoretic, but the text is self-contained.
Shearlets and Optimally Sparse Approximations
DEFF Research Database (Denmark)
Kutyniok, Gitta; Lemvig, Jakob; Lim, Wang-Q
2012-01-01
Multivariate functions are typically governed by anisotropic features such as edges in images or shock fronts in solutions of transport-dominated equations. One major goal both for the purpose of compression as well as for an efficient analysis is the provision of optimally sparse approximations...... of such functions. Recently, cartoon-like images were introduced in 2D and 3D as a suitable model class, and approximation properties were measured by considering the decay rate of the $L^2$ error of the best $N$-term approximation. Shearlet systems are to date the only representation system, which provide...... optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction...
Upper limits on a stochastic background of gravitational waves.
Abbott, B; Abbott, R; Adhikari, R; Agresti, J; Ajith, P; Allen, B; Allen, J; Amin, R; Anderson, S B; Anderson, W G; Araya, M; Armandula, H; Ashley, M; Aulbert, C; Babak, S; Balasubramanian, R; Ballmer, S; Barish, B C; Barker, C; Barker, D; Barton, M A; Bayer, K; Belczynski, K; Betzwieser, J; Bhawal, B; Bilenko, I A; Billingsley, G; Black, E; Blackburn, K; Blackburn, L; Bland, B; Bogue, L; Bork, R; Bose, S; Brady, P R; Braginsky, V B; Brau, J E; Brown, D A; Buonanno, A; Busby, D; Butler, W E; Cadonati, L; Cagnoli, G; Camp, J B; Cannizzo, J; Cannon, K; Cardenas, L; Carter, K; Casey, M M; Charlton, P; Chatterji, S; Chen, Y; Chin, D; Christensen, N; Cokelaer, T; Colacino, C N; Coldwell, R; Cook, D; Corbitt, T; Coyne, D; Creighton, J D E; Creighton, T D; Dalrymple, J; D'Ambrosio, E; Danzmann, K; Davies, G; DeBra, D; Dergachev, V; Desai, S; DeSalvo, R; Dhurandar, S; Díaz, M; Di Credico, A; Drever, R W P; Dupuis, R J; Ehrens, P; Etzel, T; Evans, M; Evans, T; Fairhurst, S; Finn, L S; Franzen, K Y; Frey, R E; Fritschel, P; Frolov, V V; Fyffe, M; Ganezer, K S; Garofoli, J; Gholami, I; Giaime, J A; Goda, K; Goggin, L; González, G; Gray, C; Gretarsson, A M; Grimmett, D; Grote, H; Grunewald, S; Guenther, M; Gustafson, R; Hamilton, W O; Hanna, C; Hanson, J; Hardham, C; Harry, G; Heefner, J; Heng, I S; Hewitson, M; Hindman, N; Hoang, P; Hough, J; Hua, W; Ito, M; Itoh, Y; Ivanov, A; Johnson, B; Johnson, W W; Jones, D I; Jones, G; Jones, L; Kalogera, V; Katsavounidis, E; Kawabe, K; Kawamura, S; Kells, W; Khan, A; Kim, C; King, P; Klimenko, S; Koranda, S; Kozak, D; Krishnan, B; Landry, M; Lantz, B; Lazzarini, A; Lei, M; Leonor, I; Libbrecht, K; Lindquist, P; Liu, S; Lormand, M; Lubinski, M; Lück, H; Luna, M; Machenschalk, B; MacInnis, M; Mageswaran, M; Mailand, K; Malec, M; Mandic, V; Marka, S; Maros, E; Mason, K; Matone, L; Mavalvala, N; McCarthy, R; McClelland, D E; McHugh, M; McNabb, J W C; Melissinos, A; Mendell, G; Mercer, R A; Meshkov, S; Messaritaki, E; Messenger, C; Mikhailov, E; Mitra, S; Mitrofanov, V P; Mitselmakher, G; Mittleman, R; Miyakawa, O; Mohanty, S; Moreno, G; Mossavi, K; Mueller, G; Mukherjee, S; Myers, E; Myers, J; Nash, T; Nocera, F; Noel, J S; O'Reilly, B; O'Shaughnessy, R; Ottaway, D J; Overmier, H; Owen, B J; Pan, Y; Papa, M A; Parameshwaraiah, V; Parameswariah, C; Pedraza, M; Penn, S; Pitkin, M; Prix, R; Quetschke, V; Raab, F; Radkins, H; Rahkola, R; Rakhmanov, M; Rawlins, K; Ray-Majumder, S; Re, V; Regimbau, T; Reitze, D H; Riesen, R; Riles, K; Rivera, B; Robertson, D I; Robertson, N A; Robinson, C; Roddy, S; Rodriguez, A; Rollins, J; Romano, J D; Romie, J; Rowan, S; Rüdiger, A; Ruet, L; Russell, P; Ryan, K; Sandberg, V; Sanders, G H; Sannibale, V; Sarin, P; Sathyaprakash, B S; Saulson, P R; Savage, R; Sazonov, A; Schilling, R; Schofield, R; Schutz, B F; Schwinberg, P; Scott, S M; Seader, S E; Searle, A C; Sears, B; Sellers, D; Sengupta, A S; Shawhan, P; Shoemaker, D H; Sibley, A; Siemens, X; Sigg, D; Sintes, A M; Smith, J; Smith, M R; Spjeld, O; Strain, K A; Strom, D M; Stuver, A; Summerscales, T; Sung, M; Sutton, P J; Tanner, D B; Taylor, R; Thorne, K A; Thorne, K S; Tokmakov, K V; Torres, C; Torrie, C; Traylor, G; Tyler, W; Ugolini, D; Ungarelli, C; Vallisneri, M; van Putten, M; Vass, S; Vecchio, A; Veitch, J; Vorvick, C; Vyachanin, S P; Wallace, L; Ward, H; Ward, R; Watts, K; Webber, D; Weiland, U; Weinstein, A; Weiss, R; Wen, S; Wette, K; Whelan, J T; Whitcomb, S E; Whiting, B F; Wiley, S; Wilkinson, C; Willems, P A; Willke, B; Wilson, A; Winkler, W; Wise, S; Wiseman, A G; Woan, G; Woods, D; Wooley, R; Worden, J; Yakushin, I; Yamamoto, H; Yoshida, S; Zanolin, M; Zhang, L; Zotov, N; Zucker, M; Zweizig, J
2005-11-25
The Laser Interferometer Gravitational-Wave Observatory has performed a third science run with much improved sensitivities of all three interferometers. We present an analysis of approximately 200 hours of data acquired during this run, used to search for a stochastic background of gravitational radiation. We place upper bounds on the energy density stored as gravitational radiation for three different spectral power laws. For the flat spectrum, our limit of omega0 < 8.4 x 10(-4) in the 69-156 Hz band is approximately 10(5) times lower than the previous result in this frequency range.
Random migration processes between two stochastic epidemic centers.
Sazonov, Igor; Kelbert, Mark; Gravenor, Michael B
2016-04-01
We consider the epidemic dynamics in stochastic interacting population centers coupled by random migration. Both the epidemic and the migration processes are modeled by Markov chains. We derive explicit formulae for the probability distribution of the migration process, and explore the dependence of outbreak patterns on initial parameters, population sizes and coupling parameters, using analytical and numerical methods. We show the importance of considering the movement of resident and visitor individuals separately. The mean field approximation for a general migration process is derived and an approximate method that allows the computation of statistical moments for networks with highly populated centers is proposed and tested numerically. Copyright © 2016 Elsevier Inc. All rights reserved.
Hybrid deterministic/stochastic simulation of complex biochemical systems.
Lecca, Paola; Bagagiolo, Fabio; Scarpa, Marina
2017-11-21
In a biological cell, cellular functions and the genetic regulatory apparatus are implemented and controlled by complex networks of chemical reactions involving genes, proteins, and enzymes. Accurate computational models are indispensable means for understanding the mechanisms behind the evolution of a complex system, not always explored with wet lab experiments. To serve their purpose, computational models, however, should be able to describe and simulate the complexity of a biological system in many of its aspects. Moreover, it should be implemented by efficient algorithms requiring the shortest possible execution time, to avoid enlarging excessively the time elapsing between data analysis and any subsequent experiment. Besides the features of their topological structure, the complexity of biological networks also refers to their dynamics, that is often non-linear and stiff. The stiffness is due to the presence of molecular species whose abundance fluctuates by many orders of magnitude. A fully stochastic simulation of a stiff system is computationally time-expensive. On the other hand, continuous models are less costly, but they fail to capture the stochastic behaviour of small populations of molecular species. We introduce a new efficient hybrid stochastic-deterministic computational model and the software tool MoBioS (MOlecular Biology Simulator) implementing it. The mathematical model of MoBioS uses continuous differential equations to describe the deterministic reactions and a Gillespie-like algorithm to describe the stochastic ones. Unlike the majority of current hybrid methods, the MoBioS algorithm divides the reactions' set into fast reactions, moderate reactions, and slow reactions and implements a hysteresis switching between the stochastic model and the deterministic model. Fast reactions are approximated as continuous-deterministic processes and modelled by deterministic rate equations. Moderate reactions are those whose reaction waiting time is
Approximation algorithms for facility location problems with discrete subadditive cost functions
Gabor, A.F.; van Ommeren, Jan C.W.
2005-01-01
In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present two facility location problems with stochastic demand and exponential servers, respectively inventory. We present a $(1+\\epsilon,1)$- reduction of the facility location problem with subadditive costs to a soft capacitated facility location problem, which implies the existence of a $2(1+\\epsilon)$ approximation algorithm. For a special subclass of...
Stochastic geometry and its applications
Chiu, Sung Nok; Kendall, Wilfrid S; Mecke, Joseph
2013-01-01
An extensive update to a classic text Stochastic geometry and spatial statistics play a fundamental role in many modern branches of physics, materials sciences, engineering, biology and environmental sciences. They offer successful models for the description of random two- and three-dimensional micro and macro structures and statistical methods for their analysis. The previous edition of this book has served as the key reference in its field for over 18 years and is regarded as the best treatment of the subject of stochastic geometry, both as a subject with vital a
Stochastic Optimization of Complex Systems
Energy Technology Data Exchange (ETDEWEB)
Birge, John R. [University of Chicago
2014-03-20
This project focused on methodologies for the solution of stochastic optimization problems based on relaxation and penalty methods, Monte Carlo simulation, parallel processing, and inverse optimization. The main results of the project were the development of a convergent method for the solution of models that include expectation constraints as in equilibrium models, improvement of Monte Carlo convergence through the use of a new method of sample batch optimization, the development of new parallel processing methods for stochastic unit commitment models, and the development of improved methods in combination with parallel processing for incorporating automatic differentiation methods into optimization.
Stochastic methods in quantum mechanics
Gudder, Stanley P
2005-01-01
Practical developments in such fields as optical coherence, communication engineering, and laser technology have developed from the applications of stochastic methods. This introductory survey offers a broad view of some of the most useful stochastic methods and techniques in quantum physics, functional analysis, probability theory, communications, and electrical engineering. Starting with a history of quantum mechanics, it examines both the quantum logic approach and the operational approach, with explorations of random fields and quantum field theory.The text assumes a basic knowledge of fun
Algebraic and stochastic coding theory
Kythe, Dave K
2012-01-01
Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes.
Stochastic and infinite dimensional analysis
Carpio-Bernido, Maria; Grothaus, Martin; Kuna, Tobias; Oliveira, Maria; Silva, José
2016-01-01
This volume presents a collection of papers covering applications from a wide range of systems with infinitely many degrees of freedom studied using techniques from stochastic and infinite dimensional analysis, e.g. Feynman path integrals, the statistical mechanics of polymer chains, complex networks, and quantum field theory. Systems of infinitely many degrees of freedom create their particular mathematical challenges which have been addressed by different mathematical theories, namely in the theories of stochastic processes, Malliavin calculus, and especially white noise analysis. These proceedings are inspired by a conference held on the occasion of Prof. Ludwig Streit’s 75th birthday and celebrate his pioneering and ongoing work in these fields.
Probability, Statistics, and Stochastic Processes
Olofsson, Peter
2011-01-01
A mathematical and intuitive approach to probability, statistics, and stochastic processes This textbook provides a unique, balanced approach to probability, statistics, and stochastic processes. Readers gain a solid foundation in all three fields that serves as a stepping stone to more advanced investigations into each area. This text combines a rigorous, calculus-based development of theory with a more intuitive approach that appeals to readers' sense of reason and logic, an approach developed through the author's many years of classroom experience. The text begins with three chapters that d
Stochastic model in microwave propagation
Energy Technology Data Exchange (ETDEWEB)
Ranfagni, A. [“Nello Carrara” Institute of Applied Physics, CNR Florence Research Area, Via Madonna del Piano 10, 50019 Sesto Fiorentino (Italy); Mugnai, D., E-mail: d.mugnai@ifac.cnr.it [“Nello Carrara” Institute of Applied Physics, CNR Florence Research Area, Via Madonna del Piano 10, 50019 Sesto Fiorentino (Italy)
2011-11-28
Further experimental results of delay time in microwave propagation are reported in the presence of a lossy medium (wood). The measurements show that the presence of a lossy medium makes the propagation slightly superluminal. The results are interpreted on the basis of a stochastic (or path integral) model, showing how this model is able to describe each kind of physical system in which multi-path trajectories are present. -- Highlights: ► We present new experimental results on electromagnetic “anomalous” propagation. ► We apply a path integral theoretical model to wave propagation. ► Stochastic processes and multi-path trajectories in propagation are considered.
Hamiltonian theory of stochastic acceleration.
Makhnovskii, Yurii A; Pollak, Eli
2006-04-01
Stochastic acceleration, defined in terms of a stochastic equation of motion for the acceleration, is derived from a Hamiltonian model. A free particle is coupled bilinearly to a harmonic bath through the particle's momentum and coordinate. Under appropriate conditions, momentum coupling induces velocity diffusion which is not destroyed by the spatial coupling. Spatial-momentum coupling may induce spatial subdiffusion. The thermodynamic equilibrium theory presented in this paper does not violate the second law of thermodynamics, although the average velocity squared of the particle may increase in time without bound.
Stochastic geometry for image analysis
Descombes, Xavier
2013-01-01
This book develops the stochastic geometry framework for image analysis purpose. Two main frameworks are described: marked point process and random closed sets models. We derive the main issues for defining an appropriate model. The algorithms for sampling and optimizing the models as well as for estimating parameters are reviewed. Numerous applications, covering remote sensing images, biological and medical imaging, are detailed. This book provides all the necessary tools for developing an image analysis application based on modern stochastic modeling.
Recursive utility using the stochastic maximum principle
National Research Council Canada - National Science Library
Aase, Knut K
2016-01-01
.... We use the stochastic maximum principle to analyze the model. This method uses forward/backward stochastic differential equations, and works when the economy is not Markovian, which can be the case with recursive utility...
Parenting Style and Only Children's School Achievement in China.
Xie, Qing; And Others
This report describes a study which examined the relation of Chinese parenting style to only-children's academic achievement. Subjects, 186 middle-class parents of fifth and sixth graders (10-13 years old) from one Beijing elementary school, completed a Chinese translation of the Parental Authority Questionnaire (PAQ). Four approximately equal…
Stochastic switching in biology: from genotype to phenotype
Bressloff, Paul C.
2017-03-01
There has been a resurgence of interest in non-equilibrium stochastic processes in recent years, driven in part by the observation that the number of molecules (genes, mRNA, proteins) involved in gene expression are often of order 1-1000. This means that deterministic mass-action kinetics tends to break down, and one needs to take into account the discrete, stochastic nature of biochemical reactions. One of the major consequences of molecular noise is the occurrence of stochastic biological switching at both the genotypic and phenotypic levels. For example, individual gene regulatory networks can switch between graded and binary responses, exhibit translational/transcriptional bursting, and support metastability (noise-induced switching between states that are stable in the deterministic limit). If random switching persists at the phenotypic level then this can confer certain advantages to cell populations growing in a changing environment, as exemplified by bacterial persistence in response to antibiotics. Gene expression at the single-cell level can also be regulated by changes in cell density at the population level, a process known as quorum sensing. In contrast to noise-driven phenotypic switching, the switching mechanism in quorum sensing is stimulus-driven and thus noise tends to have a detrimental effect. A common approach to modeling stochastic gene expression is to assume a large but finite system and to approximate the discrete processes by continuous processes using a system-size expansion. However, there is a growing need to have some familiarity with the theory of stochastic processes that goes beyond the standard topics of chemical master equations, the system-size expansion, Langevin equations and the Fokker-Planck equation. Examples include stochastic hybrid systems (piecewise deterministic Markov processes), large deviations and the Wentzel-Kramers-Brillouin (WKB) method, adiabatic reductions, and queuing/renewal theory. The major aim of this
Millman, Daniel Raul
Computational fluid dynamics (CFD) methods have been coupled with structural solvers to provide accurate predictions of limit cycle oscillations (LCO). There is, however, a growing interest in understanding how uncertainties in flight conditions and structural parameters affect the character of an LCO response, leading to failure of an aeroelastic system. Uncertainty quantification of a stochastic system (parametric uncertainty) with stochastic inputs (initial condition uncertainty) has traditionally been analyzed with Monte Carlo simulations (MCS). Probability density functions (PDF) of the LCO response are obtained from the MCS to estimate the probability of failure. A CFD solution, however, can take days to weeks to obtain a single response, making the MCS method intractable for large problems. A candidate approach to efficiently estimate the PDF of an LCO response is the stochastic projection method. The classical stochastic projection method is a polynomial chaos expansion (PCE). The PCE approximates the response in the stochastic domain through a Fourier type expansion of the Wiener-Hermite polynomials. An LCO response can be characterized as a subcritical or supercritical bifurcation, and bifurcations are shown to be discontinuities in the stochastic domain. The PCE method, then, would be too inefficient for estimating the LCO response surface. The objective of this research is to extend the stochastic projection method to include the construction of B-spline surfaces in the stochastic domain. The multivariate B-spline problem is solved to estimate the LCO response surface. An MCS is performed on this response surface to estimate the PDF of the LCO response. The probability of failure is then computed from the PDF. The stochastic projection method via B-splines is applied to the problem of estimating the PDF of a subcritical LCO response of a nonlinear airfoil in inviscid transonic flow. The stochastic algorithm provides a conservative estimate of the
Stochastic PDEs and Infinite Horizon Backward Doubly Stochastic Differential Equations
Directory of Open Access Journals (Sweden)
Bo Zhu
2012-01-01
Full Text Available We give a sufficient condition on the coefficients of a class of infinite horizon BDSDEs, under which the infinite horizon BDSDEs have a unique solution for any given square integrable terminal values. We also show continuous dependence theorem and convergence theorem for this kind of equations. A probabilistic interpretation for solutions to a class of stochastic partial differential equations is given.
Stochastic Model Checking of the Stochastic Quality Calculus
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis; Zeng, Kebin
2015-01-01
The Quality Calculus uses quality binders for input to express strategies for continuing the computation even when the desired input has not been received. The Stochastic Quality Calculus adds generally distributed delays for output actions and real-time constraints on the quality binders for input...
5th Seminar on Stochastic Processes, Random Fields and Applications
Russo, Francesco; Dozzi, Marco
2008-01-01
This volume contains twenty-eight refereed research or review papers presented at the 5th Seminar on Stochastic Processes, Random Fields and Applications, which took place at the Centro Stefano Franscini (Monte Verità) in Ascona, Switzerland, from May 30 to June 3, 2005. The seminar focused mainly on stochastic partial differential equations, random dynamical systems, infinite-dimensional analysis, approximation problems, and financial engineering. The book will be a valuable resource for researchers in stochastic analysis and professionals interested in stochastic methods in finance. Contributors: Y. Asai, J.-P. Aubin, C. Becker, M. Benaïm, H. Bessaih, S. Biagini, S. Bonaccorsi, N. Bouleau, N. Champagnat, G. Da Prato, R. Ferrière, F. Flandoli, P. Guasoni, V.B. Hallulli, D. Khoshnevisan, T. Komorowski, R. Léandre, P. Lescot, H. Lisei, J.A. López-Mimbela, V. Mandrekar, S. Méléard, A. Millet, H. Nagai, A.D. Neate, V. Orlovius, M. Pratelli, N. Privault, O. Raimond, M. Röckner, B. Rüdiger, W.J. Runggaldi...
Application of Stochastic Partial Differential Equations to Reservoir Property Modelling
Potsepaev, R.
2010-09-06
Existing algorithms of geostatistics for stochastic modelling of reservoir parameters require a mapping (the \\'uvt-transform\\') into the parametric space and reconstruction of a stratigraphic co-ordinate system. The parametric space can be considered to represent a pre-deformed and pre-faulted depositional environment. Existing approximations of this mapping in many cases cause significant distortions to the correlation distances. In this work we propose a coordinate free approach for modelling stochastic textures through the application of stochastic partial differential equations. By avoiding the construction of a uvt-transform and stratigraphic coordinates, one can generate realizations directly in the physical space in the presence of deformations and faults. In particular the solution of the modified Helmholtz equation driven by Gaussian white noise is a zero mean Gaussian stationary random field with exponential correlation function (in 3-D). This equation can be used to generate realizations in parametric space. In order to sample in physical space we introduce a stochastic elliptic PDE with tensor coefficients, where the tensor is related to correlation anisotropy and its variation is physical space.
Stochastic Optimization for Network-Constrained Power System Scheduling Problem
Directory of Open Access Journals (Sweden)
D. F. Teshome
2015-01-01
Full Text Available The stochastic nature of demand and wind generation has a considerable effect on solving the scheduling problem of a modern power system. Network constraints such as power flow equations and transmission capacities also need to be considered for a comprehensive approach to model renewable energy integration and analyze generation system flexibility. Firstly, this paper accounts for the stochastic inputs in such a way that the uncertainties are modeled as normally distributed forecast errors. The forecast errors are then superimposed on the outputs of load and wind forecasting tools. Secondly, it efficiently models the network constraints and tests an iterative algorithm and a piecewise linear approximation for representing transmission losses in mixed integer linear programming (MILP. It also integrates load shedding according to priority factors set by the system operator. Moreover, the different interactions among stochastic programming, network constraints, and prioritized load shedding are thoroughly investigated in the paper. The stochastic model is tested on a power system adopted from Jeju Island, South Korea. Results demonstrate the impact of wind speed variability and network constraints on the flexibility of the generation system. Further analysis shows the effect of loss modeling approaches on total cost, accuracy, computational time, and memory requirement.
The Share-a-Ride problem with stochastic travel times and stochastic delivery locations
Li, Baoxiang; Krushinsky, Dmitry; Van Woensel, Tom; Reijers, Hajo A.
2016-01-01
We consider two stochastic variants of the Share-a-Ride problem: one with stochastic travel times and one with stochastic delivery locations. Both variants are formulated as a two-stage stochastic programming model with recourse. The objective is to maximize the expected profit of serving a set of
Tamellini, L.
2014-01-01
In this paper we consider a proper generalized decomposition method to solve the steady incompressible Navier-Stokes equations with random Reynolds number and forcing term. The aim of such a technique is to compute a low-cost reduced basis approximation of the full stochastic Galerkin solution of the problem at hand. A particular algorithm, inspired by the Arnoldi method for solving eigenproblems, is proposed for an efficient greedy construction of a deterministic reduced basis approximation. This algorithm decouples the computation of the deterministic and stochastic components of the solution, thus allowing reuse of preexisting deterministic Navier-Stokes solvers. It has the remarkable property of only requiring the solution of m uncoupled deterministic problems for the construction of an m-dimensional reduced basis rather than M coupled problems of the full stochastic Galerkin approximation space, with m l M (up to one order of magnitudefor the problem at hand in this work). © 2014 Society for Industrial and Applied Mathematics.
Stochastic modeling and analysis of telecoms networks
Decreusefond, Laurent
2012-01-01
This book addresses the stochastic modeling of telecommunication networks, introducing the main mathematical tools for that purpose, such as Markov processes, real and spatial point processes and stochastic recursions, and presenting a wide list of results on stability, performances and comparison of systems.The authors propose a comprehensive mathematical construction of the foundations of stochastic network theory: Markov chains, continuous time Markov chains are extensively studied using an original martingale-based approach. A complete presentation of stochastic recursions from an
Exact Algorithms for Solving Stochastic Games
DEFF Research Database (Denmark)
Hansen, Kristoffer Arnsfelt; Koucky, Michal; Lauritzen, Niels
2012-01-01
Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.......Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games....
Quantum stochastic calculus with maximal operator domains
Lindsay, J. Martin; Attal, Stéphane
2004-01-01
Quantum stochastic calculus is extended in a new formulation in which its stochastic integrals achieve their natural and maximal domains. Operator adaptedness, conditional expectations and stochastic integrals are all defined simply in terms of the orthogonal projections of the time filtration of Fock space, together with sections of the adapted gradient operator. Free from exponential vector domains, our stochastic integrals may be satisfactorily composed yielding quantum Itô formulas for op...
Extinction and quasi-stationarity in the stochastic logistic SIS model
Nåsell, Ingemar
2011-01-01
This volume presents explicit approximations of the quasi-stationary distribution and of the expected time to extinction from the state one and from quasi-stationarity for the stochastic logistic SIS model. The approximations are derived separately in three different parameter regions, and then combined into a uniform approximation across all three regions. Subsequently, the results are used to derive thresholds as functions of the population size N.
Long, John
2014-01-01
Process Modeling Style focuses on other aspects of process modeling beyond notation that are very important to practitioners. Many people who model processes focus on the specific notation used to create their drawings. While that is important, there are many other aspects to modeling, such as naming, creating identifiers, descriptions, interfaces, patterns, and creating useful process documentation. Experience author John Long focuses on those non-notational aspects of modeling, which practitioners will find invaluable. Gives solid advice for creating roles, work produ
Symmetrized solutions for nonlinear stochastic differential equations
Directory of Open Access Journals (Sweden)
G. Adomian
1981-01-01
Full Text Available Solutions of nonlinear stochastic differential equations in series form can be put into convenient symmetrized forms which are easily calculable. This paper investigates such forms for polynomial nonlinearities, i.e., equations of the form Ly+ym=x where x is a stochastic process and L is a linear stochastic operator.
A stochastic causality-based process algebra
Brinksma, Hendrik; Katoen, Joost P.; Langerak, Romanus; Latella, Diego
1995-01-01
This paper discusses stochastic extensions of a simple process algebra in a causality-based setting. Atomic actions are supposed to happen after a delay that is determined by a stochastic variable with a certain distribution. A simple stochastic type of event structures is discussed, restricting the
Symmetry Reduction For Stochastic Hybrid Systems
Bujorianu, L.M.; Katoen, Joost P.
2008-01-01
This paper is focused on adapting symmetry reduction, a technique that is highly successful in traditional model checking, to stochastic hybrid systems. To that end, we first show that performability analysis of stochastic hybrid systems can be reduced to a stochastic reachability analysis (SRA).
Symmetry reduction for stochastic hybrid systems
Bujorianu, L.M.; Katoen, Joost P.
2009-01-01
This paper is focused on adapting symmetry reduction, a technique that is highly successful in traditional model checking, to stochastic hybrid systems. We first show that performability analysis of stochastic hybrid systems can be reduced to a stochastic reachability analysis (SRA). Then, we
Approximate number sense theory or approximate theory of magnitude?
Content, Alain; Velde, Michael Vande; Adriano, Andrea
2017-01-01
Leibovich et al. argue that the evidence in favor of a perceptual mechanism devoted to the extraction of numerosity from visual collections is unsatisfactory and propose to replace it with an unspecific mechanism capturing approximate magnitudes from continuous dimensions. We argue that their representation of the evidence is incomplete and that their theoretical proposal is too vague to be useful.
Approximate entropy of network parameters
West, James; Lacasa, Lucas; Severini, Simone; Teschendorff, Andrew
2012-04-01
We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We first define a purely structural entropy obtained by computing the approximate entropy of the so-called slide sequence. This is a surrogate of the degree sequence and it is suggested by the frequency partition of a graph. We examine this quantity for standard scale-free and Erdös-Rényi networks. By using classical results of Pincus, we show that our entropy measure often converges with network size to a certain binary Shannon entropy. As a second step, with specific attention to networks generated by dynamical processes, we investigate approximate entropy of horizontal visibility graphs. Visibility graphs allow us to naturally associate with a network the notion of temporal correlations, therefore providing the measure a dynamical garment. We show that approximate entropy distinguishes visibility graphs generated by processes with different complexity. The result probes to a greater extent these networks for the study of dynamical systems. Applications to certain biological data arising in cancer genomics are finally considered in the light of both approaches.
Approximation methods in probability theory
Čekanavičius, Vydas
2016-01-01
This book presents a wide range of well-known and less common methods used for estimating the accuracy of probabilistic approximations, including the Esseen type inversion formulas, the Stein method as well as the methods of convolutions and triangle function. Emphasising the correct usage of the methods presented, each step required for the proofs is examined in detail. As a result, this textbook provides valuable tools for proving approximation theorems. While Approximation Methods in Probability Theory will appeal to everyone interested in limit theorems of probability theory, the book is particularly aimed at graduate students who have completed a standard intermediate course in probability theory. Furthermore, experienced researchers wanting to enlarge their toolkit will also find this book useful.
Diophantine approximation and Dirichlet series
Queffélec, Hervé
2013-01-01
This self-contained book will benefit beginners as well as researchers. It is devoted to Diophantine approximation, the analytic theory of Dirichlet series, and some connections between these two domains, which often occur through the Kronecker approximation theorem. Accordingly, the book is divided into seven chapters, the first three of which present tools from commutative harmonic analysis, including a sharp form of the uncertainty principle, ergodic theory and Diophantine approximation to be used in the sequel. A presentation of continued fraction expansions, including the mixing property of the Gauss map, is given. Chapters four and five present the general theory of Dirichlet series, with classes of examples connected to continued fractions, the famous Bohr point of view, and then the use of random Dirichlet series to produce non-trivial extremal examples, including sharp forms of the Bohnenblust-Hille theorem. Chapter six deals with Hardy-Dirichlet spaces, which are new and useful Banach spaces of anal...
Stochastic Volatility and DSGE Models
DEFF Research Database (Denmark)
Andreasen, Martin Møller
This paper argues that a specification of stochastic volatility commonly used to analyze the Great Moderation in DSGE models may not be appropriate, because the level of a process with this specification does not have conditional or unconditional moments. This is unfortunate because agents may...
Stochastic Modelling of Hydrologic Systems
DEFF Research Database (Denmark)
Jonsdottir, Harpa
2007-01-01
In this PhD project several stochastic modelling methods are studied and applied on various subjects in hydrology. The research was prepared at Informatics and Mathematical Modelling at the Technical University of Denmark. The thesis is divided into two parts. The first part contains an introduct......In this PhD project several stochastic modelling methods are studied and applied on various subjects in hydrology. The research was prepared at Informatics and Mathematical Modelling at the Technical University of Denmark. The thesis is divided into two parts. The first part contains...... an introduction and an overview of the papers published. Then an introduction to basic concepts in hydrology along with a description of hydrological data is given. Finally an introduction to stochastic modelling is given. The second part contains the research papers. In the research papers the stochastic methods...... are described, as at the time of publication these methods represent new contribution to hydrology. The second part also contains additional description of software used and a brief introduction to stiff systems. The system in one of the papers is stiff....
Verification of Stochastic Process Calculi
DEFF Research Database (Denmark)
Skrypnyuk, Nataliya
process calculi. The description of a system in the syntax of a particular stochastic process calculus can be analysed in a compositional way, without expanding the state space by explicitly resolving all the interdependencies between the subsystems which may lead to the state space explosion problem...
Stochastic control of traffic patterns
DEFF Research Database (Denmark)
Gaididei, Yuri B.; Gorria, Carlos; Berkemer, Rainer
2013-01-01
A stochastic modulation of the safety distance can reduce traffic jams. It is found that the effect of random modulation on congestive flow formation depends on the spatial correlation of the noise. Jam creation is suppressed for highly correlated noise. The results demonstrate the advantage...
Model checking mobile stochastic logic.
De Nicola, Rocco; Katoen, Joost P.; Latella, Diego; Loreti, Michele; Massink, Mieke
2007-01-01
The Temporal Mobile Stochastic Logic (MOSL) has been introduced in previous work by the authors for formulating properties of systems specified in STOKLAIM, a Markovian extension of KLAIM. The main purpose of MOSL is to address key functional aspects of global computing such as distribution
Stochastic vehicle routing with recourse
DEFF Research Database (Denmark)
Gørtz, Inge Li; Nagarajan, Viswanath; Saket, Rishi
2012-01-01
We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand inst...
CHARACTERISTIC RADICALS OF STOCHASTIC MATRICES,
The paper investigates the distribution on a complex plane of characteristic radicals of stochastic matrices of the n-th order. The results obtained...can be interpreted as theorems on the relative distribution of characteristic radicals of an arbitrary matrix with non-negative elements. (Author)
Stochastic Processes in Epidemic Theory
Lefèvre, Claude; Picard, Philippe
1990-01-01
This collection of papers gives a representative cross-selectional view of recent developments in the field. After a survey paper by C. Lefèvre, 17 other research papers look at stochastic modeling of epidemics, both from a theoretical and a statistical point of view. Some look more specifically at a particular disease such as AIDS, malaria, schistosomiasis and diabetes.
Stochastic modeling of soil salinity
Suweis, S.; Rinaldo, A.; Zee, van der S.E.A.T.M.; Daly, E.; Maritan, A.
2010-01-01
A minimalist stochastic model of primary soil salinity is proposed, in which the rate of soil salinization is determined by the balance between dry and wet salt deposition and the intermittent leaching events caused by rainfall events. The long term probability density functions of salt mass and
Stochastic Modelling of River Geometry
DEFF Research Database (Denmark)
Sørensen, John Dalsgaard; Schaarup-Jensen, K.
1996-01-01
Numerical hydrodynamic river models are used in a large number of applications to estimate critical events for rivers. These estimates are subject to a number of uncertainties. In this paper, the problem to evaluate these estimates using probabilistic methods is considered. Stochastic models for ...... for river geometries are formulated and a coupling between hydraulic computational methods and numerical reliability methods is presented....
Style in science communication.
Bucchi, Massimiano
2013-11-01
There is little doubt that during the past few decades science communication efforts aimed at non-expert audiences have increased in quantity and intensity on a global scale. Public engagement and outreach activities have now become a routine - when not a prominent - feature for several research institutions in Europe. However, it would be difficult for both scholars and those involved in science communication to agree on the impact of these activities, on the long-term implications of the 'science communication movement' and on the indicators we should develop and employ in order to assess impact. The paper argues that quality is a relevant issue and challenge for contemporary science communication. Style is relevant to addressing that challenge, insofar as it relates to discussions about how to strengthen the quality of science communication, suggesting a different perspective other than the traditional normative/prescriptive framework. The notion of style also fruitfully connects the debate on science communication with a rich tradition of studies in the history and sociology of science.
Bowman, G
1989-01-01
The purpose of this study was to devise a leadership style scale based in the authoritarian/democratic concept of leadership and to test it with a group of nurses. The working hypothesis was that nurses, working by primary nursing methods, would have a more democratic attitude to leadership than those nurses working in a traditional task allocation system. Recent papers such as that of Henry & Tuxill (1) plead for the caring professions to take on board the concept of the 'person'. Not only is the traditional model of nursing care seen as bad for the patient; it is seen also as harmful to the nurses. Fretwell (2) describes the task system as essentially an industrial model rather than a professional one which tends to satisfy the needs of the doctor rather than the patient or nurse. Kinston (3) describes nursing decision-making and work as Level I work (tradesmen). Current models of care that individualize the nurse's response to work and decision-making become Level II type (professional). Primary nursing fulfils the need for professionalizing nursing and meeting the need for more independence as well as respecting the patient as a 'person' with the organisation there to facilitate interaction between qualified nurse and patient. Changes in attitude and relationships are essential if work is to change from task to person-centred. Styles of leadership in nurses need to alter as our orientation to care issues change (4).(ABSTRACT TRUNCATED AT 250 WORDS)
Traduction automatique et style (Machine Translation and Style).
Loffler-Laurian, Anne-Marie
1985-01-01
Machine translation has been criticized for its inability to provide language style, but for specialized or technical texts, of which there are increasing numbers, machine translation with its obligatory post-editing may be effective, and the "style" of these translations may be a reflection of the error patterns caught in post-editing. (MSE)
A.J. Tepley; E.A. Thomann
2012-01-01
Recent increases in computation power have prompted enormous growth in the use of simulation models in ecological research. These models are valued for their ability to account for much of the ecological complexity found in field studies, but this ability usually comes at the cost of losing transparency into how the models work. In order to foster greater understanding...
The perspectives, information and conclusions conveyed in research project abstracts, progress reports, final reports, journal abstracts and journal publications convey the viewpoints of the principal investigator and may not represent the views and policies of ORD and EPA. Concl...
Best Approximation in Numerical Radius
Aksoy, Asuman Guven; Lewicki, Grzegorz
2010-01-01
Let $X$ be a reflexive Banach space. In this paper we give a necessary and sufficient condition for an operator $T\\in \\mathcal{K}(X)$ to have the best approximation in numerical radius from the convex subset $\\mathcal{U} \\subset \\mathcal{K}(X),$ where $\\mathcal{K}(X)$ denotes the set of all linear, compact operators from $X$ into $X.$ We will also present an application to minimal extensions with respect to the numerical radius. In particular some results on best approximation in norm will be...
Face Recognition using Approximate Arithmetic
DEFF Research Database (Denmark)
Marso, Karol
Face recognition is image processing technique which aims to identify human faces and found its use in various diﬀerent ﬁelds for example in security. Throughout the years this ﬁeld evolved and there are many approaches and many diﬀerent algorithms which aim to make the face recognition as eﬀective...... processing applications the results do not need to be completely precise and use of the approximate arithmetic can lead to reduction in terms of delay, space and power consumption. In this paper we examine possible use of approximate arithmetic in face recognition using Eigenfaces algorithm....
Directory of Open Access Journals (Sweden)
Hong Zhang
2017-01-01
Full Text Available In order to formulate water allocation schemes under uncertainties in the water resources management systems, an inexact multistage stochastic chance constrained programming (IMSCCP model is proposed. The model integrates stochastic chance constrained programming, multistage stochastic programming, and inexact stochastic programming within a general optimization framework to handle the uncertainties occurring in both constraints and objective. These uncertainties are expressed as probability distributions, interval with multiply distributed stochastic boundaries, dynamic features of the long-term water allocation plans, and so on. Compared with the existing inexact multistage stochastic programming, the IMSCCP can be used to assess more system risks and handle more complicated uncertainties in water resources management systems. The IMSCCP model is applied to a hypothetical case study of water resources management. In order to construct an approximate solution for the model, a hybrid algorithm, which incorporates stochastic simulation, back propagation neural network, and genetic algorithm, is proposed. The results show that the optimal value represents the maximal net system benefit achieved with a given confidence level under chance constraints, and the solutions provide optimal water allocation schemes to multiple users over a multiperiod planning horizon.
Directory of Open Access Journals (Sweden)
Zygourakis Kyriacos
2011-07-01
Full Text Available Abstract Background The lac operon genetic switch is considered as a paradigm of genetic regulation. This system has a positive feedback loop due to the LacY permease boosting its own production by the facilitated transport of inducer into the cell and the subsequent de-repression of the lac operon genes. Previously, we have investigated the effect of stochasticity in an artificial lac operon network at the single cell level by comparing corresponding deterministic and stochastic kinetic models. Results This work focuses on the dynamics of cell populations by incorporating the above kinetic scheme into two Monte Carlo (MC simulation frameworks. The first MC framework assumes stochastic reaction occurrence, accounts for stochastic DNA duplication, division and partitioning and tracks all daughter cells to obtain the statistics of the entire cell population. In order to better understand how stochastic effects shape cell population distributions, we develop a second framework that assumes deterministic reaction dynamics. By comparing the predictions of the two frameworks, we conclude that stochasticity can create or destroy bimodality, and may enhance phenotypic heterogeneity. Conclusions Our results show how various sources of stochasticity act in synergy with the positive feedback architecture, thereby shaping the behavior at the cell population level. Further, the insights obtained from the present study allow us to construct simpler and less computationally intensive models that can closely approximate the dynamics of heterogeneous cell populations.
Mengshoel, Ole J.; Wilkins, David C.; Roth, Dan
2010-01-01
For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.
Algorithmic advances in stochastic programming
Energy Technology Data Exchange (ETDEWEB)
Morton, D.P.
1993-07-01
Practical planning problems with deterministic forecasts of inherently uncertain parameters often yield unsatisfactory solutions. Stochastic programming formulations allow uncertain parameters to be modeled as random variables with known distributions, but the size of the resulting mathematical programs can be formidable. Decomposition-based algorithms take advantage of special structure and provide an attractive approach to such problems. We consider two classes of decomposition-based stochastic programming algorithms. The first type of algorithm addresses problems with a ``manageable`` number of scenarios. The second class incorporates Monte Carlo sampling within a decomposition algorithm. We develop and empirically study an enhanced Benders decomposition algorithm for solving multistage stochastic linear programs within a prespecified tolerance. The enhancements include warm start basis selection, preliminary cut generation, the multicut procedure, and decision tree traversing strategies. Computational results are presented for a collection of ``real-world`` multistage stochastic hydroelectric scheduling problems. Recently, there has been an increased focus on decomposition-based algorithms that use sampling within the optimization framework. These approaches hold much promise for solving stochastic programs with many scenarios. A critical component of such algorithms is a stopping criterion to ensure the quality of the solution. With this as motivation, we develop a stopping rule theory for algorithms in which bounds on the optimal objective function value are estimated by sampling. Rules are provided for selecting sample sizes and terminating the algorithm under which asymptotic validity of confidence interval statements for the quality of the proposed solution can be verified. Issues associated with the application of this theory to two sampling-based algorithms are considered, and preliminary empirical coverage results are presented.
STP: A Stochastic Tunneling Algorithm for Global Optimization
Energy Technology Data Exchange (ETDEWEB)
Oblow, E.M.
1999-05-20
A stochastic approach to solving continuous function global optimization problems is presented. It builds on the tunneling approach to deterministic optimization presented by Barhen et al, by combining a series of local descents with stochastic searches. The method uses a rejection-based stochastic procedure to locate new local minima descent regions and a fixed Lipschitz-like constant to reject unpromising regions in the search space, thereby increasing the efficiency of the tunneling process. The algorithm is easily implemented in low-dimensional problems and scales easily to large problems. It is less effective without further heuristics in these latter cases, however. Several improvements to the basic algorithm which make use of approximate estimates of the algorithms parameters for implementation in high-dimensional problems are also discussed. Benchmark results are presented, which show that the algorithm is competitive with the best previously reported global optimization techniques. A successful application of the approach to a large-scale seismology problem of substantial computational complexity using a low-dimensional approximation scheme is also reported.
Stochastic synchronization of neuronal populations with intrinsic and extrinsic noise.
Bressloff, Paul C
2011-05-03
We extend the theory of noise-induced phase synchronization to the case of a neural master equation describing the stochastic dynamics of an ensemble of uncoupled neuronal population oscillators with intrinsic and extrinsic noise. The master equation formulation of stochastic neurodynamics represents the state of each population by the number of currently active neurons, and the state transitions are chosen so that deterministic Wilson-Cowan rate equations are recovered in the mean-field limit. We apply phase reduction and averaging methods to a corresponding Langevin approximation of the master equation in order to determine how intrinsic noise disrupts synchronization of the population oscillators driven by a common extrinsic noise source. We illustrate our analysis by considering one of the simplest networks known to generate limit cycle oscillations at the population level, namely, a pair of mutually coupled excitatory (E) and inhibitory (I) subpopulations. We show how the combination of intrinsic independent noise and extrinsic common noise can lead to clustering of the population oscillators due to the multiplicative nature of both noise sources under the Langevin approximation. Finally, we show how a similar analysis can be carried out for another simple population model that exhibits limit cycle oscillations in the deterministic limit, namely, a recurrent excitatory network with synaptic depression; inclusion of synaptic depression into the neural master equation now generates a stochastic hybrid system.
Approximate Reanalysis in Topology Optimization
DEFF Research Database (Denmark)
Amir, Oded; Bendsøe, Martin P.; Sigmund, Ole
2009-01-01
In the nested approach to structural optimization, most of the computational effort is invested in the solution of the finite element analysis equations. In this study, the integration of an approximate reanalysis procedure into the framework of topology optimization of continuum structures...
Ultrafast Approximation for Phylogenetic Bootstrap
Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt
Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and
Approximation by Penultimate Stable Laws
L.F.M. de Haan (Laurens); L. Peng (Liang); H. Iglesias Pereira
1997-01-01
textabstractIn certain cases partial sums of i.i.d. random variables with finite variance are better approximated by a sequence of stable distributions with indices \\\\alpha_n \\\\to 2 than by a normal distribution. We discuss when this happens and how much the convergence rate can be improved by using
Approximation properties of haplotype tagging
Directory of Open Access Journals (Sweden)
Dreiseitl Stephan
2006-01-01
Full Text Available Abstract Background Single nucleotide polymorphisms (SNPs are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns, disease association studies are facilitated by identifying SNPs that allow the unique identification of such patterns. This process, known as haplotype tagging, is formulated as a combinatorial optimization problem and analyzed in terms of complexity and approximation properties. Results It is shown that the tagging problem is NP-hard but approximable within 1 + ln((n2 - n/2 for n haplotypes but not approximable within (1 - ε ln(n/2 for any ε > 0 unless NP ⊂ DTIME(nlog log n. A simple, very easily implementable algorithm that exhibits the above upper bound on solution quality is presented. This algorithm has running time O((2m - p + 1 ≤ O(m(n2 - n/2 where p ≤ min(n, m for n haplotypes of size m. As we show that the approximation bound is asymptotically tight, the algorithm presented is optimal with respect to this asymptotic bound. Conclusion The haplotype tagging problem is hard, but approachable with a fast, practical, and surprisingly simple algorithm that cannot be significantly improved upon on a single processor machine. Hence, significant improvement in computatational efforts expended can only be expected if the computational effort is distributed and done in parallel.
APPROXIMATE MODELS FOR FLOOD ROUTING
African Journals Online (AJOL)
kinematic model and a nonlinear convection-diffusion model are extracted from a normalized form of the St. Venant equations, and applied to ... normal ﬂow condition is moderate. Keywords: approximate models, nonlinear kinematic ... The concern here is with the movement of an abnormal amount of water along a river or ...
Approximation for Bayesian Ability Estimation.
1987-02-18
two-way contingency tables. Journal of Educational Statistics, 11, 33-56. Lindley, D.V. (1980). Approximate Bayesian methods. Trabajos Estadistica , 31...Sloan-Kettering Cancer Center 1275 York Avenue New York, NY 10021 Dr. Wallace Wulfeck, 11 Navy Personnel R&D Center San Diego, CA 92152-6800 Dr. Wendy