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,225 records · Page 68

Overview of development and design of MPACT: Michigan parallel characteristics transport code

MPACT (Michigan Parallel Characteristics Transport Code) is a new reactor analysis tool. It is being developed by students and research staff at the University of Michigan to be used for an advanced pin-resolved transport capability within VERA (Virtual Environment for Reactor Analysis). VERA is the end-user reactor simulation tool being produced by the Consortium for the Advanced Simulation of Light Water Reactors (CASL). The MPACT development project is itself unique for the way it is changing how students do research to achieve the instructional and research goals of an academic institution, while providing immediate value to industry. The MPACT code makes use of modern lean/agile software processes and extensive testing to maintain a level of productivity and quality required by CASL. MPACT's design relies heavily on object-oriented programming concepts and design patterns and is programmed in Fortran 2003. These designs are explained and illustrated as to how they can be readily extended to incorporate new capabilities and research ideas in support of academic research objectives. The transport methods currently implemented in MPACT include the 2-D and 3-D method of characteristics (MOC) and 2-D and 3-D method of collision direction probabilities (CDP). For the cross section resonance treatment, presently the subgroup method and the new embedded self-shielding method (ESSM) are implemented within MPACT. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Duality-Free Decomposition Based Data-Driven Stochastic Security-Constrained Unit Commitment

To incorporate the superiority of both stochastic and robust approaches, a data-driven stochastic optimization is employed to solve the security-constrained unit commitment model. This approach makes the most use of the historical data to generate a set of possible probability distributions for wind power outputs and then it optimizes the unit commitment under the worst-case probability distribution. However, this model suffers from huge computational burden, as a large number of scenarios are considered. To tackle this issue, a duality-free decomposition method is proposed in this paper. This approach does not require doing duality, which can save a large set of dual variables and constraints, and therefore reduces the computational burden. In addition, the inner max-min problem has a special mathematical structure, where the scenarios have the similar constraint. Thus, the max-min problem can be decomposed into independent sub-problems to be solved in parallel, which further improves the computational efficiency. A numerical study on an IEEE 118-bus system with practical data of a wind power system has demonstrated the effectiveness of the proposal.

42 ENGINEERING↗

Reliability model of a monopropellant auxiliary propulsion system

A mathematical model and associated computer code has been developed which computes the reliability of a monopropellant blowdown hydrazine spacecraft auxiliary propulsion system as a function of time. The propulsion system is used to adjust or modify the spacecraft orbit over an extended period of time. The multiple orbit corrections are the multiple objectives which the auxiliary propulsion system is designed to achieve. Thus the reliability model computes the probability of successfully accomplishing each of the desired orbit corrections. To accomplish this, the reliability model interfaces with a computer code that models the performance of a blowdown (unregulated) monopropellant auxiliary propulsion system. The computer code acts as a performance model and as such gives an accurate time history of the system operating parameters. The basic timing and status information is passed on to and utilized by the reliability model which establishes the probability of successfully accomplishing the orbit corrections.

Greenberg, J. S.↗

Symbolic inversion of control relationships in model-based expert systems

Symbolic inversion is examined from several perspectives. First, a number of symbolic algebra and mathematical tool packages were studied in order to evaluate their capabilities and methods, specifically with respect to symbolic inversion. Second, the KATE system (without hardware interface) was ported to a Zenith Z-248 microcomputer running Golden Common Lisp. The interesting thing about the port is that it allows the user to have measurements vary and components fail in a non-deterministic manner based upon random value from probability distributions. Third, INVERT was studied as currently implemented in KATE, its operation documented, some of its weaknesses identified, and corrections made to it. The corrections and enhancements are primarily in the way that logical conditions involving AND's and OR's and inequalities are processed. In addition, the capability to handle equalities was also added. Suggestions were also made regarding the handling of ranges in INVERT. Last, other approaches to the inversion process were studied and recommendations were made as to how future versions of KATE should perform symbolic inversion.

Thomas, Stan↗

Blockchain for Fault-Tolerant Grid Operations Version 2.0

This report explores the potential of distributed ledger technology (DLT) as a transformative tool to enhance fault-tolerant operations in electrical distribution systems. Leveraging DLT's core attributes, including an immutable decentralized ledger, distributed consensus mechanisms, and state replication capabilities, this study focuses on three critical use cases. A central aspect of this research centers on the utilization of a consensus-driven ledger, providing actors within the system, such as distributed resources, with access to a reliable data repository. This empowers these actors to collaborate effectively and make informed decisions, all securely recorded on the blockchain. The first use case concentrates on data configuration, utilizing mathematical criteria---particularly, the chi-squared test for gross error detection---to identify trustworthy sensors for advanced decision-making. Building upon this foundation of trust, the second use case, topology identification, accurately determines circuit breaker states, unveiling the distribution network's topology. Ultimately, the third use case leverages this trust to execute switching actions, reconfiguring feeders and restoring power to disconnected customers after fault events. The concept of trust serves as a cornerstone in this approach, marking a departure from traditional fault location, isolation, and service restoration (FLISR) methods. Additionally, the blockchain-based architecture introduces decentralization, empowering disconnected areas to make autonomous decisions, even when communication with a central control center is disrupted. The primary contributions of this report are twofold: (1) a novel approach for evaluating distribution system voltage areas while preserving data ownership and (2) the implementation of interactions between distribution network areas using the actor model. Unlike the previous sequential approach for evaluating the area connection voltages, which required a radial network topology, this study's area model reduction enables a more versatile approach. The area model reduction addresses issues of prolonged data waiting times and multiple points of failure within the previous approach. Notably, the presented evaluation for the reduced network model area connection reveals a significant increase in the differences in voltage magnitudes. Simulation and evaluation of area agents across four distinct cases elucidate the area-level interaction behavior during a fault event. Simulations demonstrate that the proposed distributed FLISR (DFLISR) approach can successfully restore service to an affected area. Varying message delays and message loss probabilities in each simulation case underscore their impacts on restoration times, ranging from 3 min and 32 s to 6 min and 19 s. In contrast, power is not restored in an area in one of our simulation cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Proof that Combining the Forced-collision and DXTRAN Monte Carlo Variance-reduction Techniques is Fair

This report provides mathematical proof that the MCNP DXTRAN (also known in other codes as forced-flight) and forced-collision variance-reduction techniques do not bias the expected value of Monte Carlo simulation estimates when combined. Proof is also provided that the techniques are unbiased when used independently. To prove that the techniques are unbiased, this report derives the first History Score Moment Equation (HSME) for non-multiplying media employing only forced collisions, only DXTRAN, and then both the variance-reduction techniques combined, as defined next. The HSMEs are found by forming the History Score Probability Density Functions (HSPDFs) and then taking the first score moment. Following its derivation, each HSME with a variance-reduction technique employed is reduced to the HSME for an analog simulation. Because the HSME represents the expected contribution to estimators in the simulation, reducing the HSME with variance reduction to the analog HSME shows that the simulation is unbiased despite the variance-reduction technique considered in the HSME. Analysis regarding higher-score moments of each technique is the subject of prior work and is not addressed herein. Throughout this work, the phase space p is defined to be the particle position x, direction-of-flight unit vector $\hat{Ω}$, energy E, and statistical weight w, $$p ≡ (x; \hat{Ω}; E; w).$$ A reduced phase-space excluding the statistical weight of the particle, $$r ≡ (x; \hat{Ω}; E),$$ is also used.

97 MATHEMATICS AND COMPUTING↗

A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

In this paper, we present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems, whose constraints are differentiable, and are indexed by an index set of low dimension. After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints. The combination of this distribution optimization method and the central cutting surface algorithm yields a solution to a family of distributionally robust optimization problems that are considerably more general than the ones proposed to date.

97 MATHEMATICS AND COMPUTING↗

A Semi-Quantitative, Synteny-Based Method to Improve Functional Predictions for Hypothetical and Poorly Annotated Bacterial and Archaeal Genes

During microbial evolution, genome rearrangement increases with increasing sequence divergence. If the relationship between synteny and sequence divergence can be modeled, gene clusters in genomes of distantly related organisms exhibiting anomalous synteny can be identified and used to infer functional conservation. We applied the phylogenetic pairwise comparison method to establish and model a strong correlation between synteny and sequence divergence in all 634 available Archaeal and Bacterial genomes from the NCBI database and four newly assembled genomes of uncultivated Archaea from an acid mine drainage (AMD) community. In parallel, we established and modeled the trend between synteny and functional relatedness in the 118 genomes available in the STRING database. By combining these models, we developed a gene functional annotation method that weights evolutionary distance to estimate the probability of functional associations of syntenous proteins between genome pairs. The method was applied to the hypothetical proteins and poorly annotated genes in newly assembled acid mine drainage Archaeal genomes to add or improve gene annotations. This is the first method to assign possible functions to poorly annotated genes through quantification of the probability of gene functional relationships based on synteny at a significant evolutionary distance, and has the potential for broad application.

59 BASIC BIOLOGICAL SCIENCES↗

Conservative Estimation of Tail Probabilities from Limited Sample Data

Several sparse-sample uncertainty quantification (UQ) methods are compared for conservative but not overly conservative estimation of small tail probabilities involving responses that lay beyond specified thresholds in the tails of probability distributions. Sixteen very differently shaped distributions (or probability density functions, PDFs) and tail probability magnitudes ranging from 10 -5 to 10 -1 are considered in order for the study to be relevant to a wide range of risk analysis and quantification of margins and uncertainty (QMU) problems. The emphasis of the study is on limited data regimes ranging from N = 2 to 20 samples, reflective of most experimental and some expensive computational situations. Relatively simple sparse-sample UQ methods tested for this regime involve statistical tolerance interval "Equivalent Normal and related "Ensemble of Normals" and "Superdistribution (SD) approaches. (The independently derived SD is effectively equivalent to the Bayesian posterior predictive distribution given the assumptions of the derivation.) The performance of the methods was generally improved for N ≥ 5 samples with a generalized Jackknife resampling technique, which determines a tail probability estimate by averaging estimates from smaller sub-samples. Several quantitative metrics for method conservatism and accuracy of tail probability estimation are used to assess and rank the methods' performance over many random trials for each test PDF and probability magnitude. A variant of Bootstrap resampling was also tried, but did not significantly improve tail probability estimates in most cases. Detailed results are presented from over 100-million tests over the above factors that provide useful granular information on which methods or combination of methods perform best in various areas of the factor space.

97 MATHEMATICS AND COMPUTING↗

Differentiable Channels Are All You Need

Mobile wireless communication systems must adapt to and compensate for time-varying propagation paths. The process of performing compensation in the receiver for said effects is known as equalization. We seek an improved method for optimizing the reliability of said wireless links to minimize outage probability. A method based on machine learning, specifically deep learning, has the potential to allow for greater flexibility and robustness against unforeseen channel conditions. In this report we investigate the performance of a prior method in the literature with minor modifications.

97 MATHEMATICS AND COMPUTING↗

Improving system reliability through formal analysis and use of checks in software

Software is playing increasingly important roles in avionics systems. It is widely used in navigation and, in some cases, in control loops that maintain aircraft stability. To guarantee the safety of flight systems, the FAA requires that critical components have a probability of failure no greater than 10(exp -9) per hour of flight. Software is being used to diagnose system components for failure. SIFT (Software Implemented Fault Tolerance) was a computer system developed to study the use of software to check for failure and manage processor reconfiguration. To guarantee that software satisfies its specifications, formal verification can be used. With this a program and its specification are viewed as mathematical objects, and a mathematical proof is used to show that the program and its specification are equivalent. In previous research, a theory of checking was developed to offer assistance in analyzing specifications and designing run-time checks. In the theory, checking is considered abstractly in terms of n-ary relations much like those of relational database theory. Within the theory check are categorized, checks on input and checks on results are considered, and formal attention is given to the minimization and logical combination of checks. The focus is upon input checks and the obstacles in checking input to critical systems. A central concern is with a property referred to as independence. The concern is with circumstances under which it is possible to apply isolated, independent checks to separate sensor inputs and be assure that all illegal input will be properly detected. Presently, independence is being investigated and checked in the context of the GCS (Guidance and Control System). The GCS simulator is intended for testing software that implements control laws for landing spacecraft. The large number of inputs and their complex interrelationships provide an exciting context in which to investigate independence and the difficulties of supplying input checks.

Staknis, Mark E.↗

Parallel homotopy curve tracking on a hypercube

An investigation is conducted to find good parallel algorithms for solving systems of nonlinear equations using probability-one homotopy methods. Particular attention is paid to algorithms for the hypercube. Methods for one of the most computationally expensive steps of the homotopy approach, the computation of the kernel of the Jacobian matrix of the homotopy map, are studied. General nonlinear systems of equations with small and dense Jacobian matrices are considered, however, polynomial systems are not, since their structure leads to different strategies for parallelism. The mathematics behind the homotopy algorithm is summarized and the use of orthogonal factorizations is discussed. Parallel algorithms for orthogonal factorizations and triangular system solving are described. Computational results are presented and discussed.

Chakraborty, A.↗

Smart Sensor System for NDE or Corrosion in Aging Aircraft

The extension of the operation life of military and civilian aircraft rather than replacing them with new ones is increasing the probability of aircraft component failure as a result of aging. Aircraft that already have endured a long srvice life of more than 40 years are now being considered for another 40 years of service.

monitoring system mathematical transformation oper↗

Evaluation of Wilks’ One-sided Non-parametric Formula Against Analytical Parametric Methods

This paper will be presented to the "Sensitivity and Uncertainty Methods" subgroup of the "Mathematics and Computation Division" of the ANS Winter Symposium. Direct comparisons are made via simulation between the Wilks' non-parametric and Gaussian (parametric) methods which are applied in the SASQUATCH and SINDA-SAMPLE thermal-hydraulic codes, respectively, for the Advanced Test Reactor safety basis. The level of relative conservatism is quantified for the Wilks method and shown to be greater than the parametric method for an equivalent probability and confidence level.

95/95↗

MATRIX 2 RESULTS OF THE FY07 ENHANCED DOE HIGH-LEVEL WASTE MELTER THROUGHPUT STUDIES AT SRNL

High-level waste (HLW) throughput (i.e., the amount of waste processed per unit time) is a function of two critical parameters: waste loading (WL) and melt rate. For the Waste Treatment and Immobilization Plant (WTP) at the Hanford Site and the Defense Waste Processing Facility (DWPF) at the Savannah River Site (SRS), increasing HLW throughput would significantly reduce the overall mission life cycle costs for the Department of Energy (DOE). The objective of this study was to generate supplemental validation data that could be used to determine the applicability of the current liquidus temperature (TL) model to expanded DWPF glass composition regions of interest based on higher WLs. Two specific flowsheets were used in this study to provide such insight: (1) Higher WL glasses (45 and 50%) based on future sludge batches that have (and have not) undergone the Al-dissolution process. (2) Coupled operations supported by the Salt Waste Processing Facility (SWPF), which increase the TiO{sub 2} concentration in glass to greater than 2 wt%. Glasses were also selected to address technical issues associated with Al{sub 2}O{sub 3} solubility, nepheline formation, and homogeneity issues for coupled operations. A test matrix of 28 glass compositions was developed to provide insight into these issues. The glasses were fabricated and characterized using chemical composition analysis, X-ray Diffraction (XRD), TL measurement and the Product Consistency Test (PCT). The results of this study are summarized below: (1) TiO{sub 2} concentrations up to {approx} 3.5 wt% were retained in DWPF type glasses, where retention is defined as the absence of crystalline TiO{sub 2} (i.e., unreacted or undissolved) in the as-fabricated glasses. Although this TiO{sub 2} content does not bound the projected SWPF high output flowsheet (up to 6 wt% TiO{sub 2} may be required in glass), these data demonstrate the potential for increasing the TiO{sub 2} limit in glass above the current limit of 2 wt% (based strictly on retention or solubility). (2) For those study glasses that had very close compositional overlap with the model development and/or model validation ranges of the current DWPF TL model (except TiO{sub 2} and MgO concentrations), there was very little difference in the predicted and measured TL values. Even though the TiO{sub 2} concentrations were above the 2 wt% upper limit, the results indicate that the current T{sub L} model is applicable in this compositional region with TiO{sub 2} contents up to approximately 3.5 wt%. (3) As the target glass compositions diverge from the model development and validation ranges, the T{sub L} data suggest that the model under-predicted the measured values. These discrepancies imply that there are individual oxides or oxide combinations that need to be accounted for in the model. These oxides include B{sub 2}O{sub 3}, SiO{sub 2}, MnO, TiO{sub 2} and/or their combinations. More data would be required to fill in these anticipated DWPF compositional regions for higher WL glasses so that the model coefficients could be refit to account for these differences. (4) Based on PCT response of HWL-21 and HWL-22 (two glasses that were prone to nepheline formation) it appears that increasing the B{sub 2}O{sub 3} concentration in glass does not consistently suppress the formation of nepheline in glasses with higher Al{sub 2}O{sub 3} and/or Na{sub 2}O content. Although the chemical durabilities of the quenched versions of these glasses were very acceptable, the canister centerline cooled (ccc) glasses exhibited a considerable decrease in durability and were found to contain nepheline via XRD. In fact, one of the glasses had a release that was 5 times greater than that of the Environmental Assessment (EA) benchmark glass. These results suggest a need for a more fundamental understanding of the compositional and kinetic effects of nepheline formation in high WL glasses. (5) Data have been generated in support of the replacement of the homogeneity constraint with the Al{sub 2}O{sub 3} and/or sum of alkali constraints for coupled operations as previously completed for sludge-only operations. This strategy should be pursued for either the compositional region anticipated for coupled operations or as part of the variability study for each sludge batch. The PCT responses of the study glasses suggest a high probability that this strategy could be defended at some later date.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Cyber–Physical Correlation Effects in Defense Games for Large Discrete Infrastructures

In certain critical infrastructures, correlations between cyber and physical components can be exploited to launch strategic attacks, so that disruptions to one component may affect others and possibly the entire infrastructure. Such correlations must be explicitly taken into account in ensuring the survival of the infrastructure. For large discrete infrastructures characterized by the number of cyber and physical components, we characterize the cyber–physical interactions at two levels: (i) the cyber–physical failure correlation function specifies the conditional survival probability of the cyber sub-infrastructure given that of the physical sub-infrastructure (both specified by their marginal probabilities), and (ii) individual survival probabilities of both sub-infrastructures are characterized by first-order differential conditions expressed in terms of their multiplier functions. We formulate an abstract problem of ensuring the survival probability of a cyber–physical infrastructure with discrete components as a game between the provider and attacker, whose utility functions are composed of infrastructure survival probability terms and cost terms, both expressed in terms of the number of components attacked and reinforced. We derive Nash equilibrium conditions and sensitivity functions that highlight the dependence of infrastructure survival probability on cost terms, correlation functions, multiplier functions, and sub-infrastructure survival probabilities. We apply these analytical results to characterize the defense postures of simplified models of metro systems, cloud computing infrastructures, and smart power grids.

97 MATHEMATICS AND COMPUTING↗

The stochastic model for ternary and quaternary alloys: Application of the Bernoulli relation to the phonon spectra of mixed crystals

To understand and interpret the experimental data on the phonon spectra of the solid solutions, it is necessary to describe mathematically the non-regular distribution of atoms in their lattices. It appears that such description is possible in case of the strongly stochastically homogenous distribution which requires a great number of atoms and very carefully mixed alloys. These conditions are generally fulfilled in case of high quality homogenous semiconductor solid solutions of the III–V and II–VI semiconductor compounds. In this case, we can use the Bernoulli relation describing probability of the occurrence of one n equivalent event which can be applied, to the probability of finding one from n configurations in the solid solution lattice. The results described in this paper for ternary HgCdTe and GaAsP as well as quaternary ZnCdHgTe can provide an affirmative answer to the question: whether stochastic geometry, e.g., the Bernoulli relation, is enough to describe the observed phonon spectra.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗