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 1,315 records · Page 73

Predicting Future Hourly Residential Electrical Consumption: A Machine Learning Case Study

Whole building input models for energy simulation programs are frequently created in order to evaluate specific energy savings potentials. They are also often utilized to maximize cost-effective retrofits for existing buildings as well as to estimate the impact of policy changes toward meeting energy savings goals. Traditional energy modeling suffers from several factors, including the large number of inputs required to characterize the building, the specificity required to accurately model building materials and components, simplifying assumptions made by underlying simulation algorithms, and the gap between the as-designed and as-built building. Prior works have attempted to mitigate these concerns by using sensor-based machine learning approaches to model energy consumption. However, a majority of these prior works focus only on commercial buildings. The works that focus on modeling residential buildings primarily predict monthly electrical consumption, while commercial models predict hourly consumption. This means there is not a clear indicator of which techniques best model residential consumption, since these methods are only evaluated using low-resolution data. We address this issue by testing seven different machine learning algorithms on a unique residential data set, which contains 140 different sensors measurements, collected every 15 minutes. In addition, we validate each learner's correctness on the ASHRAE Great Energy Prediction Shootout, using the original competition metrics. Our validation results confirm existing conclusions that Neural Network-based methods perform best on commercial buildings. However, the results from testing our residential data set show that Feed Forward Neural Networks, Support Vector Regression (SVR), and Linear Regression methods perform poorly, and that Hierarchical Mixture of Experts (HME) with Least Squares Support Vector Machines (LS-SVM) performs best - a technique not previously applied to this domain.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.

97 MATHEMATICS AND COMPUTING↗

iharm3D: Vectorized General Relativistic Magnetohydrodynamics

iharm3D is an open-source C code for simulating black hole accretion systems in arbitrary stationary spacetimes using ideal general-relativistic magnetohydrodynamics (GRMHD). It is an implementation of the HARM (“High Accuracy Relativistic Magnetohydrodynamics”) algorithm outlined in Gammie et al. (2003) with updates as outlined in McKinney & Gammie (2004) and Noble et al. (2006). The code is most directly derived from Ryan et al. (2015) but with radiative transfer portions removed. HARM is a conservative finite-volume scheme for solving the equations of ideal GRMHD, a hyperbolic system of partial differential equations, on a logically Cartesian mesh in arbitrary coordinates.

79 ASTRONOMY AND ASTROPHYSICS↗

A mathematical discussion concerning the performance of multilayer perceptron-type artificial neural networks through use of orthogonal bipolar vectors

This work proposes the use of orthogonal bipolar vectors (OBV) as targets for multilayer perceptron (MLP) Artificial neural networks pertaining to the pattern recognition field. Implications involving this proposal are supported by a proper mathematical discussion. This study shows that the use of OBV as targets improves the class identification performance of MLP networks for pattern recognition with more than two classes when compared to the widely used conventional target bipolar vector (CBV). In addition to the overall performance improvement, it is possible to obtain high recognition rates with fewer training epochs, while keeping a feasible generalization with other data. This behavior is related to the Euclidean distance of the points in the output space, which is much higher in the case of OBVs. Therefore, with a greater distance between the points in the output space, the MLP network becomes less prone to associate trained outputs with incorrect targets. The mathematical discussion in this study is based on the backpropagation training algorithm. In addition to the mathematical discussion, results from experiments with real data are presented. These results follow those obtained by mathematical derivations. Real data sets used in the experiments are available from: (a) the Semeion Handwritten Digit of Machine Learning Repository, international repository; (b) Iris Image Database from the Chinese Academy of Sciences—CASIA; (c) Australian Sign Language, signs of Machine Learning Repository, international repository. Experiments were conducted to measure the mean Euclidean distance between the MLP network output subjected to a given input pattern and outputs related to other pattern classifications. Experimental results show that MLP networks trained with OBVs were able to ensure a Euclidean distance between the output and incorrect targets greater than MLP networks trained with CBVs (by up to 4 times for handwritten, by up to 12 times for iris images and by up to 10 times for Auslan signs language). As such, the adoption of OBVs as target vectors for MLPs reduces the computational effort for training the network.

97 MATHEMATICS AND COMPUTING↗

Portable Data-Parallel Surface Reconstruction on a Uniform Rectilinear Grid

With the increasing heterogeneity and on-node parallelism of high-performance computing hardware, a major challenge is to develop portable and efficient algorithms and software. In this work, we present our implementation of a portable code to perform surface reconstruction using NVIDIA's Thrust library. Surface reconstruction is a technique commonly used in volume tracking methods for simulations of multimaterial flow with interfaces. Here, we have designed a 3D mesh data structure that is easily mapped to the 1D vectors used by Thrust and at the same time is simple to use and uses familiar data structure terminology (such as cells, faces, vertices, and edges). With this new data structure in place, we have implemented a piecewise linear interface reconstruction algorithm in 3 dimensions that effectively exploits the symmetry present in a uniform rectilinear computational cell. Finally, we report performance results, which show that a single implementation of these algorithms can be compiled to multiple backends (specifically, multi-core CPUs, NVIDIA GPUs, and Intel Xeon Phi processors), making efficient use of the available parallelism on each. We also compare performance of our implementation to a legacy FORTRAN implementation in Message Passing Interface (MPI) and show performance parity on single and multi-core CPU and achieved good parallel speed-ups on GPU. In conclusion, our research demonstrates the advantage of performance portability of the underlying data-parallel programming model.

97 MATHEMATICS AND COMPUTING↗

Forward and adjoint sensitivity computation of chaotic dynamical systems

This paper describes a forward algorithm and an adjoint algorithm for computing sensitivity derivatives in chaotic dynamical systems, such as the Lorenz attractor. The algorithms compute the derivative of long time averaged “statistical” quantities to infinitesimal perturbations of the system parameters. The algorithms are demonstrated on the Lorenz attractor. We show that sensitivity derivatives of statistical quantities can be accurately estimated using a single, short trajectory (over a time interval of 20) on the Lorenz attractor.

97 MATHEMATICS AND COMPUTING↗

Hybrid quantum computation

We present a hybrid model of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model, part of a quantum circuit is simulated by unitary evolution and the rest by measurements on star graph states, thereby combining the advantages of the two standard quantum computation models. In the hybrid model, a complicated unitary gate under simulation is decomposed in terms of a sequence of single-qubit operations, the controlled-z gates, and multiqubit rotations around the z axis. Every single-qubit and the controlled-z gate are realized by a respective unitary evolution, and every multiqubit rotation is executed by a single measurement on a required star graph state. The classical information processing in our model requires only an information flow vector and propagation matrices. We provide the implementation of multicontrol gates in the hybrid model. They are very useful for implementing Grover's search algorithm, which is studied as an illustrative example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ultra-small-angle neutron scattering with azimuthal asymmetry

Small-angle neutron scattering (SANS) measurements from thin sections of rock samples such as shales demand as great a scattering vector range as possible because the pores cover a wide range of sizes. The limitation of the scattering vector range for pinhole SANS requires slit-smeared ultra-SANS (USANS) measurements that need to be converted to pinhole geometry. The desmearing algorithm is only successful for azimuthally symmetric data. Scattering from samples cut parallel to the plane of bedding is symmetric, exhibiting circular contours on a two-dimensional detector. Samples cut perpendicular to the bedding show elliptically dependent contours with the long axis corresponding to the normal to the bedding plane. A method is given for converting such asymmetric data collected on a double-crystal diffractometer for concatenation with the usual pinhole-geometry SANS data. Furthermore, the aspect ratio from the SANS data is used to modify the slit-smeared USANS data to produce quasi-symmetric contours. Rotation of the sample about the incident beam may result in symmetric data but cannot extract the same information as obtained from pinhole geometry.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

On the Investigation of Phase Fault Classification in Power Grid Signals: A Case Study for Support Vector Machines, Decision Tree and Random Forest

In monitoring the power grid, an ability to differentiate between fault types is essential to ensuring electrical safety. Accordingly, this study introduces a fault detection and classification method by considering different machine learning (ML) and feature extraction (FE) methods combinations. Specifically, the proposed method is established in two classification layers; the first layer determines the fault, and the second layer distinguishes the type of fault. Based on the proposed system model, this study seeks to determine the influential data attributes in a power grid signal using FE methods, including fast Fourier transform, power spectral density (PSD), auto-correlation, and wavelet transform (WT). A cross-comparison of the effectiveness of the Support Vector Machine (SVM), Decision Tree (DT), and Random Forest (RF) is also performed to accomplish the classification layers of the proposed method. The designed algorithm is analyzed under the various combinations of FE and ML methods, and outcomes are presented by considering the trade-off between computational complexity and prediction accuracy. The results reveal that the RF-based ML algorithm shows the most accurate classification performance with PSD, and the most time-saving of the models is the DT WT. Also, SVM emerges superior on a subsequent test of the simulated models on real-world signals.

Galbraith, Kelli↗

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗

Applying Pattern Recognition to High-Resolution Images to Determine Cellular Signaling Status

Two frequently used tools to acquire high-resolution images of cells are scanning electron microscopy (SEM) and atomic force microscopy (AFM). The former provides a nanometer resolution view of cellular features rapidly and with high throughput, while the latter enables visualizing hydrated and living cells. In current practice, these images are viewed by eye to determine cellular status, e.g. activated versus resting. Automatic and quantitative data analysis is lacking. This work develops an algorithm of pattern recognition that works very effectively for AFM and SEM images. Using rat basophilic leukemia (RBL) cells, our approach creates a support vector machine (SVM) to automatically classify resting and activated cells. 10-fold cross-validation with cells that are known to be activated or resting gives a good estimate of the generalized classification results. The pattern recognition of AFM images achieves 100% accuracy, while SEM reaches 95.4% for our images as well as images published in prior literature. This outcome suggests that our methodology could become an important and frequently used tool for researchers utilizing AFM and SEM for structural characterization as well as determining cellular signaling status and function.

60 APPLIED LIFE SCIENCES↗

Poster — Thur Eve — 71: A 4D Multimodal Lung Phantom for Regmentation Evaluation

Segmentation and registration of medical imaging data are two processes that can be integrated (a process termed regmentation) to iteratively reinforce each other, potentially improving efficiency and overall accuracy. A significant challenge is presented when attempting to validate the joint process particularly with regards to minimizing geometric uncertainties associated with the ground truth while maintaining anatomical realism. This work demonstrates a 4D MRI, PET, and CT compatible tissue phantom with a known ground truth for evaluating registration and segmentation accuracy. The phantom consists of a preserved swine lung connected to an air pump via a PVC tube for inflation. Mock tumors were constructed from sea sponges contained within two vacuum-sealed compartments with catheters running into each one for injection of radiotracer solution. The phantom was scanned using a GE Discovery-ST PET/CT scanner and a 0.23T Phillips MRI, and resulted in anatomically realistic images. A bifurcation tracking algorithm was implemented to provide a ground truth for evaluating registration accuracy. This algorithm was validated using known deformations of up to 7.8 cm using a separate CT scan of a human thorax. Using the known deformation vectors to compare against, 76 bifurcation points were selected. The tracking accuracy was found to have maximum mean errors of −0.94, 0.79 and −0.57 voxels in the left-right, anterior-posterior and inferior-superior directions, respectively. A pneumatic control system is under development to match the respiratory profile of the lungs to a breathing trace from an individual patient.

60 APPLIED LIFE SCIENCES↗

TU-FG-BRB-03: Basis Vector Model Based Method for Proton Stopping Power Estimation From Experimental Dual Energy CT Data

Purpose: This work aims at reducing the uncertainty in proton stopping power (SP) estimation by a novel combination of a linear, separable basis vector model (BVM) for stopping power calculation (Med Phys 43:600) and a statistical, model-based dual-energy CT (DECT) image reconstruction algorithm (TMI 35:685). The method was applied to experimental data. Methods: BVM assumes the photon attenuation coefficients, electron densities, and mean excitation energies (I-values) of unknown materials can be approximated by a combination of the corresponding quantities of two reference materials. The DECT projection data for a phantom with 5 different known materials was collected on a Philips Brilliance scanner using two scans at 90 kVp and 140 kVp. The line integral alternating minimization (LIAM) algorithm was used to recover the two BVM coefficient images using the measured source spectra. The proton stopping powers are then estimated from the Bethe-Bloch equation using electron densities and I-values derived from the BVM coefficients. The proton stopping powers and proton ranges for the phantom materials estimated via our BVM based DECT method are compared to ICRU reference values and a post-processing DECT analysis (Yang PMB 55:1343) applied to vendorreconstructed images using the Torikoshi parametric fit model (tPFM). Results: For the phantom materials, the average stopping power estimations for 175 MeV protons derived from our method are within 1% of the ICRU reference values (except for Teflon with a 1.48% error), with an average standard deviation of 0.46% over pixels. The resultant proton ranges agree with the reference values within 2 mm. Conclusion: Our principled DECT iterative reconstruction algorithm, incorporating optimal beam hardening and scatter corrections, in conjunction with a simple linear BVM model, achieves more accurate and robust proton stopping power maps than the post-processing, nonlinear tPFM based DECT analysis applied to conventional reconstructions of low and high energy scans. Funding Support: NIH R01CA 75371; NCI grant R01 CA 149305.

60 APPLIED LIFE SCIENCES↗

An Optimization study on a hybrid computer

The maximum principle is applied to minimum-time optimal-control problems, and an optimization algorithm is presented which can be implemented on a hybrid computer. The state and adjoint equations are set up on ASTRAC 2, a high-speed analog computer capable of 1000 differential equation solutions per second. The optimization algorithm is implemented on a PDP-9, an 18-bit, digital computer. The optimization scheme has global and local search phases and uses a vector optimization criterion. Second and third-order bang-bang control systems are studied as examples.

Gonzalez, R. S.↗

A very-long-baseline interferometer system for geodetic applications

A very-long-baseline interferometer system was designed and built for geodetic applications. Each interferometer terminal records a 360-kHz spectral band of noise from a compact extragalactic radio source. The center frequency of the spectral band can be selected to sample sequentially bands covering a much wider frequency range to obtain subnanosecond accuracy in group-delay measurements. A tunnel-diode pulse generator is used to calibrate the delays in the receiver. The necessary sets of algorithms and computer programs have been developed to analyze the data and have allowed the system to be employed to make accurate determinations of vector baselines, radio-source positions, polar motion, and universal time.

Whitney, A. R.↗

Implicit finite difference simulation of flow about arbitrary geometries with application to airfoils

Finite difference procedures are used to solve either the Euler equations or the 'thin layer' Navier-Stokes equations subject to arbitrary boundary conditions. An automatic grid generation program is employed, and because an implicit finite difference algorithm for the flow equations is used, time steps are not severely limited when grid points are finely distributed. Computational efficiency and compatibility to vectorized computer processors is maintained by use of approximate factorization techniques. Computed results for both inviscid and viscous flow about airfoils are described and compared to various known solutions.

Steger, J. L.↗

Parallel Conjugate Gradient: Effects of Ordering Strategies, Programming Paradigms, and Architectural Platforms

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. A sparse matrix-vector multiply (SPMV) usually accounts for most of the floating-point operations within a CG iteration. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and SPMV using different programming paradigms and architectures. Results show that for this class of applications, ordering significantly improves overall performance, that cache reuse may be more important than reducing communication, and that it is possible to achieve message passing performance using shared memory constructs through careful data ordering and distribution. However, a multi-threaded implementation of CG on the Tera MTA does not require special ordering or partitioning to obtain high efficiency and scalability.

Oliker, Leonid↗

Assessing Malaria Risks in Greater Mekong Subregion based on Environmental Parameters

At 4,200 km, the Mekong River is the tenth longest river in the world. It directly and indirectly influences the lives of hundreds of millions of inhabitants in its basin. The riparian countries - Thailand, Myanmar, Cambodia, Laos, Vietnam, and a small part of China - form the Greater Mekong Subregion (GMS). This geographical region has the misfortune of being the world's epicenter of falciparum malaria, which is the most severe form of malaria caused by Plasmodium falciparum. Depending on the country, approximately 50 to 90% of all malaria cases are due to this species. In the Malaria Modeling and Surveillance Project, we have been developing techniques to enhance public health s decision capability for malaria risk assessments and controls. The main objectives are: 1) identifying the potential breeding sites for major vector species; 2) implementing a malaria transmission model to identify the key factors that sustain or intensify malaria transmission; and 3) implementing a risk algorithm to predict the occurrence of malaria and its transmission intensity. The potential benefits are: 1) increased warning time for public health organizations to respond to malaria outbreaks; 2) optimized utilization of pesticide and chemoprophylaxis; 3) reduced likelihood of pesticide and drug resistance; and 4) reduced damage to environment. Environmental parameters important to malaria transmission include temperature, relative humidity, precipitation, and vegetation conditions. The NASA Earth science data sets that have been used for malaria surveillance and risk assessment include AVHRR Pathfinder, TRMM, MODIS, NSIPP, and SIESIP. Hindcastings based on these environmental parameters have shown good agreement to epidemiological records. Socioeconomic factors that may influence malaria transmissions will also be incorporated into the predictive models.

Kiang, Richard↗