Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Symbolic computing”

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 163 records · Page 9

Modeling of the metal–insulator transition temperature in alio-valently doped VO 2 through symbolic regression

The correlated semiconductor vanadium dioxide (VO 2 ) exhibits an insulator–metal transition (IMT) near room temperature, which is of interest in various device applications. Precise IMT temperature control is crucial to determine the use cases across technologies such as thermochromic windows, actuators for robots or neuronal oscillators. Doping the cation or anion sites can modulate the IMT by several tens of degrees and control hysteresis. However, modeling the effects of control parameters (e.g., doping concentration, type of dopants) is challenging due to complex experimental procedures and limited data, hindering the use of traditional data-driven machine learning approaches. Symbolic regression (SR) can bridge this gap by identifying nonlinear expressions connecting key input parameters to target properties, even with small data sets. In this work, we develop SR models to capture the IMT trends in VO 2 influenced by different dopant parameters. Using experimental data from the literature, our study reveals a dual nature of the IMT temperature with varying tungsten (W) doping concentrations. The symbolic model captures data trends and accounts for experimental variability, providing a complementary approach to first-principles calculations. Our feature-driven analysis across a broader class of dopants informs selectivity and provides qualitative insights into tuning phase transition properties valuable for neuromorphic computing and thermochromic windows.

36 MATERIALS SCIENCE↗

PaRSEC: A Software Framework for Performance and Productivity on Hybrid, Manycore Platforms

As the era of computer architectures dominated by serial processors ends, the convergence of several unprecedented challenges suggests that closing the longstanding "application–architecture performance gap" will become more challenging than ever. To address this problem, the Parallel Runtime Scheduling and Execution Control (PaRSEC) project created a modular software framework that achieved two major objectives: first, it built a task-based runtime capable of delivering portable performance to a wide range of science and engineering applications at all levels of the platform pyramid, including the upcoming 100 Pflop/s systems and then exascale; and second, it supported and facilitated the work of developers in migrating their legacy codes and writing entirely new ones for the emerging hybrid and massively parallel manycore processor system designs. PaRSEC will support multiple domain-specific languages capable of increasing the developers' productivity while also providing the runtime with the constructs and flexibility necessary to exploit the maximal parallelism from parallel applications. Extensive preliminary research in dense linear algebra showed convincingly that a parameterized task graph representation that symbolically describes the algorithm content can achieve the project's twofold objective within that domain. The research also strongly suggested that this powerful method could be generalized to a far-wider variety of applications.

97 MATHEMATICS AND COMPUTING↗

Landau singularities of the 7-point ziggurat. Part I

We compute the leading (first-type Landau) singularities of a certain four-loop 7-point graph that is related to the 7-point “ziggurat” graph by the graphical moves familiar from equivalent circuit theory. We find perfect agreement with a subset of the “heptagon symbol alphabet” that has appeared in the context of planar Ν = 4 super-Yang-Mills theory. The remaining heptagon symbol letters are found in its subleading Landau singularities, which we address in a companion paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

On the atomic line profiles in high pressure plasmas

In a previous contribution to this journal [H. P. Stormberg, J. Appl. Phys. 51(4), 1963 (1980)], Stormberg presented an analytical expression for the convolution of Lorentz and Levy line profiles, which models atomic radiative transitions in high pressure plasmas. Unfortunately, the derivations are flawed with errors and the final expression, while correct, is accompanied by misguiding comments about the meaning of the symbols used therein, in particular the “complex error function.” In this paper, we discuss the broadening mechanisms that give rise to Stormberg's model and present a correct derivation of his final result. We will also provide an alternative expression, based on the Faddeeva function, which has decisive computational advantages and emphasizes the real-valuedness of the result. The MATLAB/Octave scripts of our implementation have been made available on the publisher's website for future reference.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the analogues of Szegő's theorem for ergodic operators

Szegő's theorem on the asymptotic behaviour of the determinants of large Toeplitz matrices is generalized to the class of ergodic operators. The generalization is formulated in terms of a triple consisting of an ergodic operator and two functions, the symbol and the test function. It is shown that in the case of the one-dimensional discrete Schrödinger operator with random ergodic or quasiperiodic potential and various choices of the symbol and the test function this generalization leads to asymptotic formulae which have no analogues in the situation of Toeplitz operators. Bibliography: 22 titles.

97 MATHEMATICS AND COMPUTING↗

Model Elliptic Boundary-Value Problems for Pseudodifferential Operators in Canonical Nonsmooth Domains

We consider a simplest elliptic pseudodifferential equation in a multi-dimensional cone (multi-dimensional angle) and describe all possible structures of its solutions related to the wave factorization of the elliptic symbol. Depending on the index of wave factorization, we consider various statements of well-posed boundary-value problems. The existence of solutions is studied in Sobolev–Slobodetskii spaces.

97 MATHEMATICS AND COMPUTING↗

Chaos control of Hastings–Powell model by combining chaotic motions

In this paper, we propose a Parameter Switching (PS) algorithm as a new chaos control method for the Hastings–Powell (HP) system. The PS algorithm is a convergent scheme that switches the control parameter within a set of values while the controlled system is numerically integrated. The attractor obtained with the PS algorithm matches the attractor obtained by integrating the system with the parameter replaced by the averaged value of the switched parameter values. The switching rule can be applied periodically or randomly over a set of given values. In this way, every stable cycle of the HP system can be approximated if its underlying parameter value equalizes the average value of the switching values. Moreover, the PS algorithm can be viewed as a generalization of Parrondo's game, which is applied for the first time to the HP system, by showing that losing strategy can win: “losing + losing = winning.” If “loosing” is replaced with “chaos” and, “winning” with “order” (as the opposite to “chaos”), then by switching the parameter value in the HP system within two values, which generate chaotic motions, the PS algorithm can approximate a stable cycle so that symbolically one can write “chaos + chaos = regular.” Also, by considering a different parameter control, new complex dynamics of the HP model are revealed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A simple amplitude decision based symbol timing synchronization method for real-time IMDD-OOFDM systems

A simple amplitude decision based symbol timing synchronization method for real-time IMDD-OOFDM transmission systems is proposed and experimentally evaluated by using directly modulated DFB laser in 25 km SSMF. The experimental results show that the hardware resource consumption of the proposed synchronization technique is only 6% of the total system which can effectively release the computation complexity without sacrificing the synchronization accuracy. Less than 2 samples offset error of synchronization accuracy can be achieved at received optical power as low as − 20 dBm without employing correlation and multiplication operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reference Correlation for the Viscosity of Carbon Dioxide

A comprehensive database of experimental and computed data for the viscosity of carbon dioxide (CO 2 ) was compiled and a new reference correlation was developed. Literature results based on an ab initio potential energy surface were the foundation of the correlation of the viscosity in the limit of zero density in the temperature range from 100 K to 2000 K. Guided symbolic regression was employed to obtain a new functional form that extrapolates correctly to T → 0 K and to 10 000 K. Coordinated measurements at low density made it possible to implement the temperature dependence of the Rainwater-Friend theory in the linear-in-density viscosity term. The residual viscosity could be formulated with a scaling term ργ/T the significance of which was confirmed by symbolic regression. The final viscosity correlation covers temperatures from 100 K to 2000 K for gaseous CO 2 , and from 220 K to 700 K with pressures along the melting line up to 8000 MPa for compressed and supercritical liquid states. The data representation is more accurate than with the previous correlations, and the covered pressure and temperature range is significantly extended. The critical enhancement of the viscosity of CO 2 is included in the new correlation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Provenance–aware workflow for data quality management and improvement for large continuous scientific data streams

Data quality assessment, management and improvement is integral part of any big data intensive scientific research to ensure accurate, reliable and reproducible science discoveries. The task of maintaining the quality of data, however, is non-trivial and pose a challenge for a program like Department of Energy’s Atmospheric Radiation Measurement (ARM) that collects data from hundreds of instruments across the world,and distributes thousands of streaming data products that are continuously growing in near-real-time in an archive 1.7 Petabyte in size and growing. We present a computational data processing workflow to collect the data quality issue via an easy and intuitive web-based portal that allows reporting of any quality issues for any site, facility or instruments at a granularity down to individual variable in the data files. Portal allows instrument specialists and scientists to provide corrective actions in form of symbolic equation. A parallel processing framework applies the data improvement to large volume of data in efficient parallel environment, while optimizing data transfer and file I/O operations. Corrected files are systematically versioned and archived. A provenance tracking module tracks and records any change made to the data during its entire life cycle which are communicated transparently to the scientific users. Developed in Python using open source technologies, software architecture enables efficient and fast management and improvement of data in an operational data center environment.

Kumar, Jitendra↗

On amplitudes and field redefinitions

We derive an off-shell recursion relation for correlators that holds at all loop orders. This allows us to prove how generalized amplitudes transform under generic field redefinitions, starting from an assumed behavior of the one-particle-irreducible effective action. The form of the recursion relation resembles the operation of raising the rank of a tensor by acting with a covariant derivative. This inspires a geometric interpretation, whose features and flaws we investigate.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reduced models for ETG transport in the tokamak pedestal

This paper reports on the development of reduced models for electron temperature gradient (ETG) driven transport in the pedestal. Model development is enabled by a set of 61 nonlinear gyrokinetic simulations with input parameters taken from pedestals in a broad range of experimental scenarios. The simulation data have been consolidated in a new database for gyrokinetic simulation data, the multiscale gyrokinetic database (MGKDB), facilitating the analysis. The modeling approach may be considered a generalization of the standard quasilinear mixing length procedure. The parameter η, the ratio of the density to temperature gradient scale length, emerges as the key parameter for formulating an effective saturation rule. With a single order-unity fitting coefficient, the model achieves an error of 15%. A similar model for ETG particle flux is also described. We also present simple algebraic expressions for the transport informed by an algorithm for symbolic regression.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Genetic programming for interpretable, data-driven continuum damage models.

The damage mechanisms that lead to failure in engineering alloys have been studied extensively, but converting this knowledge into constitutive models that are suitable for engineering-scale analysis remains a challenge. Evolution laws for continuum damage have been developed in the past and have proven effective but suffer from many non-physical assumptions that inhibit the overall accuracy of the model. Further, the assumptions inherent in these existing models prevent them from being applicable to a broad class of materials. At the same time, computational models of fine-scale damage mechanisms continue to advance making it tractable to generate large training data sets through computer simulation. Data-driven machine learning approaches can leverage these data sets to avoid making limiting assumptions, and instead produce models directly from the results of microstructural simulations and/or experiments. Many of these machine learning approaches are rapid and accurate, but they offer little to no insight into the underlying relationships among state variables being discovered. Conversely, genetic programming symbolic regression (GPSR) is a machine learning method that produces analytic expressions relating the state variables, allowing maximal insight and interpretability. To that end, we propose using GPSR as a data-driven method of obtaining microstructurally informed continuum damage models. Data is generated using microstructural simulations of damage evolution, parameterized over microstructural statistics (i.e., pore shape) and nominally applied deformations. Analytic expressions for damage evolution are obtained from the data using GPSR, and these expressions are then utilized within a continuum constitutive model. Overall, this approach is a promising method of automatically obtaining analytic relations describing constitutive phenomena in a material.

Buche, Michael Robert↗

Communication systems, transceivers, and methods for generating data based on channel characteristics

Examples of methods for generating data based on a communications channel are described. In one such example, a processing unit may generate a first vector representation based in part on at least two characteristics of a communications channel. A constellation having at least two dimensions may be addressed with the first vector representation to identify a first symbol associated with the first vector representation. The constellation represents a plurality of regions, each region associated with a respective symbol. The symbol may be used to generate data, which may stored in an electronic storage medium and used as a cryptographic key or a spreading code or hopping sequence in a modulation technique.

97 MATHEMATICS AND COMPUTING↗

Camellia: A Rapid Development Framework for Finite Element Solvers

We report the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan guarantees the optimality of the finite element solution in a user-controllable energy norm, and provides several features supporting adaptive schemes. The approach provides stability automatically; there is no need for carefully derived numerical fluxes (as in DG schemes) or for mesh-dependent stabilization terms (as in stabilized methods). In this paper, we focus on features of Camellia that facilitate implementation of new DPG formulations; chief among these is a rich set of features in support of symbolic manipulation, which allow, e.g., bilinear formulations in the code to appear much as they would on paper. Many of these features are general in the sense that they can also be used in the implementation of other finite element formulations. In fact, because DPG’s requirements are essentially a superset of those of other finite element methods, Camellia provides built-in support for most common methods. We believe, however, that the combination of an essentially “hands-free” finite element methodology as found in DPG with the rapid development features of Camellia are particularly winsome, so we focus on use cases in this class. In addition to the symbolic manipulation features mentioned above, Camellia offers support for one-irregular adaptive meshes in 1D, 2D, 3D, and space-time. It provides a geometric multigrid preconditioner particularly suited for DPG problems, and supports distributed parallel execution using MPI. For its load balancing and distributed data structures, Camellia relies on packages from the Trilinos project, which simplifies interfacing with other computational science packages. Camellia also allows loading of standard mesh formats through an interface with the MOAB package. Camellia includes support for static condensation to eliminate element-interior degrees of freedom locally, usually resulting in substantial reduction of the cost of the global problem. Finally, we include a discussion of the variational formulations built into Camellia, with references to those formulations in the literature, as well as an MPI performance study.

97 MATHEMATICS AND COMPUTING↗

The Atomic Theory of Division and Intersection of Semiring Ideals

We consider two-sided ideals of semirings. More precisely, we study the theory of two-sided ideals in the signature consisting of the predicate symbol ⊆ and three function symbols that denote the intersection, right division, and left division of ideals. We prove the decidability of the set of those atomic formulas in this signature that are valid for all semirings and all valuations.

97 MATHEMATICS AND COMPUTING↗