Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized 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 739 records · Page 41

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↗

Construction of Women’s All-Around Speed Skating Event Performance Prediction Model and Competition Strategy Analysis Based on Machine Learning Algorithms

Introduction Accurately predicting the competitive performance of elite athletes is an essential prerequisite for formulating competitive strategies. Women’s all-around speed skating event consists of four individual subevents, and the competition system is complex and challenging to make accurate predictions on their performance. Objective The present study aims to explore the feasibility and effectiveness of machine learning algorithms for predicting the performance of women’s all-around speed skating event and provide effective training and competition strategies. Methods The data, consisting of 16 seasons of world-class women’s all-around speed skating competition results, used in the present study came from the International Skating Union (ISU). According to the competition rules, distinct features are filtered using lasso regression, and a 5,000 m race model and a medal model are built using a fivefold cross-validation method. Results The results showed that the support vector machine model was the most stable among the 5,000 m race and the medal models, with the highest AUC (0.86, 0.81, respectively). Furthermore, 3,000 m points are the main characteristic factors that decide whether an athlete can qualify for the final. The 11th lap of the 5,000 m, the second lap of the 500 m, and the fourth lap of the 1,500 m are the main characteristic factors that affect the athlete’s ability to win medals. Conclusion Compared with logistic regression, random forest, K-nearest neighbor, naive Bayes, neural network, support vector machine is a more viable algorithm to establish the performance prediction model of women’s all-around speed skating event; excellent performance in the 3,000 m event can facilitate athletes to advance to the final, and athletes with outstanding performance in the 500 m event are more likely competitive for medals.

Liu, Meng↗

Quantum error mitigation by Pauli check sandwiching

Abstract We describe and analyze an error mitigation technique that uses multiple pairs of parity checks to detect the presence of errors. Each pair of checks uses one ancilla qubit to detect a component of the error operator and represents one layer of the technique. We build on the results on extended flag gadgets and put it on a firm theoretical foundation. We prove that this technique can recover the noiseless state under the assumption of noise not affecting the checks. The method does not incur any encoding overhead and instead chooses the checks based on the input circuit. We provide an algorithm for obtaining such checks for an arbitrary target circuit. Since the method applies to any circuit and input state, it can be easily combined with other error mitigation techniques. We evaluate the performance of the proposed methods using extensive numerical simulations on 1850 random input circuits composed of Clifford gates and non-Clifford single-qubit rotations, a class of circuits encompassing most commonly considered variational algorithm circuits. We observe average improvements in fidelity of 34 percentage points with six layers of checks.

97 MATHEMATICS AND COMPUTING↗

Implementation of Dynamic Extensible Adaptive Locally Exchangeable Measures (IDEALEM) v 0.1

Handling large streaming data is essential for various applications such as network traffic analysis, social networks, energy cost trends, and environment modeling. However, it is in general intractable to store, compute, search, and retrieve large streaming data. This software addresses a fundamental issue, which is to reduce the size of large streaming data and still obtain accurate statistical analysis. As an example, when a high-speed network such as 100 Gbps network is monitored, the collected measurement data rapidly grows so that polynomial time algorithms (e.g., Gaussian processes) become intractable. One possible solution to reduce the storage of vast amounts of measured data is to store a random sample, such as one out of 1000 network packets. However, such static sampling methods (linear sampling) have drawbacks: (1) it is not scalable for high-rate streaming data, and (2) there is no guarantee of reflecting the underlying distribution. In this software, we implemented a dynamic sampling algorithm, based on the recent technology from the relational dynamic bayesian online locally exchangeable measures, that reduces the storage of data records in a large scale, and still provides accurate analysis of large streaming data. The software can be used for both online and offline data records.

Sim, Alex↗

Estimating basis functions in massive fields under the spatial mixed effects model

Abstract Spatial prediction is commonly achieved under the assumption of a Gaussian random field by obtaining maximum likelihood estimates of parameters, and then using the kriging equations to arrive at predicted values. For massive datasets, fixed rank kriging using the expectation–maximization algorithm for estimation has been proposed as an alternative to the usual but computationally prohibitive kriging method. The method reduces computation cost of estimation by redefining the spatial process as a linear combination of basis functions and spatial random effects. A disadvantage of this method is that it imposes constraints on the relationship between the observed locations and the knots. We develop an alternative method that utilizes the spatial mixed effects model, but allows for additional flexibility by estimating the range of the spatial dependence between the observations and the knots via an alternating expectation conditional maximization algorithm. Experiments show that our methodology improves estimation without sacrificing prediction accuracy while also minimizing the additional computational burden of extra parameter estimation. The methodology is applied to a temperature dataset archived by the United States National Climate Data Center, with improved results over previous methodology.

Pazdernik, Karl↗

A stochastic multiscale framework for modeling flow through random heterogeneous porous media

Flow through porous media is ubiquitous, occurring from large geological scales down to the microscopic scales. Several critical engineering phenomena like contaminant spread, nuclear waste disposal and oil recovery rely on accurate analysis and prediction of these multiscale phenomena. Such analysis is complicated by inherent uncertainties as well as the limited information available to characterize the system. Any realistic modeling of these transport phenomena has to resolve two key issues: (i) the multi-length scale variations in permeability that these systems exhibit, and (ii) the inherently limited information available to quantify these property variations that necessitates posing these phenomena as stochastic processes. A stochastic variational multiscale formulation is developed to incorporate uncertain multiscale features. A stochastic analogue to a mixed multiscale finite element framework is used to formulate the physical stochastic multiscale process. Recent developments in linear and non-linear model reduction techniques are used to convert the limited information available about the permeability variation into a viable stochastic input model. An adaptive sparse grid collocation strategy is used to efficiently solve the resulting stochastic partial differential equations (SPDEs). The framework is applied to analyze flow through random heterogeneous media when only limited statistics about the permeability variation are given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A method for online verification of adapted fields using an independent dose monitor

Purpose: Clinical implementation of online adaptive radiotherapy requires generation of modified fields and a method of dosimetric verification in a short time. We present a method of treatment field modification to account for patient setup error, and an online method of verification using an independent monitoring system.Methods: The fields are modified by translating each multileaf collimator (MLC) defined aperture in the direction of the patient setup error, and magnifying to account for distance variation to the marked isocentre. A modified version of a previously reported online beam monitoring system, the integral quality monitoring (IQM) system, was investigated for validation of adapted fields. The system consists of a large area ion-chamber with a spatial gradient in electrode separation to provide a spatially sensitive signal for each beam segment, mounted below the MLC, and a calculation algorithm to predict the signal. IMRT plans of ten prostate patients have been modified in response to six randomly chosen setup errors in three orthogonal directions.Results: A total of approximately 49 beams for the modified fields were verified by the IQM system, of which 97% of measured IQM signal agree with the predicted value to within 2%.Conclusions: The modified IQM system was found to be suitable for online verification of adapted treatment fields.

61 RADIATION PROTECTION AND DOSIMETRY↗

Assessment of three dead detector correction methods for cone-beam computed tomography

Purpose: Dead detectors due to manufacturing defects or radiation damage in the electronic portal imaging devices (EPIDs) used for cone-beam computed tomography (CBCT) can lead to image degradation and ring artifacts. In this work three dead detector correction methods were assessed using megavoltage CBCT (MVCBCT) as a test system, with the goals of assessing the relative effectiveness of the three methods and establishing the conditions for which they fail. Methods: MVCBCT projections acquired with four linacs at 8 and 60 MU (monitor units) were degraded with varying percentages (2%-95%) of randomly distributed dead single detectors (RDSs), randomly distributed dead detector clusters (RDCs) of 2 mm diameter, and nonrandomly distributed dead detector disks (NRDDs) of varying diameter (4-16 mm). Correction algorithms were bidirectional linear interpolation (BLI), quad-directional linear interpolation (QLI), and a Laplacian solution (LS) method. Correction method failure was defined to occur if ring artifacts were present in the reconstructed phantom images from any linac or if the modulation transfer function (MTF) for any linac dropped below baseline with a p value, calculated with the two sample t test, of less than 0.01. Results: All correction methods failed at the same or lower RDC/RDS percentages and NRDD diameters for the 60 MU as for the 8 MU cases. The LS method tended to outperform or match the BLI and QLI methods. If ring artifacts anywhere in the images were considered unacceptable, the LS method failed for 60 MU at >33% RDS, >2% RDC, and >4 mm NRDD. If ring artifacts within 4 mm longitudinally of the phantom section interfaces were considered acceptable, the LS method failed for 60 MU at >90% RDS, >80% RDC, and >4 mm NRDD. LS failed due to MTF drop for 60 MU at >50% RDS, >25% RDC, and >4 mm NRDD. Conclusions: The LS method is superior to the BLI and QLI methods, and correction algorithm effectiveness decreases as imaging dose increases. All correction methods failed first due to ring artifacts and second due to MTF drop. If ring artifacts in axial slices within a 4 mm longitudinal distance from phantom section interfaces are acceptable, statistically significant loss in spatial resolution does not occur until over 25% of the EPID is covered in randomly distributed dead detectors, or NRDDs of 4 mm diameter are present.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Development of tight-binding based GW algorithm and its computational implementation for graphene

Graphene has been a hot subject of research in the last decade as it holds a promise for various applications. One interesting issue is whether or not graphene should be classified into a strongly or weakly correlated system, as the optical properties may change upon several factors, such as the substrate, voltage bias, adatoms, etc. As the Coulomb repulsive interactions among electrons can generate the correlation effects that may modify the single-particle spectra (density of states) and the two-particle spectra (optical conductivity) of graphene, we aim to explore such interactions in this study. The understanding of such correlation effects is important because eventually they play an important role in inducing the effective attractive interactions between electrons and holes that bind them into excitons. We do this study theoretically by developing a GW method implemented on the basis of the tight-binding (TB) model Hamiltonian. Unlike the well-known GW method developed within density functional theory (DFT) framework, our TB-based GW implementation may serve as an alternative technique suitable for systems which Hamiltonian is to be constructed through a tight-binding based or similar models. This study includes theoretical formulation of the Green’s function G, the renormalized interaction function W from random phase approximation (RPA), and the corresponding self energy derived from Feynman diagrams, as well as the development of the algorithm to compute those quantities. As an evaluation of the method, we perform calculations of the density of states and the optical conductivity of graphene, and analyze the results.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Intrepid MCMC: Metropolis-Hastings with exploration

In engineering examples, one often encounters the need to sample from unnormalized distributions with complex shapes that may also be implicitly defined through a physical or numerical simulation model, making it computationally expensive to evaluate the associated density function. For such cases, MCMC has proven to be an invaluable tool. Random-walk Metropolis Methods (also known as Metropolis-Hastings (MH)), in particular, are highly popular for their simplicity, flexibility, and ease of implementation. However, most MH algorithms suffer from significant limitations when attempting to sample from distributions with multiple modes (particularly disconnected ones). Here, in this paper, we present Intrepid MCMC - a novel MH scheme that utilizes a simple coordinate transformation to significantly improve the mode-finding ability and convergence rate to the target distribution of random-walk Markov chains while retaining most of the simplicity of the vanilla MH paradigm. Through multiple examples, we showcase the improvement in the performance of Intrepid MCMC over vanilla MH for a wide variety of target distribution shapes. We also provide an analysis of the mixing behavior of the Intrepid Markov chain, as well as the efficiency of our algorithm for increasing dimensions. A thorough discussion is presented on the practical implementation of the Intrepid MCMC algorithm. Finally, its utility is highlighted through a Bayesian parameter inference problem for a two-degree-of-freedom oscillator under free vibration.

97 - MATHEMATICS AND COMPUTING↗

Online technique for detecting state of onboard fiber optic gyroscope

Although angle random walk (ARW) of fiber optic gyroscope (FOG) has been well modeled and identified before being integrated into the high-accuracy attitude control system of satellite, aging and unexpected failures can affect the performance of FOG after launch, resulting in the variation of ARW coefficient. Therefore, the ARW coefficient can be regarded as an indicator of “state of health” for FOG diagnosis in some sense. The Allan variance method can be used to estimate ARW coefficient of FOG, however, it requires a large amount of data to be stored. Moreover, the procedure of drawing slope lines for estimation is painful. To overcome the barriers, a weighted state-space model that directly models the ARW to obtain a nonlinear state-space model was established for FOG. Then, a neural extended-Kalman filter algorithm was implemented to estimate and track the variation of ARW in real time. The results of experiment show that the proposed approach is valid to detect the state of FOG. Moreover, the proposed technique effectively avoids the storage of data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm

Resource management is a hotspot issue in distributed systems like cloud computing (CC). It means how to prepare the computational resources, i.e., servers and virtual machines (VMS), to execute the tasks. This paper offers a new approach based on Group Technology (GT)—known as a powerful philosophy for the resource management in cellular manufacturing systems—to deal with the resource management problem in CC. We develop a mathematical model to optimally consolidate the VMs, servers and tasks simultaneously to control several important factors such as task migrations and server load variation, as well as the number of VMs. To test the validity of our proposed model, several small problems are generated randomly and solved by LINGO 9 software. Furthermore, to cope with larger problems, which cannot be solved optimally, a genetic algorithm is proposed. We, finally, compare our methods with the most well-known algorithms in this context, round robin (RR) and first-come, first-served (FCFS) algorithms.

97 MATHEMATICS AND COMPUTING↗

Performance characteristics of a perforated shadow band under clear sky conditions

A perforated, non-rotating shadow band is described for separating global solar irradiance into its diffuse and direct normal components using a single pyranometer. Whereas shadow bands are normally solid so as to occult the sensor of a pyranometer throughout the day, the proposed band has apertures cut from its circumference to intermittently expose the instrument sensor at preset intervals. Under clear sky conditions the device produces a saw tooth waveform of irradiance data from which it is possible to reconstruct separate global and diffuse curves. The direct normal irradiance may then be calculated giving a complete breakdown of the irradiance curves without need of a second instrument or rotating shadow band. This paper describes the principle of operation of the band and gives a mathematical model of its shading mask based on the results of an optical ray tracing study. An algorithm for processing the data from the perforated band system is described and evaluated. In an extended trial conducted at NREL's Solar Radiation Research Laboratory, the band coupled with a thermally corrected Eppley PSP produced independent curves for diffuse, global and direct normal irradiance with low mean bias errors of 5.6 W/m{sup 2}, 0.3 W/m{sup 2} and -2.6 W/m{sup 2} respectively, relative to collocated reference instruments. Random uncertainties were 9.7 W/m{sup 2} (diffuse), 17.3 W/m{sup 2} (global) and 19.0 W/m{sup 2} (direct). When the data processing algorithm was modified to include the ray trace model of sensor exposure, uncertainties increased only marginally, confirming the effectiveness of the model. Deployment of the perforated band system can potentially increase the accuracy of data from ground stations in predominantly sunny areas where instrumentation is limited to a single pyranometer. (author)

14 SOLAR ENERGY↗

Quantum Embedding Theory for Strongly Correlated States in Materials

Quantum embedding theories are promising approaches to investigate strongly correlated electronic states of active regions of large-scale molecular or condensed systems. Notable examples are spin defects in semiconductors and insulators. We present a detailed derivation of a quantum embedding theory recently introduced, which is based on the definition of effective Hamiltonians. The effect of the environment on a chosen active space is accounted for through screened Coulomb interactions evaluated using density functional theory. Importantly, the random phase approximation is not required, and the evaluation of virtual electronic orbitals is circumvented with algorithms previously developed in the context of calculations based on many-body perturbation theory. In addition, we generalize the quantum embedding theory to active spaces composed of orbitals that are not eigenstates of Kohn–Sham Hamiltonians. Finally, we report results for spin defects in semiconductors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Information Theoretic Approach to Identify Dominant Voltage Influencers for Unbalanced Distribution Systems

Smart distribution grid with multiple renewable energy sources can experience random voltage fluctuations due to variable generation, which may result in voltage violations. Traditional voltage control algorithms are inadequate to handle fast voltage variations. Therefore, new dynamic control methods are being developed that can significantly benefit from the knowledge of dominant voltage influencer (DVI) nodes. DVI nodes for a particular node of interest refer to nodes that have a relatively high impact on the voltage fluctuations at that node. Conventional power flow-based algorithms to identify DVI nodes are computationally complex, which limits their use in real-time applications. This paper proposes a novel information theoretic voltage influencing score (VIS) that quantifies the voltage influencing capacity of nodes with DERs/active loads in a three phase unbalanced distribution system. VIS is then employed to rank the nodes and identify the DVI set. VIS is derived analytically in a computationally efficient manner and its efficacy to identify DVI nodes is validated using the IEEE 37-node test system. It is shown through experiments that KL divergence and Bhattacharyya distance are effective indicators of DVI nodes with an identifying accuracy of more than 90%. Additionally, the computation burden is also reduced by an order of 5, thus providing the foundation for efficient voltage control.

42 ENGINEERING↗

Deterministic Linear Time for Maximal Poisson‐Disk Sampling using Chocks without Rejection or Approximation

Abstract We show how to sample uniformly within the three‐sided region bounded by a circle, a radial ray, and a tangent, called a “chock.” By dividing a 2D planar rectangle into a background grid, and subtracting Poisson disks from grid squares, we are able to represent the available region for samples exactly using triangles and chocks. Uniform random samples are generated from chock areas precisely without rejection sampling. This provides the first implemented algorithm for precise maximal Poisson‐disk sampling in deterministic linear time. We prove O(n · M(b) log b), where n is the number of samples, b is the bits of numerical precision and M is the cost of multiplication. Prior methods have higher time complexity, take expected time, are non‐maximal, and/or are not Poisson‐disk distributions in the most precise mathematical sense. We fill this theoretical lacuna.

Mitchell, Scott A.↗

CRACK MODELLING FOR RADIOGRAPHY

In this paper, possibility of creation of three-dimensional crack models, both random type and based on real-life radiographic images is discussed. Method for storing cracks in a number of two-dimensional matrices, as well algorithm for their reconstruction into three-dimensional objects is presented. Also the possibility of using iterative algorithm for matching simulated images of cracks to real-life radiographic images is discussed.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Novel Local Learning based Approach With Application to Breast Cancer Diagnosis

The purpose of this study is to develop and evaluate a novel local learning-based approach for computer-assisted diagnosis of breast cancer. Our new local learning based algorithm using the linear logistic regression method as its base learner is described. Overall, our algorithm will perform its stochastic searching process until the total allowed computing time is used up by our random walk process in identifying the most suitable population subdivision scheme and their corresponding individual base learners. The proposed local learning-based approach was applied for the prediction of breast cancer given 11 mammographic and clinical findings reported by physicians using the BI-RADS lexicon. Our database consisted of 850 patients with biopsy confirmed diagnosis (290 malignant and 560 benign). We also compared the performance of our method with a collection of publicly available state-of-the-art machine learning methods. Predictive performance for all classifiers was evaluated using 10-fold cross validation and Receiver Operating Characteristics (ROC) analysis. Figure 1 reports the performance of 54 machine learning methods implemented in the machine learning toolkit Weka (version 3.0). We introduced a novel local learning-based classifier and compared it with an extensive list of other classifiers for the problem of breast cancer diagnosis. Our experiments show that the algorithm superior prediction performance outperforming a wide range of other well established machine learning techniques. Our conclusion complements the existing understanding in the machine learning field that local learning may capture complicated, non-linear relationships exhibited by real-world datasets.

59 BASIC BIOLOGICAL SCIENCES↗