SearcharxivSearch

arXiv subjects

Chengxin Wang

Publications and source records attributed to Chengxin Wang.

5 recordsLinked to original sources

Gaussian Ensemble Topology (GET): A New Explicit and Inherently Smooth Framework for Manufacture-Ready Topology Optimization

We introduce the Gaussian Ensemble Topology (GET) method, a new explicit and manufacture-ready framework for topology optimization in which design geometries are represented as superpositions of anisotropic Gaussian functions. By combining explicit Gaussian descriptions with a level-set-like Heaviside projection, GET inherently generates smooth, curvature-continuous designs without requiring post-processing steps such as mesh or corner smoothing and feature extraction. The method is validated on standard compliance-minimization and compliant mechanism benchmarks in two and three dimensions. The optimized designs achieve objective values comparable to those obtained with classical Moving Morphable Component (MMC) approaches, but with geometrically consistent, refined boundaries. Numerical examples demonstrate additional advantages of the GET framework, including mesh independence inherent to explicit parameterizations, strong geometric expressiveness, and effective control over smoothness, discreteness, and structural complexity through parameter tuning. As a robust and manufacture-ready approach to explicit topology optimization, GET opens avenues for tackling advanced and complex design problems.

cs.CE

A Parallel Solver with Multiphysics Finite Element Method for Poroelasticity Coupled with Elasticity Model

In this paper, we propose a parallel solver for solving the quasi-static linear poroelasticity coupled with linear elasticity model in the Lagrange multiplier framework. Firstly, we reformulate the model into a coupling of the nearly incompressible elasticity and an unsteady affection-diffusion equations by setting new variable ``elastic pressure" and ``volumetric fluid content". And we introduce a Lagrange multiplier to guarantee the normal stress continuity on the interface. Then, we give the variational formulations in each subdomain and choose the $\boldsymbol{P}_k$-$P_1$-$P_1$ mixed finite element tuple for poroelasticity subdomain, and $\boldsymbol{P}_k$-$P_1$ finite element pair ($k=1,2$) for elasticity subdomain and the backward Euler scheme for time. Also, we propose a parallel solver for solving the fully discrete scheme at each time step -- the FETI method with a classical FETI preconditioner for solving the Lagrange multiplier and calculating the subproblems in each subdomain in parallel. And we show several numerical tests to validate the computational efficiency and the convergence error order, and we consider Barry-Mercer's model as the benchmark test to show that there no oscillation in the computed pressure. Finally, we draw conclusions to summarize the main results of this paper.

math.NA

Distribution-aware Online Continual Learning for Urban Spatio-Temporal Forecasting

Urban spatio-temporal (ST) forecasting is crucial for various urban applications such as intelligent scheduling and trip planning. Previous studies focus on modeling ST correlations among urban locations in offline settings, which often neglect the non-stationary nature of urban ST data, particularly, distribution shifts over time. This oversight can lead to degraded performance in real-world scenarios. In this paper, we first analyze the distribution shifts in urban ST data, and then introduce DOST, a novel online continual learning framework tailored for ST data characteristics. DOST employs an adaptive ST network equipped with a variable-independent adapter to address the unique distribution shifts at each urban location dynamically. Further, to accommodate the gradual nature of these shifts, we also develop an awake-hibernate learning strategy that intermittently fine-tunes the adapter during the online phase to reduce computational overhead. This strategy integrates a streaming memory update mechanism designed for urban ST sequential data, enabling effective network adaptation to new patterns while preventing catastrophic forgetting. Experimental results confirm DOST's superiority over state-of-the-art models on four real-world datasets, providing online forecasts within an average of 0.1 seconds and achieving a 12.89% reduction in forecast errors compared to baseline models.

cs.LG

Periodic Residual Learning for Crowd Flow Forecasting

Crowd flow forecasting, which aims to predict the crowds entering or leaving certain regions, is a fundamental task in smart cities. One of the key properties of crowd flow data is periodicity: a pattern that occurs at regular time intervals, such as a weekly pattern. To capture such periodicity, existing studies either fuse the periodic hidden states into channels for networks to learn or apply extra periodic strategies to the network architecture. In this paper, we devise a novel periodic residual learning network (PRNet) for a better modeling of periodicity in crowd flow data. Unlike existing methods, PRNet frames the crowd flow forecasting as a periodic residual learning problem by modeling the variation between the inputs (the previous time period) and the outputs (the future time period). Compared to directly predicting crowd flows that are highly dynamic, learning more stationary deviation is much easier, which thus facilitates the model training. Besides, the learned variation enables the network to produce the residual between future conditions and its corresponding weekly observations at each time interval, and therefore contributes to substantially more accurate multi-step ahead predictions. Extensive experiments show that PRNet can be easily integrated into existing models to enhance their predictive performance.

cs.LG

GraphTCN: Spatio-Temporal Interaction Modeling for Human Trajectory Prediction

Predicting the future paths of an agent's neighbors accurately and in a timely manner is central to the autonomous applications for collision avoidance. Conventional approaches, e.g., LSTM-based models, take considerable computational costs in the prediction, especially for the long sequence prediction. To support more efficient and accurate trajectory predictions, we propose a novel CNN-based spatial-temporal graph framework GraphTCN, which models the spatial interactions as social graphs and captures the spatio-temporal interactions with a modified temporal convolutional network. In contrast to conventional models, both the spatial and temporal modeling of our model are computed within each local time window. Therefore, it can be executed in parallel for much higher efficiency, and meanwhile with accuracy comparable to best-performing approaches. Experimental results confirm that our model achieves better performance in terms of both efficiency and accuracy as compared with state-of-the-art models on various trajectory prediction benchmark datasets.

cs.CV