Results 21 to 30 of about 124,825 (308)
A connectome-based comparison of diffusion MRI schemes. [PDF]
Diffusion MRI has evolved towards an important clinical diagnostic and research tool. Though clinical routine is using mainly diffusion weighted and tensor imaging approaches, Q-ball imaging and diffusion spectrum imaging techniques have become more ...
Xavier Gigandet +9 more
doaj +1 more source
Association schemes and hypergroups [PDF]
Section 6 is removed and the preprint is reduced to its essentials.
openaire +2 more sources
Secure Privacy-Preserving Association Rule Mining With Single Cloud Server
To preserve the privacy of data uploaded on the cloud, it is widely accepted to encrypt the data before uploading it. This leads to the challenge of data analysis, especially association rule mining while protecting data privacy. As one of the solutions,
Zhiyong Hong +6 more
doaj +1 more source
Commutative association schemes
Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments. Since that point of inception, the concept has proved useful in the study of group actions, in algebraic graph theory, in algebraic coding theory, and in areas as far afield as knot theory and numerical integration.
William J. Martin, Hajime Tanaka 0001
openaire +3 more sources
On p-covalenced association schemes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mitsugu Hirasaka, Kyoung-Tark Kim
openaire +1 more source
On association schemes with commutative thin thin residue [PDF]
The main result of this paper gives a characterization of association schemes having commutative thin thin residue. This gives a generalization of Ito's Theorem on finite groups for association schemes.
Javad Bagherian
doaj
On the Uniqueness of the Triangular Association Scheme [PDF]
Connor [3] has shown that the relations among the parameters of the triangular association scheme themselves imply the scheme if $n \geqq 9$. This result was shown by Shrikhande [6] to hold also if $n \leqq 6$. (The problem has no meaning for $n < 4$.) This paper shows that the result holds if $n = 7$, but that it is false if $n = 8$.
openaire +2 more sources
On Quasi-thin Association Schemes
An association scheme is called quasi-thin if each of its basic relations has valency 1 or 2. In this paper three sufficient conditions for a quasi-thin scheme \((X,R)\) to have an automorphism group acting transitively on \(X\) are obtained: (i) \(O^\theta(R)\cap O_\theta(R)=\{1\}\) (Lemma 4.1), (ii) \(n_{O^\theta(R)}=2\) (Theorem 4.4), and (iii) \(R\)
Mitsugu Hirasaka, Mikhail E. Muzychuk
openaire +1 more source
Uniform Mixing and Association Schemes
We consider continuous-time quantum walks on distance-regular graphs. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing.First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform ...
Chris D. Godsil +2 more
openaire +3 more sources
Modular adjacency algebras of dual polar schemes
We can define the adjacency algebra of an association scheme over an arbitrary field. It is not always semisimple over a field of positive characteristic.
Shimabukuro, Osamu
core +1 more source

