Results 151 to 160 of about 2,499,965 (359)
Commuting Pairs in Quasigroups
Journal of Combinatorial Designs, EarlyView.ABSTRACT A quasigroup is a pair (Q,∗) $(Q,\ast )$, where Q $Q$ is a nonempty set and ∗ $\ast $ is a binary operation on Q $Q$ such that for every (a,b)∈Q2 $(a,b)\in {Q}^{2}$, there exists a unique (x,y)∈Q2 $(x,y)\in {Q}^{2}$ such that a∗x=b=y∗a $a\ast x=b=y\ast a$. Let (Q,∗) $(Q,\ast )$ be a quasigroup. A pair (x,y)∈Q2 $(x,y)\in {Q}^{2}$ is a commuting
Jack Allsop, Ian M. Wanless
wiley +1 more source
An efficient deep learning model for brain tumour detection with privacy preservation
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract Internet of medical things (IoMT) is becoming more prevalent in healthcare applications as a result of current AI advancements, helping to improve our quality of life and ensure a sustainable health system. IoMT systems with cutting‐edge scientific capabilities are capable of detecting, transmitting, learning and reasoning.
Mujeeb Ur Rehman +8 more
wiley +1 more source
Square roots of products of algebraic numbers [PDF]
, 1994 Peter L. Montgomery
openalex +1 more source
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, EarlyView.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
On commutative 𝐶*-algebras in which every element is almost the square of another [PDF]
, 1999 Takeshi Miura
openalex +1 more source
On Bipartite Biregular Large Graphs Derived From Difference Sets
Journal of Graph Theory, EarlyView.ABSTRACT A bipartite graph G = ( V , E ) $G=(V,E)$ with V = V 1 ∪ V 2 $V={V}_{1}\cup {V}_{2}$ is biregular if all the vertices of each stable set, V 1 ${V}_{1}$ and V 2 ${V}_{2}$, have the same degree, r $r$ and s $s$, respectively. This paper studies difference sets derived from both Abelian and non‐Abelian groups.
Gabriela Araujo‐Pardo +3 more
wiley +1 more source
Multi‐view subspace clustering with incomplete graph information
IET Computer Vision, EarlyView., 2022 Abstract The core of multi‐view clustering is how to exploit the shared and specific information of multi‐view data properly. The data missing and incompleteness bring great challenges to multi‐view clustering. In this paper, we propose an innovative multi‐view subspace clustering method with incomplete graph information, so‐called incomplete multiple ...
Xiaxia He +5 more
wiley +1 more source
Periodic commuting squares of finite von Neumann algebras [PDF]
, 1997 Atsushi Sakuramoto
openalex +1 more source
A Dichotomy Theorem for Γ ${\rm{\Gamma }}$‐Switchable H $H$‐Colouring on m $m$‐Edge‐Coloured Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let G $G$ be a graph in which each edge is assigned one of the colours 1,2,…,m $1,2,\ldots ,m$, and let Γ ${\rm{\Gamma }}$ be a subgroup of Sm ${S}_{m}$. The operation of switching at a vertex x $x$ of G $G$ with respect to an element π $\pi $ of Γ ${\rm{\Gamma }}$ permutes the colours of the edges incident with x $x$ according to π $\pi $. We
Richard Brewster +2 more
wiley +1 more source
Cognition–Eye–Brain Connection in Alzheimer's Disease Spectrum Revealed by Multimodal Imaging
Journal of Magnetic Resonance Imaging, EarlyView.ABSTRACT Background The connection between cognition, eye, and brain remains inconclusive in Alzheimer's disease (AD) spectrum disorders. Purpose To explore the relationship between cognitive function, retinal biometrics, and brain alterations in the AD spectrum. Study Type Prospective.
Yan Shi +12 more
wiley +1 more source