Logarithm
National Cancer Institute · Definitions · 2020
Ope n Pe e r v ie w on Qe ios Ope n Pe e r Re v ie w on
Cited by 0Open access
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Logarithm”
National Cancer Institute · Definitions · 2020
Ope n Pe e r v ie w on Qe ios Ope n Pe e r Re v ie w on
Cited by 0Open access
Dr. Jan W. Gooch · 2007
Cited by 0
The SAGE Encyclopedia of Social Science Research Methods · 2004
Cited by 0
Irenosen Okojie · Afterall A Journal of Art Context and Enquiry · 2021
Cited by 0
Jean-Baptiste le Rond d'Alembert (biography), David Fleming · The Journal of the Abraham Lincoln Association
Cited by 0
Zhao Zongqu · 2014
Abstract—By analyzing the characteristics of mobile payme nt services, a digital signature algorithm based on discrete lo garithm is proposed, which combines identity authentication, digital signature and the order confirmation functions in th e system. The algorithm is involved by cell phone users, ban ks, merchants and wireless operators, and the main data sto rage and calculation are carried out by service providers to simplify the consumer side of computing and storage costs, t he safety and efficacy analysis are made in the paper.
Cited by 0
Encyclopedic Dictionary of Genetics, Genomics and Proteomics · 2004
Cited by 0
Gautam Bandyopadhyay · 2023
Cited by 0
2008
Cited by 0
Gb sir 13th · Bulletin of Miscellaneous Information (Royal Gardens Kew)
Cited by 0
SpringerReference · 2011
Cited by 0
Conceição, Ana C., Pereira, José, Silva, Cátia et al. · Sapientia (Algarve University) · 2012
F-Logarithm is a F-Tool (see http://hdl.handle.net/10400.1/1105), that is, a visual, dynamic, and interactive teaching tool that allow to explore in an innovate fashion some of the main concepts within precalculus and differential calculus at the secondary and university levels (available in the CDF format).
Cited by 0Open access
SWAPNIL PALIWAL · International Journal of Mathematics Trends and Technology · 2014
Cited by 0
L. A. Skinner · 2011
Cited by 0
Zhang Li-xin · 2006
Let X, X1, X2,... be i.i.d. random variables with mean zero and positive, finite variance σ 2, and set Sn = X1 +... + Xn, n ≥ 1. We prove that, if EX 2 I{|X | ≥ t} = o((log log t) −1) as t → ∞, then for any a> −1 and b> −1, lim ǫր1 / √ 1+a 1 √1+a − ǫ) b+1 ∑ ∞ n=1 (log n) a (log log n) b σ2π2n n P maxk≤n |Sk | ≤ 8log log n (ǫ + an) = 4 π ( 1 2(1+a) 3/2) b+1 Γ(b + 1), whenever an = o(1/log log n).
Cited by 0
W. PaulVogt · 2005
Cited by 0
Tzu-Lin Yeh (6664154), Hsin-Yin Hsu (9117858), Ming-Chieh Tsai (341337) et al. · Figshare · 2021
Cited by 0Open access
Lina M. Cortés (11106245), Juan M. Lozada (11106248), Javier Perote (4246036) · Figshare · 2021
<p>The figure compares the empirical values (hollow points) and the estimated values under a lognormal specification (dashed line) and log-SNP (solid line). The axes are in logarithmic scale and correspond to the relationship between Rank and Sales for a sample of 1,772 Colombian firms. Sales were divided by the factor 10<sup>8</sup>.</p>
Cited by 0Open access
Charles Babbage · Bulletin of Miscellaneous Information (Royal Gardens Kew)
Cited by 0
Daniel Shanks · Mathematics of Computation · 1954
Cited by 7Open access