Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Selection optimization”

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 649 records · Page 36

Optimization Through Multi-Fidelity Modeling

We present a novel method for optimizing parameter selection for simulations with an evaluation budget. We start with an existing method for building a multi-fidelity model out of many low-fidelity simulations and few high-fidelity simulations. We propose a novel method to simplify parameter selection without sacrificing performance. We verify these results and compare with existing literature. Next, we propose a novel algorithm which uses this difference model to suggest new points in the parameter design space to simulate. We add each point we simulate to the model to improve its quality for the next iteration. The algorithm trades off reducing the uncertainty of the existing model with optimization of the objective. The first is more useful when a large fraction of the computation budget remains. The second is more useful when a small fraction of the computation budget remains. Our method converges to the optimum by using a high-fidelity evaluation for just 16 of the 427 points. Our method is general enough to work if there is no low-fidelity model. Furthermore, it is agnostic to the underlying physics of the problem. Therefore, both the low-fidelity and high-fidelity models can be generated by any arbitrary function, including simulations and physical experiments.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms

Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.

97 MATHEMATICS AND COMPUTING↗

Flow Reactor Study and Kinetic Model Development of HEFA-SPK and its Surrogate

In this work, we formulate a two-component surrogate for HEFA-SPK, incorporating aromatic or cycloalkane components, and develop reduced kinetic models for the surrogates to be used in high-performance computing simulations. The HEFA-SPK surrogate was selected and optimized based on the fuel's physical and combustion properties, including ignition delay times and flame speeds. The resulting surrogate consists of 40% n-undecane and 60% 2-methylnonane. The surrogate was confirmed by flow reactor experiments for both the HEFA-SPK fuel and the suggested two-component surrogates, where excellent agreement was observed. To meet aromatic requirements, 1,2,4-trimethylbenzene (8%) was selected, and we determined that incorporating 30% propylcyclohexane into the HEFA-SPK will achieve a volume swell equivalent to 8% aromatics. The properties of the surrogates were measured, and a new reduced kinetic model was developed based on the semi-decoupling methodology, using a reduced CH4 chemistry from NUIG 1.0 as base chemistry. Kinetic models will be employed in combustor simulations to enable a comprehensive understanding of the effect of SAF fuel properties on aviation combustor performance.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Photometric redshift estimation of galaxies in the DESI Legacy Imaging Surveys

ABSTRACT The accurate estimation of photometric redshifts plays a crucial role in accomplishing science objectives of the large survey projects. Template-fitting and machine learning are the two main types of methods applied currently. Based on the training set obtained by cross-correlating the DESI Legacy Imaging Surveys DR9 galaxy catalogue and the SDSS DR16 galaxy catalogue, the two kinds of methods are used and optimized, such as eazy for template-fitting approach and catboost for machine learning. Then, the created models are tested by the cross-matched samples of the DESI Legacy Imaging Surveys DR9 galaxy catalogue with LAMOST DR7, GAMA DR3, and WiggleZ galaxy catalogues. Moreover, three machine learning methods (catboost, Multi-Layer Perceptron, and Random Forest) are compared; catboost shows its superiority for our case. By feature selection and optimization of model parameters, catboost can obtain higher accuracy with optical and infrared photometric information, the best performance ($\rm MSE=0.0032$, σNMAD = 0.0156, and $O=0.88{{\ \rm per\ cent}}$) with g ≤ 24.0, r ≤ 23.4, and z ≤ 22.5 is achieved. But eazy can provide more accurate photometric redshift estimation for high redshift galaxies, especially beyond the redshift range of training sample. Finally, we finish the redshift estimation of all DESI Legacy Imaging Surveys DR9 galaxies with catboost and eazy, which will contribute to the further study of galaxies and their properties.

Astronomy & Astrophysics↗

Dark Energy Survey Year 3 results: Cosmological constraints from galaxy clustering and galaxy-galaxy lensing using the MagLim lens sample

The cosmological information extracted from photometric surveys is most robust when multiple probes of the large scale structure of the Universe are used. Two of the most sensitive probes are the clustering of galaxies and the tangential shear of background galaxy shapes produced by those foreground galaxies, so-called galaxy-galaxy lensing. Combining the measurements of these two two-point functions leads to cosmological constraints that are independent of the way galaxies trace matter (the galaxy bias factor). The optimal choice of foreground, or lens, galaxies is governed by the joint, but conflicting requirements to obtain accurate redshift information and large statistics. We present cosmological results from the full 5000 deg 2 of the Dark Energy Survey’s first three years of observations (Y3) combining those two-point functions, using for the first time a magnitude-limited lens sample (MagLim) of 11 million galaxies, especially selected to optimize such combination, and 100 million background shapes. We consider two flat cosmological models, the Standard Model with dark energy and cold dark matter ( Λ CDM ) a variation with a free parameter for the dark energy equation of state ( w CDM ). Both models are marginalized over 25 astrophysical and systematic nuisance parameters. In Λ CDM we obtain for the matter density Ω m = 0.320 - 0.034 + 0.041 and for the clustering amplitude S 8 ≡ σ 8 ( Ω m / 0.3 ) 0.5 = 0.778 - 0.031 + 0.037 , at 68% C.L. The latter is only 1 σ smaller than the prediction in this model informed by measurements of the cosmic microwave background by the Planck satellite. In w CDM we find Ω m = 0.32 - 0.046 + 0.044 , S 8 = 0.777 - 0.051 + 0.049 and dark energy equation of state w = - 1.031 - 0.379 + 0.218 . We find that including smaller scales, while marginalizing over nonlinear galaxy bias, improves the constraining power in the Ω m - S 8 plane by 31% and in the Ω m - w plane by 41% while yielding consistent cosmological parameters from those in the linear bias case. These results are combined with those from cosmic shear in a companion paper to present full DES-Y3 constraints from the three two-point functions ( 3 × 2 pt ).

79 ASTRONOMY AND ASTROPHYSICS↗

MIRACAL: A mission radiation calculation program for analysis of lunar and interplanetary missions

A computational procedure and data base are developed for manned space exploration missions for which estimates are made for the energetic particle fluences encountered and the resulting dose equivalent incurred. The data base includes the following options: statistical or continuum model for ordinary solar proton events, selection of up to six large proton flare spectra, and galactic cosmic ray fluxes for elemental nuclei of charge numbers 1 through 92. The program requires an input trajectory definition information and specifications of optional parameters, which include desired spectral data and nominal shield thickness. The procedure may be implemented as an independent program or as a subroutine in trajectory codes. This code should be most useful in mission optimization and selection studies for which radiation exposure is of special importance.

Nealy, John E.↗

RED RUNAWAYS II: LOW-MASS HILLS STARS IN SDSS STRIPE 82

Stars ejected from the Galactic Center can be used to place important constraints on the Milky Way potential. Since existing hypervelocity stars are too distant to accurately determine orbits, we have conducted a search for nearby candidates using full three-dimensional velocities. Since the efficacy of such studies is often hampered by deficiencies in proper motion catalogs, we have chosen to utilize the reliable, high-precision Sloan Digital Sky Survey (SDSS) Stripe 82 proper motion catalog. Although we do not find any candidates which have velocities in excess of the escape speed, we identify 226 stars on orbits that are consistent with Galactic Center ejection. This number is significantly larger than what we would expect for halo stars on radial orbits and cannot be explained by disk or bulge contamination. If we restrict ourselves to metal-rich stars, we find 29 candidates with [Fe/H] > −0.8 dex and 10 with [Fe/H] > −0.6 dex. Their metallicities are more consistent with what we expect for bulge ejecta, and so we believe these candidates are especially deserving of further study. We have supplemented this sample using our own radial velocities, developing an algorithm to use proper motions for optimizing candidate selection. This technique provides considerable improvement on the blind spectroscopic sample of SDSS, being able to identify candidates with an efficiency around 20 times better than a blind search.

79 ASTRONOMY AND ASTROPHYSICS↗

Discovery of amivantamab (JNJ-61186372), a bispecific antibody targeting EGFR and MET

A bispecific antibody (BsAb) targeting the epidermal growth factor receptor (EGFR) and mesenchymal–epithelial transition factor (MET) pathways represents a novel approach to overcome resistance to targeted therapies in patients with non–small cell lung cancer. In this study, we sequentially screened a panel of BsAbs in a combinatorial approach to select the optimal bispecific molecule. The BsAbs were derived from different EGFR and MET parental monoclonal antibodies. Initially, molecules were screened for EGFR and MET binding on tumor cell lines and lack of agonistic activity toward MET. Hits were identified and further screened based on their potential to induce untoward cell proliferation and cross-phosphorylation of EGFR by MET via receptor colocalization in the absence of ligand. After the final step, we selected the EGFR and MET arms for the lead BsAb and added low fucose Fc engineering to generate amivantamab (JNJ-61186372). The crystal structure of the anti-MET Fab of amivantamab bound to MET was solved, and the interaction between the two molecules in atomic details was elucidated. Amivantamab antagonized the hepatocyte growth factor (HGF)-induced signaling by binding to MET Sema domain and thereby blocking HGF β-chain—Sema engagement. The amivantamab EGFR epitope was mapped to EGFR domain III and residues K443, K465, I467, and S468. Furthermore, amivantamab showed superior antitumor activity over small molecule EGFR and MET inhibitors in the HCC827-HGF in vivo model. Based on its unique mode of action, amivantamab may provide benefit to patients with malignancies associated with aberrant EGFR and MET signaling.

59 BASIC BIOLOGICAL SCIENCES↗

Optimal contracting structure between cellulosic biorefineries and farmers to reduce the impact of biomass supply variation: game theoretic analysis

There is considerable year–to–year variability in the supply of cellulosic biomass used in the production of cellulosic biofuels, yet strategies to mitigate these variations in biofuel development are not well understood. Biorefineries and farmers venturing into the cellulosic biofuel industry will require biomass supply and contracting strategies that can minimize the impact of these large variations. Some studies have proposed biomass pre–treatment and storage to address biomass supply variations. Other studies have used transportation modeling approaches to manage supply variations and select the optimal location of a cellulosic biorefinery. However, storage, pre–treatment, and similar engineering approaches lead to higher costs and have other limitations such as additional infrastructural requirements. There is a gap in understanding how contracting strategies between biorefineries and the biomass suppliers (farmers) can reduce the risks with biomass supply variations. In this study, the contracting structure between biorefineries and biomass suppliers is studied under different market structures for the US Corn Belt. A theoretical framework is then developed to use contracting strategies for mitigating the impact of biomass supply variations. First, the trade–offs between intricately linked components of biomass cost, such as biomass transport, biomass price (incentive) to suppliers, variation in biomass supply, biorefinery size, and alternative feedstock availability are examined. Next, an optimal contracting structure is developed between biorefineries and biomass suppliers using game theoretic analysis. Here, the results show that both the impact of biomass supply variations and the overall biomass cost can be significantly reduced through the use of the optimal contracting strategy between biorefineries and suppliers.

cellulosic biofuel↗

Rapid design of bacteriophage cocktails to suppress the burden and virulence of gut-resident carbapenem-resistant Klebsiella pneumoniae

Antibiotic use can lead to the expansion of multi-drug-resistant pathobionts within the gut microbiome that can cause life-threatening infections. Selective alternatives to conventional antibiotics are in dire need. Here, in this work, we describe a Klebsiella PhageBank for the tailored design of bacteriophage cocktails to treat multi-drug-resistant Klebsiella pneumoniae. Using a transposon library in carbapenem-resistant K. pneumoniae, we identify host factors required for phage infection in major Klebsiella phage families. Leveraging the diversity of the PhageBank, we formulate phage combinations that eliminate K. pneumoniae with minimal phage resistance. Optimized cocktails selectively suppress the burden of K. pneumoniae in the mouse gut and drive the loss of key virulence factors that act as phage receptors. Phage-mediated diversification of bacterial populations in the gut leads to co-evolution of phage variants with higher virulence and broader host range. Altogether, the Klebsiella PhageBank charts a roadmap for phage therapy against a critical multidrug-resistant human pathogen.

60 APPLIED LIFE SCIENCES↗

Determination of Infinite Dilution Activity Coefficients of Molecular Solutes in Ionic Liquids and Deep Eutectic Solvents by Factorization-Machine-Based Neural Networks

Widely known as “green solvents,” ionic liquids (ILs) and deep eutectic solvents (DESs) have been used as substitutes for traditional organic solvents in separation science. To achieve better separations using ILs and DESs, this work aimed to predict the infinite dilution activity coefficients (IDACs) of molecular solutes in these solvents with the state-of-the-art factorization-machine-based neural network (DeepFM). DeepFM combines the benefits of factorization machines and deep neural networks to learn both low-order and high-order interactions among features. The IDAC prediction model was established with 52,372 experimental IDAC datapoints including 260 solvents (252 ILs and 8 DESs) and 112 molecular solutes collected at various temperatures from 288.15 to 428.15 K. Chemical information describing the ILs, DESs, and molecular solutes was included in the IDAC prediction model, including chemical functional groups, molecular weights, and Abraham solvation parameters. The IDAC prediction model showed an improved accuracy compared with alternative models; additionally, DESs were included in the IDAC prediction model for the first time. Here, the model will reduce the energy and resources needed to optimize the selection of ILs and DESs for specific separations, which will promote the development of these green solvents for sustainable chemical processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Origin of the unusually strong and selective binding of vanadium by polyamidoximes in seawater

Amidoxime-functionalized polymeric adsorbents are the current state-of-the-art materials for collecting uranium (U) from seawater. However, marine tests show that vanadium (V) is preferentially extracted over U and many other cations. Here in this paper, we report a complementary and comprehensive investigation integrating ab initio simulations with thermochemical titrations and XAFS spectroscopy to understand the unusually strong and selective binding of V by polyamidoximes. While the open-chain amidoxime functionalities do not bind V, the cyclic imide-dioxime group of the adsorbent forms a peculiar non-oxido V 5+ complex, exhibiting the highest stability constant value ever observed for the V 5+ species. XAFS analysis of adsorbents following deployment in environmental seawater confirms V binding solely by the imide-dioximes. Our fundamental findings offer not only guidance for future optimization of selectivity in amidoxime-based sorbent materials, but may also afford insight to understanding the extensive accumulation of V in some marine organisms.

36 MATERIALS SCIENCE↗

On Concavity and Utilization Analytics of Wide-Area Network Transport Protocols

Wide-area data transfers in high-performance computing infrastructures and big data applications are increasingly carried over dynamically provisioned dedicated network connections, which provide high capacities with no competing traffic. Throughput of TCP and UDT over wide-area connections depends, often in a complex non-linear way, on the congestion control mechanism, buffer sizes, and the number of parallel streams. In addition, our extensive TCP and UDT throughput measurements and time traces over a suite of physical and emulated 10 Gbps connections with 0-366 ms round-trip times (RTTs) show significant statistical and temporal variations. Consequently, parameter selection and optimization for transport methods require data analytics to complement analytical throughput models. We present analytics based on the concavity-convexity of throughput profiles which provide insights into peak throughput and superior/inferior trend compared to linear interpolations based on RTT. In particular, we propose the utilization-concavity coefficient, a scalar metric that incorporates both utilization and concavity profile to characterize the overall performance of a transport protocol. These measurements-based anaytics enable us to select a transport protocol and its parameters for a given host and connection configuration to achieve high throughput with statistical guarantees.

Rao, Nageswara↗

BULKI-Store v0.3.2

BULKI-Store is a distributed object storage system optimized for high-performance computing environments. Built with a Rust core and Python bindings, it efficiently manages scientific and machine learning datasets across HPC clusters. The system employs a client-server architecture with MPI integration, enabling seamless scaling on supercomputers like Perlmutter. BULKI-Store's object-oriented approach provides intuitive data organization with rich metadata support, contrasting with traditional file-based solutions. Key optimizations include selective checkpoint loading, unified checkpoint files, and object chunking for large data transfers. For machine learning workloads, BULKI-Store offers advantages through fine-grained access patterns, dynamic data sharing between training instances, and reduced memory pressure. Memory management features include strategic Python GC calls, minimized data copies, and batch processing capabilities. The system leverages Rayon's thread pool for asynchronous data prefetching and supports multiple CPU architectures (ARM64, x86, AMD, RISC-V). By combining performance optimizations with developer-friendly APIs, BULKI-Store addresses the complex data management challenges of modern HPC applications while maintaining compatibility across heterogeneous computing environments.

Zhang, Wei [Lawrence Berkeley National Laboratory ↗

A self-reorganizing digital flight control system for aircraft

This paper presents a design method for digital self-reorganizing control systems which is optimally tolerant of failures in aircraft sensors. The functions of this system are accomplished with software instead of the popular and costly technique of hardware duplication. The theoretical development, based on M-ary hypothesis testing, results in a bank of M Kalman filters operating in parallel in the failure detection logic. A moving window of the innovations of each Kalman filter drives the detection logic to decide the failure state of the system. The detection logic also selects the optimal state estimate (for control logic) from the bank of Kalman filters. The design process is applied to the design of a self-reorganizing control system for a current configuration of the space shuttle orbiter at Mach 5 and 120,000 feet. The failure detection capabilities of the system are demonstrated using a real-time simulation of the system with noisy sensors.

Montgomery, R. C.↗

Searches for Light- and Heavy-flavor Three-jet Resonances in proton-proton Collisions with the CMS Detector at $\sqrt{s}$ = 8 TeV

A search for three-jet hadronic resonance production in proton-proton collisions at 8 TeV center-of-mass energy has been conducted by the CMS Collaboration at the LHC. The data set corresponds to an integrated luminosity of 19.4 fb -1 . The search method is modelindependent. Events are selected that contain a large number of jets with high transverse momentum. An ensemble of jets is used to extract a new possible signal from copious QCD background. Event selection is optimized using a benchmark model where supersymmetric gluinos are pair-produced and each of the gluinos decays exclusively into three jets. Two scenarios of this decay are considered denoted by the RPV couplings λ'' 112 and λ'' 113 or λ'' 223 . The first coupling allows for gluinos to decay into only light-flavor jets, while the latter two allow decays into one heavy-flavor and two light-flavor jets. No significant deviation is found between the selected events and the expected standard model multijet and t$\bar{t}$ background. For gluinos decaying through 00 112, masses below 650 GeV are excluded at the 95% confidence level. The search including heavy-flavor jets in the final state with the couplings λ'' 113 or λ'' 223 is the first of its kind. Gluinos decaying into one heavy-flavor and two light-flavor jets are excluded for masses between 200 and 835 GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Design and Evaluation of a Dynamic Programming Flight Routing Algorithm Using the Convective Weather Avoidance Model

The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes national airspace system throughput and efficiency in the presence of uncertainties. The algorithm is based on dynamic programming and utilizes the predicted probability that an aircraft will deviate around convective weather. It is shown that the running time of the algorithm increases linearly with the total number of links between all stages. The optimal routes minimize a combination of fuel cost and expected cost of route deviation due to convective weather. They are considered as alternatives to the set of coded departure routes which are predefined by FAA to reroute pre-departure flights around weather or air traffic constraints. A formula, which calculates predicted probability of deviation from a given flight path, is also derived. The predicted probability of deviation is calculated for all path candidates. Routes with the best probability are selected as optimal. The predicted probability of deviation serves as a computable measure of reliability in pre-departure rerouting. The algorithm can also be extended to automatically adjust its design parameters to satisfy the desired level of reliability.

Ng, Hok K.↗

A Convex Optimization Approach to Improving Suboptimal Hyperparameters of Sliced Normal Distributions

Sliced Normal (SN) distributions are a generalization of Gaussian distributions where the quadratic argument of the exponential is replaced with a sum of squares polynomial. SNs may be used to represent the distribution of a diverse set of random variables including multi-modal, non-symmetric, and skewed distributions. Unfortunately, the likelihood function of a SN includes a normalization constant and the inclusion of this normalization constant makes the likelihood a non-convex function of the hyperparameters which define the SN. In previous work, suboptimal fitting of the hyperparameters was performed by transforming the given data into a higher dimensional monomial basis and selecting the optimal hyperparameters of a Gaussian fit in this space. However, this approach did not account for the effect of lifting on the normalization constant. Indeed, it was observed that as the number of monomials is increased the likelihood of the Sliced Normal can decrease. In this paper, we increase the likelihood of Sliced Normals found using the previous method by developing a convex formulation which scales the covariance matrix of the Gaussian fit such that the likelihood of the Sliced Normal is maximized. The result is significant improvements of the log likelihood of fitted SN distributions, including a significant increase, especially for problems with 500+ monomials.

Convex optimization approach to improving suboptim↗