Local Rademacher complexities

We propose new bounds on the error of learning algorithms in terms of a data-dependent notion of complexity. The estimates we establish give optimal rates and are based on a local and empirical version of Rademacher averages, in the sense that the Rademacher averages are computed from the data, on a subset of functions with small empirical error. We present some applications to classification and prediction with convex function classes, and with kernel classes in particular.Comment: Published at http://dx.doi.org/10.1214/009053605000000282 in the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

First experimental demonstration of temporal hypertelescope operation with a laboratory prototype

In this paper, we report the first experimental demonstration of a Temporal HyperTelescope (THT). Our breadboard including 8 telescopes is firstly tested in a manual cophasing configuration on a 1D object. The Point Spread Function (PSF) is measured and exhibits a dynamics in the range of 300. A quantitative analysis of the potential biases demonstrates that this limitation is related to the residual phase fluctuation on each interferometric arm. Secondly, an unbalanced binary star is imaged demonstrating the imaging capability of THT. In addition, 2D PSF is recorded even if the telescope array is not optimized for this purpose.Comment: Accepted for publication in MNRAS. 11 pages, 25 figure

The Complexity of Infinite Computations In Models of Set Theory

We prove the following surprising result: there exist a 1-counter B\"uchi automaton and a 2-tape B\"uchi automaton such that the \omega-language of the first and the infinitary rational relation of the second in one model of ZFC are \pi_2^0-sets, while in a different model of ZFC both are analytic but non Borel sets. This shows that the topological complexity of an \omega-language accepted by a 1-counter B\"uchi automaton or of an infinitary rational relation accepted by a 2-tape B\"uchi automaton is not determined by the axiomatic system ZFC. We show that a similar result holds for the class of languages of infinite pictures which are recognized by B\"uchi tiling systems. We infer from the proof of the above results an improvement of the lower bound of some decision problems recently studied by the author

An alternate approach to measure specific star formation rates at 2<z<7

We trace the specific star formation rate (sSFR) of massive star-forming galaxies ($\gtrsim\!10^{10}\,\mathcal{M}_\odot$) from $z\sim2$ to 7. Our method is substantially different from previous analyses, as it does not rely on direct estimates of star formation rate, but on the differential evolution of the galaxy stellar mass function (SMF). We show the reliability of this approach by means of semi-analytical and hydrodynamical cosmological simulations. We then apply it to real data, using the SMFs derived in the COSMOS and CANDELS fields. We find that the sSFR is proportional to $(1+z)^{1.1\pm0.2}$ at $z>2$, in agreement with other observations but in tension with the steeper evolution predicted by simulations from $z\sim4$ to 2. We investigate the impact of several sources of observational bias, which however cannot account for this discrepancy. Although the SMF of high-redshift galaxies is still affected by significant errors, we show that future large-area surveys will substantially reduce them, making our method an effective tool to probe the massive end of the main sequence of star-forming galaxies.Comment: ApJ accepte

Detection of an unknown rank-one component in white noise

We consider the detection of an unknown and arbitrary rank-one signal in a spatial sector scanned by a small number of beams. We address the problem of finding the maximal invariant for the problem at hand and show that it consists of the ratio of the eigenvalues of a Wishart matrix to its trace. Next, we derive the generalized-likelihood ratio test (GLRT) along with expressions for its probability density function (pdf) under both hypotheses. Special attention is paid to the case m= 2, where the GLRT is shown to be a uniformly most powerful invariant (UMPI). Numerical simulations attest to the validity of the theoretical analysis and illustrate the detection performance of the GLRT

Burden of fetal alcohol syndrome in a rural West Coast area of South Africa

Background. Fetal alcohol syndrome (FAS) is common in parts of South Africa; rural residence is a frequently cited risk factor. We conducted a FAS school prevalence survey of an isolated rural community in a West Coast village of Western Cape Province, so obtaining the first directly measured rate, focusing specifically on a South African rural area, of FAS and partial FAS (PFAS). Methods. The study area (Aurora village), a community of about 2 500 people in a grain-producing region, has one primary school. All learners were eligible for study inclusion. Initial anthropometry screening was followed by a diagnostic stage entailing examination by a dysmorphologist for features of FAS, neurodevelopmental assessment, and an interview assessing maternal alcohol consumption. Results. Of 160 learners screened, 78 (49%) were screen-positive, of whom 63 (81%) were clinically assessed for FAS. The overall FAS/PFAS rate among the screened learners was 17.5% (95% confidence interval 12.0 - 24.2%), with 16 (10.0%) children having FAS and 12 (7.5%) PFAS. High rates of stunting, underweight and microcephaly were noted in all learners, especially those with FAS or PFAS. Five (18%) mothers of affected children were deceased by the time of assessment. Conclusion. We describe very high rates of FAS/PFAS in an isolated rural part of the Western Cape that is not located in a viticultural region. Our study suggests that the prevalence of FA S may be very high in isolated communities, or in particular hot-spots. It adds to the growing evidence that FAS/PFAS is a significant, and underestimated, health problem in South Africa. Expanded screening and surveillance programmes, and preventive interventions, are urgently needed

Grid Infrastructure for Domain Decomposition Methods in Computational ElectroMagnetics

The accurate and efficient solution of Maxwell's equation is the problem addressed by the scientific discipline called Computational ElectroMagnetics (CEM). Many macroscopic phenomena in a great number of fields are governed by this set of differential equations: electronic, geophysics, medical and biomedical technologies, virtual EM prototyping, besides the traditional antenna and propagation applications. Therefore, many efforts are focussed on the development of new and more efficient approach to solve Maxwell's equation. The interest in CEM applications is growing on. Several problems, hard to figure out few years ago, can now be easily addressed thanks to the reliability and flexibility of new technologies, together with the increased computational power. This technology evolution opens the possibility to address large and complex tasks. Many of these applications aim to simulate the electromagnetic behavior, for example in terms of input impedance and radiation pattern in antenna problems, or Radar Cross Section for scattering applications. Instead, problems, which solution requires high accuracy, need to implement full wave analysis techniques, e.g., virtual prototyping context, where the objective is to obtain reliable simulations in order to minimize measurement number, and as consequence their cost. Besides, other tasks require the analysis of complete structures (that include an high number of details) by directly simulating a CAD Model. This approach allows to relieve researcher of the burden of removing useless details, while maintaining the original complexity and taking into account all details. Unfortunately, this reduction implies: (a) high computational effort, due to the increased number of degrees of freedom, and (b) worsening of spectral properties of the linear system during complex analysis. The above considerations underline the needs to identify appropriate information technologies that ease solution achievement and fasten required elaborations. The authors analysis and expertise infer that Grid Computing techniques can be very useful to these purposes. Grids appear mainly in high performance computing environments. In this context, hundreds of off-the-shelf nodes are linked together and work in parallel to solve problems, that, previously, could be addressed sequentially or by using supercomputers. Grid Computing is a technique developed to elaborate enormous amounts of data and enables large-scale resource sharing to solve problem by exploiting distributed scenarios. The main advantage of Grid is due to parallel computing, indeed if a problem can be split in smaller tasks, that can be executed independently, its solution calculation fasten up considerably. To exploit this advantage, it is necessary to identify a technique able to split original electromagnetic task into a set of smaller subproblems. The Domain Decomposition (DD) technique, based on the block generation algorithm introduced in Matekovits et al. (2007) and Francavilla et al. (2011), perfectly addresses our requirements (see Section 3.4 for details). In this chapter, a Grid Computing infrastructure is presented. This architecture allows parallel block execution by distributing tasks to nodes that belong to the Grid. The set of nodes is composed by physical machines and virtualized ones. This feature enables great flexibility and increase available computational power. Furthermore, the presence of virtual nodes allows a full and efficient Grid usage, indeed the presented architecture can be used by different users that run different applications