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 73 records · Page 4

Vectors of Efficiency in Hybrid Poplar Genotype Testing

Abstract The Natural Resources Research Institute Hybrid Poplar Program breeds and tests genetically improved clones for bio-mass production and environmental services. The testing process progresses from Nursery Progeny Tests (NPT) to Family Field Trials (FFT) to Clone Trials (CT) to Yield Blocks (YB), with limited replication of many clones in FFT and CT and a limited number of highly selected clones set out in monoclonal blocks (YB) to approximate the conditions of commercial plantations. We used correlation vectors, R 2 (coefficient of determination) and r s (Spearman’s Coefficient) for growth (DBH 2 ) and McFadden’s Pseudo R 2 for canker severity score, to determine where testing times could be altered (age – age correlations) and whole testing steps eliminated. FFT can be shortened from 5 years to 4 years. In CT, rank correlations between age 5 (half-rotation) and age 9/10 (full rotation) were significant (R 2 = 0.39 – 0.72), but age 5 selection missed 44 % of the top ten clones at age 9/10. Clone rank in CT at full, but not half, rotation was correlated with rank at full rotation in YB. Choosing clones at 9 years in CT adds 4 years but allows possible elimination of YB for clone selection. Both FFT and CT are necessary. Canker abundance and severity in CT at full rotation cannot be determined at earlier ages. An aggressive strategy saves 6 years of testing.

Forestry↗

Performance of an Astrophysical Radiation Hydrodynamics Code under Scalable Vector Extension Optimization

We present results of a performance study of an astrophysical radiation hydrodynamics code, V2D, on the Arm-based A64FX processor developed by Fujitsu. The code solves sparse linear systems, a task for which the A64FX architecture should be well suited. Here, we performed the performance analysis study on Ookami, an Apollo 80 platform utilizing the A64FX processor. We explored several compilers and performance anal-ysis packages and found the code did not perform as expected under scalable vector extension optimization, suggesting that a “deeper dive” into analyzing the code is worthwhile. However, a simple driver program that exercised basic sparse linear algebra routines used by V2D did show significant speedup with the use of the scalable vector extension optimization. We present the initial results from the study which used V2D on a relatively simple test problem that emphasized the repeated solution of sparse linear systems.

79 ASTRONOMY AND ASTROPHYSICS↗

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗

AN INTEGRATED BIOLOGICAL CONTROL SYSTEM AT HANFORD

In 1999 an integrated biological control system was instituted at the U.S. Department of Energy's Hanford Site. Successes and changes to the program needed to be communicated to a large and diverse mix of organizations and individuals. Efforts at communication are directed toward the following: Hanford Contractors (Liquid or Tank Waste, Solid Waste, Environmental Restoration, Science and Technology, Site Infrastructure), General Hanford Employees, and Hanford Advisory Board (Native American Tribes, Environmental Groups, Local Citizens, Washington State and Oregon State regulatory agencies). Communication was done through direct interface meetings, individual communication, where appropriate, and broadly sharing program reports. The objectives of the communication efforts was to have the program well coordinated with Hanford contractors, and to have the program understood well enough that all stakeholders would have confidence in the work performed by the program to reduce or elimated spread of radioactive contamination by biotic vectors. Communication of successes and changes to an integrated biological control system instituted in 1999 at the Department of Energy's Hanford Site have required regular interfaces with not only a diverse group of Hanford contractors (i.e., those responsible for liquid or tank waste, solid wastes, environmental restoration, science and technology, and site infrastructure), and general Hanford employees, but also with a consortium of designated stake holders organized as the Hanford Advisory Board (i.e., Native American tribes, various environmental groups, local citizens, Washington state and Oregon regulatory agencies, etc.). Direct interface meetings, individual communication where appropriate, and transparency of the biological control program were the methods and outcome of this effort.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Distributionally robust polynomial chance-constraints under mixture ambiguity sets

Given $\mathrm{X}\subset\mathbb{R}^n, ε \in (0,1)$, a parametrized family of probability distributions $(μ_a)_{a\in \mathrm{A}}$ on $\mathrm{Ω}\subset \mathbb{R}^p$, we consider the feasible set $\mathrm{X}^*_ε \subset\mathrm{X}$ associated with the distributionally robust chance-constraint $\mathrm{X}^*_ε = \mathrm{x \in X : Prob}_μ[f(\mathrm{x}, ω) >0] > 1 - ε, \forall μ \in \mathscr{M}_{\mathrm{a}}$}, where $\mathscr{M}_{\mathrm{a}}$ is the set of all possibles mixtures of distributions $μ_{\mathrm{a}}, \mathrm{a \in A}$. For instance and typically, the family $\mathscr{M}_{\mathrm{a}}$ is the set of all mixtures of Gaussian distributions on $\mathbb{R}$ with mean and standard deviation $\mathrm{a}=(a,σ)$ in some compact set $\mathrm{A}\subset \mathbb{R}^2$. We provide a sequence of inner approximations $\mathrm{X}^d_ε = {\mathrm{x \in X} : w_d(\mathrm{x}) < ε}, d \in \mathbb{N}$, where $w_d$ is a polynomial of degree d whose vector of coefficients is an optimal solution of a semidefinite program. The size of the latter increases with the degree d. We also obtain the strong and highly desirable asymptotic guarantee that $λ(\mathrm{X}^*_ε$\$\mathrm{X}^d_ε$) → 0 as d increases, where λ is the Lebesgue measure on X. Same results are also obtained for the more intricated case of distributionally robust “joint” chance-constraints. Finally, there is a price to pay for this strong asymptotic guarantee which is the scalability of such a numerical scheme, and so far this important drawback makes it limited to problems of modest dimension.

97 MATHEMATICS AND COMPUTING↗

Topological Link Models of Multipartite Entanglement

We introduce a novel model of multipartite entanglement based on topological links, generalizing the graph/hypergraph entropy cone program. We demonstrate that there exist link representations of entropy vectors which provably cannot be represented by graphs or hypergraphs. Furthermore, we show that the contraction map proof method generalizes to the topological setting, though now requiring oracular solutions to well-known but difficult problems in knot theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization Based Data Mining Approah for Forecasting Real-Time Energy Demand

The worldwide concern over environmental degradation, increasing pressure on electric utility companies to meet peak energy demand, and the requirement to avoid purchasing power from the real-time energy market are motivating the utility companies to explore new approaches for forecasting energy demand. Until now, most approaches for forecasting energy demand rely on monthly electrical consumption data. The emergence of smart meters data is changing the data space for electric utility companies, and creating opportunities for utility companies to collect and analyze energy consumption data at a much finer temporal resolution of at least 15-minutes interval. While the data granularity provided by smart meters is important, there are still other challenges in forecasting energy demand; these challenges include lack of information about appliances usage and occupants behavior. Consequently, in this paper, we develop an optimization based data mining approach for forecasting real-time energy demand using smart meters data. The objective of our approach is to develop a robust estimation of energy demand without access to these other building and behavior data. Specifically, the forecasting problem is formulated as a quadratic programming problem and solved using the so-called support vector machine (SVM) technique in an online setting. The parameters of the SVM technique are optimized using simulated annealing approach. The proposed approach is applied to hourly smart meters data for several residential customers over several days.

data mining↗

Worst configurations (instantons) for compressed sensing over reals: a channel coding approach

We consider Linear Programming (LP) solution of a Compressed Sensing (CS) problem over reals, also known as the Basis Pursuit (BasP) algorithm. The BasP allows interpretation as a channel-coding problem, and it guarantees the error-free reconstruction over reals for properly chosen measurement matrix and sufficiently sparse error vectors. In this manuscript, we examine how the BasP performs on a given measurement matrix and develop a technique to discover sparse vectors for which the BasP fails. The resulting algorithm is a generalization of our previous results on finding the most probable error-patterns, so called instantons, degrading performance of a finite size Low-Density Parity-Check (LDPC) code in the error-floor regime. The BasP fails when its output is different from the actual error-pattern. We design CS-Instanton Search Algorithm (ISA) generating a sparse vector, called CS-instanton, such that the BasP fails on the instanton, while its action on any modification of the CS-instanton decreasing a properly defined norm is successful. We also prove that, given a sufficiently dense random input for the error-vector, the CS-ISA converges to an instanton in a small finite number of steps. Performance of the CS-ISA is tested on example of a randomly generated 512 * 120 matrix, that outputs the shortest instanton (error vector) pattern of length 11.

99 GENERAL AND MISCELLANEOUS↗

Load Forecasting Based Distribution System Network Reconfiguration -- A Distributed Data-Driven Approach

In this paper, a short-term load forecasting approach based network reconfiguration is proposed in a parallel manner. Specifically, a support vector regression (SVR) based short-term load forecasting approach is designed to provide an accurate load prediction and benefit the network reconfiguration. Because of the nonconvexity of the three-phase balanced optimal power flow, a second-order cone program (SOCP) based approach is used to relax the optimal power flow problem. Then, the alternating direction method of multipliers (ADMM) is used to compute the optimal power flow in distributed manner. Considering the limited number of the switches and the increasing computation capability, the proposed network reconfiguration is solved in a parallel way. The numerical results demonstrate the feasible and effectiveness of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Effective Vectorization with OpenMP 4.5

This paper describes how the Single Instruction Multiple Data (SIMD) model and its extensions in OpenMP work, and how these are implemented in different compilers. Modern processors are highly parallel computational machines which often include multiple processors capable of executing several instructions in parallel. Understanding SIMD and executing instructions in parallel allows the processor to achieve higher performance without increasing the power required to run it. SIMD instructions can significantly reduce the runtime of code by executing a single operation on large groups of data. The SIMD model is so integral to the processor s potential performance that, if SIMD is not utilized, less than half of the processor is ever actually used. Unfortunately, using SIMD instructions is a challenge in higher level languages because most programming languages do not have a way to describe them. Most compilers are capable of vectorizing code by using the SIMD instructions, but there are many code features important for SIMD vectorization that the compiler cannot determine at compile time. OpenMP attempts to solve this by extending the C++/C and Fortran programming languages with compiler directives that express SIMD parallelism. OpenMP is used to pass hints to the compiler about the code to be executed in SIMD. This is a key resource for making optimized code, but it does not change whether or not the code can use SIMD operations. However, in many cases critical functions are limited by a poor understanding of how SIMD instructions are actually implemented, as SIMD can be implemented through vector instructions or simultaneous multi-threading (SMT). We have found that it is often the case that code cannot be vectorized, or is vectorized poorly, because the programmer does not have sufficient knowledge of how SIMD instructions work.

97 MATHEMATICS AND COMPUTING↗

Modeling the Dynamics of Compromised Networks

Accurate predictive models of compromised networks would contribute greatly to improving the effectiveness and efficiency of the detection and control of network attacks. Compartmental epidemiological models have been applied to modeling attack vectors such as viruses and worms. We extend the application of these models to capture a wider class of dynamics applicable to cyber security. By making basic assumptions regarding network topology we use multi-group epidemiological models and reaction rate kinetics to model the stochastic evolution of a compromised network. The Gillespie Algorithm is used to run simulations under a worst case scenario in which the intruder follows the basic connection rates of network traffic as a method of obfuscation.

97 MATHEMATICS AND COMPUTING↗

Enhancers that direct gene expression to central nervous system vascular endothelial cells in vivo

CNS vascular endothelial cells (ECs) exhibit a distinctive gene expression program that is foundational for the blood-brain barrier (BBB). Previous research identified candidate cis-regulatory elements (CREs) that were hypothesized to control this program. In this work, transgenic mice and recombinant adeno-associated virus (rAAV) vectors have been used to interrogate these candidate CREs in vivo. These experiments show that an 850 bp genomic DNA segment ∼60 kb 5′ of Slc2a1 possesses enhancer activity that is (1) specific for BBB+ CNS ECs and (2) both necessary and sufficient for BBB+ EC gene expression. A screen of >8,000 genomic DNA segments from CNS EC-specific CRE candidates reveals several hundred with enhancer activity. Transcription factors ERG and LEF1 are shown to occupy sites in brain ECs that are highly enriched in candidate and experimentally validated CREs, lending strong support to a model in which canonical Wnt signaling activates the BBB program via LEF1.

CUT&RUN↗

Bounding the Higgs width at the LHC using full analytic results for $gg → e^- e^+ \mu^- \mu^+$

We revisit the hadronic production of the four-lepton final state, e – e + μ – μ + , through the fusion of initial state gluons. This process is mediated by loops of quarks and we provide first full analytic results for helicity amplitudes that account for both the effects of the quark mass in the loop and off-shell vector bosons. The analytic results have been implemented in the Monte Carlo program MCFM and are both fast, and numerically stable in the region of low Z transverse momentum. We use our results to study the interference between Higgs-mediated and continuum production of four-lepton final states, which is necessary in order to obtain accurate theoretical predictions outside the Higgs resonance region. We have confirmed and extended a recent analysis of Caola and Melnikov that proposes to use a measurement of the off-shell region to constrain the total width of the Higgs boson. Using a simple cut-and-count method, existing LHC data should bound the width at the level of 25-45 times the Standard Model expectation. We investigate the power of using a matrix element method to construct a kinematic discriminant to sharpen the constraint. Furthermore, in our analysis the bound on the Higgs width is improved by a factor of about 1.6 using a simple cut on the MEM discriminant, compared to an invariant mass cut μ 4l > 300 GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Physics with polarized light ions at an EIC

Physics with polarized light nuclei such as He-3, and at JLab also vector- and tensor polarized deuterium, form an important part of the EIC program. Polarization, and a capability of high-resolution detection of all the outgoing target fragments in coincidence with the scattered electron and any particles produced in the current jet, allows the EIC to tackle physics at the crossroads between deep-inelastic scattering (QCD factorization, partonic structure) and low-energy nuclear structure (nuclear wave functions from many-body theory, spectral functions). A program with light nuclei at an EIC would include: 1) Neutron's partonic structure, essential for quark-flavor decomposition of the nucleon spin and the extraction of flavor non-singlet sea quark distributions. 2) The bound nucleon in QCD - the modifications of the single nucleon's structure due to nuclear binding and the quark/gluon origin of the nuclear force. 3) Collective quark/gluon fields. Coherent scattering, in which the nucleus remains intact, probes the quark/gluon field of the entire nucleus. Similar information comes from diffractive scattering on deuterium, where the tensor polarized structure function of is zero in single-nucleon scattering and precisely identifies the QCD double-scattering contribution.

Nadel-Turonski, Pawel↗

NLO Jet Physics with BlackHat

We present several results obtained using the BLACKHAT next-to-leading order QCD program library, in conjunction with SHERPA. In particular, we present distributions for vector boson plus 1,2,3-jet production at the Tevatron and at the asymptotic running energy of the Large Hadron Collider, including new Z + 3-jet distributions. The Z + 2-jet predictions for the second-jet P{sub T} distribution are compared to CDF data. We present the jet-emission probability at NLO in W + 2-jet events at the LHC, where the tagging jets are taken to be the ones furthest apart in pseudorapidity. We analyze further the large left-handed W{sup {+-}} polarization, identified in our previous study, for W bosons produced at high P{sub T} at the LHC.

43 PARTICLE ACCELERATORS↗

Acceleration of Radiance for Lighting Simulation by Using Parallel Computing with OpenCL

We report on the acceleration of annual daylighting simulations for fenestration systems in the Radiance ray-tracing program. The algorithm was optimized to reduce both the redundant data input/output operations and the floating-point operations. To further accelerate the simulation speed, the calculation for matrix multiplications was implemented using parallel computing on a graphics processing unit. We used OpenCL, which is a cross-platform parallel programming language. Numerical experiments show that the combination of the above measures can speed up the annual daylighting simulations 101.7 times or 28.6 times when the sky vector has 146 or 2306 elements, respectively.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Errant Beam Detection Using the AMD Versal ACAP and Vitis AI

The prevalence of ML and AI-powered solutions along with the slowing of Moore's Law has given rise to novel hardware platforms aimed at accelerating ML and AI. While programming these hardware platforms can be difficult, particularly for non-hardware experts, hardware vendors provide high-level tooling in an effort to address this difficulty. The Versal ACAP is an SoC designed by AMD that combines CPU cores, FPGA fabric, and a tiled, vector architecture called an AI engine all on the same socket. In an effort to more easily program this heterogeneous system, AMD has provided the Vitis AI development stack. In this work, we leverage Vitis AI to program a Versal ACAP to perform errant beam detection in the Spallation Neutron Source at Oak Ridge National Laboratory. Our initial work shows that after quantization and compilation of the model for the Versal ACAP, the classification accuracy, as measured by the AUC metric, is over 95% accurate while achieving this accuracy in 46 microseconds on average.

Cabrera, Anthony↗

TMD program at JLab

Measurements of multiplicities and asymmetries of multiparticle final states in wide kinematics, including dihadrons and vector mesons, will be crucial for a separation of different structure functions, and different contributions to specific structure functions, used in phenomenological studies of Semi-Inclusive DIS (SIDIS). Measurements of various beam Single Spin Asymmetries are discussed as a possible tool to separate different kinematical regions as well as different dynamical contributions. Precision measurements in JLab, including detailed studies of the $Q^2$ dependences of observables, would also allow testing the impact of several theoretical assumptions used in phenomenological studies of generalized PDFs (GPDs, TMDs) , also providing a mechanism for validation of the extraction frameworks, which is critical for the proper evaluation of systematic uncertainties.

Avagyan, Harutyun↗