Search NASA⌕ Search

SEARCH · Search NASA

Results for “vector programs”

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 37 records · Page 2

Streamline Integration Using MPI-Hybrid Parallelism on a Large Multicore Architecture

Streamline computation in a very large vector field data set represents a significant challenge due to the nonlocal and data-dependent nature of streamline integration. In this paper, we conduct a study of the performance characteristics of hybrid parallel programming and execution as applied to streamline integration on a large, multicore platform. With multicore processors now prevalent in clusters and supercomputers, there is a need to understand the impact of these hybrid systems in order to make the best implementation choice. We use two MPI-based distribution approaches based on established parallelization paradigms, parallelize over seeds and parallelize over blocks, and present a novel MPI-hybrid algorithm for each approach to compute streamlines. Our findings indicate that the work sharing between cores in the proposed MPI-hybrid parallel implementation results in much improved performance and consumes less communication and I/O bandwidth than a traditional, nonhybrid distributed implementation.

97 MATHEMATICS AND COMPUTING↗

SU-E-T-428: Feasibility Study of 4D Image Reconstruction by Organ Motion Vector Extension Based On Portal Images

Purpose: To develop and to test a method to generate a new 4D CT images of the treatment day from the old 4D CT and the portal images of the day when the motion extent exceeded from that represented by plan CTs. Methods: A motion vector of a moving tumor in a patient may be extended to reconstruct the tumor position when the motion extent exceeded from that represented by plan CTs. To test this, 1. a phantom that consists of a polystyrene cylinder (tumor) embedded in cork (lung) was placed on a moving platform with 4 sec/cycle and amplitudes of 1 cm and 2 cm, and was 4D-scanned. 2. A 6MV photon beam was irradiated on the moving phantoms and cineEPID images were obtained. 3. A motion vector of the tumor was acquired from 4D CT images of the phantom with 1 cm amplitude. 4. From cine EPID images of the phantom with the 2 cm amplitude, various motion extents (0.3 cm, 0.5 cm, etc) were acquired and programmed into the motion vector, producing CT images at each position. 5. The reconstructed CT images were then compared with pre-acquired “reference” 4D CT images at each position (i.e. phase). Results: The CT image was reconstructed and compared with the reference image, showing a slight mismatch in the transition direction limited by voxel size (slice thickness) in CT image. Due to the rigid nature of the phantom studied, the modeling the displacement of the center of object was sufficient. When deformable tumors are to be modeled, more complex scheme is necessary, which utilize cine EPID and 4D CT images. Conclusion: The new idea of CT image reconstruction was demonstrated. Deformable tumor movements need to be considered in the future.

60 APPLIED LIFE SCIENCES↗

Applying MALDI-TOF MS to resolve morphologic and genetic similarities between two Dermacentor tick species of public health importance

Abstract Hard ticks (Acari: Ixodidae) have been historically identified by morphological methods which require highly specialized expertise and more recently by DNA-based molecular assays that involve high costs. Although both approaches provide complementary data for tick identification, each method has limitations which restrict their use on large-scale settings such as regional or national tick surveillance programs. To overcome those obstacles, the matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF MS) has been introduced as a cost-efficient method for the identification of various organisms, as it balances performance, speed, and high data output. Here we describe the use of this technology to validate the distinction of two closely relatedDermacentortick species based on the development of the first nationwide MALDI-TOF MS reference database described to date. The dataset obtained from this protein-based approach confirms that tick specimens collected from United States regions west of the Rocky Mountains and identified previously asDermacentor variabilisare the recently described species,Dermacentor similis. Therefore, we propose that this integrative taxonomic tool can facilitate vector and vector-borne pathogen surveillance programs in the United States and elsewhere.

Science & Technology - Other Topics↗

Enhanced vector borne disease surveillance of California Culex mosquito populations reveals spatial and species-specific barriers of infection

Monitoring infections in vectors such as mosquitoes,sand flies, tsetse flies, and ticks to identify human pathogens may serve as an early warning detection system to direct local government disease preventive measures. One major hurdle in detection is the ability to screen large numbers of vectors for human pathogens without the use of genotype-specific molecular techniques. Next generation sequencing (NGS) provides an unbiased platform capable of identifying known and unknown pathogens circulating within a vector population, but utilizing this technology is time-consuming and costly for vector-borne disease surveillance programs. To address this we developed cost-effective Ilumina® RNA-Seq library preparation methodologiesin conjunction with an automated computational analysis pipeline to characterize the microbial populations circulating in Culex mosquitoes (Culex quinquefasciatus, Culex quinquefasciatus/pipiens complex hybrids, and Culex tarsalis) throughout California. We assembled 20 novel and well-documented arboviruses representing members of Bunyaviridae, Flaviviridae, Ifaviridae, Mesoniviridae, Nidoviridae, Orthomyxoviridae, Parvoviridae, Reoviridae, Rhabdoviridae, Tymoviridae, as well as several unassigned viruses. In addition, we mapped mRNA species to divergent species of trypanosoma and plasmodium eukaryotic parasites and characterized the prokaryotic microbial composition to identify bacterial transcripts derived from wolbachia, clostridium, mycoplasma, fusobacterium and campylobacter bacterial species. We utilized these microbial transcriptomes present in geographically defined Culex populations to define spatial and mosquito species-specific barriers of infection. The virome and microbiome composition identified in each mosquito pool provided sufficient resolution to determine both the mosquito species and the geographic region in California where the mosquito pool originated. This data provides insight into the complexity of microbial species circulating in medically important Culex mosquitoes and their potential impact on the transmission of vector-borne human/veterinary pathogens in California.

Langevin, Stanley↗

A Polyhedral Transformation Framework for Compiler Optimization (Final Project Report)

The project developed the polyhedral compiler transformation module PolyOpt/Fortran in the ROSE compiler framework. PolyOpt/Fortran performs automated transformation of affine loop nests within FORTRAN programs for enhanced data locality and parallel execution. A FORTAN version of the Polybench library was also developed by the project. A third development was a dynamic analysis approach to gauge vectorization potential within loops of programs; software (DDVec) for automated instrumentation and dynamic analysis of programs was developed.

97 MATHEMATICS AND COMPUTING↗

Optimal choices of reference for a quasilocal energy: Spherically symmetric spacetimes

For a given timelike displacement vector, the covariant Hamiltonian quasilocal energy expression requires a proper choice of reference spacetime. We propose a program for determining the reference by embedding a neighborhood of the two-sphere boundary in the dynamic spacetime into a Minkowski reference, so that the two-sphere is embedded isometrically, and then extremizing the energy to determine the embedding variables. Applying this idea to Schwarzschild spacetime, we found that for each given future timelike displacement vector our program gives a unique energy value. The static observer measures the maximal energy. Applied to the Friedmann-Lemaitre-Robertson-Walker spacetime, we find that the maximum energy value is non-negative; the associated displacement vector is the unit dual mean curvature vector; and the expansion of the two-sphere boundary matches that of its reference image. For these spherically symmetric cases the reference determined by our program is equivalent to isometrically matching the geometry at the two-sphere boundary and taking the displacement vector to be orthogonal to the spacelike constant coordinate time hypersurface, like the timelike Killing vector of the Minkowski reference.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Geochemical Fingerprinting of Coltan Ores by Machine Learning on Uneven Datasets

Two modern machine learning techniques, Linear Programming Boosting (LPBoost) and Support Vector Machines (SVMs), are introduced and applied to a geochemical dataset of niobium-tantalum ('coltan') ores from Central Africa to demonstrate how such information may be used to distinguish ore provenance, i.e., place of origin. The compositional data used include uni- and multivariate outliers and elemental distributions are not described by parametric frequency distribution functions. The 'soft margin' techniques of LPBoost and SVMs can be applied to such data. Optimization of their learning parameters results in an average accuracy of up to c. 92%, if spot measurements are assessed to estimate the provenance of ore samples originating from two geographically defined source areas. A parameterized performance measure, together with common methods for its optimization, was evaluated to account for the presence of uneven datasets. Optimization of the classification function threshold improves the performance, as class importance is shifted towards one of those classes. For this dataset, the average performance of the SVMs is significantly better compared to that of LPBoost.

42 ENGINEERING↗

Extracting SIMD Parallelism from Recursive Task-Parallel Programs

The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations. In the absence of data parallelism, it seems that such algorithms are not well suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data parallelism latent in recursive, task- parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel’s SSE4.2 vector units, as well as accelerators using Intel’s AVX512 units. We then show through rigorous sampling that, in practice, our vectorization techniques are effective for a much larger class of programs.

Recursive Programs, task parallelism, vectorizatio↗

On Implicit Active Constraints in Linear Semi-Infinite Programs with Unbounded Coefficients

The concept of implicit active constraints at a given point provides useful local information about the solution set of linear semi-infinite systems and about the optimal set in linear semi-infinite programming provided the set of gradient vectors of the constraints is bounded, commonly under the additional assumption that there exists some strong Slater point. This paper shows that the mentioned global boundedness condition can be replaced by a weaker local condition (LUB) based on locally active constraints (active in a ball of small radius whose center is some nominal point), providing geometric information about the solution set and Karush-Kuhn-Tucker type conditions for the optimal solution to be strongly unique. The maintaining of the latter property under sufficiently small perturbations of all the data is also analyzed, giving a characterization of its stability with respect to these perturbations in terms of the strong Slater condition, the so-called Extended-Nuernberger condition, and the LUB condition.

97 MATHEMATICS AND COMPUTING↗

HFEM3D

Software solves the three-dimensional Poisson equation div(k(grad(u)) = f, by the finite element method for the case when material properties, k, are distributed over hierarchy of edges, facets and tetrahedra in the finite element mesh. Method is described in Weiss, CJ, Finite element analysis for model parameters distributed on a hierarchy of geometric simplices, Geophysics, v82, E155-167, doi:10.1190/GEO2017-0058.1 (2017). A standard finite element method for solving Poisson’s equation is augmented by including in the 3D stiffness matrix additional 2D and 1D stiffness matrices representing the contributions from material properties associated with mesh faces and edges, respectively. The resulting linear system is solved iteratively using the conjugate gradient method with Jacobi preconditioning. To minimize computer storage for program execution, the linear solver computes matrix-vector contractions element-by-element over the mesh, without explicit storage of the global stiffness matrix. Program output vtk compliant for visualization and rendering by 3rd party software. Program uses dynamic memory allocation and as such there are no hard limits on problem size outside of those imposed by the operating system and configuration on which the software is run. Dimension, N, of the finite element solution vector is constrained by the the addressable space in 32-vs-64 bit operating systems. Total storage requirements for the problem. Total working space required for the program is approximately 13*N double precision words.

Weiss, Chester J↗

Final Scientific/Technical Report

In this work, we have built upon our results from previous DOE funding (DEFG 0204ER25655), where we developed new and more efficient methods for solving certain optimization problems with many inequality constraints. This past work resulted in efficient algorithms (and analysis of their convergence) for linear programming, convex quadratic programming, and the training of support vector machines. The algorithms are based on using constraint reduction in interior point methods: at each iteration we consider only a smaller subset of the inequality constraints, focusing on the constraints that are close enough to be relevant. Surprisingly, we have been able to show theoretically that such algorithms are globally convergent and to demonstrate experimentally that they are much more efficient than standard interior point methods.

97 MATHEMATICS AND COMPUTING↗

VEST: abstract vector calculus simplification in Mathematica

We present a new package, VEST (Vector Einstein Summation Tools), that performs abstract vector calculus computations in Mathematica. Through the use of index notation, VEST is able to reduce scalar and vector expressions of a very general type using a systematic canonicalization procedure. In addition, utilizing properties of the Levi-Civita symbol, the program can derive types of multi-term vector identities that are not recognized by canonicalization, subsequently applying these to simplify large expressions. In a companion paper, we employ VEST in the automation of the calculation of Lagrangians for the single particle guiding center system in plasma physics, a computation which illustrates its ability to handle very large expressions. VEST has been designed to be simple and intuitive to use, both for basic checking of work and more involved computations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Graphical models for optimal power flow

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

PyFaults: A Python Toolkit for Stacking Fault Screening

PyFaults is an open-source Python library designed to model stacking fault disorder in crystalline materials and qualitatively assess the characteristic selective broadening effects in powder X-ray diffraction (PXRD). Here, the main capabilities of PyFaults are presented, including unit cell and supercell model construction, PXRD pattern calculation, assessment against experimental PXRD, and methods for rapid screening of candidate models within a set of possible stacking vectors and fault occurrence probabilities. This program aims to serve as a computationally inexpensive tool for identifying and screening potential stacking fault models in materials with planar disorder. Three diverse case studies, involving GaN, Li2MnO3 and Li3YCl6, are presented to illustrate the program functionality across a range of structure types and stacking fault modalities.

MATHEMATICS AND COMPUTING↗

$W/Z$ + jets results from CDF

The CDF Collaboration has a comprehensive program of studying the production of vector bosons, W and Z, in association with energetic jets. Excellent understanding of the standard model W/Z+jets and W/Z+c,b-jets processes is of paramount importance for the top quark physics and for the Higgs boson and many new physics searches. We review the latest CDF results on Z-boson production in association with inclusive and b-quark jets, study of the p{sub T} balance in Z+jet events, and a measurement of the W+charm production cross section. The results are based on 4-5 fb{sup -1} of data and compared to various Monte Carlo and next-to-leading order perturbative QCD predictions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Study of Performance Portability of Low-bit Fused Matrix-Vector Multiplication Kernels in SYCL

Understanding the causes of performance gaps between a portable programming model and a vendor-specific programming model is important for improving performance portability. This paper studies performance portability of low-bit fused general matrix-vector multiplication kernels in SYCL on vendors’ graphics processing units (GPUs). This work introduces the use case, explains the kernel implementations in detail, evaluates the performance of the CUDA, HIP, and SYCL kernels on datacenter, desktop, and laptop GPUs, and investigates the causes of performance gaps. The results show that loop unrolling, kernel dispatch overhead, and sum reduction contribute to the gaps.

Jin, Zheming [ORNL] (ORCID:000000027197780X)↗

Laboratory Studies of Particle Cementation and PV Module Soiling

Monitoring of photovoltaic (PV) systems can maintain efficient operations. However, extensive monitoring of large quantities of data can be a cumbersome process. The present work introduces a simple, inexpensive, yet effective data monitoring strategy for detecting faults and determining lost revenues automatically. This was achieved through the deployment of Raspberry Pi (RPI) device at a PV system's combiner box. The RPI was programmed to collect PV data through Modbus communications, and store the data locally in a MySQL database. Then, using a Gaussian Process Regression algorithm the RPI device was able to accurately estimate string level current, voltage, and power values. The device could also detect system faults using a Support Vector Novelty Detection algorithm. Finally, the RPI was programmed to output the potential lost revenue caused by the abnormal condition. The system analytics information was then displayed on a user interface. The interface could be accessed by operations personal to direct maintenance activity so that critical issues can be solved quickly.

14 SOLAR ENERGY↗

The Facility for Antiproton and Ion Research and the Compressed Baryonic Matter Experiment

The Compressed Baryonic Matter (CBM) experiment will be one of the major scientific activities at the future Facility for Antiproton and Ion Research (FAIR) in Darmstadt. The goal of the CBM research program is to explore the QCD phase diagram in the region of high baryon densities using high-energy nucleus-nucleus collisions. This includes the study of the equation-of-state of nuclear matter at high densities, and the search for the deconfinement and chiral phase transitions. The CBM detector is designed to measure both bulk observables with large acceptance and rare diagnostic probes such as charmed particles and vector mesons decaying into lepton pairs. The layout and the physics performance of the proposed CBM experimental facility will be discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗