Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling algorithm”

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,801 records · Page 100

TWO-COMPONENT STRUCTURE OF THE H{beta} BROAD-LINE REGION IN QUASARS. I. EVIDENCE FROM SPECTRAL PRINCIPAL COMPONENT ANALYSIS

We report on a spectral principal component analysis (SPCA) of a sample of 816 quasars, selected to have small Fe II velocity shifts with spectral coverage in the rest wavelength range 3500-5500 A. The sample is explicitly designed to mitigate spurious effects on SPCA induced by Fe II velocity shifts. We improve the algorithm of SPCA in the literature and introduce a new quantity, the fractional-contribution spectrum, that effectively identifies the emission features encoded in each eigenspectrum. The first eigenspectrum clearly records the power-law continuum and very broad Balmer emission lines. Narrow emission lines dominate the second eigenspectrum. The third eigenspectrum represents the Fe II emission and a component of the Balmer lines with kinematically similar intermediate-velocity widths. Correlations between the weights of the eigenspectra and parametric measurements of line strength and continuum slope confirm the above interpretation for the eigenspectra. Monte Carlo simulations demonstrate the validity of our method to recognize cross talk in SPCA and firmly rule out a single-component model for broad H{beta}. We also present the results of SPCA for four other samples that contain quasars in bins of larger Fe II velocity shift; similar eigenspectra are obtained. We propose that the H{beta}-emitting region has two kinematically distinct components: one with very large velocities whose strength correlates with the continuum shape and another with more modest, intermediate velocities that is closely coupled to the gas that gives rise to Fe II emission.

79 ASTRONOMY AND ASTROPHYSICS↗

Correction of Sampling Errors in Ocean Surface Cross-Sectional Estimates from Nadir-Looking Weather Radar

The return from the ocean surface has a number of uses for airborne meteorological radar. The normalized surface cross section has been used for radar system calibration, estimation of surface winds, and in algorithms for estimating the path-integrated attenuation in rain. However, meteorological radars are normally optimized for observation of distributed targets that fill the resolution volume, and so a point target such as the surface can be poorly sampled, particularly at near-nadir look angles. Sampling the nadir surface return at an insufficient rate results in a negative bias of the estimated cross section. This error is found to be as large as 4 dB using observations from a high-altitude airborne radar. An algorithm for mitigating the error is developed that is based upon the shape of the surface echo and uses the returned signal at the three range gates nearest the peak surface echo.

Caylor, I. Jeff↗

IAEA Coordinated Research Project on HTGR Reactor Physics, Thermal-hydraulics and Depletion Uncertainty Analysis

The continued development of High Temperature Gas Cooled Reactors (HTGRs) requires verification of HTGR design and safety features with reliable high fidelity physics models and robust, efficient, and accurate codes. The predictive capability of coupled neutronics/thermal-hydraulics and depletion simulations for reactor design and safety analysis can be assessed with sensitivity analysis (SA) and uncertainty analysis (UA) methods. Uncertainty originates from errors in physical data, manufacturing uncertainties, modelling and computational algorithms. (The interested reader is referred to the large body of published SA and UA literature for a more complete overview of the various types of uncertainties, methodologies and results obtained). SA is helpful for ranking the various sources of uncertainty and error in the results of core analyses. SA and UA are required to address cost, safety, and licensing needs and should be applied to all aspects of reactor multi-physics simulation. SA and UA can guide experimental, modelling, and algorithm research and development. Current SA and UA rely either on derivative-based methods such as stochastic sampling methods or on generalized perturbation theory to obtain sensitivity coefficients. Neither approach addresses all needs. In order to benefit from recent advances in modelling and simulation and the availability of new covariance data (nuclear data uncertainties) extensive sensitivity and uncertainty studies are needed for quantification of the impact of different sources of uncertainties on the design and safety parameters of HTGRs. Only a parallel effort in advanced simulation and in nuclear data improvement will be able to provide designers with more robust and well validated calculation tools to meet design target accuracies. In February 2009, the Technical Working Group on Gas-Cooled Reactors (TWG-GCR) of the International Atomic Energy Agency (IAEA) recommended that the proposed Coordinated Research Program (CRP) on the HTGR Uncertainty Analysis in Modelling (UAM) be implemented. This CRP is a continuation of the previous IAEA and Organization for Economic Co-operation and Development (OECD)/Nuclear Energy Agency (NEA) international activities on Verification and Validation (V&V) of available analytical capabilities for HTGR simulation for design and safety evaluations. Within the framework of these activities different numerical and experimental benchmark problems were performed and insight was gained about specific physics phenomena and the adequacy of analysis methods.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Optimizing disk registration algorithms for nanobeam electron diffraction strain mapping

Scanning nanobeam electron diffraction strain mapping is a technique by which the positions of diffracted disks sampled at the nanoscale over a crystalline sample can be used to reconstruct a strain map over a large area. However, it is important that the disk positions are measured accurately, as their positions relative to a reference are directly used to calculate strain. Here in this study, we compare several correlation methods using both simulated and experimental data in order to directly probe susceptibility to measurement error due to non-uniform diffracted disk illumination structure. We found that prefiltering the diffraction patterns with a Sobel filter before performing cross correlation or performing a square-root magnitude weighted phase correlation returned the best results when inner disk structure was present. Lastly, we have tested these methods both on simulated datasets, and experimental data from unstrained silicon as well as a twin grain boundary in 304 stainless steel.

36 MATERIALS SCIENCE↗

Guidance and Navigation for a Martian Sample Return Ascent Vehicle

Overview: Mission Design and Concept of Operations; Vehicle Concept and System Requirements; Guidance and Navigation Architecture; Simulation Architecture; Guidance Algorithm Development; Navigation System Design; Integrated Vehicle Performance; Continuing Analysis and Trades; Conclusions.

Anzalone, Evan↗

Generalized Sensitivity Calculation in the Monte Carlo Wielandt Method

Recently the Monte Carlo (MC) adjoint-weighted perturbation (AWP) methods with k-adjoint have been developed for the k sensitivity calculations. In order to extend the MC AWP methods to estimate sensitivities of a ratio of two reaction rates, Perfetti and Rearden devised a MC sensitivity calculation method with the generalized adjoint expressed by the intra-generational and intergenerational effects. Aufiero et al. suggested the collision history-based approach to calculate sensitivities of responses in the form of ratios of linear or bilinear functions by applying the correlated sampling for multi-generational collisions. However these methods may require a huge size of computer memory to save inter-generational contributions proportional to the number of the sensitivity tallies. In order to reduce memories required for the k-adjoint estimation, the present authors proposed the AWP algorithm in the MC Wielandt method where multiple generations from a fission source neutron are simulated in single history calculations. In this paper, we present perturbation formulations to estimate sensitivities for general tallies such as volume flux, reaction rates, etc. in the MC Wielandt calculations. The proposed method has been implemented into the Seoul National University MC code, McCARD and tested in two-group infinite homogeneous problems. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Ames vision group research overview

A major goal of the reseach group is to develop mathematical and computational models of early human vision. These models are valuable in the prediction of human performance, in the design of visual coding schemes and displays, and in robotic vision. To date researchers have models of retinal sampling, spatial processing in visual cortex, contrast sensitivity, and motion processing. Based on their models of early human vision, researchers developed several schemes for efficient coding and compression of monochrome and color images. These are pyramid schemes that decompose the image into features that vary in location, size, orientation, and phase. To determine the perceptual fidelity of these codes, researchers developed novel human testing methods that have received considerable attention in the research community. Researchers constructed models of human visual motion processing based on physiological and psychophysical data, and have tested these models through simulation and human experiments. They also explored the application of these biological algorithms to applications in automated guidance of rotorcraft and autonomous landing of spacecraft. Researchers developed networks for inhomogeneous image sampling, for pyramid coding of images, for automatic geometrical correction of disordered samples, and for removal of motion artifacts from unstable cameras.

Watson, Andrew B.↗

An optical systems analysis approach to image resampling

All types of image registration require some type of resampling, either during the registration or as a final step in the registration process. Thus the image(s) must be regridded into a spatially uniform, or angularly uniform, coordinate system with some pre-defined resolution. Frequently the ending resolution is not the resolution at which the data was observed with. The registration algorithm designer and end product user are presented with a multitude of possible resampling methods each of which modify the spatial frequency content of the data in some way. The purpose of this paper is threefold: (1) to show how an imaging system modifies the scene from an end to end optical systems analysis approach, (2) to develop a generalized resampling model, and (3) empirically apply the model to simulated radiometric scene data and tabulate the results. A Hanning windowed sinc interpolator method will be developed based upon the optical characterization of the system. It will be discussed in terms of the effects and limitations of sampling, aliasing, spectral leakage, and computational complexity. Simulated radiometric scene data will be used to demonstrate each of the algorithms. A high resolution scene will be "grown" using a fractal growth algorithm based on mid-point recursion techniques. The result scene data will be convolved with a point spread function representing the optical response. The resultant scene will be convolved with the detection systems response and subsampled to the desired resolution. The resultant data product will be subsequently resampled to the correct grid using the Hanning windowed sinc interpolator and the results and errors tabulated and discussed.

Lyon, Richard G.↗

New avenue to the parton distribution functions: Self-organizing maps

Neural network algorithms have been recently applied to construct parton distribution function (PDF) parametrizations which provide an alternative to standard global fitting procedures. In this exploratory study we propose a technique using self-organizing maps (SOMs). SOMs are a class of clustering algorithms based on competitive learning among spatially ordered neurons. Our SOMs are trained on selections of stochastically generated PDF samples. The selection criterion for every optimization iteration is based on the features of the clustered PDFs. Our goal is a fitting procedure that, at variance with the standard neural network approaches, will allow for an increased control of the systematic bias by enabling user interaction in the various stages of the process.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Variational approach to quantum state tomography based on maximal entropy formalism

Quantum state tomography is an integral part of quantum computation and offers the starting point for the validation of various quantum devices. One of the central tasks in the field of state tomography is to reconstruct, with high fidelity, the quantum states of a quantum system. From an experiment on a real quantum device, one can obtain the mean measurement values of different operators. With such data as input, in this report we employ the maximal entropy formalism to construct the least biased mixed quantum state that is consistent with the given set of expectation values. Even though, in principle, the reported formalism is quite general and should work for an arbitrary set of observables, in practice we shall demonstrate the efficacy of the algorithm on an informationally complete (IC) set of Hermitian operators. Such a set possesses the advantage of uniquely specifying a single quantum state from which the experimental measurements have been sampled and hence renders the rare opportunity not only to construct a least-biased quantum state but even replicate the exact state prepared experimentally within a preset tolerance. Here, the primary workhorse of the algorithm is reconstructing an energy function which we designate as the effective Hamiltonian of the system, and parameterizing it with Lagrange multipliers, according to the formalism of maximal entropy. These parameters are thereafter optimized variationally so that the reconstructed quantum state of the system converges to the true quantum state within an error threshold. To this end, we employ a parameterized quantum circuit and a hybrid quantum-classical variational algorithm to obtain such a target state, making our recipe easily implementable on a near-term quantum device.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Measurement range of phase retrieval in optical surface and wavefront metrology

Phase retrieval employs very simple data collection hardware and iterative algorithms to determine the phase of an optical field. We have derived limitations on phase retrieval, as applied to optical surface and wavefront metrology, in terms of the speed of beam (i.e., f-number or numerical aperture) and amount of aberration using arguments based on sampling theory and geometrical optics. These limitations suggest methodologies for expanding these ranges by increasing the complexity of the measurement arrangement, the phase-retrieval algorithm, or both. We have simulated one of these methods where a surface is measured at unusual conjugates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A case study of view-factor rectification procedures for diffuse-gray radiation enclosure computations

The view factors which are used in diffuse-gray radiation enclosure calculations are often computed by approximate numerical integrations. These approximately calculated view factors will usually not satisfy the important physical constraints of reciprocity and closure. In this paper several view-factor rectification algorithms are reviewed and a rectification algorithm based on a least-squares numerical filtering scheme is proposed with both weighted and unweighted classes. A Monte-Carlo investigation is undertaken to study the propagation of view-factor and surface-area uncertainties into the heat transfer results of the diffuse-gray enclosure calculations. It is found that the weighted least-squares algorithm is vastly superior to the other rectification schemes for the reduction of the heat-flux sensitivities to view-factor uncertainties. In a sample problem, which has proven to be very sensitive to uncertainties in view factor, the heat transfer calculations with weighted least-squares rectified view factors are very good with an original view-factor matrix computed to only one-digit accuracy. All of the algorithms had roughly equivalent effects on the reduction in sensitivity to area uncertainty in this case study.

Taylor, Robert P.↗

Cosmological parameters from CMB maps without likelihood approximation

We propose an efficient Bayesian Markov chain Monte Carlo (MCMC) algorithm for estimating cosmological parameters from cosmic microwave background (CMB) data without the use of likelihood approximations. It builds on a previously developed Gibbs sampling framework that allows for exploration of the joint CMB sky signal and power spectrum posterior, P(s,C{sub ℓ}|d), and addresses a long-standing problem of efficient parameter estimation simultaneously in regimes of high and low signal-to-noise ratio. To achieve this, our new algorithm introduces a joint Markov chain move in which both the signal map and power spectrum are synchronously modified, by rescaling the map according to the proposed power spectrum before evaluating the Metropolis–Hastings accept probability. Such a move was already introduced by Jewell et al., who used it to explore low signal-to-noise posteriors. However, they also found that the same algorithm is inefficient in the high signal-to-noise regime, since a brute-force rescaling operation does not account for phase information. This problem is mitigated in the new algorithm by subtracting the Wiener filter mean field from the proposed map prior to rescaling, leaving high signal-to-noise information invariant in the joint step, and effectively only rescaling the low signal-to-noise component. To explore the full posterior, the new joint move is then interleaved with a standard conditional Gibbs move for the sky map. We apply our new algorithm to simplified simulations for which we can evaluate the exact posterior to study both its accuracy and its performance, and find good agreement with the exact posterior; marginal means agree to ≲0.006σ and standard deviations to better than ∼3%. The Markov chain correlation length is of the same order of magnitude as those obtained by other standard samplers in the field.

79 ASTRONOMY AND ASTROPHYSICS↗

Ensembles of radial basis function networks for spectroscopic detection of cervical precancer

The mortality related to cervical cancer can be substantially reduced through early detection and treatment. However, current detection techniques, such as Pap smear and colposcopy, fail to achieve a concurrently high sensitivity and specificity. In vivo fluorescence spectroscopy is a technique which quickly, noninvasively and quantitatively probes the biochemical and morphological changes that occur in precancerous tissue. A multivariate statistical algorithm was used to extract clinically useful information from tissue spectra acquired from 361 cervical sites from 95 patients at 337-, 380-, and 460-nm excitation wavelengths. The multivariate statistical analysis was also employed to reduce the number of fluorescence excitation-emission wavelength pairs required to discriminate healthy tissue samples from precancerous tissue samples. The use of connectionist methods such as multilayered perceptrons, radial basis function (RBF) networks, and ensembles of such networks was investigated. RBF ensemble algorithms based on fluorescence spectra potentially provide automated and near real-time implementation of precancer detection in the hands of nonexperts. The results are more reliable, direct, and accurate than those achieved by either human experts or multivariate statistical algorithms.

Cervix Neoplasms/pathology↗

The Dark Energy Survey: Cosmology Results with ∼1500 New High-redshift Type Ia Supernovae Using the Full 5 yr Data Set

Abstract We present cosmological constraints from the sample of Type Ia supernovae (SNe Ia) discovered and measured during the full 5 yr of the Dark Energy Survey (DES) SN program. In contrast to most previous cosmological samples, in which SNe are classified based on their spectra, we classify the DES SNe using a machine learning algorithm applied to their light curves in four photometric bands. Spectroscopic redshifts are acquired from a dedicated follow-up survey of the host galaxies. After accounting for the likelihood of each SN being an SN Ia, we find 1635 DES SNe in the redshift range 0.10 < z < 1.13 that pass quality selection criteria sufficient to constrain cosmological parameters. This quintuples the number of high-quality z > 0.5 SNe compared to the previous leading compilation of Pantheon+ and results in the tightest cosmological constraints achieved by any SN data set to date. To derive cosmological constraints, we combine the DES SN data with a high-quality external low-redshift sample consisting of 194 SNe Ia spanning 0.025 < z < 0.10. Using SN data alone and including systematic uncertainties, we find Ω M = 0.352 ± 0.017 in flat ΛCDM. SN data alone now require acceleration ( q 0 < 0 in ΛCDM) with over 5 σ confidence. We find ( Ω M , w ) = ( 0.264 − 0.096 + 0.074 , − 0.80 − 0.16 + 0.14 ) in flat w CDM. For flat w 0 w a CDM, we find ( Ω M , w 0 , w a ) = ( 0.495 − 0.043 + 0.033 , − 0.36 − 0.30 + 0.36 , − 8.8 − 4.5 + 3.7 ) , consistent with a constant equation of state to within ∼2 σ . Including Planck cosmic microwave background, Sloan Digital Sky Survey baryon acoustic oscillation, and DES 3 × 2pt data gives (Ω M , w ) = (0.321 ± 0.007, −0.941 ± 0.026). In all cases, dark energy is consistent with a cosmological constant to within ∼2 σ . Systematic errors on cosmological parameters are subdominant compared to statistical errors; these results thus pave the way for future photometrically classified SN analyses.

79 ASTRONOMY AND ASTROPHYSICS↗

Neural Learning Based Blind Source Separation for Detection of Material Defects in Pulsed Thermography Images

In this paper, we introduce a neural learning-based approach to blind source separation for detection of material flaws in pulsed thermography (PT) images. This approach can be used to detect internal defects (pores) in metallic Additively Manufactured (AM) materials. Such defects occur in high-strength alloys produced with direct laser sintering AM method for nuclear energy applications. Pulsed thermal imaging system utilizes a high intensity flash lamp to rapidly heat surface of sample, a high sensitivity infrared camera to capture data of surface temperature variations. The data cube obtained with PT (stack of surface temperature images at different times) can be analyzed with image processing algorithms to detect material defects. Compared with conventional nondestructive evaluation (NDE) methods, such as digital radiography and ultrasonic testing, the PT pulsed infrared thermal detection technique has advantages of one-sided non-contact measurements, fast processing of large sample areas captured in one image. Detection of small material defects requires finding features in thermal images, which have signal contrast levels approaching sensitivity limit of IR camera. In this study, an optimized Neural Learning based Blind Source Separation (NLBSS) algorithm, including Principal Component Analysis (PCA), and Independent Component Analysis (ICA) is demonstrated to automatically extract principal temporal and spatial features of thermography frames to enhance flaw detection. By using the NLBSS algorithm, material internal defects can be automatically detected. Furthermore, this processing approach compensates for experimental thermal imaging artifacts, such as noise and uneven heating. By merging artificial intelligence with the photothermic, the NDE system detects internal calibrated defects of various sizes and depths in AM nuclear-grade metallic alloys.

Zhang, Xin↗

A DIRECT MEASUREMENT OF HIERARCHICAL GROWTH IN GALAXY GROUPS SINCE z {approx} 1

We present the first measurement of the evolution of the galaxy group stellar mass function (GrSMF) to redshift z {approx}> 1 and low masses (M{sub *} > 10{sup 12} M{sub Sun }). Our results are based on early data from the Carnegie-Spitzer-IMACS Survey, utilizing low-resolution spectra and broadband optical/near-IR photometry to measure redshifts for a 3.6 {mu}m selected sample of 37,000 galaxies over a 5.3 deg{sup 2} area to z {approx} 1.2. Employing a standard friends-of-friends algorithm for all galaxies more massive than log M{sub *}/M{sub Sun} = 10.5, we find a total of {approx}4000 groups. Correcting for spectroscopic incompleteness (including slit collisions), we build cumulative stellar mass functions for these groups in redshift bins at z > 0.35, comparing to the z = 0 and z > 0 mass functions from various group and cluster samples. Our derived mass functions match up well with z > 0.35 X-ray-selected clusters, and strong evolution is evident at all masses over the past 8 Gyr. Given the already low level of star formation activity in galaxies at these masses, we therefore attribute most of the observed growth in the GrSMF to group-group and group-galaxy mergers, in accordance with qualitative notions of hierarchical structure formation. Given the factor of 3-10 increase in the number density of groups and clusters with M{sub *} > 10{sup 12} M{sub Sun} since z = 1 and the strong anticorrelation between star formation activity and environmental density during this epoch, this late-time growth in group-sized halos may therefore be an important contributor to the structural and star formation evolution of massive galaxies over the past 8 Gyr.

79 ASTRONOMY AND ASTROPHYSICS↗

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗

Refine your search to explore more results.