Results 71 to 80 of about 13,572 (222)

On the Eigenvalues and Energy of the Seidel and Seidel Laplacian Matrices of Graphs

Discrete Dynamics in Nature and Society
Let SΓ be a Seidel matrix of a graph Γ of order n and let DΓ=diagn−1−2d1,n−1−2d2,…,n−1−2dn be a diagonal matrix with di denoting the degree of a vertex vi in Γ. The Seidel Laplacian matrix of Γ is defined as SLΓ=DΓ−SΓ.
J. Askari, Kinkar Chandra Das, Yilun Shang   +2 more
doaj   +1 more source

Dynamic Synthesis of Multi‐Modal Representations for CITE‐seq Data Integration and Analysis

Advanced Science, EarlyView.
The accurate integration of CITE‐seq modalities faces challenges due to complex RNA‐protein nonlinear interactions and computational inefficiencies. A lightweight framework that adaptively fuses RNA and ADT modalities, and refines them through fine‐grained learning is developed to address this issue.
Yinan Shi, Yanchi Su, Yue Cheng, Ka‐Chun Wong, Yunhe Wang, Xiangtao Li   +5 more
wiley   +1 more source

Some Properties of the Eigenvalues of the Net Laplacian Matrix of a Signed Graph

Discussiones Mathematicae Graph Theory, 2022
Given a signed graph Ġ, let AĠ and DG˙±D_{\dot G}^ \pm denote its standard adjacency matrix and the diagonal matrix of vertex net-degrees, respectively. The net Laplacian matrix of Ġ is defined to be NG˙=DG˙±-AG˙{N_{\dot G}} = D_{\dot G}^ \pm - {A_{\dot
Stanić Zoran
doaj   +1 more source

Deep Learning Prediction of Surface Roughness in Multi‐Stage Microneedle Fabrication: A Long Short‐Term Memory‐Recurrent Neural Network Approach

Advanced Intelligent Discovery, EarlyView.
A sequential deep learning framework is developed to model surface roughness progression in multi‐stage microneedle fabrication. Using real‐world experimental data from 3D printing, molding, and casting stages, an long short‐term memory‐based recurrent neural network captures the cumulative influence of geometric parameters and intermediate outputs ...
Abdollah Ahmadpour, Sara Soltanabadi Farshi, Tuanna Ozcan, Amir Mohammad Ketabchi, Alper Kiraz, Savas Tasoglu   +5 more
wiley   +1 more source

On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs

Journal of New Theory, 2018
We introduce the concept of Path Laplacian Matrix for a graph and explore the eigenvalues of this matrix. The eigenvalues of this matrix are called the path Laplacian eigenvalues of the graph.
Shridhar Chandrakant Patekar, Maruti Mukinda Shikare   +1 more
doaj  

AKG‐VO: Adaptive Keyframe Generation Method for Improving Visual Odometry in Autonomous Vehicles

Advanced Intelligent Systems, EarlyView.
An adaptive keyframe generation method for pose estimation is proposed, incorporating optical flow‐based interframe gap estimation and video frame interpolation techniques. By limiting interframe gaps, meaningful keyframes are generated to enhance tracking reliability.
Donghyun Lee, I Made Putra Arya Winata, Beomsu Cho, Junghyun Oh   +3 more
wiley   +1 more source

On Seidel Laplacian matrix and energy of graphs

Acta Universitatis Sapientiae, Informatica, 2022
Abstract In this work, the Seidel Laplacian spectrum of graphs are determined. Then new bounds are presented for the Seidel Laplacian energy of regular graphs and graphs by using their Seidel Laplacian spectrum and other techniques. Further, the Seidel Laplacian energy of specific graphs are computed.
openaire   +2 more sources

Leveraging Compressed Sensing and Radiomics for Robust Feature Selection for Outcome Prediction in Personalized Ultra‐Fractionated Stereotactic Adaptive Radiotherapy

Advanced Intelligent Systems, EarlyView.
A compressed sensing (CS)‐based feature selection method is proposed to select the most informative elements in the radiomic features extracted from medical images of personalized ultra‐fractionated stereotactic adaptive treatment. The CS‐based approach is able to simplify the feature selection process and enhance the accuracy and robustness of a ...
Yajun Yu, Steve Jiang, Robert Timmerman, Hao Peng   +3 more
wiley   +1 more source

A note on a conjecture for the distance Laplacian matrix

The Electronic Journal of Linear Algebra, 2016
In this note, the graphs of order n having the largest distance Laplacian eigenvalue of multiplicity n −2 are characterized. In particular, it is shown that if the largest eigenvalue of the distance Laplacian matrix of a connected graph G of order n has multiplicity n − 2, then G = S_n or G = K_(p,p), where n = 2p.
Celso M. da Silva, Renata R. Del-Vecchio, Maria Aguieiras A. de Freitas   +2 more
openaire   +2 more sources

Next Generation Modeling of Glioblastoma Progression: Diffusing Through Time and Brain

Annalen der Physik, EarlyView.
Glioblastoma (GBM) is a fatal brain tumor that will inevitably recur following surgical resection. Early mathematical tumor growth models used the reaction‐diffusion equation to describe the proliferation and invasion of tumor spread. However, with increasingly advanced neuroimaging technology, diffusion tensor imaging data has more recently been ...
Francesca M. Cozzi, Yizhou Wan, Swati Jain, Curtis Holliman, Roxanne C. Mayrand, Stephen J. Price   +5 more
wiley   +1 more source