Results 101 to 110 of about 975,970 (227)
Overview of blockchain supported multisignature algorithm for IoV. ABSTRACT The Internet of Vehicles (IoV) has emerged as a promising application capable of enhancing transportation efficiency and providing a variety of mobile services to drivers. This IoV enables real‐time data sharing among vehicles and infrastructure, allowing for better traffic ...
Dushyant Kumar Yadav +3 more
wiley +1 more source
Distance magic circulant graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylwia Cichacz, Dalibor Froncek
openaire +2 more sources
Programmable photonic unitary circuits for light computing
Abstract Unitarity serves as a fundamental concept for characterizing linear and conservative wave phenomena in both classical and quantum systems. Developing platforms that perform unitary operations on light waves in a universal and programmable manner enables the emulation of complex light–matter interactions and the execution of general‐purpose ...
Kyuho Kim +5 more
wiley +1 more source
The eigenvalues and energy of integral circulant graphs [PDF]
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency matrix is circulant. Let $D$ be aset of positive, proper divisors of the integer $n>1$.
Mohsen Mollahajiaghaei
doaj
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs [PDF]
Graphs and ...
Hamamache Kheddouci, Olivier Togni
doaj +1 more source
The relationship between the lung involvement expressed by quantitative computed tomography (CALIPER) and a set of blood parameters related to tissue oxygenation and damage in COVID‐19 patients at hospital admission was evaluated in a retrospective and a prospective study involving 321 and 75, respectively, COVID‐19‐positive patients.
Maria Sofia Bertilacchi +9 more
wiley +1 more source
FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR [PDF]
AbstractA first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group $K \rtimes H$ such that S=aH for some a∈K with 〈aH〉=K, where H is of even order or a is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes.
Thomson, A, Zhou, S
openaire +3 more sources
E74‐like ETS transcription factor 3 expression and regulation in human intervertebral disc
This research unveils, for the first time, the role of ELF3 in intervertebral disc degeneration (IVDD). It sheds light on the intricate interplay between ELF3 expression and the inflammatory as well as degenerative processes inherent to IVDD. Understanding the role of ELF3 in disc pathophysiology may hold potentials in developing therapies aimed at ...
María González‐Rodríguez +12 more
wiley +1 more source
Tensor Truncated Schatten‐p Norm Approximation Tensor Completion Algorithm
We propose a non‐convex surrogate for rank function, tensor truncated Schatten‐p$p$ norm. For two typical tensor recovery problems, we construct two minimization models based on tensor truncated Schatten‐p$p$ norm, namely tensor completion model based on tensor truncated Schatten‐p$p$ norm (TTSP‐TC) and tensor robust principal component analysis model ...
Jianwei Liu +5 more
wiley +1 more source
Enumerating Typical Circulant Covering Projections Onto a Circulant Graph
Summary: Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory [see \textit{S. F. Du, D. Marušič}, and \textit{A. O. Waller}, J. Comb. Theory, Ser. B 74, 276--290 (1998; Zbl 1026.05057), \textit{S. F. Du, J. H. Kwak}, and \textit{M. Y.
Feng, RQ, Kwak, JH, Kwon, YS
openaire +2 more sources

