نتایج جستجو برای: n exponent

تعداد نتایج: 991567  

2002
HENRY E. KANDRUP IOANNIS V. SIDERIS

Integrations in fixed N-body realisations of smooth density distributions corresponding to a chaotic galactic potential can be used to derive reliable estimates of the largest (finite time) Lyapunov exponent χS associated with an orbit in the smooth potential generated from the same initial condition, even though the N -body orbit is typically characterised by an N -body exponent χN χS. This ca...

2007
Dan Boneh Matthew Franklin

We describe eecient techniques for three (or more) parties to jointly generate an RSA key. At the end of the protocol an RSA modulus N = pq is publicly known. None of the parties know the factorization of N. In addition a public encryption exponent is publicly known and each party holds a share of the private exponent that enables threshold decryption. Our protocols are eecient in computation a...

2008
Yann Bugeaud Michel Laurent

– In Diophantine Approximation, inhomogeneous problems are linked with homogeneous ones by means of the so-called Transference Theorems. We revisit this classical topic by introducing new exponents of Diophantine approximation. We prove that the exponent of approximation to a generic point in R n by a system of n linear forms is equal to the inverse of the uniform homogeneous exponent associate...

2007
M. Yamaji

We have studied the characteristics of MOSFET degradation induced by hotcarriers. When the characteristics of drain current degradation (A/j) are applied to the stress time(t) dependence AIj oc t, the exponent n is clearly different under different bias conditions. We present a two-type interface-state model composed of deep-energy interface states and shallow-energy interface states which have...

Journal: :Combinatorics, Probability & Computing 2000
Gregory F. Lawler Emily E. Puckette

The intersection exponent for simple random walk in two and three dimensions gives a measure of the rate of decay of the probability that paths do not intersect. In this paper we show that the intersection exponent for random walks is the same as that for Brownian motion and show in fact that the probability of nonintersection up to distance n is comparable (equal up to multiplicative constants...

2005
Estela Blaisten-Barojas

The classical motion of a Ii"ee particle that scatters elastically from ring-bounded cavities is analyzed nunaerically. When the ring is a smooth circle the scattering follows a regular and periodic pattern. However, for rings composed of N scatrefers the Ilow is irregular, of Lyapunov type. The Lyapunov exponent is found to depend logarithmically with N, which is consistent with the theoretica...

Journal: :Physical review. B, Condensed matter 1996
Castella

A one-dimensional tight-binding Hamiltonian describes the evolution of a single impurity interacting locally with N electrons. The impurity spectral function has a power-law singularity A(ω) ∝| ω− ω0 |−1+β with the same exponent β that characterizes the logarithmic decay of the quasiparticle weight Z with the number of electrons N , Z ∝ N−β. The exponent β is computed by (1) perturbation theory...

Journal: :IACR Cryptology ePrint Archive 2015
Muhammed F. Esgin Mehmet Sabir Kiraz Osmanbey Uzunkol

An important attack on multi-power RSA (N = pq) was introduced by Sarkar in 2014, by extending the small private exponent attack of Boneh and Durfee on classical RSA. In particular, he showed that N can be factored efficiently for r = 2 with private exponent d satisfying d < N. In this paper, we generalize this work by introducing a new partial key exposure attack for finding small roots of pol...

2003
Jia-Yu Shao

The exponent of a primitive digraph is the smallest integer k such that for each ordered pair of (not necessarily distinct) vertices x and y there is a walk of length k from x to y. As a generalization of exponent, Brualdi and Liu (Linear Algebra Appl. 14 (1990) 483499) introduced three types of generalized exponents for primitive digraphs in 1990. In this Paper we extend their definitions of g...

Journal: :پژوهشنامه علم سنجی 0
راضیه محمدزاده دانشجوی دانشگاه تهران فاطمه فهیم نیا عضو هیات علمی دانشگاه تهران محمد حسن زاده عضو هیات علمی دانشگاه تربیت مدرس

the purpose of this study was to test lotka’s law of scientific publication productivity in the field of library and information science (lis). the needed data is collected from the iranian journals (1381-1392) and were sorted in microsoft excel 2010. totally, 1994 articles published by 1470 authors. the authors frequencies were calculated based on the number of articles and regression were cal...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید