Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “CALL”

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,099 records · Page 61

Dynamics and potentials

A dynamics (i.e. a one-parameter group of automorphisms) of a system described by a C *-algebra with a local structure in terms of C *-subalgebras A (I ) for local domains I of the physical space (a discrete lattice) is normally constructed out of potentials P (I ), each of which is a self-adjoint element of the subalgebra A (I ), such that the the first time derivative of the dynamical change of any local observable A is i times the convergent sum of the commutator [ P (I ), A ] over all finite regions I. We will invert this relation under the assumption (obviously assumed in the usual approach) that local observables all have the first time derivative, i.e. we prove the existence of potentials for any given dynamics satisfying the above-stated condition. Furthermore, by imposing a further condition for the potential P (I ) to be chosen for each I that it does not have a portion which can be shifted to potentials for any proper subset of I, we also show (1) the existence, (2) uniqueness, (3) an automatic convergence property for the sum over I, and (4) a quite convenient property for the chosen potential. The so-obtained properties (3) and (4) are not assumed and are very useful, though they were never noticed nor used before. We consider a system of finite kinds of finite spins and fermions on a discrete lattice, local regions being all finite subsets of the lattice and all local algebras being full matrix algebras of finite dimensions. For all dynamics for which all elements of any local algebra is once time differentiable, we prove that there exist a system of potentials which describe the time derivative of the given dynamics by a convergent sum stated above. The fundamental technique for finding such potentials is a non-commutative expectation which is defined on the basis of a product state of the algebra. For each choice of a product state, we obtain one expectation which produces one set of potentials, all of which satisfy what we call the standardness condition and the convergence condition. We call this family of potentials standard potentials (corresponding to any specific choice of the product state). The standard potentials corresponding to different product states are different but produces the same time derivative, known as equivalent potentials.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Topics in theory of generalized parton distributions

Several topics in the theory of generalized parton distributions (GPDs) are reviewed. First, we give a brief overview of the basics of the theory of generalized parton distributions and their relationship with simpler phenomenological functions, viz. form factors, parton densities and distribution amplitudes. Then, we discuss recent developments in building models for GPDs that are based on the formalism of double distributions (DDs). A special attention is given to a careful analysis of the singularity structure of DDs. The DD formalism is applied to construction of a model GPDs with a singular Regge behavior. Within the developed DD-based approach, we discuss the structure of GPD sum rules. It is shown that separation of DDs into the so-called “plus” part and the D -term part may be treated as a renormalization procedure for the GPD sum rules. This approach is compared with an alternative prescription based on analytic regularization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Behaviors of impurity in ITER plasma with standard type I ELMy H-mode and steady-state scenarios

Self-consistent simulations of impurity behaviors in ITER plasmas in standard Type I ELMy H-mode and steady-state scenarios are investigated using 1.5D BALDUR integrated predictive modeling code. In these simulations, the plasma core transports, including electron and ion thermal, hydrogenic and impurity transports, are predicted using a linear combination of anomalous and neoclassical transports. An anomalous transport is calculated using a theory-based Multimode (MMM95) model; while the neoclassical transport is calculated using NCLASS model. The temperature and density boundary conditions are described at the top of the pedestal. Two different models for hydrogenic and impurity boundary density conditions are considered. The first model is called a 'static boundary density model,' in which the hydrogenic and impurity densities at the boundary are fixed. For the second model, called a 'dynamic boundary density model,' the hydrogenic and impurity densities at the boundary are assumed to be a large fraction of its line-averaged density. For simplicity, the pedestal temperature is assumed to be a constant in all simulations. The combination of a core transport model together with the boundary density models is used to simulate the time evolution of plasma current, temperature, and density profiles for ITER plasmas in standard type I ELMy H-mode and steady-state scenarios. As a result, the behaviors of impurity in ITER plasmas can be investigated. It is found in both ITER scenarios that the total amount of impurity, including beryllium and helium, in plasma core increases rapidly in early state and reaches a steady-state value. The level of impurity content in the steady state depends sensitively on the impurity boundary conditions. The effective charge at the edge is found to be about 1.4 and 1.1 using a static boundary density model and a dynamic boundary density model, respectively. It is also found that the hydrogenic and impurity transports in ITER plasmas for both scenarios is dominated by the kinetic ballooning modes, while the ITG and TEM modes provide the largest contributions for both thermal transports in most of region. In addition, a sensitivity study is carried out to investigate the impacts of pedestal temperature, pedestal density and line-averaged density on the impurity behaviors. It is found that increasing the pedestal temperature results in a reduction of the impurity content. On the other hand, increasing the pedestal density, line-averaged density or impurity influx result in an increase of the impurity content.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗

A Linear-Complexity Tensor Butterfly Algorithm for Compressing High-Dimensional Oscillatory Integral Operators

This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.

Kielstra, P Michael↗

Controlled gate networks: theory and application to eigenvalue estimation

We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm (Choi et al. in Phys Rev Lett 127(4):040505, 2021. https://doi.org/10.1103/PhysRevLett.127.040505) using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics.

Bee-Lindgren, Max [Georgia Institute of Technology↗

Transverse energy–energy correlations of jets in the electron–proton deep inelastic scattering at HERA

We study the event shape variables, transverse energy–energy correlation TEEC (cosφ) and its asymmetry ATEEC (cosφ) in deep inelastic scattering (DIS) at the electron–proton collider HERA, where φ is the angle between two jets defined using a transverse-momentum (k T ) jet algorithm. At HERA, jets are defined in the Breit frame, and the leading nontrivial transverse energy–energy correlations arise from the 3-jet configurations. With the help of the NLOJET++, these functions are calculated in the leading order (LO) and the next-to-leading order (NLO) approximations in QCD at the electron–proton center-of-mass energy $\sqrt{s}$ = 314 GeV. We restrict the angular region to -0.8 ≤ cosφ ≤ 0.8, as the forward- and backward-angular regions require resummed logarithmic corrections, which we have neglected in this work. Following experimental jet-analysis at HERA, we restrict the DIS-variables x, y = Q 2 /(xs), where Q 2 = -q 2 is the negative of the momentum transfer squared q 2 , to 0 ≤ x ≤ 1, 0.2 ≤ y ≤ 0.6, and the pseudo-rapidity variable in the laboratory frame (η lab ) to the range -1 ≤ η lab ≤ 2.5. The TEEC and ATEEC functions are worked out for two ranges in Q 2 , defined by 5.5GeV 2 ≤ Q 2 ≤ 80GeV 2 , called the low-Q 2 -range, and 150GeV 2 ≤ Q 2 ≤ 1000GeV 2 , called the high-Q 2 -range. We show the sensitivity of these functions on the parton distribution functions (PDFs), the factorization (μ F ) and renormalization (μ R ) scales, and on α s (M$^2_Z$). Of these the correlations are stable against varying the scale μ F and the PDFs, but they do depend on μ R . For the choice of the scale μ R =$\sqrt{\langle ET \rangle^2+Q^2}$, advocated in earlier jet analysis at HERA, the shape variables TEEC and ATEEC are found perturbatively robust. These studies are useful in the analysis of the HERA data, including the determination of α s (M$^2_Z$) from the shape variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

AEDGE: Atomic Experiment for Dark Matter and Gravity Exploration in Space

We propose in this White Paper a concept for a space experiment using cold atoms to search for ultra-light dark matter, and to detect gravitational waves in the frequency range between the most sensitive ranges of LISA and the terrestrial LIGO/Virgo/KAGRA/INDIGO experiments. This interdisciplinary experiment, called Atomic Experiment for Dark Matter and Gravity Exploration (AEDGE), will also complement other planned searches for dark matter, and exploit synergies with other gravitational wave detectors. We give examples of the extended range of sensitivity to ultra-light dark matter offered by AEDGE, and how its gravitational-wave measurements could explore the assembly of super-massive black holes, first-order phase transitions in the early universe and cosmic strings. AEDGE will be based upon technologies now being developed for terrestrial experiments using cold atoms, and will benefit from the space experience obtained with, e.g., LISA and cold atom experiments in microgravity. This paper is based on a submission (v1) in response to the Call for White Papers for the Voyage 2050 long-term plan in the ESA Science Programme. ESA limited the number of White Paper authors to 30. However, in this version (v2) we have welcomed as supporting authors participants in the Workshop on Atomic Experiments for Dark Matter and Gravity Exploration held at CERN: ({\tt https://indico.cern.ch/event/830432/}), as well as other interested scientists, and have incorporated additional material.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Synchrotron light sources in developing countries

Here, we discuss the role that synchrotron light sources, such as SESAME, could play in improving the socioeconomic conditions in developing countries. After providing a brief description of a synchrotron light source, we discuss the important role that they played in the development of several economically emerging countries. Then we describe the state of synchrotron science in South Africa and that country’s leadership role in founding the African Light Source initiative. Next, we highlight a new initiative called Lightsources for Africa, the Americas & Middle East Project, which is a global initiative led by the International Union of Pure and Applied Physics and the International Union of Crystallography, with initial funding provided by the International Council for Science. Finally, we comment on a new technology called the multibend achromat that has launched a new paradigm for the design of synchrotron light sources that should be attractive for construction in developing countries.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Barrier elision for production parallel programs

Large scientific code bases are often composed of several layers of runtime libraries, implemented in multiple programming languages. In such situation, programmers often choose conservative synchronization patterns leading to suboptimal performance. In this paper, we present context-sensitive dynamic optimizations that elide barriers redundant during the program execution. In our technique, we perform data race detection alongside the program to identify redundant barriers in their calling contexts; after an initial learning, we start eliding all future instances of barriers occurring in the same calling context. We present an automatic on-the-fly optimization and a multi-pass guided optimization. We apply our techniques to NWChem - a 6 million line computational chemistry code written in C/C++/Fortran that uses several runtime libraries such as Global Arrays, ComEx, DMAPP, and MPI. Our technique elides a surprisingly high fraction of barriers (as many as 63%) in production runs. This redundancy elimination translates to application speedups as high as 14% on 2048 cores. Our techniques also provided valuable insight about the application behavior, later used by NWChem developers. Overall, we demonstrate the value of holistic context-sensitive analyses that consider the domain science in conjunction with the associated runtime software stack.

97 MATHEMATICS AND COMPUTING↗

Compiler-Directed Soft Error Detection and Recovery to Avoid DUE and SDC via Tail-DMR

This article presents Clover, a compiler-directed soft error detection and recovery scheme for lightweight soft error resilience. The compiler carefully generates soft-error-tolerant code based on idempotent processing without explicit checkpoints. During program execution, Clover relies on a small number of acoustic wave detectors deployed in the processor to identify soft errors by sensing the wave made by a particle strike. To cope with DUEs (detected unrecoverable errors) caused by the sensing latency of error detection, Clover leverages a novel selective instruction duplication technique called tail-DMR (dual modular redundancy) that provides a region-level error containment. Once a soft error is detected by either the sensors or the tail-DMR, Clover takes care of the error as in the case of exception handling. To recover from the error, Clover simply redirects program control to the beginning of the code region where the error is detected. The experimental results demonstrate that the average runtime overhead is only 26%, which is a 75% reduction compared to that of the state-of-the-art soft error resilience technique. In addition, this article evaluates an alternative technique called tail-wait, comparing it to Clover. According to the evaluation with the different processor configurations and the various error detection latencies, Clover turns out to be a superior technique, achieving 1.06 to 3.49× speedup over the tail-wait.

Computer Science↗

A Survey of Intrusion Detection Systems Leveraging Host Data

This survey focuses on intrusion detection systems (IDS) that leverage host-based data sources for detecting attacks on enterprise network. The host-based IDS (HIDS) literature is organized by the input data source, presenting targeted sub-surveys of HIDS research leveraging system logs, audit data, Windows Registry, file systems, and program analysis. While system calls are generally included in audit data, several publicly available system call datasets have spawned a flurry of IDS research on this topic, which merits a separate section. To accommodate current researchers, a section giving descriptions of publicly available datasets is included, outlining their characteristics and shortcomings when used for IDS evaluation. Related surveys are organized and described. All sections are accompanied by tables concisely organizing the literature and datasets discussed. Finally, challenges, trends, and broader observations are throughout the survey and in the conclusion along with future directions of IDS research. Overall, this survey was designed to allow easy access to the diverse types of data available on a host for sensing intrusion, the progressions of research using each, and the accessible datasets for prototyping in the area.

97 MATHEMATICS AND COMPUTING↗

QCOR; A Language Extension Specification for the Heterogeneous Quantum-Classical Model of Computation

Quantum computing (QC) is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for QC were designed with fault-tolerant hardware in mind, envisioning stand-alone applications. However, the susceptibility of near-term quantum computers to noise limits their stand-alone utility. To better leverage limited computational strengths of noisy quantum devices, hybrid algorithms have been suggested whereby quantum computers are used in tandem with their classical counterparts in a heterogeneous fashion. This modus operandi calls out for a programming model and a high-level programming language that natively and seamlessly supports heterogeneous quantum-classical hardware architectures in a single-source-code paradigm. Motivated by the lack of such a model, we introduce a language extension specification, called QCOR, which enables single-source quantum-classical programming. Programs written using the QCOR library–based language extensions can be compiled to produce functional hybrid binary executables. After defining QCOR’s programming model, memory model, and execution model, we discuss how QCOR enables variational, iterative, and feed-forward QC. Additionally, QCOR approaches quantum-classical computation in a hardware-agnostic heterogeneous fashion and strives to build on best practices of high-performance computing. The high level of abstraction in the language extension is intended to accelerate the adoption of QC by researchers familiar with classical high-performance computing.

97 MATHEMATICS AND COMPUTING↗

TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits

We propose the Tree-based Directed Acyclic Graph (TDAG) partitioning for quantum circuits, a novel quantum circuit partitioning method which partitions circuits by viewing them as a series of binary trees and selecting the tree containing the most gates. TDAG produces results of comparable quality (number of partitions) to an existing method called ScanPartitioner (an exhaustive search algorithm) with an 95% average reduction in execution time. Furthermore, TDAG improves compared to a faster partitioning method called QuickPartitioner by 38% in terms of quality of the results with minimal overhead in execution time.

Clark, Joseph↗

CYDRES: CYber Defense and REsilient System for securing grid-interactive efficient buildings

Smart buildings, especially Grid-interactive Efficient Buildings (GEBs), suffer from cyber-attacks and physical faults due to the integration of a large number of sensors and controls, connected devices, and associated communication networks. This study demonstrated a real-time advanced building resilient platform, called CYber Defense and REsilient System (CYDRES), which is deployable for existing and emerging Building Automation Systems (BASs). CYDRES aims to empower GEBs with cyber-attack-immune capabilities through multi-layer prevention and adaptation mechanisms to monitor, detect, and respond to cyber-attacks and physical operational faults. CYDRES is demonstrated through real-time experiments in a Hardware-in-the-Loop (HIL) testbed.

Building automation system, Cyber-attacks, Physica↗

Enabling Scalable VQE Simulation on Leading HPC Systems

Large-scale simulations of quantum circuits pose significant challenges, especially in the context of quantum chemistry, due to the number of qubits, circuit depth, and the number of circuits needed per problem. High-performance computing (HPC) systems offer massive computational capabilities that could help overcome these obstacles. We developed a high-performance quantum circuit simulator, called NWQ-Sim, and demonstrate its capability to simulate large quantum chemistry problems on NERSC's Perlmutter supercomputer. Integrating NWQ-Sim with XACC, we have executed QPE and VQE algorithms for downfolded quantum chemistry systems at unprecedented scales. Our work demonstrates the potential of leveraging HPC resources to advance quantum chemistry and other applications of near-term quantum devices.

Wang, Meng↗

Virtual Time III, Part 3: Throttling and Message Cancellation

This is Part 3 of a trio of papers that unify in a natural way the two historically distinct parallel discrete event synchronization paradigms, optimistic and conservative, combining the best properties of both into a single framework called Unified Virtual Time (UVT). In this part, we survey the synchronization effects that can be achieved by restricting to corner cases the relationships permitted among the control variables, GVT, CVT, TVT, and LVT, which were defined in Part 1. Here we also survey various throttling policies from the literature and describe how they can be implemented in UVT by controlling the value of TVT, including policies that can take advantage of rollback in addition to LP blocking. A significant result is a new category of efficient and higher precision throttling algorithms for optimistic execution that are based on optimistic lookahead, defined in a way that is symmetric to what we now call the conservative lookahead information that is traditionally used for conservative synchronization. Finally, we present a novel algorithm allowing the choice between lazy and aggressive cancellation to be made on a message-by-message basis using either external logic expressed in the model code, or policy code internal to the simulator, or a mixture of both.

throttling↗

HPC Campaign Management: Remote data access with user-defined error bound using ADIOS and ZFP

Remote access to large-scale scientific datasets, like those generated by combustion simulations or other high-performance computing (HPC) applications, presents a significant challenge. Downloading entire datasets is often impractical due to their size and the bandwidth limitations of typical networks. To address this challenge, we propose a novel approach that enables efficient remote access to large datasets distributed across multiple facilities. Our method enables technologies to download only the data values of a select variable, in a select region of interest, to a user-defined accuracy. For this purpose, we extended the ADIOS IO library to provide read functions with user-defined accuracy, a remote data server that understands multidimensional selections of specific variables, steps and accuracy from an ADIOS dataset, and which uses lossy compression on the remote site to reduce the data to be transferred back to the client. In addition, our extension of the ADIOS library collects metadata from multiple datasets in small files called Campaign Archives, which can be shared among project participants on any HPC, cloud or laptop, and which can easily facilitate the discovery of content and pointers to the data location as well as remote access to the data by local tools as if data was local. This feature called Campaign Management, enables a group of scientists to manage related datasets stored in multiple files, across multiple facilities as if it was in a single file/database. We demonstrate the effectiveness of our approach using a 1.5 TB dataset from the S3D combustion simulation on Frontier at the Oak Ridge Leadership Facility. Even a single variable from this dataset, at 64 GB, is too large to be processed on a standard laptop. We show two different reading patterns for 2D plots and 3D visualization, with careful settings that a scientist studying combustion data would do and show that running the same Python scripts on Frontier directly takes comparable time than running them on the local laptop with remote access to the data on Frontier.

Podhorszki, Norbert [ORNL] (ORCID:000000019647542X↗