Search NASA⌕ Search

SEARCH · Search NASA

Results for “Complexity bounding”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

Maximum Likelihood Synchronization for Pulse Position Modulation with Inter-Symbol Guard Times

Deep space optical communications promises orders-of-magnitude growth in communication capacity, supporting high data rate applications such as video streaming and high-bandwidth science instruments. Pulse position modulation is the modulation format of choice for deep space applications, and by inserting inter-symbol guard times between the symbols, the signal carries the timing information needed by the demodulator. Accurately extracting this timing information is crucial to demodulating and decoding this signal. In this paper we propose a low complexity maximum likelihood timing estimator for pulse position modulation with inter-symbol guard times which significantly outperforms the prior art in this domain. We show that this estimator can achieve the same performance as prior estimators with an order-of-magnitude less signal flux, or multiple orders-of-magnitude less flux-accumulation time. Further we show that this estimator achieves the Cramer-Rao bound, making it asymptotically efficient. This method does not require an explicit synchronization sequence, freeing up channel resources for data transmission.

Rogalin, Ryan↗
NASA NTRS1990

Advanced software integration: The case for ITV facilities

The array of technologies and methodologies involved in the development and integration of avionics software has moved almost as rapidly as computer technology itself. Future avionics systems involve major advances and risks in the following areas: (1) Complexity; (2) Connectivity; (3) Security; (4) Duration; and (5) Software engineering. From an architectural standpoint, the systems will be much more distributed, involve session-based user interfaces, and have the layered architectures typified in the layers of abstraction concepts popular in networking. Typified in the NASA Space Station Freedom will be the highly distributed nature of software development itself. Systems composed of independent components developed in parallel must be bound by rigid standards and interfaces, the clean requirements and specifications. Avionics software provides a challenge in that it can not be flight tested until the first time it literally flies. It is the binding of requirements for such an integration environment into the advances and risks of future avionics systems that form the basis of the presented concept and the basic Integration, Test, and Verification concept within the development and integration life cycle of Space Station Mission and Avionics systems.

Garman, John R.↗
NASA NTRS2002

Computing the Envelope for Stepwise-Constant Resource Allocations

Computing tight resource-level bounds is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with nodes equal to the events and edges equal to the necessary predecessor links between events. A staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. Each stage has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible and promising for use in the inner loop of flexible-time scheduling algorithms.

Muscettola, Nicola↗
NASA NTRS2007

Scope of Gradient and Genetic Algorithms in Multivariable Function Optimization

Global optimization of a multivariable function - constrained by bounds specified on each variable and also unconstrained - is an important problem with several real world applications. Deterministic methods such as the gradient algorithms as well as the randomized methods such as the genetic algorithms may be employed to solve these problems. In fact, there are optimization problems where a genetic algorithm/an evolutionary approach is preferable at least from the quality (accuracy) of the results point of view. From cost (complexity) point of view, both gradient and genetic approaches are usually polynomial-time; there are no serious differences in this regard, i.e., the computational complexity point of view. However, for certain types of problems, such as those with unacceptably erroneous numerical partial derivatives and those with physically amplified analytical partial derivatives whose numerical evaluation involves undesirable errors and/or is messy, a genetic (stochastic) approach should be a better choice. We have presented here the pros and cons of both the approaches so that the concerned reader/user can decide which approach is most suited for the problem at hand. Also for the function which is known in a tabular form, instead of an analytical form, as is often the case in an experimental environment, we attempt to provide an insight into the approaches focusing our attention toward accuracy. Such an insight will help one to decide which method, out of several available methods, should be employed to obtain the best (least error) output. *

Shaykhian, Gholam Ali↗
NASA NTRS2012

A Risk-Constrained Multi-Stage Decision Making Approach to the Architectural Analysis of Mars Missions

This paper presents a novel risk-constrained multi-stage decision making approach to the architectural analysis of planetary rover missions. In particular, focusing on a 2018 Mars rover concept, which was considered as part of a potential Mars Sample Return campaign, we model the entry, descent, and landing (EDL) phase and the rover traverse phase as four sequential decision-making stages. The problem is to find a sequence of divert and driving maneuvers so that the rover drive is minimized and the probability of a mission failure (e.g., due to a failed landing) is below a user specified bound. By solving this problem for several different values of the model parameters (e.g., divert authority), this approach enables rigorous, accurate and systematic trade-offs for the EDL system vs. the mobility system, and, more in general, cross-domain trade-offs for the different phases of a space mission. The overall optimization problem can be seen as a chance-constrained dynamic programming problem, with the additional complexity that 1) in some stages the disturbances do not have any probabilistic characterization, and 2) the state space is extremely large (i.e, hundreds of millions of states for trade-offs with high-resolution Martian maps). To this purpose, we solve the problem by performing an unconventional combination of average and minimax cost analysis and by leveraging high efficient computation tools from the image processing community. Preliminary trade-off results are presented.

entry, descent, and landing (EDL)↗
NASA NTRS2014

De Novo Synthesis and Functional Study of Primitive Polypeptides in the Prebiotic Protein World

DNA, RNA and proteins within a lipid-bound membrane are the core components of life, but the order of their appearance during the origin of life is still under debate. The widely accepted RNA World hypothesis states that RNA likely emerged prior to proteins and DNA since RNA can serve both replicative and catalytic roles. While biochemists have reproduced the synthesis, polymerization, and replication of nucleotides and RNA under controlled prebiotic conditions, it is clear that such complex organic molecules were are not present in significant amounts in the the starting prebiotic material on Earth either from endogenous production or meteoritic input. In contrast, amino acids are naturally abundant in various prebiotic contexts such as carbonaceous chondrites and Urey-Miller type experiments, and many studies have demonstrated that under plausible prebiotic conditions amino acids could condense or polymerize to give rise to short peptides. These findings support the basis of a Protein World hypothesis for life, however little has been done to study the functions of such primitive peptides. Here we present our novel synthetic biology-based approach to the de novo synthesis of billions of primitive peptidesproteins derived from a limited set of naturally abundant proteinogenic amino acids such as glycine, alanine, aspartic acid, glutamic acid, valine and serine. Of these peptides, the ones with divalent metal-binding capability are of particular interest and will be screened and identified. Certain divalent metals were likely present in prebiotic environments. Not only do they coordinate well with amino acids, but they also catalyze reactions, which are difficult to achieve in organic chemistry. Since D-chiral and non-proteinogenic amino acids are also abundant in the universe and may provide insight into the pathway by which life developed, we will also discuss methods to analyze primitive peptides consisting of these amino acids and D-chiral and non-proteinogenic amino acids. By understanding this naturalistic pathway, we will be able to better understand how life developed here on Earth. Since these amino acids are abundant in universe, this work provide insight into pathways by which life developed on Earth and, by extension, the probability of life arising elsewhere.

Fujishima, Kosuke↗
NASA NTRSDate not supplied

Variational Coupled Loads Analysis using the Hybrid Parametric Variation Method

Time-domain coupled loads analysis (CLA)is used to determine the response of a launch vehicle and payload system to transient forces, such as liftoff, engine ignitions and shutdowns, jettison events, and atmospheric flight loads, such as buffet. CLA, using Hurty/Craig-Bampton (HCB)component models, is the accepted method for the establishment of design-level loads for launch systems. However, uncertainty in the component models flows into uncertainty in predicted system results. Uncertainty in the structural responses during launch is a significant concern because small variations in launch vehicle and payload mode shapes and their interactions can result in significant variations in system loads. Uncertainty quantification (UQ)is used to determine statistical bounds on prediction accuracy based on model uncertainty. In this paper uncertainty is treated at the HCB component-model level. In an effort to account for model uncertainties and statistically bound their effect on CLA predictions, this work combines CLA with UQ in a process termed variational coupled loads analysis (VCLA). The modeling of uncertainty using a parametric approach, in which input parameters are represented by random variables, is common, but its major drawback is the resulting uncertainty is limited to the form of the nominal model. Uncertainty in model form is one of the biggest contributors to uncertainty in complex built-up structures. Model-form uncertainty can be represented using a nonparametric approach based on random matrix theory (RMT). In this work, UQ is performed using the hybrid parametric variation (HPV)method, which combines parametric with nonparametric uncertainty at the HCB component model level. The HPV method requires the selection of dispersion values for the HCB fixed-interface (FI)eigenvalues, and the HCB mass and stiffness matrices. The dispersions are based upon component test-analysis modal correlation results. During VCLA, random component models are assembled into an ensemble of random systems using a Monte Carlo (MC)approach. CLA is applied to each of the ensemble members to produce an ensemble of system-level responses for statistical analysis. The proposed methodology is demonstrated through its application to a buffet loads analysis of NASA’s Space Launch System (SLS)during the transonic regime fifty seconds after liftoff. Core stage (CS)section shears and moments are recovered, and statistics are computed.

Uncertainty Quantification↗
NASA NTRS1984

New maps of Lakshmi Planum and eastern Aphrodite, Venus

Interest on Venus has centered on three regions; (1) Aphrodite Terra, especially east of the main uplant portion, (2) Ishtar Terra, especially Lakshmi Planum and its bounding scarp and massifs, and (3) Beta Regio-Phoebe Regio. The last region is topographically similar to the East African rift system, and has been inferred to have a similar tectonic origin. The Aphrodite region is part of a 21,000 km long tectonic zone that seems best explained as due to extension, and that may represent hot spots clustered along an incipient divergent plate boundary. The most interesting and complex portion of this tectonic zone is that part of eastern Aphrodite between Thetis Regio and Atla Regio. In contrast, the Lakshmi Planum region has many topographic characteristics suggesting that it is a true continent, and thus indicative of convergence and a thick crust. Detailed topographic contour maps of eastern Aphrodite Terra and of Lakshmi Planum are included.

Mcgill, G. E.↗
NASA NTRS1986

Approximate algorithms for partitioning and assignment problems

The problem of optimally assigning the modules of a parallel/pipelined program over the processors of a multiple computer system under certain restrictions on the interconnection structure of the program as well as the multiple computer system was considered. For a variety of such programs it is possible to find linear time if a partition of the program exists in which the load on any processor is within a certain bound. This method, when combined with a binary search over a finite range, provides an approximate solution to the partitioning problem. The specific problems considered were: a chain structured parallel program over a chain-like computer system, multiple chain-like programs over a host-satellite system, and a tree structured parallel program over a host-satellite system. For a problem with m modules and n processors, the complexity of the algorithm is no worse than O(mnlog(W sub T/epsilon)), where W sub T is the cost of assigning all modules to one processor and epsilon the desired accuracy.

Iqbal, M. A.↗
NASA NTRS1982

Structural load prediction methods for space payloads

The state of the art in structural loads prediction procedures for spacecraft is summarized. Three categories of prediction techniques delineated by cost, complexity, comprehensiveness, accuracy, and applications are outlined. The lowest cost method has been used for earth resources, communications, and weather satellites, the medium cost method for sun-synchronous orbits and the large space telescope, and the most expensive for planetary missions, comet rendezvous, and out-of-ecliptic orbits, all assuming Shuttle launch. The lowest cost method involves a mass-acceleration curve. A shock spectra technique predicts a least upper bound for loads. A recovered transient method analyzes the interface acceleration of two connected launch vehicles. The most accurate method devised thus far is a transient analysis of the total launch vehicle/payload dynamic system.

Wada, B. K.↗
NASA NTRS1985

The south-central United States magnetic anomaly

A positive magnetic anomaly, which dominates the MAGSAT scalar field over the south-central United States, results from the superposition of magnetic effects from several geologic sources and tectonic structures in the crust. The highly magnetic basement rocks of this region show good correlation with increased crustal thickness, above average crustal velocity and predominantly negative free-air gravity anomalies, all of which are useful constraints for modeling the magnetic sources. The positive anomaly is composed of two primary elements. The western-most segment is related to middle Proterozoic granite intrusions, rhyolite flows and interspersed metamorphic basement rocks in the Texas panhandle and eastern New Mexico. The anomaly and the magnetic crust are bounded to the west by the north-south striking Rio Grande Rift. The anomaly extends eastward over the Grenville age basement rocks of central Texas, and is terminated to the south and east by the buried extension of the Ouachita System. The northern segment of the anomaly extends eastward across Oklahoma and Arkansas to the Mississippi Embayment. It corresponds to a general positive magnetic region associated with the Wichita Mountains igneous complex in south-central Oklahoma and 1.2 to 1.5 Ga. felsic terrane to the north.

Starich, P. J.↗
NASA NTRS1996

Generating Voronoi Diagrams for Curved Shapes with Divide-and-Conquer

Voronoi diagrams have been used in many practical applications including solid modeling, Numerical Control machining, Finite Element mesh generation, etc. Investigating the properties of these diagrams is an active research topic with many fruitful results. Computational techniques for Voronoi diagrams, however, have been concentrated on low order elements, for points, lines, polygons, quadratic curves and surfaces. This paper presents a divide-and-conquer scheme computing the diagrams for planar shapes bounded by closed curves commonly encountered in Computer Aided Design. These curves include analytical curves and splines. The algorithm first divides the boundary curve into sections, delimited by curve points with the minimal curvatures. Bisector branches for these sections are then generated and merged recursively to obtain the final diagram. A detailed example in the paper shows the steps of the generation and merging of the bisectors. A simple analysis of the complexity of the algorithm is also presented.

Chou, Jin J.↗
NASA NTRS1999

Immunocytochemical localization of latent transforming growth factor-beta1 activation by stimulated macrophages

Transforming growth factor-beta1 (TGF-beta) is secreted in a latent form consisting of mature TGF-beta noncovalently associated with its amino-terminal propeptide, which is called latency associated peptide (LAP). Biological activity depends upon the release of TGF-beta from the latent complex following extracellular activation, which appears to be the key regulatory mechanism controlling TGF-beta action. We have identified two events associated with latent TGF-beta (LTGF-beta) activation in vivo: increased immunoreactivity of certain antibodies that specifically detect TGF-beta concomitant with decreased immunoreactivity of antibodies to LAP. Macrophages stimulated in vitro with interferon-gamma and lipopolysaccharide reportedly activate LTGF-beta via cell membrane-bound protease activity. We show through dual immunostaining of paraformaldehyde-fixed macrophages that such physiological TGF-beta activation is accompanied by a loss of LAP immunoreactivity with concomitant revelation of TGF-beta epitopes. The induction of TGF-beta immunoreactivity colocalized with immunoreactive betaglycan/RIII in activated macrophages, suggesting that LTGF-beta activation occurs on the cell surface. Confocal microscopy of metabolically active macrophages incubated with antibodies to TGF-beta and betaglycan/RIII prior to fixation supported the localization of activation to the cell surface. The ability to specifically detect and localize LTGF-beta activation provides an important tool for studies of its regulation.

NASA Discipline Radiation Health↗
NASA NTRS2019

Emergence of Simple Ion Channels by Self-Assembly of Short Peptides

As protocells transitioned from structures bound by membranes made of simple amphiphiles, such as fatty acids, to structures containing phospholipid membranes, they became nearly impermeable to charged species. Yet, the ability to transport ions across membranes was vital to regulating cellular volume, pH homeostasis, generating energy and sensing the environment. For this reason, life evolved ion channels, protein structures surrounding water-filled pores in the membrane that facilitated ion transport. In contemporary cells, ion channels are complex protein assemblies. Could the same function be carried out, even if less efficiently and selectively, by much simpler peptides at the origins of life? To answer this question, we turned to trichogen (GAIV), an 11-residue peptide that was found to permeabilize membrane, causing leakage of the vesicle content including ions. Since GAIV is synthesized non-gnomically, it represents as excellent model for the earliest, poorly optimized channels. Understanding the mechanism by which short peptides, such as GAIV, mediate ion transport across membranes provides crucial information on the emergence, structure and the mechanism of action of the earliest ion channels. In this study, we used extensive molecular dynamics (MD) simulations to investigate directly spontaneous assembly of GAIV peptide and its structural dynamics, the formation of an induced water pore across the membrane and consequently ion conduction through the membrane.

Wei, Chenyu↗
NASA NTRSDate not supplied

Dude Where's My Stars: A Novel Topologically Justified Approach to Star Tracking

In this paper, we consider two novel approaches to celestial navigation for spacecraft. Determining attitude without any prior knowledge using star tracking is known to be a difficult task, particularly given the computational complexity and the many potential sources of misinformation. We consider localization by optimizing matching parameters without explicit star identification in a computationally tractable manner. This is achieved using the mathematical tools of topological data analysis (TDA) and cellular sheaves to study the geometry and distribution of cataloged stars. A framework is gained that enhances the statistical approach to noise handling and false star detection, and heterogeneous sensor fusion. Finally, we discuss confidence bounds and minimum information requirements for successful operation.

Sheaf theory↗
NASA NTRS2001

Computing the Envelope for Stepwise Constant Resource Allocations

Estimating tight resource level is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with noises equal to the events and edges equal to the necessary predecessor links between events. The incremental solution of a staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. The staged algorithm has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible for use in the inner loop of search-based scheduling algorithms.

Muscettola, Nicola↗
NASA NTRS1977

Robustness of linear quadratic state feedback designs in the presence of system uncertainty

The paper deals with the problem of expressing the robustness (stability) property of a linear quadratic state feedback (LQSF) design quantitatively in terms of bounds on the perturbations (modeling errors or parameter variations) in the system matrices so that the closed-loop system remains stable. Nonlinear time-varying and linear time-invariant perturbations are considered. The only computation required in obtaining a measure of the robustness of an LQSF design is to determine the eigenvalues of two symmetric matrices determined when solving the algebraic Riccati equation corresponding to the LQSF design problem. Results are applied to a complex dynamic system consisting of the flare control of a STOL aircraft. The design of the flare control is formulated as an LQSF tracking problem.

Patel, R. V.↗
NASA NTRS1996

Intelligent Planning and Scheduling for Controlled Life Support Systems

Planning in Controlled Ecological Life Support Systems (CELSS) requires special look ahead capabilities due to the complex and long-term dynamic behavior of biological systems. This project characterizes the behavior of CELSS, identifies the requirements of intelligent planning systems for CELSS, proposes the decomposition of the planning task into short-term and long-term planning, and studies the crop scheduling problem as an initial approach to long-term planning. CELSS is studied in the realm of Chaos. The amount of biomass in the system is modeled using a bounded quadratic iterator. The results suggests that closed ecological systems can exhibit periodic behavior when imposed external or artificial control. The main characteristics of CELSS from the planning and scheduling perspective are discussed and requirements for planning systems are given. Crop scheduling problem is identified as an important component of the required long-term lookahead capabilities of a CELSS planner. The main characteristics of crop scheduling are described and a model is proposed to represent the problem. A surrogate measure of the probability of survival is developed. The measure reflects the absolute deviation of the vital reservoir levels from their nominal values. The solution space is generated using a probability distribution which captures both knowledge about the system and the current state of affairs at each decision epoch. This probability distribution is used in the context of an evolution paradigm. The concepts developed serve as the basis for the development of a simple crop scheduling tool which is used to demonstrate its usefulness in the design and operation of CELSS.

Leon, V. Jorge↗