Learn More
To identify susceptibility loci for ankylosing spondylitis, we undertook a genome-wide association study in 2,053 unrelated ankylosing spondylitis cases among people of European descent and 5,140 ethnically matched controls, with replication in an independent cohort of 898 ankylosing spondylitis cases and 1,518 controls. Cases were genotyped with Illumina(More)
Given a directed graph with a capacity on each edge, the all-pairs bottleneck paths (APBP) problem is to determine, for all vertices s and t, the maximum flow that can be routed from s to t. For dense graphs this problem is equivalent to that of computing the (max,min)transitive closure of a real-valued matrix. In this paper, we give a (max,min)-matrix(More)
Spontaneous failure is an unavoidable aspect of all networks, particularly those with a physical basis such as communications networks or road networks. Whether due to malicious coordinated attacks or other causes, failures temporarily change the topology of the network and, as a consequence, its connectivity and distance metric. In this paper we look at(More)
The <i>maximum cardinality</i> and <i>maximum weight matching</i> problems can be solved in <i>&#213;</i>(<i>m</i>&#x0221A;<i>n</i>) time, a bound that has resisted improvement despite decades of research. (Here <i>m</i> and <i>n</i> are the number of edges and vertices.) In this article, we demonstrate that this &#8220;<i>m</i>&#x0221A;<i>n</i>(More)
Danggui Buxue Tang (DBT), a Chinese medicinal decoction that is commonly used as a dietary supplement in treating woman with menopausal irregularity, contains two herbs: Radix Astragali (Huangqi) and Radix Angelicae Sinensis (Danggui). The ratio of Radix Astragali and Radix Angelicae Sinensis used in DBT should be 5:1 as described in China in 1247 A.D.;(More)
With the maturity and wider deployment of fourth generation (4G) networks, future 5G technologies have become a research focus. As industrial progress accelerates, some achievements have been presented [1, 5]. Several white papers have been published by various organizations such as Next Generation Mobile Networks (NGMN), IMT-2020, Mobile and Wireless(More)
The maximum cardinality and maximum weight matching problems can be solved in time Õ(m √ n), a bound that has resisted improvement despite decades of research. (Here m and n are the number of edges and vertices.) In this article we demonstrate that this “m √ n barrier” is extremely fragile, in the following sense. For any > 0, we give an algorithm that(More)
Given a weighted graph, the {\em maximum weight matching} problem (MWM) is to find a set of vertex-disjoint edges with maximum weight. In the 1960s Edmonds showed that MWMs can be found in polynomial time. At present the fastest MWM algorithm, due to Gabow and Tarjan, runs in $\tilde{O}(m\sqrt{n})$ time, where $m$ and $n$ are the number of edges and(More)
Recent development of sophisticated smartphones has made them indispensable part of our everyday life. However, advances in battery technology cannot keep up with the demand for longer battery life. Subsequently, energy efficiency has become one of the most important factors in designing smartphones. Multitasking and better multimedia features in the mobile(More)