نتایج جستجو برای: step coalescence
تعداد نتایج: 270953 فیلتر نتایج به سال:
In [BKT11] Baba, Kotyada and Teja introduced the FACTOR problem over non-abelian groups as base of an ElGamal-like cryptosystem. They conjectured that there is no better method than the naive one to solve the FACTOR problem in a general group. Shortly afterwards Stanek published an extension of the baby-step giant-step algorithm disproving this conjecture [Sta11]. Since baby-step giant-step met...
A survey was conducted on 210 Baby Boomers (Age mean = 51.4 Std. dev. 5.46) within the United States to determine their current use of online technology in social interactions, their preferences in these interactions, and the expectations they have of near-future online communication technologies. The findings highlight the importance of online communication in their lives and spotlight their w...
Anneke Horstman, Mengfan Li, Iris Heidmann, Mieke Weemen, Baojian Chen, Jose M. Muino, Gerco C. Angenent, and Kim Boutilier Wageningen University and Research, Bioscience, 6708 PB Wageningen, The Netherlands Wageningen University and Research, Laboratory of Molecular Biology, 6708 PB Wageningen, The Netherlands Enza Zaden Research and Development, 1602 DB Enkhuizen, The Netherlands Max Planck I...
We present a simple procedure to construct non-local conserved charges for classical open strings on coset spaces. This is done by including suitable reflection matrices on the classical transfer matrix. The reflection matrices must obey certain conditions for the charges to be conserved and in involution. We then study bosonic open strings on AdS5×S. We consider boundary conditions correspondi...
We propose a new protocol providing cryptographically secure authentication to unaided humans against passive adversaries. We also propose a new generic passive attack on human identification protocols. The attack is an application of Coppersmith’s baby-step giantstep algorithm on human identification protcols. Under this attack, the achievable security of some of the best candidates for human ...
We derive formulas for mean deep coalescence cost, for either a fixed species tree or a fixed gene tree, under probability distributions that satisfy the exchangeability property. We then apply the formulas to study mean deep coalescence cost under two commonly used exchangeable models—the uniform and Yule models. We find that mean deep coalescence cost, for either a fixed species tree or a fix...
By using microfluidic chips, we investigate the stability regarding coalescence of droplet pairs under an electric field as a function of drop separation and ac field intensity. Three different regimes are found: stable, coalescence, and partial merging. From this, we identify the two breaking scenarios of a one dimensional train of droplets: in one case the coalescence front propagates; in the...
This manuscript analyzes the dynamics of coalescence of an incoming aqueous plug with a wetting layer above a hydrophilic surface in the chemistrode. The chemistrode is a recently described (Chen, D.; Du, W.; Liu, Y.; Liu, W.; Kuznetsov, A.; Mendez, F. E.; Philipson, L. H.; Ismagilov, R. F. Proc. Natl. Acad. Sci. U.S.A. 2008, 105, 16843-16848) microfluidic analogue of an electrode, but operatin...
We further study the incidence relations that arise from the various subtowers, known as Baby Monsters, which exist within the R-Monster Tower. This allows us to complete the RV T class spelling rules. We also present a method of calculating the various Baby Monsters that appear within the Monster Tower. MSC Primary: 58A30 Secondary: 58A17, 58K50.
SN 2002kg is a type IIn supernova, detected in October 2002 in the nearby spiral galaxy NGC 2403. We show that the position of SN 2002kg agrees within the errors with the position of the LBV V37. Ground based and HST ACS images however show that V37 is still present after the SN 2002kg event. We compiled a lightcurve of V37 which underlines the variablity of the object, and shows that SN 2002kg...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید