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 505 records · Page 28

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↗

Computational solid mechanics (finite elements and boundary elements) - Present status and future directions

Computational finite-element and boundary-element methods are reviewed, and their application to the mechanics of solids is discussed. Stability conditions for general FEMs are considered in addition to the use of least-order, stable, invariant, or hybrid/mixed isoparametric elements as alternatives to the displacement-based isoparametric elements. The use of symbolic manipulation, adaptive mesh refinement, transient dynamic response, and boundary-element methods for linear elaslticity and finite-strain problems of inelastic materials are also discussed.

Atluri, S. N.↗

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↗

Programming language for computations in the Interkosmos program

The programming system for Intercosmos data processing, based on the structural programming theory, which considers a program as an ordered set of standardized elementary parts, from which the user programs are automatically generated, is described. The programs are comprised of several modules, which are briefly summarized. The general structure of the programming system is presented in a block diagram. A programming control language developed to formulate the problem quickly and completely is presented along with basic symbols which are characteristic of the Intercosmos programming system.

Schmidt, K.↗

Computer aiding for low-altitude helicopter flight

A computer-aiding concept for low-altitude helicopter flight was developed and evaluated in a real-time piloted simulation. The concept included an optimal control trajectory-generated algorithm based on dynamic programming, and a head-up display (HUD) presentation of a pathway-in-the-sky, a phantom aircraft, and flight-path vector/predictor symbol. The trajectory-generation algorithm uses knowledge of the global mission requirements, a digital terrain map, aircraft performance capabilities, and advanced navigation information to determine a trajectory between mission waypoints that minimizes threat exposure by seeking valleys. The pilot evaluation was conducted at NASA Ames Research Center's Sim Lab facility in both the fixed-base Interchangeable Cab (ICAB) simulator and the moving-base Vertical Motion Simulator (VMS) by pilots representing NASA, the U.S. Army, and the U.S. Air Force. The pilots manually tracked the trajectory generated by the algorithm utilizing the HUD symbology. They were able to satisfactorily perform the tracking tasks while maintaining a high degree of awareness of the outside world.

Swenson, Harry N.↗

Combining factual and heuristic knowledge in knowledge acquisition

A knowledge acquisition technique that combines heuristic and factual knowledge represented as two hierarchies is described. These ideas were applied to the construction of a knowledge acquisition interface to the Expert System Analyst (OPERA). The goal of OPERA is to improve the operations support of the computer network in the space shuttle launch processing system. The knowledge acquisition bottleneck lies in gathering knowledge from human experts and transferring it to OPERA. OPERA's knowledge acquisition problem is approached as a classification problem-solving task, combining this approach with the use of factual knowledge about the domain. The interface was implemented in a Symbolics workstation making heavy use of windows, pull-down menus, and other user-friendly devices.

Gomez, Fernando↗

Computer aiding for low-altitude helicopter flight

A computer-aiding concept for low-altitude helicopter flight was developed and evaluated in a real-time piloted simulation. The concept included an optimal control trajectory-generated algorithm based on dynamic programming, and a head-up display (HUD) presentation of a pathway-in-the-sky, a phantom aircraft, and flight-path vector/predictor symbol. The trajectory-generation algorithm uses knowledge of the global mission requirements, a digital terrain map, aircraft performance capabilities, and advanced navigation information to determine a trajectory between mission waypoints that minimizes threat exposure by seeking valleys. The pilot evaluation was conducted at NASA Ames Research Center's Sim Lab facility in both the fixed-base Interchangeable Cab (ICAB) simulator and the moving-base Vertical Motion Simulator (VMS) by pilots representing NASA, the U.S. Army, and the U.S. Air Force. The pilots manually tracked the trajectory generated by the algorithm utilizing the HUD symbology. They were able to satisfactorily perform the tracking tasks while maintaining a high degree of awareness of the outside world.

Swenson, Harry N.↗

Noncoherent DTTLs for Symbol Synchronization

Noncoherent data-transition tracking loops (DTTLs) have been proposed for use as symbol synchronizers in digital communication receivers. [Communication- receiver subsystems that can perform their assigned functions in the absence of synchronization with the phases of their carrier signals ( carrier synchronization ) are denoted by the term noncoherent, while receiver subsystems that cannot function without carrier synchronization are said to be coherent. ] The proposal applies, more specifically, to receivers of binary phase-shift-keying (BPSK) signals generated by directly phase-modulating binary non-return-to-zero (NRZ) data streams onto carrier signals having known frequencies but unknown phases. The proposed noncoherent DTTLs would be modified versions of traditional DTTLs, which are coherent. The symbol-synchronization problem is essentially the problem of recovering symbol timing from a received signal. In the traditional, coherent approach to symbol synchronization, it is necessary to establish carrier synchronization in order to recover symbol timing. A traditional DTTL effects an iterative process in which it first generates an estimate of the carrier phase in the absence of symbol-synchronization information, then uses the carrier-phase estimate to obtain an estimate of the symbol-synchronization information, then feeds the symbol-synchronization estimate back to the carrier-phase-estimation subprocess. In a noncoherent symbol-synchronization process, there is no need for carrier synchronization and, hence, no need for iteration between carrier-synchronization and symbol- synchronization subprocesses. The proposed noncoherent symbolsynchronization process is justified theoretically by a mathematical derivation that starts from a maximum a posteriori (MAP) method of estimation of symbol timing utilized in traditional, coherent DTTLs. In that MAP method, one chooses the value of a variable of interest (in this case, the offset in the estimated symbol timing) that causes a likelihood function of symbol estimates over some number of symbol periods to assume a maximum value. In terms that are necessarily oversimplified to fit within the space available for this article, it can be said that the mathematical derivation involves a modified interpretation of the likelihood function that lends itself to noncoherent DTTLs. The proposal encompasses both linear and nonlinear noncoherent DTTLs. The performances of both have been computationally simulated; for comparison, the performances of linear and nonlinear coherent DTTLs have also been computationally simulated. The results of these simulations show that, among other things, the expected mean-square timing errors of coherent and noncoherent DTTLs are relatively insensitive to window width. The results also show that at high signal-to-noise ratios (SNRs), the performances of the noncoherent DTTLs approach those of their coherent counterparts at, while at low SNRs, the noncoherent DTTLs incur penalties of the order of 1.5 to 2 dB.

Simon, Marvin↗

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↗

Error Rates and Channel Capacities in Multipulse PPM

A method of computing channel capacities and error rates in multipulse pulse-position modulation (multipulse PPM) has been developed. The method makes it possible, when designing an optical PPM communication system, to determine whether and under what conditions a given multipulse PPM scheme would be more or less advantageous, relative to other candidate modulation schemes. In conventional M-ary PPM, each symbol is transmitted in a time frame that is divided into M time slots (where M is an integer >1), defining an M-symbol alphabet. A symbol is represented by transmitting a pulse (representing 1) during one of the time slots and no pulse (representing 0 ) during the other M 1 time slots. Multipulse PPM is a generalization of PPM in which pulses are transmitted during two or more of the M time slots.

Hamkins, Jon↗

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↗

A new algorithm for the integration of exponential and logarithmic functions

An algorithm for symbolic integration of functions built up from the rational functions by repeatedly applying either the exponential or logarithm functions is discussed. This algorithm does not require polynomial factorization nor partial fraction decomposition and requires solutions of linear systems with only a small number of unknowns. It is proven that if this algorithm is applied to rational functions over the integers, a computing time bound for the algorithm can be obtained which is a polynomial in a bound on the integer length of the coefficients, and in the degrees of the numerator and denominator of the rational function involved.

Rothstein, M.↗

Development of efficient computer program for dynamic simulation of telerobotic manipulation

Research in robot control has generated interest in computationally efficient forms of dynamic equations for multi-body systems. For a simply connected open-loop linkage, dynamic equations arranged in recursive form were found to be particularly efficient. A general computer program capable of simulating an open-loop manipulator with arbitrary number of links has been developed based on an efficient recursive form of Kane's dynamic equations. Also included in the program is some of the important dynamics of the joint drive system, i.e., the rotational effect of the motor rotors. Further efficiency is achieved by the use of symbolic manipulation program to generate the FORTRAN simulation program tailored for a specific manipulator based on the parameter values given. The formulations and the validation of the program are described, and some results are shown.

Chen, J.↗

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↗

An Icosahedral Quasicrystal and Its 1/0 Crystalline Approximant in the Ca–Au–Al System

A new icosahedral quasicrystalline phase, CaAu 4.5–x Al 1.5+x [0.11 ≤ x ≤ 0.40(6); CaAu 4.4 Al 1.6 , a QC = 5.383(4) Å, and Pm35], and its lowest-order 1/0 cubic crystalline approximant phase, CaAu 3+x Al 1–x [0 ≤ x ≤ 0.31(1); a = 9.0766(5)–9.1261(8) Å, Pa3(No. 205), and Pearson symbol cP40], have been discovered in the Ca-poor region of the Ca–Au–Al system. In the crystalline approximant, eight [Au 3–x Al 1+x ] tetrahedra fill the unit cell, and each tetrahedron is surrounded by four Ca atoms, thus forming a three-dimensional network of {Ca 4/4 [Au 3–x Al 1+x ]} tetrahedral stars. Here, a computational study of Au and Al site preferences concurs with the experimental results, which indicate a preference for near-neighbor Au–Al interactions over Au–Au and Al–Al interactions. Analysis of the electronic density of states and the associated crystal orbital Hamilton population curves was used to rationalize the descriptions of CaAu 4.5–x Al 1.5+x [0.11 ≤ x ≤ 0.46(6)] and CaAu 3+x Al 1–x [0 ≤ x ≤ 0.31(1)] as polar intermetallic species, whereby Ca atoms engage in polar covalent bonding with the electronegative, electron-deficient [Au 3–x Al 1+x ] tetrahedral clusters and the observed phase width of the crystalline approximant.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computational methods in nonlinear structural and solid mechanics; Proceedings of the Symposium, Washington, D.C., October 6-8, 1980. Symposium sponsored by the George Washington University and NASA

Topics discussed include computational strategies for nonlinear problems in structural mechanics, time integration techniques and the numerical solution of nonlinear algebraic equations, material characterization and nonlinear fracture mechanics, nonlinear interaction problems, and seismic response and the nonlinear analysis of concrete structures. Also considered are nonlinear problems for nuclear reactors, crash dynamics and impact problems, nonlinear problems of fibrous composites and advanced nonlinear applications, and computerized symbolic manipulation and nonlinear analysis software systems.

Noor, A. K.↗