Search NASA⌕ Search

SEARCH · Search NASA

Results for “invariant 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.

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

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2020

Learning instrument invariant characteristics for generating high-resolution global coral reef maps

Coral reefs are one of the most biologically complex and diverse ecosystems within the shallow marine environment. Unfortunately, these underwater ecosystems are threatened by a number of anthropogenic challenges, including ocean acidification and warming, overfishing, and the continued increase of marine debris in oceans. This requires a comprehensive assessment of the world's coastal environments, including a quantitative analysis on the health and extent of coral reefs and other associated marine species, as a vital Earth Science measurement. However, limitations in observational and technological capabilities inhibit global sustained imaging of the marine environment. Harmonizing multimodal data sets acquired using different remote sensing instruments presents additional challenges, thereby limiting the availability of good quality labeled data for analysis. In this work, we develop a deep learning model for extracting domain invariant features from multimodal remote sensing imagery and creating high-resolution global maps of coral reefs by combining various sources of imagery and limited hand-labeled data available for certain regions. This framework allows us to generate, for the first time, coral reef segmentation maps at 2-meter resolution, which is a significant improvement over the kilometer-scale state-of-the-art maps. Additionally, this framework doubles accuracy and IoU metrics over baselines that do not account for domain invariance.

Domain Adaptation↗
NASA NTRS2021

Deep Domain Adaptation based Cloud Type Detection using Active and Passive Satellite Data

Domain adaptation techniques have been developed to handle data from multiple sources or domains. Most existing domain adaptation models assume that source and target domains are homogeneous, i.e., they have the same feature space. Nevertheless, many real world applications often deal with data from heterogeneous domains that come from completely different feature spaces. In our remote sensing application, data in source domain (from an active spaceborne Lidar sensor CALIOP onboard CALIPSO satellite) contain 25 attributes, while data in target domain (from a passive spectroradiometer sensor VIIRS onboard Suomi-NPP satellite) contain 20 different attributes. CALIOP has better representation capability and sensitivity to aerosol types and cloud phase, while VIIRS has wide swaths and better spatial coverage but has inherent weakness in differentiating atmospheric objects on different vertical levels. To address this mismatch of features across the domains/sensors, we propose a novel end-to-end deep domain adaptation with domain mapping and correlation alignment (DAMA) to align the heterogeneous source and target domains in active and passive satellite remote sensing data. It can learn domain invariant representation from source and target domains by transferring knowledge across these domains, and achieve additional performance improvement by incorporating weak label information into the model (DAMA-WL). Our experiments on a collocated CALIOP and VIIRS dataset show that DAMA and DAMA-WL can achieve higher classification accuracy in predicting cloud types.

domain adaptation↗
NASA NTRS2020

NeMO-Net – The Neural Multi-Modal Observation & Training Network for Global Coral Reef Assessment

We present NeMO-Net, the Srst open-source deep convolutional neural network (CNN) and interactive learning and training software aimed at assessing the present and past dynamics of coral reef ecosystems through habitat mapping into 10 biological and physical classes. Shallow marine systems, particularly coral reefs, are under significant pressures due to climate change, ocean acidification, and other anthropogenic pressures, leading to rapid, often devastating changes, in these fragile and diverse ecosystems. Historically, remote sensing of shallow marine habitats has been limited to meter-scale imagery due to the optical effects of ocean wave distortion, refraction, and optical attenuation. NeMO-Net combines 3D cm-scale distortion-free imagery captured using NASA FluidCam and Fluid lensing remote sensing technology with low resolution airborne and spaceborne datasets of varying spatial resolutions, spectral spaces, calibrations, and temporal cadence in a supercomputer-based machine learning framework. NeMO-Net augments and improves the benthic habitat classification accuracy of low-resolution datasets across large geographic ad temporal scales using high-resolution training data from FluidCam.NeMO-Net uses fully convolutional networks based upon ResNet and ReSneNet to perform semantic segmentation of remote sensing imagery of shallow marine systems captured by drones, aircraft, and satellites, including WorldView and Sentinel. Deep Laplacian Pyramid Super-Resolution Networks (LapSRN) alongside Domain Adversarial Neural Networks (DANNs) are used to reconstruct high resolution information from low resolution imagery, and to recognize domain-invariant features across datasets from multiple platforms to achieve high classification accuracies, overcoming inter-sensor spatial, spectral and temporal variations.Finally, we share our online active learning and citizen science platform, which allows users to provide interactive training data for NeMO-Net in 2D and 3D, integrated within a deep learning framework. We present results from the PaciSc Islands including Fiji, Guam and Peros Banhos 1 1 2 1 3 1 where 24-class classification accuracy exceeds 91%.

Chirayath, Ved↗
NASA NTRS2011

Finding Mutual Exclusion Invariants in Temporal Planning Domains

We present a technique for automatically extracting temporal mutual exclusion invariants from PDDL2.2 planning instances. We first identify a set of invariant candidates by inspecting the domain and then check these candidates against properties that assure invariance. If these properties are violated, we show that it is sometimes possible to refine a candidate by adding additional propositions and turn it into a real invariant. Our technique builds on other approaches to invariant synthesis presented in the literature, but departs from their limited focus on instantaneous discrete actions by addressing temporal and numeric domains. To deal with time, we formulate invariance conditions that account for both the entire structure of the operators (including the conditions, rather than just the effects) and the possible interactions between operators. As a result, we construct a technique that is not only capable of identifying invariants for temporal domains, but is also able to find a broader set of invariants for non-temporal domains than the previous techniques.

Bernardini, Sara↗
NASA NTRS2012

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Leffell, Joshua Isaac↗
NASA NTRS1993

Three-dimensional object recognition using similar triangles and decision trees

A system, TRIDEC, that is capable of distinguishing between a set of objects despite changes in the objects' positions in the input field, their size, or their rotational orientation in 3D space is described. TRIDEC combines very simple yet effective features with the classification capabilities of inductive decision tree methods. The feature vector is a list of all similar triangles defined by connecting all combinations of three pixels in a coarse coded 127 x 127 pixel input field. The classification is accomplished by building a decision tree using the information provided from a limited number of translated, scaled, and rotated samples. Simulation results are presented which show that TRIDEC achieves 94 percent recognition accuracy in the 2D invariant object recognition domain and 98 percent recognition accuracy in the 3D invariant object recognition domain after training on only a small sample of transformed views of the objects.

Spirkovska, Lilly↗
NASA NTRS1995

PLATSIM: An efficient linear simulation and analysis package for large-order flexible systems

PLATSIM is a software package designed to provide efficient time and frequency domain analysis of large-order generic space platforms implemented with any linear time-invariant control system. Time domain analysis provides simulations of the overall spacecraft response levels due to either onboard or external disturbances. The time domain results can then be processed by the jitter analysis module to assess the spacecraft's pointing performance in a computationally efficient manner. The resulting jitter analysis algorithms have produced an increase in speed of several orders of magnitude over the brute force approach of sweeping minima and maxima. Frequency domain analysis produces frequency response functions for uncontrolled and controlled platform configurations. The latter represents an enabling technology for large-order flexible systems. PLATSIM uses a sparse matrix formulation for the spacecraft dynamics model which makes both the time and frequency domain operations quite efficient, particularly when a large number of modes are required to capture the true dynamics of the spacecraft. The package is written in MATLAB script language. A graphical user interface (GUI) is included in the PLATSIM software package. This GUI uses MATLAB's Handle graphics to provide a convenient way for setting simulation and analysis parameters.

Maghami, Periman↗
NASA NTRS1999

A Framework for Dynamic Constraint Reasoning Using Procedural Constraints

Many complex real-world decision and control problems contain an underlying constraint reasoning problem. This is particularly evident in a recently developed approach to planning, where almost all planning decisions are represented by constrained variables. This translates a significant part of the planning problem into a constraint network whose consistency determines the validity of the plan candidate. Since higher-level choices about control actions can add or remove variables and constraints, the underlying constraint network is invariably highly dynamic. Arbitrary domain-dependent constraints may be added to the constraint network and the constraint reasoning mechanism must be able to handle such constraints effectively. Additionally, real problems often require handling constraints over continuous variables. These requirements present a number of significant challenges for a constraint reasoning mechanism. In this paper, we introduce a general framework for handling dynamic constraint networks with real-valued variables, by using procedures to represent and effectively reason about general constraints. The framework is based on a sound theoretical foundation, and can be proven to be sound and complete under well-defined conditions. Furthermore, the framework provides hybrid reasoning capabilities, as alternative solution methods like mathematical programming can be incorporated into the framework, in the form of procedures.

Jonsson, Ari K.↗
NASA NTRS1991

H(infinity) and H2 optimal controllers for periodic and multi-rate systems

The solutions to the optimal l2 to l2 disturbance rejection problem H(infinity) as well as to the LQG (linear quadratic Gaussian) H2 problem in periodic systems using the lifting technique are presented. Both problems involve a causality condition on the optimal LTI (linear time invariant) compensator when viewed in the lifted domain. The H(infinity) problem is solved using the Nehari's theorem, whereas in the H2 problem the solution is obtained using the projection theorem in Hilbert spaces. The authors demonstrate that exactly the same method of solution to the H(infinity) and H2 problems in periodic systems applies when considering the same problems in multirate sampled data systems.

Voulgaris, Petros G.↗
NASA NTRS1990

Characterization and distribution of a maize cDNA encoding a peptide similar to the catalytic region of second messenger dependent protein kinases

Maize (Zea mays) roots respond to a variety of environmental stimuli which are perceived by a specialized group of cells, the root cap. We are studying the transduction of extracellular signals by roots, particularly the role of protein kinases. Protein phosphorylation by kinases is an important step in many eukaryotic signal transduction pathways. As a first phase of this research we have isolated a cDNA encoding a maize protein similar to fungal and animal protein kinases known to be involved in the transduction of extracellular signals. The deduced sequence of this cDNA encodes a polypeptide containing amino acids corresponding to 33 out of 34 invariant or nearly invariant sequence features characteristic of protein kinase catalytic domains. The maize cDNA gene product is more closely related to the branch of serine/threonine protein kinase catalytic domains composed of the cyclic-nucleotide- and calcium-phospholipid-dependent subfamilies than to other protein kinases. Sequence identity is 35% or more between the deduced maize polypeptide and all members of this branch. The high structural similarity strongly suggests that catalytic activity of the encoded maize protein kinase may be regulated by second messengers, like that of all members of this branch whose regulation has been characterized. Northern hybridization with the maize cDNA clone shows a single 2400 base transcript at roughly similar levels in maize coleoptiles, root meristems, and the zone of root elongation, but the transcript is less abundant in mature leaves. In situ hybridization confirms the presence of the transcript in all regions of primary maize root tissue.

NASA Program Space Biology↗
NASA NTRS2010

Downscaling Soil Moisture in the Southern Great Plains Through a Calibrated Multifractal Model for Land Surface Modeling Applications

Accounting for small-scale spatial heterogeneity of soil moisture (theta) is required to enhance the predictive skill of land surface models. In this paper, we present the results of the development, calibration, and performance evaluation of a downscaling model based on multifractal theory using aircraft!based (800 m) theta estimates collected during the southern Great Plains experiment in 1997 (SGP97).We first demonstrate the presence of scale invariance and multifractality in theta fields of nine square domains of size 25.6 x 25.6 sq km, approximately a satellite footprint. Then, we estimate the downscaling model parameters and evaluate the model performance using a set of different calibration approaches. Results reveal that small-scale theta distributions are adequately reproduced across the entire region when coarse predictors include a dynamic component (i.e., the spatial mean soil moisture ) and a stationary contribution accounting for static features (i.e., topography, soil texture, vegetation). For wet conditions, we found similar multifractal properties of soil moisture across all domains, which we ascribe to the signature of rainfall spatial variability. For drier states, the theta fields in the northern domains are more intermittent than in southern domains, likely because of differences in the distribution of vegetation coverage. Through our analyses, we propose a regional downscaling relation for coarse, satellite-based soil moisture estimates, based on ancillary information (static and dynamic landscape features), which can be used in the study area to characterize statistical properties of small-scale theta distribution required by land surface models and data assimilation systems.

Mascaro, Giuseppe↗
NASA NTRS1984

Application of augmented-Lagrangian methods in meteorology: Comparison of different conjugate-gradient codes for large-scale minimization

A Lagrange multiplier method using techniques developed by Bertsekas (1982) was applied to solving the problem of enforcing simultaneous conservation of the nonlinear integral invariants of the shallow water equations on a limited area domain. This application of nonlinear constrained optimization is of the large dimensional type and the conjugate gradient method was found to be the only computationally viable method for the unconstrained minimization. Several conjugate-gradient codes were tested and compared for increasing accuracy requirements. Robustness and computational efficiency were the principal criteria.

Navon, I. M.↗
NASA NTRS2009

Towards a Certified Lightweight Array Bound Checker for Java Bytecode

Dynamic array bound checks are crucial elements for the security of a Java Virtual Machines. These dynamic checks are however expensive and several static analysis techniques have been proposed to eliminate explicit bounds checks. Such analyses require advanced numerical and symbolic manipulations that 1) penalize bytecode loading or dynamic compilation, 2) complexify the trusted computing base. Following the Foundational Proof Carrying Code methodology, our goal is to provide a lightweight bytecode verifier for eliminating array bound checks that is both efficient and trustable. In this work, we define a generic relational program analysis for an imperative, stackoriented byte code language with procedures, arrays and global variables and instantiate it with a relational abstract domain as polyhedra. The analysis has automatic inference of loop invariants and method pre-/post-conditions, and efficient checking of analysis results by a simple checker. Invariants, which can be large, can be specialized for proving a safety policy using an automatic pruning technique which reduces their size. The result of the analysis can be checked efficiently by annotating the program with parts of the invariant together with certificates of polyhedral inclusions. The resulting checker is sufficiently simple to be entirely certified within the Coq proof assistant for a simple fragment of the Java bytecode language. During the talk, we will also report on our ongoing effort to scale this approach for the full sequential JVM.

Pichardie, David↗
NASA NTRS1994

Formal results regarding metric space techniques for the study of astrophysical maps

We extend a newly developed formal system for the description of astrophyscial maps. In this formalism, we consider the difference between maps to be the distance between elements of a pseudometric space (the space of all such maps). This Ansatz allows us to measure quantitatively the difference between any two maps and to order the space of all maps. For each physical characteristic of interest, this technique assigns an 'output' function to each map; the difference between the maps is then determined from the difference between their corresponding output functions. In this present study, we show that the results of this procedure are invariant under a class of transformations of the maps and the domains of the maps. In addition, we study the propagation of errors (observational uncertainties) through this formalism. We show that the uncertainties in the output functions can be controlled provided that the signal to noise ratios in the original astrophysical maps are sufficiently high. The results of this paper thus increase the effectiveness of this formal system for the description, classification, and analysis of astrophysical maps.

Adams, Fred C.↗
NASA NTRS1973

Synthesis of a non-linear feedback system with significant plant-ignorance for prescribed time-domain tolerances

The problem considered is the design of a feedback system containing a linear, time invariant, minimum phase plant, whose parameters are known only within given bounds, such that the time response of the system remains within specified limits. A quasi-optimal design, for given design constraints, is one which minimizes the effect of white sensor noise on the input to the plant. An investigation was conducted on the use of the non linear device known as the Clegg integrator in the design of such a system. The describing function of the Clegg integrator has the same magnitude characteristic, apart from a scale factor, as the linear integrator, but has 52 deg less phase-lag, at all frequencies, than the linear integrator; thus, when used in a feedback system, it provides a larger stability margin than the linear integrator. This property allows the nonlinear feedback system to be designed so that the sensor noise is attenuated more than in the linear design.

Krishnan, K. R.↗
NASA NTRS1985

Dynamic loads analyses of flexible airplanes - New and existing techniques

This paper reviews existing techniques for calculating dynamic loads for flexible airplanes and presents a new technique. The new technique involves the summation-of-forces method of writing dynamic loads equations. Until now this form of the dynamic loads equations has been formulated in the frequency domain. The new technique uses s-plane approximation methods (previously applied only to the equations of motion) to transform the dynamic loads equations from a second-order frequency-domain formulation with frequency-dependent coefficients into a linear-time-invariant state-space formulation. Several numerical examples demonstrate the usefulfness of the new technique and the high quality of the results. In addition, a convergence investigation establishes that the summation-of-forces method converges more quickly (that is, with fewer modes) than does the mode displacement method.

Pototzky, A. S.↗