The Experts below are selected from a list of 297 Experts worldwide ranked by ideXlab platform
Prudence W. H. Wong - One of the best experts on this subject based on the ideXlab platform.
-
MFCS - Competitive Analysis of On-line Stream Merging Algorithms
Lecture Notes in Computer Science, 2002Co-Authors: Wun-tat Chan, Hing-fung Ting, Prudence W. H. WongAbstract:A popular approach to reduce the server Bandwidth in a video-on-demand system is to merge the streams initiated at different times. In recent years, a number of on-line algorithms for stream merging have been proposed; the objective is to minimize either the total Bandwidth or the Maximum Bandwidth over all time. The performance of these algorithms was better understood with respect to the first objective. In particular, the connector algorithm [9] is known to be O(1)- competitive, and the dyadic algorithm [12] is known to have an almost tight bounds on its average total Bandwidth requirement. For minimizing Maximum Bandwidth, existing results are limited to empirical studies only and no algorithm has been known to be competitive. The main contribution of this paper is the first competitive analysis of the connector and the dyadic algorithms with respect to the Maximum Bandwidth, showing that both algorithms are 4-competitive. We also give a worstcase analysis of the dyadic algorithm with respect to the total Bandwidth, revealing that the dyadic algorithm can be tuned to be 3-competitive.
-
Competitive analysis of on-line stream merging algorithms
Lecture Notes in Computer Science, 2002Co-Authors: Wun-tat Chan, Hing-fung Ting, Tak-wah Lam, Prudence W. H. WongAbstract:A popular approach to reduce the server Bandwidth in a video-on-demand system is to merge the streams initiated at different times. In recent years, a number of on-line algorithms for stream merging have been proposed; the objective is to minimize either the total Bandwidth or the Maximum Bandwidth over all time. The performance of these algorithms was better understood with respect to the first objective. In particular, the connector algorithm [9] is known to be O(1)-competitive, and the dyadic algorithm [12] is known to have an almost tight bounds on its average total Bandwidth requirement. For minimizing Maximum Bandwidth, existing results are limited to empirical studies only and no algorithm has been known to be competitive. The main contribution of this paper is the first competitive analysis of the connector and the dyadic algorithms with respect to the Maximum Bandwidth, showing that both algorithms are 4-competitive. We also give a worst-case analysis of the dyadic algorithm with respect to the total Bandwidth, revealing that the dyadic algorithm can be tuned to be 3-competitive.
Y. Arakawa - One of the best experts on this subject based on the ideXlab platform.
-
high speed modulation characteristics of 1 3 spl mu m quantum dot lasers influence of effective capture time on the Maximum Bandwidth
International Conference on Indium Phosphide and Related Materials, 2004Co-Authors: M. Ishida, N. Hatori, Tomoyuki Akiyama, Koji Otsubo, Y. Nakata, Hiroji Ebe, M. Sugarawa, Y. ArakawaAbstract:Requirements on quantum-dot crystals for 10-40 GHz-modulation Bandwidth are clarified based on the understanding obtained by small-signal experiments and rate-equation analyses of 1.3-micron quantum-dot lasers, where carrier-capture process plays a significant role via K-factor-limited Maximum Bandwidth.
-
High-speed modulation characteristics of 1.3 /spl mu/m quantum-dot lasers: influence of effective capture time on the Maximum Bandwidth
16th IPRM. 2004 International Conference on Indium Phosphide and Related Materials 2004., 1Co-Authors: M. Ishida, N. Hatori, Tomoyuki Akiyama, Koji Otsubo, Y. Nakata, Hiroji Ebe, M. Sugarawa, Y. ArakawaAbstract:Requirements on quantum-dot crystals for 10-40 GHz-modulation Bandwidth are clarified based on the understanding obtained by small-signal experiments and rate-equation analyses of 1.3-micron quantum-dot lasers, where carrier-capture process plays a significant role via K-factor-limited Maximum Bandwidth.
-
Temperature-Insensitive 10 Gb/s Direct Modulation Lasers with InAs Self-Assembled Quantum Dots at 1.3 μm
2005 Pacific Rim Conference on Lasers & Electro-Optics, 1Co-Authors: Mariko Sugawara, M. Ishida, N. Hatori, Koji Otsubo, Y. Nakata, Hiroji Ebe, Takuji Yamamoto, Y. ArakawaAbstract:Based on our design on the Maximum Bandwidth for high-speed modulation and p-type doping into quantum dots for high temperature stability, we realized temperature-insensitive 10 Gb/s laser diodes at 1.3 μm.
Wun-tat Chan - One of the best experts on this subject based on the ideXlab platform.
-
MFCS - Competitive Analysis of On-line Stream Merging Algorithms
Lecture Notes in Computer Science, 2002Co-Authors: Wun-tat Chan, Hing-fung Ting, Prudence W. H. WongAbstract:A popular approach to reduce the server Bandwidth in a video-on-demand system is to merge the streams initiated at different times. In recent years, a number of on-line algorithms for stream merging have been proposed; the objective is to minimize either the total Bandwidth or the Maximum Bandwidth over all time. The performance of these algorithms was better understood with respect to the first objective. In particular, the connector algorithm [9] is known to be O(1)- competitive, and the dyadic algorithm [12] is known to have an almost tight bounds on its average total Bandwidth requirement. For minimizing Maximum Bandwidth, existing results are limited to empirical studies only and no algorithm has been known to be competitive. The main contribution of this paper is the first competitive analysis of the connector and the dyadic algorithms with respect to the Maximum Bandwidth, showing that both algorithms are 4-competitive. We also give a worstcase analysis of the dyadic algorithm with respect to the total Bandwidth, revealing that the dyadic algorithm can be tuned to be 3-competitive.
-
Competitive analysis of on-line stream merging algorithms
Lecture Notes in Computer Science, 2002Co-Authors: Wun-tat Chan, Hing-fung Ting, Tak-wah Lam, Prudence W. H. WongAbstract:A popular approach to reduce the server Bandwidth in a video-on-demand system is to merge the streams initiated at different times. In recent years, a number of on-line algorithms for stream merging have been proposed; the objective is to minimize either the total Bandwidth or the Maximum Bandwidth over all time. The performance of these algorithms was better understood with respect to the first objective. In particular, the connector algorithm [9] is known to be O(1)-competitive, and the dyadic algorithm [12] is known to have an almost tight bounds on its average total Bandwidth requirement. For minimizing Maximum Bandwidth, existing results are limited to empirical studies only and no algorithm has been known to be competitive. The main contribution of this paper is the first competitive analysis of the connector and the dyadic algorithms with respect to the Maximum Bandwidth, showing that both algorithms are 4-competitive. We also give a worst-case analysis of the dyadic algorithm with respect to the total Bandwidth, revealing that the dyadic algorithm can be tuned to be 3-competitive.
Kam Y. Lau - One of the best experts on this subject based on the ideXlab platform.
-
Quantum capture limited modulation Bandwidth of quantum well, wire, and dot lasers
Applied Physics Letters, 1993Co-Authors: Sidney C. Kan, Dan Vassilovski, Kam Y. LauAbstract:We investigate the quantum capture limited modulation Bandwidths of various lower‐dimensional semiconductor lasers. It is shown that, for buried quantum well, wire, and dot lasers, the Maximum Bandwidth is proportional to the packing density of the active region. For the quantum wire lasers grown on V‐grooved substrates, the Maximum Bandwidth is enhanced by the precapture of carriers from three‐dimensional states to two‐dimensional states before the capture into the one‐dimensional states.
Hing-fung Ting - One of the best experts on this subject based on the ideXlab platform.
-
MFCS - Competitive Analysis of On-line Stream Merging Algorithms
Lecture Notes in Computer Science, 2002Co-Authors: Wun-tat Chan, Hing-fung Ting, Prudence W. H. WongAbstract:A popular approach to reduce the server Bandwidth in a video-on-demand system is to merge the streams initiated at different times. In recent years, a number of on-line algorithms for stream merging have been proposed; the objective is to minimize either the total Bandwidth or the Maximum Bandwidth over all time. The performance of these algorithms was better understood with respect to the first objective. In particular, the connector algorithm [9] is known to be O(1)- competitive, and the dyadic algorithm [12] is known to have an almost tight bounds on its average total Bandwidth requirement. For minimizing Maximum Bandwidth, existing results are limited to empirical studies only and no algorithm has been known to be competitive. The main contribution of this paper is the first competitive analysis of the connector and the dyadic algorithms with respect to the Maximum Bandwidth, showing that both algorithms are 4-competitive. We also give a worstcase analysis of the dyadic algorithm with respect to the total Bandwidth, revealing that the dyadic algorithm can be tuned to be 3-competitive.
-
Competitive analysis of on-line stream merging algorithms
Lecture Notes in Computer Science, 2002Co-Authors: Wun-tat Chan, Hing-fung Ting, Tak-wah Lam, Prudence W. H. WongAbstract:A popular approach to reduce the server Bandwidth in a video-on-demand system is to merge the streams initiated at different times. In recent years, a number of on-line algorithms for stream merging have been proposed; the objective is to minimize either the total Bandwidth or the Maximum Bandwidth over all time. The performance of these algorithms was better understood with respect to the first objective. In particular, the connector algorithm [9] is known to be O(1)-competitive, and the dyadic algorithm [12] is known to have an almost tight bounds on its average total Bandwidth requirement. For minimizing Maximum Bandwidth, existing results are limited to empirical studies only and no algorithm has been known to be competitive. The main contribution of this paper is the first competitive analysis of the connector and the dyadic algorithms with respect to the Maximum Bandwidth, showing that both algorithms are 4-competitive. We also give a worst-case analysis of the dyadic algorithm with respect to the total Bandwidth, revealing that the dyadic algorithm can be tuned to be 3-competitive.