Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Relational algebra”

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

Monotonically improving approximate answers to relational algebra queries

We present here a query processing method that produces approximate answers to queries posed in standard relational algebra. This method is monotone in the sense that the accuracy of the approximate result improves with the amount of time spent producing the result. This strategy enables us to trade the time to produce the result for the accuracy of the result. An approximate relational model that characterizes appromimate relations and a partial order for comparing them is developed. Relational operators which operate on and return approximate relations are defined.

Smith, Kenneth P.↗

Qutrit circuits and algebraic relations: A pathway to efficient spin-1 Hamiltonian simulation

Quantum information processing has witnessed significant advancements through the application of qubit-based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d -dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

97 MATHEMATICS AND COMPUTING↗

Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation

Quantum information processing has witnessed significant advancements through the application of qubit- based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The total angular momentum algebra related to the S{sub 3} Dunkl Dirac equation

We consider the symmetry algebra generated by the total angular momentum operators, appearing as constants of motion of the S{sub 3} Dunkl Dirac equation. The latter is a deformation of the Dirac equation by means of Dunkl operators, in our case associated to the root system A{sub 2}, with corresponding Weyl group S{sub 3}, the symmetric group on three elements. The explicit form of the symmetry algebra in this case is a one-parameter deformation of the classical total angular momentum algebra so(3), incorporating elements of S{sub 3}. This was obtained using recent results on the symmetry algebra for a class of Dirac operators, containing in particular the Dirac–Dunkl operator for arbitrary root system. For this symmetry algebra, we classify all finite-dimensional, irreducible representations and determine the conditions for the representations to be unitarizable. The class of unitary irreducible representations admits a natural realization acting on a representation space of eigenfunctions of the Dirac Hamiltonian. Using a Cauchy–Kowalevski extension theorem we obtain explicit expressions for these eigenfunctions in terms of Jacobi polynomials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

HOMAR: A computer code for generating homotopic grids using algebraic relations: User's manual

A computer code for fast automatic generation of quasi-three-dimensional grid systems for aerospace configurations is described. The code employs a homotopic method to algebraically generate two-dimensional grids in cross-sectional planes, which are stacked to produce a three-dimensional grid system. Implementation of the algebraic equivalents of the homotopic relations for generating body geometries and grids are explained. Procedures for controlling grid orthogonality and distortion are described. Test cases with description and specification of inputs are presented in detail. The FORTRAN computer program and notes on implementation and use are included.

Moitra, Anutosh↗

Extended Lyapunov stability criterion using a nonlinear algebraic relation with application to adaptive control

A new nonlinear stability criterion is developed by use of a class of Lyapunov functionals for model-reference adaptive systems (MRAS). Results are compared with traditional results, and a comparative design technique is used to illustrate its function in improving the transient response of an MRAS controller. For a particular system structure and class of input signals, the new stability criterion is shown to include traditional sufficiency stability conditions as a special case. An example is cited to illustrate the use of the nonlinear criterion and its definite advantages in helping improve the adaptive error transient response of a system. Analysis of results is effected by use of a linearization technique on the resulting adaptive equations.

Colburn, B. K.↗

Extended Laplace–Runge–Lentz vectors, new family of superintegrable systems and quadratic algebras

We present a useful proposition for discovering extended Laplace–Runge–Lentz vectors of certain quantum mechanical systems. We propose a new family of superintegrable systems and construct their integrals of motion. We solve these systems via separation of variables in spherical coordinates and obtain their exact energy eigenvalues and the corresponding eigenfunctions. We give the quadratic algebra relations satisfied by the integrals of motion. Remarkably these algebra relations involve the Casimir operators of certain higher rank Lie algebras in the structure constants.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis and synthesis of distributed-lumped-active networks by digital computer

The use of digital computational techniques in the analysis and synthesis of DLA (distributed lumped active) networks is considered. This class of networks consists of three distinct types of elements, namely, distributed elements (modeled by partial differential equations), lumped elements (modeled by algebraic relations and ordinary differential equations), and active elements (modeled by algebraic relations). Such a characterization is applicable to a broad class of circuits, especially including those usually referred to as linear integrated circuits, since the fabrication techniques for such circuits readily produce elements which may be modeled as distributed, as well as the more conventional lumped and active ones.

Source record↗

Celestial holography meets twisted holography: 4d amplitudes from chiral correlators

We propose a new program for computing a certain integrand of scattering amplitudes of four-dimensional gauge theories which we call the form factor integrand, starting from 6d holomorphic theories on twistor space. We show that the form factor integrands can be expressed as sums of products of 1.) correlators of a 2d chiral algebra, related to the algebra of asymptotic symmetries uncovered recently in the celestial holography program, and 2.) OPE coefficients of a 4d non-unitary CFT. We prove that conformal blocks of the chiral algebras are in one-to-one correspondence with local operators in 4d. We use this bijection to recover the Parke-Taylor formula, the CSW formula, and certain one-loop scattering amplitudes. Along the way, we explain and derive various aspects of celestial holography, incorporating techniques from the twisted holography program such as Koszul duality. This perspective allows us to easily and efficiently recover the infinite-dimensional chiral algebras of asymptotic symmetries recently extracted from scattering amplitudes of massless gluons and gravitons in the celestial basis. We also compute some simple one-loop corrections to the chiral algebras and derive the three-dimensional bulk theories for which these 2d algebras furnish an algebra of boundary local operators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An Algorithm for Interactive Modeling of Space-Transportation Engine Simulations: A Constraint Satisfaction Approach

In this research we have developed an algorithm for the purpose of constraint processing by utilizing relational algebraic operators. Van Beek and others have investigated in the past this type of constraint processing from within a relational algebraic framework, producing some unique results. Apart from providing new theoretical angles, this approach also gives the opportunity to use the existing efficient implementations of relational database management systems as the underlying data structures for any relevant algorithm. Our algorithm here enhances that framework. The algorithm is quite general in its current form. Weak heuristics (like forward checking) developed within the Constraint-satisfaction problem (CSP) area could be also plugged easily within this algorithm for further enhancements of efficiency. The algorithm as developed here is targeted toward a component-oriented modeling problem that we are currently working on, namely, the problem of interactive modeling for batch-simulation of engineering systems (IMBSES). However, it could be adopted for many other CSP problems as well. The research addresses the algorithm and many aspects of the problem IMBSES that we are currently handling.

Mitra, Debasis↗

Component modes damping assignment methodology for articulated, multiflexible body structures

To simulate the dynamical motion of articulated, multiflexible body structures, one can use multibody simulation packages such as DISCOS. To this end, one must supply appropriate reduced-order models for all of the flexible components involved. The component modes projection and assembly model reduction (COMPARE) methodology is one way to construct these reduced-order component models, which when reassembled capture important system input-to-output mapping of the full-order model at multiple system configurations of interest. In conjunction, we must also supply component damping matrices which when reassembled generate a system damping matrix that has certain desirable properties. The problem of determining the damping factors of components' modes to achieve a given system damping matrix is addressed here. To this end, we must establish from first principles a matrix-algebraic relation between the system's modal damping matrix and the components' modal damping matrices. An unconstrained/constrained optimization problem can then be formulated to determine the component modes' damping factors that best satisfy that matrix-algebraic relation. The effectiveness of the developed methodology, called ModeDamp, has been successfully demonstrated on a high-order, finite element model of the Galileo spacecraft.

Lee, Allan Y.↗

Composite fermions in Fock space: Operator algebra, recursion relations, and order parameters

We develop recursion relations, in particle number, for all (unprojected) Jain composite fermion (CF) wave functions. These recursions generalize a similar recursion originally written down by Read for Laughlin states, in mixed first-second quantized notation. In contrast, our approach is purely second-quantized, giving rise to an algebraic, “pure guiding center” definition of CF states that de-emphasizes first quantized many-body wave functions. Key to the construction is a second-quantized representation of the flux attachment operator that maps any given fermion state to its CF counterpart. An algebra of generators of edge excitations is identified. In particular, in those cases where a well-studied parent Hamiltonian exists, its properties can be entirely understood in the present framework, and the identification of edge state generators can be understood as an instance of “microscopic bosonization.” Here, the intimate connection of Read's original recursion with “nonlocal order parameters” generalizes to the present situation, and we are able to give explicit second-quantized formulas for nonlocal order parameters associated with CF states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

QLiG: Query Like a Graph For Subgraph Matching

A graph is a natural and flexible modeling approach to represent entities and relationships between them in real-world. A Knowledge Graphs (KG) is a specialized graph with formal and structured representation of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on underlying data model. Various graph query specifications have been developed over the years and have led to the development of different open-sourced and vendor-specific query languages. Such specification are modeled as an extension of relational algebra used to develop relational query languages such as SQL. Such relational concepts do not inherently support graph queries. There is a need to represent graph queries in terms on graph-based components to expedite query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in Labeled Property Graph. We present the query specifications, salient features, and a use case to show functional examples.

Purohit, Sumit↗

Producing approximate answers to database queries

We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. The exact answer is produced if all of the needed data are available and query processing is allowed to continue until completion. The monotone query processing algorithm of APPROXIMATE works within the standard relational algebra framework and can be implemented on a relational database system with little change to the relational architecture. We describe here the approximation semantics of APPROXIMATE that serves as the basis for meaningful approximations of both set-valued and single-valued queries. We show how APPROXIMATE is implemented to make effective use of semantic information, provided by an object-oriented view of the database, and describe the additional overhead required by APPROXIMATE.

Vrbsky, Susan V.↗

On the multiplicative and T-space structure of the relatively free Grassmann algebra

We investigate the multiplicative and T-space structure of the relatively free algebra F{sup (3)} with unity corresponding to the identity [[x{sub 1},x{sub 2}],x{sub 3}]=0 over an infinite field of characteristic p>0. One of the basic results is the decomposition of quotient T-spaces connected with F{sup (3)} into a direct sum of simple components. Also, the T-spaces under consideration are commutative subalgebras of F{sup (3)}; thus, the structure of F{sup (3)} and its subalgebras is described as modules over these commutative subalgebras. Finally, we consider the specifics of the case p=2. Bibliography: 15 titles.

97 MATHEMATICS AND COMPUTING↗

Entire four-graviton EFT from the duality between color and kinematics

The Bern-Carrasco-Johansson (BCJ) double-copy construction reveals a fundamental structural connection between gauge and gravity theories. At its core, the BCJ double copy is directly due to a duality between the algebraic relations of a color root and those of a kinematic root. We generalize this principle beyond the conventional Lie algebra structure of tree-level Yang-Mills theory. By demanding color-kinematics duality for the complete basis of four-point color structures—including those involving the symmetric 𝑑 𝑎⁢𝑏⁢𝑐 constants—we define the universal double copy. We systematically classify the bases of all such parity-even generalized gauge-theory numerators and, independently, the space of all parity-even four-graviton higher-derivative operators. We demonstrate that our universal double-copy construction precisely spans the entire tower of parity-even four-graviton amplitudes in any dimension, except for the Lovelock 𝑅 3 contribution in 𝐷 > 6 which we can express in terms of a particularly simple universal triple-copy involving gauge theories coupled to scalars. Explicit machine-readable expressions for the complete basis of gauge-theory numerators and fundamental gravitational building blocks are provided in the Supplemental Material. This establishes that all possible four-point gravitational interactions can be factorized into products of gauge-theory building blocks governed by this universal notion of color-kinematics duality.

Carrasco, John Joseph M. [Northwestern Univ., Evan↗

An Object-oriented Query Processor that Produces Monotonically Improving Approximate Answers

The paper describes an object-oriented query processor that makes approximate answers available if there is not enough time to produce an exact answer or if part of the database is unavailable. The accuracy of the approximate result produces improves monotonically with the amount of data retrieved to produce the result. The query processing algorithm is based on an approximate relational data model and works within a standard relational algebra framework. The query processor maintains an object-oriented view on an underlying level and can be implemented on a relational database system with little change to the relational architecture. We show how a monotone query processing strategy can be implemented, making effective use of semantic information presented by the object-oriented view.

Vrbsky, S. V.↗

Improve Data Mining and Knowledge Discovery Through the Use of MatLab

Data mining is widely used to mine business, engineering, and scientific data. Data mining uses pattern based queries, searches, or other analyses of one or more electronic databases/datasets in order to discover or locate a predictive pattern or anomaly indicative of system failure, criminal or terrorist activity, etc. There are various algorithms, techniques and methods used to mine data; including neural networks, genetic algorithms, decision trees, nearest neighbor method, rule induction association analysis, slice and dice, segmentation, and clustering. These algorithms, techniques and methods used to detect patterns in a dataset, have been used in the development of numerous open source and commercially available products and technology for data mining. Data mining is best realized when latent information in a large quantity of data stored is discovered. No one technique solves all data mining problems; challenges are to select algorithms or methods appropriate to strengthen data/text mining and trending within given datasets. In recent years, throughout industry, academia and government agencies, thousands of data systems have been designed and tailored to serve specific engineering and business needs. Many of these systems use databases with relational algebra and structured query language to categorize and retrieve data. In these systems, data analyses are limited and require prior explicit knowledge of metadata and database relations; lacking exploratory data mining and discoveries of latent information. This presentation introduces MatLab(R) (MATrix LABoratory), an engineering and scientific data analyses tool to perform data mining. MatLab was originally intended to perform purely numerical calculations (a glorified calculator). Now, in addition to having hundreds of mathematical functions, it is a programming language with hundreds built in standard functions and numerous available toolboxes. MatLab's ease of data processing, visualization and its enormous availability of built in functionalities and toolboxes make it suitable to perform numerical computations and simulations as well as a data mining tool. Engineers and scientists can take advantage of the readily available functions/toolboxes to gain wider insight in their perspective data mining experiments.

Shaykhian, Gholam Ali↗