نتایج جستجو برای: random particle method

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

2009
Kumiko Hattori Tetsuya Hattori

We study a stochastic particle system which models the time evolution of the ranking of books by online bookstores (e.g., Amazon). In this system, particles are lined in a queue. Each particle jumps at random jump times to the top of the queue, and otherwise stays in the queue, being pushed toward the tail every time another particle jumps to the top. In an infinite particle limit, the random m...

Journal: :Statistics & probability letters 2013
Mark M Meerschaert Erkan Nane Yimin Xiao

Continuous time random walks impose random waiting times between particle jumps. This paper computes the fractal dimensions of their process limits, which represent particle traces in anomalous diffusion.

2014
Mohammed Hasan Abdulameer Siti Norul Huda Sheikh Abdullah Zulaiha Ali Othman

Existing face recognition methods utilize particle swarm optimizer (PSO) and opposition based particle swarm optimizer (OPSO) to optimize the parameters of SVM. However, the utilization of random values in the velocity calculation decreases the performance of these techniques; that is, during the velocity computation, we normally use random values for the acceleration coefficients and this crea...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز - دانشکده علوم پایه 1391

محاسبات کوانتومی یک روش جدید و کارآمد در سرعت دادن به محاسبات با استفاده از پدیده های مهمی از قبیل برهم نهی1 ، تداخل2 ، عدم موجبیت3 ، ناجایگزیدگی4 و تکثیرناپذیری5 ارائه می کند. و الگوریتم های کوانتومی ابزار کار برای این نوع محاسبات می باشند که با پیدایش محاسبات کوانتومی به عنوان زیر شاخه آن مورد توجه قرار گرفته اند که در تبدیل زمان محاسبات از نوع نمائی به چند جمله ای دارای اهمیت فراوان در محاسب...

2002
Qiliang Yan Roland Faller Juan J. de Pablo

A Monte Carlo method based on a density-of-states sampling is proposed for study of arbitrary statistical mechanical ensembles in a continuum. A random walk in the two-dimensional space of particle number and energy is used to estimate the density of states of the system; this density of states is continuously updated as the random walk visits individual states. The validity and usefulness of t...

Journal: :CoRR 2017
Rajesh Misra Kumar S. Ray

Particle swarm optimization comes under lot of changes after James Kennedy and Russell Eberhart first proposes the idea in 1995. The changes has been done mainly on Inertia parameters in velocity updating equation so that the convergence rate will be higher. We are proposing a novel approach where particle’s movement will not be depend on its velocity rather it will be decided by constrained bi...

2005
Josselin Garnier Pierre Del Moral

In this paper we study the robustness of linear pulses, solitons, and dispersionmanaged solitons, under the influence of random perturbations. First, we address the problem of the estimation of the outage probability due to polarization-mode dispersion. Second, we compare the pulse broadening due to random fluctuations of the group-velocity dispersion. We use an original interacting particle sy...

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

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