DEPT OF COMPUTER SCIENCE
|
Researcher
: Bai Z |
|
List of Research Outputs |
|
Bai
Z. and Huo
Q., A Study of Nonlinear Shape Normalization for Online Handwritten
Chinese Character Recognition: Dot Density vs. Line Density Equalization, 2006
International Conference on Pattern Recognition. |
|
List of Research Outputs |
|
Lau
F.C.M., Belaramani N.M.,
Kwan V.J.W.M., Siu P.L.P., Wing W.K. and Wang C.L., Code-on-Demand and Code
Adaptation for Mobile Computing, The Handbook of |
|
Researcher
: Cao H |
|
List of Research Outputs |
|
Cao H., Pattern Discovery From Spatiotemporal Data, 2006. |
|
Researcher
: Cao HP |
|
List of Research Outputs |
|
Cao H.P., Mamoulis N. and Cheung D.W.L., Discovery of Collocation Episodes in Spatiotemporal Data, The 6th IEEE International Conference on Data Mining. 2006. |
|
Cao H.P., Mamoulis N., Cheung D.W.L. and Yip K., Discovery of Periodic Patterns in Spatiotemporal Sequences, IEEE Transaction on Knowledge and Data Engineering. IEEE Computer Society, 2007, 19: 453-467. |
|
Researcher
: Chan BMY |
|
List of Research Outputs |
|
Chan
B.M.Y., Chan W.T., Chin F.Y.L., Fung S.P.Y. and Kao M.Y.,
Linear-Time Haplotype Inference on Pedigrees without Recombinations, The
6th Workshop on Algorithms in Bioinformatics (WABI 2006). |
|
Researcher
: Chan HL |
|
List of Research Outputs |
|
Chan H.L., Lam T.W., Sung W.K., Tam S.L. and Wong S.S., A Linear Size Index for Approximate Pattern Matching, The 17th Annual Symposium on Combinatorial Pattern Matching (CPM). Springer, 2006, LNCS 4009: 49-59. |
|
Chan H.L., Lam T.W., Sung W.K., Tam S.L. and Wong S.S., Compressed Indexes for Approximate String Matching, In: Yossi Azar, Thomas Erleback, 14th Annual European Symposium on Algorithms (ESA). Springer, 2006, LNCS 4168: 208-219. |
|
Chan H.L., Hon W.K., Lam T.W. and Sadakane K., Compressed Indexes for Dynamic Text Collections, ACM Transactions on Algorithms (TALG). 2007, 3:2: Article 21, pages 1-29. |
|
Chan H.L., Lam T.W. and Wong P., Efficiency of Data Distribution in BitTorrent-like Systems , The 3rd International Conference on Algorithmic Aspects in Information and Management . 2007, 378-388. |
|
Chan H.L., Chan W.T., Lam T.W., Lee L.K., Mak K.S. and Wong P., Energy Efficient Online Deadline Scheduling , The 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2007, 795-804. |
|
Chan H.L., New Algorithms for On-line Scheduling, 2007. |
|
Chan H.L., Jannson J., Lam T.W. and Yiu S.M., Reconstructing An Ultrametric Galled Phylogenetic Network From A Distance Matrix , Journal of Bioinformatics and Computational Biology. World Scientific, 2006, 4: 4: 807-832. |
|
Researcher
: Chan HW |
|
Project Title: |
Anonymity in Web transactions |
|
Investigator(s): |
Chan HW |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Small Project Funding |
|
Start Date: |
01/2006 |
|
Abstract: |
|
Privacy issue is always a concern for certain individuals with the proliferation of emails and transactions on the Web. In most of the current communication systems, information such as our identity (IP address) is exposed and kept by another party. Web server log files contain information about the users who visit them and the content they access. The server can record the user's IP address and often the user's Internet domain name, workplace, and/or approximate location, the type of computing platform used. The Web page that referred the user to this site and the server that is going to be visited next are all possibly contained within the request header. Even when the user's IP address changes between browsing sessions (e.g., the IP address is assigned dynamically using DHCP), a Web server can link multiple sessions by the same user by planting a unique cookie in the user' s browser during the first browsing session, and retrieving that cookie in subsequent sessions. Thus, various sites on the Internet collect a great amount of personal information about the individuals who visit them. This information can be used to generate consumer and communication profiles. The same monitoring capabilities are available to the user's ISP or local gateway administrator who can observe all communication in which the user participates. The user's profile made possible by such monitoring capabilities is viewed as a useful tool because a Web server can use such information to personalize its content for its users. However, user's privacy is compromised. In spite of a lack of privacy has always characterized Internet communication, a general acceptance that Internet communication has been logged universally and revealed so much about the personal tastes of its users is to be scrutinized. Web users should have the ability to limit what information is revealed about them and to whom it is revealed. While encrypting communication to and from web servers (e.g., using SSL) can hide the content of the transaction from an Internet service provider, or a local system administrator, they can still learn a lot about the client and server computers, the length of the data being exchanged, and the time and frequency of exchanges. Encryption indeed does little to protect the privacy of the client from the server. A web server can record the Internet addresses at which its clients reside, the servers that referred the clients to it, and the times and frequencies of accesses by its clients. Although some approaches enable users to negotiate the conditions under which they will share potentially private information with a Web server, these negotiations apply only to the server, only for certain kinds of information (for example, not the user's IP address), cannot be enforced, and are not presently widely practised. Other methods are definitely needed as well. Anonymity is a way not to release the identity and personal information of the individual. With the use of a proxy server, some degree of anonymity can be provided. However, it may still be possible to reveal our approximate location by examining the address of proxy server. Advertising company can use the information collected to decide which banner to show according to user location. With the use of cookies, the behavior of a visitor can be tracked when he/she visits another site embedded with web bugs. Therefore, individual privacy on the Internet is endangered and is of utmost concern for some. Since privacy cannot be protected solely by legislation, technologies that can be used to enforce privacy are needed. Anonymity for privacy protection is one possible solution, because if users are anonymous on a network, they need not worry about the loss of their privacy. The aim of the research is to design an efficient scheme for anonymous communication in web transactions. With such scheme, involved party should not be able to have an idea of whom and where the information requester is. |
|
List of Research Outputs |
|
Wang M., Li L., Yiu S.M., Hui C.K., Chong C.F., Chow K.P., Tsang W.W., Chan H.W. and Pun K.H., A Hybrid Approach for
Authenticating MPEG-2 Streaming Data, Proceedings of Multimedia Content
Analysis and Mining International Workshop (MCAM 2007). |
|
Researcher
: Chan KP |
|
List of Research Outputs |
|
Chan
K.P., Chen T.Y. and Towey D.P., Forgetting Test Cases, 30th
Annual Internation Computer Software and Application Conference (COMPSAC
2006). |
|
Chan
K.P., Chen T.Y. and Towey D.P., Probabilistic Adaptive
Random Testing, Six International Conference on Quality Software (QSIC
2006). |
|
Chen Y. and Chan K.P., Using Data Mining Techniques And Rough Set Theory For Language Modeling, ACM Transactions on Asian Language Information Processing. 2007, 6. |
|
Researcher
: Chan WK |
|
List of Research Outputs |
|
Chan W.K., Chen T.Y., Lu H., Tse T.H. and Yau S.S., Integration testing of context-sensitive middleware-based applications: a metamorphic approach, International Journal of Software Engineering and Knowledge Engineering. Singapore, World Scientific, 2006, 16 (5): 677−703. |
|
Chan W.K., Cheung S.C., Ho J.C.F. and Tse T.H., Reference models and automatic oracles for the testing of mesh simplification software for graphics rendering, Proceedings of the 30th Annual International Computer Software and Applications Conference (COMPSAC 2006), IEEE Computer Society Press, Los Alamitos, California. 2006, 429−438. |
|
Chan
W.K., Chen
T.Y., Cheung S.C., Tse T.H. and Zhang Z., Towards the testing of
power-aware software applications for wireless sensor networks, Reliable
Software Technologies: Ada-Europe 2007, N. Abdennadher and F. Kordon (eds.),
Lecture Notes in Computer Science, vol. 4498, Springer, |
|
Hu P., Zhang Z., Chan W.K. and Tse T.H., An empirical comparison between direct and indirect test result checking approaches , Proceedings of the 3rd International Workshop on Software Quality Assurance (SOQUA 2006) (in conjunction with the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering (SIGSOFT 2006/FSE-14)), ACM Press, New York. 2006, 6−13. |
|
Lu H., Chan W.K. and Tse T.H., Static slicing for pervasive programs, Proceedings of the 6th International Conference on Quality Software (QSIC 2006), IEEE Computer Society Press, Los Alamitos, California. 2006, 185−192. |
|
Lu
H., Chan W.K. and Tse T.H., Testing context-aware
middleware-centric programs: a data flow approach and an RFID-based
experimentation, Proceedings of the 14th ACM SIGSOFT International
Symposium on Foundations of Software Engineering (SIGSOFT 2006/FSE-14), ACM
Press, |
|
Researcher
: Chan WT |
|
Project Title: |
Algorithm issues on on-request data dissemination: scheduling algorithms and performance guarantee |
|
Investigator(s): |
Chan WT, Lam TW, Ting HF |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
12/2003 |
|
Abstract: |
|
To solve the problem on deciding when to disseminate which page so as to optimize a pre-defined performance measure, such as the response time of a request, by giving online scheduling algorithms with performance guarantee; to introduce a formal performance comparison analysis between two (unicast or multicast) DDS with different resource settings; to study and solve the scheduling problems for some practical considerations. |
|
Researcher
: Chen L |
|
List of Research Outputs |
|
Chen L., Process Migration and Runtime Scheduling for Parallel Tasks in Computational Grids, 2007. |
|
Ma T...C..., Chen L., Wang C.L. and Lau F.C.M., G-PASS: An Instance-oriented Security Infrastructure for Grid Travelers, Concurrency and Computation: Practice and Experience. 2006, 18: 1871-1884. |
|
Researcher
: Chen TY |
|
List of Research Outputs |
|
Chan W.K., Chen T.Y., Lu H., Tse T.H. and Yau S.S., Integration testing of context-sensitive middleware-based applications: a metamorphic approach, International Journal of Software Engineering and Knowledge Engineering. Singapore, World Scientific, 2006, 16 (5): 677−703. |
|
Chan
W.K., Chen T.Y., Cheung
S.C., Tse T.H. and Zhang Z., Towards the testing of
power-aware software applications for wireless sensor networks, Reliable
Software Technologies: Ada-Europe 2007, N. Abdennadher and F. Kordon (eds.),
Lecture Notes in Computer Science, vol. 4498, Springer, |
|
Chen T.Y., Huang D.H., Tse T.H. and Zhang Z., An innovative approach to tackling the boundary effect in adaptive random testing, Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS-40), IEEE Computer Society Press, Los Alamitos, California. 2007. |
|
Researcher
: Chen Y |
|
List of Research Outputs |
|
Chen Y. and Chan K.P., Using Data Mining Techniques And Rough Set Theory For Language Modeling, ACM Transactions on Asian Language Information Processing. 2007, 6. |
|
Researcher
: Chen Z |
|
List of Research Outputs |
|
Chen Z., A Split-and-Merge Approach for Quadrilateral-Based Image Segmentation, 2007. |
|
Chen Z.,
Chin F.Y.L. and Chung H.Y., Automated Hierarchical Image
Segmentation Based on Merging of Quadrilaterals, The 6th WSEAS
International Conference on Signal Processing, Computational Geometry &
Artifical Vision (ISCGAV'06). Elounda, |
|
Chen Z.,
Chin F.Y.L. and Chung H.Y., Automated Hierarchical Image
Segmentation Based on Merging of Quadrilaterals, WSEAS Transactions on
Signal Processing. |
|
Researcher
: Cheng CK |
|
List of Research Outputs |
|
Ngai
W.K., Kao C.M., Chui C.K., Cheng C.K., Michael C.L. and Yip Y.L., Efficient Clustering of
Uncertain Data, Proceedings of the 6th IEEE International Conference on
Data Mining (ICDM 2006). |
|
Researcher
: Cheng KH |
|
List of Research Outputs |
|
Tsang
W.W. and Cheng K.H.,
The chi-square test when the expected frequencies are less than 5, Proceedings
of the COMPSTAT 2006, 17th Symposium of IASC. |
|
Researcher
: Cheung DWL |
|
Project Title: |
Mining association rules on high performance parallel systems |
|
Investigator(s): |
Cheung DWL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Outstanding RGC Projects |
|
Start Date: |
09/1998 |
|
Abstract: |
|
To study and develop algorithms and techniques for mining association rules on high performance parallel systems including the following two system paradigms: share-nothing distributed memory parallel system and share-memory parallel system. |
|
Project Title: |
A business process and information interoperability platform based on open standards |
|
Investigator(s): |
Cheung DWL, Kao CM, Lee TYT, Kwok WCH, Wong DCK, Chau PYK, Yee KC |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Innovation and Technology Support Programme |
|
Start Date: |
11/2003 |
|
Completion Date: |
07/2006 |
|
Abstract: |
|
To research and develop a business process and information interoperability platform based on international open standards and best practices available. This platform aims to support business process integration (BPI) within the enterprise and between business partners. |
|
Project Title: |
Semi-supervised Subspace Clustering for High-Dimensional Data |
|
Investigator(s): |
Cheung DWL, Ng KP |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2005 |
|
Abstract: |
|
The objectives of this project are: 1.Design and analysis of semi-supervised subspace clustering algorithms in different models. 2.Performance studies of the algorithms in both synthetic and real data. 3.Explore the applications of these algorithms in different environments. |
|
Project Title: |
Service oriented e-transaction platform |
|
Investigator(s): |
Cheung DWL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Innovation and Technology Fund Internship Programme |
|
Start Date: |
06/2006 |
|
Abstract: |
|
To extend SOA to support processing of electronic transactions between enterprises; to develop Web Service components to support reliable and secure B2B applications based on open standards; and to develop service modeling methodology and software to facilitate design of electronic transaction services. |
|
Project Title: |
Service oriented e-transaction platform |
|
Investigator(s): |
Cheung DWL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Innovation and Technology Fund Internship Programme |
|
Start Date: |
06/2006 |
|
Abstract: |
|
To extend SOA to support processing of electronic transactions between enterprises; to develop Web Service components to support reliable and secure B2B applications based on open standards; and to develop service modeling methodology and software to facilitate design of electronic transaction services. |
|
Project Title: |
Extending web 2.0 to deliver e-commerce services |
|
Investigator(s): |
Cheung DWL, Lee TYT |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Innovation and Technology Support Programme |
|
Start Date: |
09/2006 |
|
Abstract: |
|
This proposal aims to extend various Web
2.0 technologies with electronic transaction capabilities and demonstrate the
application of Web 2.0 for e-commerce. The objectives of this project are as
follows: 1. Study the potential of implementing e-commerce services using Web
2.0 and the areas to extend Web 2.0 to support B2B and B |
|
List of Research Outputs |
|
Cao H.P., Mamoulis N. and Cheung D.W.L., Discovery of Collocation Episodes in Spatiotemporal Data, The 6th IEEE International Conference on Data Mining. 2006. |
|
Cao H.P., Mamoulis N., Cheung D.W.L. and Yip K., Discovery of Periodic Patterns in Spatiotemporal Sequences, IEEE Transaction on Knowledge and Data Engineering. IEEE Computer Society, 2007, 19: 453-467. |
|
Cheung D.W.L., B2B Technology, Openning Talk, HKSAR Government Office of the Government Chief Information Officer Training Forum. 2007. |
|
Cheung
D.W.L. and Wong
D.C.K., Consultancy Project, Hang Seng Bank Document Management System
Design, Toppan Ltd., Hong Kong. |
|
Cheung
D.W.L. and Yee
K.C., Consultancy Project, Interbanking Clearing Limited Swift Network
(ICLSWN) Message System Design, |
|
Cheung
D.W.L., Yee
K.C. and Lee T.Y.T., Consultancy,
Government Electronic Trading Services, HKSAR Government Office of the
Government Chief Information Officer. |
|
Cheung
D.W.L. and Wong
D.C.K., Consultancy, Information Design for Content Standardization, Trade
Development Council, |
|
Cheung
D.W.L. and Ng
C.Y., Consultancy, Information Modeling for Garment Industry Business
Exchange, iGarment Ltd., |
|
Cheung D.W.L., Editorial Board Member, Journal of Web Services Research. Idea Group, 2007. |
|
Cheung
D.W.L. and Ng
C.Y., |
|
Cheung
D.W.L. and Ng
C.Y., |
|
Cheung D.W.L., Next Generation Government E-Service Delivery , Invited Talk, Conference on Exploring the Use of Modern Information & Communication Technology with the Academia, Government Office of the Government Chief Information Officer. 2006. |
|
Cheung
D.W.L., Security of Outsourcing Association
Rule Mining, Invited Talk, |
|
Cheung
D.W.L., Software License, TranXnet, Apacus,
Hong Kong. |
|
Cheung
D.W.L., Software License, ebXML Hermes, Apacus,
|
|
Cheung L., Yip Y.L., Cheung D.W.L., Kao C.M. and Ng K.P., On Mining Micro-array Data by Order-Preserving Submatrix, International Journal of Bioinformatics Research and Applications (IJBRA). Inder Sciences Publishers, 2007, 3: 42-64. |
|
Fung G., Yu J., Wang H., Cheung D.W.L. and Liu H., A Balanced Ensemble Approach to Weighting Classifiers for Text Classification, The 6th IEEE International Conference on Data Mining. 2006. |
|
Huang G.Q., Qu T., Cheung D.W.L. and Liang L., Extensible multi-agent system for optimal design of complex systems using analytical target cascading, International Journal of Advanced Manufacturing Technology. 2006. |
|
Tang J., Chen Z.X., Fu A.W.C. and Cheung D.W.L., Capabilities of Outlier Detection Schemes in Large Datasets: Framework and Methodologies, Knowledge and Information Systems. Springer, 2007, 11: 45-84. |
|
Wang L., Cheung D.W.L. and Yiu S.M., Maintenance of Maximal Frequent Itemsets in Large Databases, ACM Symposium on Applied Computing . 2007. |
|
Yip K., Cheung D.W.L. and Ng M., Input Validation for Semi-supervised Clustering, The 6th IEEE International Conference on Data Mining, Workshop, (ICDE Workshop). 2006. |
|
Researcher
: Cheung L |
|
List of Research Outputs |
|
Cheung L., Yip Y.L., Cheung D.W.L., Kao C.M. and Ng K.P., On Mining Micro-array Data by Order-Preserving Submatrix, International Journal of Bioinformatics Research and Applications (IJBRA). Inder Sciences Publishers, 2007, 3: 42-64. |
|
Researcher
: Chin FYL |
|
Project Title: |
MultiVision Fund |
|
Investigator(s): |
Chin FYL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
MultiVision Intelligent Surveillance ( |
|
Start Date: |
07/2003 |
|
Abstract: |
|
MultiVision Fund. |
|
Project Title: |
Finding motifs for sequences with weak binding sites |
|
Investigator(s): |
Chin FYL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2004 |
|
Completion Date: |
08/2006 |
|
Abstract: |
|
To find motifs by considering those sequences which do not contain any binding sites when there are insufficient no. of sequences with binding sites; to consider a more general and realistic model where each sequence contains more than one binding site; to test our proposed algorithms on both real and simulated data. |
|
Project Title: |
Robust object segmentation method for video surveillance system |
|
Investigator(s): |
Chin FYL, Chung HY |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Teaching Company Scheme |
|
Start Date: |
09/2004 |
|
Completion Date: |
08/2006 |
|
Abstract: |
|
To develop a new and robust object segmentation method specifically for video surveillance systems. |
|
Project Title: |
Computationally Haplotyping Pedigree Data |
|
Investigator(s): |
Chin FYL, Smith DK, Song Y |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
01/2006 |
|
Abstract: |
|
Minimum Recombination Haplotyping Problem (MRHP): finding a haplotype solution for a given pedigree that is consistent with given genotype data and derived from fewest recombinations (minimizing SUM). (1) The k-MRHP is an MRHP with the additional constraint that the number of recombinations on each haplotype is at most k where k = 0, 1, 2 (minimizing SUM with MAX=k) (2) An efficient algorithm for the k-MRHP when k=0 (3) Software implementation of the efficient algorithm |
|
Project Title: |
A new motif representation based on position specific patterns |
|
Investigator(s): |
Chin FYL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2006 |
|
Abstract: |
|
1 We want to introduce a good model to represent motifs and describe them in a precise and complete fashion. 2 Based on our new motif representation model, we will redefine the motif discovering problem and design efficient algorithms or heuristics to solve the problem. 3 The goal of the new model is to enable the discovery of a higher percentage of known motifs and some unknown motifs. |
|
List of Research Outputs |
|
Chan
B.M.Y., Chan W.T., Chin F.Y.L.,
Fung S.P.Y. and Kao M.Y., Linear-Time Haplotype Inference on Pedigrees
without Recombinations, The 6th Workshop on Algorithms in Bioinformatics
(WABI 2006). |
|
Chan J.W.T., Chin F.Y.L., Ye D., Zhang Y. and Zhu H., Greedy Online Frequency Allocation in Cellular Networks, Information Processing Letters. Elsevier B.V., 2007, 102(2-3): 55-61. |
|
Chan J.W.T., Chin F.Y.L., Ye D. and Zhang Y., Online Frequency Allocation in
Cellular Networks, The 19th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA 2007). |
|
Chan W.T., Chin F.Y.L., Ye D., Zhang Y. and Zhu H., Frequency
Allocation Problem for Linear Cellular Networks, The 17th International
Symposium on Algorithms and Computation (ISAAC 2006). |
|
Chen
Z., Chin F.Y.L. and Chung H.Y., Automated Hierarchical Image
Segmentation Based on Merging of Quadrilaterals, The 6th WSEAS
International Conference on Signal Processing, Computational Geometry &
Artifical Vision (ISCGAV'06). Elounda, |
|
Chen
Z., Chin F.Y.L. and Chung H.Y., Automated Hierarchical Image
Segmentation Based on Merging of Quadrilaterals, WSEAS Transactions on
Signal Processing. |
|
Chin F.Y.L., Chinese Journal of Advanced Software Research. 2006. |
|
Chin F.Y.L., Current Bioinformatics. 2007. |
|
Chin
F.Y.L., Discovering Motifs with Transcription
Factor Domain Knowledge, The Third Annual RECOMB Satellite Workshop on
Regulatory Genomics. |
|
Chin
F.Y.L., Finding Motifs Computationally, CS
Dept of |
|
Chin
F.Y.L., Finding Motifs Computationally, |
|
Chin
F.Y.L., Finding Motifs Computationally, The
2nd BioDM Workshop on Data Mining for Biomedical Applications (BioDM 2007)
(keynote). |
|
Chin F.Y.L., HKIE Transactions Review Panel. 2006. |
|
Chin F.Y.L., International Journal of Computer Processing of Oriental Languages. 2006. |
|
Chin F.Y.L., Journal of Information Processing Letters. 2006. |
|
Chin F.Y.L., Managing Editor, International Journal of Foundations of Computer Science. 2006. |
|
Chin
F.Y.L., Online Frequency Assignment in
Wireless Communication Networks, Math Dept of |
|
Chin
F.Y.L., Zhang
Y. and Zhu H., Online OVSF Code Assignment with Resource Augmentation, The
3rd International Conference on Algorithmic Aspects in Information and
Management (AAIM'07). |
|
Chung H.Y., Wong K.K.Y., Chin F.Y.L., Chow K.P. and Yuk S.C., Generalized Motion and Edge Adaptive Interpolation De-interlacing Algorithm, WSEAS Transactions on Computers. 2006, 5(11): 2544-2551. |
|
Fung S.P.Y., Wang |
|
Leung C.M. and Chin F.Y.L., An efficient motif discovery algorithm with unknown motif length and number of binding sites, International Journal of Data Mining and Bioinformatics (IJDMB). Switzerland, Inderscience Enterprises Limited, 2006, 1(2): 201-215. |
|
Leung
C.M. and Chin F.Y.L.,
Discovering DNA Motifs with Nucleotide Dependency, The IEEE 6th Symposium
on Bioinformatics and Bioengineering (BIBE 06). |
|
Leung
C.M. and Chin F.Y.L.,
Discovering Motifs with Transcription Factor Domain Knowledge, Pacific
Symposium on Biocomputing (PSB 2007). Wailea, |
|
Leung
C.M. and Chin F.Y.L.,
Finding motifs from all sequences with and without binding sites, Bioinformatics. |
|
Leung
C.M. and Chin F.Y.L., Redundancy
Elimination in Motif Discovery Algorithms, The Third Annual RECOMB
Satellite Workshop on Regulatory Genomics. |
|
Li K., Shen H., Chin F.Y.L. and Zhang W., Multimedia
Object Placement for Transparent Data Replication, In: Laxmi Bhuyan, |
|
Sankoff D., Wang L. and Chin F.Y.L., In: David Sankoff,
Lusheng Wang, Francis Chin, Proceedings of the 5th Asia-Pacific
Biooinformatics Conference (APBC 2007). |
|
Wong
K.K.Y., Chin F.Y.L., Chung H.Y., Chow K.P. and Yuk S.C., Motion and Edge Adaptive
Interpolation De-interlacing Algorithm, 10th WSEAS International
Conference on Computers. |
|
Yuk
S.C., Wong K.K.Y., Chung H.Y., Chin F.Y.L. and Chow K.P., Real-time Multiple Head Shape
Detection and Tracking System with Decentralized Trackers, 6th IEEE
International Conference on Intelligent System Design and Applications. |
|
Zheng F.F., Fung S.P.Y., Chan W.T., Chin F.Y.L., Poon C.K. and Wong
P.W.H., Improved on-line broadcast scheduling with deadlines, The Twelfth
Annual International Computing and Combinatorics Conference (COCOON 2006).
|
|
Researcher
: Chong CF |
|
List of Research Outputs |
|
Wang M., Li L., Yiu S.M., Hui C.K., Chong C.F., Chow K.P., Tsang W.W., Chan H.W. and Pun K.H., A Hybrid Approach for
Authenticating MPEG-2 Streaming Data, Proceedings of Multimedia Content
Analysis and Mining International Workshop (MCAM 2007). |
|
Researcher
: Chow KP |
|
Project Title: |
Advanced semantic video analysis for content-based video retrieval |
|
Investigator(s): |
Chow KP, Chin FYL, Wong KKY |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Innovation and Technology Support Programme |
|
Start Date: |
09/2006 |
|
Abstract: |
|
The objective of this proposal is to develop new and enabling semanitc video analysis techniques for video retrieval applications. We believe these new techniques can help to remedy the video retrieval problems found in video surveillance systems and the video search engine. |
|
List of Research Outputs |
|
Chow
K.P., Law
Y.W., Kwan Y.K. and Lai K.Y., The Rules of Time on NTFS
File System, The Second International Workshop on Systematic Approaches to
Digital Forensic Engineering, SADFE 07. |
|
Chung H.Y., Wong K.K.Y., Chin F.Y.L., Chow K.P. and Yuk S.C., Generalized Motion and Edge Adaptive Interpolation De-interlacing Algorithm, WSEAS Transactions on Computers. 2006, 5(11): 2544-2551. |
|
Hui
C.K., Chow K.P. and Yiu S.M., Tools and Technology for
Computer Forensics: Research and Development in |
|
Wang M., Li L., Yiu S.M., Hui C.K., Chong C.F., Chow K.P., Tsang W.W., Chan H.W. and Pun K.H., A Hybrid Approach for
Authenticating MPEG-2 Streaming Data, Proceedings of Multimedia Content
Analysis and Mining International Workshop (MCAM 2007). |
|
Wong
K.K.Y., Chin F.Y.L., Chung H.Y., Chow K.P. and Yuk S.C., Motion and Edge Adaptive
Interpolation De-interlacing Algorithm, 10th WSEAS International
Conference on Computers. |
|
Yuk
S.C., Wong K.K.Y., Chung H.Y., Chin F.Y.L. and Chow K.P., Real-time Multiple Head
Shape Detection and Tracking System with Decentralized Trackers, 6th IEEE
International Conference on Intelligent System Design and Applications. |
|
Researcher
: Chui CK |
|
List of Research Outputs |
|
Chui
C.K., Kao
C.M. and Hung Y.W., Mining Frequent Itemsets from Uncertain Data, Advances
in Knowledge Discovery and Data Mining, 11th Pacific-Asia Conference, PAKDD
2007. |
|
Chui C.K., Kao C.M. and Hung E., Mining Frequent Itemsets from Uncertain Data, The 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2007). 2007. |
|
Lin B., Ho W.S., Kao C.M. and Chui C.K., Adaptive Frequency
Counting over Bursty Data Streams, Proceedings of the IEEE Symposium on
Computational Intelligence and Data Mining, CIDM 2007. |
|
Lin H., Ho W.S., Kao C.M. and Chui C.K., Adaptive Frequency Counting over Bursty Data Streams, IEEE Symposium on Computational Intelligence and Data Mining (IEEE CIDM 2007). 2007. |
|
Ngai
W.K., Kao C.M., Chui C.K., Cheng C.K., Michael C.L. and Yip Y.L., Efficient Clustering of
Uncertain Data, Proceedings of the 6th IEEE International Conference on
Data Mining (ICDM 2006). |
|
Ngai W.K., Kao C.M., Cheng R., Chau M.C.L., Yip Y.L. and Chui C.K., Efficient Clustering of Uncertain Data, The 2006 IEEE International Conference on Data Mining (IEEE ICDM 06). 2006, 436-445. |
|
Researcher
: Chui CK |
|
List of Research Outputs |
|
Chui
C.K., Kao
C.M. and Hung Y.W., Mining Frequent Itemsets from Uncertain Data, Advances
in Knowledge Discovery and Data Mining, 11th Pacific-Asia Conference, PAKDD
2007. |
|
Chui C.K., Kao C.M. and Hung E., Mining Frequent Itemsets from Uncertain Data, The 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2007). 2007. |
|
Lin B., Ho W.S., Kao C.M. and Chui C.K., Adaptive Frequency
Counting over Bursty Data Streams, Proceedings of the IEEE Symposium on
Computational Intelligence and Data Mining, CIDM 2007. |
|
Lin H., Ho W.S., Kao C.M. and Chui C.K., Adaptive Frequency Counting over Bursty Data Streams, IEEE Symposium on Computational Intelligence and Data Mining (IEEE CIDM 2007). 2007. |
|
Ngai
W.K., Kao C.M., Chui C.K., Cheng C.K., Michael C.L. and Yip Y.L., Efficient Clustering of
Uncertain Data, Proceedings of the 6th IEEE International Conference on
Data Mining (ICDM 2006). |
|
Ngai W.K., Kao C.M., Cheng R., Chau M.C.L., Yip Y.L. and Chui C.K., Efficient Clustering of Uncertain Data, The 2006 IEEE International Conference on Data Mining (IEEE ICDM 06). 2006, 436-445. |
|
Researcher
: Chung HY |
|
List of Research Outputs |
|
Chen
Z., Chin F.Y.L. and Chung H.Y., Automated Hierarchical
Image Segmentation Based on Merging of Quadrilaterals, The 6th WSEAS International
Conference on Signal Processing, Computational Geometry & Artifical
Vision (ISCGAV'06). Elounda, |
|
Chen
Z., Chin F.Y.L. and Chung H.Y., Automated Hierarchical
Image Segmentation Based on Merging of Quadrilaterals, WSEAS Transactions
on Signal Processing. |
|
Chung H.Y., Wong K.K.Y., Chin F.Y.L., Chow K.P. and Yuk S.C., Generalized Motion and Edge Adaptive Interpolation De-interlacing Algorithm, WSEAS Transactions on Computers. 2006, 5(11): 2544-2551. |
|
Wong
K.K.Y., Chin F.Y.L., Chung H.Y., Chow K.P. and Yuk S.C., Motion and Edge Adaptive
Interpolation De-interlacing Algorithm, 10th WSEAS International
Conference on Computers. |
|
Yuk
S.C., Wong K.K.Y., Chung H.Y., Chin F.Y.L. and Chow K.P., Real-time Multiple Head Shape
Detection and Tracking System with Decentralized Trackers, 6th IEEE
International Conference on Intelligent System Design and Applications. |
|
Researcher
: Dai X |
|
List of Research Outputs |
|
Dai X., Spatial Queries Based on Non-Spatial Constraints, 2007. |
|
Yiu M.L., Dai X., Mamoulis N. and Vaitis M., Top-k Spatial Preference Queries, IEEE 23nd International Conference on Data Engineering. 2007. |
|
Researcher
: Deng H |
|
List of Research Outputs |
|
Deng H., Robust Minutia-Based Fingerprint Verification, 2006. |
|
Researcher
: Feng X |
|
Project Title: |
A New Approach for Intelligent Processing Based on Generalized Particle Model |
|
Investigator(s): |
Feng X, Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Small Project Funding |
|
Start Date: |
03/2007 |
|
Abstract: |
|
Many real-world problems can be solved
using artificial intelligence (AI) techniques. The goal of this project is to
investigate and develop an intelligent processing approach based on the
generalized particle model (GPM). In GPM, entities are modeled as particles
in one or more force-fields. We will study the evolution of “swarms”, the
particles’ microcosmic actions, and macroscopic swarm intelligence, and
present efficient algorithms for applying GPM to communication networks and
multi-agent systems (MASs). GPM is an important extension of Elastic Net
(EN), but it is fundamentally different from many other popular intelligent
approaches including those based on symbolic or fuzzy logic, genetic
algorithms, artificial neural network, game theory and ant colony
optimization. The features of the GPM-based models and their corresponding
algorithms include a powerful processing ability to deal with priorities,
personality, autonomy and interaction of different entities in networks or |
|
List of Research Outputs |
|
Feng X., Lau F.C.M. and Shuai D.X., A New Generalized Particle Approach to Parallel Bandwidth Allocation , Computer Communications. Elsevier, 2006, 29: 3933-3945. |
|
Feng X., Lau F.C.M. and Shuai D.X., A Novel Game Particle-Field Approach to Parallel Cache Resource Allocation of CDN , Chinese Journal of Computers. 2007, 30: 368-379. |
|
Researcher
: He T |
|
List of Research Outputs |
|
He T., Hu Y. and Huo Q., An Approach to Large Margin Design of Prototype-Based Pattern Classifiers, IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-2007). IEEE, 2007, II: 625-628. |
|
Researcher
: Ho JCF |
|
List of Research Outputs |
|
Chan W.K., Cheung S.C., Ho J.C.F. and Tse T.H., Reference models and automatic oracles for the testing of mesh simplification software for graphics rendering, Proceedings of the 30th Annual International Computer Software and Applications Conference (COMPSAC 2006), IEEE Computer Society Press, Los Alamitos, California. 2006, 429−438. |
|
Researcher
: Ho WS |
|
List of Research Outputs |
|
Lin B., Ho W.S., Kao C.M. and Chui C.K., Adaptive Frequency Counting
over Bursty Data Streams, Proceedings of the IEEE Symposium on
Computational Intelligence and Data Mining, CIDM 2007. |
|
Lin H., Ho W.S., Kao C.M. and Chui C.K., Adaptive Frequency Counting over Bursty Data Streams, IEEE Symposium on Computational Intelligence and Data Mining (IEEE CIDM 2007). 2007. |
|
Researcher
: Hon WK |
|
List of Research Outputs |
|
Hon W.K., Lam T.W., Sadakane K., Sung W.K. and Yiu S.M., A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays , Algorithmica. 2007, 48:1: 23-36. |
|
Researcher
: Hu P |
|
List of Research Outputs |
|
Hu P., Zhang Z., Chan W.K. and Tse T.H., An empirical comparison between direct and indirect test result checking approaches , Proceedings of the 3rd International Workshop on Software Quality Assurance (SOQUA 2006) (in conjunction with the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering (SIGSOFT 2006/FSE-14)), ACM Press, New York. 2006, 6−13. |
|
Researcher
: Hu Y |
|
List of Research Outputs |
|
He T., Hu Y. and Huo Q., An Approach to Large Margin Design of Prototype-Based Pattern Classifiers, IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-2007). IEEE, 2007, II: 625-628. |
|
Hu
Y. and Huo
Q., An HMM Compensation Approach Using Unscented Transformation For Noisy
Speech Recognition (received the Best Student Paper Award), In: Q. Huo, B.
Ma, E.-S. Chng, and H.-Z. Li (Eds.), Chinese Spoken Language Processing,
The Fifth International Symposium, ISCSLP 2006, |
|
Researcher
: Hua Q |
|
List of Research Outputs |
|
Hua Q.
and Lau F.C.M., The Scheduling and
Energy Complexity of Strong Connectivity in Ultra-Wideband Networks, 9th
ACM/IEEE International Symposium on Modeling, Analysis and Simulation of
Wireless and |
|
Researcher
: Hui CK |
|
Project Title: |
Study of multi-signer signature scheme and identity authentication |
|
Investigator(s): |
Hui CK, Chow KP, Tsang WW |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
12/2003 |
|
Abstract: |
|
to investigate the security of multi-signer signature schemes, and to design some new schemes with secure and high efficient features. |
|
Project Title: |
Forward secure crytographic schemes for Ad Hoc Network |
|
Investigator(s): |
Hui CK, Chow KP, Yiu SM, Li VOK |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
01/2005 |
|
Abstract: |
|
To carry out: (1) a forward secure signature scheme to be used in the clients of an ad hoc network. (2) a forward secure threshold signature scheme to be used in the CAs of an ad hoc network. |
|
Project Title: |
Design of cryptographic schemes for delegation network |
|
Investigator(s): |
Hui CK, Yiu SM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
01/2007 |
|
Abstract: |
|
(1) Delegation is a process where a user (the delegator) grants some of his rights (power), e.g. the signing right, to another user (the delegate), to work on his/her behalf.In a paper-based environment, delegation can be easily achieved. However, in a digital environment, how delegation can be handled properly becomes an issue to be addressed. The key management is also complicated, especially in a general delegation network.In this project, we propose to design a number of efficient and provably secure cryptographic schemes to support different variations of delegation networks. The developed schemes would help to enhance the security of an enterprise information system as delegation would be a common operation in most of the office environment. Also, the knowledge gained will be useful to build up a security model about delegation network. (2) In a paper-based environment, delegation can be easily achieved. However, in a digital environment, how delegation can be handled properly becomes an issue to be addressed. For examples, it is not trivial how a delegate can digitally sign or decrypt a document on behalf of the delegator and also how the receiver of the document verifies the signature and be convinced that the signer has the right (power) from the delegator to sign the document. Obviously, some straight-forward approaches do not work. Using signing as an example, the delegator passes the signing key (e.g. the private key if using an asymmetric cryptographic system) to the delegate, then the delegator has to change the key frequently and it also violates the non-repudiation property of the scheme as it is difficult to prove whether the delegator or the delegate is the person who actually signed the document. The key management is also complicated, especially in a general delegation network. (3)In other words, from the perspective of computer security, a set of specially designed cryptographic primitives that support delegation network is necessary. To tackle this problem, [MU96] proposed the proxy signature to deal with the delegation of signing. In a proxy signature, the original signer creates a key pair (the proxy key pair, denoted as (, K)) using his own signing key. The delegate (called the proxy signer) signs a document using . The verifier has to use K as well as the public key of the original signer to check the validity of the signature. Since the public key of the original signer is involved in the checking, so the delegation relationship is confirmed. After this work, a number of proxy signature schemes were proposed. However, most of these schemes are either too restrictive and cannot be extended easily for delegation networks, or are shown to be insecure.(4) In this project, we propose to design a number of efficient and provably secure cryptographic schemes to support different variations of delegation networks. The developed schemes would help to enhance the security of an enterprise information system as delegation would be a common operation in most of the office environment. |
|
List of Research Outputs |
|
Dong
Y., Sui A., Yiu S.M., Li V.O.K. and Hui C.K., An efficient cluster-based
proactive secret share update scheme for mobile ad hoc networks, Proc.
IEEE ICC. |
|
Dong
Y., Li V.O.K., Hui C.K. and Yiu S.M., Dynamic distributed
certificate authority services for mobile ad hoc networks, Proc. IEEE
Wireless Communications and Networking Conference. |
|
Hui C.K., Yiu S.M. and Lui W.C., Accountability in organizations, Int. J. Information and Computer Security. UK, Inderscience Enterprises Ltd, 2007, Vol. 1, No. 3: 237-255. |
|
Hui
C.K., Chow
K.P. and Yiu S.M., Tools and
Technology for Computer Forensics: Research and Development in |
|
Wang M., Li L., Yiu S.M., Hui C.K., Chong C.F., Chow K.P., Tsang W.W., Chan H.W. and Pun K.H., A Hybrid Approach for Authenticating
MPEG-2 Streaming Data, Proceedings of Multimedia Content Analysis and
Mining International Workshop (MCAM 2007). |
|
Researcher
: Hung RYS |
|
List of Research Outputs |
|
Hung
R.Y.S. and Ting
H.F., A Tight Analysis of the Most-Requested-First for On-demand Data
Broadcasts, In: D.T. Lee, The Twelfth Annual International Computing and
Combinatorics Conference. |
|
Researcher
: Hung YSR |
|
List of Research Outputs |
|
Ting
H.F. and Hung Y.S.R.,
An optimal broadcasting protocol for mobile video-on-demand, In: Barry Jay, Proceedings
of the 13th Australasian Theory Symposium. |
|
Researcher
: Huo Q |
|
Project Title: |
Towards on-line recognition of continuous Chinese handwriting text on tablet PCs |
|
Investigator(s): |
Huo Q |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2003 |
|
Abstract: |
|
To construct a large scale corpus of Chinese handwriting samples naturally written on Tablet PCs; to investigate new techniques for feature extraction, character modeling, contextual processing and integrated search to cope with the on-line recognition problem of continuously handwritten Chinese sentences; to implement a prototype system on the Tablet PC using the most promising solution identified by investigating the effectiveness of integrating the available techniques in different ways. |
|
Project Title: |
Chinese spoken language processing |
|
Investigator(s): |
Huo Q |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Anhui USTC iFLYTEK Co. Ltd. - General Award |
|
Start Date: |
09/2005 |
|
Abstract: |
|
To research and develop the state-of-the-art Chinese spoken language processing technology. |
|
Project Title: |
A Detection and Verification Based Approach for On-line Recognition of Handwritten Chinese Words |
|
Investigator(s): |
Huo Q |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2005 |
|
Abstract: |
|
The objectives of this project are: (1) to investigate a new "detection and verification based approach" for on-line recognition of handwritten Chinese words; (2) to investigate new techniques for feature extraction and character modeling to improve the character classification accuracy as well as the reliability of character verification; (3) to develop a prototype system on Tablet PC, as a test-bed of new ideas, by using the most promising solution identified through the study in this project. The character vocabulary of our recognizer will include 6763 simplified Chinese characters in GB2312-80 standard, 12 frequently used GBK Chinese characters, 62 alphanumeric characters, 140 punctuation marks and symbols. We are aiming at a writer-independent character recognition accuracy of above 90% for naturally written Chinese words derived from our handwriting corpus. |
|
Project Title: |
A Study of Similarity Measures For Hidden Markov Models and Their Applications in Speech Recognition |
|
Investigator(s): |
Huo Q |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Seed Funding Programme for Basic Research |
|
Start Date: |
03/2006 |
|
Abstract: |
|
After many years research, Gaussian
mixture continuous density hidden Markov model (CDHMM) remains predominant as
a speech modeling technique in automatic speech recognition (ASR) area. How
to measure the similarity of two given CDHMMs has been an important research
topic for several decades. In a pioneering work, Juang and Rabiner proposed
to use Kullback-Leibler (KL) divergence as a similarity measure of two HMMs
with discrete observation distributions. In order to calculate the KL
divergence, a |
|
List of Research Outputs |
|
Bai
Z. and Huo Q., A Study of
Nonlinear Shape Normalization for Online Handwritten Chinese Character
Recognition: Dot Density vs. Line Density Equalization, 2006 International
Conference on Pattern Recognition. |
|
He T., Hu Y. and Huo Q., An Approach to Large Margin Design of Prototype-Based Pattern Classifiers, IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-2007). IEEE, 2007, II: 625-628. |
|
Hu Y.
and Huo Q., An HMM
Compensation Approach Using Unscented Transformation For Noisy Speech
Recognition (received the Best Student Paper Award), In: Q. Huo, B. Ma, E.-S.
Chng, and H.-Z. Li (Eds.), Chinese Spoken Language Processing, The Fifth
International Symposium, ISCSLP 2006, |
|
Huo
Q. and Li
W., A DTW-Based Dissimilarity Measure For Left-to-Right Hidden Markov
Models And Its Application To Word Confusability Analysis, Interspeech
2006 - ICSLP. |
|
Huo
Q. and Zhu
D., A Maximum Likelihood Training Approach to Irrelevant Variability
Compensation Based on Piecewise Linear Transformations, Interspeech 2006 -
ICSLP. |
|
Huo Q., Ma B., Chng E...-.S... and Li H...-.Z..., Chinese Spoken Language Processing, The Fifth International Symposium, ISCSLP 2006, Singapore, December 13-16, 2006, Proceedings (Companion Volume). COLIPS, 2006. |
|
Huo Q., Ma B., Chng E...-.S... and Li H...-.Z..., Chinese Spoken Language Processing, The Fifth International Symposium, ISCSLP 2006, Singapore, December 13-16, 2006, Proceedings, LNAI 4274. Springer-Verlag, 2006. |
|
Lee C...-.H..., Li H...-.Z..., Lee L...-.S..., Wang R...-.H... and Huo Q., Advances in Chinese Spoken Language Processing. World Scientific Publisher, 2006. |
|
Wu J. and Huo Q., A Study of Minimum Classification Error (MCE) Linear Regression for Supervised Adaptation of MCE-Trained Continuous Density Hidden Markov Models, IEEE Trans. on Audio, Speech and Language Processing. IEEE, 2007, 15: 478-488. |
|
Wu J. and Huo Q., An Environment Compensated Minimum Classification Error Training Approach Based on Stochastic Vector Mapping, IEEE Transactions on Audio, Speech and Language Processing. IEEE, 2006, 14: 2147-2155. |
|
Zhu D., Ma B., Li H. and Huo Q., A Generalized Feature Transformation Approach for Channel Robust Speaker Verification, IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-2007). IEEE, 2007, IV: 61-64. |
|
Zhu D. and Huo Q., A Maximum Likelihood Approach to Unsupervised Online Adaptation of Stochastic Vector Mapping Function For Robust Speech Recognition, IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-2007). IEEE, 2007, IV: 773-776. |
|
Researcher
: Kao CM |
|
Project Title: |
Association rule mining on continuous stream data |
|
Investigator(s): |
Kao CM, Cheung DWL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2004 |
|
Abstract: |
|
To derive efficient online time-based sampling algorithms; to derive efficient approximation algorithms for mining association rules from a single data stream; to derive efficiency algorithms for mining inter-stream associations; to perform time-delayed association analysis. |
|
Project Title: |
Computational issues in mining uncertain data |
|
Investigator(s): |
Kao CM, Cheung DWL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2006 |
|
Abstract: |
|
1 Data Uncertainty Models. One of the key
steps in knowledge discovery is data collection. In practice, statistical
approximation is used in the data collection process. This may be due to
measurement error or data values that are based on subjective judgement. Our
first objective is to investigate the various forms of uncertainty that may
exist in data, and how these various forms of uncertainty affect the design
of data-mining algorithms under different mining models (such as
association-rule mining, clustering, and classification). For starters, we
consider "value uncertainty" and "existential
uncertainty." A database system models the physical world by recording
facts (attribute values) of real-life entities (data items or tuples). By
value uncertainty, we refer to data that contains a known set of tuples but
their attribute values are uncertain. For example, a moving-object database
tracks the location of a set of known moving objects. Due to the time lag
between the current time and the time an object's location was last recorded,
the current location of an object (an attribute value) can only be
approximated by a statistical model. Example models include "uniform
line uncertainty" (consider the moving object being a car moving on a
straight road) and "Gaussian circular uncertainty" (consider the
moving object performs a random walk starting from its last recorded
location). By existential uncertainty, we refer to data whose tuple
membership is uncertain or fuzzy. For example, a patient with a body temperature
of |
|
List of Research Outputs |
|
Cheung L., Yip Y.L., Cheung D.W.L., Kao C.M. and Ng K.P., On Mining Micro-array Data by Order-Preserving Submatrix, International Journal of Bioinformatics Research and Applications (IJBRA). Inder Sciences Publishers, 2007, 3: 42-64. |
|
Chui
C.K., Kao C.M. and Hung
Y.W., Mining Frequent Itemsets from Uncertain Data, Advances in Knowledge
Discovery and Data Mining, 11th Pacific-Asia Conference, PAKDD 2007. |
|
Chui C.K., Kao C.M. and Hung E., Mining Frequent Itemsets from Uncertain Data, The 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2007). 2007. |
|
Lin B., Ho W.S., Kao C.M. and Chui C.K., Adaptive Frequency Counting
over Bursty Data Streams, Proceedings of the IEEE Symposium on
Computational Intelligence and Data Mining, CIDM 2007. |
|
Lin H., Ho W.S., Kao C.M. and Chui C.K., Adaptive Frequency Counting over Bursty Data Streams, IEEE Symposium on Computational Intelligence and Data Mining (IEEE CIDM 2007). 2007. |
|
Loo K.K. and Kao C.M., Mining Time-Delayed Associations from Discrete Event Datasets, The 12th International Conference on Database Systems for Advanced Applications (DASFAA 2007). 2007. |
|
Ngai
W.K., Kao C.M., Chui C.K., Cheng C.K., Michael C.L. and Yip Y.L., Efficient Clustering of
Uncertain Data, Proceedings of the 6th IEEE International Conference on
Data Mining (ICDM 2006). |
|
Ngai W.K., Kao C.M., Cheng R., Chau M.C.L., Yip Y.L. and Chui C.K., Efficient Clustering of Uncertain Data, The 2006 IEEE International Conference on Data Mining (IEEE ICDM 06). 2006, 436-445. |
|
Researcher
: Karras P |
|
List of Research Outputs |
|
Karras P. and Mamoulis N., The Haar+ Tree: A Refined Synopsis Data Structure, IEEE 23rd International Conference on Data Engineering. 2007. |
|
Researcher
: Kuo DF |
|
List of Research Outputs |
|
Tse T.H., Cai K.Y. and Kuo D.F., Virtual Earth Award, Microsoft Research. 2007. |
|
Researcher
: Kwan VJWM |
|
List of Research Outputs |
|
Lau
F.C.M., Belaramani N.M., Kwan V.J.W.M., Siu P.L.P., Wing W.K. and Wang C.L., Code-on-Demand and Code
Adaptation for Mobile Computing, The Handbook of |
|
Researcher
: Kwan YK |
|
List of Research Outputs |
|
Chow
K.P., Law Y.W., Kwan Y.K. and Lai K.Y., The Rules of Time on NTFS
File System, The Second International Workshop on Systematic Approaches to
Digital Forensic Engineering, SADFE 07. |
|
List of Research Outputs |
|
Chow
K.P., Law Y.W., Kwan Y.K. and Lai K.Y., The Rules of Time on
NTFS File System, The Second International Workshop on Systematic
Approaches to Digital Forensic Engineering, SADFE 07. |
|
Lai K.Y., Solving Multiparty Private Matching Problems using Bloom-Filters, 2006. |
|
Researcher
: Lam TW |
|
Project Title: |
Algorithms for uncovering conserved genes on whole genomes |
|
Investigator(s): |
Lam TW |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2004 |
|
Abstract: |
|
To investigate the complexity of a maximum common subsequence problem that models mutations between genomes; to design and implement better algorithms and software for uncovering conserved genes. |
|
Project Title: |
Compressed indexes for approximate string matching, with applications to biological sequences |
|
Investigator(s): |
Lam TW |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
08/2006 |
|
Abstract: |
|
1 The objectives of my proposal contains special fonts, and they are included into the section of backgrounds of research as a combined pdf file. |
|
List of Research Outputs |
|
Chan H.L., Lam T.W., Sung W.K., Tam S.L. and Wong S.S., A Linear Size Index for Approximate Pattern Matching, The 17th Annual Symposium on Combinatorial Pattern Matching (CPM). Springer, 2006, LNCS 4009: 49-59. |
|
Chan H.L., Lam T.W., Sung W.K., Tam S.L. and Wong S.S., Compressed Indexes for Approximate String Matching, In: Yossi Azar, Thomas Erleback, 14th Annual European Symposium on Algorithms (ESA). Springer, 2006, LNCS 4168: 208-219. |
|
Chan H.L., Hon W.K., Lam T.W. and Sadakane K., Compressed Indexes for Dynamic Text Collections, ACM Transactions on Algorithms (TALG). 2007, 3:2: Article 21, pages 1-29. |
|
Chan H.L., Lam T.W. and Wong P., Efficiency of Data Distribution in BitTorrent-like Systems , The 3rd International Conference on Algorithmic Aspects in Information and Management . 2007, 378-388. |
|
Chan H.L., Chan W.T., Lam T.W., Lee L.K., Mak K.S. and Wong P., Energy Efficient Online Deadline Scheduling , The 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2007, 795-804. |
|
Chan H.L., Jannson J., Lam T.W. and Yiu S.M., Reconstructing An Ultrametric Galled Phylogenetic Network From A Distance Matrix , Journal of Bioinformatics and Computational Biology. World Scientific, 2006, 4: 4: 807-832. |
|
Chan W.T., Lam T.W., Liu K.S. and Wong P., New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling, Theoretical Computer Science. Elsevier, 2006, 359:1-3: 430-439. |
|
Chan W.T., Lam T.W., Mak K.S. and Wong P., Online Deadline Scheduling with Bounded Energy Efficiency, The 4th International Conference on Theory and Applications of Models of Computation (TAMC). 2007, 416-427. |
|
Hon W.K., Lam T.W., Sadakane K., Sung W.K. and Yiu S.M., A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays , Algorithmica. 2007, 48:1: 23-36. |
|
Lam
T.W., Best Teacher Award 2006, Faculty of
Engineering, The |
|
Lam
T.W., Field editor (Computational Biology), Encyclopedia
of Algorithms. Springer |
|
Lam T.W., Online Deadline Scheduling with Energy Concern, The 19th International Symposium of Mathematical Programming (ISMP). 2006. |
|
Lam T.W., Teaching Excellence Award 2006, Department of Computer Science, The University of Hong Kong. 2007. |
|
Wong K.F., Lam T.W., Yang W. and Yiu S.M., Finding Alternative Splicing Patterns with Strong Support from Expressed Sequences , The 2007 International Conference on Bioinformatics and Computational Biology (BIOCOMP). 2007. |
|
Yiu S.M., Wong P., Lam T.W., Mui Y.C., Kung H.F., Lin M.C. and Cheung Y.T., Research Output Prize, Faculty of Engineering, The University of Hong Kong. 2006. |
|
Researcher
: Lau FCM |
|
Project Title: |
The |
|
Investigator(s): |
Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Matching Fund for Hi-Tech Research and
Development Program of |
|
Start Date: |
12/2002 |
|
Abstract: |
|
To study grid point of The University of |
|
Project Title: |
Content adaptation for mobile computing |
|
Investigator(s): |
Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2003 |
|
Abstract: |
|
To design and implement a content adaptation system with context-awareness and which is sensitive to user's preferences; to design and implement an automatic content augmentation tool for content creation. |
|
Project Title: |
A holistic approach to structured web document viewing in small devices |
|
Investigator(s): |
Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2004 |
|
Abstract: |
|
To produce a system design covering the content creation, content adaptation, and content rendering aspects of Web content viewing on a mobile handheld device, whereby any viewing activity will be seen as complete, fast, and easy. |
|
Project Title: |
HP mobile technology for teaching initiative |
|
Investigator(s): |
Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Hewlett-Packard HK SAR Ltd. |
|
Start Date: |
10/2004 |
|
Abstract: |
|
To develop HP mobile technology for teaching initiative. |
|
Project Title: |
Intelligent Systems for Painting and Calligraphy |
|
Investigator(s): |
Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2005 |
|
Abstract: |
|
The objectives of this proposed project are: (1)To apply point-based techniques to achieve fast rendering of the brush geometry, and to consider image-based rendering algorithms for high quality rendering of the animated brush. (2) To incorporate the smooth particles hydrodynamics method borrowed from astrophysics in the dynamics simulation of the brush. (3) To apply particle diffusion (from chemistry/physics) to simulate the complex pigment behavior. (4) To devise an intelligent system component for training the brush to adapt to “personal habitual bias” of the user. (5) To extend the present calligraphy generation system with a feedback reinforcement learning component to strengthen the constraint satisfaction process. (6) To explore possible new recognition algorithms for calligraphic writings of which the characters are severely distorted. |
|
Project Title: |
UGC-Matching Grant Scheme (2nd Phase)-Process Migration and Runtime Scheduling for Parallel Tasks in Computational Grids |
|
Investigator(s): |
Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Other Funding Scheme |
|
Start Date: |
05/2006 |
|
Abstract: |
|
To study process migration and runtime scheduling for parallel tasks in computational grids. |
|
Project Title: |
Memory management strategies to improve garbage collectors |
|
Investigator(s): |
Lau FCM, Wang CL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2006 |
|
Abstract: |
|
1. To devise a low-overhead dynamic object pretenuring mechanism for identifying long-lived objects and allocating them to the mature space directly. 2. To design a nursery sizing policy which can select, against a given total heap size, a best nursery size leading to the best performance of an application. 3. To design an automatic heap sizing policy for controlling the heap growth. |
|
List of Research Outputs |
|
Feng X., Lau F.C.M. and Shuai D.X., A New Generalized Particle Approach to Parallel Bandwidth Allocation , Computer Communications. Elsevier, 2006, 29: 3933-3945. |
|
Feng X., Lau F.C.M. and Shuai D.X., A Novel Game Particle-Field Approach to Parallel Cache Resource Allocation of CDN , Chinese Journal of Computers. 2007, 30: 368-379. |
|
Hua
Q. and Lau F.C.M., The
Scheduling and Energy Complexity of Strong Connectivity in Ultra-Wideband
Networks, 9th ACM/IEEE International Symposium on Modeling, Analysis and
Simulation of Wireless and |
|
Lau
F.C.M., Belaramani N.M., Kwan V.J.W.M., Siu P.L.P., Wing W.K. and Wang C.L., Code-on-Demand and Code
Adaptation for Mobile Computing, The Handbook of |
|
Lau F.C.M., Managing Editor, Journal of Interconnection Networks (JOIN). 2007. |
|
Ma T...C..., Chen L., Wang C.L. and Lau F.C.M., G-PASS: An Instance-oriented Security Infrastructure for Grid Travelers, Concurrency and Computation: Practice and Experience. 2006, 18: 1871-1884. |
|
Shi Y..., Lau F.C.M., Tse S.S.H., Du Z...H..., Tang R...C... and Li S...L..., Club Theory of The Grid, Concurrency and Computation: Practice and Experience. 2006, 18: 1759-1773. |
|
Tsang
M.C.M., Wang C.L., Tsang K.C.K. and Lau F.C.M., A Receiver-Coordinated
Approach for Throughput Aggregation in High Bandwidth Multicast, INFOCOM
2007. 26th IEEE International Conference on Computer Communications. |
|
Zhou J...P..., Lu J...H... and Lau F.C.M., Location-Based Multicast Routing Protocol for Mobile Ad Hoc Networks, Second International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2006). 2006, 38-46. |
|
Researcher
: Law YW |
|
List of Research Outputs |
|
Chow
K.P., Law Y.W., Kwan Y.K. and Lai K.Y., The Rules of Time on NTFS
File System, The Second International Workshop on Systematic Approaches to
Digital Forensic Engineering, SADFE 07. |
|
Researcher
: Lee LK |
|
List of Research Outputs |
|
Chan H.L., Chan W.T., Lam T.W., Lee L.K., Mak K.S. and Wong P., Energy Efficient Online Deadline Scheduling , The 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2007, 795-804. |
|
Researcher
: Lee TYT |
|
List of Research Outputs |
|
Cheung
D.W.L., Yee K.C. and Lee T.Y.T., Consultancy, Government
Electronic Trading Services, HKSAR Government Office of the Government
Chief Information Officer. |
|
Researcher
: Leung CM |
|
List of Research Outputs |
|
Leung C.M. and Chin F.Y.L., An efficient motif discovery algorithm with unknown motif length and number of binding sites, International Journal of Data Mining and Bioinformatics (IJDMB). Switzerland, Inderscience Enterprises Limited, 2006, 1(2): 201-215. |
|
Leung C.M. and Chin F.Y.L.,
Discovering DNA Motifs with Nucleotide Dependency, The IEEE 6th Symposium
on Bioinformatics and Bioengineering (BIBE 06). |
|
Leung C.M. and Chin F.Y.L.,
Discovering Motifs with Transcription Factor Domain Knowledge, Pacific
Symposium on Biocomputing (PSB 2007). Wailea, |
|
Leung C.M. and Chin F.Y.L., Finding
motifs from all sequences with and without binding sites, Bioinformatics. |
|
Leung C.M., Motif Discovery for DNA Sequences, 2007. |
|
Leung C.M. and Chin F.Y.L.,
Redundancy Elimination in Motif Discovery Algorithms, The Third Annual
RECOMB Satellite Workshop on Regulatory Genomics. |
|
Researcher
: Leung WS |
|
List of Research Outputs |
|
Leung W.S., Shen Z., Yiu S.M., Kung H.F. and Lin M.C., The Anti-Angiogenic Signaling Network of rAAV-HGFK1, The Fifth Asia-Pacific Bioinformatics Conference, APBC2007; 14-17 Jan, 2007; Hong Kong.. 2007, apbc104. |
|
Liu C. and Leung W.S., A Database of Traditional Chinese Medicine and Their Hypothetic Molecular Targets in the Druggable Genome., Postgraduate Symposium on traditional Chinese medicine.. 2006. |
|
Researcher
: Li W |
|
List of Research Outputs |
|
Huo
Q. and Li W., A DTW-Based
Dissimilarity Measure For Left-to-Right Hidden Markov Models And Its
Application To Word Confusability Analysis, Interspeech 2006 - ICSLP. |
|
Researcher
: Lin H |
|
List of Research Outputs |
|
Lin H., Ho W.S., Kao C.M. and Chui C.K., Adaptive Frequency Counting over Bursty Data Streams, IEEE Symposium on Computational Intelligence and Data Mining (IEEE CIDM 2007). 2007. |
|
List of Research Outputs |
|
Chan W.T., Lam T.W., Liu K.S. and Wong P., New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling, Theoretical Computer Science. Elsevier, 2006, 359:1-3: 430-439. |
|
Researcher
: Liu Y |
|
List of Research Outputs |
|
Yan
D., Liu Y. and Wang W.P., Quadric Surface Extraction by
Variational Shape Approximation, In: Myung-Soo Kim, Kenji Shimada, Geometric
Modeling and Processing - GMP 2006: 4th International Conference. |
|
Researcher
: Loo KK |
|
List of Research Outputs |
|
Loo K.K. and Kao C.M., Mining Time-Delayed Associations from Discrete Event Datasets, The 12th International Conference on Database Systems for Advanced Applications (DASFAA 2007). 2007. |
|
Researcher
: Lu H |
|
List of Research Outputs |
|
Chan W.K., Chen T.Y., Lu H., Tse T.H. and Yau S.S., Integration testing of context-sensitive middleware-based applications: a metamorphic approach, International Journal of Software Engineering and Knowledge Engineering. Singapore, World Scientific, 2006, 16 (5): 677−703. |
|
Lu H., Chan W.K. and Tse T.H., Static slicing for pervasive programs, Proceedings of the 6th International Conference on Quality Software (QSIC 2006), IEEE Computer Society Press, Los Alamitos, California. 2006, 185−192. |
|
Lu H., Chan W.K. and Tse T.H., Testing context-aware
middleware-centric programs: a data flow approach and an RFID-based
experimentation, Proceedings of the 14th ACM SIGSOFT International
Symposium on Foundations of Software Engineering (SIGSOFT 2006/FSE-14), ACM
Press, |
|
Researcher
: Lui WC |
|
List of Research Outputs |
|
Hui C.K., Yiu S.M. and Lui W.C., Accountability in organizations, Int. J. Information and Computer Security. UK, Inderscience Enterprises Ltd, 2007, Vol. 1, No. 3: 237-255. |
|
List of Research Outputs |
|
Chan H.L., Chan W.T., Lam T.W., Lee L.K., Mak K.S. and Wong P., Energy Efficient Online Deadline Scheduling , The 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2007, 795-804. |
|
Chan W.T., Lam T.W., Mak K.S. and Wong P., Online Deadline Scheduling with Bounded Energy Efficiency, The 4th International Conference on Theory and Applications of Models of Computation (TAMC). 2007, 416-427. |
|
Researcher
: Mamoulis N |
|
Project Title: |
Periodicity of movement in spatiotemporal databases |
|
Investigator(s): |
Mamoulis N |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
01/2005 |
|
Completion Date: |
12/2006 |
|
Abstract: |
|
To develop the effective data mining algorithms that can discover periodic object movement patterns; to develop the indexes that cluster object movements based on the discovered periodic patterns; to study the discovery of patterns which are weighted according to how recently their instances appear. |
|
Project Title: |
Continuous Constraint Query Evaluation for Spatio-temporal Data Sequences |
|
Investigator(s): |
Mamoulis N, Cheung DWL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2005 |
|
Abstract: |
|
The main objectives of this project are: (1) The development of effective techniques that manage and index incoming events in memory. These techniques will take adantage of the special nature of the queries to minimize the required memory. (2) The development of appropriate algorithms for evaluation of CCQ. The algorithms should consider the online, dynamic nature of the queries. Each time a new event arrives, we need to validate whether it forms a query result with past events. (3) The development of approximate management and query evaluation solutions for problem settings, when the required memory is smaller than the available. For such cases, we should consider data structures like spatiotemporal histograms, which could allow query evaluation with some uncertainty. (4) The integration of the developed system with a spatiotemporal pattern mining module that will automatically define the CCQs. |
|
Project Title: |
Evaluation of advanced spatial queries in sensor networks |
|
Investigator(s): |
Mamoulis N |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
01/2007 |
|
Abstract: |
|
(1) We aim at providing methods that continuously evaluate advanced spatial queries in a sensor network locally, avoiding as much as possible unnecessary transmission of information to (potentially remote) centralized servers (i.e., information collectors). We are especially interested in queries that combine information from neighbor nodes, instead of monitoring simple aggregate results in a spatial region. An interesting class of such queries is spatial-pattern queries (a.k.a. structural spatial queries [PMD98]), which are generalizations of spatial joins. An example of a query in this class is “a high-temperature reading (>50 degrees) close to and surrounded by at least four low-humidity readings ( <40%)”. A local group of sensors whose readings satisfy this query could indicate an area that requires special attention (e.g., high chances of fire if a green area). The objectives of this project can be summarized as follows: (2) • The formal definition of spatial pattern queries for which results are combinations of sensors (i.e., locations) and interesting readings thereof. We aim to formally define such queries and language extensions for expressing them. In addition, we will investigate variants and extensions of the basic class of pattern queries. We will deal with instantaneous and continuous versions of the queries (with expiration times). We will also consider queries with temporal predicates between sensor readings (e.g., “report cases where a high temperature is sensed at most 5 seconds after a low-humidity reading, nearby”).(3) The development of routing mechanisms and communication protocols for registering spatial pattern queries at sensors. Sensors should be aware of the queries that may involve them and responsible for their evaluation (in their local neighborhood). Once a query is registered in the network, the affected sensors should be notified by appropriate routing mechanisms. In addition, we will develop mechanisms for communicating query results, computed locally, to a remote receiver (which may well be the query issuer). Moreover, we will deal with multiple query optimization, i.e., how to compute results of multiple sub-queries simultaneously and then extend them. Another related issue is how to encode/index queries at the sensor nodes in order to effectively determine whether a sensed value is relevant to a query and which one. (4) • The development of computationally efficient and power-aware query evaluation mechanisms. First, we should avoid continuous acquisition of sensor readings that would flood the network and affect negatively the power-life of sensors, which generate or forward them. Instead, we will develop effective mechanisms for localized computation of query results. Leader sensor nodes will be chosen and will be responsible for the evaluation and transmission of query results, aiming at minimization of (i) communication between sensors (i.e., messages and their sizes) and (ii) processing information at sensors.(5) The development of algorithms for approximate query evaluation in redundant networks. Sensor networks may be redundant; more nodes than necessary may densely be placed in a field in order to increase the accuracy for the sensed environmental readings and prevent total network failure when some nodes fail. We plan to apply query evaluation only at a small sample of the network enough to provide us with query results that may not be complete, but accurate enough based on guarantees derived by the sampling methodology. For this case, we will adapt previous mechanisms or develop new (based on the nature of queries) for node clustering, dynamic leader selection, and leader shutdown handling.(6) A successful outcome of this project will be of significant importance, since it may find application in several surveillance applications, including (1) emergency planning and disaster discovery, e.g., alerting fire departments for abnormal readings of sensor combinations; (2) real-time monitoring and analysis of movement patterns, indicated by thermal/motion sensors; (3) environmental monitoring, e.g., predicting wheather phenomena based on known combinations of sensor readings.> |
|
List of Research Outputs |
|
Cao H.P., Mamoulis N. and Cheung D.W.L., Discovery of Collocation Episodes in Spatiotemporal Data, The 6th IEEE International Conference on Data Mining. 2006. |
|
Cao H.P., Mamoulis N., Cheung D.W.L. and Yip K., Discovery of Periodic Patterns in Spatiotemporal Sequences, IEEE Transaction on Knowledge and Data Engineering. IEEE Computer Society, 2007, 19: 453-467. |
|
Karras P. and Mamoulis N., The Haar+ Tree: A Refined Synopsis Data Structure, IEEE 23rd International Conference on Data Engineering. 2007. |
|
Mouratidis K., Yiu M.L., Papadias D. and Mamoulis N., Continuous Nearest Neighbor Monitoring in Road Networks, Proceedings of the 32nd Very Large Data Bases Conference (VLDB), Seoul, Korea, September 2006.. 2006. |
|
Tao Y., Yiu M.L. and Mamoulis N., Reverse Nearest Neighbor Search in Metric Spaces, IEEE Transactions on Knowledge and Data Engineering (TKDE). 2006, 18(9): 1239-1252. |
|
Yiu M.L. and Mamoulis N., Reverse Nearest Neighbors Search in Ad Hoc Subspaces, IEEE Transactions on Knowledge and Data Engineering. IEEE Computer Society, 2007, 19(3): 412-426. |
|
Yiu M.L., Dai X., Mamoulis N. and Vaitis M., Top-k Spatial Preference Queries, IEEE 23nd International Conference on Data Engineering. 2007. |
|
Researcher
: Mui YC |
|
List of Research Outputs |
|
Yiu S.M., Wong P., Lam T.W., Mui Y.C., Kung H.F., Lin M.C. and Cheung Y.T., Research Output Prize, Faculty of Engineering, The University of Hong Kong. 2006. |
|
Researcher
: Ng CY |
|
List of Research Outputs |
|
Cheung
D.W.L. and Ng C.Y.,
Consultancy, Information Modeling for Garment Industry Business Exchange, iGarment
Ltd., |
|
Cheung
D.W.L. and Ng C.Y., |
|
Cheung
D.W.L. and Ng C.Y., |
|
Researcher
: Ngai WK |
|
List of Research Outputs |
|
Ngai W.K., Kao C.M., Chui C.K., Cheng C.K., Michael C.L. and Yip Y.L., Efficient Clustering of
Uncertain Data, Proceedings of the 6th IEEE International Conference on
Data Mining (ICDM 2006). |
|
Ngai W.K., Kao C.M., Cheng R., Chau M.C.L., Yip Y.L. and Chui C.K., Efficient Clustering of Uncertain Data, The 2006 IEEE International Conference on Data Mining (IEEE ICDM 06). 2006, 436-445. |
|
Researcher
: Peng Z |
|
List of Research Outputs |
|
Ting
H.F., Peng Z. and
Leung H.F., An efficient algorithm for online square detection, In: G.
Ausiello, Theoretical Computer Science. |
|
Ting
H.F. and Peng Z., An
optimal algorithm for maximum constrained agreement subtree for binary trees,
In: A. Tarlecki, Information processing letters. |
|
Researcher
: Pun KH |
|
Project Title: |
Community Legal Information Project |
|
Investigator(s): |
Pun KH |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Department of Justice, HKSAR Government - General Award |
|
Start Date: |
04/2004 |
|
Abstract: |
|
To study community legal information. |
|
List of Research Outputs |
|
Wang M., Li L., Yiu S.M., Hui C.K., Chong C.F., Chow K.P., Tsang W.W., Chan H.W. and Pun K.H., A Hybrid Approach for
Authenticating MPEG-2 Streaming Data, Proceedings of Multimedia Content
Analysis and Mining International Workshop (MCAM 2007). |
|
Researcher
: Siu PLP |
|
List of Research Outputs |
|
Lau
F.C.M., Belaramani N.M., Kwan V.J.W.M., Siu P.L.P., Wing W.K. and Wang C.L., Code-on-Demand and Code
Adaptation for Mobile Computing, The Handbook of |
|
Researcher
: Su Q |
|
List of Research Outputs |
|
Su Q., Fung S.K. and Wong K.K.Y., Clustering Based 3D Level
Set Method for Volumetric Cardiac Segmentation, Conference on Biomedical
Engineering. |
|
Researcher
: Sui A |
|
List of Research Outputs |
|
Dong
Y., Sui A., Yiu S.M., Li V.O.K. and Hui C.K., An efficient cluster-based
proactive secret share update scheme for mobile ad hoc networks, Proc.
IEEE ICC. |
|
Researcher
: Tam SL |
|
List of Research Outputs |
|
Chan H.L., Lam T.W., Sung W.K., Tam S.L. and Wong S.S., A Linear Size Index for Approximate Pattern Matching, The 17th Annual Symposium on Combinatorial Pattern Matching (CPM). Springer, 2006, LNCS 4009: 49-59. |
|
Chan H.L., Lam T.W., Sung W.K., Tam S.L. and Wong S.S., Compressed Indexes for Approximate String Matching, In: Yossi Azar, Thomas Erleback, 14th Annual European Symposium on Algorithms (ESA). Springer, 2006, LNCS 4168: 208-219. |
|
Researcher
: Ting HF |
|
Project Title: |
Algorithmic issues on designing media-on-demand systems |
|
Investigator(s): |
Ting HF, Lam TW |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
08/2002 |
|
Abstract: |
|
With the use of relative-competitive analysis for online systems, the project attempts to provide a theoretical foundation for comparing different media-on-demand (MOD) systems and thus helps to decide scientifically the right configurations. It is anticipated that results of the analysis can be used to design schedulers with performance guarantee and implement computational tools for building cost-effective MOD systems. |
|
Project Title: |
Design and analysis of algorithms for constrained structure comparisons |
|
Investigator(s): |
Ting HF |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
08/2006 |
|
Abstract: |
|
1 (The motivation and background for the objectives are given in the next sections.) We design efficient algorithms for the Constrained Maximum agreement subtree (CMAST) problem and the Constrained Forest Edit-Distance (CFED) problem, which find important applications in bioinformatics, especially in comparative and evolutionary genomics. 2 We implement our algorithms and develop a Web-based tool that allows other biologists use our algorithms to solve their problems. 3 We gain, from our study, insights into the underlying intricacy of a new class of problems, namely the constrained combinatorial optimization problems, and develop general algorithmic techniques for them. 4 We explore a new problem solving methodolgy, namely knwoledge-based problem solving, and study how domain knowledge help us solve difficult problems. |
|
List of Research Outputs |
|
Hung
R.Y.S. and Ting H.F., A
Tight Analysis of the Most-Requested-First for On-demand Data Broadcasts, In:
D.T. Lee, The Twelfth Annual International Computing and Combinatorics
Conference. |
|
Ting
H.F., Peng
Z. and Leung H.F., An efficient algorithm for online square detection,
In: G. Ausiello, Theoretical Computer Science. |
|
Ting
H.F. and Peng Z., An optimal algorithm for
maximum constrained agreement subtree for binary trees, In: A. Tarlecki, Information
processing letters. |
|
Ting
H.F. and Hung Y.S.R., An optimal
broadcasting protocol for mobile video-on-demand, In: Barry Jay, Proceedings
of the 13th Australasian Theory Symposium. |
|
Researcher
: Towey DP |
|
List of Research Outputs |
|
Chan
K.P., Chen T.Y. and Towey
D.P., Forgetting Test Cases, 30th Annual Internation Computer
Software and Application Conference (COMPSAC 2006). |
|
Chan
K.P., Chen T.Y. and Towey
D.P., Probabilistic Adaptive Random Testing, Six International
Conference on Quality Software (QSIC 2006). |
|
Researcher
: Tsang KCK |
|
List of Research Outputs |
|
Tsang
M.C.M., Wang C.L., Tsang K.C.K. and Lau F.C.M., A Receiver-Coordinated
Approach for Throughput Aggregation in High Bandwidth Multicast, INFOCOM
2007. 26th IEEE International Conference on Computer Communications. |
|
Researcher
: Tsang MCM |
|
List of Research Outputs |
|
Tsang
M.C.M., Wang
C.L., Tsang K.C.K. and Lau F.C.M., A Receiver-Coordinated
Approach for Throughput Aggregation in High Bandwidth Multicast, INFOCOM
2007. 26th IEEE International Conference on Computer Communications. |
|
Researcher
: Tsang WW |
|
Project Title: |
Tests for uniformity |
|
Investigator(s): |
Tsang WW, Chow KP, Hui CK, Chan HW, Chong CF, Pun KH |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
01/2005 |
|
Abstract: |
|
To develop accurate and easy-to-compute C programs for the cumulative distribution functions of the KS statistic and the Anderson-Darling statistic; to conduct a fair and thorough comparison on the power of various tests for uniformity; to develop new tests for uniformity. |
|
Project Title: |
Evaluating the CDF of the Kolmogorov Statistic for unknown parameter case |
|
Investigator(s): |
Tsang WW, Chong CF |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Small Project Funding |
|
Start Date: |
09/2005 |
|
Abstract: |
|
A goodness-of-fit test checks whether a set of samples follows a hypothetical distribution. The most common test for checking discrete samples is the chi-square test. The counterpart for real samples is the Kolmogorov-Smirnov (KS) test [3,5]. Consider an ordered set of samples, x1≤x2≤…≤xn, and the hypothetical distribution, F(x), where all parameters of F(x) are known. The empirical distribution function (EDF) is defined as / | 0, x < x1, Fn(x) = < k/n , xk ≤ x < xk+1, k = 1,2,…,n-1, | 1, xn ≤ x. \The Kolmogorov statistic, Dn, measures the maximum absolute distance between F(x) and Fn(x). The test result is conventionally determined by looking up tables of the critical values of Dn obtained from simulation [6]. In 2003, we developed a program that evaluates the cumulative distribution function (CDF) of Dn with 13-digit accuracy for 2 ≤ n ≤ 16000 [4]. The test result can thus be determined from the CDF of Dn. However, the KS test is still not quit readily applicable because the parameters of F(x) are often unspecified in real world applications. For example, in the testing of exponentiality, usually we have no idea on the mean of the exponential distribution. Therefore, we need to first estimate the mean from the samples. Then we check whether the samples follow the exponential distribution of this mean. The Dn so computed is noticeably smaller than that of the case where the mean is known beforehand. Durbin is the first scholar who advocates the study of the difference between the two cases [1,2]. Stephens has worked out a couple approximation formulas for the CDFs of two unknown parameter cases [7]. However, these formulas deviate from the true values by as much as 2%. Such extent of errors is not cmmensurate with the modern computing capability. The objective of this project is to develop accurate computer programs that evaluate the CDFs of Dn for the tests of normality and exponentiality, the two most common goodness-of-fit tests in unknown parameter case.Reference[1] J. Durbin, Distribution theory for tests based on the sample distribution function, Regional Conference Series in Applied Mathematics (9), SIAM, Philadelphia, 1973.[2] J. Durbin, Kolmogorov-smirnov tests when parameters are estimated, with applications to tests of exponentiality and tests on spacings, Biometrika, 62(1): 5-22, 1975.[3] A. Kolmogorov, Sulla determinazione empirical ei una legge di distributione, Giornale Dell' Istituto Italiano Degli Attuari, 4:83-91, 1933.[4] G. Marsaglia, W. W. Tsang and J. Wang, Evaluating Kolmogorov's distribution, Journal of Statistical Software, 8(18): 1-4, 2003.[5] N. V. Smirnov, On the deviation of the empirical distribution function, Recreational Mathematics (Mat. Sbornik), 6:3-26, 1939.[6] M. A. Stephens, EDF statistics for goodness of fit and some comparisons, Journal of the American Statistical Association, 69 (347): 730-737, 1974.[7] M. A. Stephens, Asymptotic results for goodness-of-fit statistics with unknown parameters, Annuals of Statistics, 4:357-369, 1976. |
|
Project Title: |
Evaluating the CDFs of the Anderson-Darling Statistics for normality and exponentiality testing |
|
Investigator(s): |
Tsang WW |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Small Project Funding |
|
Start Date: |
12/2006 |
|
Abstract: |
|
A goodness-of-fit test checks whether a
set of samples follows a hypothetical distribution. The most common test for
checking discrete samples is the Pearson’s chi-square test. The most common
one for checking real samples is the Kolmogorov-Smirnov (KS) test [6,8]. The
Anderson-Darling (AD) test is another test for checking real samples [1,2].
Consider an ordered set of samples, x1≤x2≤…≤xn, and the hypothetical distribution, F(x), whose parameters are
completely specified. The empirical distribution function (EDF) is denoted as
Fn(x). Fn(x) equals 0 when x < x1, equals k/n when xk ≤ x ≤ xk+1 for k = 1,2,...,n-1, and equals 1
when xn ≤ x. The KS statistic, Dn, measures the
maximum absolute distance between F(x) and Fn(x). The AD statistic, An,
measures the weighted sum of the squares of the differences between F(x) and
Fn(x). The AD test is a special case of the Cramer-von Mises approach. It is
more powerful than the KS test [9]. Both Dn and An are distribution-free. The
cumulative distribution function (CDF) of An is difficult to evaluate. T. W.
Anderson and D. A. Darling have given an integration formula for the limiting
CDF [1]. In 1954, they computed critical values of three significant levels
of the limiting CDF using numerical integration [2]. P. A. W. Lewis tabulated
the CDF of An for n = 1 to 8 and n = ∞ in 1961 [11]. He only evaluated the
first two terms of a series expansion of the CDF. In 1974, Stevens gave
tables of critical values for the limiting CDF [9]. In 1988, C. D. Sinclair
and B. D. Spurr gave two approximation formulas for the limiting CDF [7]. In
2000, D. E. A. Giles derived a saddlepoint approximation for the limiting CDF
[5]. His formula has accuracy similar to the Sinclair’s in the right tail of
the distribution but superior in the left tail. The accuracy of the formulas
or critical values mentioned above is at best 4 to 5 digits. In real life
applications, the parameters of a hypothetical distribution are often not
known. For example, in the testing of normality, usually we first estimate
the mean and variance from the samples. Then we check whether the samples
follow the normal distribution with such mean and variance. A test statistic,
Dn or An, so computed is noticeably smaller than that of the case where the
mean and variance are known beforehand. J. Durbin is the first scholar who
advocates the study of the difference between the known (completely
specified) and unknown parameter cases [3,4]. The statistics in the latter
are not distribution free, i.e., the distribution of Dn or An depends on
F(x). Durbin has derived a formula for the limiting CDF of An for
exponentiality testing. However, his approach is computationally unstable in
the crucial right tail region. M. A. Stephens has tabulated a table of
critical values of An for normality and exponentiality testing from
simulation results [10]. These values have about 2-digit accuracy in general
but deviate from the true ones by as much as 2% in some cases. The objective
of this project is to develop computer programs that evaluate the CDFs of the
AD statistics in two most common applications 1. To develop a computer
program that evaluates the CDF of the AD statistic for normality testing when
the mean and variance are estimated from the samples being tested. No such
program is currently available. A few critical values of the CDF found in
literature deviate from the true values by as much as 2%. We aim at achieving
an accuracy of 3 digits. 2. To develop a computer program that evaluates the
CDF of the AD statistic for exponentiality testing when the mean is estimated
from the samples being tested. No such program is currently available. A few
critical values found in literature deviate from the true values by as much
as 2%. We aim at achieving an accuracy of 3 digits. References [1] T. W. Anderson
and D. A. Darling, Asymptotic theory of certain ‘goodness-of-fit’ criteria
based on stochastic processes, Ann. Math. Stat., 23 193-212, 1952. [2] T. W.
Anderson and D. A. Darling, A test of goodness of fit, J. Amer. Stat., Assn.,
49 765-769, 1954. [3] J. Durbin, Distribution theory for tests based on the
sample distribution function, Regional Conference Series in Applied
Mathematics (9), |
|
List of Research Outputs |
|
Tsang
W.W. and Cheng K.H., The chi-square test
when the expected frequencies are less than 5, Proceedings of the COMPSTAT
2006, 17th Symposium of IASC. |
|
Wang M., Li L., Yiu S.M., Hui C.K., Chong C.F., Chow K.P., Tsang W.W., Chan H.W. and Pun K.H., A Hybrid Approach for
Authenticating MPEG-2 Streaming Data, Proceedings of Multimedia Content
Analysis and Mining International Workshop (MCAM 2007). |
|
Researcher
: Tse SSH |
|
List of Research Outputs |
|
Shi Y, Lau F.C.M., Tse S.S.H., Du Z.H., Tang R.C. and Li S.L., Club Theory of The Grid, Concurrency and Computation: Practice and Experience. 2006, 18: 1759-1773. |
|
Researcher
: Tse TH |
|
Project Title: |
Towards an integrated method for program testing, proving debugging |
|
Investigator(s): |
Tse TH |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2004 |
|
Abstract: |
|
To provide an integrated method for testing, proving and debugging; to reduce the cost of software quality assurance by improving on individual techniques for testing, proving and debugging; to improve on the quality and relaibility of the software thus produced; to provide software engineers with effective testing, proving and debugging tools. |
|
Project Title: |
27th Annual international computer software and applications conference |
|
Investigator(s): |
Tse TH |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Croucher Foundation - Conference / Seminars |
|
Start Date: |
09/2004 |
|
Abstract: |
|
27th Annual international computer software and applications conference |
|
Project Title: |
TIRAMISU: testing conText-sensItive, concurRent And MIddleware-baSed Ubiquitous software |
|
Investigator(s): |
Tse TH |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Seed Funding Programme for Basic Research |
|
Start Date: |
02/2006 |
|
Abstract: |
|
Ubiquitous computing means computing
anywhere and at any time. Context-sensitive ubiquitous software dynamically
adapts its operations according to the changing environment. One of the
strategic directions of |
|
Project Title: |
An extensible fault-based predicate testing toolset for wireless sensor network software applications |
|
Investigator(s): |
Tse TH, Chan WK |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Innovation and Technology Support Programme |
|
Start Date: |
09/2006 |
|
Abstract: |
|
The primary objective is to design and implement a predicate testing toolset for the development of wireless sensor network (WSN) applications running on TinyOS using nesC as the implementation language. TinyOS is the de facto state-of-the-art operating system for WSN applications. nesC is the de facto development language for TinyOS. Other objective include: (i) to formulate product-one architecture for the testing of embedded software; (ii) to enhance experience in the area of embedded software engineering; (ii) to improve on the quality of WSN applications; (iv) to improve on the quality of WSN applications; (v) to test and enrich the capability of the fault class hieracrhy and gain further insights on predicate testing; and (vi) to provide the industry with a user-friendly toolset for the development of WSN applications. |
|
Project Title: |
TIRAMISU: testing context-sensitive, concurrent and middleware-based ubiquitous software |
|
Investigator(s): |
Tse TH |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2006 |
|
Abstract: |
|
1 The objectives of the project are as
follows: (a) To provide integration testing techniques for context-sensitive
concurrent middleware-based ubiquitous systems, (b) To provide unit testing
techniques for context-sensitive concurrent middleware-based ubiquitous
systems, (c) To provide software engineers with effective testing procedures
and tools for context-sensitive software, and (d) To improve on the quality
and reliability of ubiquitous software. 2 The proposed project has important
theoretical and practical implications: (i) State explosion is an open
problem in software testing and verification. It becomes significantly worse
in context-sensitive and concurrent ubiquitous software. This project will
address the problem using an enhanced form of extension particularly suitable
for conformance testing. (ii) Results of context-sensitive ubiquitous
applications may be hidden behind a hardware-software architecture so that
they cannot easily be observed or recorded. This project will address the
problem of testing context-sensitive software without precise oracles. (iii)
Formal methods such as model checking and static analysis are gaining
acceptance by practicing software engineers in recent years. This project
will help accelerate this trend by demonstrating the usefulness of the CSP
model for software engineering and software testing. (iv) The project will
provide practical procedures and tools for software engineers to enhance the
efficacy of software quality assurance, thus improving the cost-effectiveness
of software development. (v) The usefulness of the testing techniques will be
evaluated by experimental studies based on simulated and empirical data. (vi)
The results of the project are important to the quality assurance of
context-sensitive ubiquitous applications in |
|
List of Research Outputs |
|
Cai K.Y., Ohnishi A. and Tse T.H., Guest editors' introduction, Special Issue on Quality Software, International Journal of Software Engineering and Knowledge Engineering. Singapore, World Scientific, 2006, 16 (5): 653−654. |
|
Chan W.K., Chen T.Y., Lu H., Tse T.H. and Yau S.S., Integration testing of context-sensitive middleware-based applications: a metamorphic approach, International Journal of Software Engineering and Knowledge Engineering. Singapore, World Scientific, 2006, 16 (5): 677−703. |
|
Chan W.K., Cheung S.C., Ho J.C.F. and Tse T.H., Reference models and automatic oracles for the testing of mesh simplification software for graphics rendering, Proceedings of the 30th Annual International Computer Software and Applications Conference (COMPSAC 2006), IEEE Computer Society Press, Los Alamitos, California. 2006, 429−438. |
|
Chan
W.K., Chen T.Y., Cheung S.C., Tse T.H. and Zhang Z., Towards the testing of
power-aware software applications for wireless sensor networks, Reliable
Software Technologies: Ada-Europe 2007, N. Abdennadher and F. Kordon (eds.),
Lecture Notes in Computer Science, vol. 4498, Springer, |
|
Chen T.Y., Huang D.H., Tse T.H. and Zhang Z., An innovative approach to tackling the boundary effect in adaptive random testing, Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS-40), IEEE Computer Society Press, Los Alamitos, California. 2007. |
|
Hu P., Zhang Z., Chan W.K. and Tse T.H., An empirical comparison between direct and indirect test result checking approaches , Proceedings of the 3rd International Workshop on Software Quality Assurance (SOQUA 2006) (in conjunction with the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering (SIGSOFT 2006/FSE-14)), ACM Press, New York. 2006, 6−13. |
|
Lu H., Chan W.K. and Tse T.H., Static slicing for pervasive programs, Proceedings of the 6th International Conference on Quality Software (QSIC 2006), IEEE Computer Society Press, Los Alamitos, California. 2006, 185−192. |
|
Lu
H., Chan W.K. and Tse T.H., Testing context-aware
middleware-centric programs: a data flow approach and an RFID-based
experimentation, Proceedings of the 14th ACM SIGSOFT International
Symposium on Foundations of Software Engineering (SIGSOFT 2006/FSE-14), ACM
Press, |
|
Tse
T.H., Cover Design, Proceedings of the 6th
International Conference on Quality Software (QSIC 2006), IEEE Computer
Society Press, |
|
Tse
T.H., Editor, Journal of Systems and
Software. Elsevier, |
|
Tse
T.H., Editor, Software Testing,
Verification and Reliability. Wiley, |
|
Tse
T.H., Foundation Editor, Journal for
Universal Computer Science. Springer, |
|
Tse T.H., Logo, Poster, Banner and Backdrop Designs, Hong Kong Abilympics. 2007. |
|
Tse T.H., Cai K.Y. and Kuo D.F., Virtual Earth Award, Microsoft Research. 2007. |
|
Researcher
: Wang CL |
|
Project Title: |
The HKU Grid
Computing |
|
Investigator(s): |
Wang CL, Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
The |
|
Start Date: |
07/2003 |
|
Abstract: |
|
To share resources and knowledge under
the theme of grid computing; to collaborate on a joint effort to develop the |
|
Project Title: |
A component-based software architecture for context-aware pervasive computing |
|
Investigator(s): |
Wang CL, Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2004 |
|
Abstract: |
|
To carry out: (1) proactive and context-aware adaptation: to realize the functionality adaptation. The proposed adaptation mechanism should be able to proactively discover contextual information and make applications constantly adapt to the changing environment. (2) mobility Support: to explore the possibilities of using the facet model to achieve better mobility in the pervasive world. In particular, the proposed system will support user mobility, which allows nomadic users to continue their job while switching from device to device. (3) software Extensibility: to build a real-life pervasive application using facets, to demonstrate that the functionalities and the scale of the application could be very extensibe and no longer be restricted by the resource-constrained devices. |
|
Project Title: |
Session continuity for mobile computing |
|
Investigator(s): |
Wang CL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Small Project Funding |
|
Start Date: |
11/2004 |
|
Abstract: |
|
To construct the missing session layer support on top of the TCP, which masks network changes caused by terminal mobility from the applications, thereby maintaining virtually uninterrupted dialogs between endpoints; to design a name service which supports flexible mappings between logical entities and their network addresses, and to tackle the inherent performance issues. |
|
Project Title: |
Enhanced Distributed JVM for Large-scale Scientific Applications |
|
Investigator(s): |
Wang CL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Small Project Funding |
|
Start Date: |
04/2006 |
|
Abstract: |
|
Many large-scale scientific and commercial data-mining applications are written in Java. These applications are in great need of a huge virtual memory to keep the created Java objects in memory for computation. In this research, we will introduce a cluster middleware, a Distributed JVM (DJVM) that can group the memory in all computing nodes (PCs or servers) to support parallel execution of large-scale memory-demanding Java applications. The DJVM will be built at the virtual machine level and it can make a cluster appear as a single, multi-processor machine to Java applications. Existing JVM or DJVM prototypes don't provide solutions for the problem of supporting huge virtula memory. A sinlge machine JVM can support up to 2GB memory space, which is insufficient for running an application with large data set. Previous approaches in DJVM have limitation in the JVM heap management in supporting an address space larger than 2GB in a 32-bit platform. The difficulties come from two aspects. (1) The JVM specification defines the size of the object refence as a word in a physical machine. On 32-bit machines, it is therefore 32-bit. Extending the address space will need to revise the JVM specification substantially. (2) All previous DJVMs are based on some open-source JVM implementations, which tends to follow the orginal specification. For new implementation, new and careful design in JVM heap and JIT compilers is needed in the DJVM kernel for manipulating of Java references, which is a non-trivious task. It needs to involve complex transformations of new reference type on the 32-bit platforms.To make the existing applications able to be transparently migrated to the new platform, we also need to make sure the Java libraries and latest APIs used by the Java applications can be executed on DJVM. To incorporate different Java libraries in a DJVM is a challenge because a JVM is often shipped with its own class libraries. Simply setting class search path or copying class libraries in the DJVM directories will not work. There are many compatibility problems to solve for a JVM to use another JVM's libraries. A DJVM needs to find a portable and flexible method to solve the transplant of Java libraries for the applications to use. |
|
Project Title: |
An advanced distributed java virtual machine on commodity clusters for high-performance memory-intensive computing |
|
Investigator(s): |
Wang CL, Lau FCM |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2006 |
|
Abstract: |
|
(1) n a distributed Java Virtual Machine (DJVM), threads in a Java program are mapped to different computing nodes for execution and a shared global heap created from the memory of all the participating nodes allows data sharing among physically distributed threads. The state-of-the-art DJVMs can perform thread-to-processor remapping via thread migration to achieve load balancing. Multithreaded programming on a DJVM has the potential to become a preferred approach to high-performance computing. The hurdle, however, lies in the situation where many scientific problems in real life today have huge memory consumptions which are beyond what existing DJVM systems can offer. To our best knowledge, none of the existing DJVMs developed for commodity 32-bit PC clusters can offer cluster-wide sharable memory space exceeding 4 gigabytes (the size limit of virtual memory that a single 32-bit machine can address) no matter how many cluster nodes are used. (2) In this research, we propose to elevate DJVM technologies to a new level so that the new DJVM could support any memory-intensive scientific computing application using commodity 32-bit PC clusters. In the new DJVM, we will build a huge global object space (HGOS), a shared global heap that spans all the cluster nodes and can be larger than 4GB for storing a huge number of objects or very big objects. When large-size objects are in the HGOS, locality of reference becomes an important issue. We consider thread migration a good mechanism to achieve better locality, which can avoid unnecessary data migration. Nevertheless, distributed Java thread execution on a DJVM with thread migration will exhibit different behaviors over time that are not easily captured. The workload of a thread will change after migration because the object access cost will change with the change of execution location. The cache coherence overhead depends on the actual thread location and the sharing status that are only known at execution time. All these will make the workload of the system very unpredictable as compared with those using traditional message-passing solutions. The benefit of thread migration is therefore difficult to be estimated, and such simple heuristics as considering only the workloads of cluster nodes (based on the assumption that workload remains unchanged after migration) will not work. In this research, we propose to build a new DJVM having the following distinctive features. (A) Huge global object space support: To support a huge Java heap with size that can scale with the cluster size, and we will support cluster-wide 64-bit object reference for identifying and locating objects in a 32-bit commodity cluster. New addressing scheme will be developed for accessing segmented objects that are distributed among cluster nodes. (B) Fast wide address translation: As the hardware only supports a 32-bit addressing space, we need a fast software solution to translate the wide references to 32-bit references. An extended pointer swizzling method using a page faulting mechanism will be studied for achieving fast wide address translation and to avoid unnecessary object checking overheads.(C) HGOS-aware cache coherence protocol. As we support large objects that could be allocated across cluster nodes, new cache coherence protocol catered for the HGOS will be developed. Efficient whole object and segmented object caching mechanisms in line with the Java memory model will be explored for efficient object accesses in a cluster environment. (D) HGOS-directed workload model. We will investigate and propose a thread-centric load model to capture the migration benefits under the HGOS. The load model should reflect the explicit communication cost in accessing remote objects and the implicit cost embodied in the cache coherence protocol. A runtime profiling method using JIT-compilation techniques will be used to analyze thread stack contexts for approximating the workload of a thread and its migration benefits.(E) New thread migration policies: Migration policies will be devised based on the proposed workload model for choosing threads for migration to achieve maximum profits. We allow thread migration to take place when (1) thread migration can reduce the object access cost; (2) the workload among the cluster nodes is imbalanced, or (3) new nodes are added to participate in the computation.The proposed solutions make it possible to realize high-performance memory-intensive computations using commodity PC clusters based on the Java multithreading programming paradigm. The implementations of the new DJVM will follow the Java language specification without introducing new APIs or language modifications, which allows any existing Java program that runs on a single-node JVM to run on a cluster without any modification. Therefore, ordinary programmers do not need to learn new complicated parallel languages or runtime systems, such as MPI or software distributed shared memory (DSM). The latter approaches tend to impose a steep learning curve because they use explicit messaging passing or programmer-directed data partitioning to achieve efficient parallel execution. |
|
List of Research Outputs |
|
Lau
F.C.M., Belaramani N.M., Kwan V.J.W.M., Siu P.L.P., Wing W.K. and Wang C.L., Code-on-Demand and Code
Adaptation for Mobile Computing, The Handbook of |
|
Ma T...C..., Chen L., Wang C.L. and Lau F.C.M., G-PASS: An Instance-oriented Security Infrastructure for Grid Travelers, Concurrency and Computation: Practice and Experience. 2006, 18: 1871-1884. |
|
Tsang
M.C.M., Wang C.L., Tsang K.C.K. and Lau F.C.M., A Receiver-Coordinated
Approach for Throughput Aggregation in High Bandwidth Multicast, INFOCOM
2007. 26th IEEE International Conference on Computer Communications. |
|
Researcher
: Wang R |
|
List of Research Outputs |
|
Wang R., Gossiping in Meshes in All-Port Mode and with Short Packets, 2006. |
|
Researcher
: Wang WP |
|
Project Title: |
Collision detection of moving ellipses and ellipsoids |
|
Investigator(s): |
Wang WP |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Seed Funding Programme for Basic Research |
|
Start Date: |
10/2002 |
|
Abstract: |
|
To study the collision detection problem between moving ellipses in 2D plane and ellipsoids in 3D space. Specially, based on the PI's recent study on the algebraic properties of the arrangement of two ellipsoids. |
|
Project Title: |
New methods for collision detection of ellipsoids |
|
Investigator(s): |
Wang WP |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
09/2003 |
|
Abstract: |
|
To develop methods of collision detection of moving ellipsoids in the following three different cases: i) motions expressible as rational functions of time; ii) motions expressible by analytical functions of time; continuous motions, which include the important class of continuous but "non-smooth' motions due to interactive user control or constant interaction with surrounding objects in a VR or computer game application. |
|
Project Title: |
A new collision detection scheme fo human character animation |
|
Investigator(s): |
Wang WP |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Small Project Funding |
|
Start Date: |
11/2004 |
|
Completion Date: |
10/2006 |
|
Abstract: |
|
Based on our previous results, to consider other quadric surfaces both in the static case as well as in continuous motion. |
|
Project Title: |
Efficient Collision Detection for Composite Quadric Models |
|
Investigator(s): |
Wang WP |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Seed Funding Programme for Basic Research |
|
Start Date: |
04/2006 |
|
Completion Date: |
12/2006 |
|
Abstract: |
|
[Purpose] We shall investigate the collision detection problem for composite quadric models (CQMS), which are 3D objects bounded by planar and quadric surfaces. CQMs include objects as simple as ellipsoids and those more complex ones defined as the CSG (Constructive Solid Geometry) objects with quadric primitives. Figure 1 shows objects of this type in a context of collision detection for robot operation. Collision detection is of paramount importance to many fields involving object interaction and simulation, e.g., computer animation, computational physics, virtual reality, robotics and CAD/CAM. The efficiency and accuracy of the collision detection methods are critical to most applications. Quadric surfaces are widely used in practice. Ellipsoids and truncated/capped cylinders or cones are often used as bounding volumes of complex geometry in graphics and robotics. The rising interests in modeling human characters in computer game/animation and organic forms in bio-science make ellipsoids a serious contender for shape representation. Furthermore, most mechanical parts can accurately be modeled with simple quadrics, such as spheres, cones, and cylinders. Through composite representation or CSG composition, an even wider class of complex objects is modeled by quadric surfaces. [Key Issues] Most research in the literature has so far mainly concentrated on collision detection of piecewise linear objects (e.g., polyhedrons). These methods usually sample the motion time interval and then perform interference test for static objects along the motion path at sampled instants. When applied to collision detection of moving quadric surfaces, there are problems with these methods: 1) piecewise linear approximation introduces geometric error and entails large storage space; 2) discrete time sampling may miss collision between time samples for small or fast moving objects due to inadequate sampling, or results in inefficiency when overly dense sampling is used. [Previous work 1] Collision detection of quadric surfaces: Quadric surfaces, or quadrics, are the simplest curved surfaces of degree two. A straightforward way to detect whether or not two quadrics collide is to determine their intersection: two quadrics are separate if and only if their intersection is empty in real space. Intersection of quadric surfaces has been extensively studied [4, 5, 10, 9]. Related to collision detection of quadrics, distance computation for quadric surfaces is studied in [3]. However, the collision detection problem of quadrics by itself does not necessitate the computation of intersection or distance of two quadrics. Therefore, the procedures in the above work are usually too involved for time critical collision detection. Moreover, it is difficult to extend these methods to continuous collision detection (CCD) of quadrics. [Previous work 2] Continuous collision detection of moving objects: The common feature of continuous collision detection (CCD) methods is that no discrete time sampling is needed, thus inaccuracy due to missing collision between time samples is avoided. Recently, Redon et al. propose CCD methods of Oriented Bounding Boxes (OBB) [6], and Line Swept Sphere (LSS) primitives [7]. However, so far there has been no effective solution in the literature to CCD of quadric surfaces or the like, except for the recent work by the PI and his collaborators dealing with the CCD of moving elliptic disks in 2D plane and the CCD of moving ellipsoids in 3D space, which are a special case of general quadrics. [Related work by PI] The PI and his collaborators pioneered the algebraic approach to collision detection of conics and quadric surfaces, starting from their 2001 paper [11] on an algebraic condition on the separation of two ellipsoids. Our results have led to an algebraic method for exact collision detection of two ellipsoids based on time sampling [8] and another algorithm for continuous collision detection (CCD) of moving ellipsoids based on the analysis of a bivariate function [1]. We have also conducted further study on algebraic methods for fast and exact CCD of moving elliptic disks in 2D plane by processing a univariate function [2]. Basically, using our algebraic approach, we can handle the input ellipsoids or ellipses directly without geometric approximation, and we can set up and solve collision detection equations exactly without the need to sample the motion time. Compared with the conventional methods, the benefit of this algebraic approach is the significant improvement in spatial and temporal accuracy in collision detection. In this project we expect to extend this approach to deal with general quadrics and, more importantly, composite objects bounded by piecewise quadric or planar surface patches. Clearly, CCD for composite quadric models is a much more challenging problem than that for ellipsoids. We will have to consider collision between different types of boundary elements, such a boundary curve versus a boundary curve. The difficulty and intricacy of this problem will fully be discussed in the next part on Research Methodology. [Objectives] We shall study an algebraic framework for continuous collision detection (CCD) of composite quadric models (CQM) which are objects bounded by quadric or planar surface patches. We will use algebraic conditions to characterize and compute the times of collision and contact points in an accurate and efficient manner. Our framework is a significant extension to the previous work pioneered by the PI on an algebraic approach to the exact collision detection for ellipses and ellipsoids. The main challenges in this extension are: 1) A much larger number of quadric surfaces and more complex contact configurations of them need to be studied; 2) Unlike ellipsoids which are defined by a single equation, CQMs are defined by multiple quadratic inequalities, i.e., they are real semi-algebraic varieties. Hence, the existing algebraic approach to CCD of ellipsoids cannot be applied straightforwardly to CCD of CQMs. We will devise a systematic framework for continuous collision detection of CQMs. Specifically, our objectives are: ** establish algebraic conditions to characterize contact configurations of quadric surfaces in 3D; ** based on these algebraic conditions, devise efficient algorithms for CCD of composite quadric models. |
|
Project Title: |
Continuous collision detection for composite quadric models in computer graphics |
|
Investigator(s): |
Wang WP |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
07/2006 |
|
Abstract: |
|
Establish algebraic conditions to characterize contact configurations of commonly used quadrics, such as ellipsoids, cones and cylinders, in 3D. Based on the above results, develop efficient algorithms for continuous collision detection of composite quadric models in the case where the intersection curves are conics. |
|
Project Title: |
New technology for real time and accurate collision detection in computer games and simulation |
|
Investigator(s): |
Wang WP, Choi YK, Liu Y, Lu L, Zheng D |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Innovation and Technology Support Programme |
|
Start Date: |
09/2006 |
|
Abstract: |
|
In this project we aim to develop this
collision detection technology from basic research results into an
easy-to-use software tool kit that emcompasses an array of functions for
collision detection of ellipsoids in various application scenarios in
computer games and 3D interactive virtual environments. For compatibility
with using boxes as bounding volumes, collision detection between boxes and
ellipsoids will also be implemented. We will develop a prototype to
demonstrate the utility and advantage of new collision detection technology.
Our software tool kit will be cross-platofrm and open source in order to
maximize its benefit to the computer game community in |
|
Project Title: |
Conmputation of Bounding Ellipsoids |
|
Investigator(s): |
Wang WP |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Seed Funding Programme for Basic Research |
|
Start Date: |
01/2007 |
|
Abstract: |
|
Bounding volumes of complex 3D shapes are widely used for computation simulation in computer graphic, robotic, biomedical engineering, and CAD/CAM. We propose a novel, efficient optimization method for computing the ellipsoid bounding volumes of 3D objects. The bounding ellipsoids provide a highly compact representation of 3D shapes, which originally are often represented in the verbose format of point samples, mesh surfaces or planar faces. Thus our resarch will be useful to applications in geometric reasoning and processing, collision detection, compression and transmission of geometric data. The objectives of the projects are:1) We shall investigate the novel use of elliptic metric for 3D shape decomposition in the ellipsoid boundingproblem. Preliminary tests have shown advantages of the elliptic metric over the conventional Euclidean metric. 2) A robust and efficient optimization algorithm will be developed for solving the ellipsoid bounding problem, capable of automatic volume-driven component splitting and merging. Information about features or skeletons, when available, will be exploited for good initialization and stable convergence. |
|
Project Title: |
Computational algebraic geometry for industrial applications |
|
Investigator(s): |
Wang WP, Choi YK |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
France/Hong Kong Joint Research Scheme - Travel Grants |
|
Start Date: |
01/2007 |
|
Abstract: |
|
1. Shape segmentation and representation using quadrics 2. Shape processing using quadrics 3. Collision detection for objects defined by quadric surfaces 4. Software for algebraic modeling |
|
List of Research Outputs |
|
Yan
D., Liu Y. and Wang W.P., Quadric Surface
Extraction by Variational Shape Approximation, In: Myung-Soo Kim, Kenji
Shimada, Geometric Modeling and Processing - GMP 2006: 4th International
Conference. |
|
Researcher
: Wang Z |
|
List of Research Outputs |
|
Wang Z., Static Type Analysis of XQuery Expressions Using Rewriting Calculus, 2007. |
|
Researcher
: Wing WK |
|
List of Research Outputs |
|
Lau
F.C.M., Belaramani N.M., Kwan V.J.W.M., Siu P.L.P., Wing W.K. and Wang C.L., Code-on-Demand and Code
Adaptation for Mobile Computing, The Handbook of |
|
Researcher
: Wong DCK |
|
List of Research Outputs |
|
Cheung
D.W.L. and Wong D.C.K.,
Consultancy Project, Hang Seng Bank Document Management System Design, Toppan
Ltd., Hong Kong. |
|
Cheung
D.W.L. and Wong D.C.K.,
Consultancy, Information Design for Content Standardization, Trade
Development Council, |
|
Researcher
: Wong KF |
|
List of Research Outputs |
|
Wong K.F., Lam T.W., Yang W. and Yiu S.M., Finding Alternative Splicing Patterns with Strong Support from Expressed Sequences , The 2007 International Conference on Bioinformatics and Computational Biology (BIOCOMP). 2007. |
|
Researcher
: Wong KKY |
|
Project Title: |
3D shape recovery of complex objects using a dual-space approach |
|
Investigator(s): |
Wong KKY |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
01/2006 |
|
Abstract: |
|
The main objective of this project is to develop a novel method for reconstructing complex 3D objects with unknown topology using their silhouettes extracted from the image sequences. The proposed method exploits the duality principle governing surface points and their corresponding tangent planes, and enables direct estimation of points on the contour generators. |
|
Project Title: |
Robust recovery of differential information and object shape from silhouettes of unordered viewpoints |
|
Investigator(s): |
Wong KKY |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Competitive Earmarked Research Grants (CERG) |
|
Start Date: |
01/2007 |
|
Abstract: |
|
The main objective of this project is to provide a robust computer vision based method for acquiring photorealistic 3D models of real world objects. Traditionally, high quality models are obtained through 3D laser scanners which are often expensive and not portable. The use of computer vision techniques provides a much cheaper alternative, and requires no more than a commercial grade imaging device. This is a vast advantage over laser scanners because no active sensor is required by these techniques, and there are fewer physical restrictions placed upon the object to be acquired. In this project, the silhouettes of the object are exploited to recover the differential properities of the object surface. Silhouettes are the profiles of the objects in the images, and they offer rich information about the shape of the objects. Compared with point features used in traditional photogrammetry algorithms, silhouettes can often be reliably extracted and provide relatively complete shape description about the observed objects. However, silhouettes in multiple views generally do not come with correspondent features, and hence the depth of the points on the silhouettes cannot be directly estimated using traditional stereovision techniques. Existing methods for reconstruction from silhouettes can be classified into two categories, namely volumetric approaches and differential approaches. While the volumetric approaches are more robust to objects with complicated shapes than existing differential approaches, they produce much less accurate surface points than differential approaches. Both the volumetric and differential approaches, however, can only reconstruct the visual hull of the object, and cannot reproduce concavities on the object surface. This project aims at bringing several important improvements over the existing differential approaches proposed by others and by the applicant: I) it can handle a more general configuration consisting of discrete viewpoints (cameras) with arbitrary spatial order, while existing differential approaches generally require the camera to travel a continuous path; II) it can extract a relatively complete and topologically correct surface like the volumetric approaches, while retain the accuracy of the differential approaches; III) it allows the integration of textural or shading information for further refinement of the reconstructed models and introduces concavities on the surface which cannot be inferred from silhouettes alone. To address the first issue, a novel distance measure between cameras is proposed. For each camera, we can dynamically discover the nearby cameras that allow differential structure on the surface to be estimated accurately. The second issue is addressed by introducing a novel generic surface extraction algorithm robust to a variety of topology of the observed object. The algorithm is motivated by the literature of medical image processing, particularly, surface extraction from cross-sections. The solution to the last issue is made possible by the nature of the methods we used to address the first two issues. By directly recovering the differential properties on the surface, we can easily locate the flat areas on the surface, which are de facto the candidate regions for concavities. The surface extraction algorithm we adopted conveniently allows us to insert vertices in the regions of interests, and refinement can then be done more efficiently. The proposed approach does not depend on the spatial order of the viewpoints of the input images, and can robustly reconstruct a complete complex object surface with high accuracy, and with the possibility of further refinement for introducing concavities to the model. |
|
List of Research Outputs |
|
Chung H.Y., Wong K.K.Y., Chin F.Y.L., Chow K.P. and Yuk S.C., Generalized Motion and Edge Adaptive Interpolation De-interlacing Algorithm, WSEAS Transactions on Computers. 2006, 5(11): 2544-2551. |
|
Su
Q., Fung S.K. and Wong K.K.Y., Clustering Based 3D
Level Set Method for Volumetric Cardiac Segmentation, Conference on
Biomedical Engineering. |
|
Wong
K.K.Y., Chin
F.Y.L., Chung H.Y., Chow K.P. and Yuk S.C., Motion and Edge Adaptive
Interpolation De-interlacing Algorithm, 10th WSEAS International
Conference on Computers. |
|
Wong
S.F., Wong K.K.Y. and
Cipolla R., Robust Appearance-Based Tracking Using a Sparse Bayesian
Classifier, 18th IAPR International Conference on Pattern Recognition.
|
|
Yuk
S.C., Wong K.K.Y., Chung H.Y., Chin F.Y.L. and Chow K.P., Real-time Multiple Head Shape
Detection and Tracking System with Decentralized Trackers, 6th IEEE
International Conference on Intelligent System Design and Applications. |
|
Zhang
G., Zhang H. and Wong K.K.Y., 1D Camera Geometry and
Its Application to Circular Motion Estimation, British Machine Vision
Conference. |
|
Zhang H., Wong K.K.Y. and Zhang G., Camera Calibration From Images of Spheres, IEEE Transactions on Pattern Analysis and Machine Intelligence . IEEE Computer Society, 2007, 29(3): 499-503. |
|
Zhang
H. and Wong K.K.Y., Camera
Calibration from a Translation + Planar Motion, 8th IASTED International
Conference on Signal and Image Processing. |
|
List of Research Outputs |
|
Wong K.Y., Yip C.L. and Li P.W., A novel algorithm for automatic tropical cyclone eye fix using Doppler radar data, Meteorological Applications . Wiley InterScience, 2007, 14: 49-59. |
|
Wong K.Y. and Yip C.L., Comparison of squall line positioning methods using radar data, Proceedings of the 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES-2006). 2006, 4253: 269-276. |
|
Wong K.Y., Hung Hing Ying Scholarships (2006-2007). 2007. |
|
Wong K.Y. and Yip C.L., Identifying weather systems from numerical weather prediction data, Proceedings of the 18th International Conference on Pattern Recognition (ICPR-2006). 2006, 4: 841-844. |
|
Yip C.L., Wong K.Y. and Li P.W., Data complexity in tropical cyclone positioning and classification, In: Mitra BASU Tin Kam HO, Data Complexity in Pattern Recognition. Springer Verlag, 2006. |
|
Yip C.L. and Wong K.Y., Identifying centers of circulating and spiraling flow patterns, Proceedings of the 18th International Conference on Pattern Recognition (ICPR-2006). 2006, 1: 769-772. |
|
List of Research Outputs |
|
Wong K.Y., Yip C.L. and Li P.W., A novel algorithm for automatic tropical cyclone eye fix using Doppler radar data, Meteorological Applications . Wiley InterScience, 2007, 14: 49-59. |
|
Wong K.Y. and Yip C.L., Comparison of squall line positioning methods using radar data, Proceedings of the 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES-2006). 2006, 4253: 269-276. |
|
Wong K.Y., Hung Hing Ying Scholarships (2006-2007). 2007. |
|
Wong K.Y. and Yip C.L., Identifying weather systems from numerical weather prediction data, Proceedings of the 18th International Conference on Pattern Recognition (ICPR-2006). 2006, 4: 841-844. |
|
Yip C.L., Wong K.Y. and Li P.W., Data complexity in tropical cyclone positioning and classification, In: Mitra BASU Tin Kam HO, Data Complexity in Pattern Recognition. Springer Verlag, 2006. |
|
Yip C.L. and Wong K.Y., Identifying centers of circulating and spiraling flow patterns, Proceedings of the 18th International Conference on Pattern Recognition (ICPR-2006). 2006, 1: 769-772. |
|
Researcher
: Wong SF |
|
List of Research Outputs |
|
Wong S.F., Wong K.K.Y. and Cipolla
R., Robust Appearance-Based Tracking Using a Sparse Bayesian Classifier, 18th
IAPR International Conference on Pattern Recognition. |
|
Researcher
: Wu J |
|
List of Research Outputs |
|
Wu J. and Huo Q., A Study of Minimum Classification Error (MCE) Linear Regression for Supervised Adaptation of MCE-Trained Continuous Density Hidden Markov Models, IEEE Trans. on Audio, Speech and Language Processing. IEEE, 2007, 15: 478-488. |
|
Wu J. and Huo Q., An Environment Compensated Minimum Classification Error Training Approach Based on Stochastic Vector Mapping, IEEE Transactions on Audio, Speech and Language Processing. IEEE, 2006, 14: 2147-2155. |
|
Researcher
: Wu Y |
|
List of Research Outputs |
|
Wu Y., An Empirical Study of the Use of Conceptual Models for Mutation Testing of Database Application Programs, 2007. |
|
Researcher
: Yan D |
|
List of Research Outputs |
|
Yan
D., Liu
Y. and Wang W.P., Quadric Surface
Extraction by Variational Shape Approximation, In: Myung-Soo Kim, Kenji
Shimada, Geometric Modeling and Processing - GMP 2006: 4th International
Conference. |
|
Researcher
: Yau CKJ |
|
List of Research Outputs |
|
Yau C.K.J., A Secure e-Course Copyright Protection Infrastructure, 2006. |
|
Researcher
: Yau SS |
|
List of Research Outputs |
|
Chan W.K., Chen T.Y., Lu H., Tse T.H. and Yau S.S., Integration testing of context-sensitive middleware-based applications: a metamorphic approach, International Journal of Software Engineering and Knowledge Engineering. Singapore, World Scientific, 2006, 16 (5): 677−703. |
|
Researcher
: Ye D |
|
List of Research Outputs |
|
Chan J.W.T., Chin F.Y.L., Ye D., Zhang Y. and Zhu H., Greedy Online Frequency Allocation in Cellular Networks, Information Processing Letters. Elsevier B.V., 2007, 102(2-3): 55-61. |
|
Chan W.T., Chin F.Y.L., Ye D., Zhang Y. and Zhu H., Frequency
Allocation Problem for Linear Cellular Networks, The 17th International
Symposium on Algorithms and Computation (ISAAC 2006). |
|
Researcher
: Yee KC |
|
List of Research Outputs |
|
Cheung
D.W.L. and Yee K.C.,
Consultancy Project, Interbanking Clearing Limited Swift Network (ICLSWN)
Message System Design, |
|
Cheung
D.W.L., Yee K.C. and Lee T.Y.T., Consultancy, Government
Electronic Trading Services, HKSAR Government Office of the Government
Chief Information Officer. |
|
Researcher
: Yip CL |
|
List of Research Outputs |
|
Wong K.Y., Yip C.L. and Li P.W., A novel algorithm for automatic tropical cyclone eye fix using Doppler radar data, Meteorological Applications . Wiley InterScience, 2007, 14: 49-59. |
|
Wong K.Y. and Yip C.L., Comparison of squall line positioning methods using radar data, Proceedings of the 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES-2006). 2006, 4253: 269-276. |
|
Wong K.Y. and Yip C.L., Identifying weather systems from numerical weather prediction data, Proceedings of the 18th International Conference on Pattern Recognition (ICPR-2006). 2006, 4: 841-844. |
|
Yip C.L., Wong K.Y. and Li P.W., Data complexity in tropical cyclone positioning and classification, In: Mitra BASU Tin Kam HO, Data Complexity in Pattern Recognition. Springer Verlag, 2006. |
|
Yip C.L. and Wong K.Y., Identifying centers of circulating and spiraling flow patterns, Proceedings of the 18th International Conference on Pattern Recognition (ICPR-2006). 2006, 1: 769-772. |
|
Researcher
: Yip YL |
|
List of Research Outputs |
|
Cheung L., Yip Y.L., Cheung D.W.L., Kao C.M. and Ng K.P., On Mining Micro-array Data by Order-Preserving Submatrix, International Journal of Bioinformatics Research and Applications (IJBRA). Inder Sciences Publishers, 2007, 3: 42-64. |
|
Ngai
W.K., Kao C.M., Chui C.K., Cheng C.K., Michael C.L. and Yip Y.L., Efficient Clustering of
Uncertain Data, Proceedings of the 6th IEEE International Conference on
Data Mining (ICDM 2006). |
|
Ngai W.K., Kao C.M., Cheng R., Chau M.C.L., Yip Y.L. and Chui C.K., Efficient Clustering of Uncertain Data, The 2006 IEEE International Conference on Data Mining (IEEE ICDM 06). 2006, 436-445. |
|
Researcher
: Yiu ML |
|
List of Research Outputs |
|
Mouratidis K., Yiu M.L., Papadias D. and Mamoulis N., Continuous Nearest Neighbor Monitoring in Road Networks, Proceedings of the 32nd Very Large Data Bases Conference (VLDB), Seoul, Korea, September 2006.. 2006. |
|
Tao Y., Yiu M.L. and Mamoulis N., Reverse Nearest Neighbor Search in Metric Spaces, IEEE Transactions on Knowledge and Data Engineering (TKDE). 2006, 18(9): 1239-1252. |
|
Yiu M.L. and Mamoulis N., Reverse Nearest Neighbors Search in Ad Hoc Subspaces, IEEE Transactions on Knowledge and Data Engineering. IEEE Computer Society, 2007, 19(3): 412-426. |
|
Yiu M.L., Dai X., Mamoulis N. and Vaitis M., Top-k Spatial Preference Queries, IEEE 23nd International Conference on Data Engineering. 2007. |
|
Researcher
: Yiu ML |
|
List of Research Outputs |
|
Mouratidis K., Yiu M.L., Papadias D. and Mamoulis N., Continuous Nearest Neighbor Monitoring in Road Networks, Proceedings of the 32nd Very Large Data Bases Conference (VLDB), Seoul, Korea, September 2006.. 2006. |
|
Tao Y., Yiu M.L. and Mamoulis N., Reverse Nearest Neighbor Search in Metric Spaces, IEEE Transactions on Knowledge and Data Engineering (TKDE). 2006, 18(9): 1239-1252. |
|
Yiu M.L. and Mamoulis N., Reverse Nearest Neighbors Search in Ad Hoc Subspaces, IEEE Transactions on Knowledge and Data Engineering. IEEE Computer Society, 2007, 19(3): 412-426. |
|
Yiu M.L., Dai X., Mamoulis N. and Vaitis M., Top-k Spatial Preference Queries, IEEE 23nd International Conference on Data Engineering. 2007. |
|
Researcher
: Yiu SM |
|
Project Title: |
RNA Secondary Structure Prediction with Pseudoknots in Unaligned Sequences |
|
Investigator(s): |
Yiu SM, Chin FYL |
|
Department: |
Computer Science |
|
Source(s) of Funding: |
Seed Funding Programme for Basic Research |
|
Start Date: |
09/2006 |
|
Abstract: |
|
Ribonucleic acids (RNAs) are molecules that are responsible for regulating many genetic and metabolic activities in cells. RNA is single-stranded and can be considered as a sequence of nucleotides (also known as bases). There are four basic nucleotides, namely, Adenine (A), Cytosine (C), Guanine (G), and Uracil (U). An RNA folds into a 3-dimensional structure by forming pairs of bases using hydrogen bonds and the set of base pairs formed is referred as the secondary structure of the RNA. Each base can at most form a pair with another base. In particular, A-U and C-G form stable pairs and are known as the Watson-Crick base pairs. Other pairings (e.g. A-C) are less stable and seldom exist in RNA molecules, so are usually ignored. The 3-dimensional structure is related to the function of the RNA. Thus, knowing the pairing of the bases can help to predict the 3-dimensional structure as well as the function of the RNA. In this project, we focus on the problem of predicting RNA secondary structure. Given an RNA sequence, there are many different possible secondary structures. To compute the most probable structure, a commonly used measurement is based on the concept of minimzing the total free energy of the substructures (e.g. loops, stacking pairs) formed by the pairings. From a computatioal point of view, the challenge of the RNA secondary structure prediction problem arises from some special structures called "pseudoknots" (see more details in Section VII). Many existing prediction algorithms do not consider pseudoknots, however, pseudoknots are already known to exist in some RNAs. The dynamic programming algorithm [LZP99, ZS84] for computing the optimal secondary structure without pseudoknots based on the free energy minimization model runs in O(n^3) time where n is the length of the RNA sequence. On the other hand, based on some special energy functions, Lyngso and Pederson [LP00] have proven that determining the optimal secondary structure possibly with pseudoknots is NP-hard. When restricting the problem to some special types of pseudoknots, there exist polynomial time algorithms (e.g. [A00, RE99, UHK+99]. However, the time complexity is still high and thus may not be very practical. On the other hand, from some recent studies [e.g. MT02], it was found that to predict the secondary structure of a given RNA sequence, it is more accurate if we also make use of some other RNA sequences which are known to have similar functions as the given RNA sequecne. Roughly speaking, we are given a set of unaligned RNA sequences, the problem is to predict the common secondary structure of these sequences while aligning them at the same time. The intuition behind is that functionally similar RNA sequences usually have similar secondary structures. The alignment of the sequences can guide to locate the important substructures of the secondary structure. Thus, there is a higher chance to get a correct structure. Mathews and Turner [MT02] provided an O(n^6) time algorithm for two sequences without considering pseudoknots and it was shown to be NP-hard for multiple sequences [DB04]. Other works along this direction include [S85, AKS+06, BTZ06, GHS97]. Most of these works do not consider pseudoknots or are heuristics-based.The objective of the project is to study of the problem of predicting the common secondary structure with pseudoknots of a given set of unaligned RNA sequences from both the theoertical and the practical aspects. In particular, we aim at deriving efficient solutions (exact algorithms, approximation algorithms, and/or heuristics-based algorithms) for the following problems. P1) Given two unaligned RNA sequences, the problem is to predict their common secondary structure with "simple pseudoknots (see Section VII for definitions)" based on different optimization criteria (e.g. minimizing the total free energy of the structure, maximizing the number of base pairs).P2) Extend the problem in 1) to other common types of pseudoknots.P3) Extend the problem in 1) and 2) to consider more than two sequences. |
|
List of Research Outputs |
|
Chan H.L., Jannson J., Lam T.W. and Yiu S.M., Reconstructing An Ultrametric Galled Phylogenetic Network From A Distance Matrix , Journal of Bioinformatics and Computational Biology. World Scientific, 2006, 4: 4: 807-832. |
|
Dong
Y., Sui A., Yiu S.M., Li V.O.K. and Hui C.K., An efficient cluster-based
proactive secret share update scheme for mobile ad hoc networks, Proc.
IEEE ICC. |
|
Dong
Y., Li V.O.K., Hui C.K. and Yiu S.M., Dynamic distributed
certificate authority services for mobile ad hoc networks, Proc. IEEE
Wireless Communications and Networking Conference. |
|
Hon W.K., Lam T.W., Sadakane K., Sung W.K. and Yiu S.M., A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays , Algorithmica. 2007, 48:1: 23-36. |
|
Hui C.K., Yiu S.M. and Lui W.C., Accountability in organizations, Int. J. Information and Computer Security. UK, Inderscience Enterprises Ltd, 2007, Vol. 1, No. 3: 237-255. |
|
Hui
C.K., Chow K.P. and Yiu S.M., Tools and Technology for
Computer Forensics: Research and Development in |
|
Leung W.S., Shen Z., Yiu S.M., Kung H.F. and Lin M.C., The Anti-Angiogenic Signaling Network of rAAV-HGFK1, The Fifth Asia-Pacific Bioinformatics Conference, APBC2007; 14-17 Jan, 2007; Hong Kong.. 2007, apbc104. |
|
Li
H.Y., Lum C.T., Sun R.W.Y., Ng S.M., Smith D.K., Yiu S.M., Che C.M. and Lin M.C., Genome-Wide Study Reveals the
Signaling Pathways Modulated by Gold |
|
Wang L., Cheung D.W.L. and Yiu S.M., Maintenance of Maximal Frequent Itemsets in Large Databases, ACM Symposium on Applied Computing . 2007. |
|
Wang M., Li L., Yiu S.M., Hui C.K., Chong C.F., Chow K.P., Tsang W.W., Chan H.W. and Pun K.H., A Hybrid Approach for
Authenticating MPEG-2 Streaming Data, Proceedings of Multimedia Content
Analysis and Mining International Workshop (MCAM 2007). |
|
Wong K.F., Lam T.W., Yang W. and Yiu S.M., Finding Alternative Splicing Patterns with Strong Support from Expressed Sequences , The 2007 International Conference on Bioinformatics and Computational Biology (BIOCOMP). 2007. |
|
Yiu S.M., Wong P., Lam T.W., Mui Y.C., Kung H.F., Lin M.C. and Cheung Y.T., Research Output Prize, Faculty of Engineering, The University of Hong Kong. 2006. |
|
Researcher
: Yu CH |
|
List of Research Outputs |
|
Yu C.H., Memory Management Strategies to Improve the Space-Time Performance of Java Programs, 2006. |
|
Researcher
: Yuk SC |
|
List of Research Outputs |
|
Chung H.Y., Wong K.K.Y., Chin F.Y.L., Chow K.P. and Yuk S.C., Generalized Motion and Edge Adaptive Interpolation De-interlacing Algorithm, WSEAS Transactions on Computers. 2006, 5(11): 2544-2551. |
|
Wong
K.K.Y., Chin F.Y.L., Chung H.Y., Chow K.P. and Yuk S.C., Motion and Edge
Adaptive Interpolation De-interlacing Algorithm, 10th WSEAS International
Conference on Computers. |
|
Yuk S.C., Wong K.K.Y., Chung H.Y., Chin F.Y.L. and Chow K.P., Real-time Multiple Head Shape
Detection and Tracking System with Decentralized Trackers, 6th IEEE
International Conference on Intelligent System Design and Applications. |
|
Researcher
: Zhang G |
|
List of Research Outputs |
|
Zhang G., Zhang H. and Wong K.K.Y., 1D Camera Geometry and Its
Application to Circular Motion Estimation, British Machine Vision
Conference. |
|
Zhang G., Camera Network Calibration, 2006. |
|
Zhang H., Wong K.K.Y. and Zhang G., Camera Calibration From Images of Spheres, IEEE Transactions on Pattern Analysis and Machine Intelligence . IEEE Computer Society, 2007, 29(3): 499-503. |
|
Researcher
: Zhang H |
|
List of Research Outputs |
|
Zhang
G., Zhang H. and Wong K.K.Y., 1D Camera Geometry and Its
Application to Circular Motion Estimation, British Machine Vision
Conference. |
|
Zhang H., Wong K.K.Y. and Zhang G., Camera Calibration From Images of Spheres, IEEE Transactions on Pattern Analysis and Machine Intelligence . IEEE Computer Society, 2007, 29(3): 499-503. |
|
Zhang H., Camera Calibration from Silhouttes, 2006. |
|
Zhang H. and Wong K.K.Y., Camera
Calibration from a Translation + Planar Motion, 8th IASTED International
Conference on Signal and Image Processing. |
|
Researcher
: Zhang Y |
|
List of Research Outputs |
|
Chan J.W.T., Chin F.Y.L., Ye D., Zhang Y. and Zhu H., Greedy Online Frequency Allocation in Cellular Networks, Information Processing Letters. Elsevier B.V., 2007, 102(2-3): 55-61. |
|
Chan J.W.T., Chin F.Y.L., Ye D. and Zhang Y., Online Frequency
Allocation in Cellular Networks, The 19th ACM Symposium on Parallelism in
Algorithms and Architectures (SPAA 2007). |
|
Chan W.T., Chin F.Y.L., Ye D., Zhang Y. and Zhu H., Frequency
Allocation Problem for Linear Cellular Networks, The 17th International
Symposium on Algorithms and Computation (ISAAC 2006). |
|
Chin
F.Y.L., Zhang Y. and Zhu
H., Online OVSF Code Assignment with Resource Augmentation, The 3rd
International Conference on Algorithmic Aspects in Information and Management
(AAIM'07). |
|
Researcher
: Zhang Z |
|
List of Research Outputs |
|
Chan
W.K., Chen T.Y., Cheung S.C., Tse T.H. and Zhang Z., Towards the testing of
power-aware software applications for wireless sensor networks, Reliable
Software Technologies: Ada-Europe 2007, N. Abdennadher and F. Kordon (eds.),
Lecture Notes in Computer Science, vol. 4498, Springer, |
|
Chen T.Y., Huang D.H., Tse T.H. and Zhang Z., An innovative approach to tackling the boundary effect in adaptive random testing, Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS-40), IEEE Computer Society Press, Los Alamitos, California. 2007. |
|
Hu P., Zhang Z., Chan W.K. and Tse T.H., An empirical comparison between direct and indirect test result checking approaches , Proceedings of the 3rd International Workshop on Software Quality Assurance (SOQUA 2006) (in conjunction with the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering (SIGSOFT 2006/FSE-14)), ACM Press, New York. 2006, 6−13. |
|
Researcher
: Zhu D |
|
List of Research Outputs |
|
Huo
Q. and Zhu D., A Maximum
Likelihood Training Approach to Irrelevant Variability Compensation Based on
Piecewise Linear Transformations, Interspeech 2006 - ICSLP. |
|
Zhu D. and Huo Q., A Maximum Likelihood Approach to Unsupervised Online Adaptation of Stochastic Vector Mapping Function For Robust Speech Recognition, IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-2007). IEEE, 2007, IV: 773-776. |
-- End of Listing --