اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe reversible polydisperse Parking Lot Model
118
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We use a new version of the reversible Parking Lot Model to study the compaction of vibrated polydisperse media. The particle sizes are distributed according to a truncated power law. We introduce a self-consistent desorption mechanism with a hierarchical initialization of the system. In this way, we approach densities close to unity. The final density depends on the polydispersity of the system as well as on the initialization and will reach a maximum value for a certain exponent in the power law.
قيم البحث
اقرأ أيضاً
We present a theoretical discussion of the reversible parking problem, which appears to be one of the simplest systems exhibiting glassy behavior. The existence of slow relaxation, nontrivial fluctuations, and an annealing effect can all be understoo
d by recognizing that two different time scales are present in the problem. One of these scales corresponds to the fast filling of existing voids, the other is associated with collective processes that overcome partial ergodicity breaking. The results of the theory are in a good agreement with simulation data; they provide a simple qualitative picture for understanding recent granular compaction experiments and other glassy systems.
We propose a game theoretic approach to address the problem of searching for available parking spots in a parking lot and picking the ``optimal one to park. The approach exploits limited information provided by the parking lot, i.e., its layout and t
he current number of cars in it. Considering the fact that such information is or can be easily made available for many structured parking lots, the proposed approach can be applicable without requiring major updates to existing parking facilities. For large parking lots, a sampling-based strategy is integrated with the proposed approach to overcome the associated computational challenge. The proposed approach is compared against a state-of-the-art heuristic-based parking spot search strategy in the literature through simulation studies and demonstrates its advantage in terms of achieving lower cost function values.
We generalize the recent study of random space-filling bearings to a more realistic situation, where the spacing offset varies randomly during the space-filling procedure, and show that it reproduces well the size-distributions observed in recent stu
dies of real fault gouges. In particular, we show that the fractal dimensions of random polydisperse bearings sweep predominantly the low range of values in the spectrum of fractal dimensions observed along real faults, which strengthen the evidence that polydisperse bearings may explain the occurrence of seismic gaps in nature. In addition, the influence of different distributions for the offset is studied and we find that the uniform distribution is the best choice for reproducing the size-distribution of fault gouges.
In this letter we announce rigorous results on the phenomenon of aging in the Glauber dynamics of the random energy model and their relation to Bouchauds REM-like trap model. We show that, below the critical temperature, if we consider a time-scale t
hat diverges with the system size in such a way that equilibrium is almost, but not quite reached on that scale, a suitably defined autocorrelation function has the same asymptotic behaviour than its analog in the trap model.
It is well established that neural networks with deep architectures perform better than shallow networks for many tasks in machine learning. In statistical physics, while there has been recent interest in representing physical data with generative mo
delling, the focus has been on shallow neural networks. A natural question to ask is whether deep neural networks hold any advantage over shallow networks in representing such data. We investigate this question by using unsupervised, generative graphical models to learn the probability distribution of a two-dimensional Ising system. Deep Boltzmann machines, deep belief networks, and deep restricted Boltzmann networks are trained on thermal spin configurations from this system, and compared to the shallow architecture of the restricted Boltzmann machine. We benchmark the models, focussing on the accuracy of generating energetic observables near the phase transition, where these quantities are most difficult to approximate. Interestingly, after training the generative networks, we observe that the accuracy essentially depends only on the number of neurons in the first hidden layer of the network, and not on other model details such as network depth or model type. This is evidence that shallow networks are more efficient than deep networks at representing physical probability distributions associated with Ising systems near criticality.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
