Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “encoding”

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 1,351 records · Page 75

Neural Networks Used to Compare Designed and Measured Time-Average Patterns

Electronic time-average holograms are convenient for comparing the measured vibration modes of fan blades with those calculated by finite-element models. At the NASA Lewis Research Center, neural networks recently were trained to perform what had been a simple visual comparison of the predictions of the design models with the measurements. Finite-element models were used to train neural networks to recognize damage and strain information encoded in subtle changes in the time-average patterns of cantilevers. But the design-grade finite element models were unable to train the neural networks to detect damage in complex blade shapes. The design-model-generated patterns simply did not agree well enough with the measured patterns. Instead, hybrid-training records, with measured time-average patterns as the input and model-generated strain information as the output, were used to effect successful training.

Decker, Arthur J.↗

High-Performance, Low-Complexity Codes Researched for Communication Channels

NASA Lewis Research Center s Communications Technology Division has an ongoing program in the development of efficient channel coding schemes for satellite communications applications. Through a university grant, as a part of this research, the University of Toledo is investigating the performance of turbocodes, which use parallel concatenation of non-systematic convolutional encoders with an interleaver. The error correcting capacity of these codes is close to the Shannon limit. The research emphasis is on the development of low-complexity, but higher rate (greater than one half), turbocodes and on the iterative decoding of block codes.

Kwatra, Subhash C.↗

Carrier Modulation Via Waveform Probability Density Function

Beyond the classic modes of carrier modulation by varying amplitude (AM), phase (PM), or frequency (FM), we extend the modulation domain of an analog carrier signal to include a class of general modulations which are distinguished by their probability density function histogram. Separate waveform states are easily created by varying the pdf of the transmitted waveform. Individual waveform states are assignable as proxies for digital ONEs or ZEROs. At the receiver, these states are easily detected by accumulating sampled waveform statistics and performing periodic pattern matching, correlation, or statistical filtering. No fundamental natural laws are broken in the detection process. We show how a typical modulation scheme would work in the digital domain and suggest how to build an analog version. We propose that clever variations of the modulating waveform (and thus the histogram) can provide simple steganographic encoding.

Williams, Glenn L.↗

Adaptable Constrained Genetic Programming: Extensions and Applications

An evolutionary algorithm applies evolution-based principles to problem solving. To solve a problem, the user defines the space of potential solutions, the representation space. Sample solutions are encoded in a chromosome-like structure. The algorithm maintains a population of such samples, which undergo simulated evolution by means of mutation, crossover, and survival of the fittest principles. Genetic Programming (GP) uses tree-like chromosomes, providing very rich representation suitable for many problems of interest. GP has been successfully applied to a number of practical problems such as learning Boolean functions and designing hardware circuits. To apply GP to a problem, the user needs to define the actual representation space, by defining the atomic functions and terminals labeling the actual trees. The sufficiency principle requires that the label set be sufficient to build the desired solution trees. The closure principle allows the labels to mix in any arity-consistent manner. To satisfy both principles, the user is often forced to provide a large label set, with ad hoc interpretations or penalties to deal with undesired local contexts. This unfortunately enlarges the actual representation space, and thus usually slows down the search. In the past few years, three different methodologies have been proposed to allow the user to alleviate the closure principle by providing means to define, and to process, constraints on mixing the labels in the trees. Last summer we proposed a new methodology to further alleviate the problem by discovering local heuristics for building quality solution trees. A pilot system was implemented last summer and tested throughout the year. This summer we have implemented a new revision, and produced a User's Manual so that the pilot system can be made available to other practitioners and researchers. We have also designed, and partly implemented, a larger system capable of dealing with much more powerful heuristics.

Janikow, Cezary Z.↗

Complex regulation of Arabidopsis AGR1/PIN2-mediated root gravitropic response and basipetal auxin transport by cantharidin-sensitive protein phosphatases

Polar auxin transport, mediated by two distinct plasma membrane-localized auxin influx and efflux carrier proteins/complexes, plays an important role in many plant growth and developmental processes including tropic responses to gravity and light, development of lateral roots and patterning in embryogenesis. We have previously shown that the Arabidopsis AGRAVITROPIC 1/PIN2 gene encodes an auxin efflux component regulating root gravitropism and basipetal auxin transport. However, the regulatory mechanism underlying the function of AGR1/PIN2 is largely unknown. Recently, protein phosphorylation and dephosphorylation mediated by protein kinases and phosphatases, respectively, have been implicated in regulating polar auxin transport and root gravitropism. Here, we examined the effects of chemical inhibitors of protein phosphatases on root gravitropism and basipetal auxin transport, as well as the expression pattern of AGR1/PIN2 gene and the localization of AGR1/PIN2 protein. We also examined the effects of inhibitors of vesicle trafficking and protein kinases. Our data suggest that protein phosphatases, sensitive to cantharidin and okadaic acid, are likely involved in regulating AGR1/PIN2-mediated root basipetal auxin transport and gravitropism, as well as auxin response in the root central elongation zone (CEZ). BFA-sensitive vesicle trafficking may be required for the cycling of AGR1/PIN2 between plasma membrane and the BFA compartment, but not for the AGR1/PIN2-mediated root basipetal auxin transport and auxin response in CEZ cells.

Non-NASA Center↗

Accreting Millisecond Pulsars and Fundamental Physics

X-ray emission from the surfaces of rapidly rotating neutron stars encodes information about their global properties as well as physical conditions locally. Detailed modelling of, for example, the energy dependent pulse profiles observed from accreting millisecond pulsars and thermonuclear burst oscillations can be used to derive constraints on the masses and radii of neutron stars. These measurements provide direct information on the properties of the dense matter equation of state of the supranuclear density matter in their interiors. Study of absorption lines created in the surface layers can also provide measurements of masses and radii, and may be able to probe aspects of relativistic gravity, such as frame dragging. I will discuss the results of recent efforts to carry out such measurements and their implications for the properties of dense matter.

Strohmayer, Tod↗

User-Friendly Interface Developed for a Web-Based Service for SpaceCAL Emulations

A team at the NASA Glenn Research Center is developing a Space Communications Architecture Laboratory (SpaceCAL) for protocol development activities for coordinated satellite missions. SpaceCAL will provide a multiuser, distributed system to emulate space-based Internet architectures, backbone networks, formation clusters, and constellations. As part of a new effort in 2003, building blocks are being defined for an open distributed system to make the satellite emulation test bed accessible through an Internet connection. The first step in creating a Web-based service to control the emulation remotely is providing a user-friendly interface for encoding the data into a well-formed and complete Extensible Markup Language (XML) document. XML provides coding that allows data to be transferred between dissimilar systems. Scenario specifications include control parameters, network routes, interface bandwidths, delay, and bit error rate. Specifications for all satellite, instruments, and ground stations in a given scenario are also included in the XML document. For the SpaceCAL emulation, the XML document can be created using XForms, a Webbased forms language for data collection. Contrary to older forms technology, the interactive user interface makes the science prevalent, not the data representation. Required versus optional input fields, default values, automatic calculations, data validation, and reuse will help researchers quickly and accurately define missions. XForms can apply any XML schema defined for the test mission to validate data before forwarding it to the emulation facility. New instrument definitions, facilities, and mission types can be added to the existing schema. The first prototype user interface incorporates components for interactive input and form processing. Internet address, data rate, and the location of the facility are implemented with basic form controls with default values provided for convenience and efficiency using basic XForms operations. Because different emulation scenarios will vary widely in their component structure, more complex operations are used to add and delete facilities.

Liszka, Kathy J.↗

Origin of the Eumetazoa: testing ecological predictions of molecular clocks against the Proterozoic fossil record

Molecular clocks have the potential to shed light on the timing of early metazoan divergences, but differing algorithms and calibration points yield conspicuously discordant results. We argue here that competing molecular clock hypotheses should be testable in the fossil record, on the principle that fundamentally new grades of animal organization will have ecosystem-wide impacts. Using a set of seven nuclear-encoded protein sequences, we demonstrate the paraphyly of Porifera and calculate sponge/eumetazoan and cnidarian/bilaterian divergence times by using both distance [minimum evolution (ME)] and maximum likelihood (ML) molecular clocks; ME brackets the appearance of Eumetazoa between 634 and 604 Ma, whereas ML suggests it was between 867 and 748 Ma. Significantly, the ME, but not the ML, estimate is coincident with a major regime change in the Proterozoic acritarch record, including: (i) disappearance of low-diversity, evolutionarily static, pre-Ediacaran acanthomorphs; (ii) radiation of the high-diversity, short-lived Doushantuo-Pertatataka microbiota; and (iii) an order-of-magnitude increase in evolutionary turnover rate. We interpret this turnover as a consequence of the novel ecological challenges accompanying the evolution of the eumetazoan nervous system and gut. Thus, the more readily preserved microfossil record provides positive evidence for the absence of pre-Ediacaran eumetazoans and strongly supports the veracity, and therefore more general application, of the ME molecular clock.

NASA Discipline Evolutionary Biology↗

Multivariate Parameter Sets for Optimal Synthesis of Compliant Mechanisms

This paper will propose the use of control maps along with discretized elements or meshes in the design parameter set for optimizing compliant mechanisms. The use of control maps will be demonstrated to encode the motion of groups of nodes or control points within a compliant mechanism design with simple mapping rules. The technique will serve as an alternative to increased mesh size or node wandering techniques that have been proposed to increase the number of alternative design shapes that may be considered. As an alternative approach, the proposed control map parameterization has the significant benefit that it minimizes the number of design parameters necessary (parameters increase linearly with the mesh size) in describing a given design making it computationally efficient. A limited number of tiles can produce a map that has a significant effect on the final shape. If the tiles are chosen appropriately, the problems such as material overlap and non-convex mesh elements are avoided automatically. This paper will describe the implementation of these control maps and provide several examples showing their implementation in the compliant mechanism topology synthesis process.

Shibakov, Alex↗

Measuring, Enabling and Comparing Modularity, Regularity and Hierarchy in Evolutionary Design

For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy - characteristics that are found both in man-made and natural designs. Here we claim that these characteristics are enabled by implementing the attributes of combination, control-flow and abstraction in the representation. To support this claim we use an evolutionary algorithm to evolve solutions to different sizes of a table design problem using five different representations, each with different combinations of modularity, regularity and hierarchy enabled and show that the best performance happens when all three of these attributes are enabled. We also define metrics for modularity, regularity and hierarchy in design encodings and demonstrate that high fitness values are achieved with high values of modularity, regularity and hierarchy and that there is a positive correlation between increases in fitness and increases in modularity. regularity and hierarchy.

Hornby, Gregory S.↗

The world problem: on the computability of the topology of 4-manifolds

Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing machine with an arbitrary input can be encoded into the topology of a 4-manifold, such that the 4-manifold is homeomorphic to a certain other 4-manifold if and only if the corresponding Turing machine halts on the associated input. Physical implications are briefly discussed.

vanMeter, J. R.↗

The M-Integral for Computing Stress Intensity Factors in Generally Anisotropic Materials

The objective of this project is to develop and demonstrate a capability for computing stress intensity factors in generally anisotropic materials. These objectives have been met. The primary deliverable of this project is this report and the information it contains. In addition, we have delivered the source code for a subroutine that will compute stress intensity factors for anisotropic materials encoded in both the C and Python programming languages and made available a version of the FRANC3D program that incorporates this subroutine. Single crystal super alloys are commonly used for components in the hot sections of contemporary jet and rocket engines. Because these components have a uniform atomic lattice orientation throughout, they exhibit anisotropic material behavior. This means that stress intensity solutions developed for isotropic materials are not appropriate for the analysis of crack growth in these materials. Until now, a general numerical technique did not exist for computing stress intensity factors of cracks in anisotropic materials and cubic materials in particular. Such a capability was developed during the project and is described and demonstrated herein.

Warzynek, P. A.↗

A Perfect View of Vesta: Creating Pointing Observations for the Dawn Spacecraft on Asteroid 4 Vesta

The Dawn spacecraft has a timely and clever assignment in store. It will take a close look at two intact survivors from the dawn of the solar system (asteroids 4 Vesta and 1 Ceres) to understand more about solar system origin and evolution. To optimize science return, Dawn must make carefully designed observations on approach and in survey orbit, high altitude mapping orbit, and low altitude mapping orbit at each body. In this report, observations outlined in the science plan are modeled using the science opportunity analyzer program for the Vesta encounter. Specifically, I encoded Dawn's flight rules into the program, modeled pointing profiles of the optical instruments (framing camera, visible infrared spectrometer) and mapped their fields of view onto Vesta's surface. Visualization of coverage will provide the science team with information necessary to assess feasibility of alternative observation plans. Dawn launches in summer 2006 and ends its journey in 2016. Instrument observations on Vesta in 2011 will supply detailed information about Vesta's surface and internal structure. These data will be used to analyze the formation and history of the protoplanet and, therefore, complete an important step in understanding the development of our solar system.

Hay, Katrina M.↗

Cerebellum Augmented Rover Development

Bio-Inspired Technologies and Systems (BITS) are a very natural result of thinking about Nature's way of solving problems. Knowledge of animal behaviors an be used in developing robotic behaviors intended for planetary exploration. This is the expertise of the JFL BITS Group and has served as a philosophical model for NMSU RioRobolab. Navigation is a vital function for any autonomous system. Systems must have the ability to determine a safe path between their current location and some target location. The MER mission, as well as other JPL rover missions, uses a method known as dead-reckoning to determine position information. Dead-reckoning uses wheel encoders to sense the wheel's rotation. In a sandy environment such as Mars, this method is highly inaccurate because the wheels will slip in the sand. Improving positioning error will allow the speed of an autonomous navigating rover to be greatly increased. Therefore, local navigation based upon landmark tracking is desirable in planetary exploration. The BITS Group is developing navigation technology based upon landmark tracking. Integration of the current rover architecture with a cerebellar neural network tracking algorithm will demonstrate that this approach to navigation is feasible and should be implemented in future rover and spacecraft missions.

King, Matthew↗

Production of Functional Proteins: Balance of Shear Stress and Gravity

The present invention provides for a method of culturing cells and inducing the expression of at least one gene in the cell culture. The method provides for contacting the cell with a transcription factor decoy oligonucleotide sequence directed against a nucleotide sequence encoding a shear stress response element.

Goodwin, Thomas John↗

Soluble Protein Analysis using a Compact Bench-top Flow Cytometer

Future space exploration missions will require analytical technology capable of providing both autonomous medical care to the crew and investigative capabilities to researchers. While several promising candidate technologies exist for further development, flow cytometry is an attractive technology as it offers both crew health (blood cell count, leukocyte differential, etc.) and a wide array of biochemistry and immunology assays. research settings, the application of this technique to soluble protein analysis is also possible. Proteomic beads using fluorescent dyes for optical encoding were used to monitor six cytokines simultaneously in cell medium of cell cultures in stationary and rotating cell culture systems. The results of this work demonstrate that a compact flow cytometer, such as a system proposed for space flight, can detect a variety of soluble proteins for crew health and biotechnology experiments during long-term missions.

Pappas, Dimitri↗

A Comparative Study of Probability Collectives Based Multi-agent Systems and Genetic Algorithms

We compare Genetic Algorithms (GA's) with Probability Collectives (PC), a new framework for distributed optimization and control. In contrast to GA's, PC-based methods do not update populations of solutions. Instead they update an explicitly parameterized probability distribution p over the space of solutions. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. The PC approach works in both continuous and discrete problems. It does not suffer from the resolution limitation of the finite bit length encoding of parameters into GA alleles. It also has deep connections with both game theory and statistical physics. We review the PC approach using its motivation as the information theoretic formulation of bounded rationality for multi-agent systems. It is then compared with GA's on a diverse set of problems. To handle high dimensional surfaces, in the PC method investigated here p is restricted to a product distribution. Each distribution in that product is controlled by a separate agent. The test functions were selected for their difficulty using either traditional gradient descent or genetic algorithms. On those functions the PC-based approach significantly outperforms traditional GA's in both rate of descent, trapping in false minima, and long term optimization.

Huang, Chien-Feng↗

Learning from the Mars Rover Mission: Scientific Discovery, Learning and Memory

Purpose: Knowledge management for space exploration is part of a multi-generational effort. Each mission builds on knowledge from prior missions, and learning is the first step in knowledge production. This paper uses the Mars Exploration Rover mission as a site to explore this process. Approach: Observational study and analysis of the work of the MER science and engineering team during rover operations, to investigate how learning occurs, how it is recorded, and how these representations might be made available for subsequent missions. Findings: Learning occurred in many areas: planning science strategy, using instrumen?s within the constraints of the martian environment, the Deep Space Network, and the mission requirements; using software tools effectively; and running two teams on Mars time for three months. This learning is preserved in many ways. Primarily it resides in individual s memories. It is also encoded in stories, procedures, programming sequences, published reports, and lessons learned databases. Research implications: Shows the earliest stages of knowledge creation in a scientific mission, and demonstrates that knowledge management must begin with an understanding of knowledge creation. Practical implications: Shows that studying learning and knowledge creation suggests proactive ways to capture and use knowledge across multiple missions and generations. Value: This paper provides a unique analysis of the learning process of a scientific space mission, relevant for knowledge management researchers and designers, as well as demonstrating in detail how new learning occurs in a learning organization.

Linde, Charlotte↗