Search For:

Displaying 1-40 out of 40 total
An Adaptive Multipath Protocol for Efficient IP Handoff in Mobile Wireless Networks
Found in: Advanced Information Networking and Applications, International Conference on
By Ken C.K. Tsang, Roy S.C. Ho, Mark C.M. Tsang, Cho-Li Wang, Francis C.M. Lau
Issue Date:April 2006
pp. 503-510
Achieving IP handoff with a short latency and minimal packet loss is essential for mobile devices that roam across IP subnets. Many existing solutions require changes to be made to the network or transport layer, and they tend to suffer from long handoff l...
 
Automatic Generation of Artistic Chinese Calligraphy
Found in: IEEE Intelligent Systems
By Songhua Xu, Francis C.M. Lau, William K. Cheung, Yunhe Pan
Issue Date:May 2005
pp. 32-39
This intelligent system can automatically generate new Chinese calligraphy artwork to meet visually aesthetic requirements. The system first extracts the hierarchical parametric representations of Chinese characters from input images of existing calligraph...
 
Computationally Evaluating and Reproducing the Beauty of Chinese Calligraphy
Found in: IEEE Intelligent Systems
By Songhua Xu,Hao Jiang,Francis C.M. Lau,Yunhe Pan
Issue Date:May 2012
pp. 63-72
Training a computer to evaluate the aesthetics of Chinese characters provides a feedback mechanism to improve the quality of automatically generated calligraphy.
 
Implementation of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs
Found in: IEEE Transactions on Parallel and Distributed Systems
By Yue Zhao,Francis C.M. Lau
Issue Date:March 2014
pp. 663-672
In this paper, efficient LDPC block-code decoders/simulators which run on graphics processing units (GPUs) are proposed. We also implement the decoder for the LDPC convolutional code (LDPCCC). The LDPCCC is derived from a predesigned quasi-cyclic LDPC bloc...
 
Aggregation Latency-Energy Tradeoff in Wireless Sensor Networks with Successive Interference Cancellation
Found in: IEEE Transactions on Parallel and Distributed Systems
By Hongxing Li,Chuan Wu,Dongxiao Yu,Qiang-Sheng Hua,Francis C.M. Lau
Issue Date:November 2013
pp. 2160-2170
Minimizing latency and energy consumption is the prime objective of the design of data aggregation in battery-powered wireless networks. A tradeoff exists between the aggregation latency and the energy consumption, which has been widely studied under the p...
 
Exploring the Sustainability of Credit-incentivized Peer-to-Peer Content Distribution
Found in: 2012 32nd International Conference on Distributed Computing Systems Workshops (ICDCS Workshops)
By Xuanjia Qiu,Wei Huang,Chuan Wu,Zongpeng Li,Francis C.M. Lau
Issue Date:June 2012
pp. 118-126
Credit-based incentives were proposed to incite peer contributions in P2P content distribution systems. Their effectiveness was extensively analyzed from a game theory perspective. Little attention however has been paid to a potential threat to such system...
 
An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks
Found in: Distributed Computing in Sensor Systems and Workshops, International Conference on
By Dongxiao Yu,Qiang-Sheng Hua,Yuexuan Wang,Francis C.M. Lau
Issue Date:May 2012
pp. 132-139
The unstructured multi-hop radio network model, with asynchronous wake-up, no collision detection and little knowledge on the network topology, is proposed for capturing the particularly harsh characteristics of initially deployed wireless adhoc and sensor...
 
Utility-Maximizing Data Dissemination in Socially Selfish Cognitive Radio Networks
Found in: Mobile Ad-Hoc and Sensor Systems, IEEE International Conference on
By Hongxing Li,Wei Huang,Chuan Wu,Zongpeng Li,Francis C.M. Lau
Issue Date:October 2011
pp. 212-221
In cognitive radio networks, the occupation patterns of the primary users can be very dynamic, which makes optimization (e.g., utility maximization) of data dissemination among secondary users difficult. Even under the assumption that all secondary users a...
 
CloudMedia: When Cloud on Demand Meets Video on Demand
Found in: Distributed Computing Systems, International Conference on
By Yu Wu, Chuan Wu, Bo Li, Xuanjia Qiu, Francis C.M. Lau
Issue Date:June 2011
pp. 268-277
Internet-based cloud computing is a new computing paradigm aiming to provide agile and scalable resource access in a utility-like fashion. Other than being an ideal platform for computation-intensive tasks, clouds are believed to be also suitable to suppor...
 
Automatic Generation of Chinese Calligraphic Writings with Style Imitation
Found in: IEEE Intelligent Systems
By Songhua Xu, Hao Jiang, Tao Jin, Francis C.M. Lau, Yunhe Pan
Issue Date:March 2009
pp. 44-53
An automatic algorithm can generate Chinese calligraphy by quantitatively representing the characteristics of personal handwriting acquired from learning examples.
 
Handoff Performance Comparison of Mobile IP, Fast Handoff and mSCTP in Mobile Wireless Networks
Found in: Parallel Architectures, Algorithms, and Networks, International Symposium on
By Ken C.K. Tsang, Cho-Li Wang, Francis C.M. Lau
Issue Date:May 2008
pp. 45-52
We compare the performance of three handoff protocols, namely Mobile IP, Fast Handoff and mSCTP. Among the three schemes, Mobile IP suffers from the lowest data throughput and longest handoff latency. Fast Handoff can perform better, provided that the mobi...
 
Process reassignment with reduced migration cost in grid load rebalancing
Found in: Parallel and Distributed Processing Symposium, International
By Lin Chen, Cho-Li Wang, Francis. C.M. Lau
Issue Date:April 2008
pp. 1-13
We study the load rebalancing problem in a heterogeneous grid environment that supports process migration. Given an initial assignment of tasks to machines, the problem consists of finding a process reassignment that achieves a desired better level of load...
 
Lightweight process migration and memory prefetching in openMosix
Found in: Parallel and Distributed Processing Symposium, International
By Roy S.C. Ho, Cho-Li Wang, Francis C.M. Lau
Issue Date:April 2008
pp. 1-12
We propose a lightweight process migration mechanism and an adaptive memory prefetching scheme called AMPoM (AdaptiveMemory Prefetching in openMosix), whose goal is to reduce the migration freeze time in openMosix while ensuring the execution efficiency of...
 
Relationship-aware Content Adaptation of Structured Web Documents for Mobile Computing
Found in: Parallel and Distributed Systems, International Conference on
By Wai Yip Lum, Francis C.M. Lau
Issue Date:July 2005
pp. 168-174
<p>Given the constrained display area of mobile devices, existing desktop-oriented web contents would be a mismatch for these devices if there is not a mechanism to suitably adapt the contents. In this paper, we propose a content analysis module whic...
 
On The Cooperation ofWeb Clients and Proxy Caches
Found in: Parallel and Distributed Systems, International Conference on
By Yiu Fai Sit, Francis C.M. Lau, Cho-Li Wang
Issue Date:July 2005
pp. 264-270
<p>Web proxy cache has become universal to the Internet?s infrastructure. It reduces the time to deliver content and the demand on the costly external network bandwidth. The wide employment of web proxy caches creates an illusion that they are functi...
 
Smart Retrieval and Sharing of Information Resources Based on Contexts of User-Information Relationships
Found in: Advanced Information Networking and Applications, International Conference on
By Wai-Kwong Wing, Francis C.M. Lau, Cho-Li Wang
Issue Date:March 2005
pp. 529-534
Information resources on their own present only the information they contain. The relationship between the resources and the users is usually neglected. By exploiting the relationship between the user and information resources in theform of context, which ...
 
Grid Computing in Hong Kong: Research and Development
Found in: Future Trends of Distributed Computing Systems, IEEE International Workshop
By Francis C.M. Lau, Roy S.C. Ho, C.L. Wang
Issue Date:May 2004
pp. 205-208
Grid is a new exciting arena for re-application of many distributed computing techniques from the past as well as brand new ideas because of new requirements imposed upon by a form of computing that was never possible before. We present the Hong Kong Grid ...
 
User-Centric Content Negotiation for Effective Adaptation Service in Mobile Computing
Found in: IEEE Transactions on Software Engineering
By Wai Yip Lum, Francis C.M. Lau
Issue Date:December 2003
pp. 1100-1111
<p><b>Abstract</b>—We address the challenges of building a good content adaptation service for mobile devices and propose a decision engine that is user-centric with QoS awareness, which can automatically negotiate for the appropriate ada...
 
Towards a Single System Image for High-Performance Java
Found in: Parallel Processing Workshops, International Conference on
By Francis C.M. Lau
Issue Date:October 2003
pp. 143
No summary available.
 
M-JavaMPI: A Java-MPI Binding with Process Migration Support
Found in: Cluster Computing and the Grid, IEEE International Symposium on
By Ricky K. K. Ma, Cho-Li. Wang, Francis C.M. Lau
Issue Date:May 2002
pp. 255
Several Java bindings to the Message Passing Interface (MPI) software have been developed for high-performance parallel Java-based computing with message-passing in the past. None of them however addressed the issue of supporting transparent Java process m...
 
Multiphase Minimal Fault-Tolerant Wormhole Routing in 2D Meshes
Found in: Parallel and Distributed Systems, International Conference on
By Jipeng Zhou, Francis C.M. Lau
Issue Date:June 2001
pp. 0323
Abstract: A fault-tolerant wormhole routing algorithm using multiphase minimal routing paths for mesh networks is proposed in this paper. When routing messages come in contact with a fault region, they always select a local shortest path around the fault-r...
 
Adaptive Fault-Tolerant Wormhole Routing in 2D Meshes
Found in: Parallel and Distributed Processing Symposium, International
By Jipeng Zhou, Francis C.M. Lau
Issue Date:April 2001
pp. 10056b
We present an adaptive fault-tolerant wormhole routing algorithm for 2D meshes. The main feature is that with the algorithm, a normal routing message, when blocked by some faulty processor, would detour along the f-polygons around the fault region. The pro...
 
Tighter Layouts of the Cube-Connected Cycles
Found in: IEEE Transactions on Parallel and Distributed Systems
By Guihai Chen, Francis C.M. Lau
Issue Date:February 2000
pp. 182-191
<p><b>Abstract</b>—Preparata and Vuillemin proposed the cube-connected cycles (<tmath>${\cal {CCC}}$</tmath>) and its compact layout in 1981 [<ref type=
 
Curricula 2001: A Brief Summary
Found in: Future Trends of Distributed Computing Systems, IEEE International Workshop
By Francis C.M. Lau, Carl K. Chang
Issue Date:December 1999
pp. 290
Model curricula are important resources for curricula planning and design. A joint task force between IEEE-CS and ACM was formed to undertake the responsibility of revising the 1991 model curricula. The effort is now under-way, and the result will be known...
 
On the Space Requirement of Interval Routing
Found in: IEEE Transactions on Computers
By Savio S.H. Tse, Francis C.M. Lau
Issue Date:July 1999
pp. 752-757
<p><b>Abstract</b>—Interval routing is a space-efficient method for point-to-point networks. It is based on labeling the edges of a network with intervals of vertex numbers (called interval labels). An <tmath>$M$</tmath>-label...
 
Comments on
Found in: IEEE Transactions on Parallel and Distributed Systems
By Guihai Chen, Francis C.M. Lau
Issue Date:December 1997
pp. 1299-1300
<p><b>Abstract</b>—Vadapalli and Srimani [<ref rid=
 
Optimal Layouts of Midimew Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Francis C.M. Lau, Guihai Chen
Issue Date:September 1996
pp. 954-961
<p><b>Abstract</b>—Midimew networks [<ref rid=
 
Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers
Found in: IEEE Transactions on Parallel and Distributed Systems
By Chengzhong Xu, Francis C.M. Lau
Issue Date:May 1996
pp. 537-544
<p><b>Abstract</b>—We propose a simple algorithm which is based on edge-coloring of system graphs for termination detection of loosely synchronous computations. The proposed algorithm is fully symmetric in that all processors run syntacti...
 
An Approximation Solution for the 2-Median Problem on Two-Dimensional Meshes
Found in: Advanced Information Networking and Applications, International Conference on
By Savio S.H. Tse, Francis C.M. Lau
Issue Date:March 2005
pp. 457-460
We study the p-median problem which is one of the classical problems in location theory. For p = 2 and on a two-dimensional mesh, we give an 0(m² + q log q)-time approximation algorithm for solving the problem with worst-case ratio 1.5 + δ on the communica...
 
Optimal Data Reduction on Reconfigurable Tori
Found in: Parallel and Distributed Systems, International Conference on
By Jipeng Zhou, Francis C.M. Lau
Issue Date:June 2001
pp. 0249
Abstract: Data reduction is a fundamental operation of parallel computing. We derive lower bounds on communication latency for global data reduction and multiple global data reduction on reconfigurable tori. We present optimal global data reduction algorit...
 
Dynamic Component Composition for Functionality Adaptation in Pervasive Environments
Found in: Future Trends of Distributed Computing Systems, IEEE International Workshop
By Nalini Moti Belaramani, Cho-Li Wang, Francis C.M. Lau
Issue Date:May 2003
pp. 226
With the increasing prevalence of mobile devices, computing is being carried out on devices with varied resource constraints and is afflicted by constant changes in run-time contexts. It becomes a requirement for software systems to be able to adapt approp...
 
Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets
Found in: IEEE Transactions on Parallel and Distributed Systems
By Francis C.M. Lau, Shi-Heng Zhang
Issue Date:April 2002
pp. 349-358
<p>Gossiping is the communication problem in which each node has a unique message (token) to be transmitted to every other node. The nodes exchange their tokens by packets. A solution to the problem is judged by how many rounds of packet sending it r...
 
Distance-Vector Routing Protocols for Networks with Unidirectional Link
Found in: Parallel Processing Workshops, International Conference on
By Guihai Chen, Peng Du, Li Xie, Francis C.M. Lau
Issue Date:September 2001
pp. 0473
Abstract: We first introduce a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two...
 
A Tight Layout of the Cube-Connected Cycles
Found in: High-Performance Computing, International Conference on
By Guihai Chen, Francis C.M. Lau
Issue Date:December 1997
pp. 422
Preparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981 [16], and in the same paper, gave an asymptotically-optimal layout scheme for the CCC. We give a new layout scheme for the CCC which requires less than half of the area of the Prepara...
 
vSkyConf: cloud-assisted multi-party mobile video conferencing
Found in: Proceedings of the second ACM SIGCOMM workshop on Mobile cloud computing (MCC '13)
By Bo Li, Chuan Wu, Francis C.M. Lau, Yu Wu
Issue Date:August 2013
pp. 33-38
As an important application in today's busy world, mobile video conferencing facilitates people's virtual face-to-face communication with friends, families and colleagues, via their mobile devices on the move. However, how to provision high-quality, multi-...
     
InstantLeap: fast neighbor discovery in P2P VoD streaming
Found in: Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video (NOSSDAV '09)
By Chuan Wu, Francis C.M. Lau, Xiaola Lin, Xuanjia Qiu
Issue Date:June 2009
pp. 1-22
A fundamental challenge in peer-to-peer (P2P) Video-on-Demand (VoD) streaming is to quickly locate new supplying peers whenever a VCR command is issued, in order to achieve smooth viewing experiences. For most existing commercial systems which resort to tr...
     
User-oriented document summarization through vision-based eye-tracking
Found in: Proceedingsc of the 13th international conference on Intelligent user interfaces (IUI '09)
By Francis C.M. Lau, Hao Jiang, Songhua Xu
Issue Date:February 2009
pp. 653-654
We propose a new document summarization algorithm which is personalized. The key idea is to rely on the attention (reading) time of individual users spent on single words in a document as the essential clue. The prediction of user attention over every word...
     
Personalized online document, image and video recommendation via commodity eye-tracking
Found in: Proceedings of the 2008 ACM conference on Recommender systems (RecSys '08)
By Francis C.M. Lau, Hao Jiang, Songhua Xu
Issue Date:October 2008
pp. 1-2
We propose a new recommendation algorithm for online documents, images and videos, which is personalized. Our idea is to rely on the attention time of individual users captured through commodity eye-tracking as the essential clue. The prediction of user in...
     
Exact and approximate link scheduling algorithms under the physical interference model
Found in: Proceedings of the fifth international workshop on Foundations of mobile computing (DIAL M-POMC '08)
By Francis C.M. Lau, Qiang-Sheng Hua
Issue Date:August 2008
pp. 1-2
Given n arbitrarily distributed single-hop wireless links, using the physical interference model, the objective is to minimize the scheduling length. This is an open problem (Problem 1) proposed by Locher et al. [21]. In this paper, we solve this open prob...
     
On balancing between transcoding overhead and spatial consumption in content adaptation
Found in: Proceedings of the eighth annual international conference on Mobile computing and networking (MobiCom '02)
By Francis C.M. Lau, Wai Yip Lum
Issue Date:September 2002
pp. 239-250
We propose a method that can find the optimal tradeoff point between transcoding overhead (CPU cost) and storage needed for the various pre-processed content variants (I/O cost). The method selectively pre-adapts a subset of content variants and leaves the...
     
 1