Learn More
Article history: Received 8 November 2013 Received in revised form 20 January 2014 Accepted 27 January 2014 Available online 31 January 2014 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(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, 2),(More)
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 G = (V, E) be a given graph with nonnegative integral edge cost and delay, S ⊆ V be a terminal set and r ∈ S be the selected root. The shallow-light Steiner tree (SLST) problem is to compute a minimum cost tree spanning the terminals of S, such that the delay between r and every other terminal is bounded by a given delay constraint D(More)
For a given graph G = (V, E) with a terminal set S and a selected root r ∈ S, a positive integer cost and a delay on every edge and a delay constraint D ∈ Z, the shallow-light Steiner tree (SLST ) problem is to compute a minimum cost tree spanning the terminals of S, in which the delay between root and every vertex is restrained by D. This problem is(More)