Results 11 to 20 of about 180 (147)

Initialization of metaheuristics: comprehensive review, critical analysis, and research directions

open access: yesInternational Transactions in Operational Research, Volume 30, Issue 6, Page 3361-3397, November 2023., 2023
Abstract Initialization of metaheuristics is a crucial topic that lacks a comprehensive and systematic review of the state of the art. Providing such a review requires in‐depth study and knowledge of the advances and challenges in the broader field of metaheuristics, especially with regard to diversification strategies, in order to assess the proposed ...
Malek Sarhani   +2 more
wiley   +1 more source

The 25th and 26th Mersenne Primes [PDF]

open access: yesMathematics of Computation, 1980
The 25th and 26th Mersenne primes are 2 21701 − 1 {2^{21701}} - 1 and 2 23209 − 1 {2^{23209}} - 1 , respectively.
Noll, Curt, Nickel, Laura
openaire   +1 more source

Partitions of numbers and the algebraic principle of Mersenne, Fermat and even perfect numbers [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
Let ρ be an odd prime greater than or equal to 11. In a previous work, starting from an M-cycle in a finite field 𝔽_ρ, it has been established how the divisors of Mersenne, Fermat and Lehmer numbers arise.
A. M. S. Ramasamy
doaj   +1 more source

Three‐dimensional sector‐wise golden angle–improved k‐space uniformity after electrocardiogram binning

open access: yesMagnetic Resonance in Medicine, Volume 90, Issue 3, Page 1041-1052, September 2023., 2023
Purpose To develop and evaluate a 3D sector‐wise golden‐angle (3D‐SWIG) profile ordering scheme for cardiovascular MR cine imaging that maintains high k‐space uniformity after electrocardiogram (ECG) binning. Method Cardiovascular MR (CMR) was performed at 1.5 T. A balanced SSFP pulse sequence was implemented with a novel 3D‐SWIG radial ordering, where
Alexander Fyrdahl   +5 more
wiley   +1 more source

A New Mersenne Prime [PDF]

open access: yesMathematics of Computation, 1958
Am 8. September 1957 ergab die schwedische Elektronenrechenmaschine BESK (siehe auch nachstehendes Referat Zbl 0082.25602) nach einer Laufzeit von 5h 30m die Zahl \(2^{3217}-1\) als Primzahl. (Nachgeprüft am 12. September.) Sie ist, mit ihren 969 Stellen vollständig mitgeteilt, nunmehr die größe bekannte Primzahl.
openaire   +2 more sources

Development of modified RSA algorithm using fixed mersenne prime numbers for medical ultrasound imaging instrumentation

open access: yesComputer Assisted Surgery, 2019
Purpose: Encryption of patient information has become an important issue in medical ultrasound instrumentation to secure information when images are accessed off-site.
Seung-Hyeok Shin   +2 more
doaj   +1 more source

A framework for cryptographic problems from linear algebra

open access: yesJournal of Mathematical Cryptology, 2020
We introduce a general framework encompassing the main hard problems emerging in lattice-based cryptography, which naturally includes the recently proposed Mersenne prime cryptosystem, but also problems coming from code-based cryptography.
Bootland Carl   +3 more
doaj   +1 more source

Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p-Ary m-Sequence

open access: yesIEEE Access, 2020
LSB (Least Significant Bit) sequences are widely used as the initial inputs in some modern stream ciphers, such as the ZUC algorithm-the core of the 3GPP LTE International Encryption Standard. Therefore, analyzing the statistical properties (for example,
Yuhua Sun   +3 more
doaj   +1 more source

On recognition of simple group L2(r) by the number of Sylow subgroups

open access: yesActa Scientiarum: Technology, 2014
Let G be a finite group and n_{p}(G) be the number of Sylow p- subgroup of G. In this work it is proved if G is a centerless group and n_{p}(G)=n_{p}(L_{2}(r)), for every prime p in pi (G), where r is prime number, r^2 does not divide |G| and r is not ...
Alireza Khalili Asboei   +1 more
doaj   +1 more source

On Triangular Secure Domination Number

open access: yesInPrime, 2020
Let T_m=(V(T_m), E(T_m)) be a triangular grid graph of m ϵ N level. The order of graph T_m is called a triangular number. A subset T of V(T_m) is a dominating set of T_m  if for all u_V(T_m)\T, there exists vϵT such that uv ϵ E(T_m), that is, N[T]=V(T_m).
Emily L Casinillo   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy