Fast Deterministic Selection

The Median of Medians (also known as BFPRT) algorithm, although a landmark theoretical achievement, is seldom used in practice because it and its variants are slower than simple approaches based on sampling. The main contribution of this paper is a fast linear-time deterministic selection algorithm QuickselectAdaptive based on a refined definition of MedianOfMedians. The algorithm's performance brings deterministic selection---along with its desirable properties of reproducible runs, predictable run times, and immunity to pathological inputs---in the range of practicality. We demonstrate results on independent and identically distributed random inputs and on normally-distributed inputs. Measurements show that QuickselectAdaptive is faster than state-of-the-art baselines.Comment: Pre-publication draf

Parallel searching in the plane

AbstractIn this paper we investigate parallel searching in the plane using robots as searchers. We show that a huge number of robots are not necessary for several problems and under different assumptions. This corresponds to real situations since, actually, the number of processors of parallel machines is fixed and independent of the dimension of the problem to be solved

A Characterization of Visibility Graphs for Pseudo-Polygons

In this paper, we give a characterization of the visibility graphs of pseudo-polygons. We first identify some key combinatorial properties of pseudo-polygons, and we then give a set of five necessary conditions based off our identified properties. We then prove that these necessary conditions are also sufficient via a reduction to a characterization of vertex-edge visibility graphs given by O'Rourke and Streinu

A Framework for In-place Graph Algorithms

Read-only memory (ROM) model is a classical model of computation to study time-space tradeoffs of algorithms. A classical result on the ROM model is that any algorithm to sort n numbers using O(s) words of extra space requires Omega (n^2/s) comparisons for lg n <= s <= n/lg n and the bound has also been recently matched by an algorithm. However, if we relax the model, we do have sorting algorithms (say Heapsort) that can sort using O(n lg n) comparisons using O(lg n) bits of extra space, even keeping a permutation of the given input sequence at anytime during the algorithm. We address similar relaxations for graph algorithms. We show that a simple natural relaxation of ROM model allows us to implement fundamental graph search methods like BFS and DFS more space efficiently than in ROM. By simply allowing elements in the adjacency list of a vertex to be permuted, we show that, on an undirected or directed connected graph G having n vertices and m edges, the vertices of G can be output in a DFS or BFS order using O(lg n) bits of extra space and O(n^3 lg n) time. Thus we obtain similar bounds for reachability and shortest path distance (both for undirected and directed graphs). With a little more (but still polynomial) time, we can also output vertices in the lex-DFS order. As reachability in directed graphs (even in DAGs) and shortest path distance (even in undirected graphs) are NL-complete, and lex-DFS is P-complete, our results show that our model is more powerful than ROM if L != P. En route, we also introduce and develop algorithms for another relaxation of ROM where the adjacency lists of the vertices are circular lists and we can modify only the heads of the lists. Here we first show a linear time DFS implementation using n + O(lg n) bits of extra space. Improving the extra space exponentially to only O(lg n) bits, we also obtain BFS and DFS albeit with a slightly slower running time. Both the models we propose maintain the graph structure throughout the algorithm, only the order of vertices in the adjacency list changes. In sharp contrast, for BFS and DFS, to the best of our knowledge, there are no algorithms in ROM that use even O(n^{1-epsilon}) bits of extra space; in fact, implementing DFS using cn bits for c<1 has been mentioned as an open problem. Furthermore, DFS (BFS, respectively) algorithms using n+o(n) (o(n), respectively) bits of extra use Reingold\u27s [JACM, 2008] or Barnes et al\u27s reachability algorithm [SICOMP, 1998] and hence have high runtime. Our results can be contrasted with the recent result of Buhrman et al. [STOC, 2014] which gives an algorithm for directed st-reachability on catalytic Turing machines using O(lg n) bits with catalytic space O(n^2 lg n) and time O(n^9)

A review of applied methods in Europe for flood-frequency analysis in a changing environment

The report presents a review of methods used in Europe for trend analysis, climate change projections and non-stationary analysis of extreme precipitation and flood frequency. In addition, main findings of the analyses are presented, including a comparison of trend analysis results and climate change projections. Existing guidelines in Europe on design flood and design rainfall estimation that incorporate climate change are reviewed. The report concludes with a discussion of research needs on non-stationary frequency analysis for considering the effects of climate change and inclusion in design guidelines. Trend analyses are reported for 21 countries in Europe with results for extreme precipitation, extreme streamflow or both. A large number of national and regional trend studies have been carried out. Most studies are based on statistical methods applied to individual time series of extreme precipitation or extreme streamflow using the non-parametric Mann-Kendall trend test or regression analysis. Some studies have been reported that use field significance or regional consistency tests to analyse trends over larger areas. Some of the studies also include analysis of trend attribution. The studies reviewed indicate that there is some evidence of a general increase in extreme precipitation, whereas there are no clear indications of significant increasing trends at regional or national level of extreme streamflow. For some smaller regions increases in extreme streamflow are reported. Several studies from regions dominated by snowmelt-induced peak flows report decreases in extreme streamflow and earlier spring snowmelt peak flows. Climate change projections have been reported for 14 countries in Europe with results for extreme precipitation, extreme streamflow or both. The review shows various approaches for producing climate projections of extreme precipitation and flood frequency based on alternative climate forcing scenarios, climate projections from available global and regional climate models, methods for statistical downscaling and bias correction, and alternative hydrological models. A large number of the reported studies are based on an ensemble modelling approach that use several climate forcing scenarios and climate model projections in order to address the uncertainty on the projections of extreme precipitation and flood frequency. Some studies also include alternative statistical downscaling and bias correction methods and hydrological modelling approaches. Most studies reviewed indicate an increase in extreme precipitation under a future climate, which is consistent with the observed trend of extreme precipitation. Hydrological projections of peak flows and flood frequency show both positive and negative changes. Large increases in peak flows are reported for some catchments with rainfall-dominated peak flows, whereas a general decrease in flood magnitude and earlier spring floods are reported for catchments with snowmelt-dominated peak flows. The latter is consistent with the observed trends. The review of existing guidelines in Europe on design floods and design rainfalls shows that only few countries explicitly address climate change. These design guidelines are based on climate change adjustment factors to be applied to current design estimates and may depend on design return period and projection horizon. The review indicates a gap between the need for considering climate change impacts in design and actual published guidelines that incorporate climate change in extreme precipitation and flood frequency. Most of the studies reported are based on frequency analysis assuming stationary conditions in a certain time window (typically 30 years) representing current and future climate. There is a need for developing more consistent non-stationary frequency analysis methods that can account for the transient nature of a changing climate

Fungal Planet Description Sheets: 1112–1181

Novel species of fungi described in this study include those from various countries as follows: Australia, Austroboletus asper on soil, Cylindromonium alloxyli on leaves of Alloxylon pinnatum, Davidhawksworthia quintiniae on leaves of Quintinia sieberi, Exophiala prostantherae on leaves of Prostanthera sp., Lactifluus lactiglaucus on soil, Linteromyces quintiniae (incl. Linteromyces gen. nov.) on leaves of Quintinia sieberi, Lophotrichus medusoides from stem tissue of Citrus garrawayi, Mycena pulchra on soil, Neocalonectria tristaniopsidis (incl. Neocalonectria gen. nov.) and Xyladictyochaeta tristaniopsidis on leaves of Tristaniopsis collina, Parasarocladium tasmanniae on leaves of Tasmannia insipida, Phytophthora aquae-cooljarloo from pond water, Serendipita whamiae as endophyte from roots of Eriochilus cucullatus, Veloboletus limbatus (incl. Veloboletus gen. nov.) on soil. Austria, Cortinarius glaucoelotus on soil. Bulgaria, Suhomyces rilaensis from the gut of Bolitophagus interruptus found on a Polyporus sp. Canada, Cantharellus betularum among leaf litter of Betula, Penicillium saanichii from house dust. Chile, Circinella lampensis on soil, Exophiala embothrii from rhizosphere of Embothrium coccineum. China, Colletotrichum cycadis on leaves of Cycas revoluta. Croatia, Phialocephala melitaea on fallen branch of Pinus halepensis. Czech Republic, Geoglossum jirinae on soil, Pyrenochaetopsis rajhradensis from dead wood of Buxus sempervirens. Dominican Republic, Amanita domingensis on litter of deciduous wood, Melanoleuca dominicana on forest litter. France, Crinipellis nigrolamellata (Martinique) on leaves of Pisonia fragrans, Talaromyces pulveris from bore dust of Xestobium rufovillosum infesting floorboards. French Guiana, Hypoxylon hepaticolor on dead corticated branch. Great Britain, Inocybe ionolepis on soil. India, Cortinarius indopurpurascens among leaf litter of Quercus leucotrichophora. Iran, Pseudopyricularia javanii on infected leaves of Cyperus sp., Xenomonodictys iranica (incl. Xenomonodictys gen. nov.) on wood of Fagus orientalis. Italy, Penicillium vallebormidaense from compost. Namibia, Alternaria mirabibensis on plant litter, Curvularia moringae and Moringomyces phantasmae (incl. Moringomyces gen. nov.) on leaves and flowers of Moringa ovalifolia, Gobabebomyces vachelliae (incl. Gobabebomyces gen. nov.) on leaves of Vachellia erioloba, Preussia procaviae on dung of Procavia capensis. Pakistan, Russula shawarensis from soil on forest floor. Russia, Cyberlindnera dauci from Daucus carota. South Africa, Acremonium behniae on leaves of Behnia reticulata, Dothiora aloidendri and Hantamomyces aloidendri (incl. Hantamomyces gen. nov.) on leaves of Aloidendron dichotomum, Endoconidioma euphorbiae on leaves of Euphorbia mauritanica, Eucasphaeria proteae on leaves of Protea neriifolia , Exophiala mali from inner fruit tissue of Malus sp., Graminopassalora geissorhizae on leaves of Geissorhiza splendidissima, Neocamarosporium leipoldtiae on leaves of Leipoldtia schultzii, Neocladosporium osteospermi on leaf spots of Osteospermum moniliferum, Neometulocladosporiella seifertii on leaves of Combretum caffrum, Paramyrothecium pituitipietianum on stems of Grielum humifusum, Phytopythium paucipapillatum from roots of Vitis sp., Stemphylium carpobroti and Verrucocladosporium carpobroti on leaves of Carpobrotus quadrifolius, Suttonomyces cephalophylli on leaves of Cephalophyllum pilansii. Sweden, Coprinopsis rubra on cow dung, Elaphomyces nemoreus fromdeciduouswoodlands. Spain, Polyscytalum pini-canariensis on needles of Pinus canariensis, Pseudosubramaniomyces septatus from stream sediment, Tuber lusitanicum on soil under Quercus suber. Thailand, Tolypocladium flavonigrum on Elaphomyces sp. USA, Chaetothyrina spondiadis on fruits of Spondias mombin, Gymnascella minnisii from bat guano, Juncomyces patwiniorum on culms of Juncus effusus, Moelleriella puertoricoensis on scale insect, Neodothiora populina (incl. Neodothiora gen. nov.) on stem cankers of Populus tremuloides, Pseudogymnoascus palmeri fromcavesediment. Vietnam, Cyphellophora vietnamensis on leaf litter, Tylopilus subotsuensis on soil in montane evergreen broadleaf forest. Morphological and culture characteristics are supported by DNA barcodes

Hydrological Extremes in a Warming Climate: Nonstationarity, Uncertainties and Impacts

This Special Issue comprises 11 papers that outline the advances in research on various aspects of climate change impacts on hydrologic extremes, including both drivers (temperature, precipitation, and snow) and effects (peak flow, low flow, and water temperature). These studies cover a broad range of topics on hydrological extremes, including hydro-climatic controls, trends, homogeneity, nonstationarity, compound events and associated uncertainties, for both historical and future climates

FlexQueue: Simple and Efficient Priority Queue for System Software

Existing studies of priority queue implementations often focus on improving canonical operations such as insert and deleteMin, while sacrificing design simplicity and pre- dictable worst-case latency. Design simplicity is sacrificed as the algorithm becomes more and more optimized, taking into account characteristics of the input workload distribution. Predictable worst-case latency is sacrificed when operations such as memory allocation and structural re-organization are deferred until absolutely necessary. While these techniques often yield performance improvement to some degree, it is possible to take a step back and ask a more basic question: is it possible to achieve similar performance while retaining a simple design? By combining techniques such as hierarchical bit-vector and dynamic horizon resizing, all of which are straight-forward in principle, this thesis presents a new priority queue design called FlexQueue, that answers this question with a definitive “yes”