20 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Lakehead UniversityCA2 papers
- Nanjing Normal UniversityCN2 papers
- Academy of Mathematics and Systems ScienceCN1 paper
- Beijing University of Chemical TechnologyCN1 paper
- Beijing University of Posts and TelecommunicationsCN1 paper
- Center of Research and Technologic Development in ElectrochemistryMX1 paper
- Central South UniversityCN1 paper
- Centre for Electrochemical TechnologiesES1 paper
- Chinese Academy of SciencesCN1 paper
- Chuzhou UniversityCN1 paper
- Fudan UniversityCN1 paper
- Instituto Politécnico NacionalMX1 paper
13 papers
GDM4MMIMO: Generative Diffusion Models for Massive MIMO Communications
Zhenzhou Jin, Li You, Huibin Zhou +6
Massive multiple-input multiple-output (MIMO) offers significant advantages in spectral and energy efficiencies, positioning it as a cornerstone technology of fifth-generation (5G)…
Revealing the Black Box of Device Search Engine: Scanning Assets, Strategies, and Ethical Consideration
Mengying Wu, Geng Hong, Jinsong Chen +6
In the digital age, device search engines such as Censys and Shodan play crucial roles by scanning the internet to catalog online devices, aiding in the understanding and mitigatio…
Further studies on open well-filtered spaces
Chong Shen, Xiaoyong Xi, Dongsheng Zhao
The open well-filtered spaces were introduced by Shen, Xi, Xu and Zhao to answer the problem whether every core-compact well-filtered space is sober. In the current paper we explor…
Strong convergence rates of an explicit scheme for stochastic Cahn--Hilliard equation with additive noise
Meng Cai, Ruisheng Qi, Xiaojie Wang
In this paper, we propose and analyze an explicit time-stepping scheme for a spatial discretization of stochastic Cahn--Hilliard equation with additive noise. The fully discrete ap…
X(2900) in a chiral quark model
Yue Tan, Jialun Ping
Recently, the LHCb Collaboration reported their observation of the first two fully open-flavor tetraquark states named and with unknown parity. Inspired by…
The visualization of the space probability distribution for a particle moving in a double ring-shaped Coulomb potential
Yuan You, Fa-Lin Lu, Dong-Sheng Sun +2
The analytical solutions to a double ring-shaped Coulomb potential (RSCP) are presented. The visualizations of the space probability distribution (SPD) are illustrated for the two-…
Ring-shaped potential and a class of relevant integrals involved universal associated Legendre polynomials with complicated arguments
Wei Li, Chang-Yuan Chen, Shi-Hai Dong
We find that the solution of the polar angular differential equation can be written as the universal associated Legendre polynomials. Its generating function is applied to obtain a…
New Existence and Nonexistence Results for Strong External Difference Families
Jingjun Bao, Lijun Ji, Ruizhong Wei +1
In this paper, we use character-theoretic techniques to give new nonexistence results for -strong external difference families (SEDFs). We also use cyclotomic classes to…
Distance and distance signless Laplacian spread of connected graphs
Lihua You, Liyong Ren, Guanglong Yu
For a connected graph on vertices, recall that the distance signless Laplacian matrix of is defined to be , where …
A generalization of product construction of multimagic squares
Yong Zhang, Kejun Chen, Wen Li
In this paper, constructions of multimagic squares are investigated. Diagonal Latin squares and Kronecker products are used to get some constructions of multimagic squares. Consequ…
A lower bound of the least signless Laplacian eigenvalue of a graph
Shu-Guang Guo, Yong-Gao Chen, Guanglong Yu
Let be a simple connected graph on vertices and edges. In [Linear Algebra Appl. 435 (2011) 2570-2584], Lima et al. posed the following conjecture on the least eigenvalu…
Distance spectral radius of a tree with given diameter
Guanglong Yu, Shuguang Guo, Mingqing Zhai
For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the tree…
The domination number and the least -eigenvalue
Guanglong Yu, Shu-Guang Guo, Rong Zhang +1
A vertex set of a graph is said to be a dominating set if every vertex of is adjacent to at least a vertex in , and the domination number (,…