اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدIt is high time we let go of the Mersenne Twister
42
0
0.0
(
0
)
تأليف
Sebastiano Vigna
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
When the Mersenne Twister made his first appearance in 1997 it was a powerful example of how linear maps on $mathbf F_2$ could be used to generate pseudorandom numbers. In particular, the easiness with which generators with long periods could be defined gave the Mersenne Twister a large following, in spite of the fact that such long periods are not a measure of quality, and they require a large amount of memory. Even at the time of its publication, several defects of the Mersenne Twister were predictable, but they were somewhat obscured by other interesting properties. Today the Mersenne Twister is the default generator in C compilers, the Python language, the Maple mathematical computation system, and in many other environments. Nonetheless, knowledge accumulated in the last $20$ years suggests that the Mersenne Twister has, in fact, severe defects, and should never be used as a general-purpose pseudorandom number generator. Many of these results are folklore, or are scattered through very specialized literature. This paper surveys these results for the non-specialist, providing new, simple, understandable examples, and it is intended as a guide for the final user, or for language implementors, so that they can take an informed decision about whether to use the Mersenne Twister or not.
قيم البحث
اقرأ أيضاً
The Mersenne-Twister is one of the most popular generators of uniform pseudo-random numbers. It is used in many numerical libraries and software. In this paper, we look at the Komolgorov entropy of the original Mersenne-Twister, as well as of more mo
dern variations such as the 64-bit Mersenne-Twisters, the Well generators, and the Melg generators.
The Hierarchical Chinese Postman Problem is finding a shortest traversal of all edges of a graph respecting precedence constraints given by a partial order on classes of edges. We show that the special case with connected classes is NP-hard even on o
rders decomposable into a chain and an incomparable class. For the case with linearly ordered (possibly disconnected) classes, we get 5/3-approximations and fixed-parameter algorithms by transferring results from the Rural Postman Problem.
Polarized foregrounds are going to be a serious challenge for detecting CMB cosmological B-modes. Both diffuse Galactic emission and extragalactic sources contribute significantly to the power spectrum on large angular scales. At low frequencies, Gal
actic synchrotron emission will dominate with fractional polarization $sim 20-40%$ at high latitudes while radio sources can contribute significantly even on large ($sim 1^{circ}$) angular scales. Nevertheless, simulations suggest that a detection at the level of $r=0.001$ might be achievable if the foregrounds are not too complex.
Since the popularization of the Transformer as a general-purpose feature encoder for NLP, many studies have attempted to decode linguistic structure from its novel multi-head attention mechanism. However, much of such work focused almost exclusively
on English -- a language with rigid word order and a lack of inflectional morphology. In this study, we present decoding experiments for multilingual BERT across 18 languages in order to test the generalizability of the claim that dependency syntax is reflected in attention patterns. We show that full trees can be decoded above baseline accuracy from single attention heads, and that individual relations are often tracked by the same heads across languages. Furthermore, in an attempt to address recent debates about the status of attention as an explanatory mechanism, we experiment with fine-tuning mBERT on a supervised parsing objective while freezing different series of parameters. Interestingly, in steering the objective to learn explicit linguistic structure, we find much of the same structure represented in the resulting attention patterns, with interesting differences with respect to which parameters are frozen.
In this article we first review the past decade of efforts in detecting the missing baryons in the Warm Hot Intergalactic Medium (WHIM) and summarize the current state of the art by updating the baryon census and physical state of the detected baryon
s in the local Universe. We then describe observational strategies that should enable a significant step forward in the next decade, while waiting for the step-up in quality offered by future missions. In particular we design a multi-mega-second and multiple cycle XMM-Newton legacy program (which we name the Ultimate Roaming Baryon Exploration, or URBE) aimed to secure detections of the peaks in the density distribution of the Universe missing baryons over their entire predicted range of temperatures.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
