Cross-validated bagged learning

Many applications aim to learn a high dimensional parameter of a data generating distribution based on a sample of independent and identically distributed observations. For example, the goal might be to estimate the conditional mean of an outcome given a list of input variables. In this prediction context, bootstrap aggregating (bagging) has been introduced as a method to reduce the variance of a given estimator at little cost to bias. Bagging involves applying an estimator to multiple bootstrap samples and averaging the result across bootstrap samples. In order to address the curse of dimensionality, a common practice has been to apply bagging to estimators which themselves use cross-validation, thereby using cross-validation within a bootstrap sample to select fine-tuning parameters trading off bias and variance of the bootstrap sample-specific candidate estimators. In this article we point out that in order to achieve the correct bias variance trade-off for the parameter of interest, one should apply the cross-validation selector externally to candidate bagged estimators indexed by these fine-tuning parameters. We use three simulations to compare the new cross-validated bagging method with bagging of cross-validated estimators and bagging of non-cross-validated estimators.     

Classification of irreducible weight modules over higher rank Virasoro algebras

Let G be a rank n additive subgroup of C and Vir[G] the corresponding Virasoro algebra of rank n. In the present paper, irreducible weight modules with finite dimensional weight spaces over Vir[G] are completely determined. There are two different classes of them. One class consists of simple modules of intermediate series whose weight spaces are all 1-dimensional. The other is constructed by using intermediate series modules over a Virasoro subalgebra of rank n−1. The classification of such modules over the classical Virasoro algebra was obtained by O. Mathieu in 1992 using a completely different approach.     

More on the Bernoulli*–Taylor Formula for Extended Umbral Calculus

One presents here the *_ψ-Bernoulli-Taylor* formula of a new sort with the rest term of the Cauchy type recently derived by the author in the case of the so called ψ-difference calculus which constitutes the representative for the purpose case of extended umbral calculus. The central importance of such a type formulas is beyond any doubt - and recent publications do confirm this historically established experience. *see below: a historical remark based on Academician N. Y. Sonin article published in Petersburg in 19-th century. We owe this information and the article to Professor O. V. Viscov from Moscow. **see: C. Graves, On the principles which regulate the interchange of symbols in certain symbolic equations, Proc. Royal Irish Academy 6 (1853-1857), 144-152.     

Cyclic polytopes, hyperplanes, and Gray codes

We consider cyclic d-polytopes P that are realizable with vertices on the moment curve $M_d:t\longrightarrow (t,t^2,\ldots,t^d)$ of order $d\geq 3$. A hyperplane H bisects a j-face of P if H meets its relative interior. For $\ell\geq 1$, we investigate the maximum number of vertices that P can have so that for some $\ell$ hyperplanes, each j-face of P is bisected by one of the hyperplanes. For $\ell > 1$, the problem translates to the existence of certain codes, or equivalently, certain paths on the cube $\{0,1\}^\ell$.     

Parallel computing in combinatorial optimization

This is a review of the literature on parallel computers and algorithms that is relevant for combinatorial optimization. We start by describing theoretical as well as realistic machine models for parallel computations. Next, we deal with the complexity theory for parallel computations and illustrate the resulting concepts by presenting a number of polylog parallel algorithms andP-completeness results. Finally, we discuss the use of parallelism in enumerative methods.     

A one-dimensional bin packing problem with shelf divisions

Given bins of size B, non-negative values d and Δ, and a list L of items, each item e∈L with size s_e and class c_e, we define a shelf as a subset of items packed inside a bin with total item sizes at most Δ such that all items in this shelf have the same class. Two subsequent shelves must be separated by a shelf division of size d. The size of a shelf is the total size of its items plus the size of the shelf division. The class constrained shelf bin packing problem (CCSBP) is to pack the items of L into the minimum number of bins, such that the items are divided into shelves and the total size of the shelves in a bin is at most B. We present hybrid algorithms based on the First Fit (Decreasing) and Best Fit (Decreasing) algorithms, and an APTAS for the problem CCSBP when the number of different classes is bounded by a constant C.     

Quintic equation of state for pure substances in sub- and supercritical range

A new quintic equation of state (EOS) for pure substances and mixtures is proposed. The equation is based on critical parameters and one saturation point. The proposed Q5EOS is a generalisation of many cubic equations of state. Equation Q5 has five parameters, four of which are temperature-independent. The temperature-dependent parameter a is expressed by a relation based on a simple power function. Parameters defining this function can be calculated from saturation data, Boyle temperature and supercritical data.     

On the regularity of the leafwise Poincaré metric

We prove that for a foliation of general type on a complex projective surface the curvature of the leafwise Poincaré metric is absolutely continuous.     

Metric semantics for concurrency

An overview is given of work we have done in recent years on the semantics of concurrency, concentrating on semantic models built on metric structures. Three contrasting themes are discussed, viz. (i) uniform or schematic versus nonuniform or interpreted languages; (ii) operational versus denotational semantics, and (iii) linear time versus branching time models. The operational models are based on Plotkin's transition systems. Language constructs which receive particular attention are recursion and merge, synchronization and global nondeterminacy, process creation, and communication with value passing. Various semantic equivalence results are established. Both in the definitions and in the derivation of these equivalences, essential use is made of Banach's theorem for contracting functions.Dedicated to Peter Naur on the occasion of his 60th birthday