OBJECTIVE
To reveal the factors associated with renal dysfunction among gout patients in Taiwan aborigines.
METHODS
Social demographic data, alcohol consumption data, anthropometric measurements,… (More)

In approximation algorithm design, light spanners has applications in graph-metric problems such as metric TSP (the traveling salesman problem) [8] and others [3]. We have developed an efficient… (More)

Data transmission over wireless networks is challenging due to the occurrence of burst errors, and packet loss caused by such errors seriously limits the maximum achievable throughput of wireless… (More)

In this paper, we propose TSProbe, a new capacity estimation technique for time-slotted wireless systems. Although inspired by adhoc probe, the design of TSProbe is tailored to time-slotted… (More)

Data transmission over wireless networks is challenging due to the occurrence of burst errors, and packet loss caused by such errors seriously limits the maximum achievable throughput of wireless… (More)

Given a graph G = (V,E) and and a proper labeling f from V to {1, ..., n}, we define B(f) as the maximum absolute difference between f(u) and f(v) where (u, v) ∈ E. The bandwidth of G is the minimum… (More)

We investigate the MinimumWeight 2-Edge-Connected Spanning Subgraph (2-ECSS) problem in an arbitrary metric space of doubling dimension and show a polynomial time randomized (1+ǫ)-approximation… (More)

Given an edge-weighted graph G and > 0, a (1+ )-spanner is a spanning subgraph G′ whose shortest path distances approximate those of G within a factor of 1+ . For G from certain graph families (such… (More)