arXiv subjects

Yucong Li

Publications and source records attributed to Yucong Li.

8 recordsLinked to original sources

arXiv2026

COCONUT: A coronal model with an energy decomposition strategy

In this paper, we propose an energy decomposition method combined with an HLL Riemann solver that includes an additional dissipation term in the energy equation to improve the numerical stability of the fully implicit, time-evolving coronal model COCONUT and extend its applicability to solar-maximum phases. In MHD simulations that evolve conservative variables in time, the thermal pressure is typically computed by subtracting the magnetic and kinetic energies from the total energy. In low-beta (the ratio of thermal to magnetic pressure; $< 10^{-3}$) regions, discretization errors of magnetic energy can be comparable to the thermal pressure, potentially leading to negative thermal pressure and causing the simulation to crash. Therefore, we update the decomposed energy, excluding the magnetic energy, at each time step. It avoids subtracting a large magnetic energy from the total energy to obtain a very small thermal pressure in low-$β$ regions, thereby improving the numerical stability of MHD models. We validate the algorithm using a time-evolving solar-maximum Carrington rotation simulation in 2025, which the previous code failed to run to completion. We also perform quasi-steady-state coronal simulations and 2D benchmark tests to further assess the algorithm's performance. The simulation results show that the algorithm produces results nearly identical to those obtained using the traditional full energy equation during solar minimum, while significantly improving COCONUT's ability to simulate coronal evolution under strong magnetic fields, even including fields exceeding 100 Gauss with $β<10^{-3}$. This method provides a promising approach for performing quasi-realistic coronal simulations during solar maxima.

astro-ph.SR↗

arXiv2026

Time-evolving coronal modelling of the solar maximum around the solar storms in May 2024 by COCONUT

Time-evolving MHD coronal models deliver more realistic results than traditional quasi-steady-state models. The fully implicit time-evolving coronal model COCONUT performs efficiently enough for real-time coronal simulations during solar minimum. However, during solar maxima, the coronal magnetic field is more complex and stronger, and coronal structures evolve more rapidly than during solar minima. Time-evolving MHD coronal modelling of solar maxima often struggles with poor numerical stability and low computational efficiency. We enhanced the numerical stability of the time-evolving coronal model COCONUT to mitigate these issues with the aim to evaluate the differences between the time-evolving and quasi-steady-state coronal simulation results, and to assess the impact of the spatial resolution on global MHD coronal modelling of solar maxima. After enhancing the positivity-preserving property of COCONUT, we employed it to simulate the evolution of coronal structures within 0.1 AU in an inertial coordinate system over two CRs around the solar storms in May 2024. These simulations were performed on unstructured geodesic meshes containing 6.06, 1.52, and 0.38 M cells. We also conducted a quasi-steady-state coronal simulation that treated the solar surface as a rigidly rotating spherical shell. A comparison with observations further validated the reliability of the time-evolving coronal modelling technique. It shows that incorporating the evolution of the magnetic field on the solar surface can significantly improve the fidelity of global MHD coronal simulations around a solar maximum. A simulated magnetic field strength using a mesh with 6.06 M cells can be stronger by more than 40% than that in a mesh with 0.38 M cells. The fully implicit time-evolving model COCONUT shows promise for accurately conducting real-time global coronal simulations of solar maxima.

astro-ph.SR↗

arXiv2025

SIP-IFVM: An observation-based magnetohydrodynamic model of coronal mass ejection

Currently, achieving a balance between computational efficiency, accuracy, and numerical stability in CME simulations, particularly in the sub-Alfv{'e}nic coronal region, remains a significant challenge. This paper aims to address the challenge by integrating observational data and developing advanced numerical algorithms, focusing on reproducing large-scale CME evolutions that are consistent with observations in the coronal region. Based on the recently developed fully implicit thermodynamic MHD coronal model (Wang et al. 2025a), we further use an observation-based RBSL flux rope to trigger a CME event during CR 2111. Additionally, we improve the temporal accuracy using a 2nd-order accurate ESDIRK2 method, with the intermediate stage solutions computed by the 2nd-order accurate BDF2 pseudo-time marching method. To enhance the numerical stability of ESDIRK2, we apply approximate linearisation in the implicitly solved intermediate stages. Furthermore, we adjust the time-evolving magnetic field B1 to zero at the end of each physical time step to further validate the extended magnetic field decomposition approach proposed by (Wang et al. 2025a). It is noticed that the model successfully reproduces the CME evolution consistent with white-light coronagraph observations, enables faster-than-real-time CME propagation simulations from solar surface to 0.1 AU using only a few dozen CPU cores on approximately 1 million grid cells, and remains numerically stable in CME simulations involving low-\b{eta} regions. The simulation results show that this novel MHD coronal model, combined with an observation-based magnetic flux rope, is sufficiently numerically stable and computationally efficient to reproduce real CME events propagating through the sub-Alfv{é}nic coronal region. Thus, the observation-based CME model is well suited for practical applications in daily space weather forecasting.

astro-ph.SR↗

arXiv2025

Exploration on Real World Assets and Tokenization

This study delves into the tokenization of real-world assets (RWAs) on the blockchain with the objective of augmenting liquidity and refining asset management practices. By conducting an exhaustive analysis of the technical procedures implicated and scrutinizing case studies of existing deployments, this research evaluates the advantages, hurdles, and prospective advancements of blockchain technology in reshaping conventional asset management paradigms.

cs.CR↗

arXiv2025

SIP-IFVM: A time-evolving coronal model with an extended magnetic field decomposition strategy

Time-evolving magnetohydrodynamic (MHD) coronal modeling, driven by a series of time-dependent photospheric magnetograms, represents a new generation of coronal simulations. This approach offers greater realism compared to traditional coronal models constrained by a static magnetogram. However, its practical application is seriously limited by low computational efficiency and poor numerical stability. Therefore, we propose an extended magnetic field decomposition strategy and implement it in the implicit MHD model to develop a coronal model that is both efficient and numerically stable enough for simulating the long-term evolutions of the global corona. The traditional decomposition strategies split the magnetic field into a time-invariant potential field and a time-dependent component $\mathbf{B}_1$. It works well for quasi-steady-state coronal simulations where $\left|\mathbf{B}_1\right|$ is typically small. However, as the inner-boundary magnetic field evolves, $\left|\mathbf{B}_1\right|$ can grow significantly larger and its discretization errors often lead to nonphysical negative thermal pressure, ultimately causing the code to crash. In this paper, we mitigate such undesired situations by introducing a temporally piecewise-constant variable to accommodate part of the non-potential field and remain $\left|\mathbf{B}_1\right|$ consistently small throughout the simulations. We incorporate this novel magnetic field decomposition strategy into our implicit MHD coronal model and apply it to simulate the evolution of coronal structures within 0.1 AU over two solar-maximum Carrington rotations. The results show that this coronal model effectively captures observations and performs more than 80 times faster than real time using only 192 CPU cores, making it well-suited for practical applications in simulating the time-evolving corona.

astro-ph.SR↗

arXiv2024

Exploiting Low-level Representations for Ultra-Fast Road Segmentation

Achieving real-time and accuracy on embedded platforms has always been the pursuit of road segmentation methods. To this end, they have proposed many lightweight networks. However, they ignore the fact that roads are "stuff" (background or environmental elements) rather than "things" (specific identifiable objects), which inspires us to explore the feasibility of representing roads with low-level instead of high-level features. Surprisingly, we find that the primary stage of mainstream network models is sufficient to represent most pixels of the road for segmentation. Motivated by this, we propose a Low-level Feature Dominated Road Segmentation network (LFD-RoadSeg). Specifically, LFD-RoadSeg employs a bilateral structure. The spatial detail branch is firstly designed to extract low-level feature representation for the road by the first stage of ResNet-18. To suppress texture-less regions mistaken as the road in the low-level feature, the context semantic branch is then designed to extract the context feature in a fast manner. To this end, in the second branch, we asymmetrically downsample the input image and design an aggregation module to achieve comparable receptive fields to the third stage of ResNet-18 but with less time consumption. Finally, to segment the road from the low-level feature, a selective fusion module is proposed to calculate pixel-wise attention between the low-level representation and context feature, and suppress the non-road low-level response by this attention. On KITTI-Road, LFD-RoadSeg achieves a maximum F1-measure (MaxF) of 95.21% and an average precision of 93.71%, while reaching 238 FPS on a single TITAN Xp and 54 FPS on a Jetson TX2, all with a compact model size of just 936k parameters. The source code is available at https://github.com/zhouhuan-hust/LFD-RoadSeg.

cs.CV↗

arXiv2022

Fully Self-Supervised Learning for Semantic Segmentation

In this work, we present a fully self-supervised framework for semantic segmentation(FS^4). A fully bootstrapped strategy for semantic segmentation, which saves efforts for the huge amount of annotation, is crucial for building customized models from end-to-end for open-world domains. This application is eagerly needed in realistic scenarios. Even though recent self-supervised semantic segmentation methods have gained great progress, these works however heavily depend on the fully-supervised pretrained model and make it impossible a fully self-supervised pipeline. To solve this problem, we proposed a bootstrapped training scheme for semantic segmentation, which fully leveraged the global semantic knowledge for self-supervision with our proposed PGG strategy and CAE module. In particular, we perform pixel clustering and assignments for segmentation supervision. Preventing it from clustering a mess, we proposed 1) a pyramid-global-guided (PGG) training strategy to supervise the learning with pyramid image/patch-level pseudo labels, which are generated by grouping the unsupervised features. The stable global and pyramid semantic pseudo labels can prevent the segmentation from learning too many clutter regions or degrading to one background region; 2) in addition, we proposed context-aware embedding (CAE) module to generate global feature embedding in view of its neighbors close both in space and appearance in a non-trivial way. We evaluate our method on the large-scale COCO-Stuff dataset and achieved 7.19 mIoU improvements on both things and stuff objects

cs.CV↗

arXiv2021

Maximize the Exploration of Congeneric Semantics for Weakly Supervised Semantic Segmentation

With the increase in the number of image data and the lack of corresponding labels, weakly supervised learning has drawn a lot of attention recently in computer vision tasks, especially in the fine-grained semantic segmentation problem. To alleviate human efforts from expensive pixel-by-pixel annotations, our method focuses on weakly supervised semantic segmentation (WSSS) with image-level tags, which are much easier to obtain. As a huge gap exists between pixel-level segmentation and image-level labels, how to reflect the image-level semantic information on each pixel is an important question. To explore the congeneric semantic regions from the same class to the maximum, we construct the patch-level graph neural network (P-GNN) based on the self-detected patches from different images that contain the same class labels. Patches can frame the objects as much as possible and include as little background as possible. The graph network that is established with patches as the nodes can maximize the mutual learning of similar objects. We regard the embedding vectors of patches as nodes, and use transformer-based complementary learning module to construct weighted edges according to the embedding similarity between different nodes. Moreover, to better supplement semantic information, we propose soft-complementary loss functions matched with the whole network structure. We conduct experiments on the popular PASCAL VOC 2012 benchmarks, and our model yields state-of-the-art performance.

cs.CV↗