Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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 91 records · Page 5

Network Inference Algorithms Elucidate Nrf2 Regulation of Mouse Lung Oxidative Stress

A variety of cardiovascular, neurological and neoplastic conditions have been associated with oxidative stress, i.e., conditions under which levels of reactive oxygen species (ROS) are elevated over significant periods. Nuclear factor erythroid 2-related factor (Nrf2) regulates the transcription of several gene products involved in the protective response to oxidative stress. The transcriptional regulatory and signaling relationships linking gene products involved in the response to oxidative stress are, currently, only partially resolved. Microarray data constitute RNA abundance measures representing gene expression patterns. In some cases, these patterns can identify the molecular interactions of gene products. They can be, in effect, proxies for protein-protein and protein-DNA interactions. Traditional techniques used for clustering co-regulated genes on high throughput gene arrays are rarely capable of distinguishing between direct transcriptional regulatory interactions and indirect ones. In this study, newly developed information-theoretic algorithms that employ the concept of mutual information were used: the Algorithm for the Reconstruction of Accurate Cellular Networks (ARACNE), and Context Likelihood of Relatedness (CLR). These algorithms captured dependencies in the gene expression profiles of the mouse lung, allowing the regulatory effect of Nrf2 in response to oxidative stress to be determined more precisely. In addition, a characterization of promoter sequences of Nrf2 regulatory targets was conducted using a Support Vector Machine classification algorithm, to corroborate ARACNE and CLR predictions. Inferred networks were analyzed, compared and integrated using the Collective Analysis of Biological Interaction Networks (CABIN) plug-in of Cytoscape.

59 BASIC BIOLOGICAL SCIENCES↗

Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations

The recovery of approximately sparse or compressible coefficients in a polynomial chaos expansion is a common goal in many modern parametric uncertainty quantification (UQ) problems. However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be difficult to detect and result in a highly polluted simulation result. In this paper we present a novel compressive sampling--based theoretical analysis for a regularized $\ell^1$ minimization algorithm that aims to recover sparse expansion coefficients in the presence of measurement corruptions. Our recovery results are uniform (the theoretical guarantees hold for all compressible signals and compressible corruptions vectors) and prescribe algorithmic regularization parameters in terms of a user-defined a priori estimate on the ratio of measurements that are believed to be corrupted. We also propose an iteratively reweighted optimization algorithm that automatically refines the value of the regularization parameter and empirically produces superior results. Lastly, our numerical results test our framework on several medium to high dimensional examples of solutions to parameterized differential equations and demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations

The recovery of approximately sparse or compressible coefficients in a polynomial chaos expansion is a common goal in many modern parametric uncertainty quantification (UQ) problems. However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be difficult to detect and result in a highly polluted simulation result. In this paper we present a novel compressive sampling-based theoretical analysis for a regularized t1 minimization algorithm that aims to recover sparse expansion coefficients in the presence of measurement corruptions. Our recovery results are uniform (the theoretical guarantees hold for all compressible signals and compressible corruptions vectors), and prescribe algorithmic regularization parameters in terms of a user-defined a priori estimate on the ratio of measurements that are believed to be corrupted. We also propose an iteratively reweighted optimization algorithm that automatically refines the value of the regularization parameter, and empirically produces superior results. Our numerical results test our framework on several medium-to-high dimensional examples of solutions to parameterized differential equations, and demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Alternative Vector PWM for CSI Common-Mode Voltage Reduction During Voltage-Boost Operation with Low Modulation Index

This paper proposes a new pulse-width modulation (PWM) scheme named alternative vector PWM (AVM) algorithm that reduces the common-mode voltage (vCM) generated by a 3-phase current source inverter (CSI) during operation within a portion of its voltage-boost regime when the CSI’s modulation index is below 1/3–√(=0.5774). Three different active current vector pairs (one conventional pair with adjacent active current vectors and two proposed pairs with non-adjacent active current vectors) are used to reduce vCM based on the CSI’s output voltage conditions. Experimental results confirm significant reductions in major vCM spectral components by up to approx. 85% between the 3rd harmonic of the fundamental frequency and the CSI’s PWM frequency, validating the advantages of the proposed AVM algorithm over the conventional PWM.

42 ENGINEERING↗

Evaluation of machine learning algorithms for prediction of regions of high Reynolds averaged Navier Stokes uncertainty

Reynolds Averaged Navier Stokes (RANS) models are widely used in industry to predict fluid flows, despite their acknowledged deficiencies. Not only do RANS models often produce inaccurate flow predictions, but there are very limited diagnostics available to assess RANS accuracy for a given flow configuration. If experimental or higher fidelity simulation results are not available for RANS validation, there is no reliable method to evaluate RANS accuracy. This paper explores the potential of utilizing machine learning algorithms to identify regions of high RANS uncertainty. Three different machine learning algorithms were evaluated: support vector machines, Adaboost decision trees, and random forests. The algorithms were trained on a database of canonical flow configurations for which validated direct numerical simulation or large eddy simulation results were available, and were used to classify RANS results on a point-by-point basis as having either high or low uncertainty, based on the breakdown of specific RANS modeling assumptions. Classifiers were developed for three different basic RANS eddy viscosity model assumptions: the isotropy of the eddy viscosity, the linearity of the Boussinesq hypothesis, and the non-negativity of the eddy viscosity. It is shown that these classifiers are able to generalize to flows substantially different from those on which they were trained. As a result, feature selection techniques, model evaluation, and extrapolation detection are discussed in the context of turbulence modeling applications.

97 MATHEMATICS AND COMPUTING↗

Predicting Solar Flares Using SDO /HMI Vector Magnetic Data Products and the Random Forest Algorithm

Adverse space-weather effects can often be traced to solar flares, the prediction of which has drawn significant research interests. The Helioseismic and Magnetic Imager (HMI) produces full-disk vector magnetograms with continuous high cadence, while flare prediction efforts utilizing this unprecedented data source are still limited. Here we report results of flare prediction using physical parameters provided by the Space-weather HMI Active Region Patches (SHARP) and related data products. We survey X-ray flares that occurred from 2010 May to 2016 December and categorize their source regions into four classes (B, C, M, and X) according to the maximum GOES magnitude of flares they generated. We then retrieve SHARP-related parameters for each selected region at the beginning of its flare date to build a database. Finally, we train a machine-learning algorithm, called random forest (RF), to predict the occurrence of a certain class of flares in a given active region within 24 hr, evaluate the classifier performance using the 10-fold cross-validation scheme, and characterize the results using standard performance metrics. Compared to previous works, our experiments indicate that using the HMI parameters and RF is a valid method for flare forecasting with fairly reasonable prediction performance. To our knowledge, this is the first time that RF has been used to make multiclass predictions of solar flares. We also find that the total unsigned quantities of vertical current, current helicity, and flux near the polarity inversion line are among the most important parameters for classifying flaring regions into different classes.

79 ASTRONOMY AND ASTROPHYSICS↗

Agricultural mapping using Support Vector Machine-Based Endmember Extraction (SVM-BEE)

Extracting endmembers from remotely sensed images of vegetated areas can present difficulties. In this research, we applied a recently developed endmember-extraction algorithm based on Support Vector Machines (SVMs) to the problem of semi-autonomous estimation of vegetation endmembers from a hyperspectral image. This algorithm, referred to as Support Vector Machine-Based Endmember Extraction (SVM-BEE), accurately and rapidly yields a computed representation of hyperspectral data that can accommodate multiple distributions. The number of distributions is identified without prior knowledge, based upon this representation. Prior work established that SVM-BEE is robustly noise-tolerant and can semi-automatically and effectively estimate endmembers; synthetic data and a geologic scene were previously analyzed. Here we compared the efficacies of the SVM-BEE and N-FINDR algorithms in extracting endmembers from a predominantly agricultural scene. SVM-BEE was able to estimate vegetation and other endmembers for all classes in the image, which N-FINDR failed to do. Classifications based on SVM-BEE endmembers were markedly more accurate compared with those based on N-FINDR endmembers.

54 ENVIRONMENTAL SCIENCES↗

Automated identification and indexing of dislocations in crystal interfaces

Here, we present a computational method for identifying partial and interfacial dislocations in atomistic models of crystals with defects. Our automated algorithm is based on a discrete Burgers circuit integral over the elastic displacement field and is not limited to specific lattices or dislocation types. Dislocations in grain boundaries and other interfaces are identified by mapping atomic bonds from the dislocated interface to an ideal template configuration of the coherent interface to reveal incompatible displacements induced by dislocations and to determine their Burgers vectors. Additionally, the algorithm generates a continuous line representation of each dislocation segment in the crystal and also identifies dislocation junctions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Novel Machine Learning Algorithm for Cloud Detection Using AERI Measurement Data

Infrared hyperspectral remote sensing has been widely used in the field of meteorology. Many scientists have carried out research on inversion methods of meteorological elements such as thermodynamic profile, boundary layer height, cloud base height, etc. In this study, a method based on machine learning for cloud detection using ground-based infrared hyperspectral radiation data is proposed. The features of outliers, the cloudy and cloud-free data of Atmospheric Emitted Radiance Interferometer (AERI) radiation are extracted. The “reference values” of cloudy and cloud-free are determined based on the observation data of Vaisala CL31 ceilometer within the time range of 8 min before the corresponding time of AERI. A support vector machine (SVM) algorithm is used for training. The dataset comes from the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) site and North Slope Alaska (NSA) site from 2015 to 2017, and the ARM West Antarctic Radiation Experiment (AWARE) site in 2016 is also analyzed. The instruments used in this paper include AERI, ceilometer, etc. The experimental results reveal that the agreement of cloud detection results between the proposed algorithm and ceilometer is about 93% at each site. However, for high clouds or optically thin clouds, the agreement will decrease.

47 OTHER INSTRUMENTATION↗

RADIOISOTOPE IDENTIFICATION OF SHIELDED AND MASKED SNM RDD MATERIALS

Sonar and speech techniques have been investigated to improve functionality and enable handheld and other man-portable, mobile, and portal systems to positively detect and identify illicit nuclear materials, with minimal data and with minimal false positives and false negatives. RadSonar isotope detection and identification is an algorithm development project funded by NA-22 and employing the resources of Savannah River National Laboratory and three University Laboratories (JHU-APL, UT-ARL, and UW-APL). Algorithms have been developed that improve the probability of detection and decrease the number of false positives and negatives. Two algorithms have been developed and tested. The first algorithm uses support vector machine (SVM) classifiers to determine the most prevalent nuclide(s) in a spectrum. It then uses a constrained weighted least squares fit to estimate and remove the contribution of these nuclide(s) to the spectrum, iterating classification and fitting until there is nothing of significance left. If any Special Nuclear Materials (SNMs) were detected in this process, a second tier of more stringent classifiers are used to make the final SNM alert decision. The second algorithm is looking at identifying existing feature sets that would be relevant in the radioisotope identification context. The underlying philosophy here is to identify parallels between the physics and/or the structures present in the data for the two applications (speech analysis and gamma spectroscopy). The expectation is that similar approaches may work in both cases. The mel-frequency cepstral representation of spectra is widely used in speech, particularly for two reasons: approximation of the response of the human ear, and simplicity of channel effect separation (in this context, a 'channel' is a method of signal transport that affects the signal, examples being vocal tract shape, room echoes, and microphone response). Measured and simulated gamma-ray spectra from a hand-held Radioisotope Identification Device were used to evaluate the algorithms. This paper will present and discuss results of the Test and Evaluation performed on two algorithms produced from the project.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Dynamic Price Vector Formation Model-Based Automatic Demand Response Strategy for PV-Assisted EV Charging Stations

A real-time price (RTP)-based automatic demand response (ADR) strategy for PV-assisted electric vehicle (EV) Charging Station (PVCS) without vehicle to grid is proposed. The charging process is modeled as a dynamic linear program instead of the normal day-ahead and real-time regulation strategy, to capture the advantages of both global and real-time optimization. Different from conventional price forecasting algorithms, a dynamic price vector formation model is proposed based on a clustering algorithm to form an RTP vector for a particular day. A dynamic feasible energy demand region (DFEDR) model considering grid voltage profiles is designed to calculate the lower and upper bounds. A deduction method is proposed to deal with the unknown information of future intervals, such as the actual stochastic arrival and departure times of EVs, which make the DFEDR model suitable for global optimization. Finally, both the comparative cases articulate the advantages of the developed methods and the validity in reducing electricity costs, mitigating peak charging demand, and improving PV self-consumption of the proposed strategy are verified through simulation scenarios.

14 SOLAR ENERGY↗

A Decision-Making Machine Learning Approach in Hermite Spectral Approximations of Partial Differential Equations

The accuracy and effectiveness of Hermite spectral methods for the numerical discretization of partial differential equations on unbounded domains are strongly affected by the amplitude of the Gaussian weight function employed to describe the approximation space. This is particularly true if the problem is under-resolved, i.e., there are no enough degrees of freedom. The issue becomes even more crucial when the equation under study is time-dependent, forcing in this way the choice of Hermite functions where the corresponding weight depends on time. In order to adapt dynamically the approximation space, it is here proposed an automatic decision-making process that relies on machine learning techniques, such as deep neural networks and support vector machines. The algorithm is numerically tested with success on a simple 1D problem, but the main goal is its exportability in the context of more serious applications. Here we also show at the end an application in the framework of plasma physics.

97 MATHEMATICS AND COMPUTING↗

Application of predictive data analytics to model daily hydrocarbon production using petrophysical, geomechanical, fiber-optic, completions, and surface data: A case study from the Marcellus Shale, North America

Predicting gas production from stimulated unconventional reservoirs has always been a challenge to oil and gas companies because the physics of fluid flow through such reservoirs is not well understood. On the other hand, modeling gas production from shale reservoirs is a complex multi-variate problem that requires proper integration of data from multiple disciplines, such as geology, petrophysics, geomechanics, completions, and surface-based measurements, etc. Here this study demonstrates the application of data-driven machine learning algorithms, integrating geoscientific, distributed acoustic sensing (DAS), distributed temperature sensing (DTS) fiber-optic, completions, flow scanner production log, and surface data to model daily gas production from a 28-stage stimulated horizontal well drilled in the Marcellus Shale of the Appalachian basin in North America. In addition, this study aims to utilize the data from a fiber-optic monitoring system, such as DAS and DTS to evaluate the well performance. We build supervised data-driven machine learning models using Random Forest (RF), Artificial Neural Network (ANN), and Support Vector Machine (SVM) algorithms to understand the well performance and forecast the daily gas production. The study compares the forecasted results, tests the level of accuracy, and addresses different issues with these machine learning algorithms. A spatio-temporal database is constructed and used to perform sensitivity analyses to identify the key drivers for gas production. The results show that RF and ANN algorithms can be used to predict daily gas production with significantly high accuracy; however, RF algorithm is the best predictor in terms of highest accuracy (96%), less computational time and cost. Based on sensitivity analysis, it appears that Poisson's ratio, minimum horizontal stress, DAS, casing pressure, gamma log are the most important parameters to predict gas production.

02 PETROLEUM↗

A Supervised Machine Learning Approach to Control Energy Storage Devices

This paper introduces a supervised machine learning approach to predict and schedule the real-time operation mode of the next operation interval for residential PV/Battery systems controlled by mode-based controllers. The performance of the mode-based economic model-predictive control (EMPC) approach is used as the benchmark. The residential load and PV data used in the paper are 1-minute data downloaded from the the Pecan Street Project website. The optimal operation mode for each control interval is first derived from the historical data used as the training set. Then, four machine learning algorithms (i.e. neural network, support vector machine, logistic regression, and random forest algorithms) are applied. We compared the performance of the four algorithms when using different number of features and length of the training sets extracted from different months of the year. Simulation results show that using the machine learning approach can effectively improve the performance of the mode-based control system and reduce the computation effort of local controllers because the training can be completed on a cloud-based Machine Learning engine. Furthermore, the work presented in this paper paves the way for using a shared-learning platform to design controllers of residential PV/storage systems. This may significantly reduce the cost for implementing such systems.

25 ENERGY STORAGE↗

Review of machine learning and deep learning models for toxicity prediction

The ever-increasing number of chemicals has raised public concerns due to their adverse effects on human health and the environment. To protect public health and the environment, it is critical to assess the toxicity of these chemicals. Traditional in vitro and in vivo toxicity assays are complicated, costly, and time-consuming and may face ethical issues. These constraints raise the need for alternative methods for assessing the toxicity of chemicals. Recently, due to the advancement of machine learning algorithms and the increase in computational power, many toxicity prediction models have been developed using various machine learning and deep learning algorithms such as support vector machine, random forest, k-nearest neighbors, ensemble learning, and deep neural network. This review summarizes the machine learning- and deep learning-based toxicity prediction models developed in recent years. Support vector machine and random forest are the most popular machine learning algorithms, and hepatotoxicity, cardiotoxicity, and carcinogenicity are the frequently modeled toxicity endpoints in predictive toxicology. It is known that datasets impact model performance. The quality of datasets used in the development of toxicity prediction models using machine learning and deep learning is vital to the performance of the developed models. The different toxicity assignments for the same chemicals among different datasets of the same type of toxicity have been observed, indicating benchmarking datasets is needed for developing reliable toxicity prediction models using machine learning and deep learning algorithms. This review provides insights into current machine learning models in predictive toxicology, which are expected to promote the development and application of toxicity prediction models in the future.

Research & Experimental Medicine↗

Plasma image classification using cosine similarity constrained convolutional neural network

Plasma jets are widely investigated both in the laboratory and in nature. Astrophysical objects such as black holes, active galactic nuclei and young stellar objects commonly emit plasma jets in various forms. With the availability of data from plasma jet experiments resembling astrophysical plasma jets, classification of such data would potentially aid in not only investigating the underlying physics of the experiments but also the study of astrophysical jets. In this work we use deep learning to process all of the laboratory plasma images from the Caltech Spheromak Experiment spanning two decades. We found that cosine similarity can aid in feature selection, classify images through comparison of feature vector direction and be used as a loss function for the training of AlexNet for plasma image classification. We also develop a simple vector direction comparison algorithm for binary and multi-class classification. Using our algorithm we demonstrate 93 % accurate binary classification to distinguish unstable columns from stable columns and 92 % accurate five-way classification of a small, labelled data set which includes three classes corresponding to varying levels of kink instability.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

J-PLUS: Support vector regression to measure stellar parameters

Stellar parameters are among the most important characteristics in studies of stars which, in traditional methods, are based on atmosphere models. However, time, cost, and brightness limits restrain the efficiency of spectral observations. The Javalambre Photometric Local Universe Survey (J-PLUS) is an observational campaign that aims to obtain photometry in 12 bands. Owing to its characteristics, J-PLUS data have become a valuable resource for studies of stars. Machine learning provides powerful tools for efficiently analyzing large data sets, such as the one from J-PLUS, and enables us to expand the research domain to stellar parameters. The main goal of this study is to construct a support vector regression (SVR) algorithm to estimate stellar parameters of the stars in the first data release of the J-PLUS observational campaign. The training data for the parameter's regressions are featured with 12-waveband photometry from J-PLUS and are crossidentified with spectrum-based catalogs. These catalogs are from the Large Sky Area Multi-Object Fiber Spectroscopic Telescope, the Apache Point Observatory Galactic Evolution Experiment, and the Sloan Extension for Galactic Understanding and Exploration. We then label them with the stellar effective temperature, the surface gravity, and the metallicity. Ten percent of the sample is held out to apply a blind test. We develop a new method, a multi-model approach, in order to fully take into account, the uncertainties of both the magnitudes and the stellar parameters. The method utilizes more than 200 models to apply the uncertainty analysis. We present a catalog of 2 493 424 stars with the root mean square error of 160 K in the effective temperature regression, 0.35 in the surface gravity regression, and 0.25 in the metallicity regression. We also discuss the advantages of this multi-model approach and compare it to other machine-learning methods.

79 ASTRONOMY AND ASTROPHYSICS↗

Broad Absorption Line Quasar catalogues with Supervised Neural Networks

We have applied a Learning Vector Quantization (LVQ) algorithm to SDSS DR5 quasar spectra in order to create a large catalogue of broad absorption line quasars (BALQSOs). We first discuss the problems with BALQSO catalogues constructed using the conventional balnicity and/or absorption indices (BI and AI), and then describe the supervised LVQ network we have trained to recognise BALQSOs. The resulting BALQSO catalogue should be substantially more robust and complete than BI-or AI-based ones.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗