Intrinsic classification, or unsupervised learning of a classification, was the earliest application of what is now termed minimum message length (MML) or minimum description length (MDL) inference. The MML algorithm ‘Snob’ and its relatives have been used successfully in many domains. These algorithms treat the ‘things’ to be classified as independent random selections from an unknown populati...

Monin-Obukhov theory predicts the well-known log-linear form of the vertical wind speed profile. A turbulence intensity profile can be estimated from this by assuming that the standard deviation of the wind speed is proportional to the friction velocity. Two parameters, namely the aerodynamic surface roughness length and the MoninObukhov length, are than needed to predict the vertical wind spee...

An old calculation of the s-wave π − π scattering lengths is updated and supplemented with experimental data on the π−π s-wave phase shift. The results ma0 = .215 and ma2 = −.039 are in excellent agreement with those obtained from a recent analysis of the results published by the Brookhaven E865 collaboration. The subject of the s-wave π − π scattering lengths has witnessed two main peaks of bo...

In order to explain the ability of individuals to find short paths to route messages to an unknown destination, based only on their own local view of a social network (the small world phenomenon), Kleinberg (2000) proposed a network model based on a d-dimensional lattice of size n augmented with k long range directed links per node. Individuals behavior is modeled by a greedy algorithm that for...

In order to explain the ability of individuals to find short paths to route messages to an unknown destination, based only on their own local view of a social network (the small world phenomenon), Kleinberg (2000) proposed a network model based on a d-dimensional lattice of size n augmented with k long range directed links per node. Individuals behavior is modeled by a greedy algorithm that, gi...

We study a generalization of the order-preserving pattern matching recently introduced by Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.), where instead of looking for an exact copy of the pattern, we only require that the relative order between the elements is the same. In our variant, we additionally allow up to k mismatches between the pattern of leng...

Background: While it is thought that normal walking can operate almost completely under spinal control, adaptation to changes in the environment may require higher-level cognitive resources. In adults, the addition of a secondary task resulted in changes in the adaptation to a split-belt walking task that supported a division between spinal and supraspinal mediation of gait adaptation. However,...

We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introduce a wavefront-propagation algorithm that circumvents the expensive search for the next split event. Our algorithm maintains the simplicity of the triangulation-based algorithm by Aichholzer and Aurenhammer but has a ...