Results 1 to 10 of about 216,097 (247)
Proceedings of the National Academy of Sciences, 2000 It is shown that for each 0 < λ < 1, the free Araki–Woods factor of type III λ cannot be written as a tensor product of two diffuse von Neumann algebras (i.e., is prime) and does not contain a Cartan subalgebra.
openaire +3 more sources
Amodal completion of partly occluded figures: Effect of contour orientation [PDF]
Psihologija, 2003 In present study the temporal dimension of amodal completion in visual occlusion was investigated. We supposed that the visual system prefers to complete normally (vertically-horizontally) oriented contours than the oblique ones. Using the prime-matching
Marković Slobodan S. +1 more
doaj +1 more source
Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105
Mathematics, 2018 Let G be a finite group. The prime graph Γ ( G ) of G is defined as follows: The set of vertices of Γ ( G ) is the set of prime divisors of | G | and two distinct vertices p and p ′ are connected in &Gamma ...
Hossein Moradi +2 more
doaj +1 more source
Extended supersingular isogeny Diffie–Hellman key exchange protocol: Revenge of the SIDH
IET Information Security, 2021 The supersingular isogeny Diffie–Hellman key exchange protocol (SIDH) was introduced by Jao and De Feo in 2011. SIDH operates on supersingular elliptic curves defined over Fp2, where p is a large prime number of the form p=4eA3eB−1 and eA and eB are ...
Daniel Cervantes‐Vázquez +2 more
doaj +1 more source
RSA algorithm using key generator ESRKGS to encrypt chat messages with TCP/IP protocol
Jurnal Teknologi dan Sistem Komputer, 2020 This study aims to analyze the performance and security of the RSA algorithm in combination with the key generation method of enhanced and secured RSA key generation scheme (ESRKGS).
Aminudin Aminudin +2 more
doaj +1 more source
Quasirecognition by prime graph of finite simple groups ${}^2D_n(3)$ [PDF]
International Journal of Group Theory, 2014 Let $G$ be a finite group. In [Ghasemabadi et al., characterizations of the simple group ${}^2D_n(3)$ by prime graph and spectrum, Monatsh Math., 2011] it is proved that if $n$ is odd, then ${}^2D _n(3)$ is recognizable by prime graph and also by ...
Behrooz Khosravi , Hossein Moradi
doaj
Prime factors of dynamical sequences [PDF]
Journal für die reine und angewandte Mathematik (Crelles Journal), 2011 Corrected several typos and a non-critical error in Lemma 5. No change to the statements of the main theorems.
Faber, Xander, Granville, Andrew
openaire +2 more sources
Quantifying rhythmicity in perceptual reports
NeuroImage, 2022 Several recent studies investigated the rhythmic nature of cognitive processes that lead to perception and behavioral report. These studies used different methods, and there has not yet been an agreement on a general standard.
Tommaso Tosato +3 more
doaj +1 more source
Verifying Sierpiński and Riesel Numbers in ACL2 [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 A Sierpinski number is an odd positive integer, k, such that no positive integer of the form k * 2^n + 1 is prime. Similar to a Sierpinski number, a Riesel number is an odd positive integer, k, such that no positive integer of the form k * 2^n + 1 is ...
John R. Cowles, Ruben Gamboa
doaj +1 more source
Quantum Annealing for Prime Factorization [PDF]
Scientific Reports, 2018 AbstractWe have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function then transforming the k-bit coupling (k ≥ 3) terms to quadratic terms using ancillary variables. Our resource-efficient method uses $${\mathscr{O}}({\mathrm{log}}^{2}(N))$$
Shuxian Jiang +4 more
openaire +3 more sources