#### Filter Results:

#### Publication Year

2009

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Guirong Xu, Randolph Ware, Wengang Zhang, Guangliu Feng, Kewen Liao, Yibing Liu
- 2014

a r t i c l e i n f o a b s t r a c t Microwave radiometers (MWRs) can be useful for the detection of mesoscale phenomena because they provide thermodynamic profiles in a minute time scale. These profiles are mainly used in non-precipitation conditions due to degraded accuracy of the MWR measurements in precipitation. Recently, Radiometrics Corporation used… (More)

First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in [19]). In the problem , we are given a set of sites equipped with an unconstrained number of facilities as resources, and a set of clients with set R as corresponding connection requirements, where every facility belonging to the same site has an… (More)

Context-aware Web services are currently emerging as an important technology for building innovative context-aware Web applications. Unfortunately, context-aware Web services are still difficult to build. This paper describes Smart Adelaide Guide, a context-aware Web application developed by ContextServ platform, a research project sponsored by Australian… (More)

For a given graph G with positive integral cost and delay on edges, distinct vertices s and t, cost bound C ∈ Z + and delay bound D ∈ Z + , the k bi-constraint path (kBCP) problem is to compute k disjoint st-paths subject to C and D. This problem is known NP-hard, even when k = 1 [4]. This paper first gives a simple approximation algorithm with factor-(2,… (More)

- Kewen Liao, Hong Shen
- PDCAT
- 2011

- Kewen Liao, Hong Shen
- CATS
- 2012

We initiate the study of the Reliable Resource Allocation (RRA) problem. In this problem, we are given a set of sites equipped with an unbounded number of facilities as resources. Each facility has an opening cost and an estimated reliability. There is also a set of clients to be allocated to facilities with corresponding connection costs. Each client has a… (More)

Let <i>G</i>=(<i>V, E</i>) be a digraph with nonnegative integral <i>cost</i> and <i>delay</i> on each edge, <i>s</i> and <i>t</i> be two vertices, and <i>D</i> ∈ Z+/o be a delay bound, the <i>k disjoint Restricted Shortest Path</i> (<i>k RSP</i>) problem is to compute <i>k</i> disjoint paths between <i>s</i> and <i>t</i> with the total cost minimized… (More)