Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “symbolic”

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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Isotropic N-point basis functions and their properties

Isotropic functions of positions r 1 , r 2 ,..., r N , i.e. functions invariant under simultaneous rotations of all the coordinates, are conveniently formed using spherical harmonics and Clebsch–Gordan coefficients. An orthonormal basis of such functions provides a formalism suitable for analyzing isotropic distributions such as those that arise in cosmology, for instance in the clustering of galaxies as revealed by large-scale structure surveys. The algebraic properties of the basis functions are conveniently expressed in terms of 6-j and 9-j symbols. Finally, the calculation of relations among the basis functions is facilitated by 'Yutsis' diagrams for the addition and recoupling of angular momenta.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The Chlamydomonas Genome Project, version 6: reference assemblies for mating type plus and minus strains reveal extensive structural mutation in the laboratory

Five versions of the Chlamydomonas reinhardtii reference genome have been produced over the last two decades. Here we present version 6, bringing significant advances in assembly quality and structural annotations. PacBio-based chromosome-level assemblies for two laboratory strains, CC-503 and CC-4532, provide resources for the plus and minus mating type alleles. We corrected major misassemblies in previous versions and validated our assemblies via linkage analyses. Contiguity increased over ten-fold and >80% of filled gaps are within genes. We used Iso-Seq and deep RNA-seq datasets to improve structural annotations, and updated gene symbols and textual annotation of functionally characterized genes via extensive manual curation. We discovered that the cell wall-less classical reference strain CC-503 exhibits genomic instability potentially caused by deletion of the helicase RECQ3, with major structural mutations identified that affect >100 genes. We therefore present the CC-4532 assembly as the primary reference, although this strain also carries unique structural mutations and is experiencing rapid proliferation of a Gypsy retrotransposon. We expect all laboratory strains to harbor gene-disrupting mutations, which should be considered when interpreting and comparing experimental results. Collectively, the resources presented here herald a new era of Chlamydomonas genomics and will provide the foundation for continued research in this important reference organism.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Quadrupolar interactions between acceptor pairs in $\mathcal{p}$-doped semiconductors

Here, we consider the interaction between acceptor pairs in doped semiconductors in the limit of large interacceptor separation relevant for low doping densities. Modeling individual acceptors via the spherical model of Baldereschi and Lipari, we calculate matrix elements of the quadrupole tensor between the four degenerate ground states and show that the acceptor has a nonzero quadrupole moment. As a result, the dominant contribution to the large-separation acceptor-acceptor interaction comes from direct (charge-density) terms rather than exchange terms. The quadrupole is the leading nonzero moment, so the electric quadrupole-quadrupole interaction dominates for large separation. We calculate the matrix elements of the quadrupole-quadrupole interaction Hamiltonian in a product-state basis and diagonalize, obtaining a closed-form expression for the energies and degeneracies of the sixteen-state energy spectrum. All dependence on material parameters enters via an overall prefactor, resulting in surprisingly simple and universal results. This simplicity is due, in part, to a mathematical happenstance, the nontrivial vanishing of a particular Wigner 6-$\mathcal{j}$ symbol, $^\{\frac{^2_3}{\small2} \frac{^2_3}{\small2} \frac{^2_3}{\small2}$$^\}$ = 0. Results are relevant to the control of two-qubit interactions in quantum computing implementations based on acceptor spins, as well as calculations of the thermodynamic properties of insulating $\mathcal{p}$-type semiconductors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Bosonic crystalline symmetry protected topological phases beyond the group cohomology proposal

It is demonstrated by explicit construction that three-dimensional bosonic crystalline symmetry protected topological (cSPT) phases are classified by $H^5_\phi(G; \mathbb{Z})⊕H^1_\phi(G; \mathbb{Z})$ for all 230 space groups $\textit{G}$, where $H^n_\phi(G; \mathbb{Z})$ denotes the $\textit{n}$th twisted group cohomology of $\textit{G}$ with $\mathbb{Z}$ coefficients, and $\phi$ indicates that $\textit{g ε G}$ acts nontrivially on coefficients by sending them to their inverses if $\textit{g}$ reverses space-time orientation and acts trivially otherwise. The previously known summand $H^5_\phi(G;\mathbb{Z})$ corresponds only to crystalline phases built without the $E_8$ state or its multiples on 2-cells of space. It is the crystalline analog of the “group cohomology proposal” for classifying bosonic symmetry protected topological (SPT) phases, which takes the form $H^{d + 2}_\phi(G; \mathbb{Z}) ≅ H^{d + 1}_\phi(G; \text{U}(1))$ for finite internal symmetry groups in d spatial dimensions. The new summand $H^1_\phi(G; \mathbb{Z})$ classifies possible configurations of $E_8$ states on 2-cells that can be used to build crystalline phases beyond the group cohomology proposal. The completeness of our classification and the physical meaning of $H^1_\phi(G; \mathbb{Z})$ are established through a combination of dimensional reduction, surface topological order, and explicit cellular construction. The value of $H^1_\phi(G; \mathbb{Z})$ can be easily read off from the international symbol for $\textit{G}$. In this work, our classification agrees with the prediction of the “generalized cohomology hypothesis,” which concerns the general structure of the classification of SPT phases, and therefore provides strong evidence for the validity of the said hypothesis in the realm of crystalline symmetries.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Analytic Gaussian covariance matrices for galaxy N-point correlation functions

Here, we derive analytic covariance matrices for the N-point correlation functions (NPCFs) of galaxies in the Gaussian limit. Our results are given for arbitrary N and projected onto the isotropic basis functions given by spherical harmonics and Wigner 3j symbols. A numerical implementation of the 4PCF covariance is compared to the sample covariance obtained from a set of lognormal simulations, Quijote dark matter halo catalogues, and MultiDark-Patchy galaxy mocks, with the latter including realistic survey geometry. The analytic formalism gives reasonable predictions for the covariances estimated from mock simulations with a periodic-box geometry. Furthermore, fitting for an effective volume and number density by maximizing a likelihood based on Kullback-Leibler divergence is shown to partially compensate for the effects of a nonuniform window function. Our result is recently shown to facilitate NPCF analysis on a realistic survey data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Model-independent predictions for decays of hidden-heavy hadrons into pairs of heavy hadrons

Hidden-heavy hadrons can decay into pairs of heavy hadrons through transitions from confining Born-Oppenheimer potentials to hadron-pair potentials with the same Born-Oppenheimer quantum numbers. The transitions are also constrained by conservation of angular momentum and parity. From these constraints, we derive model-independent selection rules for decays of hidden-heavy hadrons into pairs of heavy hadrons. The coupling potentials are expressed as sums of products of Born-Oppenheimer transition amplitudes and angular-momentum coefficients. If there is a single dominant Born-Oppenheimer transition amplitude, it factors out of the coupling potentials between hidden-heavy hadrons in the same Born-Oppenheimer multiplet and pairs of heavy hadrons in specific heavy-quark-spin-symmetry doublets. If furthermore the kinetic energies of the heavy hadrons are much larger than their spin splittings, we obtain analytic expressions for the relative partial decay rates in terms of Wigner 6 j and 9 j symbols. We consider in detail the decays of quarkonia and quarkonium hybrids into the lightest heavy-meson pairs. For quarkonia, our model-independent selection rules and relative partial decay rates agree with previous results from quark-pair-creation models in simple cases and give stronger results in other cases. For quarkonium hybrids, we find disagreement even in simple cases. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Towards Automated Reasoning Chains for Verification of LLM-Generated Scientific Code

With the rise of Large Language Model (LLM) generated code, including in domains like scientific computing, ensuring not only syntactical, but also mathematical correctness, has become a critical task. Traditional formal methods approaches often struggle with the ambiguity of floating-point code, and full symbolic execution is extremely costly and limited. We propose a chain-of-reasoning approach that iteratively lifts basic semantics from code into the SPIRAL system and then establishes numerical equivalency to the desired mathematical operation. Here, we leverage the ample mathematical knowledge already formalized in SPIRAL to enable the system to recognize not just different implementations of the same algorithm but fully separate approaches to solving the given problem. The chain establishes tight error bounds on the output of given code with respect to the true continuous solution it approximates, quantifying all sources of error. We demonstrate this approach by establishing the correctness of a pseudospectral solver for a simple 1-dimensional Poisson problem.

Oschatz, Quentin [Carnegie Mellon University,Pitts↗
DOE OSTI2022

Resource Allocation for Single Carrier Massive MIMO Systems

Resource allocation in orthogonal frequency division multiplexing (OFDM) systems is performed through allocating blocks of subcarriers to each user. Even though OFDM is the primary waveform for 5G NR systems, research reports have noted that single carrier modulation (SCM) offers several advantages over OFDM in massive multiple input multiple output (MIMO) systems, making it a preferred candidate for some future applications such as massive machine type communications (mMTC). This paper presents a method for SCM resource allocation and the relevant information recovery algorithms at the receiver. Our emphasis is on cyclic prefixed SCM, where highly flexible and efficient frequency domain detection algorithms enable the operation of many simultaneous users in a massive MIMO uplink scenario. The proposed resource allocation method allows the number of users to exceed the number of antennas at the base station (BS). Each single carrier transmission is partitioned into L interleaved streams, and each user is allocated a number of such streams. One major benefit of SCM is that each data symbol is spread over the entire bandwidth. As such, the receiver performance is dictated by the average channel gain across the transmission band rather than the channel gain at a given frequency bin or a small group of frequencies. In the proposed setup, each stream may be thought of as a resource block in SCM, analogous to resource blocks in OFDM. Hence, in the context of this paper, the terms resource blocks and streams may be used interchangeably.

5G and Beyond Communications↗
DOE OSTI2021

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multi-threaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0x and 6.8x on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3x over the multi-thread encoder on two 28-core Xeon Platinum 8280 CPUs.

Tian, Jiannan↗
DOE OSTI2022

Autonomous Wireless Technology Detection in Seamless IoT Applications

The ever-increasing use of Internet of Things (IoT) devices results in the implementation of multiple wireless technologies that would not only cater their data rate requirements but also support various applications. To optimize the energy efficiency and security of the wireless transmission, it is imperative to identify the wireless technologies in various IoT implementations. Many of the existing approaches are based on measuring only the receiving signal strength indicator (RSSI). However, such approaches may not work well because of transmit power control and complex channel variations among different wireless technologies. In this article, we propose an autonomous wireless detection scheme that considers multiple distinguishable physical (PHY)-layer settings for real-time identification of wireless technologies for real-time applications. Specifically, the proposed scheme relies on the PHY-layer measurements of the targeted spectrum. Transmission settings, such as bandwidth, carrier frequency, and RSSI are estimated from the raw in-phase and quadrature-phase (I/Q) measurements. In addition, a symbol-level extraction scheme is implemented to extract unique features of modulation settings. These aforementioned features are applied to a machine learning process to identify the received wireless technologies. Compared with raw I/Q measurements, the extracted features are much simplified and, thus, the machine learning classifier can be designed with a simple structure for fast processing on IoT nodes. Finally, the proposed schemes are primarily evaluated theoretically, followed by implementing them on a USRP software-defined radio (SDR)-based hardware testbed. The evaluation results demonstrate high accuracy in the real-time detection of different wireless technologies for seamless IoT applications.

42 ENGINEERING↗
DOE OSTI2023

Warping Functions Design for Long Warped ZT-DFT-s-OFDM

Time-frequency warped waveform is a novel type of well-contained waveform composed of raised cosine (RC) pulses with roll-off factors profile customized for spectrally efficient signal containment. The waveform is suited for massive machine-type communication (mMTC), and Internet-of-Things (IoT) applications. The paper is a follow-up to the original work of time-frequency warped waveforms; here, we are proposing a warping function suited for length-independent symbols, which is missing from the previous work. The paper proposes the design steps starting from a piecewise warping function with parts of straight segments and other curved parts. A maximum Out-of-band leakage is used as a criterion to determine the warping function parameters. The roll-off factors profile determined in the previous study is used as a minimum bound for the leakage limits. Gains are presented over Windowed Zero-tail Discrete Fourier Transform-spread-Orthogonal Frequency Division Multiplexing (ZT-DFT-s-OFDM) in the simulations section.

Ibrahim, Mostafa↗
DOE OSTI2024

Toward Automated Detection of Portability Bugs in Kokkos Parallel Programs

Performance-portable programming frameworks provide abstractions for parallel execution to allow easily porting an application to multiple backend programming models, such as CUDA, HIP, and OpenMP. However, programs may still have portability bugs that manifest only on specific backends. Traditional testing is ineffective in discovering these bugs, as it would require concrete execution on all supported hardware configurations for a potentially infinite set of inputs. To mitigate this issue, we focused on a specific programming framework, Kokkos, and identified several categories of common portability bugs. We then developed Klokkos, a static analysis approach based on symbolic execution that can run on commodity hardware, before execution on supercomputers. As a proof-of-concept, we ran Klokkos on examples encoding the identified bugs. Our results show that Klokkos is effective, efficient, and precise: it detected all the considered bugs, quickly, and without any false positives. Although preliminary, our results motivate further research and development in this direction.

Kale, Vivek↗
DOE OSTI2021

FTK: A Simplicial Spacetime Meshing Framework for Robust and Scalable Feature Tracking

In this work, we present the Feature Tracking Kit (FTK), a framework that simplifies, scales, and delivers various feature-tracking algorithms for scientific data. The key of FTK is our simplicial spacetime meshing scheme that generalizes both regular and unstructured spatial meshes to spacetime while tessellating spacetime mesh elements into simplices. The benefits of using simplicial spacetime meshes include (1) reducing ambiguity cases for feature extraction and tracking, (2) simplifying the handling of degeneracies using symbolic perturbations, and (3) enabling scalable and parallel processing. The use of simplicial spacetime meshing simplifies and improves the implementation of several feature-tracking algorithms for critical points, quantum vortices, and isosurfaces. As a software framework, FTK provides end users with VTK/ParaView filters, Python bindings, a command line interface, and programming interfaces for feature-tracking applications. We demonstrate use cases as well as scalability studies through both synthetic data and scientific applications including tokamak, fluid dynamics, and superconductivity simulations. We also conduct end-to-end performance studies on the Summit supercomputer. FTK is open sourced under the MIT license: https://github.com/hguo/ftk.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Frequency Domain Detection and Precoding for Massive MIMO With Single Carrier Modulation

Single carrier modulation (SCM) schemes are attractive for uplink (UL) transmissions due to improved power efficiency at the user equipment (UE) transmitter compared with multi-carrier modulation schemes. In a massive MIMO scenario with SCM, the UL detection must mitigate the effects of inter-symbol interference and multiuser interference. This processing is effectively performed in the frequency domain (FD) using a minimum mean squared error (MMSE) detector when the transmission is framed with a cyclic prefix. This paper presents a MMSEbased detector that is compatible with distributed processing in a time-division duplex (TDD) system. The matrix inverses computed for the UL detection are then reused to perform multi-user precoding for the downlink (DL). We find that this scheme yields a tremendous savings in computational complexity compared to commonly used zero-forcing (ZF) precoding without sacrificing any performance. Since MMSE processing introduces a bias to the estimates, we then derive the scalar coefficients necessary to cancel the MMSE bias. The impact of channel estimation errors are analyzed for both the UL and DL cases in conjunction with a power-efficient approach to SCM channel estimation. Moreover, extensive simulations are performed to confirm our theoretical findings.

42 ENGINEERING↗
DOE OSTI2021

Unexpected Scaling of Peak Acceleration for a Yielding Mass-Spring System Subjected to a Triangular Base Acceleration Pulse

The use of bounding scenarios is a common practice that greatly simplifies the design and qualification of structures. However, this approach implicitly assumes that the quantities of interest increase monotonically with the input to the structure, which is not necessarily true for nonlinear structures. This paper surveys the literature for observations of nonmonotonic behavior of nonlinear systems and finds such observations in both the earthquake engineering and applied mechanics literature. Numerical simulations of a single degree-of-freedom mass-spring system with an elastic–plastic spring subjected to a triangular base acceleration pulse are then presented, and it is shown that the relative acceleration of this system scales nonmonotonically with the input magnitude in some cases. The equation of motion for this system is solved symbolically and an approximate expression for the relative acceleration is developed, which qualitatively agrees with the nonmonotonic behavior seen in the numerical results. The nonmonotonicity is investigated and found to be a result of dynamics excited by the discontinuous derivative of the base acceleration pulse, the magnitude of which scales nonmonotonically with the input magnitude due to the fact that the first yield of the spring occurs earlier as the input magnitude is increased. The relevance of this finding within the context of defining bounding scenarios is discussed, and it is recommended that modeling be used to perform a survey of the full range of possible inputs prior to defining bounding scenarios.

42 ENGINEERING↗
DOE OSTI2021

Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis

Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier analysis is that it can be used to minimize an estimate of the spectral radius of a stationary iteration, or the condition number of a preconditioned system, in terms of a symbol representation of the algorithm. In practice, this is a “minimax” problem, minimizing with respect to solver parameters the appropriate measure of work, which involves maximizing over the Fourier frequency. Often, several algorithmic parameters may be determined by local Fourier analysis in order to obtain efficient algorithms. Analytical solutions to minimax problems are rarely possible beyond simple problems; the status quo in local Fourier analysis involves grid sampling, which is prohibitively expensive in high dimensions. In this paper, we propose and explore optimization algorithms to solve these problems efficiently. Finally, several examples, with known and unknown analytical solutions, are presented to show the effectiveness of these approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A supernodal all-pairs shortest path algorithm

We show how to exploit graph sparsity in the Floyd-Warshall algorithm for the all-pairs shortest path (Apsp) problem. Floyd-Warshall is an attractive choice for Apsp on high-performing systems due to its structural similarity to solving dense linear systems and matrix multiplication. However, if sparsity of the input graph is not properly exploited, Floyd-Warshall will perform unnecessary asymptotic work and thus may not be a suitable choice for many input graphs. To overcome this limitation, the key idea in our approach is to use the known algebraic relationship between Floyd-Warshall and Gaussian elimination, and import several algorithmic techniques from sparse Cholesky factorization, namely, fill-in reducing ordering, symbolic analysis, supernodal traversal, and elimination tree parallelism. When combined, these techniques reduce computation, improve locality and enhance parallelism. We implement these ideas in an efficient shared memory parallel prototype that is orders of magnitude faster than an efficient multi-threaded baseline Floyd-Warshall that does not exploit sparsity. Our experiments suggest that the Floyd-Warshall algorithm can compete with Dijkstra's algorithm (the algorithmic core of Johnson's algorithm) for several classes sparse graphs.

Sao, Piyush↗
DOE OSTI2023

A Verified Optimizer for Quantum Circuits

We present VOQC, the first verified optimizer for quantum circuits, written using the Coq proof assistant. Quantum circuits are expressed as programs in a simple, low-level language called SQIR, a small quantum intermediate representation, which is deeply embedded in Coq. Optimizations and other transformations are expressed as Coq functions, which are proved correct with respect to a semantics of SQIR programs. SQIR programs denote complex-valued matrices, as is standard in quantum computation, but we treat matrices symbolically to reason about programs that use an arbitrary number of quantum bits. SQIR’s careful design and our provided automation make it possible to write and verify a broad range of optimizations in VOQC, including full-circuit transformations from cutting-edge optimizers.

97 MATHEMATICS AND COMPUTING↗