Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Probabilities Mathematics”

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,261 records · Page 70

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗

Modulation of Atlantic Aerosols by the Madden-Julian Oscillation

Much like the better-known EI Nino-Southern Oscillation, the Madden-Julian Oscillation (MJO) is a global-scale atmospheric phenomenon. The MJO involves periodic, systematic changes in the distribution of clouds and precipitation over the western Pacific and Indian oceans, along with differences in wind intensity over even more extensive areas, including the north and subtropical Atlantic Ocean. The lead authors of this paper developed a sophisticated mathematical technique for mapping the spatial and temporal behavior of changes in the atmosphere produced by the MJO. In a previous paper, we applied this technique to search for modulation of airborne particle amount in the eastern hemisphere associated with the "wet" (cloudy) vs. "dry" phases of the MJO. The study used primarily AVHRR, MODIS, and TOMS satellite-retrieved aerosol amount, but concluded that other factors, such as cloud contamination of the satellite signals, probably dominated the observed variations. The current paper looks at MJO modulation of desert dust transport eastward across the Atlantic from northern Africa, a region much less subject to systematic cloud contamination than the eastern hemisphere areas studied previously. In this case, a distinct aerosol signal appears, showing that dust is transported westward much more effectively during the MJO phase that favors westward-flowing wind, and such transport is suppressed when the MJO reduces these winds. Aside form the significant achievement in identifying such an effect, the result implies that an important component of global dust transport can be predicted based on the phase of the MJO. As a consequence, the impact of airborne dust on storm development in the Atlantic, and on dust deposition downwind of the desert sources, can also be predicted and more accurately modeled.

Tian, B.↗

DYNAMIC AND CLASSICAL PRA: A BWR SBO CASE COMPARISON

As part of the Light-Water Sustainability Program (LWRS), the purpose of the Risk Informed Safety Margin Characterization (RISMC) Pathway research and development is to support plant decisions for risk-informed margin management with the aim to improve economics, reliability, and sustain the safety of current NPPs. In this paper, we describe the RISMC analysis process illustrating how mechanistic (i.e., dynamic system simulators) and probabilistic (stochastic sampling strategies) approaches are combined in a dynamic PRA fashion in order to estimate safety margins. We use the scenario of a “station blackout” (SBO) wherein offsite power and onsite power are lost, thereby causing a challenge to plant safety systems. We describe the RISMC approach, illustrate the station blackout modeling, and compare this with traditional risk analysis modeling for this type of accident scenario. In the RISMC approach the dataset obtained consists of set of simulation runs (performed by using codes such as RELAP5/3D) where timing and ordering of events is changed accordingly to the stochastic sampling strategy adopted. On the other side, classical PRA methods, which are based on event-tree (FT) and fault-tree (FT) structures, generate minimal cut sets and probability values associated to each ET branch. The comparison of the classical and RISMC approaches is performed not only in terms of overall core damage probability but also considering statistical differences in the actual sequence of events. The outcome of this comparison analysis shows similarities and dissimilarities between the approaches but also highlights the greater amount of information that can be generated by using the RISMC approach.

97 MATHEMATICS AND COMPUTING↗

Task allocation in geo-distributed cyber-physical systems - 256

This paper studies the task allocation algorithm for a distributed test facility (DTF), which aims to assemble geo-distributed cyber (software) and physical (hardware in the loop) components into a prototype cyber-physical system (CPS). This allows low cost testing on an early conceptual prototype (ECP) of the ultimate CPS (UCPS) to be developed. The DTF provides an instrumentation interface for carrying out reliability experiments remotely such as fault propagation analysis and in-situ testing of hardware and software components in a simulated environment. Unfortunately, the geo-distribution introduces an overhead that is not inherent to the UCPS, i.e. a significant time delay in communication that threatens the stability of the ECP and is not an appropriate representation of the behavior of the UCPS. This can be mitigated by implementing a task allocation algorithm to find a suitable configuration and assign the software components to appropriate computational locations, dynamically. This would allow the ECP to operate more efficiently with less probability of being unstable due to the delays introduced by geo-distribution. The task allocation algorithm proposed in this work uses a Monte Carlo approach along with Dynamic Programming to identify the optimal network configuration to keep the time delays to a minimum. (authors)

97 MATHEMATICS AND COMPUTING↗

Fluctuations in induced charge introduced by Te inclusions within CdZnTe radiation detectors

Recently, homogenization theory based on a multiple-scale perturbation of the electron transport equation has been used to derive a mathematical framework for modeling the excess charge lost to Te inclusions within radiation detectors based on semi-insulating cadmium zinc telluride (CdZnTe). In that theory, the heterogeneous material is mathematically replaced by a homogenized CdZnTe crystal whose effective electron attenuation length incorporates the additional uniform electron trapping caused by the inclusions. In this paper, the homogenization theory is extended to incorporate fluctuations in the induced charge (i.e., charge collection nonuniformities) introduced by the random position and size distributions of a noncorrelated population of small (i.e, <20 {mu}m) Te inclusions. Analysis of the effective parameters derived within the homogenized framework is used to develop a probability distribution of effective electron attenuation lengths, and therefore effective mobility-lifetime products, as a function of both the position and size distribution of Te inclusions. Example distributions are detailed for the case of an exponential size distribution at various number densities. Further, it is demonstrated that the inclusion-induced material nonuniformities derived in this paper can be numerically sampled efficiently, making them applicable to Monte Carlo device simulation of realistic CdZnTe detectors. Simulated charge induction maps and pulse-height spectra are presented and compared to recently published measurements.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Word timing recovery in direct detection optical PPM communication systems with avalanche photodiodes using a phase lock loop

A technique for word timing recovery in a direct-detection optical PPM communication system is described. It tracks on back-to-back pulse pairs in the received random PPM data sequences with the use of a phase locked loop. The experimental system consisted of an 833-nm AlGaAs laser diode transmitter and a silicon avalanche photodiode photodetector, and it used Q = 4 PPM signaling at source data rate 25 Mb/s. The mathematical model developed to describe system performance is shown to be in good agreement with the experimental measurements. Use of this recovered PPM word clock with a slot clock recovery system caused no measurable penalty in receiver sensitivity. The completely self-synchronized receiver was capable of acquiring and maintaining both slot and word synchronizations for input optical signal levels as low as 20 average detected photons per information bit. The receiver achieved a bit error probability of 10 to the -6th at less than 60 average detected photons per information bit.

Sun, Xiaoli↗

Multistart algorithm for identifying all optima of nonconvex stochastic functions

Here, we propose a multistart algorithm to identify all local minima of a constrained, nonconvex stochastic optimization problem. The algorithm uniformly samples points in the domain and then starts a local stochastic optimization run from any point that is the "probabilistically best" point in its neighborhood. Under certain conditions, our algorithm is shown to asymptotically identify all local optima with high probability; this holds even though our algorithm is shown to almost surely start only finitely many local stochastic optimization runs. We demonstrate the performance of an implementation of our algorithm on nonconvex stochastic optimization problems, including identifying optimal variational parameters for the quantum approximate optimization algorithm.

97 MATHEMATICS AND COMPUTING↗

The CONTIN algorithm and its application to determine the size distribution of microgel suspensions

We review a powerful regularization method, known as CONTIN, for obtaining the size distribution of colloidal suspensions from dynamic light scattering data. We show that together with the so-called L-curve criterion for selecting the optimal regularization parameter, the method correctly describes the average size and size distribution of microgel suspensions independently characterized using small-angle neutron scattering. In contrast, we find that when using the default regularization process, where the regularizer is selected via the “probability to reject” method, the results are not as satisfactory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Cosmic rays during BBN as origin of Lithium problem

There may be non-thermal cosmic rays during big-bang nucleosynthesis (BBN) epoch (dubbed as BBNCRs). This paper investigated whether such BBNCRs can be the origin of Lithium problem or not. It can be expected that BBNCRs flux will be small in order to keep the success of standard BBN (SBBN). With favorable assumptions on the BBNCR spectrum between 0.09–4 MeV, our numerical calculation showed that extra contributions from BBNCRs can account for the {sup 7}Li abundance successfully. However {sup 6}Li abundance is only lifted an order of magnitude, which is still much lower than the observed value. As the deuteron abundance is very sensitive to the spectrum choice of BBNCRs, the allowed parameter space for the spectrum is strictly constrained. We should emphasize that the acceleration mechanism for BBNCRs in the early universe is still an open question. For example, strong turbulent magnetic field is probably the solution to the problem. Whether such a mechanism can provide the required spectrum deserves further studies.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Feshbach resonances of harmonically trapped atoms

Employing a short-range two-channel description, we derive an analytic model of atoms in isotropic and anisotropic harmonic traps at a Feshbach resonance. On this basis we obtain a parametrization of the energy-dependent scattering length that differs from the one previously employed. We validate the model by comparison to full numerical calculations for {sup 6}Li-{sup 87}Rb and explain quantitatively the experimental observation of a resonance shift and trap-induced molecules in exited bands. Finally, we analyze the bound state admixture and Landau-Zener transition probabilities.

74 ATOMIC AND MOLECULAR PHYSICS↗

Automatic Step Size Selection in Random Walk Metropolis Algorithms

Practitioners of Markov chain Monte Carlo (MCMC) may hesitate to use random walk Metropolis- Hastings algorithms, especially variable-at-a-time algorithms with many parameters, because these algorithms require users to select values of tuning parameters (step sizes). These algorithms perform poorly if the step sizes are set to be too low or too high. We show in this paper that it is not difficult for an algorithm to tune these step sizes automatically to obtain a desired acceptance probability, since the logit of the acceptance probability is very nearly linear in the log of the step size, with known slope coefficient. These ideas work in most applications, including single parameter or block moves on the linear, log, or logit scales. We discuss the implementation of this algorithm in the software package YADAS.

97 MATHEMATICS AND COMPUTING↗

A new method for multinomial inference using Dempster-Shafer theory

A new method for multinomial inference is proposed by representing the cell probabilities as unordered segments on the unit interval and following Dempster-Shafer (DS) theory. The resulting DS posterior is then strengthened to improve symmetry and learning properties with the final posterior model being characterized by a Dirichlet distribution. In addition to computational simplicity, the new model has desirable invariance properties related to category permutations, refinements, and coarsenings. Furthemore, posterior inference on relative probabilities amongst certain cells depends only on data for the cells in question. Finally, the model is quite flexible with regard to parameterization and the range of testable assertions. Comparisons are made to existing methods and illustrated with two examples.

97 MATHEMATICS AND COMPUTING↗

Sensitivity Analysis of Passive Heat Removal Capability of FHR Based on Efficient Surrogate Model and GenFlow

Code Scaling, Applicability and Uncertainty Evaluation Methodology (CSAU) is used for quantifying reactor safety margins and works as an alternative method for licensing nuclear power plant. In the framework of CSAU, sensitivity and uncertainty analysis (SA and UA) should be performed. However, for large-scale complicated thermal hydraulics analysis simulated by code (e.g. RELAP5, CFD and subchannel analysis, the sensitivity and uncertainty analysis is really time-consuming. Furthermore, sometimes it is not feasible to perform SA and UA. Specifically, the computation time for Monte Carlo sampling or advanced LHS sampling can be neglected, but the computation time for thermal hydraulics code makes up main part of time during SA and UA process. In order to accelerate the speed of SA and UA, thermal hydraulics code can be improved based on advanced mathematic algorithm or using parallel method. However, the development for new mathematic method needs long time and strict verification and validation process is needed for a new code, which usually takes a couple of years or even longer time to have an approved code that can be used in nuclear industry. An alternative way to improve the speed of SA and UA is using surrogate model. The surrogate model is derived from the input as well as output data of the original code, assuming the code as a black box. The most common method is using response surface method (RSM) as a surrogate for the code, the input parameters are then sampled from their assumed distribution and the corresponding value of the response surface function is calculated. However, a couple of input parameters need hundreds or even thousands of original code calculations. The large number of runs is an obvious disadvantage of this method. Besides, the second disadvantage is an appropriate response surface function must be selected (e.g. quadratic, cubic, quartic, with or without cross product terms, or using a non-polynomial form) to avoid the overfit and underfit problem. This process is time consuming and expensive. Polynomial chaos expansion method is a reasonably fast and attractive alternative, stochastic model. The chaos expansion provides an efficient high-order method of including non-linear effects in stochastic analysis. Usually, the information about the model parameters and their probability distribution is limited and the dependence between them is not known. However, if arbitrary polynomial chaos is used, instead of assuming probability distribution for input parameters which may introduces additional subjectivity into the analysis, the available information can directly and most purely be used in stochastic analysis based on arbitrary data distribution. Thus, it is not necessary to know the exact probability density functions to perform SA and UA based on arbitrary polynomial chaos (aPC). The aPC has been applied for uncertainty quantification in many fields (e.g. in solid mechanics, fluid flows, thermal sciences), and become widely used in nuclear industry recently. Mk1 PB-FHR is a small modular fluoride-salt-cooled, high-temperature reactors (FHRs) that is a concept design by University of California, Berkeley (UCB). It has inherently safe features like natural-circulation-driven systems (e.g. direct reactor auxiliary cooling system (DRACS)) to passively remove decay heat from the reactor core during design basis and beyond design. It is necessary to perform SA and UA, since the licensing process of this new kind of reactor is under way and there are many design parameters that have not been fixed. Current nuclear commercial codes, such as RELAP5, have mainly been developed for light water reactors, which require the use of comprehensive two-phase flow models. This capability is not required to simulate single-phase flow phenomena in FHRs, whose baseline coolant, flibe, remains liquid up to 1430 deg. C at atmospheric pressure. The FHR advanced natural circulation analysis (FANCY) code has been developed specifically for FHR technology modeling and validation work has been performed by using CIET data in UCB. The code has been renamed General Flow (GenFlow) because it has been further developed to have the capability to model complicated pipework system based on object-oriented concept for user friendly purpose. Besides, it can be used to simulate both the force circulation as well as natural circulation. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

SU-E-T-578: On Definition of Minimum and Maximum Dose for Target Volume

Purpose: This study aims to investigate the impact of different minimum and maximum dose definitions in radiotherapy treatment plan quality evaluation criteria by using tumor control probability (TCP) models. Methods: Dosimetric criteria used in RTOG 1308 protocol are used in the investigation. RTOG 1308 is a phase III randomized trial comparing overall survival after photon versus proton chemoradiotherapy for inoperable stage II-IIIB NSCLC. The prescription dose for planning target volume (PTV) is 70Gy. Maximum dose (Dmax) should not exceed 84Gy and minimum dose (Dmin) should not go below 59.5Gy in order for the plan to be “per protocol” (satisfactory).A mathematical model that simulates the characteristics of PTV dose volume histogram (DVH) curve with normalized volume is built. The Dmax and Dmin are noted as percentage volumes Dη% and D(100-δ)%, with η and d ranging from 0 to 3.5. The model includes three straight line sections and goes through four points: D95%= 70Gy, Dη%= 84Gy, D(100-δ)%= 59.5 Gy, and D100%= 0Gy. For each set of η and δ, the TCP value is calculated using the inhomogeneously irradiated tumor logistic model with D50= 74.5Gy and γ50=3.52. Results: TCP varies within 0.9% with η; and δ values between 0 and 1. With η and η varies between 0 and 2, TCP change was up to 2.4%. With η and δ variations from 0 to 3.5, maximum of 8.3% TCP difference is seen. Conclusion: When defined maximum and minimum volume varied more than 2%, significant TCP variations were seen. It is recommended less than 2% volume used in definition of Dmax or Dmin for target dosimetric evaluation criteria. This project was supported by NIH grants U10CA180868, U10CA180822, U24CA180803, U24CA12014 and PA CURE Grant.

61 RADIATION PROTECTION AND DOSIMETRY↗

A New Method for Generating Probability Tables in the Unresolved Resonance Region

One new method for constructing probability tables in the unresolved resonance region (URR) has been developed. This new methodology is an extensive modification of the single-level Breit-Wigner (SLBW) pseudo-resonance pair sequence method commonly used to generate probability tables in the URR. The new method uses a Monte Carlo process to generate many pseudo-resonance sequences by first sampling the average resonance parameter data in the URR and then converting the sampled resonance parameters to the more robust R-matrix limited (RML) format. Furthermore, for each sampled set of pseudo-resonance sequences, the temperature-dependent cross sections are reconstructed on a small grid around the energy of reference using the Reich-Moore formalism and the Leal-Hwang Doppler broadening methodology. We then use the effective cross sections calculated at the energies of reference to construct probability tables in the URR. The RML cross-section reconstruction algorithm has been rigorously tested for a variety of isotopes, including 16 O, 19 F, 35 Cl, 56 Fe, 63 Cu, and 65 Cu. The new URR method also produced normalized cross-section factor probability tables for 238 U that were found to be in agreement with current standards. The modified 238 U probability tables were shown to produce results in excellent agreement with several standard benchmarks, including the IEU-MET-FAST-007 (BIG TEN), IEU-MET-FAST-003, and IEU-COMP-FAST-004 benchmarks.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Computational generation and screening of RNA motifs in large nucleotide sequence pools

Although identification of active motifs in large random sequence pools is central to RNA in vitro selection, no systematic computational equivalent of this process has yet been developed. We develop a computational approach that combines target pool generation, motif scanning and motif screening using secondary structure analysis for applications to 10 12 –10 14 -sequence pools; large pool sizes are made possible using program redesign and supercomputing resources. We use the new protocol to search for aptamer and ribozyme motifs in pools up to experimental pool size (10 14 sequences). We show that motif scanning, structure matching and flanking sequence analysis, respectively, reduce the initial sequence pool by 6–8, 1–2 and 1 orders of magnitude, consistent with the rare occurrence of active motifs in random pools. The final yields match the theoretical yields from probability theory for simple motifs and overestimate experimental yields, which constitute lower bounds, for aptamers because screening analyses beyond secondary structure information are not considered systematically. We also show that designed pools using our nucleotide transition probability matrices can produce higher yields for RNA ligase motifs than random pools. Our methods for generating, analyzing and designing large pools can help improve RNA design via simulation of aspects of in vitro selection.

59 BASIC BIOLOGICAL SCIENCES↗

Model-Based Detection of Coordinated Attacks (DCA) in Distribution Systems

The fast-paced growth in digitization of smart grid components enhances system observability and remote-control capabilities through efficient communication. However, enhanced connectivity results in heightened system vulnerability towards cybersecurity risks in the cyber-physical power system. Coordinated cyber-attacks (CCA), when undetected, lead to system-wide impact in terms of large disturbances or widespread outages. Detecting CCA in the cyber layer is critical to thwart cyber-attacks in real-time before the attack impacts the physical system. The challenge of locating CCA stems from the complex grid dynamics, making it difficult to distinguish between normal operational variations and cyber-attack impact. CCA often employs multiple attack vectors targeting geographically distributed components, further complicating CCA identification. Existing research in intrusion detection is primarily focused on the transmission network and limited to detecting individual attacks. In this paper, a novel proactive DCA strategy is proposed for early detection of CCA by establishing correlations among distinct attack events through model-based reinforcement learning that utilizes abductive reasoning to conclude the attacker goal. The solution includes understanding the system model, learning the system dynamics, and correlating individual cyber-attacks to extract the attacker’s objective. The developed learning algorithm identifies the most probable attack path to reach the attacker’s objective by predicting the next attack steps. A DNP3-based cyber-physical co-simulation testbed is developed to test the proposed algorithm using the IEEE 13-node test feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗