Searcharxiv⌕ Search

arXiv subjects

Wei Gong

Publications and source records attributed to Wei Gong.

At least 19 recordsLinked to original sources

A discontinuous Galerkin method for biharmonic Dirichlet control problems with patch reconstruction

In this paper, we present and analyze an interior penalty discontinuous Galerkin method for Dirichlet boundary control problems governed by the biharmonic equation, with the control imposed through the normal derivative. The method is based on a reconstructed discontinuous approximation that admits an arbitrarily high-order approximation space with only one unknown per element. We construct a discretization that approximates the state and adjoint state in this space and derive a priori error estimates in the energy and $L^2$ norms. The analysis is carried out under the limited regularity available on polygonal domains by means of a medius argument. Numerical experiments are provided to support the predicted convergence rates.

math.NA↗

Advanced Global Wildfire Activity Modeling with Hierarchical Graph ODE

Wildfires, as an integral component of the Earth system, are governed by a complex interplay of atmospheric, oceanic, and terrestrial processes spanning a vast range of spatiotemporal scales. Modeling their global activity on large timescales is therefore a critical yet challenging task. While deep learning has recently achieved significant breakthroughs in global weather forecasting, its potential for global wildfire behavior prediction remains underexplored. In this work, we reframe this problem and introduce the Hierarchical Graph ODE (HiGO), a novel framework designed to learn the multi-scale, continuous-time dynamics of wildfires. Specifically, we represent the Earth system as a multi-level graph hierarchy and propose an adaptive filtering message passing mechanism for both intra- and inter-level information flow, enabling more effective feature extraction and fusion. Furthermore, we incorporate GNN-parameterized Neural ODE modules at multiple levels to explicitly learn the continuous dynamics inherent to each scale. Through extensive experiments on the SeasFire Cube dataset, we demonstrate that HiGO significantly outperforms state-of-the-art baselines on long-range wildfire forecasting. Moreover, its continuous-time predictions exhibit strong observational consistency, highlighting its potential for real-world applications.

cs.LG↗

CLOSURE: Cross-Channel Closure for Multivariate Time Series Anomaly Detection

Multivariate time series produced by industrial installations and server clusters are under continuous monitoring, and anomaly detection is the first line of defense before a local fault escalates into a system-wide failure. In the absence of labels, the dominant paradigm trains a reconstruction model on normal data and scores the residual to reach a verdict. Recent work has steadily enriched the expressiveness of the recovery map through Transformers, diffusion models, and cross-scale associations. A residual, however, only certifies that an observation can be recovered; it does not certify that the variables still explain one another as they do under normal operation. A coordinated yet unfamiliar operating transition inflates the residual without breaking any relationship, whereas a sensor drifting away from its peers may leave the residual silent. Methods that fold inter-variable dependencies into the reconstruction objective inherit this ambiguity, because their relational evidence is ultimately supervised by the same recovery loss. We therefore propose CLOSURE, which evaluates recoverability and cross-channel consistency as two normal-data prediction tasks learned in separation. The recoverability task is solved by a diffusion reconstructor conditioned on a discrete memory of normal temporal bases. The consistency task is solved by a relation-closure operator that predicts every channel exclusively from the others, where the target's own trajectory is withheld and sparse signed gates decide which peers are actually used. The two scores are reconciled only through calibration on normal data. Extensive experiments show that CLOSURE consistently outperforms recent reconstruction-, frequency-, and topology-based detectors on public benchmark streams, confirming the value of examining consistency alongside recoverability.

cs.AI↗

AEGIS: Risk-Budgeted Online Scheduling for Resilient Continuous Edge Inference

Continuous edge inference requires sustained wireless and computing support across successive service instances. Under recurring channel degradation, transient edge overload, and multi-user contention, isolated deadline misses may accumulate into persistent service degradation. Existing schedulers mainly optimize instantaneous latency or per-timeslot utility and provide limited control over such cross-time effects. To address this issue, we propose AEGIS (Adaptive Exposure-Governed Inference Scheduling), a risk-budgeted online framework for service-level operational resilience. AEGIS regulates predicted deadline-risk exposure through dynamically replenished per-user risk budgets and establishes an explicit finite-horizon bound on cumulative admitted-risk exposure. One-step state estimation supports anticipatory delay and risk assessment, while the centralized bandwidth-computing allocation is transformed into an exact-potential formulation and solved through asynchronous coordinate updates. Simulation results under varying system scales and stress conditions show that adaptive replenishment improves service continuity and recovery relative to fixed replenishment, while risk budgeting reduces predicted-risk exposure compared with more aggressive scheduling alternatives.

cs.NI↗

A volume-controlled level-set method for topology optimization

Topology optimization typically involves a geometric volume/mass constraint due to the limited use of material. As a popular technique for topology optimization, the level-set method typically employs the Lagrange method, the penalty method, or the augmented Lagrangian approach to address the volume constraint. This requires careful parameter tuning and may lead to non-monotonic changes in the objective. In this paper, we present a new volume-controlled level-set method for topology optimization. By imposing a scalar weighted volume?compatibility constraint in a modified Stokes-type extension-regularization problem, the velocity is made volume compatible at the beginning of each frozen transport interval. At the continuous level, we prove that the initial rate of change of the regularized volume vanishes and that the subsequent frozen-velocity drift is of order $T^2$; under a narrow-band assumption, the corresponding constant is independent of the smoothing parameter. For the discontinuous Galerkin spatial semi-discretization of the level-set transport equation, we derive a quantitative regularized-volume drift estimate that displays the dependence on the smoothing parameter, spatial mesh size, transport time, and discrete velocity. The effectiveness of the present algorithm is demonstrated through the minimum compliance problem for linear elasticity, the eigenfrequency maximization for structural vibration, and the minimum energy dissipation problem for Stokes flows.

math.OC↗

Mie-lithography: void-resonance-assisted femtosecond laser printing for deep-ultraviolet to near-infrared nano dispersion devices

Nanoscale control of optical dispersion is essential for applications ranging from miniaturized spectrometers to color printing, all of which demand broadband spectral tunability. However, the Kramers-Kronig relations impose a fundamental trade-off between dispersion and loss, strictly limiting the design ability of single-material devices across the deep ultraviolet (DUV) to near-infrared (NIR) regimes. Consequently, the fabrication of miniaturized dispersion devices heavily relies on costly nanofabrication or heterogeneous integration. Here we overcome these limitations by shifting the light-matter interaction from solid structure into air-filled voids. We introduce a fabrication strategy termed "Mie-lithography", in which laser printed seed nanocavities excite Mie resonances in air and the resulting localized field enhancement drives the self-assembly of three-dimensionally tunable void-type optical resonators. Because the resonant modes are primarily confined within air voids, this architecture effectively alleviates material-imposed dispersion-loss constraints, allowing on-demand customization of the broadband spectral response. This approach could enable single-step, high-throughput (>= 10^6 pixels/s) printing of dispersion units with a resolution of 63,500 DPI. As a proof of concept, we demonstrate a single-material nano dispersion device for spectral encoding from 200 to 800 nm, with spectral reconstruction using a camera. Our approach can be extended into a platform for ultra-broadband (DUV-NIR) nano devices fabrication and design, opening avenues for high-pixel-density displays and miniaturized spectrometers.

physics.optics↗

Predictive Rolling-Horizon Optimization for Commitment-Aware Model-Parallel Inference under Spatio-Temporal Edge Dynamics

Model-parallel inference over dynamic edge systems requires scheduling decisions that account for not only instantaneous resources but also future resource contention and reliable service commitments. Existing edge-inference designs, however, predominantly optimize performance metrics based on current or short-term system states, without explicitly coupling current assignments with future commitment fulfillment. To address this issue, we propose PROMISE, a predictive rolling-horizon framework for commitment-aware model-parallel inference under spatio-temporal edge dynamics. PROMISE jointly models stochastic task generation, mobility-induced communication variations, privacy-aware model partitioning, and load-dependent edge computing capability. We introduce committed completion time (CCT) as an endogenous service decision and formulate joint SD--ES mapping and CCT determination to balance commitment fulfillment and service reward. To address cross-timeslot coupling, PROMISE estimates future task arrivals and computational workloads over an adaptive horizon and embeds them into certainty-equivalent ES-state rollout. A progress-aware surrogate then evaluates feasible current-stage mappings, while the corresponding CCTs are analytically recovered from predicted completion times. Only the first-stage decisions are committed, and the optimization is repeated with newly observed states in a receding-horizon manner. Numerical experiments demonstrate robust scheduling performance under diverse system scales and workload dynamics, while Raspberry-Pi-based experiments validate the practical feasibility and key system characteristics of model-parallel edge inference.

cs.DC↗

HappyWorld-Bench

Evaluating world models requires assessing both the quality of the worlds they generate and their consistency and responsiveness under exploration, interaction, and modification. We introduce HappyWorld-Bench, a comprehensive benchmark that evaluates whether generated worlds remain reliable as agents interact with them. Our design is built on a hierarchical capability framework of six world capabilities (W1-W6), from generative construction to unified world modeling, instantiated across three independent evaluation tracks: video world models, spatial world models, and embodied world models. HappyWorld-Bench comprises 1,138 video prompts, 300 spatial scenes, and 254 embodied test cases. Across all three tracks, we build and operate HappyWorld-Arena to organize human A/B comparisons and derive model-level Elo ratings, which complement newly designed automated metrics that capture behavioral correctness. We evaluate 14 video world models, 9 spatial systems, and 8 embodied candidates under this unified framework. Results reveal remaining reliability gaps across all three tracks: video models exhibit reduced consistency during extended rollouts and revisits, spatial models achieve at best 70.14% placement accuracy and 73.33% edit execution, and embodied models struggle to preserve state across multi-step actions and respond precisely to altered action conditions and physical rules. These findings highlight the need to evaluate world models not only by visual quality, but also by state consistency and the correctness of their responses to actions and interventions.

cs.CV↗

TRACER: Adaptive Multi-Robot Social Navigation via Joint Human-Response Prediction and Interaction-Aware Replanning

Multi-robot navigation in human-shared spaces is inherently interactive: coordinated robot motions influence how nearby entities respond, while those responses provide valuable information for subsequent robot decisions. However, existing methods typically address action-conditioned prediction, multi-robot planning, or online adaptation separately, and therefore lack a unified mechanism for modeling joint robot-entity interactions and adapting future decisions from executed interaction outcomes. To address this gap, we propose TRACER, a bi-directional receding-horizon framework that closes the loop between prediction and adaptation. TRACER evaluates candidate (i.e., alternative feasible future motion plans for the robot team) trajectories using a per-entity probabilistic response model that separates individual-robot effects from non-additive pairwise interactions; after executing the selected trajectory prefix, it updates persistent identity-bound beliefs over latent response modes using the synchronized observed responses. These updated beliefs then guide subsequent candidate evaluation under probabilistic safety and response-aware cost criteria. Experiments show that (i) TRACER more accurately captures non-additive multi-robot interaction effects than a capacity-matched additive predictor, (ii) persistent identity-consistent evidence improves response prediction and downstream replanning, and (iii) the complete TRACER framework improves collision-free completion over an independent-robot baseline on the SocialGym2 multi-robot social-navigation benchmark.

cs.RO↗

Exploring the Initial Performance of NB-IoT NTN over GEO: Measurement and Analysis

With the standardization of Non-Terrestrial Networks (NTN) to provide direct satellite connectivity to massive, low-power Internet of Things (IoT) devices, 3GPP IoT-NTN bridges the worlds of cellular and satellite communications. While holding great potential for global connectivity with IoT devices, there exist several concerns about the system performance of IoT-NTN over Geostationary Earth Orbit (GEO), which covers multiple dimensions such as end-to-end delay and energy consumption considering the ultra-long transmission distance from ground IoT terminals to GEO satellite. To answer these concerns, we have conducted the first comprehensive and in depth measurement for NB-IoT NTN over GEO. Based on real NB-IoT NTN testbeds including both Skylo and Tiantong, measurements covering more than six months confirm that the available implementation of NB-IoT NTN remains in the initial stage. Amplified by ultra-long Round-Trip Time (RTT) between ground IoT terminals and GEO satellite, there exists plenty of time and energy consumption during the access process. Interestingly, it also reveals that as an energy-saving mechanism, Power Saving Mode (PSM) fundamentally reshapes NB-IoT NTN traffic into a bursty and access-driven communication pattern and thus has a considerable influence on the end-to-end delay and energy consumption. Finally, we propose corresponding optimization schemes to reduce the delay and energy, which lays a good foundation for the implementation of NB-IoT NTN in the near future.

cs.NI↗

Chorusing Synchronization Signals for Ambient 5G Backscatter

5G backscatter communication presents an emerging energy-efficient IoT connectivity solution with enhanced availability and data rate advantages over traditional wireless networks. For 5G backscatter, synchronization is crucial as it ensures high-quality transmission. Popular synchronization methods employ autocorrelation and cross-correlation for accurate timing, yet they are constrained by resources. Traditional cross-correlation-based methods for resource utilization optimization also fail in 5G backscatter due to the presence of multiple templates for 5G. A synchronization strategy that supports high accuracy and low power would be highly attractive for wireless backscatter communication. We propose Symmetric Differential (SD)-based Sync, an accurate and resource-efficient synchronization method for 5G backscatter. We have observed that the envelope of the 5G Primary Synchronization Signal (PSS) exhibits a unique mirror symmetry, which enables us to employ differential techniques for low-power PSS detection. We extensively evaluated our design using a testbed of backscatter hardware, SDR gNodeB, and User Equipment (UE). Results show that our SD consumes 3,175 D flip-flops, which is 87x lower than NR fine timing (NFT), 181x lower than symmetry-based semi-template sync (SST), and 30x lower than symmetric autocorrelation (SA)-based sync.

cs.NI↗

An unfitted finite element method for PDE-constrained shape optimization via shape gradient flow

In this paper, we propose an unfitted finite element method to solve PDE-constrained shape optimization problems via shape gradient flow. The shape gradient flow system consists of the state equation, the adjoint equation, the velocity equation, as well as the flow map that generates the evolution of the boundary driven by the velocity field, which can be viewed as a limit system of the classical shape gradient descent algorithm. In \cite{GongLiRao} the authors proposed an evolving finite element method to solve the shape gradient flow system. Instead, in this paper, we propose an unfitted finite element method in which the evolution of the boundary is realized by cubic splines and the equations are solved by cut finite element methods with ghost penalization. Under reasonable assumptions, we are able to prove some optimal convergence rates that are further validated by numerical experiments.

math.NA↗

Exploring AI in Fashion: A Review of Aesthetics, Personalization, Virtual Try-On, and Forecasting

Fashion-focused artificial intelligence has rapidly advanced in recent years, driven by deep learning and its deployment in recommender systems, detection, retrieval, and analytics. Yet several consumer-facing domains remain comparatively under-surveyed despite their practical impact. This work provides a comprehensive review of methods, datasets, and evaluation metrics across four such domains: aesthetics, personalization, virtual try-on, and forecasting. We synthesize technical approaches spanning representation learning, preference modeling, image transformation, and time-series analysis; relate them to downstream recommender systems and user experience; and highlight cross-domain dependencies (e.g., aesthetics-informed personalization, trend-informed recommendations). We also catalog commonly used datasets and metrics, including those from object detection and image segmentation pipelines, where relevant to try-on and visual understanding. Finally, we identify open challenges and promising directions for integrated AI-driven fashion systems.

cs.CV↗

Analysis of Robin-boundary control for the Boussinesq equations

In this paper, we study an optimal boundary control problem for the Boussinesq equations, which couple the time-dependent Navier-Stokes system with a heat equation, where the control enters through a Robin boundary condition on temperature. We begin by establishing the well-posedness of the optimization problem via a variational framework. We then derive both first- and second-order optimality conditions, including explicit characterizations of the adjoint state and the optimal control. Next, we perform a detailed numerical analysis of a fully discrete scheme: using finite elements in space and a semi-implicit scheme in time, combined with variational discretization for the control. We present rigorous a prior error estimates for the state, adjoint state, and control variables. Numerical experiments are provided to validate our theoretical results.

math.NA↗

A Penalty Method for Non-Self-Adjoint Topology Optimization

We propose a novel penalty method framework for the non-self-adjoint topology optimization problems, taking compliant mechanism problems as an example, by incorporating a convex nonlocal perimeter approximation scheme. We rigorously analyze the existence of solutions to the optimization problem derived from the penalty method. Furthermore, we establish that the discrete problem \(Γ\)-converges to the continuous problem, ensuring consistency across scales. To solve the discrete problem, we develop a projected gradient method that guarantees strict monotonic descent of the objective function. We also extend the framework to the heat dissipation problem and propose a generalized material interpolation function (GMIF), which allows for a targeted control of the topological connectivity in the resulting optimal design. Numerical experiments on the compliant mechanism and heat dissipation problems validate the effectiveness of the proposed method. This framework provides a robust approach to addressing complex optimization challenges in computational mathematics with potential applications in engineering design.

math.OC↗

Adaptive Regime-Switching Forecasts with Distribution-Free Uncertainty: Deep Switching State-Space Models Meet Conformal Prediction

Regime transitions routinely break stationarity in time series, making calibrated uncertainty as important as point accuracy. We study distribution-free uncertainty for regime-switching forecasting by coupling Deep Switching State Space Models with Adaptive Conformal Inference (ACI) and its aggregated variant (AgACI). We also introduce a unified conformal wrapper that sits atop strong sequence baselines including S4, MC-Dropout GRU, sparse Gaussian processes, and a change-point local model to produce online predictive bands with finite-sample marginal guarantees under nonstationarity and model misspecification. Across synthetic and real datasets, conformalized forecasters achieve near-nominal coverage with competitive accuracy and generally improved band efficiency.

cs.LG↗

A Unified Phase-Field Fourier Neural Network Framework for Topology Optimization

We propose Alternating Phase-Field Fourier Neural Networks (APF-FNNs) as a unified and physics-based framework for topology optimization. The approach decouples the design problem by representing the state, adjoint, and topology fields with three separate Fourier neural networks, which are trained via a stable collaborative alternating scheme applicable to both self-adjoint and non-self-adjoint problems. To obtain well-resolved designs, the Ginzburg--Landau energy functional is embedded in the loss of the topology network as an intrinsic regularizer, naturally enforcing smooth and distinct interfaces between the two phases. Phase-field updates are driven by adjoint-based optimality conditions, and design sensitivities are evaluated efficiently using automatic differentiation, ensuring that the gradients correspond to exact total derivatives rather than naive partial derivatives. In contrast to classical phase-field methods, APF-FNNs exploit these physically consistent design gradients directly, avoiding pseudo-time gradient-flow solvers. By formulating physics-driven losses from variational principles or strong-form PDE residuals, the framework is broadly applicable to 2D and 3D benchmark problems, including compliance minimization, eigenvalue maximization, and Stokes/Navier--Stokes flow optimization. Across these examples, APF-FNNs consistently yield competitive performance and well-resolved topologies, establishing a versatile and scalable foundation for physics-driven computational design.

math.OC↗

Bioluminescence tomography via a shape optimization method based on a complex-valued model

In this study, we investigate the inverse source problem arising in bioluminescence tomography, the objective of which is to reconstruct both the support and the intensity of an internal light source from boundary measurements governed by an elliptic model. A shape optimization framework is developed in which the source intensity and its support are decoupled through first-order optimality conditions. To enhance the stability of the reconstruction, we incorporate a parameter-dependent coupled complex boundary method together with perimeter and volume regularizations. Source support is represented by a level set function, allowing the algorithm to naturally accommodate topological changes and recover multiple, closely spaced, or nested source regions. Theoretical justifications for the proposed formulation and regularization strategy are established, and extensive numerical experiments are performed to assess the reconstruction accuracy for both noise-free and noisy data. The results demonstrate that our method achieves robust and accurate recovery of source geometry and intensity, and exhibits clear advantages over existing approaches.

math.NA↗