Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal sizing method”

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 145 records · Page 8

Dynamical Sketching for Enhanced Communication Efficiency in Federated Learning

Federated learning (FL) has revolutionized distributed machine learning by enabling collaborative model training without sharing local data. However, communication efficiency and privacy guarantees remain significant challenges. This paper introduces a dynamic sketching mechanism in FL, optimizing the trade-off between communication efficiency and model accuracy. By dynamically selecting the sketch matrix size, our approach adapts to the evolving characteristics of the data and the model, ensuring optimal performance across diverse scenarios. We leverage Bayesian optimization to systematically tune the sketch parameters, achieving an effective balance between resource efficiency and model performance. Experimental results on the MNIST dataset using a convolutional neural network (CNN) architecture validate the proposed method's efficiency and scalability. Our dynamic sketching approach significantly outperforms fixed-size sketching techniques, achieving higher compression ratios (up to 62x) and providing better privacy guarantees while maintaining high model accuracy. These findings highlight the robustness and versatility of our approach and make it a valuable solution for privacy-preserving, communication-efficient federated learning.

Afrose, Sharmin [ORNL]↗

Memory access optimization for particle operations in computational fluid dynamics-discrete element method simulations

Computational Fluid Dynamics - Discrete Element Method is used to model gas-solid systems in several applications in energy, pharmaceutical and petrochemical industries. Computational performance bottlenecks often limit the problem sizes that can be simulated at industrial scale. The data structures used to store several millions of particles in such large-scale simulations have a large memory footprint that does not fit into the processor cache hierarchies on current high-performance-computing platforms, leading to reduced computational performance. This paper specifically addresses this aspect of memory access bottlenecks in industrial scale simulations. The use of space-filling curves to improve memory access patterns is described and their impact on computational performance is quantified in both shared and distributed memory parallelization paradigms. The Morton space filling curve applied to uniform grids and k-dimensional tree partitions are used to reorder the particle data-structure thus improving spatial and temporal locality in memory. The performance impact of these techniques when applied to two benchmark problems, namely the homogeneous-cooling-system and a fluidized-bed, are presented. We report these optimization techniques lead to approximately two-fold performance improvement in particle focused operations such as neighbor-list creation and data-exchange, with ~ 1.5 times overall improvement in a fluidization simulation with 1.27 million particles.

97 MATHEMATICS AND COMPUTING↗

Enhancing the efficiency of time-dependent density functional theory calculations of dynamic response properties

X-ray Thomson scattering (XRTS) constitutes an essential technique for diagnosing material properties under extreme conditions, such as high pressures and intense laser heating. Time-dependent density functional theory (TDDFT) is one of the most accurate available ab initio methods for modeling XRTS spectra, as well as a host of other dynamic material properties. However, strong thermal excitations, along with the need to account for variations in temperature and density as well as the finite size of the detector significantly increase the computational cost of TDDFT simulations compared to ambient conditions. In this work, we present a broadly applicable method for optimizing and enhancing the efficiency of TDDFT calculations. Our approach is based on a one-to-one mapping between the dynamic structure factor and the imaginary time density–density correlation function, which naturally emerges in Feynman’s path integral formulation of quantum many-body theory. Specifically, we combine rigorous convergence tests in the imaginary time domain with a constraints-based attenuation of narrow-band fluctuations to improve the efficiency of TDDFT modeling without the introduction of any significant bias. As a result, we can report a speed-up by up to an order of magnitude, thus substantially reducing the burden of computational cost required for XRTS analysis.

Moldabekov, Zhandos A. [Helmholtz-Zentrum Dresden-↗

Detection, monitoring, and determination of location of changes in metallic structures using multimode acoustic signals

Acoustic transducers generate and receive acoustic signals at multiple locations along a surface of rigid structure, wherein longitudinal spacing between transducer locations define measurement zones. Acoustic signals with chosen amplitude-time-frequency characteristics excite multiple vibration modes in the structure within each zone. Small mechanical changes in inspection zones lead to scattering and attenuation of broadband acoustic signals, which are detectable as changes in received signal characteristics as part of a through-transmission technique. Additional use of short, narrowband pulse acoustic signals as part of a pulse-echo technique allows determination of the relative location of the mechanical change within each zone based on the differential delay profiles. For accurate acoustic modeling and simulation, the mesh size, time step, time delay, and time-window size are optimized. Frequency normalization of the Short-Time Fourier Transform of acoustic response output improves experiment-simulation cross-validation. Applications of the method to structures with arbitrarily complex geometries are also demonstrated.

Findikoglu, Alp Tugrul↗

Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets

We study multistage distributionally robust mixed-integer programs under endogenous uncertainty, where the probability distribution of stage-wise uncertainty depends on the decisions made in previous stages. We first consider two ambiguity sets defined by decision-dependent bounds on the first and second moments of uncertain parameters and by mean and covariance matrix that exactly match decision-dependent empirical ones, respectively. For both sets, we show that the subproblem in each stage can be recast as a mixed-integer linear program (MILP). Moreover, we extend the general moment-based ambiguity set in to the multistage decision-dependent setting, and derive mixed-integer semidefinite programming (MISDP) reformulations of stage-wise subproblems. We develop methods for attaining lower and upper bounds of the optimal objective value of the multistage MISDPs, and approximate them using a series of MILPs. We deploy the Stochastic Dual Dynamic integer Programming (SDDiP) method for solving the problem under the three ambiguity sets with risk-neutral or risk-averse objective functions, and conduct numerical studies on multistage facility-location instances having diverse sizes under different parameter and uncertainty settings. Furthermore, our results show that the SDDiP quickly finds optimal solutions for moderate-sized instances under the first two ambiguity sets, and also finds good approximate bounds for the multistage MISDPs derived under the third ambiguity set. We also demonstrate the efficacy of incorporating decision-dependent distributional ambiguity in multistage decision-making processes.

97 MATHEMATICS AND COMPUTING↗

Meshfree simulation and prediction of recrystallized grain size in friction stir processed 316L stainless steel

Friction stir processing (FSP) is a promising solid-phase microstructural modification technique that can repair and enhance damaged stainless steel surfaces exposed to harsh environments. The quality of the repaired material is closely correlated to the recrystallized grain size in the stir zone (SZ), which is influenced by the thermomechanical conditions dictated by FSP process parameters. Thus, establishing a reliable relationship between these parameters and recrystallized grain size in the SZ is crucial for optimizing repair quality. However, existing experimental approaches often rely on indirect temperatures measured far from the SZ, along with rough strain rate estimations, which are imprecise and time-consuming. Meanwhile, existing mesh-based modeling methods usually face numerical challenges when dealing with the large material deformations inherent in FSP. Here, to address these issues, this study introduces a meshfree process model for FSP based on the smoothed particle hydrodynamics (SPH) method, aimed at predicting process conditions under different parameters. The model is validated using experimental data from 11 combinations of tool traverse and rotation speeds on 316 L stainless steel. Correlations between process parameters, material flow, temperature, strain, strain rate, and recrystallized grain size are revealed through SPH simulations and electron backscatter diffraction (EBSD) imaging. The results show that in situ SZ temperatures range from 1071 to 1322°C, which exceed the tool temperature by over 300°C. Furthermore, SZ temperature, strain rate, and grain size increase monotonically with higher tool temperature and faster traverse speed. A relationship is then established between the model-predicted Zener-Hollomon parameter and the recrystallized grain size based on EBSD data, expressed as ln(d) = -0.364 ln(Z) + 14.673. Finally, this relationship exhibits satisfactory accuracy with errors of less than 26.9% in predicting grain sizes at various SZ locations, which offers valuable insights for optimizing FSP repair processes for 316 L stainless steel.

316L stainless steel↗

Levenberg–Marquardt multi-classification using hinge loss function

Incorporating higher-order optimization functions, such as Levenberg-Marquardt (LM) have revealed better generalizable solutions for deep learning problems. However, these higher-order optimization functions suffer from very large processing time and training complexity especially as training datasets become large, such as in multi-view classification problems, where finding global optima is a very costly problem. To solve this issue, we develop a solution for LM-enabled classification with, to the best of knowledge first-time implementation of hinge loss, for multiview classification. Hinge loss allows the neural network to converge faster and perform better than other loss functions such as logistic or square loss rates. Here we prove our method by experimenting with various multiclass classification challenges of varying complexity and training data size. The empirical results show the training time and accuracy rates achieved, highlighting how our method outperforms in all cases, especially when training time is limited. Our paper presents important results in the relationship between optimization and loss functions and how these can impact deep learning problems.

97 MATHEMATICS AND COMPUTING↗

Ptychographic phase retrieval by proximal algorithms

We derive a set of ptychography phase-retrieval iterative engines based on proximal algorithms originally developed in convex optimization theory, and discuss their connections with existing ones. The use of proximal operator creates a simple frame work that allows us to incorporate the effect of noise from a maximum-likelihood (ML) principle. We focus on three particular algorithms, namely proximal minimization, alternating direction method of multiplier and accelerated proximal gradient (APG). We benchmark their performance with numerical simulations, and discuss their optimal conditions for convergence and accuracy. An experimental dataset is used to demonstrate their effectiveness as well, in which case an array of cubic Au nanoparticles with a size of 50 nm is imaged. We show that with the presence of Poisson noise, a dataset with photon counts up to 10 4 at one detector pixel already requires ML-based methods to achieve a stable convergence. Among the three algorithms derived in this work, APG method is reported first time for its application in ptychographic reconstruction and shows superior performance in terms of both accuracy and convergence rate with a noisy dataset.

36 MATERIALS SCIENCE↗

Optimal Strategies for Hybrid Battery‐Storage Systems Design

As stationary hybrid energy‐storage systems (HESS) for power systems applications have recently drawn interest due to their enhanced performance and decreasing cost, developing systematic approaches for HESS design while considering controls is gaining traction. Herein, a method is presented to optimally design hybrid battery storage by proposing a mathematical modeling framework, formulated as a mixed integer linear programming model. The optimization is capable of handling multiple subsystems of batteries, considering their economic and technological performance. Decisions involve sizing of the batteries, optimal temporal and strategic dispatch to end uses, and energy sources for charging each battery. The applicability of the model is tested on four case studies for three battery chemistries representing distinct objectives: high‐power, high‐energy, and second life. Compared to traditionally designed battery storage with a homogeneous battery, optimally designed hybrid systems can save 12%–26% of system costs, depending on the nature of the dispatch profile. Findings point to design preference toward the second life battery supplemented with some high‐power or high‐energy battery capacity, or both. With the utilized electricity price structure, customers can experience approximately 10%–35% reduction in their bills.

Koleva, Mariya↗

Joint Management and Optimization of Residential Natural Gas and Electricity Distribution Networks Coupled via Fuel Cells

The interesting properties of natural gas as well as the growing electric power demand worldwide have led to increasing attention to natural-gas-based distributed generation applications in electric distribution systems. This paper goes over the interdependency between a residential natural gas network and an electric distribution network that are coupled via fuel cells. The modeling of the gas network is introduced first, and then the algorithm for gas flow study is presented. The optimal placement and sizing of fuel cell based distributed generation systems are formulated to minimize the losses in both the gas and electric distribution networks, subject to their model constraints. In addition to this, in order to capture the probabilistic nature of the optimization problem under study, the K-means clustering algorithm is applied to the gas and electricity demands to determine hourly load states and their corresponding probabilities. Furthermore, simulation studies are carried out on an integrated system consisting of the IEEE 69-bus distribution feeder and a radial 27-node natural gas network to verify the developed optimization model and the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Scalable Implementation of Mean-Field and Correlation Methods Based on Lie-Algebraic Similarity Transformation of Spin Hamiltonians in the Jordan–Wigner Representation

Recent work has highlighted that the strong correlation inherent in spin Hamiltonians can be effectively reduced by mapping spins to Fermions via the Jordan−Wigner transformation (JW). The Hartree−Fock method is straightforward in the Fermionic domain and may provide a reasonable approximation to the ground state. Correlation with respect to the Fermionic mean field can be recovered based on Lie-algebraic similarity transformation (LAST) with two-body correlators. Specifically, a unitary LAST variant eliminates the dependence on site ordering, while a nonunitary LAST yields size-extensive correlation energies. Whereas the first recent demonstration of such methods was restricted to small spin systems, we present efficient implementations using analytical gradients for the optimization with respect to the mean-field reference and the LAST parameters, thereby enabling the treatment of larger clusters, including systems with local spins s > $\frac{1}{2}$.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

VirION2: a short- and long-read sequencing and informatics workflow to study the genomic diversity of viruses in nature

Microbes play fundamental roles in shaping natural ecosystem properties and functions, but do so under constraints imposed by their viral predators. However, studying viruses in nature can be challenging due to low biomass and the lack of universal gene markers. Though metagenomic short-read sequencing has greatly improved our virus ecology toolkit—and revealed many critical ecosystem roles for viruses—microdiverse populations and fine-scale genomic traits are missed. Some of these microdiverse populations are abundant and the missed regions may be of interest for identifying selection pressures that underpin evolutionary constraints associated with hosts and environments. Though long-read sequencing promises complete virus genomes on single reads, it currently suffers from high DNA requirements and sequencing errors that limit accurate gene prediction. Here we introduce VirION2, an integrated short- and long-read metagenomic wet-lab and informatics pipeline that updates our previous method (VirION) to further enhance the utility of long-read viral metagenomics. Using a viral mock community, we first optimized laboratory protocols (polymerase choice, DNA shearing size, PCR cycling) to enable 76% longer reads (now median length of 6,965 bp) from 100-fold less input DNA (now 1 nanogram). Using a virome from a natural seawater sample, we compared viromes generated with VirION2 against other library preparation options (unamplified, original VirION, and short-read), and optimized downstream informatics for improved long-read error correction and assembly. VirION2 assemblies combined with short-read based data (‘enhanced’ viromes), provided significant improvements over VirION libraries in the recovery of longer and more complete viral genomes, and our optimized error-correction strategy using long- and short-read data achieved 99.97% accuracy. In the seawater virome, VirION2 assemblies captured 5,161 viral populations (including all of the virus populations observed in the other assemblies), 30% of which were uniquely assembled through inclusion of long-reads, and 22% of the top 10% most abundant virus populations derived from assembly of long-reads. Viral populations unique to VirION2 assemblies had significantly higher microdiversity means, which may explain why short-read virome approaches failed to capture them. These findings suggest the VirION2 sample prep and workflow can help researchers better investigate the virosphere, even from challenging low-biomass samples. Our new protocols are available to the research community on protocols.io as a ‘living document’ to facilitate dissemination of updates to keep pace with the rapid evolution of long-read sequencing technology.

Long-reads↗

PowerMappeR: Power-Optimized Mapping of SNNs onto ReRAM Crossbars coupled via Packet-Switched NoCs

Many recent efforts in developing hardware-accelerated spiking neural networks (SNNs) are characterized by deep co-design between algorithms, architectures, and devices. Architectural advances overcome device constraints by coupling together many small resistive-RAM (ReRAM) crossbars via a network-on-chip (NoC) for neuromorphic component operation. Concurrently, improved SNN training methods increase accuracy and structural sparsity in networks despite growing problem sizes. Finally, compilers leverage these attributes to minimize area and inter-crossbar communication while mapping large SNNs to sophisticated architectures. However, for compiler-driven co-design to realize increasingly complex and profitable optimizations, a compile-time view of power consumption is critical. We present PowerMappeR to express and optimize over mapping-, architecture-, and device-specific power consumption information. By modeling the dynamic power of well-established components, we develop an integer linear programming (ILP)-based, encoding-agnostic, parametric power estimation model. Using this model, we demonstrate practical improvements in area and inter-crossbar communication by 0%–9.5% and 1.4%–5.1%, respectively. We also limit hotspot formation during optimization, achieving comparable or better results in targeted metrics with up to 96.4%–97.1% restriction of hotspot magnitude. Finally, we introduce profile-guided formulations to reduce worst-case and expected-case hotspot magnitude by 40.7%–69.5% and 40.6%–56.3%, respectively. Optimizing worst-case hotspot magnitude incidentally improves expected-case magnitude by 10.85%–33.45%. Reciprocally, optimizing expected-case magnitude incidentally improves worst-case magnitude by 4.33%–39.87%. Validation against hardware simulators confirms that PowerMappeR can decrease dynamic power consumption by 12.6%–27.3%.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗

A Strong Gravitational Lens Is Worth a Thousand Dark Matter Halos: Inference on Small-scale Structure Using Sequential Methods

Strong gravitational lenses are a singular probe of the Universe’s small-scale structure—they are sensitive to the gravitational effects of low-mass (<10 10 M ⊙ ) halos even without a luminous counterpart. Recent strong-lensing analyses of dark matter structure rely on simulation-based inference (SBI). Modern SBI methods, which leverage neural networks as density estimators, have shown promise in extracting the halo-population signal. However, it is unclear whether the constraints from these models are limited by the methodology or the data. In this study, we introduce an accelerator-optimized simulation pipeline that can generate lens images with realistic subhalo populations in milliseconds. Leveraging this simulator, we identify the main limitation of our fiducial SBI analysis: training set size. We then adopt a sequential neural posterior estimation (SNPE) approach, allowing us to refine the training distribution to align with the observed data. Using only one-fifth as many mock Hubble Space Telescope images, SNPE matches the constraints on the low-mass halo population produced by our best nonsequential model. Our experiments suggest that an over 3 order-of-magnitude increase in training set size and GPU hours would be required to achieve an equivalent result without sequential methods. While the full potential of the existing lens sample remains to be explored, the notable improvement in constraining power enabled by our sequential approach highlights that current constraints are limited primarily by methodology and not the data itself. Moreover, our results emphasize the need to treat training set generation and model optimization as interconnected stages of any cosmological analysis using SBI.

79 ASTRONOMY AND ASTROPHYSICS↗

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗

Micrometer-sized Magnetite Synthesis using Fe(OH)2(s) as a Precursor for Technetium Sequestration from Liquid Nuclear Waste Streams

Systematic batch experiments under variable adjusted physicochemical conditions were conducted to explore optimization of micrometer-sized magnetite synthesis for Tc sequestration from radionuclide waste streams using Fe(OH)2(s) as the precursor. Extensive solid characterization using x-ray diffraction and spectroscopic methods was performed to assess changes in particle morphology and size distribution, as well as Tc speciation and incorporation, in the produced mineral phases. The results show that the solution pH, temperature, and oxidation kinetics play key roles in the final mineral products. Micrometer-sized magnetite crystals (0.62-0.96 µm on average) with well-defined dodecahedral or octahedral structures were synthesized under near neutral (~pH 8) or alkaline (~pH13) conditions at 75 °C, respectively; whereas goethite dominated the end products at room temperature. An increase in pH at 75 °C improved Tc removal from 27% (near neutral pH) to 42% (alkaline pH), but the removal process remained inhibited by redox competitive Cr(VI) present in the waste streams. By adding additional Fe(II) to the system, Tc sequestration was dramatically improved to up to 87% without observable changes in the solid product. The sequestrated Tc existed as TcO2·2H2O and/or Tc(IV) incorporated into magnetite, where extended X-ray absorption fine structure (EXAFS) spectroscopy showed that more Tc was incorporated into magnetite at elevated temperatures and pH conditions, with complete Tc(IV) incorporation into magnetite occurring under 75 °C-pH 13 conditions. Our results indicate that optimal micrometer-sized magnetite can be produced for Tc sequestration by reacting Fe(OH)2(s) with a waste stream simulant under elevated pH (~13) and temperature (75 °C) conditions. The incorporation of reduced Tc(IV) into stable micrometer-sized magnetite provides a viable supplemental immobilizing technology that may be used to improve nuclear waste treatment and disposal needs.

Wang, Guohui↗

SymProp: Scaling Sparse Symmetric Tucker Decomposition via Symmetry Propagation

Sparse symmetric tensors are an important class of tensors, and their decompositions serve as powerful tools for revealing low-rank structures. This paper introduces SymProp, a novel approach for scaling sparse symmetric Tucker decomposition by propagating symmetry through intermediate computations. SymProp optimizes two key computational kernels: Sparse Symmetric Tensor Times Same Matrix chain (S3 TTMc) for Higher-Order Orthogonal Iteration (HOOI) and Sparse Symmetric Tensor Times Same Matrix chain Times Core (S3 TTMcTC) for Higher-Order QR Iteration (HOQRI). Our method employs a metaprogramming-based index iteration approach to efficiently handle the upper triangular parts of intermediate dense symmetric tensors. SymProp achieves up to 50.9× speedup over SPLATT and up to 360.8× over Compressed Sparse Symmetric (CSS) format on the S3 TTMc operation. Moreover, our S3 TTMc and S3 TTMcTC implementations support tensor orders four levels higher than state-of-the-art methods. Our HOQRI demonstrates superior scalability and up to a 33.6× speedup over optimized HOOI. By enabling more scalable Tucker decompositions for higher orders, decomposition ranks, and dimension sizes, SymProp opens new possibilities for analyzing complex hypergraph structures in fields such as network science, data mining, and machine learning.

Li, Zecheng [North Carolina State University]↗

Multiscale and multiphysics FEA simulation and materials optimization for laser ultrasound transducers

In this study, the relationship between the nanocomposite design and the laser ultrasound transducer (LUT) characteristics was investigated through simulations in multiple scale levels for material behavior, device response, and acoustic wave propagation in media. First, the effects of the nanoparticle size and concentration on the effective properties of composites were quantitatively investigated with the finite element analysis (FEA) method. Second, the effective properties of the nanocomposite were assigned to the layer, which is modeled as a homogeneous material, in the FEA for the LUT simulating the energy conversion from the incident laser to the acoustic wave. Finally, the ultrasound propagation in the water was calculated by a theoretical wave propagation model. The FEA-based prediction was compared with the experimental data in the literature and a theoretical analysis for LUT based on Thermal-Acoustic coupling. As a result, the ultrasound waves on the transducer surface and at a distance in the water could be predicted. Based on the hierarchically integrated prediction procedure, the optimal conditions of the photoacoustic nanocomposites were investigated through the parametric study with the particle size and concentration as variables. The results guide the material designs optimized for different device characteristics, such as high pressure and broad bandwidth.

36 MATERIALS SCIENCE↗