Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Np”

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 919 records · Page 51
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A.I. for nuclear physics

Nuclear science is concerned with the understanding of the nature of matter, its basic constituents and their interaction to form the elements and the properties we observe. This includes the forms of matter we see around us and also exotic forms such as those that existed in the first moments after the Big Bang and that exist today inside neutron stars. The techniques, tools, and expertise needed for nuclear physics (NP) research are therefore diverse in nature. State-of-the art accelerators are being developed to illuminate the dynamical basis of the core of the atom in terms of the fundamental constituents called quarks and gluons and to increase the number of isotopes with known properties. This scientific infrastructure is reaching scales and complexities that require computational methods for tasks such as anomaly detection in operational data. New methodologies are needed to detect anomalies and to optimize operating parameters, predict failures as well as to discover new optimization algorithms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Angularly resolved photoionization dynamics in atoms and molecules combining temporally and spectrally resolved experiments at ATTOLab and Synchrotron SOLEIL

We report results for XUV-IR two-photon ionization of Ar, Ne, NO, and O2, where an XUV attosecond pulse train is superimposed with a synchronized IR pulse, obtained at the ATTOLab laser facility using electron–ion coincidence 3D momentum spectroscopy. Temporally resolved photoelectron angular distributions providing angle-resolved time-delays for np ionization of Ar and Ne, achieved by reconstruction of attosecond beating by interference of two-photon transitions through a unified formalism (Joseph et al. in J Phys B At Mol Opt Phys 53:184007, 2020), are summarized. For inner valence XUV-IR dissociative photoionization of NO and O2 molecules, we report electron–ion kinetic energy correlation diagrams and disentangle the dissociative photoionization processes relying on parallel XUV experiments at Synchrotron SOLEIL. For ionization into the NO+(c3Π) ionic state, extending the formalism developed for single-photon ionization, we focus on photoelectron angular distributions averaged on the delay between the XUV and the IR field in the field frame, molecular frame, and electron frame of reference.

Joseph, J↗
DOE OSTI2021

cuTS: Scaling Subgraph Isomorphism on Distributed Multi-GPUSystems Using Trie Based Data Structure

Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such as chem-informatics, bioinformatics, databases, and social network analysis. It is computationally expensive and is a proven NP-hard problem. The massive parallelism offered by the GPU hardware is well suited for solving the subgraph isomorphism. However, current GPU implementations are far from the achievable performance. Moreover, the enormous memory requirement of current approaches limits the problem size that can be handled. This work analyzes the fundamental challenges associated with processing the subgraph isomorphism on GPUs and develops an efficient GPU hardware-aware implementation. We also develop a new GPU-friendly trie-based data structure to drastically reduce the intermediate storage space requirement. Hence, our approach runs larger benchmarks than the competitors. We also develop the first distributed sub-graph isomorphism algorithm for GPUs. Our experimental evaluation section demonstrates the efficacy of our approach by comparing the execution time and number of cases that we can handle against the state-of-the-art GPU implementations.

Xiang, Lizhi↗
DOE OSTI2023

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling process collecting reverse reachability information in the IMM algorithm over large real-world social networks. We present an adaptive and memory-efficient optimization approach for a state-of-the-art multi-threaded parallel influence maximization algorithm. Our approach,HuffMax, uses a portion of the reverse reachable (RR) sets collected by the algorithm to learn the characteristics of the graph. Then, it compresses the intermediate reverse reachability information with Huffman coding, and queries directly on the compressed data to preserve the memory savings obtained through compression. We also propose an efficient sampling strategy based on the distribution of RR sets, which can further reduce the computation time for typical social networks with long-tail distributions. Considering a NUMA architecture, we scale up our solution on 128-core CPUs and reduce the memory footprint by up to 45.7% with negligible time overhead (or even faster) and without perceivable loss of accuracy.

Chen, Xinyu↗
DOE OSTI2023

High-Level Synthesis of Irregular Applications: A Case Study on Influence Maximization

The Influence Maximization problem is the problem of identifying a small cohort of actors from a broader population that, when initially activated in a diffusion process, are expected to result in a large number of activations in the population. While the problem is known to be NP-hard, several approximation algorithms have been devised by leveraging its submodular structure. While these algorithms are theoretically efficient, they are computationally very expensive in practice. This work advances the current state-of-the-art parallelization scheme for the IMM algorithm by devising the adoption of custom hardware accelerators implemented on FPGAs by leveraging High Level Synthesis from OpenCL. We study the performance of our proposed approach by exploring optimizations tailored at improving the parallel efficiency of the accelerators and highlight their effects and limitations in accelerating complex graph analytic applications. Our experimental evaluation shows that FPGA acceleration can improve the performance of the LT diffusion model up to 1.72x for the entire application and up to 2.90x for its most important kernel with respect to a CPU only parallel execution. The FPGA acceleration of the LT model shows also a 1.54x reduction in energy consumption when compared to a parallel CPU only run.

Neff, Reece W.↗
DOE OSTI2023

cuAlign: Scalable Network Alignment on GPU Accelerators

Given two graphs, the objective of network alignment is to find the best one-to-one mapping of vertices in one graph (??) to vertices in the other (??), such that the number of overlaps is maximized. We say that edges(??, ??) ???and(??', ??') ??? are overlapped if ?? is mapped to ??' and ?? is mapped to??'. Network alignment is an important optimization problem with several applications in bioinformatics, computer vision and ontology matching. Since it is an NP-hard problem, efficient heuristics and scalable implementations are necessary. In this work, we introduce a new framework that combines the concepts of intra-network proximity using vertex embedding,Belief Propagation (BP) and approximate weighted matching, and provides qualitative improvements up to22%over state-of-the-art approaches. We also provide scalable implementations on GPU accelerators, demonstrating up to19×speedup for Belief Propagation and 3× speedup for approximate weighted matching relative to previous multithreaded implementation. A combination of combinatorial and algebraic kernels within the network alignment algorithm poses significant hurdles for parallelization. Load imbalance and irregular DRAM traffic limit achievable performance on GPUs. Our novel approach identifies and exploits unique structural proper-ties of the BP-based algorithm and employs code fusion to reduce data movement between different steps of the algorithm. Using a diverse set of inputs, we demonstrate qualitative improvements of our algorithms, and performance gains of our GPU-accelerated implementation. We believe that our work will enable algorithmic improvements and practical applications of network alignment.

Xiang, Lizhi↗
DOE OSTI2026

T-FSM: A Scalable Distributed Task-Based System for Frequent Subgraph Pattern Mining from a Big Graph

Finding frequent subgraph patterns in a big graph is an important problem with many applications such as classifying chemical compounds and building indexes to speed up graph queries. Since this problem is NP-hard, some recent parallel and distributed systems have been developed to accelerate the mining. However, they often have a huge memory cost, very long running time, suboptimal load balancing, poor scale-out capability, and possibly inaccurate results. In this article, we propose an efficient system called T-FSM for parallel mining of frequent subgraph patterns in a big graph. T-FSM supports a new anti-monotonic frequentness measure called Fraction-Score, which is more accurate than the widely used MNI measure. The execution engine of T-FSM supports both intra-machine parallelism and inter-machine parallelism. For intra-machine parallelism, T-FSM adopts a novel task-based execution model to ensure high multithreading concurrency, bounded memory consumption, and effective load balancing. For inter-machine parallelism, T-FSM ensures good scale-out performance with a lightweight pattern rebalancing approach that reduces workload skewness of pattern evaluations among machines. To avoid recomputing the contexts for migrated patterns, we design a novel context cache table to support concurrent and asynchronous requesting and caching of remote context data, which can timely evict and garbage collect used pattern contexts that are no longer needed to keep memory consumption bounded. Extensive experiments show that T-FSM is orders of magnitude faster than existing state-of-the-art parallel systems (more than 10×, 51×, 131×, 55× speedup over ScaleMine, DistGraph, Pangolin and Peregrine, respectively) and distributed systems (more than 42× and 88× over ScaleMine and DistGraph, respectively) for frequent subgraph pattern mining, and it scales out satisfactorily to 512 CPU cores on the Polaris supercomputer at Argonne National Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Modeling Script

This script illustrates the advantages of loychikSD_NP, e.g. acts as a demonstration of the higher-order spectral density.

Loychik, Neil↗
DOE OSTI2024

Progress on Pu-238 production at Idaho National Laboratory from February 2022 to July 2023

Idaho National Laboratory (INL) has continued to qualify irradiation positions in the Advanced Test Reactor (ATR) for Pu-238 production to support NASA deep space missions. Over the past year, INL qualified Np-237 targets for ATR’s North East Flux Trap (NEFT), Inner-A and H positions. Work has begun to requalify the South Flux Trap (SFT) and to qualify the East Flux Trap (EFT) for the ATR GEN I target and is midway through the qualification process. This paper gives an overview of operational and technical activities from February 2022 to July 2023.

07 ISOTOPE AND RADIATION SOURCES↗
DOE OSTI2025

Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach

Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.

connectivity maintenance↗
DOE OSTI2020

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗
DOE OSTI2022

TRIPOLI-4 neutronics calculations for IAEA-CRP benchmark of CEFR start-up tests using new libraries JEFF-3.3 and ENDF/B-VIII

Sodium-cooled Fast Reactors (SFR) are one of the promising Generation IV fast reactors. The China Experimental Fast Reactor (CEFR) is a 65 MWth pool-type SFR with a high neutron leakage core using high enriched uranium oxide fuel. The CEFR start-up tests in 2010 consist of series of neutronics experiments. Essential experimental data are available from the 2018 IAEA-CEFR-CRP benchmark document and useful for the validation of neutron transport codes and nuclear data libraries. The TRIPOLI-4 Monte Carlo transport code is a general-purpose neutronics code using continuous-energy nuclear data libraries. It has a rich validation database covering different computational and experimental benchmark data sets to assure the accuracy and credibility of numerical studies. Previous TRIPOLI-4 SFR core physics calculations used mainly MOX fuels. SFR control rod worth studies with TRIPOLI-4 were mainly on big-size cores. To test the modeling capability of TRIPOLI-4 on fuel loading patterns and on variable control rods positions for SFRs and to check recent nuclear data libraries, it is interesting to investigate the CEFR start-up tests in this work, including core states from subcritical to supercritical, control rods and rod group worth, point kinetics parameters, and radial foil activation measurements. TRIPOLI-4 calculation results using new data libraries JEFF-3.3, ENDF/B-VIII, and those of ENDF/B-VII.1 for different CEFR core states are reported here. By means of different options of TRIPOLI-4, control-rod SAs reactivity worth, point kinetics parameters, and radial {sup 237}Np(n,f) fission rate distribution were successfully evaluated. Both ENDF/B-VIII and JEFF-3.3 nuclear data libraries provided reliable results with a difference of 170 +/- 11 pcm in k{sub eff}.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Efficacy of commercial recombinant HVT vaccines against a North American clade 2.3.4.4b H5N1 highly pathogenic avian influenza virus in chickens

The outbreak of clade 2.3.4.4b H5 highly pathogenic avian influenza (HPAI) in North America that started in 2021 has increased interest in applying vaccination as a strategy to help control and prevent the disease in poultry. Two commercially available vaccines based on the recombinant herpes virus of turkeys (rHVT) vector were tested against a recent North American clade 2.3.4.4b H5 HPAI virus isolate: A/turkey/Indiana/22-003707-003/2022 H5N1 in specific pathogen free white leghorn (WL) chickens and commercial broiler chickens. One rHVT-H5 vaccine encodes a hemagglutinin (HA) gene designed by the computationally optimized broadly reactive antigen method (COBRA-HVT vaccine). The other encodes an HA gene of a clade 2.2 virus (2.2-HVT vaccine). There was 100% survival of both chicken types COBRA-HVT vaccinated groups and in the 2.2-HVT vaccinated groups there was 94.8% and 90% survival of the WL and broilers respectively. Compared to the 2.2-HVT vaccinated groups, WL in the COBRA-HVT vaccinated group shed significantly lower mean viral titers by the cloacal route and broilers shed significantly lower titers by the oropharyngeal route than broilers. Virus titers detected in oral and cloacal swabs were otherwise similar among both vaccine groups and chicken types. To assess antibody-based tests to identify birds that have been infected after vaccination (DIVA-VI), sera collected after the challenge were tested with enzyme-linked lectin assay-neuraminidase inhibition (ELLA-NI) for N1 neuraminidase antibody detection and by commercial ELISA for detection of antibodies to the NP protein. As early as 7 days post challenge (DPC) 100% of the chickens were positive by ELLA-NI. ELISA was less sensitive with a maximum of 75% positive at 10DPC in broilers vaccinated with 2.2-HVT. Both vaccines provided protection from challenge to both types of chickens and ELLA-NI was sensitive at identifying antibodies to the challenge virus therefore should be evaluated further for DIVA-VI.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Foam Fracturing Study for Stimulation Development of Enhanced Geothermal Systems

This is a final technical report for the project: Foam Fracturing Study for Stimulation Development of Enhanced Geothermal Systems (EGS). The goal is to demonstrate the feasibility of foam fracturing in EGS applications. The project, led by Oak Ridge National Laboratory (ORNL), was conducted in collaboration with Temple University. The report describes the research activities with Task 1 at ORNL: foam fracturing testing system development and experimental study on foam fracturing, and Task 2 at Temple University: foam testing and foam characterization. Main findings are: 1. A foam fracturing test system has been developed at ORNL, which can be used to perform foam fracturing under pressure up to 6,000 psi. The system monitors foam density during fracturing online and is capable of testing materials in both monotonic and cyclic (up to 50 Hz) injections. 2. Foam fracturing tests were carried out on Charcoal black granite specimens with a blind borehole to the middle length. Two diameters of blind borehole were tested; G2 series: 9.53 mm and G3 series: 4.76 mm. N2-in-water foam was used with AOS as a surfactant. 3. There was a hole-size effect on fracture initiation pressure. The effect is smaller in the case of foam, which was influenced by the high penetrability of gas in foam. Breakdown pressure showed a behavior just as that of fracture pressure; namely an increased value for small hole samples, while the effect in water fracture was more impressive than in foam fracture. 4. Water mass was reduced in foam fracturing within similar range of breakdown pressures. In G2 series, it was decreased from 10.44 g for water fracturing to 5.17 g, representing more than 50% water reduction. Therefore, there is the potential to reduce water use in EGS stimulation through foam fracturing. 5. Use of cyclic injection has the potential to reduce the breakdown pressure and seismicity in EGS application. Experiments using 4-s cycle period found that specimens can be fractured with a low number of cycles. The fatigue pressure was approximately 64 - 77% of monotonic breakdown pressure for water fracturing and 58 - 94% of the breakdown pressure for foam fracturing. 6. A foam stability testing system has been developed that can test foam at 220 Deg C to 2,000 psi. Tested components of candidate foams included two gases: N2 and CO2; 4 surfactants: AOS, SDS, NP-40 and CTAC; 5 stabilizing agents: guar, bentonite clay, borate salt, silica NPs, and GO. 7. N2 and AOS provided the most stable performance over the tested ranges. Furthermore, the AOS foam with stabilizing agents of guar and borate salt (crosslinker) offered the highest half-life of 20 minutes at 200 Deg C and 1,000 psi. 8. Arrhenius equation and modified power law have been demonstrated to fit well the half-time vs. temperature and pressure data, respectively. These relations can be useful to provide the suggestion for future foam stability study. This submission contains the supporting data developed during the project: 1) A final technical report 2) Granite fracturing data in monotonic and cyclic injections with water and N2 foam Foam performance data in various temperatures and pressures, including half-time, is submitted separately.

15 GEOTHERMAL ENERGY↗
DOE OSTI2021

Experimental Images and Videos of Foam Stability (Half-life)

The experimental data obtained in this project is the thermal stability data of various foams measured using the setup established at Temple University during this study. The setup is installed with a portable digital camera which can take images and videos of foam evolution at a given pressure and temperature condition. Consequently, the half-life data was recorded from the images/videos, which are used as a measure of the thermal stability for foams. Over the 3 years of this project, four different surfactants and five different stabilizing agents were studied. The surfactants are, Alfa Olefin Sulfonate (AOS), Sodium Dodecyl Sulphate (SDS), Tergitol (NP-40), and Cetyltrimethylammonium chloride (CTAC). The stabilizing agents are, guar gum, bentonite clay, crosslinking agents, silicon dioxide nanoparticles (60 to 70nm), and graphene oxide dispersions. Foam stability was evaluated at different temperatures between 100C and 200cC, while the foam generation pressure varied between atmospheric pressure (14.7 psi) and 1000 psi. The images are saved as .jpg file and videos are saved as .avi files.

15 GEOTHERMAL ENERGY↗
DOE OSTI2023

Enhanced cutoff energies for direct and rescattered strong-field photoelectron emission of plasmonic nanoparticles

Abstract The efficient generation, accurate detection, and detailed physical tracking of energetic electrons are of applied interest for high harmonics generation, electron-impact spectroscopy, and femtosecond time-resolved scanning tunneling microscopy. We here investigate the generation of photoelectrons (PEs) by exposing plasmonic nanostructures to intense laser pulses in the infrared (IR) spectral regime and analyze the sensitivity of PE spectra to competing elementary interactions for direct and rescattered photoemission pathways. Specifically, we measured and numerically simulated emitted PE momentum distributions from prototypical spherical gold nanoparticles (NPs) with diameters between 5 and 70 nm generated by short laser pulses with peak intensities of 8.0 × 10 12 and 1.2 × 10 13 W/cm 2 , demonstrating the shaping of PE spectra by the Coulomb repulsion between PEs, accumulating residual charges on the NP, and induced plasmonic electric fields. Compared to well-understood rescattering PE cutoff energies for strong-field photoemission from gaseous atomic targets (10× the ponderomotive energy), our measured and simulated PE spectra reveal a dramatic cutoff-energy increase of two orders of magnitude with a significantly higher contribution from direct photoemission. Our findings indicate that direct PEs reach up to 93 % of the rescattered electron cutoff energy, in contrast to 20 % for gaseous atoms, suggesting a novel scheme for the development of compact tunable tabletop electron sources.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗