A Spatial Filter Temporal Graph Convolutional Network for decoding motor imagery EEG signals
Due to the influence of volume conduction, information redundancy exists between
electrodes in electroencephalogram (EEG) signals, resulting in low spatial resolution …
electrodes in electroencephalogram (EEG) signals, resulting in low spatial resolution …
The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
J Huang, S Li, X Li - Applied mathematics and computation, 2016 - Elsevier
Let B n be a linear polyomino chain with n squares. In this paper, according to the
decomposition theorem of normalized Laplacian polynomial, we obtain that the normalized …
decomposition theorem of normalized Laplacian polynomial, we obtain that the normalized …
Kirchhoff index, multiplicative degree‐Kirchhoff index and spanning trees of the linear crossed hexagonal chains
Y Pan, J Li - International journal of quantum chemistry, 2018 - Wiley Online Library
Let Hn be a linear crossed hexagonal chain with n crossed hexagonals. In this article, we
find that the Laplacian (resp. normalized Laplacian) spectrum of Hn consists of the …
find that the Laplacian (resp. normalized Laplacian) spectrum of Hn consists of the …
[PDF][PDF] On the Kirchhoff index and the number of spanning trees of linear phenylenes
YJ Peng, SC Li - MATCH Commun. Math. Comput. Chem, 2017 - match.pmf.kg.ac.rs
Let Ln be the molecular graph of linear [n] phenylene, and Ln the graph obtained by
attaching 4-membered cycles to the terminal hexagons of Ln− 1. Thus, Ln is the molecular …
attaching 4-membered cycles to the terminal hexagons of Ln− 1. Thus, Ln is the molecular …
Adrml: anticancer drug response prediction using manifold learning
F Ahmadi Moughari, C Eslahchi - Scientific reports, 2020 - nature.com
One of the prominent challenges in precision medicine is to select the most appropriate
treatment strategy for each patient based on the personalized information. The availability of …
treatment strategy for each patient based on the personalized information. The availability of …
Scale-free loopy structure is resistant to noise in consensus dynamics in complex networks
The vast majority of real-world networks are scale-free, loopy, and sparse, with a power-law
degree distribution and a constant average degree. In this paper, we study first-order …
degree distribution and a constant average degree. In this paper, we study first-order …
[HTML][HTML] Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
C He, S Li, W Luo, L Sun - Journal of computational and applied …, 2018 - Elsevier
Let W n be a linear pentagonal chain with 2 n pentagons. In this article, according to the
decomposition theorem for the normalized Laplacian polynomial of W n, we obtain that the …
decomposition theorem for the normalized Laplacian polynomial of W n, we obtain that the …
A computational method for drug sensitivity prediction of cancer cell lines based on various molecular information
F Ahmadi Moughari, C Eslahchi - PloS one, 2021 - journals.plos.org
Determining sensitive drugs for a patient is one of the most critical problems in precision
medicine. Using genomic profiles of the tumor and drug information can help in tailoring the …
medicine. Using genomic profiles of the tumor and drug information can help in tailoring the …
On normalized Laplacians, multiplicative degree‐Kirchhoff indices, and spanning trees of the linear [n]phenylenes and their dicyclobutadieno derivatives
S Li, W Wei, S Yu - International journal of quantum chemistry, 2019 - Wiley Online Library
Let be the molecular graph of the linear [n] phenylene with n hexagons and n− 1 squares,
and let be the graph obtained by attaching four‐membered rings to the terminal hexagons …
and let be the graph obtained by attaching four‐membered rings to the terminal hexagons …
The normalized Laplacian spectrum of quadrilateral graphs and its applications
D Li, Y Hou - Applied Mathematics and Computation, 2017 - Elsevier
The quadrilateral graph Q (G) of G is obtained from G by replacing each edge in G with two
parallel paths of lengths 1 and 3. In this paper, we completely describe the normalized …
parallel paths of lengths 1 and 3. In this paper, we completely describe the normalized …