A function Q is called absolutely monotone of order k on an interval I if Q(x) ≥ 0, Q(x) ≥ 0, . . . , Q(k)(x) ≥ 0, for all x ∈ I. An essentially sharp (up to a multiplicative absolute constant) Markov inequality for absolutely monotone polynomials of order k in Lp[−1, 1], p > 0, is established. One may guess that the right Markov factor is cn2/k and, indeed, this turns out to be the case. Moreo...

Photolysis of [M(CO)6] (M /Cr, W) in CH2Cl2 at /78 8C generates [(CO)5M(CH2Cl2)]. Subsequent sequential reaction of [(CO)5M(CH2Cl2)] with terminal alkynes, HC /CR (R /COOMe, Ph, p -Tol), and diazoalkanes, R (R)CN2 (R 1 /Me, Et, Ph; R2 /Me, Et) affords 3H -pyrazole complexes, [(CO)5M / N N C(R) C(H) C /(R)(R)]. These complexes are derived from addition of diazoalkanes to alkyne complex intermedi...

Many machine learning algorithms developed for classification, prediction and uncertain reasoning cannot handle continuous features. To use them on real world data sets, continuous attributes must be discretized into small number of distinct ranges. Also discretization provides an insight into critical values in continuous attributes. In this work (SPID4.5), an improvement of our previously pub...

The Naive Mix is a new supervised learning algorithm that is based on a sequential method for selecting probabilistic models. The usual objective of model selection is to find a single model that adequately characterizes the data in a training sample. However, during model selection a sequence of models is generated that consists of the best-fitting model at each level of model complexity. The ...

This paper presents basic ideas and results of the GOAL project focusing on its knowledge discovery part. Within this project a KDD (Knowledge Discovery in Databases) package [7] has been designed and implemented. In this paper motivation, architecture, functionality and one two of the implemented DM (data mining) modules of the KDD Package are described in greater detail. KDD Package supports ...

We consider the problem of constructing dense lattices of Rn with a given non trivial automorphism group. We exhibit a family of such lattices of density at least cn2−n, which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions n, we exhibit a finite set of lattices that come with an automorphism group of size n, and a co...

When considering new datasets for analysis with machine learning algorithms, we encounter the problem of choosing the algorithm which is best suited for the task at hand. The aim of meta-level learning is to relate the performance of diierent machine learning algorithms to the characteristics of the dataset. The relation is induced on the basis of empirical data about the performance of machine...

Cold allodynia, pain in response to cooling, occurs during or within hours of oxaliplatin infusion and is thought to arise from a direct effect of oxaliplatin on peripheral sensory neurons. To characterize the pathophysiological mechanisms underlying acute oxaliplatin-induced cold allodynia, we established a new intraplantar oxaliplatin mouse model that rapidly developed long-lasting cold allod...

The Naive Mix is a new supervised learning algorithm that is based on a sequential method for selecting probabilistic models. The usual objective of model selection is to nd a single model that adequately characterizes the data in a training sample. However, during model selection a sequence of models is generated that consists of the best{{tting model at each level of model complexity. The Nai...

We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi’s Regularity Lemma. More precisely, we consider the number of complete graphs K` on ` vertices in `-partite graphs where each partition class consists of n vertices and there is an ε-regular graph onm edges between any two partition classes. We show that for all β >...