Fast Dynamic Graph Algorithms for Parameterized Problems

Fully dynamic graph is a data structure that (1) supports edge insertions and deletions and (2) answers problem specific queries. The time complexity of (1) and (2) are referred to as the update time and the query time respectively. There are many researches on dynamic graphs whose update time and query time are $o(|G|)$, that is, sublinear in the graph size. However, almost all such researches are for problems in P. In this paper, we investigate dynamic graphs for NP-hard problems exploiting the notion of fixed parameter tractability (FPT). We give dynamic graphs for Vertex Cover and Cluster Vertex Deletion parameterized by the solution size $k$. These dynamic graphs achieve almost the best possible update time $O(\mathrm{poly}(k)\log n)$ and the query time $O(f(\mathrm{poly}(k),k))$, where $f(n,k)$ is the time complexity of any static graph algorithm for the problems. We obtain these results by dynamically maintaining an approximate solution which can be used to construct a small problem kernel. Exploiting the dynamic graph for Cluster Vertex Deletion, as a corollary, we obtain a quasilinear-time (polynomial) kernelization algorithm for Cluster Vertex Deletion. Until now, only quadratic time kernelization algorithms are known for this problem. We also give a dynamic graph for Chromatic Number parameterized by the solution size of Cluster Vertex Deletion, and a dynamic graph for bounded-degree Feedback Vertex Set parameterized by the solution size. Assuming the parameter is a constant, each dynamic graph can be updated in $O(\log n)$ time and can compute a solution in $O(1)$ time. These results are obtained by another approach.Comment: SWAT 2014 to appea

Distance Oracles for Time-Dependent Networks

We present the first approximate distance oracle for sparse directed networks with time-dependent arc-travel-times determined by continuous, piecewise linear, positive functions possessing the FIFO property. Our approach precomputes $(1+\epsilon)-$approximate distance summaries from selected landmark vertices to all other vertices in the network. Our oracle uses subquadratic space and time preprocessing, and provides two sublinear-time query algorithms that deliver constant and $(1+\sigma)-$approximate shortest-travel-times, respectively, for arbitrary origin-destination pairs in the network, for any constant $\sigma > \epsilon$. Our oracle is based only on the sparsity of the network, along with two quite natural assumptions about travel-time functions which allow the smooth transition towards asymmetric and time-dependent distance metrics.Comment: A preliminary version appeared as Technical Report ECOMPASS-TR-025 of EU funded research project eCOMPASS (http://www.ecompass-project.eu/). An extended abstract also appeared in the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014, track-A

Metastases or benign adrenal lesions in patients with histopathological verification of lung cancer: Can CT texture analysis distinguish?

INTRODUCTION: Distant metastases are found in the many of patients with lung cancer at time of diagnosis. Several diagnostic tools are available to distinguish between metastatic spread and benign lesions in the adrenal gland. However, all require additional diagnostic steps after the initial CT. The purpose of this study was to evaluate if texture analysis of CT-abnormal adrenal glands on the initial CT correctly differentiates between malignant and benign lesions in patients with confirmed lung cancer. MATERIALS AND METHODS: In this retrospective study 160 patients with endoscopic ultrasound-guided biopsy from the left adrenal gland and a contrast-enhanced CT in portal venous phase were assessed with texture analysis. A region of interest encircling the entire adrenal gland was used and from this dataset the slice with the largest cross section of the lesion was analyzed individually. RESULTS: Several texture parameters showed statistically significantly difference between metastatic and benign lesions but with considerable between-groups overlaps in confidence intervals. Sensitivity and specificity were assessed using ROC-curves, and in univariate binary logistic regression the area under the curve ranged from 36 % (Kurtosis 0.5) to 69 % (Entropy 2.5) compared to 73 % in the best fitting model using multivariate binary logistic regression. CONCLUSION: In lung cancer patients with abnormal adrenal gland at imaging, adrenal gland texture analyses appear not to have any role in discriminating benign from malignant lesions

Search in Complex Networks : a New Method of Naming

We suggest a method for routing when the source does not posses full information about the shortest path to the destination. The method is particularly useful for scale-free networks, and exploits its unique characteristics. By assigning new (short) names to nodes (aka labelling) we are able to reduce significantly the memory requirement at the routers, yet we succeed in routing with high probability through paths very close in distance to the shortest ones.Comment: 5 pages, 4 figure

EU-Rotate_N – a decision support system – to predict environmental and economic consequences of the management of nitrogen fertiliser in crop rotations

A model has been developed which assesses the economic and environmental performance of crop rotations, in both conventional and organic cropping, for over 70 arable and horticultural crops, and a wide range of growing conditions in Europe. The model, though originally based on the N_ABLE model, has been completely rewritten and contains new routines to simulate root development, the mineralisation and release of nitrogen (N) from soil organic matter and crop residues, and water dynamics in soil. New routines have been added to estimate the effects of sub-optimal rates of N and spacing on the marketable outputs and gross margins. The model provides a mechanism for generating scenarios to represent a range of differing crop and fertiliser management strategies which can be used to evaluate their effects on yield, gross margin and losses of nitrogen through leaching. Such testing has revealed that nitrogen management can be improved and that there is potential to increase gross margins whilst reducing nitrogen losses

Surgical Treatment and Major Complications within the First Year of Life in Newborns with Long-Gap Esophageal Atresia Gross Type a and B – a Systematic Review

Background The surgical repair of long-gap esophageal atresia (LGEA) is still a challenge and there is no consensus on the preferred method of reconstruction. We performed a systematic review of the surgical treatment of LGEA Gross type A and B with the primary aim to compare the postoperative complications related to the different methods within the first postoperative year. Methods Systematic literature review on the surgical repair of LGEA Gross type A and B within the first year of life published from January 01, 1996 to November 01, 2016. Results We included 57 articles involving a total of 326 patients of whom 289 had a Gross type A LGEA. Delayed primary anastomosis (DPA) was the most applied surgical method (68.4%) in both types, followed by gastric pull-up (GPU) (8.3%). Anastomotic stricture (53.7%), gastro-esophageal reflux (GER) (32.2%) and anastomotic leakage (22.7%) were the most common postoperative complications, with stricture and GER occurring more often after DPA (61.9% and 40.8% respectively) compared to other methods (pPeer reviewe

Routing in Histograms

Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two points $p$ and $q$ in $P$ are co-visible if and only if the (axis-parallel) rectangle spanned by $p$ and $q$ completely lies in $P$. In the $r$-visibility graph $G(P)$ of $P$, we connect two vertices of $P$ with an edge if and only if they are co-visible. We consider routing with preprocessing in $G(P)$. We may preprocess $P$ to obtain a label and a routing table for each vertex of $P$. Then, we must be able to route a packet between any two vertices $s$ and $t$ of $P$, where each step may use only the label of the target node $t$, the routing table and neighborhood of the current node, and the packet header. We present a routing scheme for double histograms that sends any data packet along a path whose length is at most twice the (unweighted) shortest path distance between the endpoints. In our scheme, the labels, routing tables, and headers need $O(\log n)$ bits. For the case of simple histograms, we obtain a routing scheme with optimal routing paths, $O(\log n)$-bit labels, one-bit routing tables, and no headers.Comment: 18 pages, 11 figure

Insights into the migration of the European Roller from ring recoveries

AbstractDespite recent advances in avian tracking technology, archival devices still present several limitations. Traditional ring recoveries provide a complementary method for studying migratory movements, particularly for cohorts of birds with a low return rate to the breeding site. Here we provide the first international analysis of ring recovery data in the European Roller Coracias garrulus, a long-distance migrant of conservation concern. Our data comprise 58 records of Rollers ringed during the breeding season and recovered during the non-breeding season. Most records come from Eastern Europe, half are of juveniles and over three quarters are of dead birds. Thus, ring recoveries provide migration data for cohorts of Rollers—juveniles and unsuccessful migrants—for which no information currently exists, complementing recent tracking studies. Qualitatively, our results are consistent with direct tracking studies, illustrating a broad-front migration across the Mediterranean Basin in autumn and the use of the Arabian Peninsula by Rollers from eastern populations in spring. Autumn movements were, on average, in a more southerly direction for juveniles than adults, which were more easterly. Juvenile autumn recovery direction also appeared to be more variable than in adults, though this difference was not statistically significant. This is consistent with juveniles following a naïve vector-based orientation program, and perhaps explains the ‘moderate’ migratory connectivity previously described for the Roller. In the first (qualitative) analysis of Roller non-breeding season mortality, we highlight the high prevalence of shooting. The recovery age ratio was juvenile-biased in autumn but adult-biased in spring. Although not statistically significant, this difference points towards a higher non-breeding season mortality of juveniles than adults. Our study demonstrates the complementarity of ring recoveries to direct tracking, providing an insight into the migration of juvenile Rollers and non-breeding season mortality