Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Translation operations”

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

Application of fuzzy logic-neural network based reinforcement learning to proximity and docking operations: Translational controller results

The reinforcement learning techniques developed at Ames Research Center are being applied to proximity and docking operations using the Shuttle and Solar Maximum Mission (SMM) satellite simulation. In utilizing these fuzzy learning techniques, we also use the Approximate Reasoning based Intelligent Control (ARIC) architecture, and so we use two terms interchangeable to imply the same. This activity is carried out in the Software Technology Laboratory utilizing the Orbital Operations Simulator (OOS). This report is the deliverable D3 in our project activity and provides the test results of the fuzzy learning translational controller. This report is organized in six sections. Based on our experience and analysis with the attitude controller, we have modified the basic configuration of the reinforcement learning algorithm in ARIC as described in section 2. The shuttle translational controller and its implementation in fuzzy learning architecture is described in section 3. Two test cases that we have performed are described in section 4. Our results and conclusions are discussed in section 5, and section 6 provides future plans and summary for the project.

Jani, Yashvant↗

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗

DaYu: Optimizing Distributed Scientific Workflows by Decoding Dataflow Semantics and Dynamics

The combination of ever-growing scientific datasets and distributed workflow complexity creates I/O performance bottlenecks due to data volume, velocity, and variety. Although the increasing use of descriptive data formats (e.g., HDF5, netCDF) helps organize these datasets, it also creates obscure bottlenecks due to the need to translate high level operations into file addresses and then into low-level I/O operations. To address this challenge, we introduce DaYu, a method and toolset for analyzing (a) semantic relationships between logical datasets and file addresses, (b) how dataset operations translate into I/O, and (c) the combination across entire workflows. DaYu's analysis and visualization enables identification of critical bottlenecks and reasoning about remediation. We describe our methodology and propose optimization guidelines. Evaluation on scientific workflows demonstrates up to 3.7x performance improvements in I/O time for obscure bottlenecks. The time and storage overhead for DaYu's time-ordered data is typically under 0.2% of runtime and 0.25% of data volume, respectively.

Tang, Meng↗

Exploiting Internal Parallelism for Address Translation in Solid-State Drives

Solid-state Drives (SSDs) have changed the landscape of storage systems and present a promising storage solution for data-intensive applications due to their low latency, high bandwidth, and low power consumption compared to traditional hard disk drives. SSDs achieve these desirable characteristics using internal parallelism—parallel access to multiple internal flash memory chips—and a Flash Translation Layer (FTL) that determines where data are stored on those chips so that they do not wear out prematurely. However, current state-of-the-art cache-based FTLs like the Demand-based Flash Translation Layer (DFTL) do not allow IO schedulers to take full advantage of internal parallelism, because they impose a tight coupling between the logical-to-physical address translation and the data access. In this study to address this limitation, we introduce a new FTL design called Parallel-DFTL that works with the DFTL to decouple address translation operations from data accesses. Parallel-DFTL separates address translation and data access operations into different queues, allowing the SSD to use concurrent flash accesses for both types of operations. We also present a Parallel-LRU cache replacement algorithm to improve the concurrency of address translation operations. To compare Parallel-DFTL against existing FTL approaches, we present a Parallel-DFTL performance model and compare its predictions against those for DFTL and an ideal page-mapping approach. We also implemented the Parallel-DFTL approach in an SSD simulator using real device parameters, and used trace-driven simulation to evaluate Parallel-DFTL’s efficacy. Our evaluation results show that Parallel-DFTL improved the overall performance by up to 32% for the real IO workloads we tested, and by up to two orders of magnitude with synthetic test workloads. Finally, we also found that Parallel-DFTL is able to achieve reasonable performance with a very small cache size and that it provides the best benefit for those workloads with large request size or with high write ratio.

97 MATHEMATICS AND COMPUTING↗

Periodic Motions in Banach Space and Applications to Functional-Differential Equations

In establishing the existence of periodic solutions for nonautonomous differential equations of the form x = g(x, t), where g is periodic in t of period ω for fixed x, it is often convenient to consider the translation operator T(x(t)) = x(t + ω). If corresponding to each initial vector chosen in an appropriate region there corresponds a unique solution of our equation, then periodicity may be established by proving the existence of a fixed point under T. This same technique is also useful for more general functional equations and can be extended in a number of interesting ways. In this paper we shall consider a variable type of translation operator which is useful in investigating periodicity for autonomous differential and functional equations where the period involved is less obvious.

Jones, G. Stephen↗

The Application of Modeling and Simulation in Capacity Management within the ITIL Framework

Tightly integrating modeling and simulation techniques into Information Technology Infrastructure Library (ITIL) practices can be one of the driving factors behind a successful and cost-effective capacity management effort for any Information Technology (IT) system. ITIL is a best practices framework for managing IT infrastructure, development and operations. Translating ITIL theory into operational reality can be a challenge. This paper aims to highlight how to best integrate modeling and simulation into an ITIL implementation. For cases where the project team initially has difficulty gaining consensus on investing in modeling and simulation resources, a clear definition for M&S implementation into the ITIL framework, specifically its role in supporting Capacity Management, is critical to gaining the support required to garner these resources. This implementation should also help to clearly define M&S support to the overall system mission. This paper will describe the development of an integrated modeling approach and how best to tie M&S to definitive goals for evaluating system capacity and performance requirements. Specifically the paper will discuss best practices for implementing modeling and simulation into ITIL. These practices hinge on implementing integrated M&S methods that 1) encompass at least two or more predictive modeling techniques, 2) complement each one's respective strengths and weaknesses to support the validation of predicted results, and 3) are tied to the system's performance and workload monitoring efforts. How to structure two forms of modeling: statistical and simUlation in the development of "As Is" and "To Be" efforts will be used to exemplify the integrated M&S methods. The paper will show how these methods can better support the project's overall capacity management efforts.

Rahmani, Sonya↗

Displacement operator for quantum systems with position-dependent mass

A translation operator is introduced to describe the quantum dynamics of a position-dependent mass particle in a null or constant potential. From this operator, we obtain a generalized form of the momentum operator as well as a unique commutation relation for x and p{sub {gamma}}. Such a formalism naturally leads to a Schroedinger-like equation that is reminiscent of wave equations typically used to model electrons with position-dependent (effective) masses propagating through abrupt interfaces in semiconductor heterostructures. The distinctive features of our approach are demonstrated through analytical solutions calculated for particles under null and constant potentials like infinite wells in one and two dimensions and potential barriers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized space and linear momentum operators in quantum mechanics

We propose a modification of a recently introduced generalized translation operator, by including a q-exponential factor, which implies in the definition of a Hermitian deformed linear momentum operator p{sup ^}{sub q}, and its canonically conjugate deformed position operator x{sup ^}{sub q}. A canonical transformation leads the Hamiltonian of a position-dependent mass particle to another Hamiltonian of a particle with constant mass in a conservative force field of a deformed phase space. The equation of motion for the classical phase space may be expressed in terms of the generalized dual q-derivative. A position-dependent mass confined in an infinite square potential well is shown as an instance. Uncertainty and correspondence principles are analyzed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Wavelets and the squeezed states of quantum optics

Wavelets are new mathematical objects which act as 'designer trigonometric functions.' To obtain a wavelet, the original function space of finite energy signals is generalized to a phase-space, and the translation operator in the original space has a scale change in the new variable adjoined to the translation. Localization properties in the phase-space can be improved and unconditional bases are obtained for a broad class of function and distribution spaces. Operators in phase space are 'almost diagonal' instead of the traditional condition of being diagonal in the original function space. These wavelets are applied to the squeezed states of quantum optics. The scale change required for a quantum wavelet is shown to be a Yuen squeeze operator acting on an arbitrary density operator.

Defacio, B.↗

Fuzzy logic in autonomous orbital operations

Fuzzy logic can be used advantageously in autonomous orbital operations that require the capability of handling imprecise measurements from sensors. Several applications are underway to investigate fuzzy logic approaches and develop guidance and control algorithms for autonomous orbital operations. Translational as well as rotational control of a spacecraft have been demonstrated using space shuttle simulations. An approach to a camera tracking system has been developed to support proximity operations and traffic management around the Space Station Freedom. Pattern recognition and object identification algorithms currently under development will become part of this camera system at an appropriate level in the future. A concept to control environment and life support systems for large Lunar based crew quarters is also under development. Investigations in the area of reinforcement learning, utilizing neural networks, combined with a fuzzy logic controller, are planned as a joint project with the Ames Research Center.

Lea, Robert N.↗

Aviation Transportation, Cyber Threats, and Network-of-Networks: Modeling Perspectives for Translating Theory to Practice

Understanding aviation transportation infrastructure system behavior and coupling with communication networks is essential for securing and restoring functionality against cyber-enabled threats. While significant progress has been made in the past decade on developing infrastructure resilience theories based on network structure and operations, translating and generalizing them to real-world practice has often been challenging due to imperfect data and inapplicability of modeling assumptions. These typically include: 1) stylized network structures without uncertainty, 2) node homogeneity, 3) static criticality measures, and 4) unrealistic cascade models originating from single points of failure. This paper presents modeling perspectives that aim to address these theory-to-practice challenges using a well-grounded network-of-networks (NoN) construct. Real-world modeling challenges are identified and a network theory-guided conceptual NoN model is developed that may be operationalized with the U.S. national airspace system airport network (NASAN) and Federal Aviation Administration (FAA) communication network as application domain. Improving accuracy in loss of functionality estimates due to cyber events in communication networks and cascading air travel delay impacts is key for informing consequence-based decision support and risk/contingency analyses.

Bhatia, Udit↗

A stochastic asymptotic-preserving scheme for a kinetic-fluid model for disperse two-phase flows with uncertainty

In this paper we consider a kinetic-fluid model for disperse two-phase flows with uncertainty. We propose a stochastic asymptotic-preserving (s-AP) scheme in the generalized polynomial chaos stochastic Galerkin (gPC-sG) framework, which allows the efficient computation of the problem in both kinetic and hydrodynamic regimes. The s-AP property is proved by deriving the equilibrium of the gPC version of the Fokker–Planck operator. The coefficient matrices that arise in a Helmholtz equation and a Poisson equation, essential ingredients of the algorithms, are proved to be positive definite under reasonable and mild assumptions. The computation of the gPC version of a translation operator that arises in the inversion of the Fokker–Planck operator is accelerated by a spectrally accurate splitting method. Numerical examples illustrate the s-AP property and the efficiency of the gPC-sG method in various asymptotic regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Total Power Factor Smart Contract with Cyber Grid Guard Using Distributed Ledger Technology for Electrical Utility Grid with Customer-Owned Wind Farm

In modern electrical grids, the numbers of customer-owned distributed energy resources (DERs) have increased, and consequently, so have the numbers of points of common coupling (PCC) between the electrical grid and customer-owned DERs. The disruptive operation of and out-of-tolerance outputs from DERs, especially owned DERs, present a risk to power system operations. A common protective measure is to use relays located at the PCC to isolate poorly behaving or out-of-tolerance DERs from the grid. Ensuring the integrity of the data from these relays at the PCC is vital, and blockchain technology could enhance the security of modern electrical grids by providing an accurate means to translate operational constraints into actions/commands for relays. This study demonstrates an advanced power system application solution using distributed ledger technology (DLT) with smart contracts to manage the relay operation at the PCC. The smart contract defines the allowable total power factor (TPF) of the DER output, and the terms of the smart contract are implemented using DLT with a Cyber Grid Guard (CGG) system for a customer-owned DER (wind farm). This article presents flowcharts for the TPF smart contract implemented by the CGG using DLT. The test scenarios were implemented using a real-time simulator containing a CGG system and relay in-the-loop. The data collected from the CGG system were used to execute the TPF smart contract. The desired TPF limits on the grid-side were between +0.9 and +1.0, and the operation of the breakers in the electrical grid and DER sides was controlled by the relay consistent with the provisions of the smart contract. The events from the real-time simulator, CGG, and relay showed a successful implementation of the TPF smart contract with CGG using DLT, proving the efficacy of this approach in general for implementing electrical grid applications for utilities with connections to customer-owned DERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Accelerated Cartesian expansion (ACE) based framework for the rapid evaluation of diffusion, lossy wave, and Klein-Gordon potentials

Diffusion, lossy wave, and Klein–Gordon equations find numerous applications in practical problems across a range of diverse disciplines. The temporal dependence of all three Green’s functions are characterized by an infinite tail. This implies that the cost complexity of the spatio-temporal convolutions, associated with evaluating the potentials, scales as O(N s 2 N t 2 ), where N s and N t are the number of spatial and temporal degrees of freedom, respectively. In this paper, we discuss two new methods to rapidly evaluate these spatio-temporal convolutions by exploiting their block-Toeplitz nature within the framework of accelerated Cartesian expansions (ACE). The first scheme identifies a convolution relation in time amongst ACE harmonics and the fast Fourier transform (FFT) is used for efficient evaluation of these convolutions. The second method exploits the rank deficiency of the ACE translation operators with respect to time and develops a recursive numerical compression scheme for the efficient representation and evaluation of temporal convolutions. It is shown that the cost of both methods scales as O(N s N t log 2 N t ). Furthermore, several numerical results are presented for the diffusion equation to validate the accuracy and efficacy of the fast algorithms developed here.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Amplitude flux, probability flux, and gauge invariance in the finite volume scheme for the Schrödinger equation

The time-dependent Schrödinger equation can be put in a probability conserving, gauge invariant form, on arbitrary structured grids via finite volume discretization. The gauge terms in the discrete system cancel with a portion of the amplitude flux to produce abbreviated flux functions. The resulting time translation operator is strictly unitary, and is compatible with an efficient operator splitting scheme that allows for multi-dimensional simulation with complex grid geometries. Moreover, the abbreviated amplitude flux is necessary to the construction of a conservative probability current. This construction turns out to be important when computing Bohmian trajectories in multi-dimensions. Bohmian trajectories are useful in the interpretation of quantum mechanical phenomena such as tunneling ionization, and provide a bridge between quantum and classical regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algebraic methods in vibrational spectroscopy

These lectures review some advances in the algebraic description of molecules from two point of views: structure and dynamics. We start by presenting the basic ideas involved in the traditional description of molecular structure in configuration space, where the Born-Oppenheimer and rotor-rigid approximations are assumed to be valid. We then focus on the vibrational degrees of freedom in order to introduce the traditional algebraic realization in terms of bosonic operators of harmonic oscillators. This analysis allows the algebraic methods based on dynamical unitary groups to be introduced as a anharmonization procedure where the local bosonic operators are translated into operators satisfying the su(2) commutation relations. Some examples of the vibrational spec-troscopic description are presented. Concerned with the dynamical point of view an algebraic model to describe collinear collisions in the semiclassical approximation is presented.

74 ATOMIC AND MOLECULAR PHYSICS↗

CFL Optimized Forward–Backward Runge–Kutta Schemes for the Shallow-Water Equations

Abstract We present the formulation and optimization of a Runge–Kutta-type time-stepping scheme for solving the shallow-water equations, aimed at substantially increasing the effective allowable time step over that of comparable methods. This scheme, called FB-RK(3,2), uses weighted forward–backward averaging of thickness data to advance the momentum equation. The weights for this averaging are chosen with an optimization process that employs a von Neumann–type analysis, ensuring that the weights maximize the admittable Courant number. Through a simplified local truncation error analysis and numerical experiments, we show that the method is at least second-order in time for any choice of weights and exhibits low dispersion and dissipation errors for well-resolved waves. Further, we show that an optimized FB-RK(3,2) can take time steps up to 2.8 times as large as a popular three-stage, third-order strong stability-preserving Runge–Kutta method in a quasi-linear test case. In fully nonlinear shallow-water test cases relevant to oceanic and atmospheric flows, FB-RK(3,2) outperforms SSPRK3 in admittable time step by factors roughly between 1.6 and 2.2, making the scheme approximately twice as computationally efficient with little to no effect on solution quality. Significance Statement The purpose of this work is to develop and optimize time-stepping schemes for models relevant to oceanic and atmospheric flows. Specifically, for the shallow-water equations we optimize for schemes that can take time steps as large as possible while retaining solution quality. We find that our optimized schemes can take time steps between 1.6 and 2.2 times larger than schemes that cost the same number of floating point operations, translating directly to a corresponding speedup. Our ultimate goal is to use these schemes in climate-scale simulations.

54 ENVIRONMENTAL SCIENCES↗