Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Markov process”

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 1,045 records · Page 58

Parallel multiple-chain DRAM MCMC for large-scale geosteering inversion and uncertainty quantification

Geosteering is the proactive control of a wellbore placement based on the downhole measurements, aiming at maximizing economic production from the well. We report the recent development of azimuthal resistivity logging-whiledrilling (LWD) tools have a much larger depth of detection, thus sets higher demands for geosteering inversion as more unknown parameters need to be taken into account in the earth model to be inverted. For complicated nonlinear problems, traditional deterministic inversion methods are more likely to be trapped near local optima. In general, Markov chain Monte Carlo (MCMC) inversion methods are more capable of finding the global optimal solution and providing additional uncertainty analyses by sampling from the target distribution. However, MCMC methods usually have the problem of slow convergence. Even though optimization methods like delayed rejection (DR) and adaptive Metropolis (AM) were proposed to speed up the convergence, using MCMC methods to solve geosteering inversion problems may still incur unacceptable time cost. To reduce the sampling cost of MCMC methods, we use parallel multiple-chain DRAM MCMC methods to solve geosteering inverse problems and estimate the corresponding uncertainty. A clustering method, density-based spatial clustering of applications with noise (DBSCAN), is applied to select the best solution among many results. Lastly, the simulation results show that running many relatively short MCMC chains for one problem can obtain a similar result as running a long single chain. Besides, avoiding communications between multiple Markov chains during the sampling process yields almost linear scalability.

97 MATHEMATICS AND COMPUTING↗

A quantum algorithm to efficiently sample from interfering binary trees

Quantum computers provide an opportunity to efficiently sample from probability distributions that include non-trivial interference effects between amplitudes. Using a simple process wherein all possible state histories can be specified by a binary tree, we construct an explicit quantum algorithm that runs in polynomial time to sample from the process once. The corresponding naive Markov Chain algorithm does not produce the correct probability distribution and an explicit classical calculation of the full distribution requires exponentially many operations. Finally, the problem can be reduced to a system of two qubits with repeated measurements, shedding light on a quantum-inspired efficient classical algorithm.

97 MATHEMATICS AND COMPUTING↗

Stochastic Adaptive Droop Control in Frequency Regulation of Power Systems With Intermittent Generators

Modern power systems (MPSs), including microgrids (MGs), are increasingly incorporating multiple renewable energy sources (RESs) such as wind and solar power, as well as battery storage and controllable loads. While environmentally beneficial, these sources pose challenges for control and management due to their intermittent and stochastic nature, especially in maintaining frequency stability with multiple interconnected generators of varying capacities. Traditional droop control methods are effective in systems with generators that are dispatchable and have fixed generation capacities, but they fall short when applied to systems with RESs, where generation capacities are dynamic and affected by unpredictable environmental conditions. To address these challenges, this paper introduces a novel stochastic adaptive droop control (SADC) method for load frequency control (LFC). The proposed method adapts droop coefficients in real time, based on the measured stochastic data of power generation capacities, enabling more effective frequency regulation in systems with variable and intermittent power generation. Unlike traditional adaptive control methods, which assume constant or slowly-varying system parameters, this approach accounts for stochastic processes by modeling them as Markov chains, enabling robust performance under highly dynamic and unpredictable conditions. The key contributions of this work include the development of real-time droop coefficient adaptation algorithms, derivation of their stability and convergence properties, and the demonstration of the advantages of the method through simulations. Case studies highlight the improved performance of frequency regulation, particularly in addressing the impact of stochastic weather conditions and the benefits of reducing dependence on battery reserves in dealing with intermittency of RESs. Finally, this paper provides a comprehensive analysis of the theoretical foundations of the method, as well as practical implementation insights for future power systems with high penetration of RESs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Reconstructing probability distributions with Gaussian processes

Modern cosmological analyses constrain physical parameters using Markov Chain Monte Carlo (MCMC) or similar sampling techniques. Oftentimes, these techniques are computationally expensive to run and require up to thousands of CPU hours to complete. Here we present a method for reconstructing the log-probability distributions of completed experiments from an existing chain (or any set of posterior samples). Here, the reconstruction is performed using Gaussian process regression for interpolating the log-probability. This allows for easy resampling, importance sampling, marginalization, testing different samplers, investigating chain convergence, and other operations. As an example use case, we reconstruct the posterior distribution of the most recent Planck 2018 analysis. We then resample the posterior, and generate a new chain with 40 times as many points in only 30 min. Our likelihood reconstruction tool is made publicly available online.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A graphical language for reliability model generation

A graphical interface capability of the hybrid automated reliability predictor (HARP) is described. The graphics-oriented (GO) module provides the user with a graphical language for modeling system failure modes through the selection of various fault tree gates, including sequence dependency gates, or by a Markov chain. With this graphical input language, a fault tree becomes a convenient notation for describing a system. In accounting for any sequence dependencies, HARP converts the fault-tree notation to a complex stochastic process that is reduced to a Markov chain which it can then solve for system reliability. The graphics capability is available for use on an IBM-compatible PC, a Sun, and a VAX workstation. The GO module is written in the C programming language and uses the Graphical Kernel System (GKS) standard for graphics implementation. The PC, VAX, and Sun versions of the HARP GO module are currently in beta-testing.

Howell, Sandra V.↗

Graphical workstation capability for reliability modeling

In addition to computational capabilities, software tools for estimating the reliability of fault-tolerant digital computer systems must also provide a means of interfacing with the user. Described here is the new graphical interface capability of the hybrid automated reliability predictor (HARP), a software package that implements advanced reliability modeling techniques. The graphics oriented (GO) module provides the user with a graphical language for modeling system failure modes through the selection of various fault-tree gates, including sequence-dependency gates, or by a Markov chain. By using this graphical input language, a fault tree becomes a convenient notation for describing a system. In accounting for any sequence dependencies, HARP converts the fault-tree notation to a complex stochastic process that is reduced to a Markov chain, which it can then solve for system reliability. The graphics capability is available for use on an IBM-compatible PC, a Sun, and a VAX workstation. The GO module is written in the C programming language and uses the graphical kernal system (GKS) standard for graphics implementation. The PC, VAX, and Sun versions of the HARP GO module are currently in beta-testing stages.

Bavuso, Salvatore J.↗

SU-E-J-130: Automating Liver Segmentation Via Combined Global and Local Optimization

Purpose: The aim of this work is to develop a robust algorithm for accurate segmentation of liver with special attention paid to the problems with fuzzy edges and tumor. Methods: 200 CT images were collected from radiotherapy treatment planning system. 150 datasets are selected as the panel data for shape dictionary and parameters estimation. The remaining 50 datasets were used as test images. In our study liver segmentation was formulated as optimization process of implicit function. The liver region was optimized via local and global optimization during iterations. Our method consists five steps: 1)The livers from the panel data were segmented manually by physicians, and then We estimated the parameters of GMM (Gaussian mixture model) and MRF (Markov random field). Shape dictionary was built by utilizing the 3D liver shapes. 2)The outlines of chest and abdomen were located according to rib structure in the input images, and the liver region was initialized based on GMM. 3)The liver shape for each 2D slice was adjusted using MRF within the neighborhood of liver edge for local optimization. 4)The 3D liver shape was corrected by employing SSR (sparse shape representation) based on liver shape dictionary for global optimization. Furthermore, H-PSO(Hybrid Particle Swarm Optimization) was employed to solve the SSR equation. 5)The corrected 3D liver was divided into 2D slices as input data of the third step. The iteration was repeated within the local optimization and global optimization until it satisfied the suspension conditions (maximum iterations and changing rate). Results: The experiments indicated that our method performed well even for the CT images with fuzzy edge and tumors. Comparing with physician delineated results, the segmentation accuracy with the 50 test datasets (VOE, volume overlap percentage) was on average 91%–95%. Conclusion: The proposed automatic segmentation method provides a sensible technique for segmentation of CT images. This work is supported by NIH/NIBIB (1R01-EB016777), National Natural Science Foundation of China (No.61471226 and No.61201441), Research funding from Shandong Province (No.BS2012DX038 and No.J12LN23), and Research funding from Jinan City (No.201401221 and No.20120109)

60 APPLIED LIFE SCIENCES↗

Optimization of energy window for {sup 90}Y bremsstrahlung SPECT imaging for detection tasks using the ideal observer with model-mismatch

Purpose: In yttrium-90 ({sup 90}Y) microsphere brachytherapy (radioembolization) of unresectable liver cancer, posttherapy {sup 90}Y bremsstrahlung single photon emission computed tomography (SPECT) has been used to document the distribution of microspheres in the patient and to help predict potential side effects. The energy window used during projection acquisition can have a significant effect on image quality. Thus, using an optimal energy window is desirable. However, there has been great variability in the choice of energy window due to the continuous and broad energy distribution of {sup 90}Y bremsstrahlung photons. The area under the receiver operating characteristic curve (AUC) for the ideal observer (IO) is a widely used figure of merit (FOM) for optimizing the imaging system for detection tasks. The IO implicitly assumes a perfect model of the image formation process. However, for {sup 90}Y bremsstrahlung SPECT there can be substantial model-mismatch (i.e., difference between the actual image formation process and the model of it assumed in reconstruction), and the amount of the model-mismatch depends on the energy window. It is thus important to account for the degradation of the observer performance due to model-mismatch in the optimization of the energy window. The purpose of this paper is to optimize the energy window for {sup 90}Y bremsstrahlung SPECT for a detection task while taking into account the effects of the model-mismatch. Methods: An observer, termed the ideal observer with model-mismatch (IO-MM), has been proposed previously to account for the effects of the model-mismatch on IO performance. In this work, the AUC for the IO-MM was used as the FOM for the optimization. To provide a clinically realistic object model and imaging simulation, the authors used a background-known-statistically and signal-known-statistically task. The background was modeled as multiple compartments in the liver with activity parameters independently following a Gaussian distribution; the signal was modeled as a tumor with a Gaussian-distributed activity parameter located randomly with equal probability at one of three positions. The IO test statistics (i.e., likelihood ratios) were estimated using Markov-chain Monte Carlo methods. The authors realistically modeled human anatomy using a digital phantom code, and realistically simulated {sup 90}Y bremsstrahlung SPECT imaging with a clinical SPECT system and typical imaging parameters using a previously validated Monte Carlo bremsstrahlung simulation method. Model-mismatch was included by modeling image formation process in the calculation of IO test statistics using an analytic modeling method previously developed for quantitative {sup 90}Y bremsstrahlung SPECT. To demonstrate the effects of the model-mismatch on the detection task, the authors optimized the energy window both with and without model-mismatch included in the IO. Results: For all the energy windows, the AUC values for the IO-MM were smaller than that for the IO. The optimal windows for the IO-MM and the IO were 80-180 and 60-400 keV, respectively. Conclusions: The authors have demonstrated the degradation of the ideal performance due to model-mismatch and optimized the energy window for {sup 90}Y bremsstrahlung SPECT for detection tasks by accounting for the effects of the model-mismatch. The obtained optimal window was much narrower when taking into account the model-mismatch and similar to that obtained previously for estimation tasks.

61 RADIATION PROTECTION AND DOSIMETRY↗

Dynamic neutron scattering from conformational dynamics. I. Theory and Markov models

The dynamics of complex molecules can be directly probed by inelastic neutron scattering experiments. However, many of the underlying dynamical processes may exist on similar timescales, which makes it difficult to assign processes seen experimentally to specific structural rearrangements. Here, we show how Markov models can be used to connect structural changes observed in molecular dynamics simulation directly to the relaxation processes probed by scattering experiments. For this, a conformational dynamics theory of dynamical neutron and X-ray scattering is developed, following our previous approach for computing dynamical fingerprints of time-correlation functions [F. No , S. Doose, I. Daidone, M. L llmann, J. Chodera, M. Sauer, and J. Smith, Proc. Natl. Acad. Sci. U.S.A.108, 4822 (2011)]. Markov modeling is used to approximate the relaxation processes and timescales of the molecule via the eigenvectors and eigenvalues of a transition matrix between conformational substates. Furthermore, this procedure allows the establishment of a complete set of exponential decay functions and a full decomposition into the individual contributions, i.e., the contribution of every atom and dynamical process to each experimental relaxation process.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Theoretical study on optical response in nanostructures in the Born–Markov regime: The role of spontaneous emission and dephasing

We theoretically study the linear and nonlinear optical susceptibility in a nanostructure that interacts with a classical monochromatic optical field, by means of the solution of a Born–Markov master equation in the Lindblad form, considering as environment for the system the quantum vacuum of the continuum of modes of the external electromagnetic field. The processes of spontaneous emission and dephasing between two levels of the nanostructured quantum system are studied formally, within the framework of the quantum theory of open systems. It was found that the phenomenological master equation corresponds to a Born–Markov master equation in the Lindblad form that considers only the dissipative terms of spontaneous emission and dephasing, provided that the transverse coherence time T{sub 2} is smaller than spontaneous emission time T{sub 1}. Finally, comparative results are presented between the proposed methodology and the conventional method for: optical rectification, optical absorption, generation of second harmonic and generation of third harmonic in a cylindrical quantum dot (CQD) of AsGa∕AsGaAl with a hydrogen-like impurity inside it and under the action of a uniform magnetic field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms

We present a mathematical framework for constructing and analyzing parallel algorithms for lattice kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in spatially distributed, non-equilibrium physiochemical processes with complex chemistry and transport micro-mechanisms. Rather than focusing on constructing exactly the stochastic trajectories, our approach relies on approximating the evolution of observables, such as density, coverage, correlations and so on. More specifically, we develop a spatial domain decomposition of the Markov operator (generator) that describes the evolution of all observables according to the kinetic Monte Carlo algorithm. This domain decomposition corresponds to a decomposition of the Markov generator into a hierarchy of operators and can be tailored to specific hierarchical parallel architectures such as multi-core processors or clusters of Graphical Processing Units (GPUs). Based on this operator decomposition, we formulate parallel Fractional step kinetic Monte Carlo algorithms by employing the Trotter Theorem and its randomized variants; these schemes, (a) are partially asynchronous on each fractional step time-window, and (b) are characterized by their communication schedule between processors. The proposed mathematical framework allows us to rigorously justify the numerical and statistical consistency of the proposed algorithms, showing the convergence of our approximating schemes to the original serial KMC. The approach also provides a systematic evaluation of different processor communicating schedules. We carry out a detailed benchmarking of the parallel KMC schemes using available exact solutions, for example, in Ising-type systems and we demonstrate the capabilities of the method to simulate complex spatially distributed reactions at very large scales on GPUs. Finally, we discuss work load balancing between processors and propose a re-balancing scheme based on probabilistic mass transport methods.

97 MATHEMATICS AND COMPUTING↗

Derivation of a Markov state model of the dynamics of a protein-like chain immersed in an implicit solvent

A Markov state model of the dynamics of a protein-like chain immersed in an implicit hard sphere solvent is derived from first principles for a system of monomers that interact via discontinuous potentials designed to account for local structure and bonding in a coarse-grained sense. The model is based on the assumption that the implicit solvent interacts on a fast time scale with the monomers of the chain compared to the time scale for structural rearrangements of the chain and provides sufficient friction so that the motion of monomers is governed by the Smoluchowski equation. A microscopic theory for the dynamics of the system is developed that reduces to a Markovian model of the kinetics under well-defined conditions. Microscopic expressions for the rate constants that appear in the Markov state model are analyzed and expressed in terms of a temperature-dependent linear combination of escape rates that themselves are independent of temperature. Excellent agreement is demonstrated between the theoretical predictions of the escape rates and those obtained through simulation of a stochastic model of the dynamics of bond formation. Finally, the Markov model is studied by analyzing the eigenvalues and eigenvectors of the matrix of transition rates, and the equilibration process for a simple helix-forming system from an ensemble of initially extended configurations to mainly folded configurations is investigated as a function of temperature for a number of different chain lengths. For short chains, the relaxation is primarily single-exponential and becomes independent of temperature in the low-temperature regime. The profile is more complicated for longer chains, where multi-exponential relaxation behavior is seen at intermediate temperatures followed by a low temperature regime in which the folding becomes rapid and single exponential. It is demonstrated that the behavior of the equilibration profile as the temperature is lowered can be understood in terms of the number of relaxation modes or “folding pathways” that contribute to the evolution of the state populations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum dynamics of a vibronically coupled linear chain using a surrogate Hamiltonian approach

Vibronic coupling between the electronic and vibrational degrees of freedom has been reported to play an important role in charge and exciton transport in organic photovoltaic materials, molecular aggregates, and light-harvesting complexes. Explicitly accounting for effective vibrational modes rather than treating them as a thermal environment has been shown to be crucial to describe the effect of vibronic coupling. We present a methodology to study dissipative quantum dynamics of vibronically coupled systems based on a surrogate Hamiltonian approach, which is in principle not limited by Markov approximation or weak system-bath interaction, using a vibronic basis. We apply vibronic surrogate Hamiltonian method to a linear chain system and discuss how different types of relaxation process, intramolecular vibrational relaxation and intermolecular vibronic relaxation, influence population dynamics of dissipative vibronic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ultrafast effective multilevel atom method for primordial hydrogen recombination

Cosmological hydrogen recombination has recently been the subject of renewed attention because of its importance for predicting the power spectrum of cosmic microwave background anisotropies. It has become clear that it is necessary to account for a large number n > or approx. 100 of energy shells of the hydrogen atom, separately following the angular momentum substates in order to obtain sufficiently accurate recombination histories. However, the multilevel atom codes that follow the populations of all these levels are computationally expensive, limiting recent analyses to only a few points in parameter space. In this paper, we present a new method for solving the multilevel atom recombination problem, which splits the problem into a computationally expensive atomic physics component that is independent of the cosmology and an ultrafast cosmological evolution component. The atomic physics component follows the network of bound-bound and bound-free transitions among excited states and computes the resulting effective transition rates for the small set of 'interface' states radiatively connected to the ground state. The cosmological evolution component only follows the populations of the interface states. By pretabulating the effective rates, we can reduce the recurring cost of multilevel atom calculations by more than 5 orders of magnitude. The resulting code is fast enough for inclusion in Markov chain Monte Carlo parameter estimation algorithms. It does not yet include the radiative transfer or high-n two-photon processes considered in some recent papers. Further work on analytic treatments for these effects will be required in order to produce a recombination code usable for Planck data analysis.

74 ATOMIC AND MOLECULAR PHYSICS↗

Control Improvement for Jump-Diffusion Processes with Applications to Finance

We consider stochastic control problems with jump-diffusion processes and formulate an algorithm which produces, starting from a given admissible control {pi}, a new control with a better value. If no improvement is possible, then {pi} is optimal. Such an algorithm is well-known for discrete-time Markov Decision Problems under the name Howard's policy improvement algorithm. The idea can be traced back to Bellman. Here we show with the help of martingale techniques that such an algorithm can also be formulated for stochastic control problems with jump-diffusion processes. As an application we derive some interesting results in financial portfolio optimization.

97 MATHEMATICS AND COMPUTING↗

A statistical model of the photomultiplier gain process with applications to optical pulse detection

A Markov diffusion model was used to determine an approximate probability density for the random gain. This approximate density preserves the correct second-order statistics and appears to be in reasonably good agreement with experimental data. The receiver operating curve for a pulse counter detector of PMT cathode emission events was analyzed using this density. The error performance of a simple binary direct detection optical communication system was also derived.

Tan, H. H.↗

A statistical model of the photomultiplier gain process with applications to optical pulse detection

A Markov diffusion model was used to determine an approximate probability density for the random gain. This approximate density preserves the correct second-order statistics and appears to be in reasonably good agreement with experimental data. The receiver operating curve for a pulse counter detector of PMT cathode emission events was analyzed using this density. The error performance of a simple binary direct detection optical communication system was also derived. Previously announced in STAR as N82-25100

Tan, H. H.↗