HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

We study permutations that avoid two distinct patterns of length three and any additional set of patterns. We begin by showing how to enumerate these permutations using generating trees, generalizing the work of Mansour [13]. We then find sufficient conditions for when the number of such permutations is given by a polynomial and answer a question of Egge [6]. Afterwards, we show how to use thes...

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

Using the modified tensor product of graphs defined in [1], we present here a graphical criterion for the separability of m-partite pure quantum states living in a real or complex Hilbert space. The criterion gives both necessary and sufficient condition for the separability of such states. This criterion was first conjectured by S. L. Braunstein, S. Ghosh, T. Mansour, S. Severini, and R. C. Wi...

In this paper, a new algorithm for the instantaneous mixture of the blind separation of sources problem is derived. This algorithm deals with Multi-Input Multi-Output (MIMO) channels. The cost function proposed in this paper can be considered as an extension of that previously proposed by us (Mansour-Jutten 6]) for only two sources and two sensors. The cost function is based on the cross-cumula...

We consider the problem of minimizing regret with respect to a given set S of pairs of time selection functions and modifications rules. We give an online algorithm that has O( √ T log |S|) regret with respect to S when the algorithm is run for T time steps and there are N actions allowed. This improves the upper bound of O( √ TN log(|I||F|)) given by Blum and Mansour [BM07a] for the case when ...

Anthony Sofo Victoria University College, Victoria University, P.O. Box 14428, Melbourne City, VIC 8001, Australia Correspondence should be addressed to Anthony Sofo, [email protected] Received 18 January 2011; Accepted 3 April 2011 Academic Editor: Toufik Mansour Copyright q 2011 Anthony Sofo. This is an open access article distributed under the Creative Commons Attribution License, which...

Upper bounds are given for the complexity of two very natural randomized algorithms for finding the sink of an Acyclic Unique Sink Orientation (AUSO) of the ncube. For Random-Edge, we obtain an upper bound of about 1.80n, improving upon the the previous upper bound of about 2n/nlogn obtained by Gärtner and Kaibel. For Random-Jump, we obtain an upper bound of about (3/2)n, improving upon the pre...

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

Vanderheyden M, Kim HS, Kang HJ, Strauer BE, Vetrovec GW. Impact of intracoronary cell therapy on left ventricular function in the setting of acute myocardial infarction: a collaborative systematic review and meta-analysis of controlled clinical trials. J Am Coll Cardiol 2007;50:1761–1767. 18. Martin-Rendon E, Brunskill SJ, Hyde CJ, Stanworth SJ, Mathur A, Watt SM. Autologous bone marrow stem c...