Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic simulation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

A framework for stochastic simulation of distribution practices for hotel reservations

The focus of this study is primarily on the Greek hotel industry. The objective is to design and develop a framework for stochastic simulation of reservation requests, reservation arrivals, cancellations and hotel occupancy with a planning horizon of a tourist season. In Greek hospitality industry there have been two competing policies for reservation planning process up to 2003: reservations coming directly from customers and a reservations management relying on tour operator(s). Recently the Internet along with other emerging technologies has offered the potential to disrupt enduring distribution arrangements. The focus of the study is on the choice of distribution intermediaries. We present an empirical model for the hotel reservation planning process that makes use of a symbolic simulation, Monte Carlo method, as, requests for reservations, cancellations, and arrival rates are all sources of uncertainty. We consider as a case study the problem of determining the optimal booking strategy for a medium size hotel in Skiathos Island, Greece. Probability distributions and parameters estimation result from the historical data available and by following suggestions made in the relevant literature. The results of this study may assist hotel managers define distribution strategies for hotel rooms and evaluate the performance of the reservations management system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic Simulation Service: Bridging the Gap between the Computational Expert and the Biologist

We present StochSS: Stochastic Simulation as a Service, an integrated development environment for modeling and simulation of both deterministic and discrete stochastic biochemical systems in up to three dimensions. An easy to use graphical user interface enables researchers to quickly develop and simulate a biological model on a desktop or laptop, which can then be expanded to incorporate increasing levels of complexity. StochSS features state-of-the-art simulation engines. As the demand for computational power increases, StochSS can seamlessly scale computing resources in the cloud. In addition, StochSS can be deployed as a multi-user software environment where collaborators share computational resources and exchange models via a public model repository. We also demonstrate the capabilities and ease of use of StochSS with an example of model development and simulation at increasing levels of complexity.

59 BASIC BIOLOGICAL SCIENCES↗

Exploring the performance of spatial stochastic simulation algorithms

Since the publication of Gillespie's direct method, diverse methods have been developed to improve the performance of stochastic simulation methods and to enter the spatial realm. In this paper we discuss a spatial {tau}-leaping variant (S{tau}) that extends the basic leap method. S{tau} takes reaction and both outgoing and incoming diffusion events into account when calculating a leap candidate. A performance analysis shall reveal details on the achieved success in balancing speed and accuracy in comparison to other methods. However, performance analysis of spatial stochastic algorithms requires significant effort - it is crucial to choose suitable (benchmark) models and to carefully define model and simulation setups that take problem and simulation design spaces into account.

97 MATHEMATICS AND COMPUTING↗

Lazy Updating of hubs can enable more realistic models by speeding up stochastic simulations

To respect the nature of discrete parts in a system, stochastic simulation algorithms (SSAs) must update for each action (i) all part counts and (ii) each action's probability of occurring next and its timing. This makes it expensive to simulate biological networks with well-connected “hubs” such as ATP that affect many actions. Temperature and volume also affect many actions and may be changed significantly in small steps by the network itself during fever and cell growth, respectively. Such trends matter for evolutionary questions, as cell volume determines doubling times and fever may affect survival, both key traits for biological evolution. Yet simulations often ignore such trends and assume constant environments to avoid many costly probability updates. Such computational convenience precludes analyses of important aspects of evolution. Here we present “Lazy Updating,” an add-on for SSAs designed to reduce the cost of simulating hubs. When a hub changes, Lazy Updating postpones all probability updates for reactions depending on this hub, until a threshold is crossed. Speedup is substantial if most computing time is spent on such updates. We implemented Lazy Updating for the Sorting Direct Method and it is easily integrated into other SSAs such as Gillespie's Direct Method or the Next Reaction Method. Testing on several toy models and a cellular metabolism model showed >10× faster simulations for its use-cases—with a small loss of accuracy. Thus we see Lazy Updating as a valuable tool for some special but important simulation problems that are difficult to address efficiently otherwise.

97 MATHEMATICS AND COMPUTING↗

Number-phase Wigner representation for efficient stochastic simulations

Phase-space representations based on coherent states (P,Q, Wigner) have been successful in the creation of stochastic differential equations (SDEs) for the efficient stochastic simulation of high-dimensional quantum systems. However, many problems using these techniques remain intractable over long integration times. We present a number-phase Wigner representation that can be unraveled into SDEs. We demonstrate convergence to the correct solution for an anharmonic oscillator with small dampening for significantly longer than other phase-space representations. This process requires an effective sampling of a nonclassical probability distribution. We describe and demonstrate a method of achieving this sampling using stochastic weights.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nowcasting Earthquakes With Stochastic Simulations: Information Entropy of Earthquake Catalogs

Earthquake nowcasting has been proposed as a means of tracking the change in large earthquake potential in a seismically active area. The method was developed using observable seismic data, in which probabilities of future large earthquakes can be computed using Receiver Operating Characteristic methods. Furthermore, analysis of the Shannon information content of the earthquake catalogs has been used to show that there is information contained in the catalogs, and that it can vary in time. So an important question remains, where does the information originate? In this paper, we examine this question using stochastic simulations of earthquake catalogs. Our catalog simulations are computed using an Earthquake Rescaled Aftershock Seismicity (“ERAS”) stochastic model. This model is similar in many ways to other stochastic seismicity simulations, but has the advantage that the model has only 2 free parameters to be set, one for the aftershock (Omori-Utsu) time decay, and one for the aftershock spatial migration away from the epicenter. Generating a simulation catalog and fitting the two parameters to the observed catalog such as California takes only a few minutes of wall clock time. While clustering can arise from random, Poisson statistics, we show that significant information in the simulation catalogs arises from the “non-Poisson” power-law aftershock clustering, implying that the practice of de-clustering observed catalogs may remove information that would otherwise be useful in forecasting and nowcasting. We also show that the nowcasting method provides similar results with the ERAS model as it does with observed seismicity.

58 GEOSCIENCES↗

ANN-based ground motion model for Turkey using stochastic simulation of earthquakes

SUMMARY Turkey is characterized by a high level of seismic activity attributed to its complex tectonic structure. The country has a dense network to record earthquake ground motions; however, to study previous earthquakes and to account for potential future ones, ground motion simulations are required. Ground motion simulation techniques offer an alternative means of generating region-specific time-series data for locations with limited seismic networks or regions with seismic data gaps, facilitating the study of potential catastrophic earthquakes. In this research, a local ground motion model (GMM) for Turkey is developed using region-specific simulated records, thus constructing a homogeneous data set. The simulations employ the stochastic finite-fault approach and utilize validated input-model parameters in distinct regions, namely Afyon, Erzincan, Duzce, Istanbul and Van. To overcome the limitations of linear regression-based models, artificial neural network is used to establish the form of equations and coefficients. The predictive input parameters encompass fault mechanism (FM), focal depth (FD), moment magnitude (Mw), Joyner and Boore distance (RJB) and average shear wave velocity in the top 30 m (Vs30). The data set comprises 7359 records with Mw ranging between 5.0 and 7.5 and RJB ranging from 0 to 272 km. The results are presented in terms of spectral ordinates within the period range of 0.03–2.0 s, as well as peak ground acceleration and peak ground velocity. The quantification of the GMM uncertainty is achieved through the analysis of residuals, enabling insights into inter- and intra-event uncertainties. The simulation results and the effectiveness of the model are verified by comparing the predicted values of ground motion parameters with the observed values recorded during previous events in the region. The results demonstrate the efficacy of the proposed model in simulating physical phenomena.

Karimzadeh, Shaghayegh (ORCID:0000000337531676)↗

A Framework to Analyze the Performance of Load Balancing Schemes for Ensembles of Stochastic Simulations

Ensembles of simulations are employed to estimate the statistics of possible future states of a system, and are widely used in important applications such as climate change and biological modeling. Ensembles of runs can naturally be executed in parallel. However, when the CPU times of individual simulations vary considerably, a simple strategy of assigning an equal number of tasks per processor can lead to serious work imbalances and low parallel efficiency. This paper presents a new probabilistic framework to analyze the performance of dynamic load balancing algorithms for ensembles of simulations where many tasks are mapped onto each processor, and where the individual compute times vary considerably among tasks. Four load balancing strategies are discussed: most-dividing, all-redistribution, random-polling, and neighbor-redistribution. Simulation results with a stochastic budding yeast cell cycle model are consistent with the theoretical analysis. It is especially significant that there is a provable global decrease in load imbalance for the local rebalancing algorithms due to scalability concerns for the global rebalancing algorithms. The overall simulation time is reduced by up to 25 %, and the total processor idle time by 85 %.

ALGORITHMS↗

Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales

The focus of the project is the development of mathematical methods and high-performance computational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly efficient and scalable numerical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.

97 MATHEMATICS AND COMPUTING↗

Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales

The focus of the project is the development of mathematical methods and high-performance com- putational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly e cient and scalable numer- ical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.

97 MATHEMATICS AND COMPUTING↗

Constant-complexity stochastic simulation algorithm with optimal binning

At the molecular level, biochemical processes are governed by random interactions between reactant molecules, and the dynamics of such systems are inherently stochastic. When the copy numbers of reactants are large, a deterministic description is adequate, but when they are small, such systems are often modeled as continuous-time Markov jump processes that can be described by the chemical master equation. Gillespie’s Stochastic Simulation Algorithm (SSA) generates exact trajectories of these systems, but the amount of computational work required for each step of the original SSA is proportional to the number of reaction channels, leading to computational complexity that scales linearly with the problem size. The original SSA is therefore inefficient for large problems, which has prompted the development of several alternative formulations with improved scaling properties. We describe an exact SSA that uses a table data structure with event time binning to achieve constant computational complexity with respect to the number of reaction channels for weakly coupled reaction networks. We present a novel adaptive binning strategy and discuss optimal algorithm parameters. We compare the computational efficiency of the algorithm to existing methods and demonstrate excellent scaling for large problems. This method is well suited for generating exact trajectories of large weakly coupled models, including those that can be described by the reaction-diffusion master equation that arises from spatially discretized reaction-diffusion processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Stochastic simulations of temporally and spatially variable Fe cycling within a floodplain aquifer

This data package contains model input and output files for local and global sensitivity analysis (SA) of a reactive transport model simulating redox cycling within a floodplain aquifer. The reaction network is implemented in CrunchFlow and focuses on spatially and temporally heterogeneous Fe cycling, though it contains several other species and redox pathways (37 aqueous species and 7 minerals in total). The package contains data from 600 Monte Carlo simulations (for global SA) and 104 one-at-a-time simulations (for local SA). It includes all input files required to run the CrunchFlow model, as well as limited model output – .csv files containing time series of primary species concentrations at 21 grid cells within the domain. These time series files contain the following species: H+, CO32-, SO42-, Cl-, Ca2+, Mg2+, Na+, K+, Fe(II), Fe(III), HS-, CH3COO-, O2(aq), S(aq), and Br-.These data were used to demonstrate the application of a novel form of global SA, distance-based generalized sensitivity analysis (DGSA) to a reactive transport model. The 2D model simulates the export of reduced species from pockets of fine-grained, organic-rich sediments embedded in a coarse sand aquifer. Stochastic simulations jointly varied 17 key model input parameters across several orders of magnitude, including the spatial variability of each parameter. DGSA on the model results reveal that the amplitude and variability of exported Fe(II) are most sensitive to the interaction between sand permeability and individual reaction rates. By contrast, the propagation of reducing conditions downgradient from the fine-grained lenses depends most heavily on the rate of dissolved organic carbon and sulfate release from the fines.

54 ENVIRONMENTAL SCIENCES↗

Simulated Stochastic Approximation Annealing for Global Optimization with a Square-Root Cooling Schedule

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 have such a long CPU time. This paper 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 Markov chain Monte Carlo, 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, e.g., 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.

Liang, Faming↗

Global sensitivity analysis in stochastic simulators of uncertain reaction networks

Stochastic models of chemical systems are often subjected to uncertainties in kinetic parameters in addition to the inherent random nature of their dynamics. Uncertainty quantification in such systems is generally achieved by means of sensitivity analyses in which one characterizes the variability with the uncertain kinetic parameters of the first statistical moments of model predictions. In this work, we propose an original global sensitivity analysis method where the parametric and inherent variability sources are both treated through Sobol’s decomposition of the variance into contributions from arbitrary subset of uncertain parameters and stochastic reaction channels. The conceptual development only assumes that the inherent and parametric sources are independent, and considers the Poisson processes in the random-time-change representation of the state dynamics as the fundamental objects governing the inherent stochasticity. Here, a sampling algorithm is proposed to perform the global sensitivity analysis, and to estimate the partial variances and sensitivity indices characterizing the importance of the various sources of variability and their interactions. The birth-death and Schlögl models are used to illustrate both the implementation of the algorithm and the richness of the proposed analysis method. The output of the proposed sensitivity analysis is also contrasted with a local derivative-based sensitivity analysis method classically used for this type of systems.

97 MATHEMATICS AND COMPUTING↗

Solving complex maintenance planning optimization problems using stochastic simulation and multi-criteria fuzzy decision making

One of the most important factors in the operations of many cooperations today is to maximize profit and one important tool to that effect is the optimization of maintenance activities. Maintenance activities is at the largest level divided into two major areas, corrective maintenance (CM) and preventive maintenance (PM). When optimizing maintenance activities, by a maintenance plan or policy, we seek to find the best activities to perform at each point in time, be it PM or CM. We explore the use of stochastic simulation, genetic algorithms and other tools for solving complex maintenance planning optimization problems in terms of a suggested framework model based on discrete event simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mesh objective stochastic simulations of quasibrittle fracture

Continuum finite element (FE) modeling of damage and failure of quasibrittle structures suffers from the spurious mesh sensitivity due to strain localization. Here this issue has been addressed for deterministic analysis through the development of localization limiters. Here this study proposes a mechanism-based model to mitigate the mesh sensitivity in stochastic FE simulations of quasibrittle fracture. The interest is placed on the analysis of large-size structures, where the mesh size is conveniently chosen to be larger than the width of the fracture process zone as well as the correlation length of the random fields of constitutive properties. The present model is formulated within the framework of continuum damage mechanics. Two localization parameters are introduced to describe the evolution of the damage pattern of each finite element. These parameters are used to guide the energy regularization of the constitutive law, as well as to formulate the mesh-dependent probability distributions of constitutive properties. Depending on the prevailing damage pattern, different energy regularization schemes and mesh dependence of the probability distribution functions are used in the constitutive law. The model is applied to simulate the stochastic failure behavior of quasibrittle structures of different geometries featuring different failure processes including damage initiation, localization, and propagation. It is shown that using fixed probability distribution functions of constitutive properties could lead to strong mesh dependence of the prediction of the mean and variance of the structural load capacity. The probability distribution functions of constitutive properties must be linked to the damage pattern, which may evolve during the failure process. Such a mechanism-based modeling of the probability distributions of constitutive properties is essential for mitigating the spurious mesh sensitivity in stochastic FE analysis of quasibrittle fracture.

42 ENGINEERING↗

Rejection-free stochastic simulation of BNGL-encoded models

Formal rules encoded using the BioNetGen language (BNGL) can be used to represent the system-level dynamics of molecular interactions. Rules allow one to compactly and implicitly specify the reaction network implied by a set of molecules and their interactions. Typically, the reaction network implied by a set of rules is large, which makes generation of the underlying rule-defined network expensive. Moreover, the cost of conventional simulation methods typically depends on network size. Together these factors have limited application of the rule-based modeling approach. To overcome this limitation, several methods have recently been developed for determining the reaction dynamics implied by rules while avoiding the expensive step of network generation. The cost of these 'network-free' simulation methods is independent of the number of reactions implied by rules. Software implementing such methods is needed for the analysis of rule-based models of biochemical systems. Here, we present a software tool called RuleMonkey that implements a network-free stochastic simulation method for rule-based models. The method is rejection free, unlike other network-free methods that introduce null events (i.e., steps in the simulation procedure that do not change the state of the reaction system being simulated), and the software is capable of simulating models encoded in BNGL, a general-purpose model-specification language. We verify that RuleMonkey produces correct simulation results, and we compare its performance against DYNSTOC, another BNGL-compliant general-purpose simulator for rule-based models, as well as various problem-specific codes that implement network-free simulation methods. RuleMonkey enables the simulation of models defined by rule sets that imply large-scale reaction networks. It is faster than DYNSTOC for stiff problems, although it requires the use of more computer memory. RuleMonkey is freely available for non-commercial use as a stand-alone application (http://public.tgen.org/rulemonkey).

59 BASIC BIOLOGICAL SCIENCES↗