Francis C. M. Lau

ORCID: 0000-0003-1082-9333
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cloud Computing and Resource Management
  • Parallel Computing and Optimization Techniques
  • Distributed and Parallel Computing Systems
  • Distributed systems and fault tolerance
  • Caching and Content Delivery
  • IoT and Edge/Fog Computing
  • Advanced Image and Video Retrieval Techniques
  • Image Retrieval and Classification Techniques
  • Peer-to-Peer Network Technologies
  • Computer Graphics and Visualization Techniques
  • Web Data Mining and Analysis
  • Opportunistic and Delay-Tolerant Networks
  • Advanced Data Storage Technologies
  • Advancements in Solid Oxide Fuel Cells
  • Context-Aware Activity Recognition Systems
  • Topic Modeling
  • Human Motion and Animation
  • Mobile Ad Hoc Networks
  • Video Analysis and Summarization
  • Music and Audio Processing
  • Advanced MIMO Systems Optimization
  • Mobile Agent-Based Network Management
  • Catalysts for Methane Reforming
  • Cooperative Communication and Network Coding
  • 3D Shape Modeling and Analysis

University of Hong Kong
2016-2025

Hong Kong Polytechnic University
2024

Chinese University of Hong Kong
2008-2023

Southern University of Science and Technology
2021

Jinan University
2017-2019

University of Calgary
2016

University of Waterloo
1984-2009

Hong Kong Baptist University
2005

Neural network models have been demonstrated to be capable of achieving remarkable performance in sentence and document modeling. Convolutional neural (CNN) recurrent (RNN) are two mainstream architectures for such modeling tasks, which adopt totally different ways understanding natural languages. In this work, we combine the strengths both propose a novel unified model called C-LSTM representation text classification. utilizes CNN extract sequence higher-level phrase representations, fed...

10.48550/arxiv.1511.08630 preprint EN other-oa arXiv (Cornell University) 2015-01-01

Cloud computing, rapidly emerging as a new computation paradigm, provides agile and scalable resource access in utility-like fashion, especially for the processing of big data. An important open issue here is to efficiently move data, from different geographical locations over time, into cloud effective processing. The de facto approach hard drive shipping not flexible or secure. This work studies timely, cost-minimizing upload massive, dynamically-generated, geo-dispersed data cloud, using...

10.1109/jsac.2013.131211 article EN IEEE Journal on Selected Areas in Communications 2013-12-01

In edge-cloud computing, a set of servers (called edge servers) are deployed near the mobile devices to allow these offload their jobs and subsequently obtain results from with low latency. One fundamental problem in systems is how dispatch schedule so that job response time (defined as interval between release arrival computation result at device) minimized. this paper, we propose general model for problem, where generated arbitrary order times then offloaded both upload download delays....

10.1109/tnet.2019.2953806 article EN IEEE/ACM Transactions on Networking 2019-11-28

Chinese calligraphy is among the finest and most important of all art forms an inseparable part history. Its delicate aesthetic effects are generally considered to be unique calligraphic arts. subtle power integral traditional painting. A novel intelligent system uses a constraint-based analogous-reasoning process automatically generate original that meets visually requirements. We propose can create novel, aesthetically appealing from few training examples existing styles. To demonstrate...

10.1109/mis.2005.41 article EN IEEE Intelligent Systems 2005-05-01

Network Function Virtualization (NFV) is a promising technology that promises to significantly reduce the operational costs of network services by deploying virtualized functions (VNFs) commodity servers in place dedicated hardware middleboxes. The VNFs are typically running on virtual machine instances cloud infrastructure, where virtualization enables dynamic provisioning VNF instances, process fluctuating traffic needs go through service. In this paper, we target enterprise - expressed as...

10.1109/cloud.2016.0028 article EN 2016-06-01

Efficient virtual machine (VM) management can dramatically reduce energy consumption in data centers. Existing VM algorithms fall into two categories based on whether the VMs' resource demands are assumed to be static or dynamic. The former category fails maximize utilization as they cannot adapt dynamic nature of demands. Most approaches latter heuristical and lack theoretical performance guarantees. In this work, we formulate a large-scale Markov Decision Process (MDP) problem derive an...

10.1109/infocom.2016.7524384 article EN 2016-04-01

A distributed Java Virtual Machine (DJVM) spanning multiple cluster nodes can provide a true parallel execution environment for multi-threaded applications. Most existing DJVMs suffer from the slow in interpretive mode and thus may not be efficient enough solving computation-intensive problems. We present JESSICA2, new DJVM running JIT compilation that execute applications transparently on clusters. JESSICA2 provides single system image (SSI) illusion to via an embedded global object space...

10.1109/clustr.2002.1137770 article EN 2003-06-25

We propose a new recommendation algorithm for online documents, images and videos, which is personalized. Our idea to rely on the attention time of individual users captured through commodity eye-tracking as essential clue. The prediction user interest over certain item (a document, image or video) based user's acquired using vision-based during his previous reading, browsing video watching sessions same type materials. After acquiring times collection materials, our can predict probable...

10.1145/1454008.1454023 article EN 2008-10-23

The rapidly increasing power of personal mobile devices (smartphones, tablets, etc.) is providing much richer contents and social interactions to users on the move. This trend however throttled by limited battery lifetime unstable wireless connectivity, making highest possible quality service experienced not feasible. recent cloud computing technology, with its rich resources compensate for limitations connections, can potentially provide an ideal platform support desired services. Tough...

10.1109/tmm.2013.2240670 article EN IEEE Transactions on Multimedia 2013-01-16

We introduce several novel word features for keyword extraction and headline generation. These new are derived according to the background knowledge of a document as supplied by Wikipedia. Given document, acquire its from Wikipedia, we first generate query searching Wikipedia corpus based on key facts present in document. then use find articles that closely related contents With search result article set, extract inlink, outlink, category infobox information each derive set which reflect...

10.1609/aaai.v24i1.7511 article EN Proceedings of the AAAI Conference on Artificial Intelligence 2010-07-05

We propose a new document summarization algorithm which is personalized. The key idea to rely on the attention (reading) time of individual users spent single words in as essential clue. prediction user over every word based user's during his previous reads, acquired via vision-based commodity eye-tracking mechanism. Once attentions small collection are known, our can predict through semantics analysis. Our then summarizes according document. With algorithm, we have developed prototype...

10.1145/1502650.1502656 article EN 2009-02-08

A coflow is a collection of related parallel flows that occur typically between two stages multi-stage computing task in network, such as shuffle MapReduce. The abstraction allows applications to convey their semantics the network so application-level requirements can be better satisfied. In this paper, we study routing and scheduling multiple coflows minimize total weighted completion time (CCT). We first propose rounding-based randomized approximation algorithm, called OneCoflow, for...

10.1109/tnet.2019.2930721 article EN IEEE/ACM Transactions on Networking 2019-08-14

We present a novel reinforcement learning architecture that learns structured representation for use in symbolic melody harmonization. Probabilistic models are predominant harmonization tasks, most of which only treat notes as independent observations and do not take note substructures the melodic sequence. To fill this gap, we add substructure discovery crucial step automatic chord generation. The proposed method consists module generates hierarchical structures melodies, policy to break...

10.3390/electronics10202469 article EN Electronics 2021-10-11

An automatic algorithm can generate Chinese calligraphy by quantitatively representing the characteristics of personal handwriting acquired from learning examples.

10.1109/mis.2009.23 article EN IEEE Intelligent Systems 2009-03-01

Efficient virtual machine (VM) management can dramatically reduce energy consumption in data centers. Existing VM algorithms fall into two categories based on whether the VMs' resource demands are assumed to be static or dynamic. The former category fails maximize utilization as they cannot adapt dynamic nature of demands. Most approaches latter heuristic and lack theoretical performance guarantees. In this paper, we formulate a large-scale Markov decision process (MDP) problem derive an...

10.1109/tnet.2019.2891787 article EN publisher-specific-oa IEEE/ACM Transactions on Networking 2019-01-25

Target-specific stance detection on social media, which aims at classifying a textual data instance such as post or comment into class of target issue, is an emerging opinion mining paradigm importance. An example application would be to overcome vaccine hesitancy in combating the coronavirus pandemic. Existing strategies rely merely individual instances cannot always capture expressed given target. We address new task called conversational (CSD) infer toward (e.g., COVID-19 vaccination)...

10.1109/tcss.2023.3320723 article EN IEEE Transactions on Computational Social Systems 2023-10-13

We present an adaptive fault-tolerant wormhole routing algorithm for 2D meshes. The main feature is that with the algorithm, a normal message, when blocked by some faulty processes would detour along f-polygons around fault region. proposed can tolerate convex faults only three virtual channels per physical channel regardless of overlapping different regions. deadlock-free.

10.1109/ipdps.2001.925000 article EN 2002-11-13

Training a computer to evaluate the aesthetics of Chinese characters provides feedback mechanism improve quality automatically generated calligraphy.

10.1109/mis.2012.46 article EN IEEE Intelligent Systems 2012-05-01

Auction design has recently been studied for dynamic resource bundling and VM provisioning in IaaS clouds, but is mostly restricted to the one-shot or offline setting. This work targets a more realistic case of online auction design, where: (i) cloud users bid resources into future assemble customized VMs with desired occupation durations; (ii) provider dynamically packs multiple types on heterogeneous physical machines (servers) requested VMs; (iii) operational costs servers are considered...

10.1145/2796314.2745855 article EN ACM SIGMETRICS Performance Evaluation Review 2015-06-15
Coming Soon ...