Off-line detection of multiple change points with the Filtered Derivative with p-Value method

This paper deals with off-line detection of change points for time series of independent observations, when the number of change points is unknown. We propose a sequential analysis like method with linear time and memory complexity. Our method is based at first step, on Filtered Derivative method which detects the right change points but also false ones. We improve Filtered Derivative method by adding a second step in which we compute the p-values associated to each potential change points. Then we eliminate as false alarms the points which have p-value smaller than a given critical level. Next, our method is compared with the Penalized Least Square Criterion procedure on simulated data sets. Eventually, we apply Filtered Derivative with p-Value method to segmentation of heartbeat time series, and detection of change points in the average daily volume of financial time series

Fast change point analysis on the Hurst index of piecewise fractional Brownian motion

In this presentation, we introduce a new method for change point analysis on the Hurst index for a piecewise fractional Brownian motion. We first set the model and the statistical problem. The proposed method is a transposition of the FDpV (Filtered Derivative with p-value) method introduced for the detection of change points on the mean in Bertrand et al. (2011) to the case of changes on the Hurst index. The underlying statistics of the FDpV technology is a new statistic estimator for Hurst index, so-called Increment Bernoulli Statistic (IBS). Both FDpV and IBS are methods with linear time and memory complexity, with respect to the size of the series. Thus the resulting method for change point analysis on Hurst index reaches also a linear complexity

Expansion of the crop ontology by adding cassava trait ontology

Poster presented at CGIAR Generation Challenge Programme, General Research Meeting. Hyderabad (India), 21-25 Sep 201

Fluorescence from a few electrons

Systems containing few Fermions (e.g., electrons) are of great current interest. Fluorescence occurs when electrons drop from one level to another without changing spin. Only electron gases in a state of equilibrium are considered. When the system may exchange electrons with a large reservoir, the electron-gas fluorescence is easily obtained from the well-known Fermi-Dirac distribution. But this is not so when the number of electrons in the system is prevented from varying, as is the case for isolated systems and for systems that are in thermal contact with electrical insulators such as diamond. Our accurate expressions rest on the assumption that single-electron energy levels are evenly spaced, and that energy coupling and spin coupling between electrons are small. These assumptions are shown to be realistic for many systems. Fluorescence from short, nearly isolated, quantum wires is predicted to drop abruptly in the visible, a result not predicted by the Fermi-Dirac distribution. Our exact formulas are based on restricted and unrestricted partitions of integers. The method is considerably simpler than the ones proposed earlier, which are based on second quantization and contour integration.Comment: 10 pages, 3 figures, RevTe

Development of GCP Ontology for sharing crop information

Poster presented at 3rd International Biocuration Conference. Berlin (Germany), 17 Apr 200

Origin of Second Harmonic Generation from individual Silicon Nanowires

We investigate Second Harmonic Generation from individual silicon nanowires and study the influence of resonant optical modes on the far-field nonlinear emission. We find that the polarization of the Second Harmonic has a size-dependent behavior and explain this phenomenon by a combination of different surface and bulk nonlinear susceptibility contributions. We show that the Second Harmonic Generation has an entirely different origin, depending on whether the incident illumination is polarized parallel or perpendicularly to the nanowire axis. The results open perspectives for further geometry-based studies on the origin of Second Harmonic Generation in nanostructures of high-index centrosymmetric semiconductors.Comment: 7 Pages, 4 Figures + 3 Pages, 6 Figures in Appendi

Bent-Double Radio Sources as Probes of Intergalactic Gas

As the most common environment in the universe, groups of galaxies are likely to contain a significant fraction of the missing baryons in the form of intergalactic gas. The density of this gas is an important factor in whether ram pressure stripping and strangulation affect the evolution of galaxies in these systems. We present a method for measuring the density of intergalactic gas using bent-double radio sources that is independent of temperature, making it complementary to current absorption line measurements. We use this method to probe intergalactic gas in two different environments: inside a small group of galaxies as well as outside of a larger group at a 2 Mpc radius and measure total gas densities of $4 \pm 1_{-2}^{+6} \times 10^{-3}$ and $9 \pm 3_{-5}^{+10} \times 10^{-4}$ per cubic centimeter (random and systematic errors) respectively. We use X-ray data to place an upper limit of $2 \times 10^6$ K on the temperature of the intragroup gas in the small group.Comment: 6 pages, 1 figure, accepted for publication in Ap

Linear Haskell: practical linearity in a higher-order polymorphic language

Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards-compatibility and code reuse across linear and non-linear users of a library. Only then can the benefits of linear types permeate conventional functional programming. Rather than bifurcate types into linear and non-linear counterparts, we instead attach linearity to function arrows. Linear functions can receive inputs from linearly-bound values, but can also operate over unrestricted, regular values. To demonstrate the efficacy of our linear type system - both how easy it can be integrated in an existing language implementation and how streamlined it makes it to write programs with linear types - we implemented our type system in GHC, the leading Haskell compiler, and demonstrate two kinds of applications of linear types: mutable data with pure interfaces; and enforcing protocols in I/O-performing functions