Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Randomized 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 919 records · Page 51

Statistics of the NiCoCr medium-entropy alloy: Novel aspects of an old puzzle

Abstract We study the K -state phenomenon in the NiCoCr medium-entropy alloy using first-principles techniques jointly with the efficient Wang–Landau Monte Carlo and simulated annealing algorithms. Our theoretical results successfully explain the existence of the peak around 940 K in the experimental specific heat curve that characterizes the K -state phenomenon and give a fine picture of its atomic origin. The peak is caused by the maximum change of the local configurations characterized by the short-range-order (SRO) parameters at that temperature. The maximum change in SRO parameters is dominated by the nearest-neighbor interactions of atoms but substantially tuned by the many-body interactions. One surprising aspect revealed by the reciprocal-space SRO parameters is that the Ni–Co pair distribution is not random even above the ordering transition temperature, dramatically different from Ni–Cr and Co–Cr, indicating the system cannot be treated as a pseudo binary alloy. This prototypical example shows the complicated nature of multicomponent alloys, different from binary alloys. Our methods can be directly used to study the important K -state phenomenon observed in a number of other composition-concentrated alloys regardless of their number of components.

Pei, Zongrui (ORCID:0000000307484629)↗

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗

Design Choices in Anomaly Detection for Industrial Control Systems: Insights from Gas Pipeline Data

Industrial control systems (ICS) remain vulnerable to increasingly sophisticated cyberattacks, yet evaluating anomaly detection models in these environments is challenging due to temporal dependencies, missing-not-at-random patterns, and extremely imbalanced datasets. These factors make common practices—especially random data splits and naïve imputation—prone to severe temporal leakage, which can inflate reported performance and obscure real-world limitations. In this work, we systematically examine classical machine learning models, temporal deep learning architecture, and tensor-decomposition–based methods on a gas-pipeline dataset using a fully temporally separated evaluation pipeline designed to mimic realistic deployment conditions. Our findings show that proper temporal handling and MNAR-aware preprocessing significantly alter the relative performance of popular anomaly-detection methods, providing practical guidance for designing reliable, leakage-resistant ICS intrusion-detection systems.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Inference of the Lensing Convergence from Photometric Catalogs with Bayesian Graph Neural Networks

Abstract We present a Bayesian graph neural network (BGNN) that can estimate the weak lensing convergence ( κ ) from photometric measurements of galaxies along a given line of sight (LOS). The method is of particular interest in strong gravitational time-delay cosmography (TDC), where characterizing the “external convergence” ( κ ext ) from the lens environment and LOS is necessary for precise Hubble constant ( H 0 ) inference. Starting from a large-scale simulation with a κ resolution of ∼1′, we introduce fluctuations on galaxy–galaxy lensing scales of ∼1″ and extract random sight lines to train our BGNN. We then evaluate the model on test sets with varying degrees of overlap with the training distribution. For each test set of 1000 sight lines, the BGNN infers the individual κ posteriors, which we combine in a hierarchical Bayesian model to yield constraints on the hyperparameters governing the population. For a test field well sampled by the training set, the BGNN recovers the population mean of κ precisely and without bias (within the 2 σ credible interval), resulting in a contribution to the H 0 error budget well under 1%. In the tails of the training set with sparse samples, the BGNN, which can ingest all available information about each sight line, extracts a stronger κ signal compared to a simplified version of the traditional method based on matching galaxy number counts, which is limited by sample variance. Our hierarchical inference pipeline using BGNNs promises to improve the κ ext characterization for precision TDC. The code is available as a public Python package, Node to Joy ⏬ .

79 ASTRONOMY AND ASTROPHYSICS↗

CTT: Tools for Fine Alignment of Flash X-ray Systems

The CTT code is a compilation of the python code that was prototyped in the interest of making a method for fine alignment of Flash X-ray Systems at the lab. It contains python code for interacting with LTT and running optimization loops using LTT simulations or ray tracing with RaySpace. It Includes classes for creating phantom objects and modular geometry objects in the simulations. It allows one to generate a random phantom that has been optimized to stay with a certain cubic volume and maximize the minimum distance between any two ball phantom centers in all projections. It was primarily made to work on ball phantoms which were simulated as Teflon spheres. It allows the alignment from some nominal position to some displaced position to simulate recovery of a real geometry from the nominal geometry of the system. Fine alignment can be done with the projections in LTT while a rough alignment is faster using rayspace. If rayspace works well for the use case it should be preferred since it is considerably faster and less resource intensive in general. Some Notes about using this code is that one will have to edit the imports for the files to get to the correct LTT path, LTT GUI path and to the CTT path when importing. This was made by using anaconda with python 3 on windows 10. The LTT code was stored in a anaconda environment which seemed to help the python find the LTT although it shouldn’t be necessary if you append the path in your code using sys.path.append(r'add the path you want here’). The sys.path.append method is a quick way to give your python code access to a given folder when running it (such as LTT or CTT). Note that since the code was originally made with paths for a specific machine that a new user will have to edit those paths to make it work in all the files that use the old paths. This is somewhat tedious but will be required to run the code on a new machine. The methodology used to run and make these notebooks starts with opening a command prompt as administrator in windows 10. After this one would activate the anaconda environment in the appropriate directory using “conda activate myenv” in the command prompt. After this open a jupyter-notebook using the keyword “jupyter-notebook". After that a notebook should open in a browser. Note that some libraries used may not come with anaconda so those may have to be installed. There shouldn’t be much though since the main things used are scipy, numpy, matplotlib, and LTT. LTTQuicksetup also requires some paths that will be specific to the computer so that should be changed as well.

42 ENGINEERING↗

Photocatalytic Hydrogen Evolution Using Mesoporous Honeycomb Iron Titanate

Mesoporous honeycomb iron titanate using a sol-gel, evaporation-induced self-assembly method is synthesized. A triblock copolymer, F127, serves as a structure-directing agents, with iron chloride and titanium (IV) isopropoxide as inorganic precursors. The strong intermolecular force of attraction among urea, metal precursors, and polymer led to the formation of the mesoporous honeycomb structure. The study of physicochemical properties using different techniques reveals the formation of microstructures with a remarkable degree of porosity. The amorphous iron titanate outperforms the photochemical generation of H 2 due to its disorderly structural arrangement and incomplete crystal formation. The randomness on the structure provides more area for catalytic reaction by providing more contact with the reactant and superior light absorption capability. The high amount of hydrogen gas, 40.66 mmolg -1 h -1 , is observed in the investigation over 3 h of activity for the iron titanate honeycomb sample. This yield is a more significant amount compared to the obtained for the commercially available TiO 2 (23.78 mmolg -1 h -1 ). The iron titanate materials synthesized with low-cost materials and methods are very effective and have the potential for hydrogen generation.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

On the eigenvector bias of Fourier feature networks: From regression to solving multi-scale PDEs with physics-informed neural networks

Physics-informed neural networks (PINNs) are demonstrating remarkable promise in integrating physical models with gappy and noisy observational data, but they still struggle in cases where the target functions to be approximated exhibit high-frequency or multi-scale features. Here in this work we investigate this limitation through the lens of Neural Tangent Kernel (NTK) theory and elucidate how PINNs are biased towards learning functions along the dominant eigen-directions of their limiting NTK. Using this observation, we construct novel architectures that employ spatio-temporal and multi-scale random Fourier features, and justify how such coordinate embedding layers can lead to robust and accurate PINN models. Numerical examples are presented for several challenging cases where conventional PINN models fail, including wave propagation and reaction–diffusion dynamics, illustrating how the proposed methods can be used to effectively tackle both forward and inverse problems involving partial differential equations with multi-scale behavior.

42 ENGINEERING↗

Local modeling for FRF estimation with noisy input measurements

The frequency response function (FRF) is an essential means by which dynamic systems are qualified. In recent years, local modeling approaches have been extensively researched and shown to significantly outperform traditional FRF estimators. However, the standard local modeling approach assumes a perfectly-known system input, which results in biased FRF estimates in the presence of input noise. This paper derives a simple adjustment that can be used to improve FRF estimation for systems subjected to random excitation with noisy input data. This improvement can be implemented with little modification to standard local modeling algorithms and with little additional computational burden. The adjustment is coupled with a model selection procedure to avoid underfitting and overfitting. In conclusion, the methods presented in this paper are validated on a simulation, and they are shown to reduce bias due to input noise.

47 OTHER INSTRUMENTATION↗

Predicting battery capacity from impedance at varying temperature and state of charge using machine learning

Prediction of battery health from electrochemical impedance spectroscopy (EIS) data can enable rapid measurement of battery state in real-world applications without using additional sensors or time-consuming performance measurements. However, deconvoluting the effect of capacity, state of charge, and temperature on EIS response is complicated analytically. Here, various machine-learning models, such as linear, Gaussian process, random forest, and artificial neural network regression, are utilized to predict capacity from EIS using hundreds of capacity, direct current (DC) resistance, and EIS measurements recorded under varying conditions of health, temperature, and state of charge (SOC). Several feature extraction and selection methods from traditional electrochemical analysis and statistical modeling are explored using machine-learning pipelines. EIS data from just two frequencies can accurately predict capacity, and interrogation shows that the optimal set of frequencies is not usually intuitive. Best results are achieved with an ensemble model, which predicts battery capacity with a mean absolute error of 1.9% on data from unobserved cells.

25 ENERGY STORAGE↗

Scalable algorithms for physics-informed neural and graph networks

Physics-informed machine learning (PIML) has emerged as a promising new approach for simulating complex physical and biological systems that are governed by complex multiscale processes for which some data are also available. In some instances, the objective is to discover part of the hidden physics from the available data, and PIML has been shown to be particularly effective for such problems for which conventional methods may fail. Unlike commercial machine learning where training of deep neural networks requires big data, in PIML big data are not available. Instead, we can train such networks from additional information obtained by employing the physical laws and evaluating them at random points in the space–time domain. Such PIML integrates multimodality and multifidelity data with mathematical models, and implements them using neural networks or graph networks. Here, we review some of the prevailing trends in embedding physics into machine learning, using physics-informed neural networks (PINNs) based primarily on feed-forward neural networks and automatic differentiation. For more complex systems or systems of systems and unstructured data, graph neural networks (GNNs) present some distinct advantages, and here we review how physics-informed learning can be accomplished with GNNs based on graph exterior calculus to construct differential operators; we refer to these architectures as physics-informed graph networks (PIGNs). We present representative examples for both forward and inverse problems and discuss what advances are needed to scale up PINNs, PIGNs and more broadly GNNs for large-scale engineering problems.

42 ENGINEERING↗

Gaussian-process generative model for the QCD equation of state

We develop a generative model for the nuclear matter equation of state at zero net baryon density using the Gaussian process regression method. We impose first-principles theoretical constraints from lattice quantum chromodynamics and hadron resonance gas at high- and low-temperature regions, respectively. By allowing the trained Gaussian process regression model to vary freely near the phase transition region, we generate random smooth crossover equations of state with different speeds of sound that do not rely on specific parametrizations. Here, we explore a collection of experimental observable dependencies on the generated equations of state, which paves the groundwork for future Bayesian inference studies to use experimental measurements from relativistic heavy-ion collisions to constrain the nuclear matter equation of state.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Nonlinear dynamics of quadratic gravity in spherical symmetry

We present the first numerically stable nonlinear evolution for the leading-order gravitational effective field theory (quadratic gravity) in the spherically-symmetric sector. The formulation relies on (i) the harmonic gauge to cast the evolution system into quasilinear form (ii) the Cartoon method to reduce to spherical symmetry in keeping with the harmonic gauge, and (iii) order reduction to first order (in time) by means of introducing auxiliary variables. The well posedness of the respective initial-value problem is numerically confirmed by evolving randomly perturbed flat-space and black-hole initial data. In conclusion, our study serves as a proof-of-principle for the possibility of stable numerical evolution in the presence of higher derivatives.

79 ASTRONOMY AND ASTROPHYSICS↗

Review of machine learning and deep learning models for toxicity prediction

The ever-increasing number of chemicals has raised public concerns due to their adverse effects on human health and the environment. To protect public health and the environment, it is critical to assess the toxicity of these chemicals. Traditional in vitro and in vivo toxicity assays are complicated, costly, and time-consuming and may face ethical issues. These constraints raise the need for alternative methods for assessing the toxicity of chemicals. Recently, due to the advancement of machine learning algorithms and the increase in computational power, many toxicity prediction models have been developed using various machine learning and deep learning algorithms such as support vector machine, random forest, k-nearest neighbors, ensemble learning, and deep neural network. This review summarizes the machine learning- and deep learning-based toxicity prediction models developed in recent years. Support vector machine and random forest are the most popular machine learning algorithms, and hepatotoxicity, cardiotoxicity, and carcinogenicity are the frequently modeled toxicity endpoints in predictive toxicology. It is known that datasets impact model performance. The quality of datasets used in the development of toxicity prediction models using machine learning and deep learning is vital to the performance of the developed models. The different toxicity assignments for the same chemicals among different datasets of the same type of toxicity have been observed, indicating benchmarking datasets is needed for developing reliable toxicity prediction models using machine learning and deep learning algorithms. This review provides insights into current machine learning models in predictive toxicology, which are expected to promote the development and application of toxicity prediction models in the future.

Research & Experimental Medicine↗

Probing black hole microstate evolution with networks and random walks

We model black hole microstates and quantum tunneling transitions between them with networks and simulate their time evolution using well-established tools in network theory. In particular, we consider two models based on Bena-Warner three-charge multi-centered microstates and one model based on the D1-D5 system; we use network theory methods to determine how many centers (or D1-D5 string strands) we expect to see in a typical late-time state. We find three distinct possible phases in parameter space for the late-time behaviour of these networks, which we call ergodic, trapped, and amplified, depending on the relative importance and connectedness of microstates. We analyze in detail how these different phases of late-time behavior are related to the underlying physics of the black hole microstates. Our results indicate that the expected properties of microstates at late times cannot always be determined simply by entropic arguments; typicality is instead a highly non-trivial, emergent property of the full Hilbert space of microstates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Self-assembly of co-continuous nanostructured copolymer templates with compositional and architectural dispersity

In our previous DOE-supported project (DE-SC0016208), we demonstrated that a particular architecture dubbed ‘randomly end-linked copolymer networks’ (RECNs) led to especially robust self-assembly of disordered cocontinuous nanostructures. Such structures, wherein both microphases are fully percolating in three dimensions, are attractive for a wide-variety of energy-relevant applications including purification membranes, separators in batteries and fuel cells, catalyst supports, and high surface area electrodes. In the current project we sought to substantially extend our fundamental understanding of how different types of randomness in blocky copolymer architecture contribute to the robust formation of disordered cocontinuous nanostructures. To do so, we filled in the sizable gap between the previously studied cases of randomly linked linear multiblock copolymers and RECNs by studying two intermediate cases: (i) random miktoarm star polymers, which contain dispersity in the number of the two chemically-incompatible strands located at each junction and therefore the preferred interfacial curvature of each polymer, and (ii) randomly branched copolymers, which also possess bridging strands that stretch across domains and apply local ‘elastic’ forces to the interfaces. In addition, we studied a different network architecture, statistically crosslinked copolymer networks, that is more straightforward to prepare using chain growth polymerization methods, enabling more facile formation of cocontinuous nanostructures. Finally, we extended our approaches from model systems based on polystyrene and poly(lactic acid) to copolymer architectures containing either (i) polysulfone, an engineering polymer that provides excellent mechanical properties for membrane applications, or (ii) polyacrylonitrile, providing a convenient route to nanoporous carbon materials.

36 MATERIALS SCIENCE↗

Parallelized domain decomposition for multi-dimensional Lagrangian random walk mass-transfer particle tracking schemes

Lagrangian particle tracking schemes allow a wide range of flow and transport processes to be simulated accurately, but a major challenge is numerically implementing the inter-particle interactions in an efficient manner. This article develops a multi-dimensional, parallelized domain decomposition (DDC) strategy for mass-transfer particle tracking (MTPT) methods in which particles exchange mass dynamically. We show that this can be efficiently parallelized by employing large numbers of CPU cores to accelerate run times. In order to validate the approach and our theoretical predictions we focus our efforts on a well-known benchmark problem with pure diffusion, where analytical solutions in any number of dimensions are well established. In this work, we investigate different procedures for “tiling” the domain in two and three dimensions (2-D and 3-D), as this type of formal DDC construction is currently limited to 1-D. An optimal tiling is prescribed based on physical problem parameters and the number of available CPU cores, as each tiling provides distinct results in both accuracy and run time. We further extend the most efficient technique to 3-D for comparison, leading to an analytical discussion of the effect of dimensionality on strategies for implementing DDC schemes. Increasing computational resources (cores) within the DDC method produces a trade-off between inter-node communication and on-node work. For an optimally subdivided diffusion problem, the 2-D parallelized algorithm achieves nearly perfect linear speedup in comparison with the serial run-up to around 2700 cores, reducing a 5 h simulation to 8 s, while the 3-D algorithm maintains appreciable speedup up to 1700 cores.

97 MATHEMATICS AND COMPUTING↗

Genarris 2.0: A Random Structure Generator for Molecular Crystals

Genarris is an open source Python package for generating random molecular crystal structures with physical constraints for seeding crystal structure prediction algorithms and training machine learning models. Here we present a new version of the code, containing several major improvements. A MPI-based parallelization scheme has been implemented, which facilitates the seamless sequential execution of user-defined workflows. A new method for estimating the unit cell volume based on the single molecule structure has been developed using a machine-learned model trained on experimental structures. A new algorithm has been implemented for generating crystal structures with molecules occupying special Wyckoff positions. A new hierarchical structure check procedure has been developed to detect unphysical close contacts efficiently and accurately. New intermolecular distance settings have been implemented for strong hydrogen bonds. To demonstrate these new features, we study two specific cases: benzene and glycine. Genarris finds the experimental structures of the two polymorphs of benzene and the three polymorphs of glycine. Program summary Program Title: Genarris 2.0 Program Files doi: http://dx.doi.org/10.17632/grx6mz4pjn.1 Licensing provisions: BSD-3 Clause Programming language: Python, C External routines/libraries: Spglib, ASE, pymatgen, SciPy, mpi4py, scikit-learn, PyTorch, FHI-aims. Nature of problem: Molecular crystal structure prediction. Solution method: Genarris 2.0 generates molecular crystal structures over the 230 space groups, on general and special Wyckoff positions, using physical constraints. Down-sampling of the generated structures may be performed subsequently, based on molecular crystal packing descriptors and an unsupervised machine learning algorithm. Lastly, ab initio structure relaxation may be performed for the final pool. Depending on the user-defined workflow implemented, Genarris may be used to generate diverse molecular crystal datasets to seed evolutionary algorithms or to train machine learning algorithms or as a standalone crystal structure prediction method. Restrictions: For crystal structure generation, the molecule of interest must be semi-rigid with no bond rotational degrees of freedom. Unusual features: Genarris 2.0 is a highly distributed program, making use of MPI for Python parallelization. The user has the ability to design and implement workflows by executing a user-defined list of procedures. Genarris 2.0 offers new features including a machine learning model for estimating the molecular volume in the solid state from the single molecule structure, structure generation in special Wyckoff positions of space groups, hierarchical structure checks including rigorous treatment of non-orthogonal structures, and clustering and down-selection workflows combining first principles simulations with machine learning. (C) 2020 Elsevier B.V. All rights reserved.

Crystal structure prediction↗

A generalized 3D elastic model for nanoscale, self-assembled oxide-metal thin films with pillar-in-matrix configurations

In recent years, functional oxide-metal based vertically aligned nanocomposite (VAN) thin films have gained interest due to their intriguing physical properties and multifunctionalities stemming from the complex interactions between the two phases in the film and the substrate. In this work, we develop a model for studying the energetics of these thin film systems, including the effects of both lattice mismatch and capillary forces due to interface curvature. Each phase is incorporated into the model using a phase indicator function, and we introduce the capillary forces as body forces using a vector density representation of the interface. The model is implemented using the finite element method to study the deformation of the thin film which is composed of Au nanopillars embedded in a La 0.7 Sr 0.3 MnO 3 (LSMO) matrix on an SrTiO 3 (STO) substrate. Further, the results suggest that the total energy is lowest for random configurations of pillars compared to ordered square and hexagonal lattice configurations, consistent with the random distribution of pillars found in experiments. Furthermore, we find that the interfacial energy dominates the total energy of each configuration, suggesting that interfacial energy in the system is an important design parameter for nanocomposite growth, along with the lattice mismatch.

36 MATERIALS SCIENCE↗