Comparing the performance of stellar variability filters for the detection of planetary transits

We have developed a new method to improve the transit detection of Earth-sized planets in front of solar-like stars by fitting stellar microvariability by means of a spot model. A large Monte Carlo numerical experiment has been designed to test the performance of our approach in comparison with other variability filters and fitting techniques for stars of different magnitudes and planets of different radius and orbital period, as observed by the space missions CoRoT and Kepler. Here we report on the results of this experiment.Comment: 4 pages, 3 postscript figures, Transiting Planets Proceeding IAU Symposium No.253, 200

Laboratory studies of infrared absorption by NO2 and HNO3

Data concerning the quantitative absorption in the 11 and 22 micron region by HNO3 were obtained. Results are presented indicating the temperature dependence of these bands of HNO3 vapor. The 21.8 micron absorption bands of HNO3 vapor at 40 C are discussed along with the integrated intensity and line parameters for the 6.2 micron band of NO2

Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs

A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H of G. A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color equals the maximum number of cliques of H with a common vertex, for every induced subgraph H of G. Coordinated graphs are a subclass of perfect graphs. The complete lists of minimal forbidden induced subgraphs for the classes of clique-perfect and coordinated graphs are not known, but some partial characterizations have been obtained. In this paper, we characterize clique-perfect and coordinated graphs by minimal forbidden induced subgraphs when the graph is either paw-free or {gem, W4, bull}-free, both superclasses of triangle-free graphs. © 2009 Elsevier B.V. All rights reserved.Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Soulignac, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina

Prediction of User-Brand Associations Based on Sentiment Analysis

Finding the right users to be chosen as targets for advertising campaigns is not a trivial task, and it may allow important commercial advantages. A novel approach is presented here for the recommendation of new possible consumers to brands interested in distributing advertising campaigns, ranked according to the “compatibility” between users and brands. A database containing both descriptions associated with different brands, and textual information about users' opinions on different topics, is required in input. Then, sentiment analysis techniques are applied to measure to what extent the users match with the brands, based on the texts associated with their opinions. The approach has been tested on both synthetic and real datasets, and with two different formulations, showing promising results in all the considered experiments

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid

Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a rectangular grid such that two vertices are adjacent if and only if the corresponding paths share at least one edge of the grid. For a nonnegative integer $k$, $B_k$-EPG graphs are defined as EPG graphs admitting a model in which each path has at most $k$ bends. Circular-arc graphs are intersection graphs of open arcs of a circle. It is easy to see that every circular-arc graph is a $B_4$-EPG graph, by embedding the circle into a rectangle of the grid. In this paper, we prove that every circular-arc graph is $B_3$-EPG, and that there exist circular-arc graphs which are not $B_2$-EPG. If we restrict ourselves to rectangular representations (i.e., the union of the paths used in the model is contained in a rectangle of the grid), we obtain EPR (edge intersection of path in a rectangle) representations. We may define $B_k$-EPR graphs, $k\geq 0$, the same way as $B_k$-EPG graphs. Circular-arc graphs are clearly $B_4$-EPR graphs and we will show that there exist circular-arc graphs that are not $B_3$-EPR graphs. We also show that normal circular-arc graphs are $B_2$-EPR graphs and that there exist normal circular-arc graphs that are not $B_1$-EPR graphs. Finally, we characterize $B_1$-EPR graphs by a family of minimal forbidden induced subgraphs, and show that they form a subclass of normal Helly circular-arc graphs

Beam characterization by means of emission spectroscopy in the ELISE test facility

The ELISE test facility at IPP Garching hosts a RF H-/D- ion source and an acceleration system. Its target is to demonstrate the performance foreseen for the ITER NBI system in terms of extracted current density (H/D), fraction of co-extracted electrons and pulse duration. The size of the ELISE extraction area is half that foreseen for the ITER NBI. This paper presents a detailed study of the ELISE beam divergence and uniformity. In particular, it was possible to describe the beam as the sum of two components at very different divergence: about 2{\deg} vs. 5{\deg}{\div}7{\deg}. As test cases, the beam properties have been measured as function of two source parameters. The first one is the current flowing through the grid facing the plasma, the Plasma Grid, in order to generate the magnetic filter field. The second one is the bias current flowing between the Plasma Grid and the source walls. Both the filter field and the bias current influence the fraction of co-extracted electrons, but also the properties of the plasma just in front of the extraction system and the beam properties. The divergence and the uniformity of the beam have been measured by a Beam Emission Spectroscopy (BES) diagnostic; the detailed analysis of the raw spectra collected by BES led to describing the beam with two components of different divergence. This concept has been supported by the information given by thermal imaging of the diagnostic calorimeter. Further support to the proposed beam model has been found in the behavior of the currents flowing in the acceleration system and beamline components; these currents are given by the most divergent (charged) particles of the beam.Comment: 15 pages, 8 figures. Accepted manuscript (embargo expired

b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs

A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is adjacent to all other color classes. The b-chromatic number of a graph G, denoted by \chi_b(G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is called b-continuous if it admits a b-coloring with t colors, for every t = \chi(G),\ldots,\chi_b(G), and b-monotonic if \chi_b(H_1) \geq \chi_b(H_2) for every induced subgraph H_1 of G, and every induced subgraph H_2 of H_1. We investigate the b-chromatic number of graphs with stability number two. These are exactly the complements of triangle-free graphs, thus including all complements of bipartite graphs. The main results of this work are the following: - We characterize the b-colorings of a graph with stability number two in terms of matchings with no augmenting paths of length one or three. We derive that graphs with stability number two are b-continuous and b-monotonic. - We prove that it is NP-complete to decide whether the b-chromatic number of co-bipartite graph is at most a given threshold. - We describe a polynomial time dynamic programming algorithm to compute the b-chromatic number of co-trees. - Extending several previous results, we show that there is a polynomial time dynamic programming algorithm for computing the b-chromatic number of tree-cographs. Moreover, we show that tree-cographs are b-continuous and b-monotonic

Limits on the use of cobalt sulfide as anode of p-type dye-sensitized solar cells

Thin films of cobalt sulfide (CoS) of thickness l < 10m have been employed as anodes of p-type dye-sensitized solar cells (p-DSCs) when P1-sensitized nickel oxide (NiO) was the photoactive cathode and /I - constituted the redox mediator. In the role of counter electrode for p-DSCs, CoS was preferred over traditional platinized fluorine-doped indium oxide (Pt-FTO) due to the lower cost of the starting materials (Co salts) and the easier procedure of deposition onto large area substrates. The latter process was carried out via direct precipitation of CoS from aqueous solutions. The photoconversion efficiency (η) of the corresponding device was 0.07%. This value is about 35% less than the efficiency that is obtained with the analogous p-DSC employing the Pt-FTO anode (η = 0.11). Unlike p-DSCs based on Pt-FTO anodes, the photoelectrochemical cells employing CoS electrodes showed that this anodic material was not able to sustain the photocurrent densities generated by P1-sensitized NiO at a given photopotential. Illumination of the p-DSCs with CoS anodes and P1-sensitized NiO cathodes actually induced the reverse bias of the photoelectrochemical cell with CoS behaving like a p-type semiconductor with no degeneracy. © 2017 IOP Publishing Ltd