Searcharxiv⌕ Search

arXiv subjects

Tao Zhou

Publications and source records attributed to Tao Zhou.

At least 91 records · Page 5Linked to original sources

Bidirectional Channel-selective Semantic Interaction for Semi-Supervised Medical Segmentation

Semi-supervised medical image segmentation is an effective method for addressing scenarios with limited labeled data. Existing methods mainly rely on frameworks such as mean teacher and dual-stream consistency learning. These approaches often face issues like error accumulation and model structural complexity, while also neglecting the interaction between labeled and unlabeled data streams. To overcome these challenges, we propose a Bidirectional Channel-selective Semantic Interaction~(BCSI) framework for semi-supervised medical image segmentation. First, we propose a Semantic-Spatial Perturbation~(SSP) mechanism, which disturbs the data using two strong augmentation operations and leverages unsupervised learning with pseudo-labels from weak augmentations. Additionally, we employ consistency on the predictions from the two strong augmentations to further improve model stability and robustness. Second, to reduce noise during the interaction between labeled and unlabeled data, we propose a Channel-selective Router~(CR) component, which dynamically selects the most relevant channels for information exchange. This mechanism ensures that only highly relevant features are activated, minimizing unnecessary interference. Finally, the Bidirectional Channel-wise Interaction~(BCI) strategy is employed to supplement additional semantic information and enhance the representation of important channels. Experimental results on multiple benchmarking 3D medical datasets demonstrate that the proposed method outperforms existing semi-supervised approaches.

cs.CV↗

A Novel Deep Learning-Based Coarse-to-Fine Frame Synchronization Method for OTFS Systems

Orthogonal time frequency space (OTFS) modulation is a robust candidate waveform for future wireless systems, particularly in high-mobility scenarios, as it effectively mitigates the impact of rapidly time-varying channels by mapping symbols in the delay-Doppler (DD) domain. However, accurate frame synchronization in OTFS systems remains a challenge due to the performance limitations of conventional algorithms. To address this, we propose a low-complexity synchronization method based on a coarse-to-fine deep residual network (ResNet) architecture. Unlike traditional approaches relying on high-overhead preamble structures, our method exploits the intrinsic periodic features of OTFS pilots in the delay-time (DT) domain to formulate synchronization as a hierarchical classification problem. Specifically, the proposed architecture employs a two-stage strategy to first narrow the search space and then pinpoint the precise symbol timing offset (STO), thereby significantly reducing computational complexity while maintaining high estimation accuracy. We construct a comprehensive simulation dataset incorporating diverse channel models and randomized STO to validate the method. Extensive simulation results demonstrate that the proposed method achieves robust signal start detection and superior accuracy compared to conventional benchmarks, particularly in low signal-to-noise ratio (SNR) regimes and high-mobility scenarios.

eess.SP↗

ODIN: Object Density Aware Index for CkNN Queries over Moving Objects on Road Networks

We study the problem of processing continuous k nearest neighbor (CkNN) queries over moving objects on road networks, which is an essential operation in a variety of applications. We are particularly concerned with scenarios where the object densities in different parts of the road network evolve over time as the objects move. Existing methods on CkNN query processing are ill-suited for such scenarios as they utilize index structures with fixed granularities and are thus unable to keep up with the evolving object densities. In this paper, we directly address this problem and propose an object density aware index structure called ODIN that is an elastic tree built on a hierarchical partitioning of the road network. It is equipped with the unique capability of dynamically folding/unfolding its nodes, thereby adapting to varying object densities. We further present the ODIN-KNN-Init and ODIN-KNN-Inc algorithms for the initial identification of the kNNs and the incremental update of query result as objects move. Thorough experiments on both real and synthetic datasets confirm the superiority of our proposal over several baseline methods.

cs.DB↗

Domain matters: Towards domain-informed evaluation for link prediction

Link prediction, a foundational task in complex network analysis, has extensive applications in critical scenarios such as social recommendation, drug target discovery, and knowledge graph completion. However, existing evaluations of algorithmic often rely on experiments conducted on a limited number of networks, assuming consistent performance rankings across domains. Despite the significant disparities in generative mechanisms and semantic contexts, previous studies often improperly highlight ``universally optimal" algorithms based solely on naive average over networks across domains. This paper systematically evaluates 12 mainstream link prediction algorithms across 740 real-world networks spanning seven domains. We present substantial empirical evidence elucidating the performance of algorithms in specific domains. This findings reveal a notably low degree of consistency in inter-domain algorithm rankings, a phenomenon that stands in stark contrast to the high degree of consistency observed within individual domains. Principal Component Analysis shows that response vectors formed by the rankings of the 12 algorithms cluster distinctly by domain in low-dimensional space, thus confirming domain attributes as a pivotal factor affecting algorithm performance. We propose a metric called Winner Score that could identify the superior algorithm in each domain: Non-Negative Matrix Factorization for social networks, Neighborhood Overlap-aware Graph Neural Networks for economics, Graph Convolutional Networks for chemistry, and L3-based Resource Allocation for biology. However, these domain-specific top-performing algorithms tend to exhibit suboptimal performance in other domains. This finding underscores the importance of aligning an algorithm's mechanism with the network structure.

stat.OT↗

Tyee: A Unified, Modular, and Fully-Integrated Configurable Toolkit for Intelligent Physiological Health Care

Deep learning has shown great promise in physiological signal analysis, yet its progress is hindered by heterogeneous data formats, inconsistent preprocessing strategies, fragmented model pipelines, and non-reproducible experimental setups. To address these limitations, we present Tyee, a unified, modular, and fully-integrated configurable toolkit designed for intelligent physiological healthcare. Tyee introduces three key innovations: (1) a unified data interface and configurable preprocessing pipeline for 12 kinds of signal modalities; (2) a modular and extensible architecture enabling flexible integration and rapid prototyping across tasks; and (3) end-to-end workflow configuration, promoting reproducible and scalable experimentation. Tyee demonstrates consistent practical effectiveness and generalizability, outperforming or matching baselines across all evaluated tasks (with state-of-the-art results on 12 of 13 datasets). The Tyee toolkit is released at https://github.com/SmileHnu/Tyee and actively maintained.

cs.AI↗

Contrastive Graph Modeling for Cross-Domain Few-Shot Medical Image Segmentation

Cross-domain few-shot medical image segmentation (CD-FSMIS) offers a promising and data-efficient solution for medical applications where annotations are severely scarce and multimodal analysis is required. However, existing methods typically filter out domain-specific information to improve generalization, which inadvertently limits cross-domain performance and degrades source-domain accuracy. To address this, we present Contrastive Graph Modeling (C-Graph), a framework that leverages the structural consistency of medical images as a reliable domain-transferable prior. We represent image features as graphs, with pixels as nodes and semantic affinities as edges. A Structural Prior Graph (SPG) layer is proposed to capture and transfer target-category node dependencies and enable global structure modeling through explicit node interactions. Building upon SPG layers, we introduce a Subgraph Matching Decoding (SMD) mechanism that exploits semantic relations among nodes to guide prediction. Furthermore, we design a Confusion-minimizing Node Contrast (CNC) loss to mitigate node ambiguity and subgraph heterogeneity by contrastively enhancing node discriminability in the graph space. Our method significantly outperforms prior CD-FSMIS approaches across multiple cross-domain benchmarks, achieving state-of-the-art performance while simultaneously preserving strong segmentation accuracy on the source domain.

cs.CV↗

Overcoming Spectral Bias via Cross-Attention

Spectral bias implies an imbalance in training dynamics, whereby high-frequency components may converge substantially more slowly than low-frequency ones. To alleviate this issue, we propose a cross-attention-based architecture that adaptively reweights a scaled multiscale random Fourier feature bank with learnable scaling factors. The learnable scaling adjusts the amplitudes of the multiscale random Fourier features, while the cross-attention residual structure provides an input-dependent mechanism to emphasize the most informative scales. As a result, the proposed design accelerates high-frequency convergence relative to comparable baselines built on the same multiscale bank. Moreover, the attention module supports incremental spectral enrichment: dominant Fourier modes extracted from intermediate approximations via discrete Fourier analysis can be appended to the feature bank and used in subsequent training, without modifying the backbone architecture. We further extend this framework to PDE learning by introducing a linear combination of two sub-networks: one specialized in capturing high-frequency components of the PDE solution and the other in capturing low-frequency components, with a learnable (or optimally chosen) mixing factor to balance the two contributions and improve training efficiency in oscillatory regimes. Numerical experiments on high-frequency and discontinuous regression problems, image reconstruction tasks, as well as representative PDE examples, demonstrate the effectiveness and robustness of the proposed method.

math.NA↗

Layer-Resolved Impurity States Reveal Competing Pairing Mechanisms in Trilayer Nickelate Superconductor La$_4$Ni$_3$O$_{10}$

Trilayer Ruddlesden-Popper nickelate superconductor $\mathrm{La}_4 \mathrm{Ni}_3 \mathrm{O}_{10}$ has generated considerable interest due to its unconventional superconductivity and complex electronic structure. Notably, $\mathrm{La}_4 \mathrm{Ni}_3 \mathrm{O}_{10}$ features a mixed Ni valence state and an asymmetric trilayer configuration, leading to distinct quasiparticle distributions and local density of states (LDOS) between the inner and outer NiO$_2$ planes. In this work, we investigate impurity-induced states in $\mathrm{La}_4 \mathrm{Ni}_3 \mathrm{O}_{10}$ using a two-orbital model combined with $T$-matrix formalism, focusing on the contrasting roles of intra- and interlayer pairing channels. Our self-consistent mean-field analysis reveals that interlayer pairing results in partially gapless Fermi surfaces, with unpaired quasiparticles concentrated in the outer layers and a pronounced low-energy LDOS. We demonstrate that impurity effects vary significantly depending on both the pairing symmetry and impurity location: interlayer-dominant pairing produces sharp resonance states when impurities are in the inner layer, whereas impurities in the outer layer lead to in-gap enhancements without sharp resonances; in contrast, intralayer-dominant pairing generally yields increased in-gap LDOS without sharp impurity resonances, regardless of impurity position. These findings suggest that single-impurity spectroscopy can serve as a powerful probe to distinguish between competing superconducting pairing mechanisms in trilayer nickelates and highlight the rich physics arising from their multilayer structure.

cond-mat.supr-con↗

Generalized principal eigenvalues of elliptic operators and spreading speeds of Fisher-KPP equations in two-scale almost periodic media

This paper is concerned with the asymptotic behavior of the generalized principal eigenvalues of elliptic operators and spreading speeds of Fisher-KPP equations in two-scale almost periodic media where one scale is fixed and another one approaches zero or infinity. We transform the problem into the homogenization of certain effective Hamiltonian and then establish the asymptotic limits and the convergence rates. Based on the analysis of the asymptotic behavior of effective Hamiltonians, we investigate how the heterogeneity of the advection and growth rates affect on the propagation in the case where the media has very rapid or slow spatial oscillation: We show a normal scale perturbation of the growth rate with mean zero can accelerate the propagation in the media with rapid or slow oscillation; and an advection with slow oscillation and mean zero can decelerate the propagation in 1-D case.

math.AP↗

Ray-Tracing Based Narrow-Beam Channel Simulation, Characterization and Performance Evaluation for 5G-R Systems

This paper investigates narrow-beam channel characterization and performance evaluation for 5G for railway (5G-R) systems based on ray-tracing (RT) simulation. Three representative high-speed railway (HSR) scenarios including viaduct, cutting, and station are established, and RT-based dynamic narrow-beam channel simulations are conducted using a designed beam tracking scheme that ensures continuous alignment with the moving train. The channel characteristics are analyzed in terms of both large-scale and small-scale fading, as well as non-stationarity, providing statistical insights into path loss, shadow fading, fading severity, time-frequency-space dispersion, and stationarity interval. The influence of beamwidth on these channel properties is also examined. Furthermore, the performance of 5G-R systems operating in such narrow-beam channels is evaluated using the Vienna 5G simulator, with a focus on block error rate, throughput, and spectral efficiency. A hardware-in-the-loop simulation platform is developed to further assess synchronization signal reference signal received power, signal-to-interference-plus-noise ratio, and reference signal received quality. The results provide valuable guidance for the design and optimization of 5G-R systems in HSR environments.

eess.SP↗

Language as an Anchor: Preserving Relative Visual Geometry for Domain Incremental Learning

A key challenge in Domain Incremental Learning (DIL) is to continually learn under shifting distributions while preserving knowledge from previous domains. Existing methods face a fundamental dilemma. On one hand, projecting all domains into a single unified visual space leads to inter-domain interference and semantic distortion, as large shifts may vary with not only visual appearance but also underlying semantics. On the other hand, isolating domain-specific parameters causes knowledge fragmentation, creating "knowledge islands" that hamper knowledge reuse and exacerbate forgetting. To address this issue, we propose LAVA (Language-Anchored Visual Alignment), a novel DIL framework that replaces direct feature alignment with relative alignment driven by a text-based reference anchor. LAVA guides the visual representations of each incoming domain to preserve a consistent relative geometry, which is defined by mirroring the pairwise semantic similarities between the class names. This anchored geometric structure acts as a bridge across domains, enabling the retrieval of class-aware prior knowledge and facilitating robust feature aggregation. Extensive experiments on standard DIL benchmarks demonstrate that LAVA achieves significant performance improvements over state-of-the-arts. Code is available at https://github.com/ShuyiGeng/LAVA.

cs.CV↗

Higher-order topological superconductivity in type-II time-reversal-symmetric Weyl semimetals with a hybrid pairing

We employed the self-consistent method on a two-orbital type-II time-reversal-symmetric Weyl semimetal, revealing a hybrid pairing of singlet $s$-wave and triplet $p$-wave. We present a detailed analysis of the normal-state electronic structure and the self-consistent results. Our findings indicate that the selection of hybrid pairings is governed by distinct surface Fermi-arc configurations: specifically, $s$-wave pairing dominates on the bottom surface, while $p$-wave pairing prevails on the top. Furthermore, the emergent superconducting state is a second-order topological superconductors with hinge states in the system. Our results identify type-II time-reversal-invariant Weyl semimetals as a promising intrinsic platform for realizing unconventional and topological superconductivity.

cond-mat.supr-con↗

Revealing the Potential of Learnable Perturbation Ensemble Forecast Model for Tropical Cyclone Prediction

Tropical cyclones (TCs) are highly destructive and inherently uncertain weather systems. Ensemble forecasting helps quantify these uncertainties, yet traditional systems are constrained by high computational costs and limited capability to fully represent atmospheric nonlinearity. FuXi-ENS introduces a learnable perturbation scheme for ensemble generation, representing a novel AI-based forecasting paradigm. Here, we systematically compare FuXi-ENS with ECMWF-ENS using all 90 global TCs in 2018, examining their performance in TC-related physical variables, track and intensity forecasts, and the associated dynamical and thermodynamical fields. FuXi-ENS demonstrates clear advantages in predicting TC-related physical variables, and achieves more accurate track forecasts with reduced ensemble spread, though it still underestimates intensity relative to observations. Further dynamical and thermodynamical analyses reveal that FuXi-ENS better captures large-scale circulation, with moisture turbulent energy more tightly concentrated around the TC warm core, whereas ECMWF-ENS exhibits a more dispersed distribution. These findings highlight the potential of learnable perturbations to improve TC forecasting skill and provide valuable insights for advancing AI-based ensemble prediction of extreme weather events that have significant societal impacts.

cs.LG↗

Deep Learning Based Joint Space-Time-Frequency Domain Channel Prediction for Cell-Free Massive MIMO Systems

The cell-free massive multi-input multi-output (CF-mMIMO) is a promising technology for the six generation (6G) communication systems. Channel prediction will play an important role in obtaining the accurate CSI to improve the performance of CF-mMIMO systems. This paper studies a deep learning (DL) based joint space-time-frequency domain channel prediction for CF-mMIMO. Firstly, the prediction problems are formulated, which can output the multi-step prediction results in parallel without error propagation. Then, a novel channel prediction model is proposed, which adds frequency convolution (FreqConv) and space convolution (SpaceConv) layers to Transformer-encoder. It is able to utilize the space-time-frequency correlations and extract the space correlation in the irregular AP deployment. Next, simulated datasets with different sizes of service areas, UE velocities and scenarios are generated, and correlation analysis and cross-validation are used to determine the optimal hyper-parameters. According to the optimized hyper-parameters, the prediction accuracy and computational complexity are evaluated based on simulated datasets. It is indicated that the prediction accuracy of the proposed model is higher than traditional model, and its computational complexity is lower than traditional Transformer model. After that, the impacts of space-time-frequency correlations on prediction accuracy are studied. Finally, realistic datasets in a high-speed train (HST) long-term evolution (LTE) network are collected to verify the prediction accuracy. The verification results demonstrate that it also achieves higher prediction accuracy compared with traditional models in the HST LTE network.

eess.SP↗

Pty-Chi: A PyTorch-based modern ptychographic data analysis package

Ptychography has become an indispensable tool for high-resolution, non-destructive imaging using coherent light sources. The processing of ptychographic data critically depends on robust, efficient, and flexible computational reconstruction software. We introduce Pty-Chi, an open-source ptychographic reconstruction package built on PyTorch that unifies state-of-the-art analytical algorithms with automatic differentiation methods. Pty-Chi provides a comprehensive suite of reconstruction algorithms while supporting advanced experimental parameter corrections such as orthogonal probe relaxation and multislice modeling. Leveraging PyTorch as the computational backend ensures vendor-agnostic GPU acceleration, multi-device parallelization, and seamless access to modern optimizers. An object-oriented, modular design makes Pty-Chi highly extendable, enabling researchers to prototype new imaging models, integrate machine learning approaches, or build entirely new workflows on top of its core components. We demonstrate Pty-Chi's capabilities through challenging case studies that involve limited coherence, low overlap, and unstable illumination during scanning, which highlight its accuracy, versatility, and extensibility. With community-driven development and open contribution, Pty-Chi offers a modern, maintainable platform for advancing computational ptychography and for enabling innovative imaging algorithms at synchrotron facilities and beyond.

physics.optics↗

Predictability of Complex Systems

The study of complex systems has attracted widespread attention from researchers in the fields of natural sciences, social sciences, and engineering. Prediction is one of the central issues in this field. Although most related studies have focused on prediction methods, research on the predictability of complex systems has received increasing attention across disciplines--aiming to provide theories and tools to address a key question: What are the limits of prediction accuracy? Predictability itself can serve as an important feature for characterizing complex systems, and accurate estimation of predictability can provide a benchmark for the study of prediction algorithms. This allows researchers to clearly identify the gap between current prediction accuracy and theoretical limits, thereby helping them determine whether there is still significant room to improve existing algorithms. More importantly, investigating predictability often requires the development of new theories and methods, which can further inspire the design of more effective algorithms. Over the past few decades, this field has undergone significant evolution. In particular, the rapid development of data science has introduced a wealth of data-driven approaches for understanding and quantifying predictability. This review summarizes representative achievements, integrating both data-driven and mechanistic perspectives. After a brief introduction to the significance of the topic in focus, we will explore three core aspects: the predictability of time series, the predictability of network structures, and the predictability of dynamical processes. Finally, we will provide extensive application examples across various fields and outline open challenges for future research.

physics.soc-ph↗

A derivative-free localized stochastic method for very high-dimensional semilinear parabolic PDEs

We develop a mesh-free, derivative-free, matrix-free, and highly parallel localized stochastic method for high-dimensional semilinear parabolic PDEs. The efficiency of the proposed method is built upon four essential components: (i) a martingale formulation of the forward backward stochastic differential equation (FBSDE); (ii) a small scale stochastic particle method for local linear regression (LLR); (iii) a decoupling strategy with a matrix-free solver for the weighted least-squares system used to compute $\nabla u$; (iv) a Newton iteration for solving the univariate nonlinear system in $u$. Unlike traditional deterministic methods that rely on global information, this localized computational scheme not only provides explicit pointwise evaluations of $u$ and $\nabla u$ but, more importantly, is naturally suited for parallelization across particles. In addition, the algorithm avoids the need for spatial meshes and global basis functions required by classical deterministic approaches, as well as the derivative-dependent and lengthy training procedures often encountered in machine learning. More importantly, we rigorously analyze the error bound of the proposed scheme, which is fully explicit in both the particle number $M$ and the time step size $Δt$. Numerical results conducted for problem dimensions ranging from $d=100$ to $d=10000$ consistently verify the efficiency and accuracy of the proposed method. Remarkably, all computations are carried out efficiently on a standard personal computer, without requiring any specialized hardware. These results confirm that the proposed method is built upon a principled design that not only extends the practically solvable range of ultra-high-dimensional PDEs but also maintains rigorous error control and ease of implementation.

math.NA↗

A 28nm Multiply-Accumulate ASIC Architecture for On-Chip Data Compression in MHz Frame Rate X-ray and Electron Pixel Detectors

Modern X-ray detector systems urgently require compact, efficient, and fast data compression schemes to handle the transmission of big data from pixel arrays, enabling frame rates in the MHz regime. In this work, a data compression ASIC that implements a streaming fixed-length lossy compression scheme is introduced and analyzed, proving the feasibility and benefits of on-chip compression. The compression scheme utilizes a vector matrix product logic, which performs a number of floating-point multiplications, additions, and accumulations. The logic is verified, synthesized, and shown to fit in the area resource available for the X-ray detector under study, which comprises 192 x 168 pixels each of 12-bit width, and having a total area of 20 mm x 20 mm, about 2 mm x 20 mm of which are available for the digital logic. Several system architectures, precisions, and compression ratios ranging from 100 to 250 were analyzed to pave the way for on-chip fixed-length compression (e.g., principal component analysis, singular value decomposition) and data reduction (e.g., azimuthal integration) for X-ray and electron detectors.

physics.ins-det↗