Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Context algorithm”

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 703 records · Page 39

Efficient Active Learning for New Domains

The promise of active learning is to reduce the number of labeled examples required by supervised machine learning algorithms. The largest potential benefits lie in entirely new domains, for which no labeled examples yet exist. Yet to date, most active learning studies are retroactive and demonstrate the benefits that could have been gained if active learning had been used. What are the barriers to true adoption and utilization of active learning? We focus on two: (1) the cold start or class discovery problem, in which active learning methods may struggle to make progress with zero labeled examples, and (2) the cost of having the classifier in the loop to select the next example to be labeled. We assess different active learning approaches in the context of these two barriers and conclude with recommendations for how to employ active learning in new domains. As an example, we report on the use of active learning on a large, novel data set of Mars surface images.

Lu, Steven↗

Constraining neutrino oscillation and interaction parameters with the NOvA Near Detector and Far Detector data using Markov Chain Monte Carlo

This thesis reports a constraint of the neutrino oscillation parameters $\Delta m^{2}_{32}$, $\sin^2 \theta_{23}$, and $\delta_{CP}$ using the NuMI Off-Axis $\nu$ Appearance (NOvA) experiment's Near Detector (ND) data and Far Detector (FD) fake data set simultaneously. This thesis also reports a constraint on NOvA's systematic uncertainty model solely with its Near Detector data. The Hamiltonian Monte Carlo algorithm is used to estimate Bayesian Credible Intervals for the oscillation and interaction parameters. The $1\sigma$ Credible Intervals for $\sin^2 \theta_{23}$ are $(0.44, 0.512)$ $\cup$ $(0.536, 0.56)$, for $\Delta m^{2}_{32}$ $(2.41 \times 10^{-3}$ eV$^2,\ 2.52 \times 10^{-3}$ eV$^2)$, and for $\delta_{CP}$ $(0.74\pi,\ 1.1\pi)$ $\cup$ $(1.38\pi,\ 1.58\pi)$. The statistical power of the ND data constrains NOvA's interaction parameters, while the FD fake data constrains the oscillation parameters. This is the first analysis within NOvA to constrain the ND and FD prediction sim ultaneously, and to investigate the neutrino interaction modeling in the context of constraining the oscillation parameters. To constrain the ND data requires a sophisticated understanding of the neutrino interaction modeling and its uncertainties. The interested reader is advised to focus on Chapters 4 and 6, which discuss the ND selection, uncertainties, and ND-only fits to data. The reader interested in oscillation parameter constraints will find this in Chapter 7.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Deep Multi-Agent Reinforcement Learning for Real-World Signalized Traffic Corridor Control

Signalized traffic control problem has been addressed recently with deep Reinforcement Learning (RL) approaches involving diverse state, action, and reward structures. While significant progress has been noted in the literature, open challenges still remain in the areas of adaptive signal phase timing, coordination in a multi-intersection corridor setting, and consideration of real-world traffic conditions. In the context of deep RL-based problem framing, extensions are needed that enable adaptive signal phase timings in an intersection agent's action space, computationally efficient information sharing among neighboring signalized intersection agents along a corridor, and experimentation in realistic simulation environments. In this paper, we develop a deep Advantage Actor Critic (A2C) multi-agent RL (MARL) approach capturing the research extensions above and apply it within a real-world calibrated Aimsun Next traffic corridor simulation model based on traffic data from the City of Coral Gables, Florida. For a multi-intersection corridor control setting, our numerical simulation experiments with a decentralized A2C MARL algorithm applied at different time periods led to a total average corridor travel delay reduction (expressed in seconds/mile averaged over vehicles) from 4.9% to 19.9% compared to state-of-the-art actuated control.

Shuvo, Salman S. [BATTELLE (PACIFIC NW LAB)]↗

Analyzing and Predicting Effort Associated with Finding and Fixing Software Faults

Context: Software developers spend a significant amount of time fixing faults. However, not many papers have addressed the actual effort needed to fix software faults. Objective: The objective of this paper is twofold: (1) analysis of the effort needed to fix software faults and how it was affected by several factors and (2) prediction of the level of fix implementation effort based on the information provided in software change requests. Method: The work is based on data related to 1200 failures, extracted from the change tracking system of a large NASA mission. The analysis includes descriptive and inferential statistics. Predictions are made using three supervised machine learning algorithms and three sampling techniques aimed at addressing the imbalanced data problem. Results: Our results show that (1) 83% of the total fix implementation effort was associated with only 20% of failures. (2) Both safety critical failures and post-release failures required three times more effort to fix compared to non-critical and pre-release counterparts, respectively. (3) Failures with fixes spread across multiple components or across multiple types of software artifacts required more effort. The spread across artifacts was more costly than spread across components. (4) Surprisingly, some types of faults associated with later life-cycle activities did not require significant effort. (5) The level of fix implementation effort was predicted with 73% overall accuracy using the original, imbalanced data. Using oversampling techniques improved the overall accuracy up to 77%. More importantly, oversampling significantly improved the prediction of the high level effort, from 31% to around 85%. Conclusions: This paper shows the importance of tying software failures to changes made to fix all associated faults, in one or more software components and/or in one or more software artifacts, and the benefit of studying how the spread of faults and other factors affect the fix implementation effort.

software fix implementation effort↗

A Regional Map of Mangrove Extent for Myanmar, Thailand, and Cambodia Shows Losses of 44% By 1996

Southeast Asia is home to some of the planet’s most carbon-dense and biodiverse mangrove ecosystems. There is still much uncertainty with regards to the timing and magnitude of changes in mangrove cover over the past 50 years. While there are several regional to global maps of mangrove extent in Southeast Asia over the past two decades, data prior to the mid-1990s is limited due to the scarcity of Earth Observation data of sufficient quality and the historical limitations to publicly available EO. We present a classification of mangrove extent using Landsat 1-2 MSS Tier 2 data from 1972-1977 for three Southeast Asian countries: Myanmar, Thailand, and Cambodia. Mangrove extent land cover maps were generated using a Random Forest machine learning algorithm that effectively mapped a total of 15,420.51 km2. Accuracy assessments indicated that the classification for the mangrove and non-mangrove class had a producer’s accuracy of 79.63 % and 98.24 %a user’s accuracy of 89.58 % and 96.21 %, and an overall accuracy of 95.26 % . We found a decline of 6,830 km2 between the 1970’s and 2020, showing that44.29% of the mangrove area in these countries has been lost in the past 48 years. Most of this loss occurred between the 1970’s and 1996; rates of deforestation declined dramatically after 1996. This study also urges that these results be considered within the context of the local need for these coastal resources that helped them endure the political and financial challenges of their coastal homes.

Priscilla Baltezar↗

CoSim: A Simulator for Co-Scheduling of Batch and On-Demand Jobs in HPC Datacenters

The increasing scale and complexity of scientific applications are rapidly transforming the ecosystem of tools, methods, and workflows adopted by the high-performance computing (HPC) community. Big data analytics and deep learning are gaining traction as essential components in this ecosystem in a variety of scenarios, such as, steering of experimental instruments , acceleration of high-fidelity simulations through surrogate computations, and guided ensemble searches. In this context, the batch job model traditionally adopted by the supercomputing in-frastructures needs to be complemented with support to schedule opportunistic on-demand analytics jobs, leading to the problem of efficient preemption of batch jobs with minimum loss of progress. In this paper, we design and implement a simulator, CoSim, that enables on-the-fly analysis of the trade-offs arising between delaying the start of opportunistic on-demand jobs, which leads to longer analytics latency, and loss of progress due to preemption of batch jobs, which is necessary to make room for on-demand jobs. To this end, we propose an algorithm based on dynamic programming with predictable performance and scalability that enables supercomputing infrastructure schedulers to analyze the aforementioned trade-off and take decisions in near real-time. Compared with other state-of-art approaches using traces of the Theta pre-Exascale machine, our approach is capable of finding the optimal solution, while achieving high performance and scalability.

batch job preemption↗

Real-Time Neuromorphic Processing of Spatiotemporal Data for Scientific Discovery

Spiking Neural Networks (SNNs) are brain-inspired computing models incorporating unique temporal dynamics and event-driven processing. Rich dynamics in both space and time offer great challenges and opportunities for efficient processing of sparse spatiotemporal data compared with conventional artificial neural networks (ANNs). Under this context, the goal of this project is to develop spiking neural network based neuromorphic computing to enable energy-efficient real-time learning and processing of spatiotemporal data. This report summarizes the key results on network architecture design, training methods, and SNN hardware acceleration achieved under this project, demonstrating the promise of spiking neural networks.

97 MATHEMATICS AND COMPUTING↗

A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization

When a classical barrier method is applied to the solution of a nonlinear programming problem with inequality constraints, the Hessian matrix of the barrier function becomes increasingly ill-conditioned as the solution is approached. As a result, it may be desirable to consider alternative numerical algorithms. We compare the performance of two methods motivated by barrier functions. The first is a stabilized form of the classical barrier method, where a numerically stable approximation to the Newton direction is used when the barrier parameter is small. The second is a modified barrier method where a barrier function is applied to a shifted form of the problem, and the resulting barrier terms are scaled by estimates of the optimal Lagrange multipliers. The condition number of the Hessian matrix of the resulting modified barrier function remains bounded as the solution to the constrained optimization problem is approached. Both of these techniques can be used in the context of a truncated-Newton method, and hence can be applied to large problems, as well as on parallel computers. In this paper, both techniques are applied to problems with bound constraints and we compare their practical behavior.

Nash, Stephen G.↗

Constrained non-negative matrix factorization enabling real-time insights of in situ and high-throughput experiments

Non-negative matrix factorization (NMF) is an appealing class of methods for performing unsupervised learning on streaming spectral data, particularly in time-sensitive applications such as in situ characterization of materials. These methods seek to decompose a dataset into a small number of components and weights that can compactly represent the underlying signal while effectively reconstructing the observations with minimal error. However, canonical NMF methods have no underlying requirement that the reconstruction uses components or weights that are representative of the true physical processes. In this work, we demonstrate how constraining a subset of the NMF weights or components as rigid priors, provided as known or assumed values, can provide significant improvement in revealing true underlying phenomena. We present a PyTorch-based method for efficiently applying constrained NMF and demonstrate its application to several synthetic examples. Our implementation allows an expert researcher-in-the-loop to provide and dynamically adjust the constraints during a live experiment involving streaming spectral data. Such interactive priors allow researchers to specify known or identified independent components, as well as functional expectations about the mixing or transitions between the components. We further demonstrate the application of this method to measured synchrotron x-ray total scattering data from in situ beamline experiments. In such a context, constrained NMF can result in a more interpretive and scientifically relevant decomposition than canonical NMF or other decomposition techniques. As a result, the details of the method are provided, along with general guidance for employing constrained NMF in the extraction of critical information and insights during time-sensitive experimental applications.

36 MATERIALS SCIENCE↗

Learning model combining convolutional deep neural network with a self-attention mechanism for AC optimal power flow

Alternating current optimal power flow (OPF) analysis is critical for efficient and reliable operation of power systems. For large systems or repetitive computations, the traditional methods such as the direct and gradient methods, or non-traditional methods, such as the genetic algorithm and simulating annealing, are time-consuming and unsuitable for real-time computing. The work in this paper proposes a novel framework to obtain the optimal solution of power flow in real-time using a combination of convolutional neural networks and a self-attention mechanism. All parameters of the power networks are rearranged in an image-like shape of a multi-channel image where each channel is a two-dimensional matrix. The proposed approach is adaptive with every input size of power systems as well as frequent variations of network topologies without intervention to the framework core. The encompassment of all power system contexts in which all parameters of internal elements, generation costs, and topology information are included, contributes to the higher accuracy of inference compared to other current machine-learning-based OPF-solving methods. Besides, the proposed framework established on ubiquitous platforms is effortlessly integrated into current infrastructures of power systems, and the great efficiency along with the computation speed may serve as a critical point for practical implications, such as enabling faster decision-making during real-time operations, predicting system contingencies, and remedial actions based on an offline pre-trained model. Furthermore, this supervised learning process is applied to the dataset of four case studies of meshed power systems: the IEEE 5-bus system (IEEE-5), the IEEE 30-bus system (IEEE-30), the IEEE 39-bus system (IEEE-39), and the IEEE 57-bus system (IEEE-57) to prove the efficacy of the proposed method.

42 ENGINEERING↗

Detecting outbreaks using a spatial latent field

In this paper, we present a method for estimating the infection-rate of a disease as a spatial-temporal field. Our data comprises time-series case-counts of symptomatic patients in various areal units of a region. We extend an epidemiological model, originally designed for a single areal unit, to accommodate multiple units. The field estimation is framed within a Bayesian context, utilizing a parameterized Gaussian random field as a spatial prior. We apply an adaptive Markov chain Monte Carlo method to sample the posterior distribution of the model parameters condition on COVID-19 case-count data from three adjacent counties in New Mexico, USA. Our results suggest that the correlation between epidemiological dynamics in neighboring regions helps regularize estimations in areas with high variance (i.e., poor quality) data. Using the calibrated epidemic model, we forecast the infection-rate over each areal unit and develop a simple anomaly detector to signal new epidemic waves. Our findings show that anomaly detector based on estimated infection-rates outperforms a conventional algorithm that relies solely on case-counts.

Safta, Cosmin [Sandia National Laboratories (SNL-C↗

A Computational Theory for the Emergence of Grammatical Categories in Cortical Dynamics

A general agreement in psycholinguistics claims that syntax and meaning are unified precisely and very quickly during online sentence processing. Although several theories have advanced arguments regarding the neurocomputational bases of this phenomenon, we argue that these theories could potentially benefit by including neurophysiological data concerning cortical dynamics constraints in brain tissue. In addition, some theories promote the integration of complex optimization methods in neural tissue. In this paper we attempt to fill these gaps introducing a computational model inspired in the dynamics of cortical tissue. In our modeling approach, proximal afferent dendrites produce stochastic cellular activations, while distal dendritic branches–on the other hand–contribute independently to somatic depolarization by means of dendritic spikes, and finally, prediction failures produce massive firing events preventing formation of sparse distributed representations. The model presented in this paper combines semantic and coarse-grained syntactic constraints for each word in a sentence context until grammatically related word function discrimination emerges spontaneously by the sole correlation of lexical information from different sources without applying complex optimization methods. By means of support vector machine techniques, we show that the sparse activation features returned by our approach are well suited—bootstrapping from the features returned by Word Embedding mechanisms—to accomplish grammatical function classification of individual words in a sentence. In this way we develop a biologically guided computational explanation for linguistically relevant unification processes in cortex which connects psycholinguistics to neurobiological accounts of language. We also claim that the computational hypotheses established in this research could foster future work on biologically-inspired learning algorithms for natural language processing applications.

59 BASIC BIOLOGICAL SCIENCES↗

Search for the pair production of long-lived supersymmetric partners of the tau lepton in proton-proton collisions at $\sqrt{s}=13$ TeV

Gauge-mediated supersymmetry-breaking models provide a strong motivation to search for a supersymmetric partner of the tau lepton (stau) with a macroscopic lifetime. Long-lived stau decays produce tau leptons that are displaced from the primary proton-proton interaction vertex, leading to an unconventional signature. This paper presents a search for the direct production of long-lived staus decaying within the CMS tracker volume in proton-proton collisions at $\sqrt{s}=13$ TeV, performed for the first time with an identification algorithm based on a graph neural network dedicated to displaced tau leptons. The data sample, corresponding to an integrated luminosity of 138 fb −1 , was recorded with the CMS experiment at the CERN LHC between 2016 and 2018. This search excludes, at 95% confidence level, stau masses, m~ τ , in the 126–260 (90–425) GeV range for a proper decay length of 50 mm in the maximally mixed (mass-degenerate) scenario, while for m~ τ = 200 GeV, stau proper decay lengths are excluded in the range 21–94 (6–333) mm. These results improve the exclusion limits compared to previous searches, and extend the parameter space explored in the context of supersymmetry.

Hadron-Hadron Scattering↗

Data-driven modeling and control of an X-ray bimorph adaptive mirror

Adaptive X-ray mirrors are being adopted on high-coherent-flux synchrotron and X-ray free-electron laser beamlines where dynamic phase control and aberration compensation are necessary to preserve wavefront quality from source to sample, yet challenging to achieve. Additional difficulties arise from the inability to continuously probe the wavefront in this context, which demands methods of control that require little to no feedback. In this work, a data-driven approach to the control of adaptive X-ray optics with piezo-bimorph actuators is demonstrated. This approach approximates the non-linear system dynamics with a discrete-time model using random mirror shapes and interferometric measurements as training data. For mirrors of this type, prior states and voltage inputs affect the shape-change trajectory, and therefore must be included in the model. Without the need for assumed physical models of the mirror's behavior, the generality of the neural network structure accommodates drift, creep and hysteresis, and enables a control algorithm that achieves shape control and stability below 2 nm RMS. Using a prototype mirror and ex situ metrology, it is shown that the accuracy of our trained model enables open-loop shape control across a diverse set of states and that the control algorithm achieves shape error magnitudes that fall within diffraction-limited performance.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Probabilistic Method of Assessing Carbon Accumulation Rate at Imnavait Creek Peatland, Arctic Long Term Ecological Research Station, Alaska

Arctic peatlands are an important part of the global carbon cycle, accumulating atmospheric carbon as organic matter since the Late glacial. Current methods for understanding the changing efficiency of the peatland carbon sink rely on peatlands with an undisturbed stratigraphy. Here we present a method of estimating primary carbon accumulation rate from a site where permafrost processes have either vertically or horizontally translocated nearby carbon-rich sediment out of stratigraphic order. Briefly, our new algorithm estimates the probability of the age of deposition of a random increment of sediment in the core. The method assumes that if sediment age is measured at even depth increments, dates are more likely to occur during intervals of higher accumulation rate and vice versa. Multiplying estimated sedimentation rate by measured carbon density yields carbon accumulation rate. We perform this analysis at the Imnavait Creek Peatland, near the Arctic Long Term Ecological Research network site at Toolik Lake, Alaska. Using classical radiocarbon age modeling, we find unreasonably high rates of carbon accumulation at various Holocene intervals. With our new method, we find accumulation rate changes that are in improved agreement within the context of other sites throughout Alaska and the rest of the Circum-Arctic region.

carbon accumulation;Imnavait;peatlands;permafrost;↗

Planning and Optimization for Multi-robot Planetary Cave Exploration under Intermittent Connectivity Constraints

Exploring subsurface structures with autonomous robots is of growing interest in the context of planetary caves studies. Communication between robots in these environments is severely degraded which complicates coordination and information distribution. In this paper we focus on planning for mobility and communication in a cave exploration scenario where the situational awareness of a static base station is critical. We propose a notion of information-consistency where a plan itself is part of the information to be shared between robots, and propose a method for generating information-consistent plans. We discuss in detail how the resulting plan can be robustly implemented with minimal communication through local mission executives that run on individual robots. We describe preliminary results on the performance of the planning algorithm and integration of the local mission executives in a high-fidelity simulation environment.

Murray, Richard M.↗

State-of-the-Art: Small Spacecraft Technology

When the first edition of NASA’s Small Spacecraft Technology State-of-the-art report was published in 2013, 247 CubeSats and 105 other non-CubeSat small spacecraft under 50 kilograms (kg) had been launched worldwide, representing less than 2% of launched mass into orbit over multiple years. In 2013 alone, around 60% of the total spacecraft launched had a mass under 600 kg, and of those under 600 kg, 83% were under 200 kg and 37% were nanosatellites (1). Of the total 1,849 spacecraft launched in 2021, 94% were small spacecraft with an overall mass under 600 kg, and of those under 600 kg, 40% were under 200 kg, and 11% were nanosatellites (1). Since 2013, the fight heritage for small spacecraft has increased by over 30% and has become the primary source to space access for commercial, government, private, and academic institutions. The total number of spacecraft launched in the past 10 years is 5,681 and 45% of those had a mass. As with all previous editions of this report, the 2022 edition captures and distills a wealth of new information available on small spacecraft systems from NASA and other publicly available sources. This report is limited to publicly available information and cannot reflect major advances in development that are not publicly disclosed. We encourage any opportunity to publish mission outcomes and technology development milestones (e.g., via conference papers, press releases, company website) so they can be reflected in this report. Overall, this report is a survey of small spacecraft technologies sourced from open literature; it does not endeavor to be an original source, and only considers literature in the public domain to identify and classify devices. Commonly used sources for data include manufacturer datasheets, press releases, conference papers, journal papers, public filings with government agencies, news articles, presentations, the compendium of databases accessed via NASA’s Small Spacecraft Systems Virtual Institute (S3VI) Information Search, and engagement with companies. Data not appropriate for public dissemination, such as proprietary, export controlled, or otherwise restricted data, are not considered. As a result, this report includes many dedicated hours of desk research performed by subject matter experts reviewing resources noted above. Content in this 2022 edition is based on data available by October 2022. This report should not be considered as a comprehensive overview of all the technologies but a great reference for the current state-of-the-art SmallSat technologies. The organizational approach for each chapter is relatively consistent with previous editions and includes an introduction of the technology, current development status of the technology’s procurable systems, and summary tables of technologies surveyed. The content in each chapter is uniquely organized to present a mini-stand-alone report on spacecraft subsystems. As in previous years, chapters include information from previous editions but are updated with new and maturating technologies and reference missions. Tables in each section provide a convenient summary of the technologies discussed, with explanations and references in the body text. The authors have attempted to isolate trends in the small spacecraft industry to point out which technologies have been adopted after successful demonstration missions. Lastly, the authors tried to use the terms “SmallSat,” “microsatellite,” “nanosatellite,” and “CubeSat” in a consistent manner, even as these terms are often used interchangeably in the space industry. Every subsystem chapter contains updated information to reflect the growth in the small spacecraft market. Significant changes are included in several chapters. The “Complete Spacecraft Platforms” chapter now includes information on the two main market options, hosted payload services and dedicated buses. The “Power” chapter provides information on the development of solid-state batteries with significantly higher energy than the current state-of-theart lithium-ion batteries. A large effort was made to update the “Communications” chapter to appropriately capture the recent technology maturation of optical communications for SmallSats. The “Ground Data Systems and Mission Operations” chapter was updated to reflect the recent establishment of the Near Space Network and influx of SmallSat Optical Ground Stations. The “Guidance, Navigation and Control” chapter was updated to include Lidar sensor technology. The “Deorbit Systems” chapter includes a discussion of recently proposed changes by the Federal Communications Commission (FCC) to limit a spacecraft’s lifetime to no longer than 5 years after end-of-mission. The “Identification and Tracking” Chapter includes updated information on the progress of SmallSat tracking. Finally, this report now encompasses technology funded by NASA’s Small Spacecraft Technology (SST) program’s SmallSat Technology Partnerships (STP) initiative which is described further in this Introduction. The reader can find the included SST technology in the “On the Horizon” section of the “Thermal Systems”, “Communications”, and “Guidance, Navigation, and Control” chapters. A central element of this report is to list state-of-the-art technologies by NASA standard Technology Readiness Level (TRL) as defined by the 2020 NASA Engineering Handbook, found in NASA NPR 7123.1C NASA Systems Engineering Processes and Requirements. The authors have endeavored to independently verify the TRL value of each technology by reviewing and citing published test results or publicly available data to the best of their ability. Where test results and data disagree with vendors’ own advertised TRL, the authors have attempted to engage the vendors to discuss the discrepancy. Readers are strongly encouraged to follow the references cited in the literature describing the full performance range and capabilities of each technology. Readers of this report should reach out to individual companies to further clarify information. It is important to note that this report takes a broad system-level view. To attain a high TRL, the subsystem must be in a flight-ready configuration with all supporting infrastructure—such as mounting points, power conversion, and control algorithms—in an integrated unit. An accurate TRL assessment requires a high degree of technical knowledge on a subject device, and an in-depth understanding of the mission (including interfaces and environment) on which the device was flown. There is variability in TRL values depending on design factors for a specific technology. For example, differences in TRL assessment based on the operating environment may result from the thermal environment, mechanical loads, mission duration, or radiation exposure. If a technology has flown on a mission without success, or without providing valid confirmation to the operator, such claimed “flight heritage” was discounted. The authors believe TRLs are most accurately determined when assessed within the context of a program’s unique requirements. While the overall capability of small spacecraft has matured since the 2021 edition of this report, technologies are still being developed to make deep space SmallSat missions more routine and more cost effective. Future editions of this report may include content dedicated to the rapidly growing fields of assembly, integration, and testing services, and mission modeling and simulation–all of which are now extensively represented at small spacecraft conferences. Many of these subsystems and services are still in their infancy, but as they evolve and reliable conventions and standards emerge, the next iteration of this report may also evolve to include additional chapters.

Bruce Yost↗

Global Precipitation Measurement Cold Season Precipitation Experiment (GCPEx): For Measurement Sake Let it Snow

As a component of the Earth's hydrologic cycle, and especially at higher latitudes,falling snow creates snow pack accumulation that in turn provides a large proportion of the fresh water resources required by many communities throughout the world. To assess the relationships between remotely sensed snow measurements with in situ measurements, a winter field project, termed the Global Precipitation Measurement (GPM) mission Cold Season Precipitation Experiment (GCPEx), was carried out in the winter of 2011-2012 in Ontario, Canada. Its goal was to provide information on the precipitation microphysics and processes associated with cold season precipitation to support GPM snowfall retrieval algorithms that make use of a dual-frequency precipitation radar and a passive microwave imager on board the GPM core satellite,and radiometers on constellation member satellites. Multi-parameter methods are required to be able to relate changes in the microphysical character of the snow to measureable parameters from which precipitation detection and estimation can be based. The data collection strategy was coordinated, stacked, high-altitude and in-situ cloud aircraft missions with three research aircraft sampling within a broader surface network of five ground sites taking in-situ and volumetric observations. During the field campaign 25 events were identified and classified according to their varied precipitation type, synoptic context, and precipitation amount. Herein, the GCPEx fieldcampaign is described and three illustrative cases detailed.

GCPEx↗