Guiying Yan
YOU?
Author Swipe
View article: ADMGCN: Graph Convolutional Network for Alzheimer’s Disease Diagnosis with a Meta-learning Paradigm
ADMGCN: Graph Convolutional Network for Alzheimer’s Disease Diagnosis with a Meta-learning Paradigm Open
Motivation Alzheimer’s disease (AD) is a neurodegenerative disorder characterized by memory loss and cognitive decline. While graph convolutional networks (GCNs) have emerged as popular tools for AD diagnosis due to their ability to handle…
View article: Downsizing Diffusion Models for Cardinality Estimation
Downsizing Diffusion Models for Cardinality Estimation Open
Inspired by the performance of score-based diffusion models in estimating complex text, video, and image distributions with thousands of dimensions, we introduce Accelerated Diffusion Cardest (ADC), the first joint distribution cardinality…
View article: HOI-Brain: a novel multi-channel transformers framework for brain disorder diagnosis by accurately extracting signed higher-order interactions from fMRI
HOI-Brain: a novel multi-channel transformers framework for brain disorder diagnosis by accurately extracting signed higher-order interactions from fMRI Open
Accurately characterizing higher-order interactions of brain regions and extracting interpretable organizational patterns from Functional Magnetic Resonance Imaging data is crucial for brain disease diagnosis. Current graph-based deep lear…
View article: Planar Turán number of disjoint union of $C_3$ and $C_5$
Planar Turán number of disjoint union of $C_3$ and $C_5$ Open
The planar Turán number of $H$, denoted by $ex_{\mathcal{P}}(n,H)$, is the maximum number of edges in an $n$-vertex $H$-free planar graph. The planar Turán number of $k\geq 3$ vertex-disjoint union of cycles is the trivial value $3n-6$. Le…
View article: High Throughput QC-LDPC Decoder With Optimized Schedule Policy in Layered Decoding
High Throughput QC-LDPC Decoder With Optimized Schedule Policy in Layered Decoding Open
In this study, a scheduling policy of layered decoding for quasi-cycle (QC) low-density parity-check (LDPC) codes with high throughput and good performance is designed. The influence of scheduling on the delay of the decoder's hardware imp…
View article: Predicting drug combination side effects based on a metapath-based heterogeneous graph neural network
Predicting drug combination side effects based on a metapath-based heterogeneous graph neural network Open
In recent years, combined drug screening has played a very important role in modern drug discovery. Generally, synergistic drug combinations are crucial in treatment for many diseases. However, the toxic side effects of drug combinations a…
View article: Performance Analysis of Perturbation-Enhanced SC Decoders
Performance Analysis of Perturbation-Enhanced SC Decoders Open
In this paper, we analyze the delay probability of the first error position\nin perturbation-enhanced Successive cancellation (SC) decoding for polar codes.\nOur findings reveal that, asymptotically, an SC decoder's performance does not\nd…
View article: On the lifting degree of girth-8 QC-LDPC codes
On the lifting degree of girth-8 QC-LDPC codes Open
The lifting degree and the deterministic construction of quasi-cyclic low-density parity-check (QC-LDPC) codes have been extensively studied, with many construction methods in the literature, including those based on finite geometry, array…
View article: Partial Orders in Rate-Matched Polar Codes
Partial Orders in Rate-Matched Polar Codes Open
In this paper, we establish the partial order (POs) for both the binary erasure channel (BEC) and the binary memoryless symmetric channel (BMSC) under any block rate-matched polar codes. Firstly, we define the POs in the sense of rate-matc…
View article: On the Weight Spectrum of Rate-Compatible Polar Codes
On the Weight Spectrum of Rate-Compatible Polar Codes Open
The weight spectrum plays a crucial role in the performance of error-correcting codes. Despite substantial theoretical exploration of polar codes with mother code length, a framework for the weight spectrum of rate-compatible polar codes r…
View article: A Method to Reduce the Complexity of Computing the Complete Weight Distribution of Polar Codes
A Method to Reduce the Complexity of Computing the Complete Weight Distribution of Polar Codes Open
The code spectrum of polar codes is crucial to the performance of polar codes. Based on the lower-triangular affine group (LTA) of decreasing monomial codes and the one-variable descendance (ovd) relation, we define a new subgroup of LTA w…
View article: On automorphism groups of polar codes
On automorphism groups of polar codes Open
Over the past years, Polar codes have arisen as a highly effective class of linear codes, equipped with a decoding algorithm of low computational complexity. This family of codes share a common algebraic formalism with the well-known Reed-…
View article: Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs
Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs Open
For a fixed family of $r$-uniform hypergraphs $\mathcal{F}$, the anti-Ramsey number of $\mathcal{F}$, denoted by $ ar(n,r,\mathcal{F})$, is the minimum number $c$ of colors such that for any edge-coloring of the complete $r$-uniform hyperg…
View article: Achievability Bounds on Unequal Error Protection Codes
Achievability Bounds on Unequal Error Protection Codes Open
Unequal error protection (UEP) codes can facilitate the transmission of messages with different protection levels. In this paper, we study the achievability bounds on UEP by the generalization of Gilbert-Varshamov (GV) bound. For the first…
View article: Second-Order Identification Capacity of AWGN Channels
Second-Order Identification Capacity of AWGN Channels Open
In this paper, we establish the second-order randomized identification capacity (RID capacity) of the Additive White Gaussian Noise Channel (AWGNC). On the one hand, we obtain a refined version of Hayashi's theorem to prove the achievabili…
View article: New Partial Orders of Polar Codes for BMSC
New Partial Orders of Polar Codes for BMSC Open
In this paper, we define partial orders (POs) of polar codes based on the Bhattacharyya parameter and the bit-error probability, respectively. These POs are applicable to arbitrary binary memoryless symmetric channel (BMSC). Leveraging the…
View article: On the Performance of Low-complexity Decoders of LDPC Codes
On the Performance of Low-complexity Decoders of LDPC Codes Open
Efficient decoding is crucial to high-throughput and power-sensitive wireless communication scenarios. A theoretical analysis of the performance-complexity tradeoff toward low-complexity decoding is required for a better understanding of t…
View article: Mental states in caregivers toward people with Alzheimer’s disease at different stages
Mental states in caregivers toward people with Alzheimer’s disease at different stages Open
Introduction Caring for people with Alzheimer’s disease (AD) is burdensome, especially when family members act as caregivers. This multicenter survey first aimed to investigate caregivers’ mental states as well as its influencing factors i…
View article: On the Weight Distribution of Weights Less than $2w_{\min}$ in Polar Codes
On the Weight Distribution of Weights Less than $2w_{\min}$ in Polar Codes Open
The number of low-weight codewords is critical to the performance of error-correcting codes. In 1970, Kasami and Tokura characterized the codewords of Reed-Muller (RM) codes whose weights are less than $2w_{\min}$, where $w_{\min}$ represe…
View article: On the Weight Spectrum Improvement of Pre-transformed Reed-Muller Codes and Polar Codes
On the Weight Spectrum Improvement of Pre-transformed Reed-Muller Codes and Polar Codes Open
Pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and polarization-adjusted convolutional (PAC) codes) improves the weight spectrum of Reed-Muller (RM) codes and polar codes sign…
View article: Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods
Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods Open
Elementary trapping sets (ETSs) are the main culprits for the performance of LDPC codes in the error floor region. Due to the large quantity, complex structures, and computational difficulties of ETSs, how to eliminate dominant ETSs in des…
View article: Predicting Brain Regions Related to Alzheimer's Disease Based on Global Feature
Predicting Brain Regions Related to Alzheimer's Disease Based on Global Feature Open
Alzheimer's disease (AD) is a neurodegenerative disease that commonly affects the elderly; early diagnosis and timely treatment are very important to delay the course of the disease. In the past, most brain regions related to AD were ident…
View article: Temporal gravity model for important node identification in temporal networks
Temporal gravity model for important node identification in temporal networks Open
View article: Improving the Gilbert-Varshamov Bound by Graph Spectral Method
Improving the Gilbert-Varshamov Bound by Graph Spectral Method Open
We improve Gilbert-Varshamov bound by graph spectral method. Gilbert graph $G_{q,n,d}$ is a graph with all vectors in $\mathbb{F}_q^n$ as vertices where two vertices are adjacent if their Hamming distance is less than $d$. In this paper, w…
View article: The Complete Affine Automorphism Group of Polar Codes
The Complete Affine Automorphism Group of Polar Codes Open
Recently, a permutation-based successive cancellation (PSC) decoding framework for polar codes attaches much attention. It decodes several permuted codewords with independent successive cancellation (SC) decoders. Its latency thus can be r…
View article: IHRW: An Improved Hypergraph Random Walk Model for Predicting Three-Drug Therapy
IHRW: An Improved Hypergraph Random Walk Model for Predicting Three-Drug Therapy Open
Drug combination therapy is a well-established concept in the treatment of complex diseases due to its fewer side effects, lower toxicity, and better efficacy. However, it is challenging to identify efficacious drug combinations from many …
View article: On the Weight Spectrum of Pre-Transformed Polar Codes
On the Weight Spectrum of Pre-Transformed Polar Codes Open
Polar codes are the first class of channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels with efficient encoding and decoding algorithms. But the weight spectrum of Polar codes is relatively poor c…
View article: Predicting Brain Regions Related to Alzheimer’s Disease Based on Global Feature
Predicting Brain Regions Related to Alzheimer’s Disease Based on Global Feature Open
Alzheimer’s disease (AD) is a common neurodegenerative disease in the elderly, early diagnosis and timely treatment are very important to delay the course of the disease. In the past, most of the brain regions related to AD were identified…
View article: Cut Bounds for Some Weighted Graphs
Cut Bounds for Some Weighted Graphs Open
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which minimi…
View article: RWRDC: Predicting Efficacious Drug Combinations in Cancer Based on Random Walk with Restart
RWRDC: Predicting Efficacious Drug Combinations in Cancer Based on Random Walk with Restart Open
(1) Background Compared with monotherapy, efficacious drug combinations can increase the therapeutic effect, decrease drug resistance of experimental subjects and the side effects of drugs. Therefore, efficacious drug combinations are wide…