Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time series 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 91 records · Page 5

Morphological Evolution of Directional Solidification Interfaces in Microgravity: An Analysis of Model Experiments Performed on the International Space Station

A series of experiments performed using the Pore Formation and Mobility Investigation (PFMI) apparatus within the glovebox facility (GBX) on board the International Space Station (ISS) has provided video images of the morphological evolution of a three-dimensional interface in a diffusion controlled regime. The experimental samples were prepared on ground by filling glass tubes, 1 cm ID and approximately 30 cm in length, with "alloys" of succinonitrile (SCN) and water in an atmosphere of nitrogen at 450 millibar pressure. The compositions of the samples processed and analyzed are 0.25,0.5 and 1.0 wt% water. Experimental processing parameters of temperature gradient and translation speed, as well as camera settings, were remotely monitored and manipulated from the ground Telescience Center (TSC) at the Marshall !3pace Flight Center. During the experiments, the sample was first subjected to a unidirectional melt back, generally at 10 microns per second, with a constant temperature gradient ahead of the melting interface. Following the melt back, the interface was allowed to stabilize before translation is initiated. The temperatures in the sample were monitored by six in situ thermocouples and the position is monitored by an optical linear encoder. For the experiments performed and analyzed, the gradients ranged from 2.5 - 3.3 K/mm and the initial pulling velocities ranged from 0.7 micron per second to 1 micron per second with subsequent transition velocities of up to 100 microns per second. The data provided by the PFMI for analysis includes near-real-time (NRT) video captured on the ground during the experiment runs, ISS Video Tape Recorder (VTR) data dumped from the VTR at the end of the experiment run and recorded on the ground, telemetry data including temperature and position measurements, and limited flight HI-8 tapes in 2 camera views of experiment runs for which tapes have been returned to the investigators from ISS. Because of limited down mass from the ISS, the majority of the initial analysis has been performed using the NRT and VTR video data but will be supplemented with the HI-8 video as it becomes available. hardware and procedures required to prepare samples for correlation to flight samples is described. Using this ground-based system, a series of experiments have been performed for direct comparison with the flight data. The results of these comparisons as well as implications to future microgravity experiments are presented and discussed. A ground-based thin-sample directional solidification system as well as all associated

Strutzenberg, Louise L.↗

Multiscale graph neural network autoencoders for interpretable scientific machine learning

The goal of this work is to address two limitations in autoencoder-based models: latent space interpretability and compatibility with unstructured meshes. This is accomplished here with the development of a novel graph neural network (GNN) autoencoding architecture with demonstrations on complex fluid flow applications. To address the first goal of interpretability, the GNN autoencoder achieves reduction in the number nodes in the encoding stage through an adaptive graph reduction procedure. Further, this reduction procedure essentially amounts to flowfieldconditioned node sampling and sensor identification, and produces interpretable latent graph representations tailored to the flowfield reconstruction task in the form of so-called masked fields. These masked fields allow the user to (a) visualize where in physical space a given latent graph is active, and (b) interpret the time-evolution of the latent graph connectivity in accordance with the time-evolution of unsteady flow features (e.g. recirculation zones, shear layers) in the domain. To address the goal of unstructured mesh compatibility, the autoencoding architecture utilizes a series of multi-scale message passing (MMP) layers, each of which models information exchange among node neighborhoods at various lengthscales. The MMP layer, which augments standard single-scale message passing with learnable coarsening operations, allows the decoder to more efficiently reconstruct the flowfield from the identified regions in the masked fields. Analysis of latent graphs produced by the autoencoder for various model settings are conducted using unstructured snapshot data sourced from large-eddy simulations in a backward-facing step (BFS) flow configuration with an OpenFOAM-based flow solver at high Reynolds numbers.

97 MATHEMATICS AND COMPUTING↗

LV software support for supersonic flow analysis

The software for configuring a Laser Velocimeter (LV) counter processor system was developed using structured design. The LV system includes up to three counter processors and a rotary encoder. The software for configuring and testing the LV system was developed, tested, and included in an overall software package for data acquisition, analysis, and reduction. Error handling routines respond to both operator and instrument errors which often arise in the course of measuring complex, high-speed flows. The use of networking capabilities greatly facilitates the software development process by allowing software development and testing from a remote site. In addition, high-speed transfers allow graphics files or commands to provide viewing of the data from a remote site. Further advances in data analysis require corresponding advances in procedures for statistical and time series analysis of nonuniformly sampled data.

Bell, William A.↗

Gene network analysis of poplar root transcriptome in response to drought stress identifies a PtaJAZ3PtaRAP2.6-centered hierarchical network

Using time-series transcriptomic data from poplar roots undergoing polyethylene glycol (PEG)-induced drought stress, we built a genetic network model of the involved putative molecular responses. We found that the network resembled a hierarchical structure. The highest hierarchical level in this structure is occupied by 9 genes, which we called superhubs because they were primarily connected to 18 hub genes, which are then connected to 2,934 terminal genes. We were only able to regenerate transgenic plants overexpressing two of the superhubs, suggesting that the majority of the superhubs might interfere with the regeneration process and did not allow recovery of transgenic plants. The two superhubs encode proteins with closest homology to JAZ3 and RAP2.6 genes of Arabidopsis and were consequently named PtaJAZ3 and PtaRAP2.6. PtaJAZ3 and PtaRAP2.6 overexpressing transgenic lines showed a significant increase in both root elongation and lateral root proliferation and these responses were specific for the drought stress conditions and were highly correlated with the levels of overexpression of the transgenes. Several lines of evidence suggest of regulatory interactions between the two superhubs. Both superhubs were significantly induced by methyl jasmonate (MeJA). Because jasmonate signaling involves ubiquitin-mediated proteasome degradation, treatment with proteasome inhibitor abolished the MeJA induction for both genes. PtaRAP2.6 was upregulated in PtaJAZ3 transgenics but PtaJAZ3 expression was not affected in the PtaRAP2.6 overexpressors. The discovery of the two genes and further future insights into the associated mechanisms can lead to improved understanding and novel approaches to regulate root architecture in relation to drought stress.

59 BASIC BIOLOGICAL SCIENCES↗

LV software support for supersonic flow analysis

The software for configuring an LV counter processor system has been developed using structured design. The LV system includes up to three counter processors and a rotary encoder. The software for configuring and testing the LV system has been developed, tested, and included in an overall software package for data acquisition, analysis, and reduction. Error handling routines respond to both operator and instrument errors which often arise in the course of measuring complex, high-speed flows. The use of networking capabilities greatly facilitates the software development process by allowing software development and testing from a remote site. In addition, high-speed transfers allow graphics files or commands to provide viewing of the data from a remote site. Further advances in data analysis require corresponding advances in procedures for statistical and time series analysis of nonuniformly sampled data.

Bell, W. A.↗

Improving Control of Two Motor Controllers

A computer program controls motors that drive translation stages in a metrology system that consists of a pair of two-axis cathetometers. This program is specific to Compumotor Gemini (or equivalent) motors and the Compumotor 6K-series (or equivalent) motor controller. Relative to the software supplied with the controller, this program affords more capabilities and is easier to use. Written as a Virtual Instrument in the LabVIEW software system, the program presents an imitation control panel that the user can manipulate by use of a keyboard and mouse. There are three modes of operation: command, movement, and joystick. In command mode, single commands are sent to the controller for troubleshooting. In movement mode, distance, speed, and/or acceleration commands are sent to the controller. Position readouts from the motors and from position encoders on the translation stages are displayed in marked fields. At any time, the position readouts can be recorded in a file named by the user. In joystick mode, the program yields control of the motors to a joystick. The program sends commands to, and receives data from, the controller via a serial cable connection, using the serial-communication portion of the software supplied with the controller.

Toland, Ronald W.↗

Solving high-dimensional inverse problems using amortized likelihood-free inference with noisy and incomplete data

Here, we present a likelihood-free probabilistic inversion method based on normalizing flows for high-dimensional inverse problems. The proposed method is composed of two complementary networks: a summary network for data compression and an inference network for parameter estimation. The summary network encodes raw observations into a fixed-size vector of summary features, while the inference network generates samples of the approximate posterior distribution of the model parameters based on these summary features. The posterior samples are produced in a deep generative fashion by sampling from a latent Gaussian distribution and passing these samples through an invertible transformation. We construct this invertible transformation by sequentially alternating conditional invertible neural network and conditional neural spline flow layers. The summary and inference networks are trained simultaneously. We apply the proposed method to an inversion problem in groundwater hydrology to estimate the posterior distribution of the log-conductivity field conditioned on spatially sparse time-series observations of the system’s hydraulic head responses. The conductivity field is represented with 706 degrees of freedom in the considered problem. Comparison with the likelihood-based iterative ensemble smoother PEST-IES method demonstrates that the proposed method accurately estimates the parameter posterior distribution and the observations’ predictive posterior distribution at a fraction of the inference time of PEST-IES.

conditional invertible neural network↗

A Pattern Dictionary Method for Anomaly Detection

In this paper, we propose a compression-based anomaly detection method for time series and sequence data using a pattern dictionary. The proposed method is capable of learning complex patterns in a training data sequence, using these learned patterns to detect potentially anomalous patterns in a test data sequence. The proposed pattern dictionary method uses a measure of complexity of the test sequence as an anomaly score that can be used to perform stand-alone anomaly detection. We also show that when combined with a universal source coder, the proposed pattern dictionary yields a powerful atypicality detector that is equally applicable to anomaly detection. The pattern dictionary-based atypicality detector uses an anomaly score defined as the difference between the complexity of the test sequence data encoded by the trained pattern dictionary (typical) encoder and the universal (atypical) encoder, respectively. We consider two complexity measures: the number of parsed phrases in the sequence, and the length of the encoded sequence (codelength). Specializing to a particular type of universal encoder, the Tree-Structured Lempel–Ziv (LZ78), we obtain a novel non-asymptotic upper bound, in terms of the Lambert W function, on the number of distinct phrases resulting from the LZ78 parser. This non-asymptotic bound determines the range of anomaly score. As a concrete application, we illustrate the pattern dictionary framework for constructing a baseline of health against which anomalous deviations can be detected.

97 MATHEMATICS AND COMPUTING↗

Harmonic analysis for the characterization and correction of geometric distortion in MRI

Purpose: Magnetic resonance imaging (MRI) is gaining widespread use in radiation therapy planning, patient setup verification, and real-time guidance of radiation delivery. Successful implementation of these technologies relies on the development of simple and efficient methods to characterize and monitor the geometric distortions arising due to system imperfections and gradient nonlinearities. To this end, the authors present the theory and validation of a novel harmonic approach to the quantification of system-related distortions in MRI. Methods: The theory of spatial encoding in MRI is applied to demonstrate that the 3D distortion vector field (DVF) is given by the solution of a second-order boundary value problem (BVP). This BVP is comprised of Laplace’s equation and a limited measurement of the distortion on the boundary of a specified region of interest (ROI). An analytical series expansion solving this BVP within a spherical ROI is obtained, and a statistical uncertainty analysis is performed to determine how random errors in the boundary measurements propagate to the ROI interior. This series expansion is then evaluated to obtain volumetric DVF mappings that are compared to reference data obtained on a 3 T full-body scanner. This validation is performed within two spheres of 20 cm diameter (one centered at the scanner origin and the other offset +3 cm along each of the transverse directions). Initially, a high-order mapping requiring measurements at 5810 boundary points is used. Then, after exploring the impact of the boundary sampling density and the effect of series truncation, a reduced-order mapping requiring measurements at 302 boundary points is evaluated. Results: The volumetric DVF mappings obtained from the harmonic analysis are in good agreement with the reference data. Following distortion correction using the high-order mapping, the authors estimate a reduction in the mean distortion magnitude from 0.86 to 0.42 mm and from 0.93 to 0.39 mm within the central and offset ROIs, respectively. In addition, the fraction of points with a distortion magnitude greater than 1 mm is reduced from 35.6% to 2.8% and from 40.4% to 1.5%, respectively. Similarly, following correction using the reduced-order mapping, the mean distortion magnitude reduces to 0.45–0.42 mm within the central and offset ROIs, and the fraction of points with a distortion magnitude greater than 1 mm is reduced to 2.8% and 1.5%, respectively. Conclusions: A novel harmonic approach to the characterization of system-related distortions in MRI is presented. This method permits a complete and accurate mapping of the DVF within a specified ROI using a limited measurement of the distortion on the ROI boundary. This technique eliminates the requirement to exhaustively sample the DVF at a dense 3D array of points, thereby permitting the design of simple, inexpensive phantoms that may incorporate additional modules for auxiliary quality assurance objectives.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

NLR HPC Eagle GPU Node Metrics

Ganglia node metrics and iLO (Integrated Lights Out) power data captured from six representative Eagle GPU nodes The Eagle HPC operated at NLR from 2019 through 2024. Eagle was a 2,000-node, 8-petaflop system. This dataset is a representative sample of metrics for 6 of the GPU nodes. Each GPU node contained 2 CPUs and 2 GPUs. Data provided in compressed CSV format. Ganglia and iLO Power Time Series Fields ts: Timestamp dv: Device / Node - Rack and Unit - r103u17 == r(ack)103u(nit)17 mt: Metric (only present for Ganglia) vl: Value - Value in watts for iLO power (instantaneous value at sampling time) or specified Ganglia metric below Ganglia Metrics Metric name -- Metric description -- Unit cpu_aidle -- Percent of time since boot idle CPU -- Percent cpu_idle -- Percent CPU idle -- Percent cpu_nice -- Percent CPU nice -- Percent cpu_speed -- Speed in MHz of CPU -- MHz cpu_user -- Percent CPU user -- Percent cpu_wio -- The percentage of CPU Wait I/O -- Percent gpu0_bar1_memory -- Used GPU bar1 memory -- MB gpu0_decoder_util -- GPU decoder utilization -- Percent gpu0_ecc_db_error -- Total ECC error counts for the GPU -- Number gpu0_encoder_util -- GPU encoder utilization -- Percent gpu0_fan -- Fan speed -- RPM gpu0_fb_memory -- Used GPU framebuffer memory -- MB gpu0_graphics_clock_report -- Current clock speeds for the device -- MHz gpu0_mem_total -- Memory total -- MB gpu0_mem_util -- Memory utilization -- Percent gpu0_power_usage_report -- Power usage report -- Watts gpu0_temp -- GPU 1 temperature -- Celsius gpu1_bar1_memory -- Used GPU bar1 memory -- MB gpu1_decoder_util -- GPU decoder utilization -- Percent gpu1_ecc_db_error -- Total ECC error counts for the GPU -- Number gpu1_encoder_util -- GPU encoder utilization -- Percent gpu1_fan -- Fan speed -- RPM gpu1_fb_memory -- Used GPU framebuffer memory -- MB gpu1_graphics_clock_report -- Current clock speeds for the GPU -- MHz gpu1_mem_total -- Memory total -- MB gpu1_mem_util -- Memory utilization -- MB gpu1_power_usage_report -- Power usage report -- Watts gpu1_temp -- GPU 1 temperature -- Celsius ipmi_cpu1_temp -- CPU 1 temperature -- Celsius ipmi_cpu2_temp -- CPU 2 temperature -- Celsius ipmi_inlet_ambient_temp -- Temperature measured at intake -- Celsius ipmi_vr_p1_temp -- CPU 1 voltage regulator temperature -- Celsius ipmi_vr_p2_temp -- CPU 2 voltage regulator temperature -- Celsius mem_buffers -- Amount of buffered memory -- Bytes mem_cached -- Amount of cached memory -- Bytes mem_free -- Amount of available memory -- Bytes mem_shared -- Amount of shared memory -- Bytes mem_total -- Amount of available memory -- Bytes

97 MATHEMATICS AND COMPUTING↗

Bundle Networks: Fiber Bundles, Local Trivializations, and a Generative Approach to Exploring Many-to-one Maps

Many-to-one maps are ubiquitous in machine learning, from the image recognition model that assigns a multitude of distinct images to the concept of ``cat'' to the time series forecasting model which assigns a range of distinct time-series to a single scalar regression value. While the primary use of such models is naturally to associate correct output to each input, in many problems it is also useful to be able to explore, understand, and sample from a model's fibers, which are the set of input values x such that f(x) = y, for fixed y in the output space. In this paper we show that popular generative architectures are ill-suited to such tasks. Motivated by this we introduce a novel generative architecture, a Bundle Network, based on the concept of a fiber bundle from (differential) topology. BundleNets exploit the idea of a local trivialization wherein a space can be locally decomposed into a product space that cleanly encodes the many-to-one nature of the map. By enforcing this decomposition in BundleNets and by utilizing state-of-the-art invertible components, investigating a network's fibers becomes natural.

Courts, Nicolas C.↗

Deep learning to estimate permeability using geophysical data

Time-lapse electrical resistivity tomography (ERT) is a popular geophysical method to estimate three-dimensional (3D) permeability fields from electrical potential difference measurements. Traditional inversion and data assimilation methods are used to ingest this ERT data into hydrogeophysical models to estimate permeability. Due to ill-posedness and the curse of dimensionality, existing inversion strategies provide poor estimates and low resolution of the 3D permeability field. Recent advances in deep learning provide us with powerful algorithms to overcome this challenge. This paper presents a deep learning (DL) framework to estimate the 3D subsurface permeability from time-lapse ERT data. To test the feasibility of the proposed framework, we train DL-enabled inverse models on simulation data. Each measurement in both synthetic and field data is standardized by removing the mean and scaling the time-series to unit variance. This pre-processing step is necessary to bring simulation data closer to field observations. Subsurface process models based on hydrogeophysics are used to generate this synthetic data. Training performed on limited simulation data resulted in the DL model over-fitting. An advanced data augmentation based on mixup is implemented to generate additional training samples to overcome this issue. This mixup technique creates weakly labeled (low-fidelity) samples from strongly labeled (high-fidelity) data. The weakly labeled training data is then used to develop DL-enabled inverse models and reduce over-fitting. As both time-lapse ERT (1133048 features/realization) and 3D permeability (585453 features/realization) data samples are from a high-dimensional space, principal component analysis (PCA) is employed to reduce dimensionality. Encoded ERT and encoded permeability are generated using the trained PCA estimators. A deep neural network is then trained to map the encoded ERT to encoded permeability. This mixup training and unsupervised learning allowed us to build a fast and reasonably accurate DL-based inverse model under limited simulation data. Results show that proposed weak supervised learning can capture salient spatial features in the 3D permeability field. Quantitatively, the average mean squared error (in terms of the natural log) on the strongly labeled training, validation, and test datasets is less than 0.5. The R 2 -score (global metric) is greater than 0.75, and the percent error in each cell (local metric) is less than 10%. Finally, an added benefit in terms of computational cost is that the proposed DL-based inverse model is at least O(10 4 ) times faster than running a forward model once it is trained. Data generation, DL model training, and hyperparameter tuning to identify optimal neural network architectures utilized high-performance computing resources while the DL inference is performed on a standard laptop. Approximately, O(10 5 ) processor hours are used for generating data and DL tuning and training. We acknowledge that the data generation and DL model development are expensive. But once a DL model is trained, it can be re-used for inversion rapidly for the given system, with set physics and domain. Note that traditional inversion may require multiple forward model simulations (e.g., in the order of 10 to 1000), which are very expensive. This computational savings ≈ O(10 5 ) – O(10 7 )) makes the proposed DL-based inverse model attractive for subsurface imaging and real-time ERT monitoring applications due to fast and yet reasonably accurate estimations of permeability field.

58 GEOSCIENCES↗

Multi-View Budgeted Learning under Label and Feature Constraints Using Label-Guided Graph-Based Regularization

Budgeted learning under constraints on both the amount of labeled information and the availability of features at test time pertains to a large number of real world problems. Ideas from multi-view learning, semi-supervised learning, and even active learning have applicability, but a common framework whose assumptions fit these problem spaces is non-trivial to construct. We leverage ideas from these fields based on graph regularizers to construct a robust framework for learning from labeled and unlabeled samples in multiple views that are non-independent and include features that are inaccessible at the time the model would need to be applied. We describe examples of applications that fit this scenario, and we provide experimental results to demonstrate the effectiveness of knowledge carryover from training-only views. As learning algorithms are applied to more complex applications, relevant information can be found in a wider variety of forms, and the relationships between these information sources are often quite complex. The assumptions that underlie most learning algorithms do not readily or realistically permit the incorporation of many of the data sources that are available, despite an implicit understanding that useful information exists in these sources. When multiple information sources are available, they are often partially redundant, highly interdependent, and contain noise as well as other information that is irrelevant to the problem under study. In this paper, we are focused on a framework whose assumptions match this reality, as well as the reality that labeled information is usually sparse. Most significantly, we are interested in a framework that can also leverage information in scenarios where many features that would be useful for learning a model are not available when the resulting model will be applied. As with constraints on labels, there are many practical limitations on the acquisition of potentially useful features. A key difference in the case of feature acquisition is that the same constraints often don't pertain to the training samples. This difference provides an opportunity to allow features that are impractical in an applied setting to nevertheless add value during the model-building process. Unfortunately, there are few machine learning frameworks built on assumptions that allow effective utilization of features that are only available at training time. In this paper we formulate a knowledge carryover framework for the budgeted learning scenario with constraints on features and labels. The approach is based on multi-view and semi-supervised learning methods that use graph-encoded regularization. Our main contributions are the following: (1) we propose and provide justification for a methodology for ensuring that changes in the graph regularizer using alternate views are performed in a manner that is target-concept specific, allowing value to be obtained from noisy views; and (2) we demonstrate how this general set-up can be used to effectively improve models by leveraging features unavailable at test time. The rest of the paper is structured as follows. In Section 2, we outline real-world problems to motivate the approach and describe relevant prior work. Section 3 describes the graph construction process and the learning methodologies that are employed. Section 4 provides preliminary discussion regarding theoretical motivation for the method. In Section 5, effectiveness of the approach is demonstrated in a series of experiments employing modified versions of two well-known semi-supervised learning algorithms. Section 6 concludes the paper.

99 GENERAL AND MISCELLANEOUS↗

Computer Program Recognizes Patterns in Time-Series Data

A computer program recognizes selected patterns in time-series data like digitized samples of seismic or electrophysiological signals. The program implements an artificial neural network (ANN) and a set of N clocks for the purpose of determining whether N or more instances of a certain waveform, W, occur within a given time interval, T. The ANN must be trained to recognize W in the incoming stream of data. The first time the ANN recognizes W, it sets clock 1 to count down from T to zero; the second time it recognizes W, it sets clock 2 to count down from T to zero, and so forth through the Nth instance. On the N + 1st instance, the cycle is repeated, starting with clock 1. If any clock has not reached zero when it is reset, then N instances of W have been detected within time T, and the program so indicates. The program can readily be encoded in a field-programmable gate array or an application-specific integrated circuit that could be used, for example, to detect electroencephalographic or electrocardiographic waveforms indicative of epileptic seizures or heart attacks, respectively.

Hand, Charles↗

Scalable SCPPM Decoder

A decoder was developed that decodes a serial concatenated pulse position modulation (SCPPM) encoded information sequence. The decoder takes as input a sequence of four bit log-likelihood ratios (LLR) for each PPM slot in a codeword via a XAUI 10-Gb/s quad optical fiber interface. If the decoder is unavailable, it passes the LLRs on to the next decoder via a XAUI 10-Gb/s quad optical fiber interface. Otherwise, it decodes the sequence and outputs information bits through a 1-GB/s Ethernet UDP/IP (User Datagram Protocol/Internet Protocol) interface. The throughput for a single decoder unit is 150-Mb/s at an average of four decoding iterations; by connecting a number of decoder units in series, a decoding rate equal to that of the aggregate rate is achieved. The unit is controlled through a 1-GB/s Ethernet UDP/IP interface. This ground station decoder was developed to demonstrate a deep space optical communication link capability, and is unique in the scalable design to achieve real-time SCPP decoding at the aggregate data rate.

Quir, Kevin J.↗

Waypoint Following Dynamics of a Quaternion Error Feedback Attitude Control System

Closed-loop attitude steering can be used to implement alternative attitude maneuvers by using a conventional attitude control system to track a non-standard attitude profile sampled as a series of sequential commands. The idea has been employed in practice to perform zero-propellant maneuvers on the International Space Station and minimum time maneuvers on NASA’s TRACE space telescope. A challenge for operational implementation of the idea is the finite capacity of a space vehicle’s command storage buffer. One approach to mitigate the problem is to downsample-and-hold the attitude commands so that the attitude control system to follows a set of waypoints. This paper explores the waypoint following dynamics of a quaternion error feedback control law for downsample-and-hold. It is shown that downsample-and-hold induces a ripple between downsamples that causes the satellite angular rate to significantly overshoot the desired limit. Analysis in the z-domain is carried out in order to understand the phenomenon. An interpolating Chebyshev-type filter is proposed that allows attitude commands to be encoded in terms of a small set of filter coefficients. Using the interpolating filter, commands can be issued at the ACS rate but with significantly reduced memory requirements. The attitude control system of NASA’s Lunar Reconnaissance Orbiter is used as an example to illustrate the behavior of a practical attitude control system.

Mark Karpenko↗

Molecular-Genetic Analysis of Osmoregulation, Osmotic Adjustment and Growth in Arabidopsis

The molecular mechanism by which plants control cellular solute and water content, called osmoregulation, is critical for cell expansion and survival, particularly in response to cellular water deficit or low water potential. Two loci, lwr1 and lwr2 (low water potential response), that affect osmoregulation were isolated as part of a larger screen to identify mutants with alterations in low water potential-induced proline accumulation. When seedlings of lwr2 were exposed to a steady low water potential stress over a period of several days using PEG-infused agar plates, the mutants had lesser proline accumulation and osmotic adjustment than the wild type, Ben. A mapping population was raised but it was not possible to reliably identify the mutants in the population and thus could not be used for mapping. The mutant lwr1 was mapped and the gene identified. The mutant lwr1 had greater accumulation of proline, higher total solute content, greater osmotic adjustment at low water potential, altered abscisic acid content, and increased sensitivity to applied abscisic acid with respect to Pro content than the wild type, Ben, when the water potential was decreased over a period of several days using PEG-infused agar plates. lwr1 also had altered growth and morphology, including defects in trichome branching with the majority of the trichomes having a single point, shortened siliques which were crooked, and significantly lengthened time to flowering. Using bulk segregant analysis, the lwr1 loci was mapped to the lower arm of chromosome II, near the marker nga168. Further detailed fine mapping located the mutation to the gene PKL, At2g25170, which was previously identified as a gene involved in altered root development. PKL encodes a chromatin remodeling factor. The mutation in lwr1 introduced a stop codon in the 14th exon of At2g25170. The mutant was not complemented by 4 other known mutants having a disrupted PKL gene confirming the placement of this mutation in lwr1. In response to ABA treatment, lwr1 and 5 different mutants in At2g25170, in two different genetic backgrounds, had elevated proline content compared to the wild type. Proline levels of lwr1 in response to water-deficit were not the same as in the originally published mutant; lwr1 and other mutants in At2g25170 had lower proline content than wild type in response to water deficit. A series of microarray hybridizations have been completed comparing control and PEG-induced stress in lwr1, lwr2 and the wild type. Analyses of these data are ongoing and are expected to shed light on the gene mutated in lwr2 and to indicate the extent of changed of gene expression that are involved in the response of lwr1 to water deficit stress. In addition, microarray experiments were completed on ABA treatments and ABA and stress treatments combined for lwr1 in order to further explore the role of ABA in plant water-deficit stress.

59 BASIC BIOLOGICAL SCIENCES↗