Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithms”

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 469 records · Page 26

THE DEEP2 GALAXY REDSHIFT SURVEY: THE VORONOI-DELAUNAY METHOD CATALOG OF GALAXY GROUPS

We present a public catalog of galaxy groups constructed from the spectroscopic sample of galaxies in the fourth data release from the Deep Extragalactic Evolutionary Probe 2 (DEEP2) Galaxy Redshift Survey, including the Extended Groth Strip (EGS). The catalog contains 1165 groups with two or more members in the EGS over the redshift range 0 < z < 1.5 and 1295 groups at z > 0.6 in the rest of DEEP2. Twenty-five percent of EGS galaxies and fourteen percent of high-z DEEP2 galaxies are assigned to galaxy groups. The groups were detected using the Voronoi-Delaunay method (VDM) after it has been optimized on mock DEEP2 catalogs following similar methods to those employed in Gerke et al. In the optimization effort, we have taken particular care to ensure that the mock catalogs resemble the data as closely as possible, and we have fine-tuned our methods separately on mocks constructed for the EGS and the rest of DEEP2. We have also probed the effect of the assumed cosmology on our inferred group-finding efficiency by performing our optimization on three different mock catalogs with different background cosmologies, finding large differences in the group-finding success we can achieve for these different mocks. Using the mock catalog whose background cosmology is most consistent with current data, we estimate that the DEEP2 group catalog is 72% complete and 61% pure (74% and 67% for the EGS) and that the group finder correctly classifies 70% of galaxies that truly belong to groups, with an additional 46% of interloper galaxies contaminating the catalog (66% and 43% for the EGS). We also confirm that the VDM catalog reconstructs the abundance of galaxy groups with velocity dispersions above {approx}300 km s{sup -1} to an accuracy better than the sample variance, and this successful reconstruction is not strongly dependent on cosmology. This makes the DEEP2 group catalog a promising probe of the growth of cosmic structure that can potentially be used for cosmological tests.

79 ASTRONOMY AND ASTROPHYSICS↗

Anomaly Detection in Dynamic Networks

Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the communication counts. In a sequential analysis, anomalous behavior is then identified from outlying behavior with respect to the fitted predictive probability models. Seasonality is again incorporated into the model and is treated as a changepoint model on the transition probabilities of a discrete time Markov process. Second stage analytics are then developed which combine anomalous edges to identify anomalous substructures in the network.

97 MATHEMATICS AND COMPUTING↗

Accelerating multilevel Markov Chain Monte Carlo using machine learning models

Here, this work presents an efficient approach for accelerating multilevel Markov Chain Monte Carlo (MCMC) sampling for large-scale problems using low-fidelity machine learning models. While conventional techniques for large-scale Bayesian inference often substitute computationally expensive high-fidelity models with machine learning models, thereby introducing approximation errors, our approach offers a computationally efficient alternative by augmenting high-fidelity models with low-fidelity ones within a hierarchical framework. The multilevel approach utilizes the low-fidelity machine learning model (MLM) for inexpensive evaluation of proposed samples thereby improving the acceptance of samples by the high-fidelity model. The hierarchy in our multilevel algorithm is derived from geometric multigrid hierarchy. We utilize an MLM to accelerate the coarse level sampling. Training machine learning model for the coarsest level significantly reduces the computational cost associated with generating training data and training the model. We present an MCMC algorithm to accelerate the coarsest level sampling using MLM and account for the approximation error introduced. We provide theoretical proofs of detailed balance and demonstrate that our multilevel approach constitutes a consistent MCMC algorithm. Additionally, we derive the expression for cost reduction due to machine learning model to facilitate cost analysis of the hierarchical sampling algorithm. Our technique is demonstrated on a standard benchmark inference problem in groundwater flow, where we estimate the probability density of a quantity of interest using a four-level MCMC algorithm. Our proposed algorithm accelerates multilevel sampling by a factor of two while achieving similar accuracy compared to sampling using the standard multilevel algorithm.

97 MATHEMATICS AND COMPUTING↗

A Three-Dimensional Reconstruction Algorithm for Scanning Transmission Electron Microscopy Data from a Single Sample Orientation

Abstract Increasing interest in three-dimensional nanostructures adds impetus to electron microscopy techniques capable of imaging at or below the nanoscale in three dimensions. We present a reconstruction algorithm that takes as input a focal series of four-dimensional scanning transmission electron microscopy (4D-STEM) data. We apply the approach to a lead iridate, PbIrO, and yttrium-stabilized zirconia, YZrO, heterostructure from data acquired with the specimen in a single plan-view orientation, with the epitaxial layers stacked along the beam direction. We demonstrate that Pb–Ir atomic columns are visible in the uppermost layers of the reconstructed volume. We compare this approach to the alternative techniques of depth sectioning using differential phase contrast scanning transmission electron microscopy (DPC-STEM) and multislice ptychographic reconstruction.

47 OTHER INSTRUMENTATION↗

Validation of deformable image registration algorithms on CT images of ex vivo porcine bladders with fiducial markers

Purpose: The spatial accuracy of deformable image registration (DIR) is important in the implementation of image guided adaptive radiotherapy techniques for cancer in the pelvic region. Validation of algorithms is best performed on phantoms with fiducial markers undergoing controlled large deformations. Excised porcine bladders, exhibiting similar filling and voiding behavior as human bladders, provide such an environment. The aim of this study was to determine the spatial accuracy of different DIR algorithms on CT images ofex vivo porcine bladders with radiopaque fiducial markers applied to the outer surface, for a range of bladder volumes, using various accuracy metrics. Methods: Five excised porcine bladders with a grid of 30–40 radiopaque fiducial markers attached to the outer wall were suspended inside a water-filled phantom. The bladder was filled with a controlled amount of water with added contrast medium for a range of filling volumes (100–400 ml in steps of 50 ml) using a luer lock syringe, and CT scans were acquired at each filling volume. DIR was performed for each data set, with the 100 ml bladder as the reference image. Six intensity-based algorithms (optical flow or demons-based) implemented in theMATLAB platform DIRART, a b-spline algorithm implemented in the commercial software package VelocityAI, and a structure-based algorithm (Symmetric Thin Plate Spline Robust Point Matching) were validated, using adequate parameter settings according to values previously published. The resulting deformation vector field from each registration was applied to the contoured bladder structures and to the marker coordinates for spatial error calculation. The quality of the algorithms was assessed by comparing the different error metrics across the different algorithms, and by comparing the effect of deformation magnitude (bladder volume difference) per algorithm, using the Independent Samples Kruskal-Wallis test. Results: The authors found good structure accuracy without dependency on bladder volume difference for all but one algorithm, and with the best result for the structure-based algorithm. Spatial accuracy as assessed from marker errors was disappointing for all algorithms, especially for large volume differences, implying that the deformations described by the registration did not represent anatomically correct deformations. The structure-based algorithm performed the best in terms of marker error for the large volume difference (100–400 ml). In general, for the small volume difference (100–150 ml) the algorithms performed relatively similarly. The structure-based algorithm exhibited the best balance in performance between small and large volume differences, and among the intensity-based algorithms, the algorithm implemented in VelocityAI exhibited the best balance. Conclusions: Validation of multiple DIR algorithms on a novel physiological bladder phantom revealed that the structure accuracy was good for most algorithms, but that the spatial accuracy as assessed from markers was low for all algorithms, especially for large deformations. Hence, many of the available algorithms exhibit sufficient accuracy for contour propagation purposes, but possibly not for accurate dose accumulation.

60 APPLIED LIFE SCIENCES↗

Comparison of high-resolution airborne soil moisture retrievals to SMAP soil moisture during the SMAP validation experiment 2016 (SMAPVEX16)

The NASA's Soil Moisture Active Passive (SMAP) mission conducted a field experiment with its partners over two 40-km agricultural domains in Iowa and Manitoba in the summer of 2016 to address concerns observed in SMAP soil moisture (SM) retrievals over agricultural areas. The experiment featured airborne Passive Active L-band System (PALS) flights over each domain with intensive ground measurements and dense networks of SM monitoring stations. With two intensive observation periods separated in time (May 28–June 20 and July 14–August 16), the flights captured both early-season/low vegetation and later-season/high-vegetation conditions. The comparison of the PALS brightness temperature (TB) measurements to the SMAP TB observed over the sites resulted in root mean square difference (RMSD) of 2.8 K and 4.0 K for vertical and horizontal polarizations, respectively. The subsequent SM analysis rescaled the PALS TB with the SMAP TB to allow equitable comparisons between the SM retrievals from the two instruments. The PALS SM retrieval algorithm used the SM sampled by the ground teams during the overpass days for tuning, and was parameterized by a high-resolution vegetation water content product calibrated using vegetation samples collected during the experiment. The tuning process was not able to find a satisfactory result with a temporally constant set of parameters in the single channel algorithm for the two intensive observation periods of the experiment. This result indicated that the rapid change in the vegetation structure during the growth stages and likely variation in the surface roughness conditions were not compatible with rigid parameterization over the entire period. However, using seasonally variable parameters we found that it was possible to retrieve soil moisture with satisfactory accuracy. Comparative analysis with the SMAP SM product included aggregation of the PALS SM to the SMAP pixel-scale. The RMSD between the PALS SM and the aggregated manual field samples was <0.04 m3/m3 with Pearson correlation >0.85 for both sites. The comparison between different in situ sources indicated that the soil moisture network measurements were not the source of the large biases observed for SMAP over the sites reported in earlier studies. Therefore, the results suggested the rapidly growing vegetation and the early-season surface condition changes not captured by the SMAP algorithm caused the SMAP retrieval errors. In addition, the significant deviations of the vegetation water content used by the SMAP product from the calibrated vegetation water content obtained during the experiment compounds the problem.

Andreas Colliander↗

Operations for Learning with Graphical Models

This paper is a multidisciplinary review of empirical, statistical learning from a graphical model perspective. Well-known examples of graphical models include Bayesian net- works, directed graphs representing a Markov chain, and undirected networks representing a Markov field. These graphical models are extended to model data analysis and empirical learning using the notation of plates. Graphical operations for simplifying and manipulating a problem are provided including decomposition, differentiation, and the manipulation of probability models from the exponential family. These operations adapt existing techniques from statistics and automatic differentiation to graphs. Two standard algorithm schemes for learning are reviewed in a graphical framework: Gibbs sampling and the expectation maximization algorithm. Some algorithms are developed in this graphical framework including a generalized version of linear regression, techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data. The paper concludes by sketching some implications for data analysis and summarizing some popular algorithms that fall within the framework presented. The main original contributions here are the decomposition techniques and the demonstration that graphical models provide a framework for understanding and developing complex learning algorithms.

Buntine, Wray L.↗

Electronic Thermometer Readings

NASA Stennis' adaptive predictive algorithm for electronic thermometers uses sample readings during the initial rise in temperature and applies an algorithm that accurately and rapidly predicts the steady state temperature. The final steady state temperature of an object can be calculated based on the second-order logarithm of the temperature signals acquired by the sensor and predetermined variables from the sensor characteristics. These variables are calculated during tests of the sensor. Once the variables are determined, relatively little data acquisition and data processing time by the algorithm is required to provide a near-accurate approximation of the final temperature. This reduces the delay in the steady state response time of a temperature sensor. This advanced algorithm can be implemented in existing software or hardware with an erasable programmable read-only memory (EPROM). The capability for easy integration eliminates the expense of developing a whole new system that offers the benefits provided by NASA Stennis' technology.

Source record↗

SDSS-III Baryon Oscillation Spectroscopic Survey data release 12: Galaxy target selection and large-scale structure catalogues

The Baryon Oscillation Spectroscopic Survey (BOSS), part of the Sloan Digital Sky Survey (SDSS) III project, has provided the largest survey of galaxy redshifts available to date, in terms of both the number of galaxy redshifts measured by a single survey, and the effective cosmological volume covered. Key to analysing the clustering of these data to provide cosmological measurements is understanding the detailed properties of this sample. Potential issues include variations in the target catalogue caused by changes either in the targeting algorithm or properties of the data used, the pattern of spectroscopic observations, the spatial distribution of targets for which redshifts were not obtained, and variations in the target sky density due to observational systematics. We document here the target selection algorithms used to create the galaxy samples that comprise BOSS. We also present the algorithms used to create large-scale structure catalogues for the final Data Release (DR12) samples and the associated random catalogues that quantify the survey mask. The algorithms are an evolution of those used by the BOSS team to construct catalogues from earlier data, and have been designed to accurately quantify the galaxy sample. Furthermore, the code used, designated mksample, is released with this paper.

(cosmology:) large-scale structure of Universe↗

Convergence acceleration of Monte Carlo many-body perturbation methods by direct sampling

In the Monte Carlo many-body perturbation (MC-MP) method, the conventional correlation-correction formula, which is a long sum of products of low-dimensional integrals, is first recast into a short sum of high-dimensional integrals over electron-pair and imaginary-time coordinates. These high-dimensional integrals are then evaluated by the Monte Carlo method with random coordinates generated by the Metropolis–Hasting algorithm according to a suitable distribution. The latter algorithm, while advantageous in its ability to sample nearly any distribution, introduces autocorrelation in sampled coordinates, which in turn increases the statistical uncertainty of the integrals and thus the computational cost. It also involves wasteful rejected moves and an initial “burn-in” step as well as displays hysteresis. Here, an algorithm is proposed that directly produces a random sequence of electron-pair coordinates for the same distribution used in the MC-MP method, which is free from autocorrelation, rejected moves, a burn-in step, or hysteresis. Furthermore, this direct-sampling algorithm is shown to accelerate second- (MC-MP2) and third-order Monte Carlo many-body perturbation (MC-MP3) calculations by up to 222% and 38%, respectively.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bayesian calibration of terrestrial ecosystem models: A study of advanced Markov chain Monte Carlo methods

Calibration of terrestrial ecosystem models is important but challenging. Bayesian inference implemented by Markov chain Monte Carlo (MCMC) sampling provides a comprehensive framework to estimate model parameters and associated uncertainties using their posterior distributions. The effectiveness and efficiency of the method strongly depend on the MCMC algorithm used. In this study, a Differential Evolution Adaptive Metropolis (DREAM) algorithm was used to estimate posterior distributions of 21 parameters for the data assimilation linked ecosystem carbon (DALEC) model using 14 years of daily net ecosystem exchange data collected at the Harvard Forest Environmental Measurement Site eddy-flux tower. The DREAM is a multi-chain method and uses differential evolution technique for chain movement, allowing it to be efficiently applied to high-dimensional problems, and can reliably estimate heavy-tailed and multimodal distributions that are difficult for single-chain schemes using a Gaussian proposal distribution. The results were evaluated against the popular Adaptive Metropolis (AM) scheme. DREAM indicated that two parameters controlling autumn phenology have multiple modes in their posterior distributions while AM only identified one mode. The calibration of DREAM resulted in a better model fit and predictive performance compared to the AM. DREAM provides means for a good exploration of the posterior distributions of model parameters. Lastly, it reduces the risk of false convergence to a local optimum and potentially improves the predictive performance of the calibrated model.

54 ENVIRONMENTAL SCIENCES↗

Developing Lightning Prediction Tools for the CCAFS Dual-Polarimetric Radar

NASA Marshall Space Flight Center and the University of Alabama Huntsville are collaborating with the 45th Weather Squadron (45WS) to develop improved lightning prediction capabilities for the new C-band dual-polarimetric weather radar being acquired for use by 45WS and launch weather forecasters at Cape Canaveral Air Force Station (CCAFS). In particular, these algorithms will focus on lightning onset, cessation and combined lightning-radar applications for convective winds assessment. Research using radar reflectivity (Z) data for prediction of lightning onset has been extensively discussed in the literature and subsequently applied by launch weather forecasters as it pertains to lightning nowcasting. Currently the forecasters apply a relatively straight forward but effective temperature-Z threshold algorithm for assessing the likelihood of lightning onset in a given storm. In addition, a layered VIL above the freezing level product is used as automated guidance for the onset of lightning. Only limited research and field work has been conducted on lightning cessation using Z and vertically-integrated Z for determining cessation. Though not used operationally vertically-integrated Z (basis for VIL) has recently shown promise as a tool for use in nowcasting lightning cessation. The work discussed herein leverages and expands upon these and similar reflectivity-threshold approaches via the application/addition of over two decades of polarimetric radar research focused on distinct multi-parameter radar signatures of ice/mixed-phase initiation and ice-crystal orientation in highly electrified convective clouds. Specifically, our approach is based on numerous previous studies that have observed repeatable patterns in the behavior of the vertical hydrometeor column as it relates to the temporal evolution of differential reflectivity and depolarization (manifested in either LDR or p(sub hv)), development of in-situ mixed and ice phase microphysics, electric fields, and ensuing lightning in the sub-tropical/tropical convection typical of the southeastern U.S., Maritime Continent, and southwestern Amazon. The polarimetric signatures detected in this setting provide a basis for automated 3-D detection of hydrometeor types in fuzzy logic hydrometeor identification algorithms (HID). Our working hypothesis is that improvement in lightning onset warning lead time and specificity for a given storm, relative to application of a Z-threshold algorithm, should arise as a consequence of the ability of dual-polarimetric radar to unambiguously detect and identify (through HID algorithms) the updraft elevation of rain-water cores above the freezing level and subsequent onset of drop freezing, riming, and robust mixed phase processes leading to significant charge separation and lightning. This type of algorithm, though dependent on the quality of the polarimetric data should be less susceptible to variable Z-calibration that can impact a given Z-threshold approach. To facilitate development of the algorithm while the 45WS dual-pol radar is in its current test stages and to evaluate the impact of polarimetric data quality (e.g., modified scan parameters and sampling) on the ensuing algorithms, we are using the ARMOR C-band dual-pol radar in Huntsville combined with N. Alabama LMA data and ARMOR HID algorithms [NCAR algorithm modified for application at C-band] in a testbed fashion. For lightning cessation we are revisiting the application of differential propagation phase variables for the monitoring of ice crystal alignment driven by in-cloud electric fields combined with metrics of ice water path (i.e., vertically integrated reflectivity). Importantly it should be noted that this approach is still very much a research topic and as such, we will explore operational applications that involve radar frequencies other than C-Band by using the UAH MAX X-band dual-pol radar in slow staring modes.

Petersen, W. A.↗

A quantitative acoustic emission study on fracture processes in ceramics based on wavelet packet decomposition

We base a quantitative acoustic emission (AE) study on fracture processes in alumina ceramics on wavelet packet decomposition and AE source location. According to the frequency characteristics, as well as energy and ringdown counts of AE, the fracture process is divided into four stages: crack closure, nucleation, development, and critical failure. Each of the AE signals is decomposed by a 2-level wavelet package decomposition into four different (from-low-to-high) frequency bands (AA{sub 2}, AD{sub 2}, DA{sub 2}, and DD{sub 2}). The energy eigenvalues P{sub 0}, P{sub 1}, P{sub 2}, and P{sub 3} corresponding to these four frequency bands are calculated. By analyzing changes in P{sub 0} and P{sub 3} in the four stages, we determine the inverse relationship between AE frequency and the crack source size during ceramic fracture. AE signals with regard to crack nucleation can be expressed when P{sub 0} is less than 5 and P{sub 3} more than 60; whereas AE signals with regard to dangerous crack propagation can be expressed when more than 92% of P{sub 0} is greater than 4, and more than 95% of P{sub 3} is less than 45. Geiger location algorithm is used to locate AE sources and cracks in the sample. The results of this location algorithm are consistent with the positions of fractures in the sample when observed under a scanning electronic microscope; thus the locations of fractures located with Geiger's method can reflect the fracture process. The stage division by location results is in a good agreement with the division based on AE frequency characteristics. We find that both wavelet package decomposition and Geiger's AE source locations are suitable for the identification of the evolutionary process of cracks in alumina ceramics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cholesky-based experimental design for Gaussian process and kernel-based emulation and calibration.

Gaussian processes and other kernel-based methods are used extensively to construct approximations of multivariate data sets. The accuracy of these approximations is dependent on the data used. This paper presents a computationally efficient algorithm to greedily select training samples that minimize the weighted L p error of kernel-based approximations for a given number of data. The method successively generates nested samples, with the goal of minimizing the error in high probability regions of densities specified by users. The algorithm presented is extremely simple and can be implemented using existing pivoted Cholesky factorization methods. Training samples are generated in batches which allows training data to be evaluated (labeled) in parallel. For smooth kernels, the algorithm performs comparably with the greedy integrated variance design but has significantly lower complexity. Numerical experiments demonstrate the efficacy of the approach for bounded, unbounded, multi-modal and non-tensor product densities. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data using Bayesian inference.

97 MATHEMATICS AND COMPUTING↗

Fokker-Planck Equation Governing the Distribution of Walkers in Auxiliary-Field Quantum Monte Carlo

Auxiliary-field quantum Monte Carlo (AFQMC) is typically formulated as an open-ended random walk in an overcomplete space of Slater determinants, implemented through a Langevin equation. However, the explicit form of the underlying Fokker-Planck equation governing the walker population distribution has remained unknown. Here, in this Letter, we derive the Fokker-Planck equation for AFQMC and propose a novel numerical scheme to solve it. The solution of the Fokker-Planck equation reveals the wave function actually sampled by the AFQMC algorithm. Interestingly, we find that even when the exact ground state is used as a guiding wave function in constrained path AFQMC, contrary to the common assumption, the wave function sampled by AFQMC is not exact. Beyond clarifying several fundamental aspects of AFQMC, the availability of a Fokker-Planck equation formulation opens new avenues for systematically improving its accuracy, which we outline in this Letter.

Monte Carlo methods↗

Determination of surface stress by Seasat-SASS - A case study with JASIN data

The values of sea surface stress determined with the dissipation method and those determined with a surface-layer model from observations on F.S. Meteor during the Joint Air-Sea Interaction (JASIN) Experiment are compared with the backscatter coefficients measured by the scatterometer SASS on the satellite Seasat. This study demonstrates that SASS can be used to determine surface stress directly as well as wind speed. The quality of the surface observations used in the calibration of the retrieval algorithms, however, is important. This sample of measurements disagrees with the predictions by the existing wind retrieval algorithm under non-neutral conditions and the discrepancies depend on atmospheric stability.

Liu, W. T.↗

Automation of Laser Plasma Focused Ion Beam Microscopy for Next-Gen Energy Materials

Automation can revolutionize the use of ultrafast laser ablation and plasma-focused ion beam (PFIB) techniques for high-throughput, reproducible cross-sectioning and various sample preparation in materials characterization. As these methods become essential for analyzing complex energy materials and next-generation devices, efficient, standardized workflows are needed to minimize variability and enhance precision. This work highlights our advancements in developing automated processes for sample preparation that integrates machine learning, workflow optimization, and large-scale data acquisition to improve efficiency and scalability in applications such as electrolyzers, photovoltaic cells, and microelectronics. To streamline cross-sectioning and lamella fabrication, we have implemented fully automated workflows that standardize laser ablation and PFIB milling sequences. These workflows incorporate pre-programmed protocols for material removal, alignment, and thinning, reducing user intervention and ensuring consistency across different sample types. Machine learning algorithms further enhance automation by predicting optimal milling strategies and adapting parameters based on material properties and sectioning requirements. This approach significantly improves throughput while maintaining the structural integrity of prepared samples for high-resolution imaging and analysis, including transmission electron microscopy. Beyond sample preparation, our automation platform enables the acquisition of large, high-resolution datasets through serial sectioning, image alignment, and 3D reconstruction. These automated routines facilitate multi-scale characterization, capturing structural and compositional details from the nanoscale to the device level. By reducing variability and increasing efficiency, our automated approach enhances defect analysis, failure diagnostics, and process optimization, accelerating advancements in materials research and device engineering.

36 MATERIALS SCIENCE↗

Design of Neural Networks for Fast Convergence and Accuracy: Dynamics and Control

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗