Time filter

Source Type

Liu A.,Hefei University of Technology | Liu A.,CityU USTC Advanced Research Institute | Liu A.,Wuhan University | Li Q.,City University of Hong Kong | And 3 more authors.
Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012 | Year: 2012

Reputation is useful for establishing trust between Web service (WS) providers and WS consumers. In the context of WS composition, a challenging issue of reputation management is to propagate a user's impression of a composite WS (i.e., the user's feedback rating) to its component WSs. In this paper, we propose a Shapley value based approach which can achieve fair impression propagation, that is, the reputation of a component WS is never awarded (or penalized) for the good (or bad) performances of the other peer component WSs in the same composite WS. The fairness of the proposed approach is validated through theoretical analysis and experimental results. © 2012 IEEE.

Quan X.,City University of Hong Kong | Liu G.,City University of Hong Kong | Lu Z.,City University of Hong Kong | Ni X.,City University of Hong Kong | And 4 more authors.
Knowledge and Information Systems | Year: 2010

In this paper, we propose a new method for measuring the similarity between two short text snippets by comparing each of them with the probabilistic topics. Specifically, our method starts by firstly finding the distinguishing terms between the two short text snippets and comparing them with a series of probabilistic topics, extracted by Gibbs sampling algorithm. The relationship between the distinguishing terms of the short text snippets can be discovered by examining their probabilities under each topic. The similarity between two short text snippets is calculated based on their common terms and the relationship of their distinguishing terms. Extensive experiments on paraphrasing and question categorization show that the proposed method can calculate the similarity of short text snippets more accurately than other methods including the pure TF-IDF measure. © 2009 Springer-Verlag London Limited.

Shi L.,CityU USTC Advanced Research Institute | Shi L.,Hefei University of Technology | Shi L.,City University of Hong Kong | Xue C.J.,City University of Hong Kong | Zhou X.,Hefei University of Technology
Real-Time Technology and Applications - Proceedings | Year: 2011

Flash memory is becoming the storage media of choice for mobile devices and embedded systems. The performance of flash memory is impacted by the asymmetric speed of read and write operations, limited number of erase times and the absence of in-place updates. To improve the performance of flash memory based systems, write buffer cache has been equipped in flash memories recently. At the same time, new virtual memory management strategies have been proposed in recent studies that consider the characteristics of flash memory. In this paper, we propose cooperative management schemes for virtual memory and write buffer cache to improve performance of flash memory based systems. Management on virtual memory is designed to exploit the write buffer cache status and management on write buffer cache is designed to cooperate with virtual memory to improve flash memory performance. The experimental results show that the proposed approaches can improve I/O performance by 34.8% on average, and reduce the number of erase and write operations by 44.7% and 28.6% on average. © 2011 IEEE.

Ye F.,Hefei University of Technology | Ye F.,CityU USTC Advanced Research Institute | Ye F.,City University of Hong Kong | Li Q.,CityU USTC Advanced Research Institute | And 3 more authors.
World Wide Web | Year: 2011

Mobile Peer to Peer (MP2P) networks provide decentralization, self-organization, scalability characters, but suffer from high latency and link break problems. In this paper, we study the cache/replication placement and cache update problems arising in such kind of networks. While researchers have proposed various replication placement algorithms to place data across the network to address the problem, it was proven as NP-hard. As a result, many heuristic algorithms have been brought forward for solving the problem. In this article, we propose an effective and low cost cache placement strategy combined with an update scheme which can be easily implemented in a decentralized way. The contribution of this paper is the adaptive and flexible cache placement and update algorithms designed for real MP2P network usage. The combination of MP2P cache placement and update is the novelty of this article. Extensive experiments are conducted to demonstrate the efficiency of the cache placement and update scheme. © 2010 Springer Science+Business Media, LLC.

Liu A.,Hefei University of Technology | Liu A.,City University of Hong Kong | Liu A.,CityU USTC Advanced Research Institute | Li Q.,City University of Hong Kong | And 3 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

Web services cannot be always available as they are typically deployed in a dynamic environment. As an effective approach to improving Web services availability, replication has received much attention recently. How to design an optimal replication scheme with the best QoS, however, remains an open problem due to its inherent computational hardness. In this paper, we propose an efficient approach to designing a near-optimal replication scheme. We adopt directed acyclic graph (DAG) as the modeling tool for replication scheme and then utilize DAG coding for performance optimization. Simulation results show our approach can generate a near-optimal replication scheme with acceptable computation overheads. © 2011 Springer-Verlag.

Discover hidden collaborations