Wilfred W. K. Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Wilfred W. K. Lin has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Allan K. Y. Wong
Hong Kong Polytechnic University
3 shared publications - Tharam S. Dillon
University of Technology
2 shared publications Allan K. Y. Wong
Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR
1 shared publication- Jackei H. K. Wong
Hong Kong Polytechnic University
1 shared publication Richard S. L. Wu
Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR
1 shared publication- Richard S. L. Wu
Hong Kong Polytechnic University
1 shared publication
Latest Publications
- 2 October 2008
- Published by Springer Nature
- p. 143-157
Text Mining for Real-time Ontology Evolution
- 22 November 2006
- Published by Springer Nature in Personal and Ubiquitous Computing
- Vol. 12 (1) , 45-55
Applying FLC-based dynamic buffer size tuning to shorten the information retrieval round trip time in mobile location-aware environments
- 22 November 2006
- Published by Springer Nature in Personal and Ubiquitous Computing
- Vol. 12 (1) , 45-55
Applying FLC-based dynamic buffer size tuning to shorten the information retrieval round trip time in mobile location-aware environments
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 719-724
A Novel Internet Real-Time Traffic Pattern Detection Technique for Better Pervasive Computing
The Internet follows the power law. For this reason its traffic pattern takes many forms, which change without warning. For example it may change suddenly from LRD (long-range dependence) such as heavy-tailed or self-similar to SRD (short-range dependence) such as Poisson or multifractal. This makes it difficult to run time-critical pervasive applications over the Internet successfully because it is hard to control the response timeliness of the logical TCP (transmission control protocol) channels. The proposed real-time traffic pattern detector (RTPD) technique is generic and detects and identifies LRD and SRD traffic pattern online. If it is implemented as a logical object, then realtime and pervasive applications can use its detected results to self-reconfigure at runtime for better performance that includes shorter service roundtrip time (RTT) and fault tolerance. The RTPD is conceptually the "M3RT + R/S + filtration" combination. The M 3RT (micro mean message response time) tool is the micro implementation of the convergence algorithm (CA), which is an IEPM (Internet end-to-end performance measurement) model with feedback. Alternatively known as the micro CA (MCA), this tool predicts the mean of any waveform quickly and accurately, either on-line or in a postmortem manner with pre-collected traces. A micro IEPM tool operates as an independent object, to be invoked for service anytime and anywhere by message passing. If M3RT is inhibited, then RTPD works with the traditional R/S (rescaled adjusted statistics) estimator, but still detects the LRD and SRD patterns on-line. If M3RT support is activated, then RTPD works with the enhanced R/S or E-R/S. The proposed RTPD technique differs from other post-mortem approaches (e.g. Hill estimator) because it detects and identifies traffic patterns on the fly. Its contribution to Internet-based pervasive applications is significant because its output enables these applications to reconfigure on the fly and adapt quickly to new operational criteria. The result is better system performance in light of a shorter service roundtrip time (RTT) that makes the client happy
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 719-724
A Novel Internet Real-Time Traffic Pattern Detection Technique for Better Pervasive Computing
The Internet follows the power law. For this reason its traffic pattern takes many forms, which change without warning. For example it may change suddenly from LRD (long-range dependence) such as heavy-tailed or self-similar to SRD (short-range dependence) such as Poisson or multifractal. This makes it difficult to run time-critical pervasive applications over the Internet successfully because it is hard to control the response timeliness of the logical TCP (transmission control protocol) channels. The proposed real-time traffic pattern detector (RTPD) technique is generic and detects and identifies LRD and SRD traffic pattern online. If it is implemented as a logical object, then realtime and pervasive applications can use its detected results to self-reconfigure at runtime for better performance that includes shorter service roundtrip time (RTT) and fault tolerance. The RTPD is conceptually the "M3RT + R/S + filtration" combination. The M 3RT (micro mean message response time) tool is the micro implementation of the convergence algorithm (CA), which is an IEPM (Internet end-to-end performance measurement) model with feedback. Alternatively known as the micro CA (MCA), this tool predicts the mean of any waveform quickly and accurately, either on-line or in a postmortem manner with pre-collected traces. A micro IEPM tool operates as an independent object, to be invoked for service anytime and anywhere by message passing. If M3RT is inhibited, then RTPD works with the traditional R/S (rescaled adjusted statistics) estimator, but still detects the LRD and SRD patterns on-line. If M3RT support is activated, then RTPD works with the enhanced R/S or E-R/S. The proposed RTPD technique differs from other post-mortem approaches (e.g. Hill estimator) because it detects and identifies traffic patterns on the fly. Its contribution to Internet-based pervasive applications is significant because its output enables these applications to reconfigure on the fly and adapt quickly to new operational criteria. The result is better system performance in light of a shorter service roundtrip time (RTT) that makes the client happy
- 20 October 2005
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 18 (7) , 725-747
Applying fuzzy logic and genetic algorithms to enhance the efficacy of the PID controller in buffer overflow elimination for better channel response timeliness over the Internet
In this paper two novel intelligent buffer overflow controllers: thefuzzy logic controller(FLC) and thegenetic algorithm controller(GAC) are proposed. In the FLC the extant algorithmic PID controller (PIDC) model, which combines theproportional(P),derivative(D) andintegral(I) control elements, is augmented with fuzzy logic for higher control precision. The fuzzy logic divides the PIDC control domain into finer control regions. Every region is then defined either by a fuzzy rule or a ‘don't care’ state. The GAC combines the PIDC model with the genetic algorithm, which manipulates the parametric values of the PIDC as genes in a chromosome. The FLC and GAC operations are based on the objective function$\{0,\Delta\}^2$ . The principle is that the controller should adaptively maintain the safety margin$\Delta$ around the chosen reference point (represent by the ‘0’ of$\{0,\Delta\}^2$ ) at runtime. The preliminary experimental results for the FLC and GAC prototypes indicate that they are both more effective and precise than the PIDC. After repeated timing analyses with theIntel's VTune Performer Analyzer, it was confirmed that the FLC can better support real‐time computing than the GAC because of its shorter execution time and faster convergence without any buffer overflow. Copyright © 2005 John Wiley & Sons, Ltd.
- 20 October 2005
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 18 (7) , 725-747
Applying fuzzy logic and genetic algorithms to enhance the efficacy of the PID controller in buffer overflow elimination for better channel response timeliness over the Internet
In this paper two novel intelligent buffer overflow controllers: thefuzzy logic controller(FLC) and thegenetic algorithm controller(GAC) are proposed. In the FLC the extant algorithmic PID controller (PIDC) model, which combines theproportional(P),derivative(D) andintegral(I) control elements, is augmented with fuzzy logic for higher control precision. The fuzzy logic divides the PIDC control domain into finer control regions. Every region is then defined either by a fuzzy rule or a ‘don't care’ state. The GAC combines the PIDC model with the genetic algorithm, which manipulates the parametric values of the PIDC as genes in a chromosome. The FLC and GAC operations are based on the objective function$\{0,\Delta\}^2$ . The principle is that the controller should adaptively maintain the safety margin$\Delta$ around the chosen reference point (represent by the ‘0’ of$\{0,\Delta\}^2$ ) at runtime. The preliminary experimental results for the FLC and GAC prototypes indicate that they are both more effective and precise than the PIDC. After repeated timing analyses with theIntel's VTune Performer Analyzer, it was confirmed that the FLC can better support real‐time computing than the GAC because of its shorter execution time and faster convergence without any buffer overflow. Copyright © 2005 John Wiley & Sons, Ltd.