SEARCH · Search NASA

Results for “domain”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1991

A two-dimensional time domain near zone to far zone transformation

A time domain transformation useful for extrapolating three dimensional near zone finite difference time domain (FDTD) results to the far zone was presented. Here, the corresponding two dimensional transform is outlined. While the three dimensional transformation produced a physically observable far zone time domain field, this is not convenient to do directly in two dimensions, since a convolution would be required. However, a representative two dimensional far zone time domain result can be obtained directly. This result can then be transformed to the frequency domain using a Fast Fourier Transform, corrected with a simple multiplicative factor, and used, for example, to calculate the complex wideband scattering width of a target. If an actual time domain far zone result is required, it can be obtained by inverse Fourier transform of the final frequency domain result.

Luebbers, Raymond J.↗

NASA NTRS1992

A multi-domain method for subsonic viscous flows

We have developed a Schwarz type domain decomposition method for a pressure base, two- and three-dimensional Navier-Stokes solver. This technique allows one to partition a flow path, which can be characterized by complex geometry and/or complicated flow physics, into smaller sub-domains according to the local geometric simplicity or estimated flow scales. We can, then, sweep the sub-domains in some order and solve the Navier-Stokes equations using as boundary conditions, along the domain interfaces, the Dirichlet conditions which are taken from the most recent update of the solution in the adjacent neighboring domains. With this technique, one can minimize the adverse effects caused by grid skewness and the stiffness problem caused by disparate flow scales. Here, we report the results of a few fundamental flow cases to demonstrate that a judicious use of the multi-domain method can offer a significant convergence acceleration over the traditional one-domain method. This method can be extended to exploit the architecture of a parallel computer to further improve the speed.

Chan, Daniel C.↗

NASA NTRS1992

Modeling software systems by domains

The Software Architectures Engineering (SAE) Project at the Software Engineering Institute (SEI) has developed engineering modeling techniques that both reduce the complexity of software for domain-specific computer systems and result in systems that are easier to build and maintain. These techniques allow maximum freedom for system developers to apply their domain expertise to software. We have applied these techniques to several types of applications, including training simulators operating in real time, engineering simulators operating in non-real time, and real-time embedded computer systems. Our modeling techniques result in software that mirrors both the complexity of the application and the domain knowledge requirements. We submit that the proper measure of software complexity reflects neither the number of software component units nor the code count, but the locus of and amount of domain knowledge. As a result of using these techniques, domain knowledge is isolated by fields of engineering expertise and removed from the concern of the software engineer. In this paper, we will describe kinds of domain expertise, describe engineering by domains, and provide relevant examples of software developed for simulator applications using the techniques.

Dippolito, Richard↗

NASA NTRS1992

The use of typed lambda calculus for comprehension and construction of simulation models in the domain of ecology

We are concerned with two important issues in simulation modelling: model comprehension and model construction. Model comprehension is limited because many important choices taken during the modelling process are not documented. This makes it difficult for models to be modified or used by others. A key factor hindering model construction is the vast modelling search space which must be navigated. This is exacerbated by the fact that many modellers are unfamiliar with the terms and concepts catered to by current tools. The root of both problems is the lack of facilities for representing or reasoning about domain concepts in current simulation technology. The basis for our achievements in both of these areas is the development of a language with two distinct levels; one for representing domain information, and the other for representing the simulation model. Of equal importance, is the fact that we make formal connections between these two levels. The domain we are concerned with is ecological modelling. This language, called Elklogic, is based on the typed lambda calculus. Important features include a rich type structure, the use of various higher order functions, and semantics. This enables complex expressions to be constructed from relatively few primitives. The meaning of each expression can be determined in terms of the domain, the simulation model, or the relationship between the two. We describe a novel representation for sets and substructure, and a variety of other general concepts that are especially useful in the ecological domain. We use the type structure in a novel way: for controlling the modelling search space, rather than a proof search space. We facilitate model comprehension by representing modelling decisions that are embodied in the simulation model. We represent the simulation model separately from, but in terms of a domain mode. The explicit links between the two models constitute the modelling decisions. The semantics of Elklogic enables English text to be generated to explain the simulation model in domain terms.

Uschold, Michael↗

NASA NTRS1998

Structure of Pseudoknot PK26 Shows 3D Domain Swapping in an RNA

3D domain swapping provides a facile pathway for the evolution of oligomeric proteins and allosteric mechanisms and a means for using monomer-oligomer equilibria to regulate biological activity. The term "3D domain swapping" describes the exchange of identical domains between two protein monomers to create an oligomer. 3D domain swapping has, so far, only been recognized in proteins. In this study, the structure of the pseudoknot PK26 is reported and it is a clear example of 3D domain swapping in RNA. PK26 was chosen for study because RNA pseudoknots are required structures in several biological processes and they arise frequently in in vitro selection experiments directed against protein targets. PK26 specifically inhibits HIV-1 reverse transcriptase with nanomolar affinity. We have now determined the 3.1 A resolution crystal structure of PK26 and find that it forms a 3D domain swapped dimer. PK26 shows extensive base pairing between and within strands. Formation of the dimer requires the linker region between the pseudoknot folds to adopt a unique conformation that allows a base within a helical stem to skip one base in the stacking register. Rearrangement of the linker would permit a monomeric pseudoknot to form. This structure shows how RNA can use 3D domain swapping to build large scale oligomers like the putative hexamer in the packaging RNA of bacteriophage Phi29.

Lietzke, Susan E↗

NASA NTRS2003

A Domain Decomposition Parallelization of the Fast Marching Method

In this paper, the first domain decomposition parallelization of the Fast Marching Method for level sets has been presented. Parallel speedup has been demonstrated in both the optimal and non-optimal domain decomposition case. The parallel performance of the proposed method is strongly dependent on load balancing separately the number of nodes on each side of the interface. A load imbalance of nodes on either side of the domain leads to an increase in communication and rollback operations. Furthermore, the amount of inter-domain communication can be reduced by aligning the inter-domain boundaries with the interface normal vectors. In the case of optimal load balancing and aligned inter-domain boundaries, the proposed parallel FMM algorithm is highly efficient, reaching efficiency factors of up to 0.98. Future work will focus on the extension of the proposed parallel algorithm to higher order accuracy. Also, to further enhance parallel performance, the coupling of the domain decomposition parallelization to the G(sub 0)-based parallelization will be investigated.

Herrmann, M.↗

NASA NTRS2008

Domain Decomposition By the Advancing-Partition Method

A new method of domain decomposition has been developed for generating unstructured grids in subdomains either sequentially or using multiple computers in parallel. Domain decomposition is a crucial and challenging step for parallel grid generation. Prior methods are generally based on auxiliary, complex, and computationally intensive operations for defining partition interfaces and usually produce grids of lower quality than those generated in single domains. The new technique, referred to as "Advancing Partition," is based on the Advancing-Front method, which partitions a domain as part of the volume mesh generation in a consistent and "natural" way. The benefits of this approach are: 1) the process of domain decomposition is highly automated, 2) partitioning of domain does not compromise the quality of the generated grids, and 3) the computational overhead for domain decomposition is minimal. The new method has been implemented in NASA's unstructured grid generation code VGRID.

Pirzadeh, Shahyar Z.↗

NASA NTRS2009

Domain Decomposition By the Advancing-Partition Method for Parallel Unstructured Grid Generation

Pirzadeh, Shahyar Z.↗

NASA NTRS2012

Domain decomposition by the advancing-partition method for parallel unstructured grid generation

In a method for domain decomposition for generating unstructured grids, a surface mesh is generated for a spatial domain. A location of a partition plane dividing the domain into two sections is determined. Triangular faces on the surface mesh that intersect the partition plane are identified. A partition grid of tetrahedral cells, dividing the domain into two sub-domains, is generated using a marching process in which a front comprises only faces of new cells which intersect the partition plane. The partition grid is generated until no active faces remain on the front. Triangular faces on each side of the partition plane are collected into two separate subsets. Each subset of triangular faces is renumbered locally and a local/global mapping is created for each sub-domain. A volume grid is generated for each sub-domain. The partition grid and volume grids are then merged using the local-global mapping.

Pirzadeh, Shahyar Z.↗

NASA NTRS2015

A Persistent Feature of Multiple Scattering of Waves in the Time-Domain: A Tutorial

The equations for frequency-domain multiple scattering are derived for a scalar or electromagnetic plane wave incident on a collection of particles at known positions, and in the time-domain for a plane wave pulse incident on the same collection of particles. The calculation is carried out for five different combinations of wave types and particle types of increasing geometrical complexity. The results are used to illustrate and discuss a number of physical and mathematical characteristics of multiple scattering in the frequency- and time-domains. We argue that frequency-domain multiple scattering is a purely mathematical construct since there is no temporal sequencing information in the frequency-domain equations and since the multi-particle path information can be dispelled by writing the equations in another mathematical form. However, multiple scattering becomes a definite physical phenomenon in the time-domain when the collection of particles is illuminated by an appropriately short localized pulse.

particles↗

NASA NTRS1989

Interaction dynamics of multiple autonomous mobile robots in bounded spatial domains

A general navigation strategy for multiple autonomous robots in a bounded domain is developed analytically. Each robot is modeled as a spherical particle (i.e., an effective spatial domain about the center of mass); its interactions with other robots or with obstacles and domain boundaries are described in terms of the classical many-body problem; and a collision-avoidance strategy is derived and combined with homing, robot-robot, and robot-obstacle collision-avoidance strategies. Results from homing simulations involving (1) a single robot in a circular domain, (2) two robots in a circular domain, and (3) one robot in a domain with an obstacle are presented in graphs and briefly characterized.

Wang, P. K. C.↗

NASA NTRS1992

Domain decomposition: A bridge between nature and parallel computers

Domain decomposition is an intuitive organizing principle for a partial differential equation (PDE) computation, both physically and architecturally. However, its significance extends beyond the readily apparent issues of geometry and discretization, on one hand, and of modular software and distributed hardware, on the other. Engineering and computer science aspects are bridged by an old but recently enriched mathematical theory that offers the subject not only unity, but also tools for analysis and generalization. Domain decomposition induces function-space and operator decompositions with valuable properties. Function-space bases and operator splittings that are not derived from domain decompositions generally lack one or more of these properties. The evolution of domain decomposition methods for elliptically dominated problems has linked two major algorithmic developments of the last 15 years: multilevel and Krylov methods. Domain decomposition methods may be considered descendants of both classes with an inheritance from each: they are nearly optimal and at the same time efficiently parallelizable. Many computationally driven application areas are ripe for these developments. A progression is made from a mathematically informal motivation for domain decomposition methods to a specific focus on fluid dynamics applications. To be introductory rather than comprehensive, simple examples are provided while convergence proofs and algorithmic details are left to the original references; however, an attempt is made to convey their most salient features, especially where this leads to algorithmic insight.

Keyes, David E.↗

NASA NTRS1992

The KASE approach to domain-specific software systems

Designing software systems, like all design activities, is a knowledge-intensive task. Several studies have found that the predominant cause of failures among system designers is lack of knowledge: knowledge about the application domain, knowledge about design schemes, knowledge about design processes, etc. The goal of domain-specific software design systems is to explicitly represent knowledge relevant to a class of applications and use it to partially or completely automate various aspects of the designing systems within that domain. The hope is that this would reduce the intellectual burden on the human designers and lead to more efficient software development. In this paper, we present a domain-specific system built on top of KASE, a knowledge-assisted software engineering environment being developed at the Stanford Knowledge Systems Laboratory. We introduce the main ideas underlying the construction of domain specific systems within KASE, illustrate the application of the idea in the synthesis of a system for tracking aircraft from radar signals, and discuss some of the issues in constructing domain-specific systems.

Bhansali, Sanjay↗

NASA NTRS1992

Domain and Specification Models for Software Engineering

This paper discusses our approach to representing application domain knowledge for specific software engineering tasks. Application domain knowledge is embodied in a domain model. Domain models are used to assist in the creation of specification models. Although many different specification models can be created from any particular domain model, each specification model is consistent and correct with respect to the domain model. One aspect of the system-hierarchical organization is described in detail.

Iscoe, Neil↗

NASA NTRS1996

Periodic Time-Domain Nonlocal Nonreflecting Boundary Conditions for Duct Acoustics

Periodic time-domain boundary conditions are formulated for direct numerical simulation of acoustic waves in ducts without flow. Well-developed frequency-domain boundary conditions are transformed into the time domain. The formulation is presented here in one space dimension and time; however, this formulation has an advantage in that its extension to variable-area, higher dimensional, and acoustically treated ducts is rigorous and straightforward. The boundary condition simulates a nonreflecting wave field in an infinite uniform duct and is implemented by impulse-response operators that are applied at the boundary of the computational domain. These operators are generated by convolution integrals of the corresponding frequency-domain operators. The acoustic solution is obtained by advancing the Euler equations to a periodic state with the MacCormack scheme. The MacCormack scheme utilizes the boundary condition to limit the computational space and preserve the radiation boundary condition. The success of the boundary condition is attributed to the fact that it is nonreflecting to periodic acoustic waves. In addition, transient waves can pass rapidly out of the solution domain. The boundary condition is tested for a pure tone and a multitone source in a linear setting. The effects of various initial conditions are assessed. Computational solutions with the boundary condition are consistent with the known solutions for nonreflecting wave fields in an infinite uniform duct.

Watson, Willie R.↗

NASA NTRS1995

Chimeric Plant Calcium/Calmodulin-Dependent Protein Kinase Gene with a Neural Visinin-Like Calcium-Binding Domain

Calcium, a universal second messenger, regulates diverse cellular processes in eukaryotes. Ca-2(+) and Ca-2(+)/calmodulin-regulated protein phosphorylation play a pivotal role in amplifying and diversifying the action of Ca-2(+)- mediated signals. A chimeric Ca-2(+)/calmodulin-dependent protein kinase (CCaMK) gene with a visinin-like Ca-2(+)- binding domain was cloned and characterized from lily. The cDNA clone contains an open reading frame coding for a protein of 520 amino acids. The predicted structure of CCaMK contains a catalytic domain followed by two regulatory domains, a calmodulin-binding domain and a visinin-like Ca-2(+)-binding domain. The amino-terminal region of CCaMK contains all 11 conserved subdomains characteristic of serine/threonine protein kinases. The calmodulin-binding region of CCaMK has high homology (79%) to alpha subunit of mammalian Ca-2(+)/calmodulin-dependent protein kinase. The calmodulin-binding region is fused to a neural visinin-like domain that contains three Ca-2(+)-binding EF-hand motifs and a biotin-binding site. The Escherichia coli-expressed protein (approx. 56 kDa) binds calmodulin in a Ca-2(+)-dependent manner. Furthermore, Ca-45-binding assays revealed that CCaMK directly binds Ca-2(+). The CCaMK gene is preferentially expressed in developing anthers. Southern blot analysis revealed that CCaMK is encoded by a single gene. The structural features of the gene suggest that it has multiple regulatory controls and could play a unique role in Ca-2(+) signaling in plants.

Patil, Shameekumar↗

NASA NTRS2002

Expression of the high capacity calcium-binding domain of calreticulin increases bioavailable calcium stores in plants

Modulation of cytosolic calcium levels in both plants and animals is achieved by a system of Ca2+-transport and storage pathways that include Ca2+ buffering proteins in the lumen of intracellular compartments. To date, most research has focused on the role of transporters in regulating cytosolic calcium. We used a reverse genetics approach to modulate calcium stores in the lumen of the endoplasmic reticulum. Our goals were two-fold: to use the low affinity, high capacity Ca2+ binding characteristics of the C-domain of calreticulin to selectively increase Ca2+ storage in the endoplasmic reticulum, and to determine if those alterations affected plant physiological responses to stress. The C-domain of calreticulin is a highly acidic region that binds 20-50 moles of Ca2+ per mole of protein and has been shown to be the major site of Ca2+ storage within the endoplasmic reticulum of plant cells. A 377-bp fragment encoding the C-domain and ER retention signal from the maize calreticulin gene was fused to a gene for the green fluorescent protein and expressed in Arabidopsis under the control of a heat shock promoter. Following induction on normal medium, the C-domain transformants showed delayed loss of chlorophyll after transfer to calcium depleted medium when compared to seedlings transformed with green fluorescent protein alone. Total calcium measurements showed a 9-35% increase for induced C-domain transformants compared to controls. The data suggest that ectopic expression of the calreticulin C-domain increases Ca2+ stores, and that this Ca2+ reserve can be used by the plant in times of stress.

NASA Discipline Plant Biology↗

NASA NTRS1989

Architecture for time or transform domain decoding of reed-solomon codes

Two pipeline (255,233) RS decoders, one a time domain decoder and the other a transform domain decoder, use the same first part to develop an errata locator polynomial .tau.(x), and an errata evaluator polynominal A(x). Both the time domain decoder and transform domain decoder have a modified GCD that uses an input multiplexer and an output demultiplexer to reduce the number of GCD cells required. The time domain decoder uses a Chien search and polynomial evaluator on the GCD outputs .tau.(x) and A(x), for the final decoding steps, while the transform domain decoder uses a transform error pattern algorithm operating on .tau.(x) and the initial syndrome computation S(x), followed by an inverse transform algorithm in sequence for the final decoding steps prior to adding the received RS coded message to produce a decoded output message.

Shao, Howard M.↗