numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(fspp). the main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

We analyze the energy and angular momenta of the two-spin spiky string moving on the AdS3×S with NS-NS field. Due to the infinite boundary of the AdS spacetime the solution will extend to infinity and it appears the divergences. After adding the counter terms we then obtain the dispersion relation of the corresponding giant magnon and see how the background field produces the correction terms. ...

The paper investigates relationship between algebraic expressions and Fibonacci graphs (which give a generic example of non-series-parallel graphs). We propose the uniform generalized decomposition method for constructing Fibonacci graph expressions. On every step this method divides the graph of size n into k parts of the same size. We prove that to reach the smallest possible length of the co...

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 ...

Introduction and De nitions Open addressing is a widely used technique for keeping symbol tables The method was rst used in by Samuel Amdahl and Boehme in an assembly program for the IBM An extensive discussion of the method was given by Peterson in and frequent references have been made to it ever since e g Schay and Spruth Iverson However the timing characteristics have apparently never been ...