Treatment of urinary tract infections

Urinary tract infections (UTIs) are common conditions in clinical practice. For uncomplicated UTIs, the causative organisms and their antimicrobial susceptibility profiles are generally predictable, and empiric short course (3 day) antibiotic therapy after an abbreviated laboratory workup is advocated. Acute pyelonephritis requires a 2 week antibiotic course, often with initial parenteral therapy. Women with frequent recurrences of UTIs may require intermittent self-treatment or continuous or postcoital antibiotic prophylaxis. Catheter-associated UTIs generally only require treatment if the patient shows signs of systemic infection. Treatment of asymptomatic bacteriuria is only recommended in certain circumstances. Careful consideration of the clinical circumstances, the patient's known or predicted urinary tract anatomy, and the antibiotic susceptibility of the bacterial pathogen(s) are critical factors in the choice of appropriate therapy for urinary tract infections.     

A Framework for Interactive t-SNE Clustering

In this paper, we describe our progress in creating the framework for an interactive application that allows humans to actively participate in a t-SNE clustering process. t-SNE (t-Distributed Stochastic Neighbor Embedding) is a dimensionality reduction technique that maps high dimensional data sets to lower dimensions that can then be visualized for human interpretation. By prompting users to monitor outlying points during the t-SNE clustering process, we hypothesize that users may be able to make clustering faster and more accurate than purely algorithmic methods. Further research would test these hypotheses directly. We would also attempt to decrease the lag time between the various components of our application and develop an intuitive approach for humans to aid in clustering unlabeled data. Research into human assisted clustering can combine the strengths of both humans and computer programs to improve the results of data analysis.     

Do Management Actions to Restore Rare Habitat Benefit Native Fish Conservation? Distribution of Juvenile Native Fish Among Shoreline Habitats of the Colorado River

Many management actions in aquatic ecosystems are directed at restoring or improving specific habitats to benefit fish populations. In the Grand Canyon reach of the Colorado River, experimental flow operations as part of the Glen Canyon Dam Adaptive Management Program have been designed to restore sandbars and associated backwater habitats. Backwaters can have warmer water temperatures than other habitats, and native fish, including the federally endangered humpback chub Gila cypha, are frequently observed in backwaters, leading to a common perception that this habitat is critical for juvenile native fish conservation. However, it is unknown how fish densities in backwaters compare with that in other habitats or what proportion of juvenile fish populations reside in backwaters. Here, we develop and fit multi‐species hierarchical models to estimate habitat‐specific abundances and densities of juvenile humpback chub, bluehead sucker Catostomus discobolus, flannelmouth sucker Catostomus latipinnis and speckled dace Rhinichthys osculus in a portion of the Colorado River. Densities of all four native fish were greatest in backwater habitats in 2009 and 2010. However, backwaters are rare and ephemeral habitats, so they contain only a small portion of the overall population. For example, the total abundance of juvenile humpback chub in this study was much higher in talus than in backwater habitats. Moreover, when we extrapolated relative densities based on estimates of backwater prevalence directly after a controlled flood, the majority of juvenile humpback chub were still found outside of backwaters. This suggests that the role of controlled floods in influencing native fish population trends may be limited in this section of the Colorado River. Copyright © 2014 John Wiley & Sons, Ltd.     

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification

This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities of this problem. Specifically, we provide an MST verification algorithm that achieves simultaneously $\tilde{O}(m)$ messages and $\tilde{O}(\sqrt{n} + D)$ time, where m is the number of edges in the given graph G, n is the number of nodes, and D is G’s diameter. On the other hand, we show that any MST verification algorithm must send $\tilde{\varOmega}(m)$ messages and incur $\tilde{\varOmega}(\sqrt{n} + D)$ time in worst case. Our upper bound result appears to indicate that the verification of an MST may be easier than its construction, since for MST construction, both lower bounds of $\tilde{\varOmega}(m)$ messages and $\tilde{\varOmega}(\sqrt{n} + D)$ time hold, but at the moment there is no known distributed algorithm that constructs an MST and achieves simultaneously $\tilde{O}(m)$ messages and $\tilde{O}(\sqrt{n} + D)$ time. Specifically, the best known time-optimal algorithm (using ${\tilde{O}}(\sqrt {n} + D)$ time) requires O(m+n ^3/2) messages, and the best known message-optimal algorithm (using ${\tilde{O}}(m)$ messages) requires O(n) time. On the other hand, our lower bound results indicate that the verification of an MST is not significantly easier than its construction.     

Compact separator decompositions in dynamic trees and applications to labeling schemes

This paper presents an efficient scheme maintaining a separator decomposition representation in dynamic trees using asymptotically optimal labels. In order to maintain the short labels, the scheme uses relatively low message complexity. In particular, if the initial dynamic tree contains only the root, then the scheme incurs an O(log⁴ n) amortized message complexity per topology change, where n is the current number of vertices in the tree. As a separator decomposition is a fundamental decomposition of trees used extensively as a component in many static graph algorithms, our dynamic scheme for separator decomposition may be used for constructing dynamic versions to these algorithms. The paper then shows how to use our dynamic separator decomposition to construct efficient labeling schemes on dynamic trees, using the same message complexity as our dynamic separator scheme. Specifically, we construct efficient routing schemes on dynamic trees, for both the designer and the adversary port models, which maintain optimal labels, up to a multiplicative factor of O(log log n). In addition, it is shown how to use our dynamic separator decomposition scheme to construct dynamic labeling schemes supporting the ancestry and NCA relations using asymptotically optimal labels, as well as to extend a known result on dynamic distance labeling schemes. Supported in part at the Technion by an Aly Kaufman fellowship. Supported in part by a grant from the Israel Science Foundation.     

In-line holographic electron microscopy in the presence of external magnetic fields

It is now a well-known fact that the phase of electron waves is altered by external magnetic fields via the Aharonov-Bohm effect. This implies that any electron interference effects will be to some degree affected by the presence of such fields. In this study we examine the distortion effects of external (constant and variable) magnetic fields on electron interference and holography. For digital holography, the reconstruction of the object is done via numerical calculations and this leaves the door open for correcting phase distortions in the hologram reconstruction. We design and quantitatively assess such correction schemes, which decidedly depend on our knowledge of the magnetic field values in the holographic recording process. For constant fields of known value we are able to correct for magnetic distortions to a great extent. We find that variable fields are more destructive to the holographic process than constant fields. We define two criteria, related respectively to global and local contrast of the hologram to establish the maximum allowed external field which does not significantly hinder the accuracy of in-line holographic microscopy with electrons.     

On the complexity of deciding avoidability of sets of partial words

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n.     

Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks

This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide-area sites. The architecture confines the effects of any malicious replica to its local site, reduces message complexity of wide-area communication, and allows read-only queries to be performed locally within a site for the price of additional standard hardware. We present proofs that our algorithm provides safety and liveness properties. A prototype implementation is evaluated over several network topologies and is compared with a flat Byzantine fault-tolerant approach. The experimental results show considerable improvement over flat Byzantine replication algorithms, bringing the performance of Byzantine replication closer to existing benign fault-tolerant replication techniques over wide area networks.     

Labeling Schemes for Tree Representation

This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The all-ports tree labeling ℒ _all gives each node v of G a label containing the port numbers of all the tree edges incident to v. The upward tree labeling ℒ _up labels each node v by the number of the port leading from v to its parent in the tree. Our measure of interest is the worst case and total length of the labels used by the scheme, denoted M _up (T) and S _up (T) for ℒ _up and M _all (T) and S _all (T) for ℒ _all . The problem studied in this paper is the following: Given a graph G and a predefined port labeling for it, with the ports of each node v numbered by 0,…,deg (v)−1, select a rooted spanning tree for G minimizing (one of) these measures. We show that the problem is polynomial for M _up (T), S _up (T) and S _all (T) but NP-hard for M _all (T) (even for 3-regular planar graphs). We show that for every graph G and port labeling there exists a spanning tree T for which S _up (T)=O(nlog log n). We give a tight bound of O(n) in the cases of complete graphs with arbitrary labeling and arbitrary graphs with symmetric port labeling. We conclude by discussing some applications for our tree representation schemes. A preliminary version of this paper has appeared in the proceedings of the 7th International Workshop on Distributed Computing (IWDC), Kharagpur, India, December 27–30, 2005, as part of Cohen, R. et al.: Labeling schemes for tree representation. In: Proceedings of 7th International Workshop on Distributed Computing (IWDC), Lecture Notes of Computer Science, vol. 3741, pp. 13–24 (2005). R. Cohen supported by the Pacific Theaters Foundation. P. Fraigniaud and D. Ilcinkas supported by the project “PairAPair” of the ACI Masses de Données, the project “Fragile” of the ACI Sécurité et Informatique, and by the project “Grand Large” of INRIA. A. Korman supported in part by an Aly Kaufman fellowship. D. Peleg supported in part by a grant from the Israel Science Foundation.