Spline Subdivision Schemes for Compact Sets. A Survey

Dedicated to the memory of our colleague Vasil Popov January 14, 1942 – May 31, 1990 * Partially supported by ISF-Center of Excellence, and by The Hermann Minkowski Center for Geometry at Tel Aviv University, Israel

Boundary of the rauzy fractal sets in R x C generated by P(x)=x(4)-x(3)-x(2)-x-1

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Boundary of the rauzy fractal sets in ℝ×ℂgenerated by p(x) = x 4- x 3 - x 2 -x- 1

We study the boundary of the 3-dimensional Rauzy fractal ε ⊂ ℝ×ℂ generated by the polynomial P(x) Dx 4-x 3-x 2-x-1. The finite automaton characterizing the boundary of ε is given explicitly. As a consequence we prove that the set ε has 18 neighboors where 6 of them intersect the central tile ε in a point. Our construction shows that the boundary is generated by an iterated function system starting with 2 compact sets.

Regular Averaging and Regular Extension Operators in Weakly Compact Subsets of Hilbert Spaces

2000 Mathematics Subject Classification: Primary 46E15, 54C55; Secondary 28B20.

A Characterization of Exact Non-atomic Market Games

Continuous exact non-atomic games are naturally associated to certain operators between Banach spaces. It thus makes sense to study games by means of the corresponding operators. We characterize non-atomic exact market games in terms of the properties of the associated operators. We also prove a separation theorem for weak compact sets of countably additive measures, which is of independent interest.

A wrapper approach for feature selection based on Bat Algorithm and Optimum-Path Forest

Besides optimizing classifier predictive performance and addressing the curse of the dimensionality problem, feature selection techniques support a classification model as simple as possible. In this paper, we present a wrapper feature selection approach based on Bat Algorithm (BA) and Optimum-Path Forest (OPF), in which we model the problem of feature selection as an binary-based optimization technique, guided by BA using the OPF accuracy over a validating set as the fitness function to be maximized. Moreover, we present a methodology to better estimate the quality of the reduced feature set. Experiments conducted over six public datasets demonstrated that the proposed approach provides statistically significant more compact sets and, in some cases, it can indeed improve the classification effectiveness. © 2013 Elsevier Ltd. All rights reserved.

On some solutions of a functional equation related to the partial sums of the Riemann zeta function

In this paper, we prove that infinite-dimensional vector spaces of α-dense curves are generated by means of the functional equations f(x)+f(2x)+⋯+f(nx)=0, with n≥2, which are related to the partial sums of the Riemann zeta function. These curves α-densify a large class of compact sets of the plane for arbitrary small α, extending the known result that this holds for the cases n=2,3. Finally, we prove the existence of a family of solutions of such functional equation which has the property of quadrature in the compact that densifies, that is, the product of the length of the curve by the nth power of the density approaches the Jordan content of the compact set which the curve densifies.

Approximation of Univariate Set-Valued Functions - an Overview

2000 Mathematics Subject Classification: 26E25, 41A35, 41A36, 47H04, 54C65.

On Typical Compact Convex Sets in Hilbert Spaces

Let E be an infinite dimensional separable space and for e ∈ E and X a nonempty compact convex subset of E, let qX(e) be the metric antiprojection of e on X. Let n ≥ 2 be an arbitrary integer. It is shown that for a typical (in the sence of the Baire category) compact convex set X ⊂ E the metric antiprojection qX(e) has cardinality at least n for every e in a dense subset of E.

FLOWS WITHOUT WANDERING POINTS ON COMPACT CONNECTED SURFACES

Given a compact 2 dimensional manifold M we classify all continuous flows phi without wandering points on M. This classification is performed by finding finitely many pairwise disjoint open phi-invariant subsets {U(1), U(2), ..., U(n)} of M such that U(i=1)(n) (U(i)) over bar = M and each U(i) is either a suspension of an interval exchange transformation, or a maximal open cylinder made up of closed trajectories of phi.

COMPLETE ISOMORPHIC CLASSIFICATIONS OF SOME SPACES OF COMPACT OPERATORS

This paper is a continuation and a complement of our previous work on isomorphic classification of some spaces of compact operators. We improve the main result concerning extensions of the classical isomorphic classification of the Banach spaces of continuous functions on ordinals. As an application, fixing an ordinal a and denoting by X(xi), omega(alpha) <= xi < omega(alpha+1), the Banach space of all X-valued continuous functions defined in the interval of ordinals [0,xi] and equipped with the supremum, we provide complete isomorphic classifications of some Banach spaces K(X(xi),Y(eta)) of compact operators from X(xi) to Y(eta), eta >= omega. It is relatively consistent with ZFC (Zermelo-Fraenkel set theory with the axiom of choice) that these results include the following cases: 1.X* contains no copy of c(0) and has the Mazur property, and Y = c(0)(J) for every set J. 2. X = c(0)(I) and Y = l(q)(J) for any infinite sets I and J and 1 <= q < infinity. 3. X = l(p)(I) and Y = l(q)(J) for any infinite sets I and J and 1 <= q < p < infinity.

A Compact and Scalable RNS Architecture

Conferência: IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)- Jun 05-07, 2013

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

Carleson Measures and Logvinenko-Sereda sets on compact manifolds

Given a compact Riemannian manifold $M$ of dimension $m \geq 2$, we study the space of functions of $L^2(M)$generated by eigenfunctions ofeigenvalues less than $L \geq 1$ associated to the Laplace-Beltrami operator on $M$. On these spaces we give a characterization of the Carleson measures and the Logvinenko-Sereda sets.