Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “randomized 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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Multi-agent motion planning with sporadic communications for collision avoidance

Here, a novel multi-vehicle motion planning and collision avoidance algorithm is proposed and analyzed. The algorithm aims to reduce the amount of onboard calculations and inter-agent communications needed for each vehicle to successfully navigate through an environment with static obstacles and reach their goals. To this end, each agent first calculates a path to the goal by means of an asymptotically optimal rapidly-exploring random tree (RRT*) with respect to the static obstacles. Then, other agents are treated as dynamic obstacles and potential collisions are determined by means of collision cones. Collision cones depend on the position and velocity from other agents and are grown conservatively between inter-agent communications. Based on the available information, each agent determines if a deconfliction maneuver is needed, if it can continue along its current path, or if communication is needed to make a decision about a conflict. With probability one, our algorithm guarantees that the agents keep from colliding with each other. Under an assumption on the existence of a solution for a vehicle to its goal, this algorithm also solves the planning problem with probability one. Simulations illustrate a group of agents successfully reaching their goal configurations and examine how the uncertainty affects the communication frequency of the multi-agent system.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Random Forests as a Viable Method to Select and Discover High-redshift Quasars

We present a method of selecting quasars up to redshift ≈6 with random forests, a supervised machine-learning method, applied to Pan-STARRS1 and WISE data. We find that, thanks to the increasing set of known quasars, we can assemble a training set that enables supervised machine-learning algorithms to become a competitive alternative to other methods up to this redshift. We present a candidate set for the redshift range 4.8–6.3, which includes the region around z = 5.5 where selecting quasars is difficult due to their photometric similarity to red and brown dwarfs. We demonstrate that, under our survey restrictions, we can reach a high completeness (66% ± 7% below redshift 5.6/83{sub -9}{sup +6}% above redshift 5.6) while maintaining a high selection efficiency (78{sub -8}{sup +10}%/94{sub -8}{sup +5}%). Our selection efficiency is estimated via a novel method based on the different distributions of quasars and contaminants on the sky. The final catalog of 515 candidates includes 225 known quasars. We predict the candidate catalog to contain additional 148{sub -33}{sup +41} new quasars below redshift 5.6 and 45{sub -8}{sup +5} above, and we make the catalog publicly available. Spectroscopic follow-up observations of 37 candidates led us to discover 20 new high redshift quasars (18 at 4.6 ≤ z ≤ 5.5, 2 z ~ 5.7). These observations are consistent with our predictions on efficiency. We argue that random forests can lead to higher completeness because our candidate set contains a number of objects that would be rejected by common color cuts, including one of the newly discovered redshift 5.7 quasars.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2005

An Algorithm for the Transport of Anisotropic Neutrons

One major obstacle to human space exploration is the possible limitations imposed by the adverse effect of long-term exposure to the space environment. Even before human spaceflight began, the potentially brief exposure of astronauts to the very intense random solar particle events (SPE) were of great concern. A new challenge appears in deep space exploration from exposure to the low-intensity heavy-ion flux of the galactic cosmic rays (GCR) since the missions are of long duration and the accumulated GCR exposures can be high. Because cancer induction rates increase behind low to rather large thicknesses of aluminum shielding, according to available biological data on mammalian exposures to GCR like ions, the shield requirements for a Mars mission are prohibitively expensive in terms of mission launch costs. Therefore, a critical issue in the Human Exploration and Development of Space enterprise is cost effective mitigation of risk associated with ionizing radiation exposure. In order to estimate astronaut risk to GCR exposure and associated cancer risks and health hazards, it is necessary to do shield material studies. To determine an optimum radiation shield material it is necessary to understand nuclear interaction processes such as fragmentation and secondary particle production which is a function of energy dependent cross sections. This requires knowledge of material transmission characteristics either through laboratory testing or improved theoretical modeling. Here ion beam transport theory is of importance in that testing of materials in the laboratory environment generated by particle accelerators is a necessary step in materials development and evaluation for space use. The approximations used in solving the Boltzmann transport equation for the space setting are often not sufficient for laboratory work and those issues are a major emphasis of the present work.

Tweed, J.↗
DOE OSTI2024

Quantification of Native Lignin Structural Features with Gel–Phase 2D–HSQC 0 Reveals Lignin Structural Changes During Extraction

Our ability to study and valorize the lignin fraction of biomass is hampered by the fundamental and still unmet challenge of precisely quantifying native lignin's structural features. Here, we developed a rapid elevated-temperature 1 H– 13 C Heteronuclear Single-Quantum Coherence Zero (HSQC 0 ) NMR method that enables this precise quantification of native lignin structural characteristics even with whole plant cell wall (WPCW) NMR spectroscopy, overcoming fast spin relaxation in the gel phase. We also formulated a Gaussian fitting algorithm to perform automatic and reliable spectral integration. By combining HSQC 0 measurements with yield measurements following depolymerisation, we can confirm the combinatorial nature of radical coupling reactions during biosynthesis leading to a random sequential organization of linkages within a largely linear lignin chain. Such analyses illustrate how this analytical method can greatly facilitate the study of native lignin structure, which can then be used for fundamental studies or to understand lignin depolymerization methods like reductive catalytic fractionation or aldehyde-assisted fractionation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Quantification of Native Lignin Structural Features with Gel–Phase 2D–HSQC 0 Reveals Lignin Structural Changes During Extraction

Our ability to study and valorize the lignin fraction of biomass is hampered by the fundamental and still unmet challenge of precisely quantifying native lignin's structural features. Here, we developed a rapid elevated-temperature 1 H– 13 C Heteronuclear Single-Quantum Coherence Zero (HSQC 0 ) NMR method that enables this precise quantification of native lignin structural characteristics even with whole plant cell wall (WPCW) NMR spectroscopy, overcoming fast spin relaxation in the gel phase. We also formulated a Gaussian fitting algorithm to perform automatic and reliable spectral integration. By combining HSQC 0 measurements with yield measurements following depolymerisation, we can confirm the combinatorial nature of radical coupling reactions during biosynthesis leading to a random sequential organization of linkages within a largely linear lignin chain. Such analyses illustrate how this analytical method can greatly facilitate the study of native lignin structure, which can then be used for fundamental studies or to understand lignin depolymerization methods like reductive catalytic fractionation or aldehyde-assisted fractionation.

09 BIOMASS FUELS↗
DOE OSTI2020

Binary pseudorandom array test standard optimized for characterization of large field-of-view optical interferometers

Recently, a technique for calibrating the modulation transfer function (MTF) of a broad variety of metrology instrumentation has been demonstrated. This technique is based on test samples structured as one-dimensional binary pseudo-random (BPR) sequences and two-dimensional BPR arrays (BPRAs). The inherent power spectral density of BPR gratings (sequences) and arrays has a deterministic white-noise-like character that allows direct determination of the MTF with uniform sensitivity over the entire spatial frequency range and field-of-view of an instrument. As such, the BPR samples satisfy the characteristics of a test standard: functionality, ease of specification and fabrication, reproducibility, and low sensitivity to manufacturing error. Here we discuss our recent developments directed to the optimization of the sample design, fabrication, application, and data processing procedures, suitable for thorough characterization of large aperture optical interferometers. Compared with the previous coded-aperture based design, the improved, 'highly randomized' BPRA pattern of the new test standard provides better accuracy and reliability of instrument MTF and aberration characterization, and enables operation optimization of large aperture optical interferometers. We describe the pattern generation algorithm and tests to verify the compliance to desired BPRA topography. The data acquisition and analysis procedures for different applications of the technique are also discussed.

Yashchuk, Valeriy V.↗
NASA NTRS1974

Control system design using frequency domain models and parameter optimization, with application to supersonic inlet controls

A technique is described for designing feedback control systems using frequency domain models, a quadratic cost function, and a parameter optimization computer program. FORTRAN listings for the computer program are included. The approach is applied to the design of shock position controllers for a supersonic inlet. Deterministic or random system disturbances, and the presence of random measurement noise are considered. The cost function minimization is formulated in the time domain, but the problem solution is obtained using a frequency domain system description. A scaled and constrained conjugate gradient algorithm is used for the minimization. The approach to a supersonic inlet included the calculations of the optimal proportional-plus integral (PI) and proportional-plus-integral-plus-derivative controllers. A single-loop PI controller was the most desirable of the designs considered.

Seidel, R. C.↗
NASA NTRS1987

Analysis of the Continuous Stellar Tracking Attitude Reference (CSTAR) attitude rate processor

The Continuous Stellar Tracking Attitude Reference (CSTAR) system is an in-house project for Space Station to provide high accuracy, drift free attitude and angular rate information for the GN&C system. The outputs of the solid state star trackers are processed to provide attitude information; rate data is then derived from the attitude. Rate derivation is based on discrete time polynomial approximation techniques. This gives simple algorithms which allow for interpolation by other users. Attitude rate is modeled as a constant with low amplitude, low frequency sinusoids superimposed. The rate processor is parameterized to account for the effects of random errors, sample rate, data processing rate and perturbation frequency. The baseline system may be characterized as follows: the three sigma attitude accuracy is 0.01 degrees, the three sigma rate accuracy is 0.0001 degrees per second, the sample rate is 100 Hertz, the sampled signal is bandlimited to 0.5 Hertz, and the data processing rate is 10 Hertz. The above system requires a differentiator of length 127. This will track rate perturbations of frequencies less than 0.01 Hertz with low systematic errors.

Uhde-Lacovara, J.↗
NASA NTRS1989

Genetic algorithms applied to the scheduling of the Hubble Space Telescope

A prototype system employing a genetic algorithm (GA) has been developed to support the scheduling of the Hubble Space Telescope. A non-standard knowledge structure is used and appropriate genetic operators have been created. Several different crossover styles (random point selection, evolving points, and smart point selection) are tested and the best GA is compared with a neural network (NN) based optimizer. The smart crossover operator produces the best results and the GA system is able to evolve complete schedules using it. The GA is not as time-efficient as the NN system and the NN solutions tend to be better.

Sponsler, Jeffrey L.↗
NASA NTRS2002

Protein Kinase Classification with 2866 Hidden Markov Models and One Support Vector Machine

The main application considered in this paper is predicting true kinases from randomly permuted kinases that share the same length and amino acid distributions as the true kinases. Numerous methods already exist for this classification task, such as HMMs, motif-matchers, and sequence comparison algorithms. We build on some of these efforts by creating a vector from the output of thousands of structurally based HMMs, created offline with Pfam-A seed alignments using SAM-T99, which then must be combined into an overall classification for the protein. Then we use a Support Vector Machine for classifying this large ensemble Pfam-Vector, with a polynomial and chisquared kernel. In particular, the chi-squared kernel SVM performs better than the HMMs and better than the BLAST pairwise comparisons, when predicting true from false kinases in some respects, but no one algorithm is best for all purposes or in all instances so we consider the particular strengths and weaknesses of each.

Weber, Ryan↗
NASA NTRS2014

The Seasonal Cycle of Satellite Chlorophyll Fluorescence Observations and its Relationship to Vegetation Phenology and Ecosystem Atmosphere Carbon Exchange

Mapping of terrestrial chlorophyll uorescence from space has shown potentialfor providing global measurements related to gross primary productivity(GPP). In particular, space-based fluorescence may provide information onthe length of the carbon uptake period that can be of use for global carboncycle modeling. Here, we examine the seasonal cycle of photosynthesis asestimated from satellite fluorescence retrievals at wavelengths surroundingthe 740nm emission feature. These retrievals are from the Global OzoneMonitoring Experiment 2 (GOME-2) flying on the MetOp A satellite. Wecompare the fluorescence seasonal cycle with that of GPP as estimated froma diverse set of North American tower gas exchange measurements. Because the GOME-2 has a large ground footprint (40 x 80km2) as compared with that of the flux towers and requires averaging to reduce random errors, we additionally compare with seasonal cycles of upscaled GPP in the satellite averaging area surrounding the tower locations estimated from the Max Planck Institute for Biogeochemistry (MPI-BGC) machine learning algorithm. We also examine the seasonality of absorbed photosynthetically-active radiation(APAR) derived with reflectances from the MODerate-resolution Imaging Spectroradiometer (MODIS). Finally, we examine seasonal cycles of GPP as produced from an ensemble of vegetation models. Several of the data-driven models rely on satellite reflectance-based vegetation parameters to derive estimates of APAR that are used to compute GPP. For forested sites(particularly deciduous broadleaf and mixed forests), the GOME-2 fluorescence captures the spring onset and autumn shutoff of photosynthesis as delineated by the tower-based GPP estimates. In contrast, the reflectance-based indicators and many of the models tend to overestimate the length of the photosynthetically-active period for these and other biomes as has been noted previously in the literature. Satellite fluorescence measurements therefore show potential for improving model GPP estimates.

Joiner, J.↗
DOE OSTI2025

Likelihood-Based Particle Identification in the Short-Baseline Near Detector

Accurate particle identification is crucial in any high-energy physics experiment, allowing scientists to understand the unique interactions and mechanisms at play in a detector. In this project, I develop and study a new particle identification (PID) algorithm for the Short-Baseline Near Detector, a likelihood-based approach, different from out current $\chi^2$ method. A likelihood estimation offers a more physically motivated strategy for PID. The distribution random energy losses of charged particles traveling through a medium are described by the Vavilov probability density function. By using this model, we can account for random energy losses and construct likelihood functions specific to each particle type, potentially enabling a more accurate method for PID.

Vanderwaal, Sophia [U. Alabama, Huntsville] (ORCID↗
DOE OSTI2026

Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method

While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Stopping criteria for ending autonomous, single detector radiological source searches

While the localization of radiological sources has traditionally been handled with statistical algorithms, such a task can be augmented with advanced machine learning methodologies. The combination of deep and reinforcement learning has provided learning-based navigation to autonomous, single-detector, mobile systems. However, these approaches lacked the capacity to terminate a surveying/search task without outside influence of an operator or perfect knowledge of source location (defeating the purpose of such a system). Two stopping criteria are investigated in this work for a machine learning navigated system: one based upon Bayesian and maximum likelihood estimation (MLE) strategies commonly used in source localization, and a second providing the navigational machine learning network with a “stop search” action. A convolutional neural network was trained via reinforcement learning in a 10 m × 10 m simulated environment to navigate a randomly placed detector-agent to a randomly placed source of varied strength (stopping with perfect knowledge during training). The network agent could move in one of four directions (up, down, left, right) after taking a 1 s count measurement at the current location. During testing, the stopping criteria for this navigational algorithm was based upon a Bayesian likelihood estimation technique of source presence, updating this likelihood after each step, and terminating once the confidence of the source being in a single location exceeded 0.9. A second network was trained and tested with similar architecture as the previous but which contained a fifth action: for self-stopping. The accuracy and speed of localization with set detector and source initializations were compared over 50 trials of MLE-Bayesian approach and 1000 trials of the CNN with self-stopping. The statistical stopping condition yielded a median localization error of ~1.41 m and median localization speed of 12 steps. The machine learning stopping condition yielded a median localization error of 0 m and median localization speed of 17 steps. This work demonstrated two stopping criteria available to a machine learning guided, source localization system.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2022

Using dorsal surface for individual identification of dairy calves through 3D deep learning algorithms

Advances in machine learning techniques have allowed the development of computer vision systems (CVS) that can accurately predict several phenotypes of interest for livestock operations. In this context, 3D images taken from a top-down view are particularly useful for estimating body condition score, growth development, and body biometrics in cattle. Frequently, such CVS rely on identification (ID) systems, such as electronic tags, as a way to match animal ID and the predicted phenotype. However, the same 3D images used to predict body weight and other animal biometrics could be adopted for animal recognition as well. Such alternative would optimize CVS to recognize animal ID and monitor growth development simultaneously while leveraging the same hardware infrastructure. Furthermore, this strategy could be used to recognize animals with similar color patterns. Nonetheless, growing animals are continuously changing body shape, which could limit its use as an invariant feature for pattern recognition. Thus, the objectives of this study were: (1) to compare algorithms for different 3D object representations to identify individual animals; and (2) to evaluate how short-term changes in body shape due to animal growth affect the predictive performance of these algorithms. For objective 1, the algorithms were trained (n = 4,558) and tested (n = 1,139) using images from 38 Holstein calves. For objective 2, we designed three different experiments using images (n = 2,347) from five Holstein calves taken over six weeks during their growing period, always training and testing on different weeks. Each experiment evaluated how changing a different parameter of the image capturing procedure affected the predictive ability of the trained algorithms. In the first experiment, we varied the total number of images per animal in the training set; in the second experiment, we varied the number of weeks while keeping a fixed number of images in the training set; and in the third experiment, we skipped weeks between images in the training and test sets. The F 1 score for objective (1) was up to 0.804 when testing with the last frames of each video, and up to 0.959 when using random frames for testing. For objective (2), the F 1 score was up to 0.947 for the first experiment when using 130 images per animal; up to 0.979 for the second experiment when using all five weeks; and up to 0.917 when not skipping weeks between training and testing. In conclusion, these results show that deep learning algorithms can be used to identify individual animals through their dorsal area 3D surfaces, and, from our experiments using calves in their growing period, that they are robust enough to account for changes in body shape and size, making them a promising tool for animal recognition during growth.

3D neural networks↗
DOE OSTI2021

A novel framework for hosting capacity analysis with spatio-temporal probabilistic voltage sensitivity analysis

Smart grids are envisioned to accommodate high penetration of distributed photovoltaic (PV) generation, which may cause adverse grid impacts in terms of voltage violations. Therefore, PV Hosting capacity is being used as a planning tool to determine the maximum PV installation capacity that causes the first voltage violation and above which would require infrastructure upgrades. Additionally, traditional methods of Hosting capacity analysis are scenario based and computationally complex as they rely on iterative load flow algorithms that require investigating a large number of scenarios for accurate assessment of PV impacts. Therefore, this paper presents a computationally efficient analytical approach to compute the probability distribution of voltage change due to random behavior of randomly located multiple distributed PVs. The proposed approach is based on Spatio-temporal probabilistic voltage sensitivity analysis that exploits both spatial and temporal uncertainties associated with PV injections. Thereafter, the derived distribution is used to quantify voltage violations for various PV penetration levels and subsequently determine the hosting capacity of the system without the need to examine large number of scenarios. Results of the proposed framework are validated via conventional load flow based simulation approach on the IEEE 37 and IEEE 123 node test systems.

42 ENGINEERING↗
DOE OSTI2023

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗