Deciding first-order properties of nowhere dense graphs

Nowhere dense graph classes, introduced by Nesetril and Ossona de Mendez, form a large variety of classes of "sparse graphs" including the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs and graph classes of bounded expansion. We show that deciding properties of graphs definable in first-order logic is fixed-parameter tractable on nowhere dense graph classes. At least for graph classes closed under taking subgraphs, this result is optimal: it was known before that for all classes C of graphs closed under taking subgraphs, if deciding first-order properties of graphs in C is fixed-parameter tractable, then C must be nowhere dense (under a reasonable complexity theoretic assumption). As a by-product, we give an algorithmic construction of sparse neighbourhood covers for nowhere dense graphs. This extends and improves previous constructions of neighbourhood covers for graph classes with excluded minors. At the same time, our construction is considerably simpler than those. Our proofs are based on a new game-theoretic characterisation of nowhere dense graphs that allows for a recursive version of locality-based algorithms on these classes. On the logical side, we prove a "rank-preserving" version of Gaifman's locality theorem.Comment: 30 page

Intravitreal bevacizumab for the treatment of macular oedema secondary to branch retinal vein occlusion

Purpose: To evaluate the effect of intravitreal bevacizumab (Avastin) injections on visual acuity (VA) and foveal retinal thickness in patients with macular oedema secondary to branch retinal vein occlusion.Methods: A prospective, non-comparative, consecutive, interventional case series of 34 patients. Patients received repeated intravitreal injections of 1.25 mg bevacizumab. Main outcome measures were VA (Snellen charts and ETDRS) and retinal thickness (optical coherence tomography measurements) in a follow-up period of 6 months.Results: Patients presented at a mean age of 69 years (range 44--86). Mean duration of symptoms was 40 weeks (range 1--300). Mean (SD) VA at baseline was 0.79 (0.39) logMAR, improving to 0.51 (0.34) logMAR at 6 months (p = 0.009). Mean number of letters on the ETDRS chart at baseline was 45.3 (19.0), improving to 60.6 (19.9) at 6 months (p = 0.003). Mean (SD) retinal thickness at baseline was 474 (120) \textgreekmm, declining to 316 (41) \textgreekmm at 6 months.Conclusion: Intravitreal injection of 1.25 mg bevacizumb appears to be an effective treatment option for branch retinal vein occlusion

Intra- and interspecific polymorphisms ofLeishmania donovani andL. tropica minicircle DNA

A pair of degenerate polymerase chain reaction (PCR) primers (LEI-1, TCG GAT CC[C,T] [G,C]TG GGT AGG GGC GT; LEI-2, ACG GAT CC[G,C] [G,C][A,C]C TAT [A,T]TT ACA CC) defining a 0.15-kb segment ofLeishmania minicircle DNA was constructed. These primers amplified not only inter- but also intraspecifically polymorphic sequences. Individual sequences revealed a higher intraspecific than interspecific divergence. It is concluded that individual sequences are of limited relevance for species determination. In contrast, when a data base of 19 different sequences was analyzed in a dendrographic plot, an accurate species differentiation was feasible

Improper colourings inspired by Hadwiger’s conjecture

Hadwiger’s Conjecture asserts that every Kt-minor-free graph has a proper (t − 1)-colouring. We relax the conclusion in Hadwiger’s Conjecture via improper colourings. We prove that every Kt-minor-free graph is (2t − 2)-colourable with monochromatic components of order at most 1/2 (t − 2). This result has no more colours and much smaller monochromatic components than all previous results in this direction. We then prove that every Kt-minor-free graph is (t − 1)-colourable with monochromatic degree at most t − 2. This is the best known degree bound for such a result. Both these theorems are based on a decomposition method of independent interest. We give analogous results for Ks,t-minorfree graphs, which lead to improved bounds on generalised colouring numbers for these classes. Finally, we prove that graphs containing no Kt-immersion are 2-colourable with bounded monochromatic degree

Desynchronization and Wave Pattern Formation in MPI-Parallel and Hybrid Memory-Bound Programs

Analytic, first-principles performance modeling of distributed-memory parallel codes is notoriously imprecise. Even for applications with extremely regular and homogeneous compute-communicate phases, simply adding communication time to computation time does often not yield a satisfactory prediction of parallel runtime due to deviations from the expected simple lockstep pattern caused by system noise, variations in communication time, and inherent load imbalance. In this paper, we highlight the specific cases of provoked and spontaneous desynchronization of memory-bound, bulk-synchronous pure MPI and hybrid MPI+OpenMP programs. Using simple microbenchmarks we observe that although desynchronization can introduce increased waiting time per process, it does not necessarily cause lower resource utilization but can lead to an increase in available bandwidth per core. In case of significant communication overhead, even natural noise can shove the system into a state of automatic overlap of communication and computation, improving the overall time to solution. The saturation point, i.e., the number of processes per memory domain required to achieve full memory bandwidth, is pivotal in the dynamics of this process and the emerging stable wave pattern. We also demonstrate how hybrid MPI-OpenMP programming can prevent desirable desynchronization by eliminating the bandwidth bottleneck among processes. A Chebyshev filter diagonalization application is used to demonstrate some of the observed effects in a realistic setting.Comment: 18 pages, 8 figure

Kinetics of ballistic annihilation and branching

We consider a one-dimensional model consisting of an assembly of two-velocity particles moving freely between collisions. When two particles meet, they instantaneously annihilate each other and disappear from the system. Moreover each moving particle can spontaneously generate an offspring having the same velocity as its mother with probability 1-q. This model is solved analytically in mean-field approximation and studied by numerical simulations. It is found that for q=1/2 the system exhibits a dynamical phase transition. For q<1/2, the slow dynamics of the system is governed by the coarsening of clusters of particles having the same velocities, while for q>1/2 the system relaxes rapidly towards its stationary state characterized by a distribution of small cluster sizes.Comment: 10 pages, 11 figures, uses multicol, epic, eepic and eepicemu. Also avaiable at http://mykonos.unige.ch/~rey/pubt.htm

Ueber raumisomere Hexamminsalze

n/

Compact Labelings For Efficient First-Order Model-Checking

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is \emph{nicely locally cwd-decomposable}. This notion generalizes that of a \emph{nicely locally tree-decomposable} class. The graphs of such classes can be covered by graphs of bounded \emph{clique-width} with limited overlaps. We also consider such labelings for \emph{bounded} first-order formulas on graph classes of \emph{bounded expansion}. Some of these results are extended to counting queries

Use of a porous membrane for gas bubble removal in microfluidic channels: physical mechanisms and design criteria

We demonstrate and explain a simple and efficient way to remove gas bubbles from liquid-filled microchannels, by integrating a hydrophobic porous membrane on top of the microchannel. A prototype chip is manufactured in hard, transparent polymer with the ability to completely filter gas plugs out of a segmented flow at rates up to 7.4 microliter/s per mm2 of membrane area. The device involves a bubble generation section and a gas removal section. In the bubble generation section, a T-junction is used to generate a train of gas plugs into a water stream. These gas plugs are then transported towards the gas removal section, where they slide along a hydrophobic membrane until complete removal. The system has been successfully modeled and four necessary operating criteria have been determined to achieve a complete separation of the gas from the liquid. The first criterion is that the bubble length needs to be larger than the channel diameter. The second criterion is that the gas plug should stay on the membrane for a time sufficient to transport all the gas through the membrane. The third criterion is that the gas plug travel speed should be lower than a critical value: otherwise a stable liquid film between the bubble and the membrane prevents mass transfer. The fourth criterion is that the pressure difference across the membrane should not be larger than the Laplace pressure to prevent water from leaking through the membrane

SysZNF: the C2H2 zinc finger gene database

C2H2 zinc finger (C2H2-ZNF) genes are one of the largest and most complex gene super-families in metazoan genomes, with hundreds of members in the human and mouse genome. The ongoing investigation of this huge gene family requires computational support to catalog genotype phenotype comparisons of C2H2-ZNF genes between related species and finally to extend the worldwide knowledge on the evolution of C2H2-ZNF genes in general. Here, we systematically collected all the C2H2-ZNF genes in the human and mouse genome and constructed a database named SysZNF to deposit available datasets related to these genes. In the database, each C2H2-ZNF gene entry consists of physical location, gene model (including different transcript forms), Affymetrix gene expression probes, protein domain structures, homologs (and synteny between human and mouse), PubMed references as well as links to relevant public databases. The clustered organization of the C2H2-ZNF genes is highlighted. The database can be searched using text strings or sequence information. The data are also available for batch download from the web site. Moreover, the graphical gene model/protein view system, sequence retrieval system and some other tools embedded in SysZNF facilitate the research on the C2H2 type ZNF genes under an integrative view. The database can be accessed from the URL http://epgd.biosino.org/SysZNF