arXiv subjects

Jingjing Xiao

Publications and source records attributed to Jingjing Xiao.

8 recordsLinked to original sources

arXiv2026

LV-CARE-Diff: A Conditional Anatomy-Aware Diffusion Model for Left Ventricular Shape Reconstruction and Function Quantification from Ultra-Sparse Cine Slices

Left ventricular functional quantification is an essential examination and is routinely performed using cardiovascular magnetic resonance (CMR) cine imaging. However, conventional CMR cine protocols require the acquisition of multiple short-axis (SAX) slices to cover the entire left ventricle (LV) along with two long-axis (LAX) slices, which is time-consuming and places a considerable burden on patients who are unable to sustain repeated breath-holds, limiting its suitability for large-scale early screening. In this study, a Conditional Anatomy-Aware Diffusion Model (LV-CARE-Diff) was developed using a coarse-to-fine strategy to reconstruct the complete LV shape from ultra-sparse cine slices, namely three short-axis and two long-axis slices, with the aim of accelerating CMR cine examination. LV-CARE-Diff employs a 3DUNet to generate a coarse initial shape, which is subsequently refined through a residual diffusion model. A condition-guided input incorporating imaging plane orientation and positional metadata was constructed to enable spatial awareness, and a multi-objective training strategy jointly supervising shape, function, and anatomy was incorporated to guide high-fidelity reconstruction. LV-CARE-Diff was compared against a standalone 3DUNet, a standalone diffusion model, and a 3D UNet with diffusion-based refinement. Testing results indicated that complete LV shape could be robustly reconstructed by all deep learning models, with the highest reconstruction performance achieved by the proposed LV-CARE-Diff. Deep learning models reconstructing LV shape from sparse cine slices preserved 96% of functional quantification accuracy while reducing imaging time by 73%. The LV-CARE-Diff framework established in this study enables ultra-sparse cine acquisition to shorten CMR examination duration without sacrificing quantitative functional accuracy.

physics.med-ph↗

arXiv2025

Identifying social bots via heterogeneous motifs based on Naïve Bayes model

Identifying social bots has become a critical challenge due to their significant influence on social media ecosystems. Despite advancements in detection methods, most topology-based approaches insufficiently account for the heterogeneity of neighborhood preferences and lack a systematic theoretical foundation, relying instead on intuition and experience. Here, we propose a theoretical framework for detecting social bots utilizing heterogeneous motifs based on the Naïve Bayes model. Specifically, we refine homogeneous motifs into heterogeneous ones by incorporating node-label information, effectively capturing the heterogeneity of neighborhood preferences. Additionally, we systematically evaluate the contribution of different node pairs within heterogeneous motifs to the likelihood of a node being identified as a social bot. Furthermore, we mathematically quantify the maximum capability of each heterogeneous motif, enabling the estimation of its potential benefits. Comprehensive evaluations on four large, publicly available benchmarks confirm that our method surpasses state-of-the-art techniques, achieving superior performance across five evaluation metrics. Moreover, our results reveal that selecting motifs with the highest capability achieves detection performance comparable to using all heterogeneous motifs. Overall, our framework offers an effective and theoretically grounded solution for social bot detection, significantly enhancing cybersecurity measures in social networks.

cs.CR↗

arXiv2025

Enhanced gradient recovery-based a posteriori error estimator and adaptive finite element method for elliptic equations

Recovery type a posteriori error estimators are popular, particularly in the engineering community, for their computationally inexpensive, easy to implement, and generally asymptotically exactness. Unlike the residual type error estimators, one can not establish upper and lower a posteriori error bounds for the classical recovery type error estimators without the saturation assumption. In this paper, we first present three examples to show the unsatisfactory performance in the practice of standard residual or recovery-type error estimators, then, an improved gradient recovery-based a posteriori error estimator is constructed. The proposed error estimator contains two parts, one is the difference between the direct and post-processed gradient approximations, and the other is the residual of the recovered gradient. The reliability and efficiency of the enhanced estimator are derived. Based on the improved recovery-based error estimator and the newest-vertex bisection refinement method with a tailored mark strategy, an adaptive finite element algorithm is designed. We then prove the convergence of the adaptive method by establishing the contraction of gradient error plus oscillation. Numerical experiments are provided to illustrate the asymptotic exactness of the new recovery-based a posteriori error estimator and the high efficiency of the corresponding adaptive algorithm.

math.NA↗

arXiv2025

High Accuracy Techniques Based Adaptive Finite Element Methods for Elliptic PDEs

This paper aims to develop an efficient adaptive finite element method for the second-order elliptic problem. Although the theory for adaptive finite element methods based on residual-type a posteriori error estimator and bisection refinement has been well established, in practical computations, the use of non-asymptotic exact of error estimator and the excessive number of adaptive iteration steps often lead to inefficiency of the adaptive algorithm. We propose an efficient adaptive finite element method based on high-accuracy techniques including the superconvergence recovery technique and high-quality mesh optimization. The centroidal Voronoi Delaunay triangulation mesh optimization is embedded in the mesh adaption to provide high-quality mesh, and then assure that the superconvergence property of the recovered gradient and the asymptotical exactness of the error estimator. A tailored adaptive strategy, which could generate high-quality meshes with a target number of vertices, is developed to ensure the adaptive computation process terminated within $7$ steps. The effectiveness and robustness of the adaptive algorithm is numerically demonstrated.

math.NA↗

arXiv2022

Cascadable in-memory computing based on symmetric writing and read out

The building block of in-memory computing with spintronic devices is mainly based on the magnetic tunnel junction with perpendicular interfacial anisotropy (p-MTJ). The resulting asymmetric write and read-out operations impose challenges in downscaling and direct cascadability of p-MTJ devices. Here, we propose that a new symmetric write and read-out mechanism can be realized in perpendicular-anisotropy spin-orbit (PASO) quantum materials based on Fe3GeTe2 and WTe2. We demonstrate that field-free and deterministic reversal of the perpendicular magnetization can be achieved by employing unconventional charge to z-spin conversion. The resulting magnetic state can be readily probed with its intrinsic inverse process, i.e., z-spin to charge conversion. Using the PASO quantum material as a fundamental building block, we implement the functionally complete set of logic-in-memory operations and a more complex nonvolatile half-adder logic function. Our work highlights the potential of PASO quantum materials for the development of scalable energy-efficient and ultrafast spintronic computing.

cond-mat.mes-hall↗

arXiv2022

P-ADMMiRNN: Training RNN with Stable Convergence via An Efficient and Paralleled ADMM Approach

It is hard to train Recurrent Neural Network (RNN) with stable convergence and avoid gradient vanishing and exploding problems, as the weights in the recurrent unit are repeated from iteration to iteration. Moreover, RNN is sensitive to the initialization of weights and bias, which brings difficulties in training. The Alternating Direction Method of Multipliers (ADMM) has become a promising algorithm to train neural networks beyond traditional stochastic gradient algorithms with the gradient-free features and immunity to unsatisfactory conditions. However, ADMM could not be applied to train RNN directly since the state in the recurrent unit is repetitively updated over timesteps. Therefore, this work builds a new framework named ADMMiRNN upon the unfolded form of RNN to address the above challenges simultaneously. We also provide novel update rules and theoretical convergence analysis. We explicitly specify essential update rules in the iterations of ADMMiRNN with constructed approximation techniques and solutions to each sub-problem instead of vanilla ADMM. Numerical experiments are conducted on MNIST, IMDb, and text classification tasks. ADMMiRNN achieves convergent results and outperforms the compared baselines. Furthermore, ADMMiRNN trains RNN more stably without gradient vanishing or exploding than stochastic gradient algorithms. We also provide a distributed paralleled algorithm regarding ADMMiRNN, named P-ADMMiRNN, including Synchronous Parallel ADMMiRNN (SP-ADMMiRNN) and Asynchronous Parallel ADMMiRNN (AP-ADMMiRNN), which is the first to train RNN with ADMM in an asynchronous parallel manner. The source code is publicly available.

cs.LG↗

arXiv2019

Structural stability of Supersonic solutions to the Euler-Poisson system

The well-posedness for the supersonic solutions of the Euler-Poisson system for hydrodynamical model in semiconductor devices and plasmas is studied in this paper. We first reformulate the Euler-Poisson system in the supersonic region into a second order hyperbolic-elliptic coupled system together with several transport equations. One of the key ingredients of the analysis is to obtain the well-posedness of the boundary value problem for the associated linearized hyperbolic-elliptic coupled system, which is achieved via a delicate choice of multiplier to gain energy estimate. The nonlinear structural stability of supersonic solution in the general situation is established by combining the iteration method with the estimate for hyperbolic-elliptic system and the transport equations together.

math.AP↗

arXiv2016

Semantic tracking: Single-target tracking with inter-supervised convolutional networks

This article presents a semantic tracker which simultaneously tracks a single target and recognises its category. In general, it is hard to design a tracking model suitable for all object categories, e.g., a rigid tracker for a car is not suitable for a deformable gymnast. Category-based trackers usually achieve superior tracking performance for the objects of that specific category, but have difficulties being generalised. Therefore, we propose a novel unified robust tracking framework which explicitly encodes both generic features and category-based features. The tracker consists of a shared convolutional network (NetS), which feeds into two parallel networks, NetC for classification and NetT for tracking. NetS is pre-trained on ImageNet to serve as a generic feature extractor across the different object categories for NetC and NetT. NetC utilises those features within fully connected layers to classify the object category. NetT has multiple branches, corresponding to multiple categories, to distinguish the tracked object from the background. Since each branch in NetT is trained by the videos of a specific category or groups of similar categories, NetT encodes category-based features for tracking. During online tracking, NetC and NetT jointly determine the target regions with the right category and foreground labels for target estimation. To improve the robustness and precision, NetC and NetT inter-supervise each other and trigger network adaptation when their outputs are ambiguous for the same image regions (i.e., when the category label contradicts the foreground/background classification). We have compared the performance of our tracker to other state-of-the-art trackers on a large-scale tracking benchmark (100 sequences)---the obtained results demonstrate the effectiveness of our proposed tracker as it outperformed other 38 state-of-the-art tracking algorithms.

cs.CV↗