Cyclicity in weighted Bergman type spaces

We use the so called resolvent transform method to study the cyclicity of the one point mass singular inner function in weighted Bergman type spaces.Comment: 20 page

Constructive approximation in de Branges-Rovnyak spaces

In most classical holomorphic function spaces on the unit disk, a function $f$ can be approximated in the norm of the space by its dilates f\_r(z):=f(rz)~(r \textless{} 1). We show that this is \emph{not} the case for the de Branges--Rovnyak spaces \cH(b). More precisely, we give an example of a non-extreme point $b$ of the unit ball of $H^\infty$ and a function f\in\cH(b) such that \lim\_{r\to1^-}\|f\_r\|\_{\cH(b)}=\infty. It is known that, if $b$ is a non-extreme point of the unit ball of $H^\infty$, then polynomials are dense in \cH(b). We give the first constructive proof of this fact

Closed ideals in some algebras of analytic functions

We obtain a complete description of closed ideals of the algebra \mathcal{D}\cap \mathrm{lip}_\alpha}, $0<\alpha\leq{1/2},$ where $\mathcal{D}$ is the Dirichlet space and \mathrm{lip}_\alpha} is the algebra of analytic functions satisfying the Lipschitz condition of order $\alpha.$Comment: 19 page

Apprentissage Multi Agent à Mémoire Bornée

National audienceNous abordons ici l'apprentissage supervisé en ligne collaboratif dans une société d'agents. La démarche adoptée est celle du maintien collectif d'une notion de consistance, ici correspondant au maintien, par révision de l'hypothèse courante, d'une hypothèse d'erreur empirique nulle. L'hypothèse prend la forme d'une formule de taille réduite et la révision repose sur les exemples mémorisés. Lors de précédents travaux, dans le cadre du projet SMILE, tous les exemples rencontrés par un agent, plus ceux transmis par d'autres agents, étaient mémorisés. Dans le travail présenté ici, chaque agent a une mémoire bornée, limitant ainsi le nombre d'exemples maintenus dans la mémoire de chaque agent. Nous proposons une adaptation du mécanisme de révision collective de SMILE prenant en compte cette restriction. Plusieurs variantes de ce mécanisme, se différenciant en particulier selon la méthode utilisée par les agents pour gérer leur mémoire, sont explorées expérimentalement. Nous observons alors dans quelle mesure ces restrictions en mémoire peuvent être dépassées résultant parfois de manière surprenante en une erreur en test plus faible que sans ces restrictions

Investigating the effect of data representation on neural network and regression

In this research the impact of different data representation on the performance of neural network and regression was investigated on different datasets that has binary or Boolean class target.In addition, the performance of particular predictive data mining model could be affected with the change of data representation.The seven data representations that have been used in this research are As_Is, Min Max normalization, standard deviation normalization, sigmoidal normalization, thermometer representation, flag representation and simple binary representation.Moreover, all data representations have been applied on two datasets which are Wisconsin breast cancer and German credit dataset. As a result, the neural network performance is better than logistic regression on both datasets if we exclude the thermometer and flag representations.For datasets having a binary or Boolean target class, flag or thermometer binary representation is recommended to be used if logistic regression analysis is performed. Meanwhile, As_is representation, min max normalization,standard deviation normalization or sigmoidal normalization is recommended for neural network analysis on datasets having binary or Boolean target class

08361 Abstracts Collection -- Programming Multi-Agent Systems

From 31th August to 5th September, the Dagstuhl Seminar 08361 ``Programming Multi-Agent Systems\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Proceedings of The Multi-Agent Logics, Languages, and Organisations Federated Workshops (MALLOW 2010)

http://ceur-ws.org/Vol-627/allproceedings.pdfInternational audienceMALLOW-2010 is a third edition of a series initiated in 2007 in Durham, and pursued in 2009 in Turin. The objective, as initially stated, is to "provide a venue where: the cost of participation was minimum; participants were able to attend various workshops, so fostering collaboration and cross-fertilization; there was a friendly atmosphere and plenty of time for networking, by maximizing the time participants spent together"

On zero sets in the Dirichlet space

We study the zeros sets of functions in the Dirichlet space. Using Carleson formula for Dirichlet integral, we obtain some new families of zero sets. We also show that any closed subset of E \subset \TT with logarithmic capacity zero is the accumulation points of the zeros of a function in the Dirichlet space. The zeros satisfy a growth restriction which depends on $E$.Comment: Journal of Geometric Analysis (2011