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 163 records · Page 9

Adaptive Data-Driven Deep-Learning Surrogate Model for Frontal Polymerization in Dicyclopentadiene

Frontal polymerization (FP) is a self-sustaining curing process that enables rapid and energy-efficient manufacturing of thermoset polymers and composites. Computational methods conventionally used to simulate the FP process are time-consuming, and repeating simulations are required for sensitivity analysis, uncertainty quantification, or optimization of the manufacturing process. Here, in this work, we develop an adaptive surrogate deep-learning model for FP of dicyclopentadiene (DCPD), which predicts the evolution of temperature and degree of cure orders of magnitude faster than the finite-element method (FEM). The adaptive algorithm provides a strategy to select training samples efficiently and save computational costs by reducing the redundancy of FEM-based training samples. The adaptive algorithm calculates the residual error of the FP governing equations using automatic differentiation of the deep neural network. A probability density function expressed in terms of the residual error is used to select training samples from the Sobol sequence space. The temperature and degree of cure evolution of each training sample are obtained by a 2D FEM simulation. The adaptive method is more efficient and has a better prediction accuracy than the random sampling method. With the well-trained surrogate neural network, the FP characteristics (front speed, shape, and temperature) can be extracted quickly from the predicted temperature and degree-of-cure fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spline approximation of quantile functions

The study reported here explored the development and utility of a spline representation of the sample quantile function of a continuous probability distribution in providing a functional description of a random sample and a method of generating random variables. With a spline representation, the random samples are generated by transforming a sample of uniform random variables to the interval of interest. This is useful, for example, in simulation studies in which a random sample represents the only known information about the distribution. The spline formulation considered here consists of a linear combination of cubic basis splines (B-splines) fit in a least squares sense to the sample quantile function using equally spaced knots. The following discussion is presented in five parts. The first section highlights major results realized from the study. The second section further details the results obtained. The methodology used is described in the third section, followed by a brief discussion of previous research on quantile functions. Finally, the results of the study are evaluated.

Schiess, J. R.↗

Application of GRS method to evaluation of uncertainties of calculation parameters of perspective sodium-cooled fast reactor

A number of recent studies have been devoted to the estimation of errors of reactor calculation parameters by the GRS (Generation Random Sampled) method. This method is based on direct sampling input data resulting in formation of random sets of input parameters which are used for multiple calculations. Once these calculations are performed, statistical processing of the calculation results is carried out to determine the mean value and the variance of each calculation parameter of interest. In our study this method is used for estimation of errors of calculation parameters (K{sub eff}, power density, dose rate) of a perspective sodium-cooled fast reactor. Neutron transport calculations were performed by the nodal diffusion code TRIGEX and Monte Carlo code MMK. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A simulation study on chaotic behavior of light propagation in graded index fiber under random perturbation

Chaotic behavior of optical rays in a graded index fiber is studied with the help of nonlinear dynamical method under random perturbation of refractive index. The study indicates that behavior of the rays evolves from regular to chaotic due to the random perturbation. This causes irregularity of propagation of the rays in the graded index fiber, and then the performance of the fiber is reduced.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Self-correcting random number generator

A system and method for generating random numbers. The system may include a random number generator (RNG), such as a quantum random number generator (QRNG) configured to self-correct or adapt in order to substantially achieve randomness from the output of the RNG. By adapting, the RNG may generate a random number that may be considered random regardless of whether the random number itself is tested as such. As an example, the RNG may include components to monitor one or more characteristics of the RNG during operation, and may use the monitored characteristics as a basis for adapting, or self-correcting, to provide a random number according to one or more performance criteria.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers

We present Q-SASS, a quasi-Newton method for unconstrained stochastic optimization that does not rely on common random numbers. Most existing quasi-Newton approaches leverage common random numbers to construct second-order updates. However, motivated by challenges in variational quantum algorithms—where such coordination is not possible—we consider the setting in which function values and gradients are accessible only through noisy probabilistic zeroth- and first-order oracles, and no common random numbers can be exploited. We derive high-probability tail bounds on the iteration complexity of our algorithm for nonconvex, convex, and strongly convex (more generally, those satisfying the PL condition) objective functions. Finally, we demonstrate the empirical benefits of our quasi-Newton updating scheme on both synthetic and quantum chemistry problems.

Complexity bound↗

Development of random geometry capability in RMC code for explicit analysis of polytype particle/pebble - 18493

Monte Carlo method plays an important role in accurate simulation of High Temperature Gas-Cooled Reactors (HTR) and molten salt reactors, owing to its advantages of the flexible geometry modeling and the use of continuous-energy nuclear cross sections. For the innovative design of pebble bed, prism HTRs and molten salt reactors, there may be more than one kind of particles or pebbles in the system, such as the burnable poison particles, graphite pebbles or fuel pebbles with different enrichments. Different treatments have been used to deal with the double-heterogeneous geometry of these reactors. In some researches, the particle distributions in stochastic media are assumed the regular lattice, while in the others, the explicit packing methods such as Random Sequential Addition (RSA) and Discrete Element Method (DEM) are used, by generating the random coordinates of the particles/pebbles. However, traditional geometry with repeated structure has difficulties in explicit modeling polytype particle/pebble, due to the arbitrary packing fractions of different kinds of particles or pebbles. Although, packing methods such as Random Sequential Addition (RSA) and Discrete Element Method (DEM) could solve the polytype particle/pebble problems to some extent, but these methods are troublesome in geometry modeling and time consuming. In this paper, a new Random Universe Geometry method was developed and implemented in Monte Carlo code RMC, for explicit analysis of polytype particle/pebble in double heterogeneous geometry systems, such as HTRs and molten salt reactors. This method was applied to constructed mixed particles/pebbles problems and also simplified HTR-10 full core problem to test the feasibility, and the results show that the random geometry modeling can provide explicit packing fraction of different kinds of particles or pebbles. The results are also compared with that calculated by RSA method and regular structure, and agree quite well. This work would provide an effective tool for the innovative design of pebble bed, prism HTRs and molten salt reactors with polytype particles or pebbles using Monte Carlo method. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Voice Quality After Treatment of Early Vocal Cord Cancer: A Randomized Trial Comparing Laser Surgery With Radiation Therapy

Objective: Early laryngeal cancer is usually treated with either transoral laser surgery or radiation therapy. The quality of voice achieved with these treatments has not been compared in a randomized trial. Methods and Materials: Male patients with carcinoma limited to 1 mobile vocal cord (T1aN0M0) were randomly assigned to receive either laser surgery (n=32) or external beam radiation therapy (n=28). Surgery consisted of tumor excision with a CO{sub 2} laser with the patient under general anaesthesia. External beam radiation therapy to the larynx was delivered to a cumulative dose of 66 Gy in 2-Gy daily fractions over 6.5 weeks. Voice quality was assessed at baseline and 6 and 24 months after treatment. The main outcome measures were expert-rated voice quality on a grade, roughness, breathiness, asthenia, and strain (GRBAS) scale, videolaryngostroboscopic findings, and the patients' self-rated voice quality and its impact on activities of daily living. Results: Overall voice quality between the groups was rated similar, but voice was more breathy and the glottal gap was wider in patients treated with laser surgery than in those who received radiation therapy. Patients treated with radiation therapy reported less hoarseness-related inconvenience in daily living 2 years after treatment. Three patients in each group had local cancer recurrence within 2 years from randomization. Conclusions: Radiation therapy may be the treatment of choice for patients whose requirements for voice quality are demanding. Overall voice quality was similar in both treatment groups, however, indicating a need for careful consideration of patient-related factors in the choice of a treatment option.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Randomization-Based, Zero-Trust Cyberattack Detection Method for Hierarchical Systems

This paper demonstrates a novel randomization-based approach for verifying power system control signals with application to detecting cyberattacks. We consider fully connected hierarchical systems containing multiple local agents and a global "trust" agent. The global agent uses a time-varying randomized assignment scheme to identify corrupt network links based on principles of zero trust and majority rule. To evaluate the performance of this detection approach, we implement our algorithm in MATLAB and run it against nearly 43 million unique attack scenarios spanning a range of system sizes. For each scenario, the algorithm determines whether the identified corruptions satisfy a set of validity constraints reflecting network topology and uses that result to say whether the recovered state value for one or more local agents is malicious. We compare the algorithm's determination to the true state of the system to assess performance and find that classification accuracy converges to 100% as system size increases, suggesting that the validity constraints become more difficult to satisfy for larger systems. We further explore the scenarios that evade detection to understand practical implications for employing this detection approach.

cybersecurity↗

Signal-Preserving Erratic Noise Attenuation via Iterative Robust Sparsity-Promoting Filter

Sparse domain thresholding filters operating in a sparse domain are highly effective in removing Gaussian random noise under Gaussian distribution assumption. Erratic noise, which designates non-Gaussian noise that consists of large isolated events with known or unknown distribution, also needs to be explicitly taken into account. However, conventional sparse domain thresholding filters based on the least-squares (LS) criterion are severely sensitive to data with high-amplitude and non-Gaussian noise, i.e., the erratic noise, which makes the suppression of this type of noise extremely challenging. Here, in this paper, we present a robust sparsity-promoting denoising model, in which the LS criterion is replaced by the Huber criterion to weaken the effects of erratic noise. The random and erratic noise is distinguished by using a data-adaptive parameter in the presented method, where random noise is described by mean square, while the erratic noise is downweighted through a damped weight. Different from conventional sparse domain thresholding filters, definition of the misfit between noisy data and recovered signal via the Huber criterion results in a nonlinear optimization problem. With the help of theoretical pseudoseismic data, an iterative robust sparsity-promoting filter is proposed to transform the nonlinear optimization problem into a linear LS problem through an iterative procedure. The main advantage of this transformation is that the nonlinear denoising filter can be solved by conventional LS solvers. Lastly, tests with several data sets demonstrate that the proposed denoising filter can successfully attenuate the erratic noise without damaging useful signal when compared with conventional denoising approaches based on the LS criterion.

97 MATHEMATICS AND COMPUTING↗

Convergence acceleration of Monte Carlo many-body perturbation methods by direct sampling

In the Monte Carlo many-body perturbation (MC-MP) method, the conventional correlation-correction formula, which is a long sum of products of low-dimensional integrals, is first recast into a short sum of high-dimensional integrals over electron-pair and imaginary-time coordinates. These high-dimensional integrals are then evaluated by the Monte Carlo method with random coordinates generated by the Metropolis–Hasting algorithm according to a suitable distribution. The latter algorithm, while advantageous in its ability to sample nearly any distribution, introduces autocorrelation in sampled coordinates, which in turn increases the statistical uncertainty of the integrals and thus the computational cost. It also involves wasteful rejected moves and an initial “burn-in” step as well as displays hysteresis. Here, an algorithm is proposed that directly produces a random sequence of electron-pair coordinates for the same distribution used in the MC-MP method, which is free from autocorrelation, rejected moves, a burn-in step, or hysteresis. Furthermore, this direct-sampling algorithm is shown to accelerate second- (MC-MP2) and third-order Monte Carlo many-body perturbation (MC-MP3) calculations by up to 222% and 38%, respectively.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Methods for semi-automated indexing for high precision information retrieval

OBJECTIVE: To evaluate a new system, ISAID (Internet-based Semi-automated Indexing of Documents), and to generate textbook indexes that are more detailed and more useful to readers. DESIGN: Pilot evaluation: simple, nonrandomized trial comparing ISAID with manual indexing methods. Methods evaluation: randomized, cross-over trial comparing three versions of ISAID and usability survey. PARTICIPANTS: Pilot evaluation: two physicians. Methods evaluation: twelve physicians, each of whom used three different versions of the system for a total of 36 indexing sessions. MEASUREMENTS: Total index term tuples generated per document per minute (TPM), with and without adjustment for concordance with other subjects; inter-indexer consistency; ratings of the usability of the ISAID indexing system. RESULTS: Compared with manual methods, ISAID decreased indexing times greatly. Using three versions of ISAID, inter-indexer consistency ranged from 15% to 65% with a mean of 41%, 31%, and 40% for each of three documents. Subjects using the full version of ISAID were faster (average TPM: 5.6) and had higher rates of concordant index generation. There were substantial learning effects, despite our use of a training/run-in phase. Subjects using the full version of ISAID were much faster by the third indexing session (average TPM: 9.1). There was a statistically significant increase in three-subject concordant indexing rate using the full version of ISAID during the second indexing session (p < 0.05). SUMMARY: Users of the ISAID indexing system create complex, precise, and accurate indexing for full-text documents much faster than users of manual methods. Furthermore, the natural language processing methods that ISAID uses to suggest indexes contributes substantially to increased indexing speed and accuracy.

Evaluation Studies↗

Tortuosity Computations of Porous Materials using the Direct Simulation Monte Carlo

Low-density carbon fiber preforms, used as thermal protection systems (TPS) materials for planetary entry systems, have permeable, highly porous microstructures consisting of interlaced fibers. Internal gas transport in TPS is important in modeling the penetration of hot boundary-layer gases and the in-depth transport of pyrolysis and ablation products. The gas effective diffusion coefficient of a porous material must be known before the gas transport can be modeled in material response solvers; however, there are very little available data for rigid fibrous insulators used in heritage TPS.The tortuosity factor, which reflects the efficiency of the percolation paths, can be computed from the effective diffusion coefficient of a gas inside a porous material and is based on the micro-structure of the material. It is well known, that the tortuosity factor is a strong function of the Knudsen number. Due to the small characteristic scales of porous media used in TPS applications (typical pore size of the order of 50 micron), the transport of gases can occur in the rarefied and transitional regimes, at Knudsen numbers above 1. A proper way to model the gas dynamics at these conditions consists in solving the Boltzmann equation using particle-based methods that account for movement and collisions of atoms and molecules.In this work we adopt, for the first time, the Direct Simulation Monte Carlo (DSMC) method to compute the tortuosity factor of fibrous media in the rarefied regime. To enable realistic simulations of the actual transport of gases in the porous medium, digitized computational grids are obtained from X-ray micro-tomography imaging of real TPS materials. The SPARTA DSMC solver is used for simulations. Effective diffusion coefficients and tortuosity factors are obtained by computing the mean-square displacement of diffusing particles.We first apply the method to compute the tortuosity factors as a function of the Knudsen number for computationally designed materials such as random cylindrical fibers and packed bed of spheres with prescribed porosity. Results are compared to literature values obtained using random walk methods in the rarefied and transitional regime and a finite-volume method for the continuum regime. We then compute tortuosity factors for a real carbon fiber material with a transverse isotropic structure (FiberForm), quantifying differences between through-thickness and in-plain tortuosities at various Knudsen regimes.

Tortuosity↗

Fast yaw optimization for wind plant wake steering using Boolean yaw angles

Abstract. In wind plants, turbines can be yawed into the wind to steer their wakes away from downstream turbines and achieve an overall increase in plant power. Mathematical optimization is typically used to determine the best yaw angles at which to operate the turbines in a plant. In this paper, we present a new heuristic to rapidly determine the yaw angles in a wind plant. In this method, we define the turbine yaw angles as Boolean – either yawed at a predefined angle or nonyawed – as opposed to the typical methods of defining yaw angles as continuous or with fine discretizations. We then optimize which turbines should be yawed with an algorithm that sweeps through the turbines from the most upstream to the most downstream. We demonstrate that our new Boolean optimization method can find turbine yaw angles that perform well compared to a traditionally used gradient-based optimizer for which the yaw angles are defined as continuous. There is less than 0.6 % difference in the optimized power between the two optimization methods for randomly placed turbine layouts and less than a 0.6 % difference in the optimal annual energy production between the two optimization methods for a real wind farm. Additionally, we show that our new method is much more computationally efficient than the traditional method. For plants with nonzero optimal yaw angles, our new method is generally able to solve for the turbine yaw angles 50–150 times faster, and in some extreme cases up to 500 times faster, than the traditional method.

17 WIND ENERGY↗

Probabilistic structural mechanics research for parallel processing computers

Aerospace structures and spacecraft are a complex assemblage of structural components that are subjected to a variety of complex, cyclic, and transient loading conditions. Significant modeling uncertainties are present in these structures, in addition to the inherent randomness of material properties and loads. To properly account for these uncertainties in evaluating and assessing the reliability of these components and structures, probabilistic structural mechanics (PSM) procedures must be used. Much research has focused on basic theory development and the development of approximate analytic solution methods in random vibrations and structural reliability. Practical application of PSM methods was hampered by their computationally intense nature. Solution of PSM problems requires repeated analyses of structures that are often large, and exhibit nonlinear and/or dynamic response behavior. These methods are all inherently parallel and ideally suited to implementation on parallel processing computers. New hardware architectures and innovative control software and solution methodologies are needed to make solution of large scale PSM problems practical.

Sues, Robert H.↗

Low or High Fractionation Dose {beta}-Radiotherapy for Pterygium? A Randomized Clinical Trial

Purpose: Postoperative adjuvant treatment using {beta}-radiotherapy (RT) is a proven technique for reducing the recurrence of pterygium. A randomized trial was conducted to determine whether a low fractionation dose of 2 Gy within 10 fractions would provide local control similar to that after a high fractionation dose of 5 Gy within 7 fractions for surgically resected pterygium. Methods: A randomized trial was conducted in 200 patients (216 pterygia) between February 2006 and July 2007. Only patients with fresh pterygium resected using a bare sclera method and given RT within 3 days were included. Postoperative RT was delivered using a strontium-90 eye applicator. The pterygia were randomly treated using either 5 Gy within 7 fractions (Group 1) or 2 Gy within 10 fractions (Group 2). The local control rate was calculated from the date of surgery. Results: Of the 216 pterygia included, 112 were allocated to Group 1 and 104 to Group 2. The 3-year local control rate for Groups 1 and 2 was 93.8% and 92.3%, respectively (p = .616). A statistically significant difference for cosmetic effect (p = .034), photophobia (p = .02), irritation (p = .001), and scleromalacia (p = .017) was noted in favor of Group 2. Conclusions: No better local control rate for postoperative pterygium was obtained using high-dose fractionation vs. low-dose fractionation. However, a low-dose fractionation schedule produced better cosmetic effects and resulted in fewer symptoms than high-dose fractionation. Moreover, pterygia can be safely treated in terms of local recurrence using RT schedules with a biologic effective dose of 24-52.5 Gy{sub 10.}.

62 RADIOLOGY AND NUCLEAR MEDICINE↗