Missing data pose a potential threat to learning and classification in that they may compromise the ability of a system to develop robust, generalized models of the environment in which they operate. This investigation reports on the effects of three approaches to covering these data using an XCS-style learning classifier system. Using fabricated datasets representing a wide range of missing va...

We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arbitrary sets of features; including features that are constructed from the data. The result is a general-purpose learning machine, suitable for practical learning tasks, that we call the Set Covering Machine. We present...

presently, emerging economies are acquiring singular positions all over the world. the complexities of nowadays economy have caused international companies and investors to be of a tendency towards emerging markets for more profitability and growth. this study aims to find the relationships between firm's profitability and growth in iranian manufacturing industry consisting of tehran stock...

in this paper deflection and free vibration of sandwich panel is studied. the core of sandwich panels is made of hexagonal honeycomb and faces are made of two different materials of carbon fiber reinforced plastic and k-aryl/epoxy covering. the governing equations are deduced from the first order sheer deformation theory (fsdt) and they are solved using generalized differential quadrature metho...

given a mapping $f:xto x$ we naturally associate to it a monotonic map $gg_f:exp xto exp x$ from the power set of $x$ into itself, thus inducing a generalized topology on $x$. in this paper we investigate some properties of generalized topologies which are defined by such a procedure.

We investigate the covering problem in RT spaces induced by the RosenbloomTsfasman metric, extending the classical covering problem in Hamming spaces. Some connections between coverings in RT spaces and coverings in Hamming spaces are derived. Several lower and upper bounds are established for the smallest cardinality of a covering code in an RT space, generalizing results by Carnielli, Chen an...

In 1914 Lebesgue defined a ‘universal covering’ to be a convex subset of the plane that contains an isometric copy of any subset of diameter 1. His challenge of finding a universal covering with the least possible area has been addressed by various mathematicians: Pál, Sprague and Hansen have each created a smaller universal covering by removing regions from those known before. However, Hansen’...

Our main observation concerns closed geodesics on surfaces M with a smooth Finsler metric, i.e. a function F : TM → [0,∞) which is a norm on each tangent space TpM , p ∈ M , which is smooth outside of the zero section in TM , and which is strictly convex in the sense that Hess(F ) is positive definite on TpM \ {0}. One calls a Finsler metric F symmetric if F (p,−v) = F (p, v) for all v ∈ TpM . ...