Search NASA⌕ Search

SEARCH · Search NASA

Results for “Randomized methods”

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,513 records · Page 84

Risk of Late Toxicity in Men Receiving Dose-Escalated Hypofractionated Intensity Modulated Prostate Radiation Therapy: Results From a Randomized Trial

Objective: To report late toxicity outcomes from a randomized trial comparing conventional and hypofractionated prostate radiation therapy and to identify dosimetric and clinical parameters associated with late toxicity after hypofractionated treatment. Methods and Materials: Men with localized prostate cancer were enrolled in a trial that randomized men to either conventionally fractionated intensity modulated radiation therapy (CIMRT, 75.6 Gy in 1.8-Gy fractions) or to dose-escalated hypofractionated IMRT (HIMRT, 72 Gy in 2.4-Gy fractions). Late (≥90 days after completion of radiation therapy) genitourinary (GU) and gastrointestinal (GI) toxicity were prospectively evaluated and scored according to modified Radiation Therapy Oncology Group criteria. Results: 101 men received CIMRT and 102 men received HIMRT. The median age was 68, and the median follow-up time was 6.0 years. Twenty-eight percent had low-risk, 71% had intermediate-risk, and 1% had high-risk disease. There was no difference in late GU toxicity in men treated with CIMRT and HIMRT. The actuarial 5-year grade ≥2 GU toxicity was 16.5% after CIMRT and 15.8% after HIMRT (P=.97). There was a nonsignificant numeric increase in late GI toxicity in men treated with HIMRT compared with men treated with CIMRT. The actuarial 5-year grade ≥2 GI toxicity was 5.1% after CIMRT and 10.0% after HIMRT (P=.11). In men receiving HIMRT, the proportion of rectum receiving 36.9 Gy, 46.2 Gy, 64.6 Gy, and 73.9 Gy was associated with the development of late GI toxicity (P<.05). The 5-year actuarial grade ≥2 GI toxicity was 27.3% in men with R64.6Gy ≥ 20% but only 6.0% in men with R64.6Gy < 20% (P=.016). Conclusions: Dose-escalated IMRT using a moderate hypofractionation regimen (72 Gy in 2.4-Gy fractions) can be delivered safely with limited grade 2 or 3 late toxicity. Minimizing the proportion of rectum that receives moderate and high dose decreases the risk of late rectal toxicity after this hypofractionation regimen.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Extending Conformal Prediction to Hidden Markov Models with Exact Validity via de Finetti’s Theorem for Markov Chains

Conformal prediction is a widely used method to quantify uncertainty in settings where the data is independent and identically distributed (IID), or more generally, exchangeable. Conformal prediction takes in a pre-trained classifier and a calibration dataset as inputs, and returns a function which maps feature vectors to subsets of classes. The output of the returned function for a new feature vector is guaranteed to contain the true class with a pre-specified confidence. Despite its success and usefulness in IID settings, extending conformal prediction to non-exchangeable (e.g., Markovian) data in a manner that provably preserves all desirable theoretical properties has largely remained an open problem. As a solution, we extend conformal prediction to the setting of a Hidden Markov Model (HMM) with unknown parameters. The key idea behind the proposed method is to partition the non-exchangeable Markovian data from the HMM into exchangeable blocks by exploiting the de Finetti’s Theorem for Markov Chains discovered by Diaconis and Freedman (1980). The permutations of the exchangeable blocks are then viewed as randomizations of the observed Markovian data from the HMM. The proposed method provably retains all desirable theoretical guarantees offered by the classical conformal prediction framework and is general enough to be useful in many sequential prediction problems.

Nettasinghe, Don Buddhika Wijayantha↗

Deformable segmentation of 3D MR prostate images via distributed discriminative dictionary and ensemble learning

Purpose: Automatic prostate segmentation from MR images is an important task in various clinical applications such as prostate cancer staging and MR-guided radiotherapy planning. However, the large appearance and shape variations of the prostate in MR images make the segmentation problem difficult to solve. Traditional Active Shape/Appearance Model (ASM/AAM) has limited accuracy on this problem, since its basic assumption, i.e., both shape and appearance of the targeted organ follow Gaussian distributions, is invalid in prostate MR images. To this end, the authors propose a sparse dictionary learning method to model the image appearance in a nonparametric fashion and further integrate the appearance model into a deformable segmentation framework for prostate MR segmentation. Methods: To drive the deformable model for prostate segmentation, the authors propose nonparametric appearance and shape models. The nonparametric appearance model is based on a novel dictionary learning method, namely distributed discriminative dictionary (DDD) learning, which is able to capture fine distinctions in image appearance. To increase the differential power of traditional dictionary-based classification methods, the authors' DDD learning approach takes three strategies. First, two dictionaries for prostate and nonprostate tissues are built, respectively, using the discriminative features obtained from minimum redundancy maximum relevance feature selection. Second, linear discriminant analysis is employed as a linear classifier to boost the optimal separation between prostate and nonprostate tissues, based on the representation residuals from sparse representation. Third, to enhance the robustness of the authors' classification method, multiple local dictionaries are learned for local regions along the prostate boundary (each with small appearance variations), instead of learning one global classifier for the entire prostate. These discriminative dictionaries are located on different patches of the prostate surface and trained to adaptively capture the appearance in different prostate zones, thus achieving better local tissue differentiation. For each local region, multiple classifiers are trained based on the randomly selected samples and finally assembled by a specific fusion method. In addition to this nonparametric appearance model, a prostate shape model is learned from the shape statistics using a novel approach, sparse shape composition, which can model nonGaussian distributions of shape variation and regularize the 3D mesh deformation by constraining it within the observed shape subspace. Results: The proposed method has been evaluated on two datasets consisting of T2-weighted MR prostate images. For the first (internal) dataset, the classification effectiveness of the authors' improved dictionary learning has been validated by comparing it with three other variants of traditional dictionary learning methods. The experimental results show that the authors' method yields a Dice Ratio of 89.1% compared to the manual segmentation, which is more accurate than the three state-of-the-art MR prostate segmentation methods under comparison. For the second dataset, the MICCAI 2012 challenge dataset, the authors' proposed method yields a Dice Ratio of 87.4%, which also achieves better segmentation accuracy than other methods under comparison. Conclusions: A new magnetic resonance image prostate segmentation method is proposed based on the combination of deformable model and dictionary learning methods, which achieves more accurate segmentation performance on prostate T2 MR images.

60 APPLIED LIFE SCIENCES↗

A stochastic Galerkin method for the Boltzmann equation with uncertainty

We develop a stochastic Galerkin method for the Boltzmann equation with uncertainty. The method is based on the generalized polynomial chaos (gPC) approximation in the stochastic Galerkin framework, and can handle random inputs from collision kernel, initial data or boundary data. We show that a simple singular value decomposition of gPC related coefficients combined with the fast Fourier-spectral method (in velocity space) allows one to compute the high-dimensional collision operator very efficiently. In the spatially homogeneous case, we first prove that the analytical solution preserves the regularity of the initial data in the random space, and then use it to establish the spectral accuracy of the proposed stochastic Galerkin method. Several numerical examples are presented to illustrate the validity of the proposed scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation

The Polynomial Dimensional Decomposition (PDD) is employed in this work for the global sensitivity analysis and uncertainty quantification (UQ) of stochastic systems subject to a moderate to large number of input random variables. Due to the intimate connection between the PDD and the Analysis of Variance (ANOVA) approaches, PDD is able to provide a simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to the Polynomial Chaos expansion (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of standard methods unaffordable for real engineering applications. In order to address the problem of the curse of dimensionality, this work proposes essentially variance-based adaptive strategies aiming to build a cheap meta-model (i.e. surrogate model) by employing the sparse PDD approach with its coefficients computed by regression. Three levels of adaptivity are carried out in this paper: 1) the truncated dimensionality for ANOVA component functions, 2) the active dimension technique especially for second- and higher-order parameter interactions, and 3) the stepwise regression approach designed to retain only the most influential polynomials in the PDD expansion. During this adaptive procedure featuring stepwise regressions, the surrogate model representation keeps containing few terms, so that the cost to resolve repeatedly the linear systems of the least-squares regression problem is negligible. The size of the finally obtained sparse PDD representation is much smaller than the one of the full expansion, since only significant terms are eventually retained. Consequently, a much smaller number of calls to the deterministic model is required to compute the final PDD coefficients.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fabrication of oriented crystals as force measurement tips via focused ion beam and microlithography methods

Detailed knowledge of the forces between nanocrystals is very crucial for understanding many generic (e.g., random aggregation/assembly and rheology) and specific (e.g., oriented attachment) phenomena at macroscopic length scales, especially considering the additional complexities involved in nanocrystals such as crystal orientation and corresponding orientation-dependent physicochemical properties. Because there are a limited number of methods to directly measure the forces, little is known about the forces that drive the various emergent phenomena. Here we report on two methods of preparing crystals as force measurement tips used in an atomic force microscope (AFM): the focused ion beam method and microlithography method. The desired crystals are fabricated using these two methods and are fixed to the AFM probe using platinum deposition, ultraviolet epoxy, or resin, which allows for the orientation-dependent force measurements. These two methods can be used to attach virtually any solid particles (from the size of a few hundreds of nanometers to millimeters). We demonstrate the force measurements between aqueous media under different conditions such as pH.

Environmental Molecular Sciences Laboratory↗

Vehicle track segmentation using higher order random fields

Here, we present an approach to segment vehicle tracks in coherent change detection images, a product of combining two synthetic aperture radar images taken at different times. The approach uses multiscale higher order random field models to capture track statistics, such as curvatures and their parallel nature, that are not currently utilized in existing methods. These statistics are encoded as 3-by-3 patterns at different scales. The model can complete disconnected tracks often caused by sensor noise and various environmental effects. Coupling the model with a simple classifier, our approach is effective at segmenting salient tracks. We improve the F-measure on a standard vehicle track data set to 0.963, up from 0.897 obtained by the current state-of-the-art method.

97 MATHEMATICS AND COMPUTING↗

An analytical model of the large neutral regions during the late stage of reionization

In this paper, we investigate the nature and distribution of large neutral regions during the late epoch of reionization. In the 'bubble model' of reionization, the mass distribution of large ionized regions ('bubbles') during the early stage of reionization is obtained by using the excursion set model, where the ionization of a region corresponds to the first up-crossing of a barrier by random trajectories. We generalize this idea and develop a method to predict the distribution of large-scale neutral regions during the late stage of reionization, taking into account the ionizing background after the percolation of H II regions. The large-scale neutral regions, which we call 'neutral islands', are not individual galaxies or minihalos, but larger regions where fewer galaxies formed and hence ionized later and they are identified in the excursion set model with the first down-crossings of the island barrier. Assuming that the consumption rate of ionizing background photons is proportional to the surface area of the neutral islands, we obtained the size distribution of the neutral islands. We also take the 'bubbles-in-island' effect into account by considering the conditional probability of up-crossing a bubble barrier after down-crossing the island barrier. We find that this effect is very important. An additional barrier is set to avoid islands being percolated through. We find that there is a characteristic scale for the neutral islands, while the small islands are rapidly swallowed up by the ionizing background; this characteristic scale does not change much as the reionization proceeds.

79 ASTRONOMY AND ASTROPHYSICS↗

Reliability-based optimization under random vibration environment

A methodology of formulating the optimum design problem for structural systems with random parameters and subjected to random vibration as a mathematical programming problem is presented. The proposed method is applied to the optimum design of a cantilever beam with a tip mass and a truss structure supporting a water tank. The excitations are assumed to be Gaussian processes and the geometric and material properties are taken to be normally distributed random variables. The probabilistic constraints are specified for individual failure modes since it is easier to specify the reliability level for each failure mode keeping in view the consequences of failure in that particular mode. The time parameter appearing in the random vibration based constraints is eliminated by replacing the probabilities of failure by suitable upper bounds. The numerical results demonstrate the feasibility and effectiveness of applying the reliability-based design concepts to structures with random parameters and operating in random vibration environment.

Rao, S. S.↗

Improved renormalization group computation of likelihood functions for cosmological data sets

Evaluation of likelihood functions for cosmological large scale structure data sets (including CMB, galaxy redshift surveys, etc.) naturally involves marginalization, i.e., integration, over an unknown underlying random signal field. Recently, I showed how a renormalization group method can be used to carry out this integration efficiently by first integrating out the smallest scale structure, i.e., localized structure on the scale of differences between nearby data cells, then combining adjacent cells in a coarse graining step, then repeating this process over and over until all scales have been integrated. Here I extend the formulation in several ways in order to reduce the prefactor on the method's linear scaling with data set size. The key improvement is showing how to integrate out the difference between specific adjacent cells before summing them in the coarse graining step, compared to the original formulation in which small-scale fluctuations were integrated more generally. I suggest some other improvements in details of the scheme, including showing how to perform the integration around a maximum likelihood estimate for the underlying random field. In the end, an accurate likelihood computation for a million-cell Gaussian test data set runs in two minutes on my laptop, with room for further optimization and straightforward parallelization.

79 ASTRONOMY AND ASTROPHYSICS↗

Distribution of Candida albicans genotypes among family members

Thirty-three families (71 subjects) were screened for the presence of Candida albicans in mouthwash or stool specimens; 12 families (28 subjects) were culture-positive for this yeast. An enrichment procedure provided a twofold increase in the recovery of C. albicans from mouthwash specimens. Nine of the twelve culture-positive families had two positive members each, two families had three positive members each, and one family had four positive members. Genetic profiles were obtained by three methods: pulsed-field gel electrophoresis; restriction endonuclease analysis, and random amplification of polymorphic DNA analysis. DNA fingerprinting of C. albicans isolated from one body site three consecutive times revealed that each of the 12 families carried a distinct genotype. No two families shared the same strain, and two or more members of a family commonly shared the same strain. Intrafamily genotypic identity (i.e., each member within the family harbored the same strain) was demonstrated in six families. Genotypes of isolates from husband and wife differed from one another in five families. All three methods were satisfactory in determining genotypes; however, we concluded that restriction endonuclease analysis provided adequate resolving power.

NASA Center JSC↗

Randomized, Double-Blinded, Placebo-Controlled, Trial of Risedronate for the Prevention of Bone Mineral Density Loss in Nonmetastatic Prostate Cancer Patients Receiving Radiation Therapy Plus Androgen Deprivation Therapy

Purpose: Androgen deprivation therapy (ADT) has been used as an adjuvant treatment to radiation therapy (RT) for the management of locally advanced prostate carcinoma. Long-term ADT decreases bone mineral density (BMD) and increases the risk of osteoporosis. The objective of this clinical trial was to evaluate the efficacy of risedronate for the prevention of BMD loss in nonmetastatic prostate cancer patients undergoing RT plus 2 to 3 years of ADT. Methods and Materials: A double-blinded, placebo-controlled, randomized trial was conducted for nonmetastatic prostate cancer patients receiving RT plus 2 to 3 years of ADT. All had T scores > −2.5 on dual energy x-ray absorptiometry at baseline. Patients were randomized 1:1 between risedronate and placebo for 2 years. The primary endpoints were the percent changes in the BMD of the lumbar spine at 1 and 2 years from baseline, measured by dual energy x-ray absorptiometry. Analyses of the changes in BMD and bone turnover biomarkers were carried out by comparing mean values of the intrapatient changes between the 2 arms, using standard t tests. Results: One hundred four patients were accrued between 2004 and 2007, with 52 in each arm. Mean age was 66.8 and 67.5 years for the placebo and risedronate, respectively. At 1 and 2 years, mean (±SE) BMD of the lumbar spine decreased by 5.77% ± 4.66% and 13.55% ± 6.33%, respectively, in the placebo, compared with 0.12% ± 1.29% at 1 year (P=.2485) and 0.85% ± 1.56% (P=.0583) at 2 years in the risedronate. The placebo had a significant increase in serum bone turnover biomarkers compared with the risedronate. Conclusions: Weekly oral risedronate prevented BMD loss at 2 years and resulted in significant suppression of bone turnover biomarkers for 24 months for patients receiving RT plus 2 to 3 years of ADT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Statistical uncertainty of eddy covariance CO 2 fluxes inferred using a residual bootstrap approach

High-frequency eddy-covariance measurements of net ecosystem CO 2 exchange (NEE) with the atmosphere are valuable resources for model parameterization, calibration, and validation. However, uncertainties in measured data, i.e., data gaps and inherent random errors, create problems for researchers attempting to quantify uncertainties in model projections of terrestrial ecosystem carbon cycling. Here, we demonstrate that a model-data fusion method (residual bootstrap) produces defensible annual NEE sums, through mimicking the behavior of random errors, filling missing values, and simulating gap-filling biases. This study estimated annual NEE sums for 53 site-years based on nine eddy-covariance tower sites in the USA, and found that our annual estimates were, in most cases, comparable in magnitude with those obtained from AmeriFlux gap-filled data. Additionally, compared to the AmeriFlux standardized gap-filling, our approach provides better NEE estimates for moderate to longer, and more frequent, data gaps. Annual accumulated uncertainties in NEE at the 95% confidence level were ±30gCm -2 year -1 for evergreen needleleaf forests; ±60gCm -2 year -1 for deciduous broadleaf forests; and ±80gCm -2 year -1 for croplands. The residual bootstrap performed worst when gap length was greater than one month or data exclusion greater than 90% during the growing season, common to other gap-filling techniques. However, this study produced robust results for most site years when monthly data coverage during the growing season is not extremely low. We therefore suggest that the inclusion of NEE uncertainty estimates and better estimation for moderate to longer, and more frequent, data gaps as provided by the residual bootstrap approach can be beneficial for ecosystem model evaluation.

54 ENVIRONMENTAL SCIENCES↗

Feasibility study of noise analysis methods on virtual thermal reactor subcriticality monitoring

This paper presents the analysis results of Rossi-alpha, cross-correlation, Feynman-alpha, and Feynman difference methods applied to the subcriticality monitoring of nuclear reactors. A thermal spectrum Godiva model has been designed for the analysis of the four methods. This Godiva geometry consists of a spherical core containing the isotopes of H-l, U-235 and U-238, and the H{sub 2}O reflector outside the core. A Monte Carlo code, McCARD, is used in real time mode to generate virtual detector signals to analyze the feasibility of the four methods. The analysis results indicate that the four methods can be used with high accuracy for the continuous monitoring of subcriticality. In addition to that, in order to analyze the impact of the random noise contamination on the accuracy of the noise analysis, the McCARD-generated signals are contaminated with arbitrary noise. It is noticed that, even when the detector signals are contaminated, the four methods can predict the subcriticality with reasonable accuracy. Nonetheless, in order to reduce the adverse impact of the random noise, eight detector signals, rather than a single signal, are generated from the core, one signal from each equally divided eighth part of the core. The preliminary analysis with multiple virtual detector signals indicates that the approach of using many detectors is promising to improve the accuracy of criticality prediction and further study will be performed in this regard. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accelerating Random Forest Classification on GPU and FPGA

Random Forests (RFs) are a commonly used machine learning method for classification and regression tasks spanning a variety of application domains, including bioinformatics, business analytics, and software optimization. While prior work has focused primarily on improving performance of the training of RFs, many applications, such as malware identification, cancer prediction, and banking fraud detection, require fast RF classification. In this work, we accelerate RF classification on GPU and FPGA. In order to provide efficient support for large datasets, we propose a hierarchical memory layout suitable to the GPU/FPGA memory hierarchy. We design three RF classification code variants based on that layout, and we investigate GPU- and FPGA-specific considerations for these kernels. Our experimental evaluation, performed on an Nvidia Xp GPU and on a Xilinx Alveo U250 FPGA accelerator card using publicly available datasets on the scale of millions of samples and tens of features, covers various aspects. First, we evaluate the performance benefits of our hierarchical data structure over the standard compressed sparse row (CSR) format. Second, we compare our GPU implementation with cuML, a machine learning library targeting Nvidia GPUs. Third, we explore the performance/accuracy tradeoff resulting from the use of different tree depths in the RF. Finally, we perform a comparative performance analysis of our GPU and FPGA implementations. Our evaluation shows that for high accuracy targets, our GPU implementation yields 5-9x speedup over CSR, and up to a 2x speedup over cuML.

FPGA, Xilinx FPGA, GPU, Random Forest classificati↗

Machine-learning error models for approximate solutions to parameterized systems of nonlinear equations

Here, this work proposes a machine-learning framework for constructing statistical models of errors incurred by approximate solutions to parameterized systems of nonlinear equations. These approximate solutions may arise from early termination of an iterative method, a lower-fidelity model, or a projection-based reduced-order model, for example. The proposed statistical model comprises the sum of a deterministic regression-function model and a stochastic noise model. The method constructs the regression-function model by applying regression techniques from machine learning (e.g., support vector regression, artificial neural networks) to map features (i.e., error indicators such as sampled elements of the residual) to a prediction of the approximate-solution error. The method constructs the noise model as a mean-zero Gaussian random variable whose variance is computed as the sample variance of the approximate-solution error on a test set; this variance can be interpreted as the epistemic uncertainty introduced by the approximate solution. This work considers a wide range of feature-engineering methods, data-set-construction techniques, and regression techniques that aim to ensure that (1) the features are cheaply computable, (2) the noise model exhibits low variance (i.e., low epistemic uncertainty introduced), and (3) the regression model generalizes to independent test data. Finally, numerical experiments performed on several computational-mechanics problems and types of approximate solutions demonstrate the ability of the method to generate statistical models of the error that satisfy these criteria and significantly outperform more commonly adopted approaches for error modeling.

97 MATHEMATICS AND COMPUTING↗

Stochastic gradient descent algorithm for stochastic optimization in solving analytic continuation problems

We propose a stochastic gradient descent based optimization algorithm to solve the analytic continuation problem in which we extract real frequency spectra from imaginary time Quantum Monte Carlo data. The procedure of analytic continuation is an ill-posed inverse problem which is usually solved by regularized optimization methods, such like the Maximum Entropy method, or stochastic optimization methods. The main contribution of this work is to improve the performance of stochastic optimization approaches by introducing a supervised stochastic gradient descent algorithm to solve a flipped inverse system which processes the random solutions obtained by a type of Fast and Efficient Stochastic Optimization Method.

97 MATHEMATICS AND COMPUTING↗

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by semi-randomly varying routing policies for different packets

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robin basis, selected by generating a random number, or otherwise varied.

Archer, Charles Jens↗