Results 11 to 20 of about 992 (177)

The Challenge of Time-to-Event Analysis for Multiple Events: A Guided Tour From Time-to-First-Event to Recurrent Time-to-Event Analysis. [PDF]

Biom J
ABSTRACT Clinical trials often compare a treatment to a control group concerning multiple possible combined time‐to‐event endpoints like hospital‐free survival. Thereby, the first endpoint may occur more than once (“recurrent”), whereas the second endpoint is absorbing. Inclusion of all observed events in the analysis can increase the power and provide
Schmeller S, Erdmann A, Beyersmann J, Angermann C, Ozga AK.   +4 more
europepmc   +2 more sources

Quantitative Microbial Risk Assessment of Human H5N1 Infection From Consumption of Fluid Cow's Milk. [PDF]

Risk Anal
ABSTRACT The spillover of H5N1 clade 2.3.4.4b into dairy cattle has raised concerns over the safety of fluid milk. While no foodborne infection has been reported in humans, this strain has infected at least 70 people, and milk from infected cows is known to be infected by ingestion of multiple other species.
Koebel KJ, Bulut E, Alcaine SD, Trmčić A, Nooruzzaman M, Covaleda LM, Diel DG, Ivanek R.   +7 more
europepmc   +2 more sources

Leading Digits of Mersenne Numbers [PDF]

Experimental Mathematics, 2019
It has long been known that sequences such as the powers of $2$ and the factorials satisfy Benford's Law; that is, leading digits in these sequences occur with frequencies given by $P(d)=\log_{10}(1+1/d)$, $d=1,2,\dots,9$. In this paper, we consider the leading digits of the Mersenne numbers $M_n=2^{p_n}-1$, where $p_n$ is the $n$-th prime. In light of
Zhaodong Cai, Matthew Faust, A. J. Hildebrand, Junxian Li, Yuan Zhang   +4 more
openaire   +2 more sources

Non-negative Solutions of the Nonlinear Diophantine Equation (8^n)^x + p^y=z^2 for Some Prime Number p

Walailak Journal of Science and Technology, 2021
In this paper, we explain all non-negative integer solutions for the nonlinear Diophantine equation of type 8x + py = z2 when p is an arbitrary odd prime number and incongruent with 1 modulo 8.
Boorapa SINGHA
doaj   +3 more sources

On digits of Mersenne numbers

Revista Matemática Iberoamericana, 2021
Motivated by recently developed interest to the distribution of q -ary digits of Mersenne numbers M_p = 2^p-1 , where p
Bryce Kerr, László Mérai, Igor E. Shparlinski   +2 more
openaire   +3 more sources

On Triangular Secure Domination Number

InPrime, 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, Leomarich F Casinillo, Jorge S Valenzona, Divina L Valenzona   +3 more
doaj   +1 more source

Validation of the collapsed-cone superposition for whole-body patient-specific dosimetry in [177Lu]Lu-PSMA-617 radionuclide therapy. [PDF]

Med Phys
Abstract Background Patient‐specific dosimetry in radiopharmaceutical therapy (RPT) offers a promising approach to optimize the balance between treatment efficacy and toxicity. The introduction of 360° CZT gamma cameras enables the development of personalized dosimetry studies using whole‐body single photon emission computed tomography and computed ...
Terro A, Perret S, Dumouchel A, Tonnelet D, Edet-Sanson A, Vera P, Decazes P, Dieudonné A.   +7 more
europepmc   +2 more sources

The generalized order (k,t)-Mersenne sequences in groups [PDF]

Notes on Number Theory and Discrete Mathematics
The purpose of this paper is to determine the algebraic properties of finite groups via a Mersenne-like sequence. Firstly, we introduce the generalized order (k,t)-Mersenne number sequences and study the periods of these sequences modulo m.
E. Mehraban, Ö. Deveci, E. Hincal
doaj   +1 more source

HMNT: Hash Function Based on New Mersenne Number Transform

IEEE Access, 2020
In the field of information security, hash functions are considered important as they are used to ensure message integrity and authentication. Despite various available methods to design hash functions, the methods have been proven to time inefficient ...
Ali Maetouq, Salwani Mohd Daud
doaj   +1 more source

Mersenne numbers [PDF]

Mathematics of Computation, 1958
Im Jahre 1957 prüfte der Verf. mit Hilfe der Maschine BESK die Mersenneschen Zahlen \(M_p = 2^p-1\) für \(p < 10,000\). Und zwar zunächst alle diese auf etwaige Teiler \(< 10\cdot 2^{20}\) und hierauf diejenigen für \(2300 < p < 3300\), bei denen sich kein solcher Teiler ergab, nach dem Lucas-Test auf ihre Primheit. Dabei ergab sich nur \(2^{3217}- 1\)
openaire   +2 more sources