Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Large deployable mesh reflectors play a critical role in satellite communications, Earth observation, and deep-space exploration, offering high-gain antenna performance through precisely shaped reflective surfaces. Traditional dynamic modeling approaches—such as wave-based and finite element methods—often struggle to accurately capture the complex behavior of three-dimensional reflectors due to oversimplifications of cable members. To address these challenges, this paper proposes a novel spatial discretization framework that systematically decomposes cable member displacements into boundary-induced and internal components in a global Cartesian coordinate system. The framework derives a system of ordinary differential equations for each cable member by enforcing the Lagrange’s equations, capturing both longitudinal and transverse internal displacement of the cable member. Numerical simulations of a two-dimensional cable-network structure and a center-feed parabolic deployable mesh reflector with 101 nodes illustrate the improved accuracy of the proposed method in predicting vibration characteristics across a broad frequency range. Compared to standard finite element analysis, the proposed method more effectively identifies both low- and high-frequency modes and offers robust convergence and accurate prediction for both frequency and transient responses of the structure. This enhanced predictive capability underscores the significance of incorporating internal cable member displacements for reliable dynamic modeling of large deployable mesh reflectors, ultimately informing better design, control, and on-orbit performance of future space-based reflector systems.more » « lessFree, publicly-accessible full text available February 1, 2027
-
Free, publicly-accessible full text available January 1, 2027
-
Free, publicly-accessible full text available November 4, 2026
-
Efficient real-time solvers for forward and inverse problems are essential in engineering and science applications. Machine learning surrogate models have emerged as promising alter- natives to traditional methods, offering substantially reduced computational time. Never- theless, these models typically demand extensive training datasets to achieve robust gen- eralization across diverse scenarios. While physics-based approaches can partially mitigate this data dependency and ensure physics-interpretable solutions, addressing scarce data regimes remains a challenge. Both purely data-driven and physics-based machine learning approaches demonstrate severe overfitting issues when trained with insufficient data. We propose a novel model-constrained Tikhonov autoencoder neural network framework, called TAEN, capable of learning both forward and inverse surrogate models using a single arbitrary observational sample. We develop comprehensive theoretical foundations including forward and inverse inference error bounds for the proposed approach for linear cases. For compara- tive analysis, we derive equivalent formulations for pure data-driven and model-constrained approach counterparts. At the heart of our approach is a data randomization strategy with theoretical justification, which functions as a generative mechanism for exploring the train- ing data space, enabling effective training of both forward and inverse surrogate models even with a single observation, while regularizing the learning process. We validate our approach through extensive numerical experiments on two challenging inverse problems: 2D heat conductivity inversion and initial condition reconstruction for time-dependent 2D Navier–Stokes equations. Results demonstrate that TAEN achieves accuracy comparable to traditional Tikhonov solvers and numerical forward solvers for both inverse and forward problems, respectively, while delivering orders of magnitude computational speedups.more » « lessFree, publicly-accessible full text available November 1, 2026
-
Free, publicly-accessible full text available December 1, 2026
-
Designing molecules that must satisfy multiple, often conflicting, objectives is a central challenge in molecular discovery. The enormous size of the chemical space and the cost of high-fidelity simulations have driven the development of machine learning-guided strategies for accelerating design with limited data. Among these, Bayesian optimization (BO) offers a principled framework for sample-efficient search, while generative models provide a mechanism to propose novel, diverse candidates beyond fixed libraries. However, existing methods that couple the two often rely on continuous latent spaces, which introduce both architectural entanglement and scalability challenges. This work introduces an alternative, modular “generate-then-optimize” framework for de novo multiobjective molecular design/discovery. At each iteration, a generative model is used to construct a large, diverse pool of candidate molecules, after which a novel acquisition function, qPMHI (multipoint Probability of Maximum Hypervolume Improvement), is used to optimally select a batch of candidates most likely to induce the largest Pareto front expansion. The key insight is that qPMHI decomposes additively, enabling exact, scalable batch selection via only a simple ranking of probabilities that can be easily estimated with Monte Carlo sampling. We benchmark the framework against state-of-the-art latent-space and discrete molecular optimization methods, demonstrating significant improvements across synthetic benchmarks and application-driven tasks. Specifically, in a case study related to sustainable energy storage, we show that our approach quickly uncovers novel, diverse, and high-performing organic (quinone-based) cathode materials for aqueous redox flow battery applications.more » « lessFree, publicly-accessible full text available December 21, 2026
-
Abstract Human mobility is becoming increasingly complex in urban environments. However, our fundamental understanding of urban population dynamics, particularly the pulsating fluctuations occurring across different locations and timescales, remains limited. Here, we use mobile device data from large cities and regions worldwide combined with a detrended fractal analysis to uncover a universal spatiotemporal scaling law that governs urban population fluctuations. This law reveals the scale invariance of these fluctuations, spanning from city centers to peripheries over both time and space. Moreover, we show that at any given location, fluctuations obey a time-based scaling law characterized by a spatially decaying exponent, which quantifies their relationship with urban structure. These interconnected discoveries culminate in a robust allometric equation that links population dynamics with urban densities, providing a powerful framework for predicting and managing the complexities of urban human activities. Collectively, this study paves the way for more effective urban planning, transportation strategies, and policies grounded in population dynamics, thereby fostering the development of resilient and sustainable cities.more » « lessFree, publicly-accessible full text available December 1, 2026
-
Free, publicly-accessible full text available October 31, 2026
-
Standardized protocols for absolute quantification of potato virus Y (PVY) from potato tissue is critical for host-virus dynamic studies. Here, we developed a standardized protocol using a cloned viral sequence as standards to detect and quantify PVY. Starting with total RNA, concentrated via column-based kit, this protocol is able to detect approximately 50 viral copies/reaction from multiple PVY strains. Validation of this protocol confirmed linearity across 8 orders of magnitude with high repeatability, reproducibility and statistical robustness across three independent runs. This protocol offers reliable PVY quantification to manage potato crop health and enables comparative studies with other viral systems.more » « lessFree, publicly-accessible full text available October 22, 2026
-
Free, publicly-accessible full text available November 21, 2026
An official website of the United States government
