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 109 records · Page 6

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↗

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↗

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↗

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↗

An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization

In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton method is considered to solve constrained optimization problems. In particular, dynamic optimization problems, which are known to be highly expensive, are the focus. A memory efficient semismooth Newton algorithm is introduced for these problems. The source of efficiency and inexactness is the randomized matrix sketching. Further, applications to optimization problems constrained by partial differential equations are also considered.

97 MATHEMATICS AND COMPUTING↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hyperspectral Image Classification Using Graph Clustering Methods

Hyperspectral imagery is a challenging modality due to the dimension of the pixels which can range from hundreds to over a thousand frequencies depending on the sensor. Most methods in the literature reduce the dimension of the data using a method such as principal component analysis, however this procedure can lose information. More recently methods have been developed to address classification of large datasets in high dimensions. This paper presents two classes of graph-based classification methods for hyperspectral imagery. Using the full dimensionality of the data, we consider a similarity graph based on pairwise comparisons of pixels. The graph is segmented using a pseudospectral algorithm for graph clustering that requires information about the eigenfunctions of the graph Laplacian but does not require computation of the full graph. We develop a parallel version of the Nyström extension method to randomly sample the graph to construct a low rank approximation of the graph Laplacian. With at most a few hundred eigenfunctions, we can implement the clustering method designed to solve a variational problem for a graph-cut-based semi-supervised or unsupervised classification problem. We implement OpenMP directive-based parallelism in our algorithms and show performance improvement and strong, almost ideal, scaling behavior. The method can handle very large datasets including a video sequence with over a million pixels, and the problem of segmenting a data set into a pre-determined number of classes.

47 OTHER INSTRUMENTATION↗

Simulation of thermal ionization in a dense helium plasma by the Feynman path integral method

The region of equilibrium states is studied where the quantum nature of the electron component and a strong nonideality of a plasma play a key role. The problem of negative signs in the calculation of equilibrium averages a system of indistinguishable quantum particles with a spin is solved in the macroscopic limit. It is demonstrated that the calculation can be conducted up to a numerical result. The complete set of symmetrized basis wave functions is constructed based on the Young symmetry operators. The combinatorial weight coefficients of the states corresponding to different graphs of connected Feynman paths in multiparticle systems are calculated by the method of random walk over permutation classes. The kinetic energy is calculated using a viral estimator at a finite pressure in a statistical ensemble with flexible boundaries. Based on the methods developed in the paper, the computer simulation is performed for a dense helium plasma in the temperature range from 30000 to 40000 K. The equation of state, internal energy, ionization degree, and structural characteristic of the plasma are calculated in terms of spatial correlation functions. The parameters of a pseudopotential plasma model are estimated.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Data-Driven Digital Twin for Reliability Assessment of DC/DC Buck Converter

In commercial applications, the operation of DC/DC converters significantly impacts overall system performance and long-term reliability. This study introduces a data-driven digital twin (DT) approach for estimating critical degradation parameters of DC/DC BUCK converter under steady-state condition. Initially, a circuit-level MATLAB/Simulink digital model (DM C ) is refined against a hardware prototype’s switching model dataset using offline particle swarm optimization. The optimized digital model’s steady-state response is then verified with its average model response while varying the duty and load. Subsequently, degradation profiles are imposed on the inductor, capacitor, MOSFET in the DMC. A large dataset is generated from this model, allowing training, validation, and testing of machine learning (ML) models for component health regression tasks. The proposed method employs random forest ML models, achieving impressive regression results with a squared R value as high as 0.99978 and a root mean square error of 4.2× 10 –6 . The method is further validated on a medium power level DC/DC BUCK prototype with varying load conditions, and includes the analysis of MOSFET’s on-resistance under degradation conditions. This data-driven DT method shows promise for identifying parasitic degradation and ohmic loss parameters, enhancing converter reliability assessments in a non-invasive, generalized, and computationally efficient manner.

14 SOLAR ENERGY↗