Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,117 records · Page 62

Genomic insights into local adaptation and migration success in reintroduced Coho Salmon of the Wenatchee River basin

ABSTRACT Objective Reintroduction of salmonids into regions where they have been extirpated is a common conservation strategy that is often implemented through natural recolonization, translocation of natural populations, or hatchery-based programs. Locally adapting to specific environmental conditions is critical for long-term population viability, particularly for species like Coho Salmon Oncorhynchus kisutch, which face diverse selective pressures during their migration. This study focused on the mid-Columbia River Coho Salmon reintroduction program managed by Yakama Nation Fisheries, which has successfully reintroduced Coho Salmon into the Wenatchee and Methow River basins, Washington. Notably, these populations have adapted to the longer migration route than those in the founding stock, with selection favoring individuals with an earlier arrival time and that can navigate a 15-km, high-gradient canyon to reach optimal spawning grounds. The objectives of this study were to investigate whether specific genomic regions are under selection for traits associated with return location and timing in Coho Salmon. Methods Low-coverage whole-genome resequencing data were used to screen for genomic regions associated with the phenotypes of interest. Results A weak polygenic signal in female Coho Salmon was found to be associated with return group, with a subset of candidate adaptive regions occurring across eight chromosomes. Conclusions These findings provide insights into the genomic mechanisms underlying local adaptation in reintroduced salmon populations and inform broodstock selection strategies aimed at promoting natural production and long-term population sustainability.

Horn, Rebekah L.↗

Upcycling Mixed Spent Ni-Lean Cathodes into Ni-Rich Polycrystalline Cathodes

Sustainable battery recycling is vital for conserving resources and reducing environmental impacts. Current open- and closed-loop recycling strategies often focus on recovering individual components, making the reuse of mixed cathode materials a complex challenge. Meanwhile, the research on upcycling has been limited to using pristine cathode feedstocks and virgin materials for synthesis. Here, to address this issue, we present an upcycling approach for spent Ni-lean mixed cathode materials that integrate an upcycling hydrometallurgical recycling process with traditional hydrometallurgical methods. This strategy achieves a utilization of 92.31 mol % of recycled materials, enabling the regeneration of Ni-rich cathode materials while significantly reducing the reliance on virgin resources. The regenerated 83Ni cathode materials demonstrate physical properties comparable to those produced from virgin materials. Electrochemical evaluations using single-layer pouch cells show that both recycled and virgin cathodes exhibit initial specific capacity close to 201.1 mAh/g and maintain approximately 88 % capacity retention after 500 cycles. Additionally, 2Ah cells confirmed these findings, delivering 85 % capacity retention after about 900 cycles. Techno-economic analysis demonstrates notable environmental benefits, including reductions in greenhouse gas emissions and energy consumption, achieving 232.75 MJ/kg of product, which is 8.6 % lower than traditional methods and comparable to direct upcycling. Furthermore, the upcycling hydrometallurgical recycling process generates the highest profit, proving its economic viability. This scalable and versatile process is adaptable to varying transition metal compositions, facilitating a closed-loop recycling system that bridges mixed spent cathodes with next-generation cathode materials, and offers a sustainable solution for managing waste battery materials.

Hydrometallurgical recycling↗

Human Performance Improvement Task Group Task 21-1 Best Practice: Using virtual capabilities or options for HPI application (to reduce errors, strengthening defenses, strengthening the organization, and/or increasing capacity)

In 2020 the world was impacted by COVID-19. How work is done was dramatically changed for a large portion of the workforce. Many have made the abrupt shift to working from their home while others have adapted to COVID protocols (such as social distancing and wearing facemasks). Fundamentally, Human and Organizational Performance Improvement concepts and science did not change – only the delivery method changed (in some cases). The primary effect has been to accelerate dynamics already present in society – from e-commerce to online education to remote healthcare. Change is never easy for humans. However, remote work should be viewed as an opportunity; not a fix to a problem. In this Best Practice paper, you’ll get practical suggestions to help you reduce errors and improve Human Performance in remote, socially-distanced “work-from-home” environments.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

CV4Quantum: Reducing the Sampling Overhead in Probabilistic Error Cancellation Using Control Variates

Quasiprobabilistic decompositions (QPDs) play a key role in maximizing the utility of near-term quantum hardware. For example, Probabilistic Error Cancellation (PEC) (an error mitigation technique) and circuit cutting (which enables large quantum computations to be performed on quantum hardware with a limited number of qubits) both involve QPDs. Computations based on QPDs typically incur large sampling overheads that grow exponentially with the number of error-terms mitigated or number of circuit-cuts employed, limiting their practical feasibility. In this work, we adapt the control variates variance reduction technique from the statistics literature in order to reduce the sampling overhead in QPD-based computations. We demonstrate our method using simulation experiments that mimic a realistic PEC scenario. In our experiments, we observed a more than 50% reduction in the number of samples needed to achieve a given precision, in more than 50% of the PEC-based estimations performed in the study when using our approach. We discuss how future research on constructing good control variates can lead to even stronger sampling overhead reduction.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

YOLO for Radio Frequency Signal Classification

Radio frequency signal classification plays a pivotal role in various applications, including spectrum management, wireless security, and cognitive radio. Extant signal classification methods require significant data throughput and are not multilabel. We propose a novel approach to radio frequency signal classification by leveraging the You Only Look Once (YOLO) object detection method. YOLO is a state-of-the-art deep learning model renowned for its real-time object detection capabilities in computer vision applications. We adapt YOLO for signal classification to enable the automatic and efficient identification of various signal types within a power spectral density image. Index Terms—radio-frequency analysis, object detection, neural networks, machine learning, deep learning.

42 ENGINEERING↗

Accelerating Parallel Applications in Cloud Platforms via Adaptive Time-Slice Control

Cloud platforms can provide flexible and cost-effective environments for parallel applications. However, the resource over-commitment issues, i.e., cloud providers often provide much more executable virtual CPUs than available physical CPUs, still impede the synchronization operations of parallel applications, causing severe performance degradation. Existing methods optimize parallel applications by promoting the priorities of involved VMs. They cannot fully explore the performance of parallel applications, because they ignore the time-slice requirements of different phases of parallel applications. Furthermore, non-parallel applications experience unsatisfied performance because of low scheduling priorities. Given empirical analysis on time-slices of virtual machines (VMs), we find that shortening time-slices can mitigate synchronization overhead which incurs during communication phases, while over-short time-slices cause frequent cache misses in computation phases. Accordingly, we propose an Adaptive Time-slice Control (ATC) mechanism. ATC first detects the phases of parallel applications based on lock latency or cache misses. Then, ATC shortens time-slices during communication phases and prolongs time-slices during computation phases for parallel applications, and sets a uniform time-slice for non-parallel applications. Finally, we evaluate ATC using seven well-known benchmarks with 25+ applications. Experiments show that ATC obtains 1.5-75x performance gain for running parallel applications than state-of-the-art solutions, with nearly unaffected impact on non-parallel applications.

97 MATHEMATICS AND COMPUTING↗

Adaptive Model-Free Vehicle Path-Tracking via Fast-Converging Prescribed-Time Newton-Based Extremum-Seeking Control

Model-free control (MFC) offers a simple and effective approach to automated vehicle path-tracking without requiring an explicit plant model for control law design. However, gain tuning in MFC is typically carried out through trial-and-error, which can be time-consuming and may lead to suboptimal performance. To address this limitation, extremum-seeking-based adaptive MFC has shown promise by enabling real-time adaptation of control gains, without relying on a predefined vehicle model. Nonetheless, existing ESC approaches often suffer from slow convergence. This paper integrates MFC, employing longitudinal and lateral ultra-local models of a rear-wheel-drive vehicle, with a novel prescribed-time (PT) Newton-based extremum-seeking control (ESC) strategy that ensures rapid convergence of control gains within the prescribed time. Unlike conventional gradient-based ESC methods, the PT Newton-based ESC leverages artificial delays and time-periodic gains, not only to guarantee convergence within the specified time, but also to compensate for feedback delays. Simulation results demonstrate that the proposed approach significantly improves gain adaptation speed and tracking accuracy. This work advances adaptive model-free vehicle control by offering a high-performance, delay-resilient alternative to existing ESCMFC frameworks.

Waleed khan, Muhammad [The University of Texas at ↗

Hierarchical Distribution System Adaptive Restoration with Diverse Distributed Energy Resources

Distributed energy resources (DERs) can be utilized as alternative power sources for fast service recovery in cases of distribution system outages. However, the diverse characteristics and stochastic nature of DERs impose challenges on the optimal operation of di-verse resources during the restoration phase. Here, we introduce a hierarchical structure to coordinate distribution system entities and propose an adaptive restoration strategy to sustain a reliable power supply to outage loads in an unbalanced distribution system utilizing DERs. An efficient system reconfiguration model is developed to guarantee the radiality of restoration islands. The flexibility of DERs is evaluated by a novel method that focuses on the cumulative energy consumption, the superiority of which is also proven. Model predictive control (MPC) is adopted to enable the adjustment of system topology and DER operation strategies based on up-to-date data. The performance of the proposed restoration model is validated on a modified IEEE 123-bus test system. Moreover, the effectiveness of the proposed novel flexibility assessment and the MPC-based adaptive restoration strategy are verified through comparative studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SymbolNet: neural symbolic regression with adaptive dynamic pruning for compression

Abstract Compact symbolic expressions have been shown to be more efficient than neural network (NN) models in terms of resource consumption and inference speed when implemented on custom hardware such as field-programmable gate arrays (FPGAs), while maintaining comparable accuracy (Tsoi et al 2024 EPJ Web Conf. 295 09036). These capabilities are highly valuable in environments with stringent computational resource constraints, such as high-energy physics experiments at the CERN Large Hadron Collider. However, finding compact expressions for high-dimensional datasets remains challenging due to the inherent limitations of genetic programming (GP), the search algorithm of most symbolic regression (SR) methods. Contrary to GP, the NN approach to SR offers scalability to high-dimensional inputs and leverages gradient methods for faster equation searching. Common ways of constraining expression complexity often involve multistage pruning with fine-tuning, which can result in significant performance loss. In this work, we propose S y m b o l N e t , a NN approach to SR specifically designed as a model compression technique, aimed at enabling low-latency inference for high-dimensional inputs on custom hardware such as FPGAs. This framework allows dynamic pruning of model weights, input features, and mathematical operators in a single training process, where both training loss and expression complexity are optimized simultaneously. We introduce a sparsity regularization term for each pruning type, which can adaptively adjust its strength, leading to convergence at a target sparsity ratio. Unlike most existing SR methods that struggle with datasets containing more than O ( 10 ) inputs, we demonstrate the effectiveness of our model on the LHC jet tagging task (16 inputs), MNIST (784 inputs), and SVHN (3072 inputs).

Tsoi, Ho Fung (ORCID:0000000225502184)↗

Metals and Quantum Materials with Spin-orbit Interactions by Quantum Monte Carlo methods

The key goals of this project were as follows: 1) Analysis and benchmarks of electron correlation effects recovered in the fixed-node approximation that is inherent to quantum Monte Carlo (QMC) method as applied to metallic states; 2) development of new algorithms for electron spin-degrees of freedom to be treated as explicit quantum variables; 3) designing electronic structure QMC algorithm for efficient evaluation of spin-orbit effects in systems with heavy atoms; 4) adapting the algorithm to complex wave functions and developing corresponding fixed-phase approximation; 5) design and testing of algorithm for valence-only non-local spin-orbit operators; 6) analysis of fixed-node vs fixed-phase errors and their comparisons. The key accomplishments: i) We carried out a systematic study of Li systems by the fixed-node diffusion Monte Carlo method. This involved Li atom, molecule, cluster and solid calculated by the full range of QMC methods including fixed-node QMC.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Neural architecture search via similarity adaptive guidance

Evolutionary neural network architecture search (ENAS) has attracted the attention of many experts due to its global optimization capabilities to automatically search for convolutional neural network architectures based on the target task. The current search space for ENAS is not to design a fully structured network, but to search for smaller cell architectures to reduce search costs. However, blind search strategies do not effectively utilize the potential experience of the population. In order to utilize the potential experience learned by the current population to guide the evolutionary search of the population, we propose a similarity guided neural network architecture search algorithm based on cell architecture, which utilizes the similarity between pairwise architectures in the population as empirical knowledge learned by the population. Our proposed algorithm provides a novel method for calculating architecture similarity, which calculates architecture similarity separately from the cell and macro-structure. Then we decouple the connections and operations in the cell and calculate connection and operation similarity separately. In addition, we propose adaptive similarity selection and binary tournament selection strategies to enhance the algorithm’s global and local search capabilities and effectively explore the search space. Finally, we design an improved single-point crossover operator to enhance the local search ability of the evolutionary operator. The experimental results show that SAGNAS is a competitive algorithm that achieves 97.44% and 81.60% in CIFAR10 and CIFAR100 with only 1.9 GPU-days spent.

97 MATHEMATICS AND COMPUTING↗

Effects of Photonic Curing Processing Conditions on MAPbI 3 Film Properties and Solar Cell Performance

Thermal annealing is the most used postdeposition materials processing method in laboratory research, but due to its slow speed and high energy cost, it is not compatible with the upscaling and commercialization of perovskite solar cell (PSC) manufacturing. Here, we adapt photonic curing (PC), which uses millisecond light pulses to deliver energy to the sample, to replace thermal annealing for crystallization of methylammonium lead iodide (MAPbI 3 ) films and rapid fabrication of PSCs. We study how PC conditions affect the outcome of MAPbI 3 conversion from the precursor to the crystalline perovskite phase by evaluating the films’ optical, crystalline, and morphological properties, as well as PSC performance. The results are understood using simulated film temperature profiles. We show that MAPbI 3 is readily converted under a wide range of PC conditions. While previous reports all used short pulses (<3 ms), we find that longer pulses produce more dense films and higher-performing PSCs. We achieve a champion power conversion efficiency in a PC-processed MAPbI 3 PSC of 11.26% under forward scan and 10.34% under reverse scan, with the processing time for the MAPbI 3 layer reduced by 30,000-fold, from 10 min to 20 ms. Using a 6 in. lamp, spatial uniformity tests show a cross-web efficiency variation of 5%. Our results indicate that using longer pulse lengths, >10 ms, is the best PC strategy for perovskite conversion, and PC is a promising annealing method for large-area, high-throughput PSC manufacturing.

14 SOLAR ENERGY↗

Stability boundary and optimal operating parameter identification in milling using Bayesian learning

Here, this paper describes a novel Bayesian learning approach for stability boundary and optimal parameter identification in milling without the knowledge of the underlying tool dynamics or material cutting force coefficients. The paper is divided into two parts. First, a Bayesian learning method for stability lobe identification using test results is described. Each axial depth and spindle speed combination is characterized by a probability of stability which is updated using Bayes’ rule when a test result (stable or unstable) is made available. A novel likelihood function is defined which incorporates knowledge of the stability behavior. Numerical results show convergence to the analytical stability lobe diagram. Second, an adaptive experimental strategy to identify optimal operating parameters that maximize material removal rate is described. Numerical evaluation shows convergence to the optimal operating point with error less than 15 % within ten tests on average. The approach is validated using experimental results. Results show that the proposed method is an efficient and robust learning method to identify the stability lobe diagram and optimal operating parameters with a limited number of tests/data points.

Bayesian machine learning↗

Scalable, two–stage, autoinduction of recombinant protein expression in E. coli utilizing phosphate depletion

We report the scalable production of recombinant proteins in Escherichia coli, reliant on tightly controlled autoinduction, triggered by phosphate depletion in the stationary phase. The method, reliant on engineered strains and plasmids, enables improved protein expression across scales. Expression levels using this approach have reached as high as 55% of the total cellular protein. The initial use of the method in instrumented fed–batch fermentations enables cell densities of ~30 gCDW/L and protein titers up to 8.1 ± 0.7 g/L (~270 mg/gCDW). The process has also been adapted to an optimized autoinduction media, enabling routine batch production at culture volumes of 20 μl (384–well plates), 100 μl (96–well plates), 20 ml, and 100 ml. In batch cultures, cell densities routinely reach ~5–7 gCDW/L, offering protein titers above 2 g/L. Here, the methodology has been validated with a set of diverse heterologous proteins and is of general use for the facile optimization of routine protein expression from high throughput screens to fed–batch fermentation.

59 BASIC BIOLOGICAL SCIENCES↗

Plastic work constrained elastoplastic topology optimization

An elastoplastic topology optimization framework for limiting plastic work generation while maximizing stiffness is presented. The kinematics and constitutive model are based on finite strain linear isotropic hardening plasticity, and the balance laws are solved using a total Lagrangian finite element formulation. Aggregation of the specific plastic work combined with an adaptive normalization scheme efficiently constrains the maximum specific plastic work. The optimization problem is regularized using an augmented partial differential equation filter, and is solved by the method of moving asymptotes where path-dependent sensitivities are derived using the adjoint method. The numerical examples show a clear dependence on the optimized maximum stiffness structures for different levels of constrained specific plastic work. It is also shown that due to the history dependency of the plasticity, the load path significantly influences the structural performance and optimized topology.

42 ENGINEERING↗

Noise-aware optimization in nominally identical manufacturing and measuring systems for high-throughput parallel workflows

Device-to-device variability in experimental noise critically impacts reproducibility, especially in automated, high-throughput systems like additive manufacturing farms. While manageable in small labs, such variability can escalate into serious risks at larger scales, such as architectural 3D printing, where noise may cause structural or economic failures. This contribution presents a noise-aware decision-making algorithm that quantifies and models device-specific noise profiles to manage variability adaptively. It uses distributional analysis and pairwise divergence metrics with clustering to choose between single-device and robust multi-device Bayesian optimization strategies. Unlike conventional methods that assume homogeneous devices or enforce generic robustness, the proposed framework explicitly determines whether shared optimization across devices is appropriate based on the degree of inter-device noise heterogeneity. This enables improved performance, reproducibility, and efficiency. An experimental case study involving three nominally identical 3D printers (same brand, model, and close serial numbers) demonstrates reduced redundancy, lower resource usage, and improved reliability, along with improved convergence stability and solution quality through the selection of the appropriate optimization strategy based on the degree of inter-device noise heterogeneity. Overall, this framework establishes a general approach for precision- and resource-aware optimization in scalable, automated experimental platforms, demonstrated here on a representative multi-device 3D printing case study.

Schenk, Christina↗

A conservative phase-space moving-grid strategy for a 1D-2V Vlasov–Fokker–Planck Solver

In this work, we develop a conservative configuration- and velocity-space (i.e., phase-space) moving-grid strategy for the Vlasov–Fokker–Planck (VFP) equation in a planar geometry. The velocity-space grid is normalized and shifted in terms of the thermal speed and the bulk-fluid velocity, respectively. The configuration-space grid is moved according to a mesh-motion-partial-differential equation (MMPDE), which equidistributes a monitor function that is inversely proportional to the gradient-length scales of the macroscopic plasma quantities. The resulting inertial terms in the transformed VFP equations are discretized to ensure the discrete conservation of mass, momentum, and energy. To satisfy the discrete conservation theorems in the presence of phase-space mesh motion, we employ the method of discrete nonlinear constraints – explored in previous studies – but the underlying symmetries are determined in a much more efficient manner than before. The conservative grid-adaptivity strategy provides an efficient scheme that resolves important physical structures in the phase-space while controlling the computational complexity at all times. We demonstrate the favorable features of the proposed algorithm through a set of test cases of increasing complexity. The problems test independent components of the algorithms, as well as the integrated capability on settings relevant to inertial confinement fusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fantômas unconfined: global QCD fits with Bézier parameterizations

Fantômas is a C++ toolkit for exploring the parametrization dependence of parton distribution functions (PDFs) and other correlator functions in quantum chromodynamics (QCD). Fantômas facilitates the generation of adaptable polynomial parametrizations for PDFs, called metamorphs, to find best-fit PDF solutions and quantify the epistemic uncertainty associated with the parametrizations during their fitting. The method employs Bézier curves as universal approximators for a variety of PDF shapes. Integrated into the xFitter framework for the global QCD analysis, Fantômas provides a foundation for general models of PDFs, while reducing the computational time compared to the approaches utilizing traditional polynomial parametrizations as well as providing an interpretable alternative to neural-network-based models. This paper outlines the structure and practical usage of the Fantômas toolkit, including its inputs, outputs, and implementation within xFitter. It also provides a practical example of using Fantômas for uncertainty quantification as well as the combination of PDF fits into a single ensemble.

Bézier curves↗