Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random”

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

Coexistence of Synchronization and Stochasticity in Thermally Coupled Mott Oscillators

Synchronization is conventionally regarded as a mechanism for suppressing variability and enforcing order in coupled systems, from pendula and lasers to neurons and electronic oscillators. Here, we show that synchronization can also embed stochasticity at finer scales. We observe this phenomenon in thermally coupled VO 2 neuristors, where robust in-phase synchronization at the microsecond scale coexists with spike onset fluctuations at the nanosecond scale, with no fixed leader. The coexistence of order and disorder originates from stochastic domain-level physics of the insulator–metal and metal–insulator transitions, where local variations in transition temperature drive cycle-to-cycle randomness in nucleation, percolation, and relaxation. A stochastic domain model reproduces this effect by generating synchronized spike trains with random lead–lag jitter, and experimental interspike interval statistics confirm the persistence of fine-scale variability despite macroscopic phase locking. These findings establish that synchronization and stochasticity can coexist within the same physical platform, revealing hidden disorder within collective order. Furthermore, this insight reframes synchronization as not purely deterministic, but as a universal context where microscopic variability can persist, with implications for electronics, cryptography, and the fundamental physics of order–disorder coexistence.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Consistent Representation of Cloud Overlap and Cloud Subgrid Vertical Heterogeneity

Many global climate models underestimate the cloud cover and overestimate the cloud albedo, especially for low-level clouds. We determine how a correct representation of the vertical structure of clouds can fix part of this bias. We use the 1D McICA framework and focus on low-level clouds. Using Large Eddy Simulations results as reference, we propose a method based on exponential-random overlap that represents the cloud overlap between layers and the subgrid cloud properties over several vertical scales, with a single value of the overlap parameter. Starting from a coarse vertical grid, representative of atmospheric models, this algorithm is used to generate the vertical profile of the cloud fraction with a finer vertical resolution, or to generate it on the coarse grid but with subgrid heterogeneity and cloud overlap that ensures a correct cloud cover. Doing so we find decorrelation lengths are dependent on the vertical resolution, except if the vertical subgrid heterogeneity and interlayer overlap are taken into account coherently. We confirm that the frequently used maximum-random overlap leads to a significant error by underestimating the low-level cloud cover with a relative error of about 50%, that can lead to an error of SW cloud albedo as big as 70%. Not taking into account the subgrid vertical heterogeneity of clouds can cause a relative error of 20% in brightness, assuming the cloud cover is correct.

54 ENVIRONMENTAL SCIENCES↗

Evaluation of the Planetary Boundary Layer Height From ERA5 Reanalysis With MOSAiC Observations Over the Arctic Ocean

The planetary boundary layer height (PBLH) is a crucial indicator reflecting the region of the atmosphere characterized by continuous turbulence. Here, we use radiosonde and surface meteorological observations (4–7 times per day, year-round measurements) during the Multidisciplinary drifting Observatory for the Study of Arctic Climate (MOSAiC) expedition to derive the PBLH (PBLH MOSAiC ), and further evaluate the PBLH from the ERA5 reanalysis (PBLH ERA5 ). Comparisons between PBLH MOSAiC and PBLH ERA5 from different perspectives reveal that: (a) The overestimation of PBLH ERA5 when the sea ice concentration is >90% is significant with the centered root mean squared error reaching up to 201 m; (b) The difference between the two products is notably pronounced in cold seasons, while it is comparatively diminished in warm seasons; (c) In neutral boundary layers, differences in PBLH ERA5 are larger compared with stable and convective boundary layers. In addition, the analysis of error sources indicates that the bias of PBLH ERA5 is sensitive to the bias of vertical thermal structure and wind speed profiles in ERA5 data sets in all conditions. Finally, we find a Random Forest model effectively reduces the bias of PBLH ERA5 with the index of agreement reaching up to 0.71 in the test data set, while a multiple linear regression demonstrates comparable performance to the Random Forest model.

54 ENVIRONMENTAL SCIENCES↗

Janus bottlebrush compatibilizers

Bottlebrush random copolymers (BRCPs), consisting of a random distribution of two homopolymer chains along a backbone, can segregate to the interface between two immiscible homopolymers. BRCPs undergo a reconfiguration, where each block segregates to one of the homopolymer phases, adopting a Janus-type structure, reducing the interfacial tension and promoting adhesion between the two homopolymers, thereby serving as a Janus bottlebrush copolymer (JBCP) compatibilizer. Here, we synthesized a series of JBCPs by copolymerizing deuterated or hydrogenated polystyrene (DPS/PS) and poly(tert-butyl acrylate) (PtBA) macromonomers using ruthenium benzylidene-initiated ring-opening metathesis polymerization (ROMP). Subsequent acid-catalyzed hydrolysis converted the PtBA brushes to poly(acrylic acid) (PAA). The JBCPs were then placed at the interface between DPS/PS homopolymers and poly(2-vinyl pyridine) (P2VP) homopolymers, where the degree of polymerization of the backbone (N BB ) and the grafting density (GD) of the JBCPs were varied. Neutron reflectivity (NR) was used to determine the interfacial width and segmental density distributions (including PS homopolymer, PS block, PAA block and P2VP homopolymer) across the polymer-polymer interface. Our findings indicate that the star-like JBCP with N BB = 6 produces the largest interfacial broadening. Increasing N BB to 100 (rod-like shape) and 250 (worm-like shape) reduced the interfacial broadening due to a decrease in the interactions between blocks and homopolymers by stretching of blocks. Decreasing the GD from 100% to 80% at N BB = 100 caused an increase the interfacial width, yet further decreasing the GD to 50% and 20% reduced the interfacial width, as 80% of GD may efficiently increase the flexibility of blocks and promote interactions between homopolymers, while maintaining relatively high number of blocks attached to one molecule. The interfacial conformation of JBCPs was further translated into compatibilization efficiency. Thin film morphology studies showed that only the lower N BB values (N BB = 6 and N BB = 24) and the 80% GD of N BB = 100 had bicontinuous morphologies, due to a sufficient binding energy that arrested phase separation, supported by mechanical testing using asymmetric double cantilever beam (ADCB) tests. These provide fundamental insights into the assembly behavior of JBCPs compatibilizers at homopolymer interfaces, opening strategies for the design of new BCP compatibilizers.

36 MATERIALS SCIENCE↗

Statistical Modeling and Analysis of k -Layer Coverage of Two-Dimensional Materials in Inkjet Printing Processes

Two-dimensional layered materials/flakes, also known as crystalline atom-thick layer nanosheets, have recently been receiving great attention in electronics fabrication due to their unique and intriguing properties. The k-layer coverage area (i.e., the area covered by k number of overlapping layers) of the printed flake pattern significantly impacts on the properties of the printed electronics. In this work, we constructed a statistical model to describe the k-layer coverage of randomly distributed two-dimensional materials. A series of results are obtained to provide not only the expectation but also the variance of the coverage area. The boundary effects on the random flakes coverage are also studied. In addition, an approximated statistical testing approach is also developed in this work to detect abnormal coverage patterns. Furthermore, the case studies based on simulated data and real flakes images obtained from the inkjet printing process demonstrate the accuracy and effectiveness of the proposed model and analysis methods.

36 MATERIALS SCIENCE↗

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

Robust wind farm layout optimization

Wake interactions in wind farms cause losses in annual energy production (AEP) on the order of 10%. Wind farm designers optimize the layout of the farm to mitigate wake losses, especially in the dominant site-specific wind directions. As wind turbines and wind farms grow in scale, optimization becomes more complex. Offshore wind farms regularly comprise more than 100 wind turbines and are characterized by complex boundaries due to shipping lanes, neighboring wind farms, and other constraints. Layout optimization methods are broadly split between gradient-based and gradient-free approaches. Gradient-based approaches can converge quickly and perform well for smaller, academic problems but are often sensitive to initial conditions and tuning parameters and require expert knowledge to use. On the other hand, gradient-free approaches can be more robust to problem complexities. We present a robust layout optimization approach based on a random search algorithm. The algorithm is intended for those who are not optimization experts and has few tuning parameters that need specification to achieve satisfactory results. Unlike off-the-shelf methods, which use generally available, non-domain-specific optimization routines that accept as inputs an optimization function and constraint definitions, this approach takes advantage of the relative computational costs of the different evaluations by evaluating cheaper computations first (boundary and minimum distance constraints) and running expensive AEP evaluations only if all other checks pass. Moreover, an outer genetic algorithm allows multiple solutions to evolve in parallel, enabling rapid solution development on high-performance computers. We discuss the relative ease of selecting necessary tuning parameters and demonstrate the efficacy of the genetic random search on a complex layout problem consisting of placing 70 turbines in a nonconvex and unconnected boundary region.

17 WIND ENERGY↗

Coupled Hubbard ladders at weak coupling: Pairing and spin excitations

The Hubbard model provides a simple framework in which one can study how certain aspects of the electronic structure of strongly interacting systems can be tuned to optimize the superconducting pairing correlations and how these changes affect the mechanisms giving rise to them. Here we use a weak-coupling random phase approximation to study a two-dimensional Hubbard model with a unidirectional modulation of the hopping amplitudes as the system evolves from the uniform square lattice to an array of weakly coupled two-leg ladders. We find that the pairing correlations retain their dominant d x 2 - y 2- wavelike structure and that they are significantly enhanced for a slightly modulated lattice. This enhancement is traced backed to an increase in the strength of the spin-fluctuation pairing interaction due to favorable Fermi surface nesting in the modulated system. We then use a random-phase approximation BCS framework to examine the evolution of the neutron resonance in the superconducting state. We find that it changes only weakly for moderate modulations, but breaks up into two distinct resonances at incommensurate wave vectors in the limit of weakly coupled ladders.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum chaos, integrability, and late times in the Krylov basis

Quantum chaotic systems are conjectured to display a spectrum whose fine-grained features (gaps and correlations) are well described by random matrix theory (RMT). We propose and develop a complementary version of this conjecture: quantum chaotic systems display a Lanczos spectrum whose local means and covariances are well described by RMT. To support this proposal, we first demonstrate its validity in examples of chaotic and integrable systems. We then show that for Haar-random initial states in RMTs the mean and covariance of the Lanczos spectrum suffice to produce the full long-time behavior of general survival probabilities including the spectral form factor, as well as the spread complexity. In addition, for initial states with continuous overlap with energy eigenstates, we analytically find the long-time averages of the probabilities of Krylov basis elements in terms of the mean Lanczos spectrum. This analysis suggests a notion of eigenstate complexity, the statistics of which differentiate integrable systems and classes of quantum chaos. Lastly, we clarify the relation between spread complexity and the universality classes of RMT by exploring various values of the Dyson index and Poisson distributed spectra.

Combinatorics↗

Many-Body Level Statistics of Single-Particle Quantum Chaos

We consider a noninteracting many-fermion system populating levels of a unitary random matrix ensemble (equivalent to the q = 2 complex Sachdev-Ye-Kitaev model)—a generic model of single-particle quantum chaos. We study the corresponding many-particle level statistics by calculating the spectral form factor analytically using algebraic methods of random matrix theory, and match it with an exact numerical simulation. Despite the integrability of the theory, the many-body spectral rigidity is found to have a surprisingly rich landscape. In particular, we find a residual repulsion of distant many-body levels stemming from single-particle chaos, together with islands of level attraction. These results are encoded in an exponential ramp in the spectral form factor, which we show to be a universal feature of nonergodic many-fermion systems embedded in a chaotic medium.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Data-driven Minimum Entropy Control for Stochastic Nonlinear Systems using the Cumulant-Generating Function

Here, we present a novel minimum entropy control algorithm for a class of stochastic nonlinear systems subjected to non-Gaussian noises. The entropy control can be considered as an optimization problem for the system randomness attenuation, but the mean value has to be considered separately. To overcome this disadvantage, a new representation of the system stochastic properties was given using the cumulant-generating function based on the moment-generating function, in which the mean value and the entropy was reflected by the shape of the cumulant-generating function. Based on the samples of the system output and control input, a time-variant linear model was identified, and the minimum entropy optimization was transformed to system stabilization. Then, an optimal control strategy was developed to achieve the randomness attenuation, and the boundedness of the controlled system output was analyzed. The effectiveness of the presented control algorithm was demonstrated by a numerical example. In this paper, a data-driven minimum entropy design is presented without pre-knowledge of the system model; entropy optimization is achieved by the system stabilization approach in which the stochastic distribution control and minimum entropy are unified using the same identified structure; and a potential framework is obtained since all the existing system stabilization methods can be adopted to achieve the minimum entropy objective.

42 ENGINEERING↗

GrAMME: Semisupervised Learning Using Multilayered Graph Attention Models

Modern data analysis pipelines are becoming increasingly complex due to the presence of multiview information sources. While graphs are effective in modeling complex relationships, in many scenarios, a single graph is rarely sufficient to succinctly represent all interactions, and hence, multilayered graphs have become popular. Though this leads to richer representations, extending solutions from the single-graph case is not straightforward. Consequently, there is a strong need for novel solutions to solve classical problems, such as node classification, in the multilayered case. In this article, we consider the problem of semisupervised learning with multilayered graphs. Though deep network embeddings, e.g., DeepWalk, are widely adopted for community discovery, we argue that feature learning with random node attributes, using graph neural networks, can be more effective. To this end, we propose to use attention models for effective feature learning and develop two novel architectures, GrAMME-SG and GrAMME-Fusion, that exploit the interlayer dependences for building multilayered graph embeddings. Using empirical studies on several benchmark data sets, we evaluate the proposed approaches and demonstrate significant performance improvements in comparison with the state-of-the-art network embedding strategies. The results also show that using simple random features is an effective choice, even in cases where explicit node attributes are not available.

97 MATHEMATICS AND COMPUTING↗

S AP F LOWER : an automated tool for sap flow data preprocessing, gap-filling, and analysis using deep learning

Sap flow, a critical process in plant water use and ecosystem water cycles, is often measured using thermal dissipation probes (TDP) due to their ease of installation and continuous data collection. However, sap flow data frequently include noise, outliers, and gaps, creating challenges for analysis and requiring substantial manual processing. We developed S AP F LOWER , a tool that automates data preprocessing, model training, gap-filling, sapwood area scaling and modeling, and water use analysis. It integrates autocleaning, machine learning and deep learning models (e.g. random forest, Gaussian process regression, long short-term memory (LSTM), bidirectional LSTM (BiLSTM)), and efficient workflows to process sap flow data. S AP F LOWER can remove over 90% of noisy data while preserving legitimate variations and achieve high accuracy in gap-filling based on user-determined parameters. Random forest, LSTM, and BiLSTM models reduced root mean square error to 10% or less for long-term gaps. Model training and prediction can be performed efficiently within seconds. S AP F LOWER significantly enhances the efficiency and accessibility of TDP data analysis by automating complex tasks, enabling researchers without programming expertise to employ advanced techniques. Future improvements will focus on species-specific corrections for TDP and support for additional measurement methods. S AP F LOWER is openly available on GitHub (https://github.com/JiaxinWang123/SapFlower) and Zenodo (doi: 10.5281/zenodo.13665919).

ecosystem water balance↗

Subsampling of Parametric Models with Bifidelity Boosting

Least squares regression is a ubiquitous tool for building emulators (a.k.a. surrogate models) of problems across science and engineering for purposes such as design space exploration and uncertainty quantification. When the regression data are generated using an experimental design process (e.g., a quadrature grid) involving computationally expensive models, or when the data size is large, sketching techniques have shown promise at reducing the cost of the construction of the regression model while ensuring accuracy comparable to that of the full data. However, random sketching strategies, such as those based on leverage scores, lead to regression errors that are random and may exhibit large variability. To mitigate this issue, we present a novel boosting approach that leverages cheaper, lower-fidelity data of the problem at hand to identify the best sketch among a set of candidate sketches. This in turn specifies the sketch of the intended high-fidelity model and the associated data. We provide theoretical analyses of this bifidelity boosting (BFB) approach and discuss the conditions the low- and high-fidelity data must satisfy for a successful boosting. In doing so, we derive a bound on the residual norm of the BFB sketched solution relating it to its ideal, but computationally expensive, high-fidelity boosted counterpart. Finally, empirical results on both manufactured and PDE data corroborate the theoretical analyses and illustrate the efficacy of the BFB solution in reducing the regression error, as compared to the nonboosted solution.

97 MATHEMATICS AND COMPUTING↗

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗

Xanthohumol microbiome and signature in adults with Crohn’s disease (the XMaS trial): a protocol for a phase II triple-masked, placebo-controlled clinical trial

Xanthohumol (XN), a bioactive flavonoid from Humulus lupulus with anti-inflammatory properties, has potential benefits for patients with Crohn’s disease (CD), a type of inflammatory bowel disease. We recently completed and published results of a placebo-controlled phase I clinical trial demonstrating the safety and tolerability of 24 mg XN daily for 8 weeks. The present study aims to evaluate the safety and tolerability of the same dose of XN adults with clinically active CD in a placebo-controlled phase II clinical trial. Additional aims will assess the impact of XN on inflammatory biomarkers, platelet function, CD clinical activity, and stool microbial composition. The metabolism of XN will also be evaluated. This article provides a model protocol for consideration in investigations of XN or other natural products in disease states. A triple-masked, randomized, placebo-controlled trial will be conducted in adults with clinically active CD. Participants (n ≤ 32) will be randomized to either 24 mg encapsulated XN per day or placebo and followed for 8 weeks. Throughout the trial, participants will be queried for adverse events. Biomarkers of clinical safety, blood and stool markers of inflammation, platelet function, Crohn’s Disease Activity Index score, stool microbial composition, and XN metabolite profiles in blood, urine, and stool will be assessed every 2 weeks. We describe the protocol for a phase II clinical trial that evaluates the safety and tolerability of XN in adults with active CD, as well as evaluate metabolism and mechanisms that are relevant to CD and other diseases with underlying inflammation and/or gut permeability. The effects of XN on inflammatory biomarkers, platelet function, the microbiota, and multi-omics biomarkers measured in this phase II trial of adults with CD will be compared to the effects of XN in healthy adults in our previous phase I trial. The results of the study will advance the evidence guiding the use of XN in patients with CD.

60 APPLIED LIFE SCIENCES↗

Machine learning-based inversion for acoustic impedance with large synthetic training data: Workflow and data characterization

Where wells are sparse or training data are difficult to label with high-quality wireline-derived impedance logs, machine learning (ML)-based inversion of acoustic impedance typically depends on small training data sets, leading to biased prediction. We have advanced a novel workflow that applies large synthetic seismic training data to reduce facies-related bias. Using a geologically realistic model as the truth model, we randomly select sparse seed wells to perform sequential Gaussian simulation (SGS) for impedance models of the same geometry and simulate facies variability. We implement random forest regression on 30 features extracted from the synthetic volume. We observe that more seed wells tend to reduce facies-induced bias by sampling more types of facies, resulting in a better prediction. We then focus on the responses of SGS models to facies changes, the number of seed wells necessary for a useful synthetic model, and how much a synthetic model can help ML-based inversion. Here, we observe that the SGS synthetic training model outperforms well-direct training in general. For modeled clastic shore-zone systems in Miocene Gulf of Mexico, two or more seed wells are necessary for a significant reduction of root-mean-square error and outliners, and improvement of facies imaging. In a field-data test, we apply a similar workflow to quantitatively predict acoustic impedance, which is then converted to a sand-volume map at a high-frequency sequence (10–100 m), revealing detailed facies and sandstone patterns. Such results are valuable in many geologic and engineering applications, such as hydrocarbon and CO 2 reservoir prospecting, reserve estimation, simulation, etc.

3D seismic↗

Yet Another NLA Library: T-LAPACK

In recent years, Randomized numerical linear algebra (RandNLA) proved to be more than a theoretical novelty: projects like RandLAPACK demonstrate its practical value across architectures, and projects like RandBLAS build trust in randomization as a tool for high-performance NLA. This BoF considers two main questions. First, what are the pressing issues in software standards and implementation that need to be resolved for RandNLA to become a core component of HPC? Second, how can we mobilize a community effort to make progress on these issues? The BoF will engage the audience to discuss the idea of growing the role of RandNLA in high-performance computing and what it would take to scale from niche prototypes to robust, production-quality software libraries.

97 MATHEMATICS AND COMPUTING↗