A scalable graph generation algorithm to sample over a given shell distribution.
Abstract not provided.
SEARCH · Engineering Papers
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.
Abstract not provided.
Lidar Atmospheric Wind Sounder (LAWS) Simulation Models (LSM) were developed to evaluate the potential impact of global wind observations on the basic understanding of the Earth's atmosphere and on the predictive skills of current forecast models (GCM and regional scale). Fully integrated top to bottom LAWS Simulation Models for global and regional scale simulations were developed. The algorithm development incorporated the effects of aerosols, water vapor, clouds, terrain, and atmospheric turbulence into the models. Other additions include a new satellite orbiter, signal processor, line of sight uncertainty model, new Multi-Paired Algorithm and wind error analysis code. An atmospheric wind field library containing control fields, meteorological fields, phenomena fields, and new European Center for Medium Range Weather Forecasting (ECMWF) data was also added. The LSM was used to address some key LAWS issues and trades such as accuracy and interpretation of LAWS information, data density, signal strength, cloud obscuration, and temporal data resolution.
Current safeguards approaches used by the IAEA at gas centrifuge enrichment plants (GCEPs) need enhancement in order to detect undeclared LEU production with adequate detection probability using non destructive assay (NDA) techniques. At present inspectors use attended systems, systems needing the presence of an inspector for operation, during inspections to verify the mass and {sup 235}U enrichment of UF{sub 6} bulk material used in the process of enrichment at GCEPS. The inspectors also take destructive assay (DA) samples for analysis off-site which provide accurate, on the order of 0.1 % to 0.5% uncertainty, data on the enrichment of the UF{sub 6} feed, tails, and product. However, DA sample taking is a much more labor intensive and resource intensive exercise for the operator and inspector. Furthermore, the operator must ship the samples off-site to the IAEA laboratory which delays the timeliness of the results and contains the possibility of the loss of the continuity of knowledge of the samples during the storage and transit of the material. Use of the IAEA's inspection sampling algorithm shows that while total sample size is fixed by the total population of potential samples and its intrinsic qualities, the split of the samples into NDA or DA samples is determined by the uncertainties in the NDA measurements. Therefore, the larger the uncertainties in the NDA methods, more of the sample taken must be DA samples. Since the DA sampling is arduous and costly, improvements in NDA methods would reduce the number of DA samples needed. Furthermore, if methods of on-site analysis of the samples could be developed that have uncertainties in the 1-2% range, a lot of the problems inherent in DA sampling could be removed. The use of an unattended system that could give an overview of the entire process giving complementary data on the enrichment process as well as accurate measures of enrichment and weights of the UF{sub 6} feed, tails, and product would be a major step in enhancing the ability of NDA beyond present attended systems. The possibility of monitoring the feed, tails, and product header pipes in such a way as to gain safeguards relevant flow and enrichment information without compromising the intellectual property of the operator including proprietary equipment and operational parameters would be a huge step forward. This paper contains an analysis of possible improvements in unattended and attended NDA systems including such process monitoring and possible on-site analysis of DA samples that could reduce the uncertainty of the inspector measurements reducing the difference between the operator's and inspector's measurements providing more effective and efficient IAEA GeEPs safeguards.
The objective of pure-sampling quantum Monte Carlo is to calculate physical properties that are independent of the importance sampling function being employed in the calculation, save for the mismatch of its nodal hypersurface with that of the exact wave function. To achieve this objective, we report a pure-sampling algorithm that combines features of forward walking methods of pure-sampling and reptation quantum Monte Carlo (RQMC). The new algorithm accurately samples properties from the mixed and pure distributions simultaneously in runs performed at a single set of time-steps, over which extrapolation to zero time-step is performed. In a detailed comparison, we found RQMC to be less efficient. It requires different sets of time-steps to accurately determine the energy and other properties, such as the dipole moment. We implement our algorithm by systematically increasing an algorithmic parameter until the properties converge to statistically equivalent values. As a proof in principle, we calculated the fixed-node energy, static α polarizability, and other one-electron expectation values for the ground-states of LiH and water molecules. These quantities are free from importance sampling bias, population control bias, time-step bias, extrapolation-model bias, and the finite-field approximation. We found excellent agreement with the accepted values for the energy and a variety of other properties for those systems.
It has recently become clear that regulatory RNAs play a major role in regulation of gene expression in bacteria. RNA secondary structures play a major role in the function of many regulatory RNAs, and structural features are often key to their interaction with other cellular components. Thus, there has been considerable interest in the prediction of the secondary structures for RNA families. A paper describing our new algorithm, RNAG, to predict consensus secondary structures for unaligned sequences using the blocked Gibbs sampler has been published[1]. This sampling algorithm iteratively samples from the conditional probability distributions: P(Structure | Alignment) and P(Alignment | Structure). Subsequent to publication of the RNAG paper we have employed the technology from RNAG in the development of an RNA motif finding algorithm. To develop and RNA motif finding algorithm, RGibbs, we capitalized on our long experience in DNA motif finding and RNA secondary structure prediction. We applied RGibbs to three data sets from the literature and compared it to existing methods: one for training and two others for tests sets. In both test sets we found RGibbs out performed existing procedures.
A Physics-Informed Machine Learning (PIML) framework for better system vulnerability assessment and faster corrective action recommendation. This framework consists of deriving physics-informed priors and smart sampling algorithms to help reduce the data samples of grid models and the dimension of simulation outputs, yielding small yet representative subset of the complex system, and both supervised and unsupervised machine learning (ML) algorithms for designing corrective actions
A G-FCON algorithm is designed for small-body surface sampling. It has a linearization component and a feedback component to enhance performance. The algorithm regulates the contact force between the tip of a robotic arm attached to a spacecraft and a surface during sampling.
Recursive algorithms for pattern classification of misclassified samples
Recursive algorithms for pattern classification using misclassified samples
Cyber-Physical Systems (CPSs) have a large input space, with discrete and continuous elements across multiple layers. Hybrid Attack Graph (HAG) provide a flexible and efficient approach to generate attack sequences for a CPS. Analysis and testing of large-scale HAGs are prohibitively costly. We propose a dimension reduction via property-preserving multi-layer graph sampling algorithms. Existing property-preserving graph sampling approaches generate a representative subgraph of an original large-sized graph while preserving the key properties, such as node and edge distribution, clustering coefficients, and betweenness. On the other hand, we propose impact-driven sampling strategies to transform the input data to a lower-dimensional representation while retaining key properties of the data.
We make a frequentist analysis of the parameter space of the NUHM2, in which the soft supersymmetry (SUSY)-breaking contributions to the masses of the two Higgs multiplets, m 2 H u,d , vary independently from the universal soft SUSY-breaking contributions m 2 0 to the masses of squarks and sleptons. Our analysis uses the MultiNest sampling algorithm with over 4 × 10⁸ points to sample the NUHM2 parameter space. It includes the ATLAS and CMS Higgs mass measurements as well as the ATLAS search for supersymmetric jets + /E T signals using the full LHC Run 1 data, the measurements of BR(B s →μ⁺μ⁻) by LHCb and CMS together with other B-physics observables, electroweak precision observables and the XENON100 and LUX searches for spin-independent dark-matter scattering. We find that the preferred regions of the NUHM2 parameter space have negative SUSY-breaking scalar masses squared at the GUT scale for squarks and sleptons, m 2 0 < 0, as well as m 2 H u < m 2 H d < 0. The tension present in the CMSSM and NUHM1 between the supersymmetric interpretation of (g – 2)μ and the absence to date of SUSY at the LHC is not significantly alleviated in the NUHM2. We find that the minimum χ 2 = 32.5 with 21 degrees of freedom (dof) in the NUHM2, to be compared with χ 2 /dof = 35.0/23 in the CMSSM, and χ 2 /dof = 32.7/22 in the NUHM1. We find that the one-dimensional likelihood functions for sparticle masses and other observables are similar to those found previously in the CMSSM and NUHM1.
We present a frequentist analysis of the parameter space of the pMSSM10, in which the following ten soft SUSY-breaking parameters are specified independently at the mean scalar top mass scale M SUSY ≡ √m $\tilde{t}$ 1 m $\tilde{t}$ 2 : the gaugino masses M 1,2,3 , the first-and second-generation squark masses m $\tilde{q}$ 1 = m $\tilde{q}$ 2 , the third-generation squark mass m $\tilde{q}$ 3 , a common slepton mass m $\tilde{ℓ}$ and a common trilinear mixing parameter A , as well as the Higgs mixing parameter μ , the pseudoscalar Higgs mass M A and tanβ , the ratio of the two Higgs vacuum expectation values. We use the MultiNest sampling algorithm with ~ 1.2 ×10 9 points to sample the pMSSM10 parameter space. A dedicated study shows that the sensitivities to strongly interacting sparticle masses of ATLAS and CMS searches for jets, leptons + E-slash T signals depend only weakly on many of the other pMSSM10 parameters. With the aid of the Atom and Scorpion codes, we also implement the LHC searches for electroweakly interacting sparticles and light stops, so as to confront the pMSSM10 parameter space with all relevant SUSY searches. In addition, our analysis includes Higgs mass and rate measurements using the HiggsSignals code, SUSY Higgs exclusion bounds, the measurements of BR(B s →μ + μ - ) by LHCb and CMS, other B -physics observables, electroweak precision observables, the cold dark matter density and the XENON100 and LUX searches for spin-independent dark matter scattering, assuming that the cold dark matter is mainly provided by the lightest neutralino χ-tilde 1 0 . We show that the pMSSM10 is able to provide a supersymmetric interpretation of (g-2) μ , unlike the CMSSM, NUHM1 and NUHM2. As a result, we find (omitting Higgs rates) that the minimum χ2=20.5 with 18 degrees of freedom (d.o.f.) in the pMSSM10, corresponding to a χ2 probability of 30.8 %, to be compared with χ2/d.o.f.=32.8/24(31.1/23)(30.3/22) in the CMSSM (NUHM1) (NUHM2). We display the one-dimensional likelihood functions for sparticle masses, and we show that they may be significantly lighter in the pMSSM10 than in the other models, e.g., the gluino may be as light as ~ 1250 GeV at the 68 % CL, and squarks, stops, electroweak gauginos and sleptons may be much lighter than in the CMSSM, NUHM1 and NUHM2. We discuss the discovery potential of future LHC runs, e + e - colliders and direct detection experiments.
This paper presents a data analysis and modeling framework to tailor and develop linear parameter-varying (LPV) aeroservoelastic (ASE) model database for flexible aircrafts in broad 2D flight parameter space. The Kriging surrogate model is constructed using ASE models at a fraction of grid points within the original model database, and then the ASE model at any flight condition can be obtained simply through surrogate model interpolation. The greedy sampling algorithm is developed to select the next sample point that carries the worst relative error between the surrogate model prediction and the benchmark model in the frequency domain among all input-output channels. The process is iterated to incrementally improve surrogate model accuracy till a pre-determined tolerance or iteration budget is met. The methodology is applied to the ASE model database of a flexible aircraft currently being tested at NASA/AFRC for flutter suppression and gust load alleviation. Our studies indicate that the proposed method can reduce the number of models in the original database by 67%. Even so the ASE models obtained through Kriging interpolation match the model in the original database constructed directly from the physics-based tool with the worst relative error far below 1%. The interpolated ASE model exhibits continuously-varying gains along a set of prescribed flight conditions. More importantly, the selected grid points are distributed non-uniformly in the parameter space, a) capturing the distinctly different dynamic behavior and its dependence on flight parameters, and b) reiterating the need and utility for adaptive space sampling techniques for ASE model database compaction. The present framework is directly extendible to high-dimensional flight parameter space, and can be used to guide the ASE model development, model order reduction, robust control synthesis and novel vehicle design of flexible aircraft.
Fast, real-time motion planning of an agile, autonomous vehicle in a cluttered environment, with many geometrically-fixed obstacles, is a very complex problem, especially because of the vehicle dynamics constraints and resource constrained computational capabilities onboard the vehicle. In this paper, we present computationally-efficient versions of our novel motion planning algorithm called the Spherical Expansion and Sequential Convex Programming (SE–SCP) algorithm. The SE–SCP algorithm first uses a spherical-expansion-based randomized sampling algorithm to explore the workspace. Oncea path is found from the start position to the goal position, the algorithm computes a locally optimal trajectory, within its homotopy class for a desired cost function, by solving a sequence of convex optimization problems. Thus, the SE–SCP algorithm is anytime locally optimal and the trajectory is globally optimal if the number of samples tends to infinity. In this paper, we further enhance the computational efficiency of the SE–SCP algorithm using uni-directional and bi-directional rewiring techniques. We also present a detailed proof of the local optimality characteristics of the new SE–SCP algorithms for aspecial case of vehicle dynamics. Simulation examples involving quadrotor and spacecraft help demonstrate the effectiveness of our new algorithms.
Characterization of delayed-particle signatures is of the utmost importance for detecting, identifying, and quantifying special nuclear material (SNM). Various non-destructive assay (NDA) techniques used in nuclear material safeguards rely on characteristic gamma-ray or neutron emissions to infer properties of a material. The all-particle, all-energy Monte-Carlo radiation transport code MCNP6 is capable of simulating delayed-particle signatures from SNM in addition to modeling the transport of emitted particles to a detector or other instrument. In some cases, NDA techniques require the measurement of low probability emissions from a given material. In physical scenarios, this problem can be bypassed by longer count-times or may be simply irrelevant due to the mass, and therefore the total activity, of the material being measured. However, when applying the Monte-Carlo method to such scenarios, sampling of low probability emissions requires a large number of histories to converge to a statistically acceptable solution. To address this issue, the delayed-neutron and gamma energy biasing feature was introduced in MCNP6 by H. Armstrong et al. in 2013 which allows the user to set up energy windows in which delayed-particle emission sampling can be adjusted. For delayed-gamma sampling, this biasing method was based on the bin-wise structure of gamma emission data for both the multi-bin gamma and line-emission sampling modes. Recent improvements have been made to the line-emission sampling algorithm which upgrade the previous mini-bin sampling treatment to an exact energy-line treatment. This upgrade was not compatible with the biasing method implemented by H. Armstrong et al. due to the sampled data no longer having a bin-wise structure in line-emission mode. For this reason the delayed-gamma energy biasing feature has been rewritten to support the exact line-sampling treatment. This paper provides a description of the delayed-gamma energy biasing (DGEB) feature in MCNP6 as well as results and discussion for a gamma-ray spectroscopy example used to demonstrate the biasing utility. (authors)
Nested sampling (NS) is the preferred stochastic sampling algorithm for gravitational-wave inference for compact binary coalescences. It can handle the complex nature of the gravitational-wave likelihood surface and provides an estimate of the Bayesian model evidence. However, there is another class of algorithms that meets the same requirements, but has not been used for gravitational-wave analyses: sequential Monte Carlo (SMC), an extension of importance sampling that maps samples from an initial density to a target density via a series of intermediate densities. In this work, we validate a type of SMC algorithm, called persistent sampling (PS), for gravitational-wave inference. We consider a range of different scenarios including binary black holes and binary neutron stars and real and simulated data and show that PS produces results that are consistent with NS whilst being, on average, 2 times more efficient and 2.74 times faster. This demonstrates that PS is a viable alternative to NS that should be considered for future gravitational-wave analyses.
We present a way to generate heuristic mathematical models based on the Darwinian principles of variation and selection in a pool of individuals over many generations. Each individual has a genotype (the hereditary properties) and a phenotype (the expression of these properties in the environment). Variation is achieved by cross-over and mutation operations on the genotype which consists in the present case of a single chromosome. The genotypes 'live' in the environment of the data. Nested Sampling is used to optimize the free parameters of the models given the data, thus giving rise to the phenotypes. Selection is based on the phenotypes.The evidences which naturally follow from the Nested Sampling Algorithm are used in a second level of Nested Sampling to find increasingly better models.The data in this paper originate from the Leiden Cytology and Pathology Laboratory (LCPL), which screens pap smears for cervical cancer. We have data for 1750 women who on average underwent 5 tests each. The data on individual women are treated as a small time series. We will try to estimate the next value of the prime cancer indicator from previous tests of the same woman.
The current tuning process of parameters in global climate models is often performed subjectively, or treated as an optimization procedure to minimize the difference between model fields and observations. The later approach may be generating a set of tunable parameters that approximate the observed climate but via an unrealistic balance of physical processes and/or compensating errors over different regions in the globe. In this study, we run the Weather Research and Forecasting (WRF) regional model constrained by the reanalysis data over the Southern Great Plains (SGP) where abundant observational data from various resources are available for calibration of the input parameters and validation of the model results. Our goal is to quantify the uncertainty ranges and identify the optimal values of five key input parameters in a new Kain-Frisch (KF) convective parameterization scheme incorporated in the WRF model. A stochastic sampling algorithm, Multiple Very Fast Simulated Annealing (MVFSA), is employed to efficiently sample the input parameters in KF scheme based on the skill score so that the algorithm progressively moves toward regions of the parameter space that minimize model errors. The results based on the WRF simulations with 25-km grid spacing over the SGP show that the model bias for precipitation can be significantly reduced by using five optimal parameters identified by the MVFSA algorithm. The model performance is very sensitive to downdraft and entrainment related parameters and consumption time of Convective Available Potential Energy (CAPE). Simulated convective precipitation decreases as the ratio of downdraft to updraft flux increases. Larger CAPE consumption time results in less convective but more stratiform precipitation. The simulation using optimal parameters obtained by only constraining precipitation generates positive impact on the other output variables, such as temperature and wind. By using the optimal parameters obtained at 25 km simulation, both the magnitude and spatial pattern of simulated precipitation are improved at 12-km spatial resolution. The optimal parameters identified from the SGP region have also improved the simulation of precipitation when moving model domain to another region with a different climate regime (i.e. North America monsoon region). These results suggest the improvement of precipitation simulation by using the optimal parameters remains when the model domain or spatial resolution is changed.