Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “SYMBOL”

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 19 records

Encoding of symbols for a computer interconnect based on frequency of symbol values

Data are serially communicated over an interconnect between an encoder and a decoder. The encoder includes a first training unit to count a frequency of symbol values in symbol blocks of a set of N number of symbol blocks in an epoch. A circular shift unit of the encoder stores a set of most-recently-used (MRU) amplitude values. An XOR unit is coupled to the first training unit and the first circular shift unit as inputs and to the interconnect as output. A transmitter is coupled to the encoder XOR unit and the interconnect and thereby contemporaneously sends symbols and trains on the symbols. In a system, a device includes a receiver and decoder that receive, from the encoder, symbols over the interconnect. The decoder includes its own training unit for decoding the transmitted symbols.

SeyedzadehDelcheh, SeyedMohammad↗

Concealed identification symbols and nondestructive determination of the identification symbols

The concealing of one or more identification symbols into a target object and the subsequent determination or reading of such symbols through non-destructive testing is described. The symbols can be concealed in a manner so that they are not visible to the human eye and/or cannot be readily revealed to the human eye without damage or destruction of the target object. The identification symbols can be determined after concealment by e.g., the compilation of multiple X-ray images. As such, the present invention can also provide e.g., a deterrent to theft and the recovery of lost or stolen objects.

99 GENERAL AND MISCELLANEOUS↗

Automated Symbolic Upscaling: 1. Model Generation for Extended Applicability Regimes

Abstract In porous media theory, upscaling techniques are fundamental to deriving rigorous Darcy‐scale models for flow and reactive transport in subsurface systems. Due to limitations in classical techniques, a number of ad hoc approaches have been proposed to address physical regimes in which reactive time scales are similar to, or faster than, diffusive time scales. In Part 1 of this two part series, we present a strategy for expanding the applicability of classical homogenization theory by generalizing the assumed closure form. We detail the implementation of this strategy on two reactive mass transport problems with moderately reactive physics. The strategy produces nontrivial homogenized models with emergent terms and effective parameters that couple reactive, diffusive, and advective transport. The differences in equation forms between the macroscopic and pore‐scale descriptions advise caution to further studies where the forms of macroscopic equations are assumed, as opposed to rigorously derived. Numerical validation is provided for each problem to show that the error estimates of homogenization theory are satisfied, and to justify the implemented strategy. In Part 2, the presented strategy is automated using symbolic computing to expedite its implementation.

Pietrzyk, Kyle↗

Automated Symbolic Upscaling: 2. Model Generation for Extended Applicability Regimes

Abstract In this second part of the two paper series, we detail an algorithmic procedure for systematically implementing the generalized closure form strategy presented in Part 1. This strategy extends the applicability of homogenized models with respect to classical homogenization theory, as demonstrated in Part 1 where upscaled models are rigorously derived in moderately reactive physical regimes. After encoding the algorithm into Symbolica, an automated upscaling framework, we upscale two reactive mass transport problems and numerically validate the resulting nonlinear homogenized models by showing the absolute error estimates predicted by homogenization theory are satisfied. In both problems, nontrivial closure forms and closure problems are automatically formulated using the encoded strategy with no human interaction, nor prior knowledge regarding the closure required for the systems. We hope these demonstrations spark further interest in automated analytical frameworks for multiscale modeling, as such capabilities are invaluable for generating rigorous multiscale models of complex phenomena in porous media.

Pietrzyk, Kyle↗

Semiclassical analysis of the Wigner 12j symbol with one small angular momentum

We derive an asymptotic formula for the Wigner 12j symbol, in the limit of one small and 11 large angular momenta. There are two kinds of asymptotic formulas for the 12j symbol with one small angular momentum. We present the first kind of formula in this paper. Our derivation relies on the techniques developed in the semiclassical analysis of the Wigner 9j symbol [L. Yu and R. G. Littlejohn, Phys. Rev. A 83, 052114 (2011)], where we used a gauge-invariant form of the multicomponent WKB wave functions to derive asymptotic formulas for the 9j symbol with small and large angular momenta. When applying the same technique to the 12j symbol in this paper, we find that the spinor is diagonalized in the direction of an intermediate angular momentum. In addition, we find that the geometry of the derived asymptotic formula for the 12j symbol is expressed in terms of the vector diagram for a 9j symbol. This illustrates a general geometric connection between asymptotic limits of the various 3nj symbols. This work contributes an asymptotic formula for the 12j symbol to the quantum theory of angular momentum, and serves as a basis for finding asymptotic formulas for the Wigner 15j symbol with two small angular momenta.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GSoFa: Scalable Sparse Symbolic LU Factorization on GPUs

Decomposing a matrix $\mathbf {A}$ into a lower matrix $\mathbf {L}$ and an upper matrix $\mathbf {U}$, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matrix, LU decomposition often introduces more nonzero entries in the $\mathbf {L}$ and $\mathbf {U}$ factors than in the original matrix. A symbolic factorization step is needed to identify the nonzero structures of $\mathbf {L}$ and $\mathbf {U}$ matrices. Attracted by the enormous potentials of the Graphics Processing Units (GPUs), an array of efforts have surged to deploy various LU factorization steps except for the symbolic factorization, to the best of our knowledge, on GPUs. This article introduces gSoFa, the first GPU-based symbolic factorization design with the following three optimizations to enable scalable LU symbolic factorization for nonsymmetric pattern sparse matrices on GPUs. First, here we introduce a novel fine-grained parallel symbolic factorization algorithm that is well suited for the Single Instruction Multiple Thread (SIMT) architecture of GPUs. Second, we tailor supernode detection into a SIMT friendly process and strive to balance the workload, minimize the communication and saturate the GPU computing resources during supernode detection. Third, we introduce a three-pronged optimization to reduce the excessive space consumption problem faced by multi-source concurrent symbolic factorization. Taken together, gSoFa achieves up to 31× speedup from 1 to 44 Summit nodes (6 to 264 GPUs) and outperforms the state-of-the-art CPU project, on average, by 5×. Notably, gSoFa also achieves up to 47 percent of the peak memory throughput of a V100 GPU in the Summit Supercomputer.

97 MATHEMATICS AND COMPUTING↗

A symbol of uniqueness: the cluster bootstrap for the 3-loop MHV heptagon

Seven-particle scattering amplitudes in planar super-Yang-Mills theory are believed to belong to a special class of generalised polylogarithm functions called heptagon functions. These are functions with physical branch cuts whose symbols may be written in terms of the 42 cluster A-coordinates on Gr(4, 7). Motivated by the success of the hexagon bootstrap programme for constructing six-particle amplitudes we initiate the systematic study of the symbols of heptagon functions. We find that there is exactly one such symbol of weight six which satisfies the MHV last-entry condition and is finite in the 7 ll 6 collinear limit. This unique symbol is both dihedral and parity-symmetric, and remarkably its collinear limit is exactly the symbol of the three-loop six-particle MHV amplitude, although none of these properties were assumed a priori. It must therefore be the symbol of the threeloop seven-particle MHV amplitude. The simplicity of its construction suggests that the n-gon bootstrap may be surprisingly powerful for n > 6.

1/N Expansion↗

Language model-accelerated deep symbolic optimization

Symbolic optimization methods have been used to solve varied challenging and relevant problems such as symbolic regression and neural architecture search. However, the current state of the art typically learns each problem from scratch and is unable to leverage pre-existing knowledge and datasets that are available for many applications. Here, inspired by the similarity between sequence representations learned in natural language processing and the formulation of symbolic optimization as a discrete sequence optimization problem, we propose language model-accelerated deep symbolic optimization (LA-DSO), a method that leverages language models to learn symbolic optimization solutions more efficiently. We demonstrate LA-DSO in two tasks: symbolic regression, which allows us to perform extensive experimentation due to its low computation requirements, and computational antibody optimization, which shows that our proposal accelerates learning in challenging real-world problems.

97 MATHEMATICS AND COMPUTING↗

Semiclassical analysis of the Wigner 9j symbol with small and large angular momenta

We derive an asymptotic formula for the Wigner 9j symbol, in the limit of one small and eight large angular momenta, using a gauge-invariant factorization for the asymptotic solution of a set of coupled wave equations. Our factorization eliminates the geometric phases completely, using gauge-invariant noncanonical coordinates, parallel transports of spinors, and quantum rotation matrices. Our derivation generalizes to higher 3nj symbols. We display without proof some asymptotic formulas for the 12j symbol and the 15j symbol in the Appendices. This work contributes an asymptotic formula of the Wigner 9j symbol to the quantum theory of angular momentum and serves as an example of a general method for deriving asymptotic formulas for 3nj symbols.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MINING NUCLEAR TRANSIENT DATA THROUGH SYMBOLIC CONVERSION

Dynamic Probabilistic Risk Assessment (DPRA) methodologies generate enormous amounts of data for a very large number of simulations. The data contain temporal information of both the state variables of the simulator and the temporal status of specific systems/components. In order to measure system performances, limitations and resilience, such data need to be carefully analyzed with the objective of discovering the correlations between sequence/timing of events and system dynamics. A first approach toward discovering these correlations from data generated by DPRA methodologies has been performed by organizing scenarios into groups using classification or clustering based algorithms. The identification of the correlations between system dynamics and timing/sequencing of events is performed by observing the temporal distribution of these events in each group of scenarios. Instead of performing “a posteriori” analysis of these correlations, this paper shows how it is possible to identify the correlations implicitly by performing a symbolic conversion of both continuous (temporal profiles of simulator state variables) and discrete (status of systems and components) data. Symbolic conversion is performed for each simulation by properly quantizing both continuous and discrete data and then converting them as a series of symbols. After merging both series together, a temporal phrase is obtained. This phrase preserves duration, coincidence and sequence of both continuous and discrete data in a uniform and consistent manner. In this paper it is also shown that by using specific distance measures, it is still possible to post-process such symbolic data using clustering and classification techniques but in considerably less time since the memory needed to store the data is greatly reduced by the symbolic conversion.

97 MATHEMATICS AND COMPUTING↗

Elliptic symbol calculus: from elliptic polylogarithms to iterated integrals of Eisenstein series

We present a generalization of the symbol calculus from ordinary multiple polylogarithms to their elliptic counterparts. Here, our formalism is based on a special case of a coaction on large classes of periods that is applied in particular to elliptic polylogarithms and iterated integrals of modular forms. We illustrate how to use our formalism to derive relations among elliptic polylogarithms, in complete analogy with the non-elliptic case. We then analyze the symbol alphabet of elliptic polylogarithms evaluated at rational points, and we observe that it is given by Eisenstein series for a certain congruence subgroup. We apply our formalism to hypergeometric functions that can be expressed in terms of elliptic polylogarithms and show that they can equally be written in terms of iterated integrals of Eisenstein series. Finally, we present the symbol of the equal-mass sunrise integral in two space-time dimensions. The symbol alphabet involves Eisenstein series of level six and weight three, and we can easily integrate the symbol in terms of iterated integrals of Eisenstein series.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Spread Spectrum Symbol Detection With Blind Interference Suppression in FBMC-SS

Recent works have demonstrated Filter Bank Multicarrier Spread Spectrum (FBMC-SS) to be a robust communication scheme in the presence of high-power interferers. Existing FBMC-SS symbol detector designs based on analysis filter banks (AFB) suggest using an optimal combining scheme to suppress the interferers, necessitating some noise/interference power estimation method. In this paper, we introduce a symbol detector with blind interference suppression by extending a recently developed packet detection method. We then provide an analysis to show that the existing AFB-based symbol detector and the one proposed in this paper are equivalent in typical usage scenarios. A fully-fledged receiver design is proposed utilizing this symbol detector, with specifics presented for estimation of the channel impulse response and carrier frequency offset (CFO). We also outline a method of iterating upon the channel and CFO estimations to improve the quality of both parameters. Moreover, a modification to allow improved performance of the symbol detector at high SNR is provided. Finally, simulated performance results are presented to corroborate these findings and demonstrate the efficiency of this receiver design.

99 GENERAL AND MISCELLANEOUS↗

Deterministic symbolic regression with derivative information: General methodology and application to equations of state

Symbolic regression methods simultaneously determine the model functional form and the regression parameter values by generating expression trees. Symbolic regression can capture the complexity of real–world phenomena but the use of deterministic optimization for symbolic regression has been limited due to the complexity of the search space of existing formulations. Herein we present a novel deterministic mixed–integer nonlinear programming formulation for symbolic regression that incorporates derivative constraints through auxiliary expression trees. By applying the chain rule to mathematical operations, binary expression trees are capable of representing the calculation of first and second derivatives. We apply this formulation to illustrative examples using derivative information to show increased model discrimination capability. In addition, we perform a case study of a thermodynamic equation of state to gain insight on valid functional forms with thermodynamics–based constraints on the first and second derivatives.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The two-loop symbol of all multi-Regge regions

Here, we study the symbol of the two-loop n-gluon MHV amplitude for all Mandelstam regions in multi-Regge kinematics in N=4 super Yang-Mills theory. While the number of distinct Mandelstam regions grows exponentially with n, the increase of independent symbols turns out to be merely quadratic. We uncover how to construct the symbols for any number of external gluons from just two building blocks which are naturally associated with the six- and seven-gluon amplitude, respectively. The second building block is entirely new, and in addition to its symbol, we also construct a prototype function that correctly reproduces all terms of maximal functional transcendentality.

1/N expansion↗

Discovering nuclear models from symbolic machine learning

Numerous phenomenological nuclear models have been proposed to describe specific observables within different regions of the nuclear chart. However, developing a unified model that describes the complex behavior of all nuclei remains an open challenge. Here, we explore whether symbolic Machine Learning (ML) can rediscover traditional nuclear physics models or identify alternatives with improved simplicity, fidelity, and predictive power. To address this challenge, we developed a Multi-objective Iterated Symbolic Regression approach that handles symbolic regressions over multiple target observables, accounts for experimental uncertainties and is robust against high-dimensional problems. As a proof of principle, we applied this method to describe the nuclear binding energies and charge radii of light and medium mass nuclei. Our approach identified simple analytical relationships based on the number of protons and neutrons, providing interpretable models with precision comparable to state-of-the-art nuclear models. Additionally, we integrated this ML-discovered model with an existing complementary model to estimate the limits of nuclear stability. These results highlight the potential of symbolic ML to develop accurate nuclear models and guide our description of complex many-body problems.

Nuclear structure↗