Page 47 - profile2014.indd

problems and provide a platform for benchmarking algorithm agement environment. We plan to extend the algorithm bench-
performance. GeoADE is based on an open-source application marking service to other domains, and also investigate issues as
development environment, Eclipse/CDT, which supports C/C++ to how to ensure this service’s scalability and reliability when it
programming and is integrated with GeoLEDA, a geometric ob- experiences a spike of user and/or service requests. We hope to
ject library for visualization, and Geometry Viewer, an interactive make GeoADE, along with OpenCPS, a useful aid for interactive
component for algorithm visualization at run time. GeoADE also algorithm teaching, and an integrated environment for knowl-
provides plug-ins for the on-line algorithm benchmarking ser- edge management of algorithms.
vice, an extension of the OpenCPS algorithmic knowledge man-

Publications

1. Y.W. Huang, C.H. Tsai, T.P. Lin, S.K. Huang, D.T. Lee and 9. C. Wulff-Nilsen, A. Grüne, R. Klein, E. Langetepe, D.T. Lee,
S.Y. Kuo, “A Testing Framework for Web Application Secu- T.C. Lin, S.H. Poon, and T.K. Yu, “Computing the Stretch Fac-
rity Assessment,” Computer Networks, Vol.48, No.5, pp. 739- tor and Maximum Detour of Paths, Trees, and Cycles in the
761, June 2005. Normed Space,” Int’l J. Computational Geometry & Applica-
tions, pp. 45-60, Feb. 2012.
2. A.C.C. Shih, D.T. Lee, C.L. Peng and Y.W. Wu, “Phylo-mL-
ogo: An Interactive and Hierarchical Multiple-logo Visualiza- 10. C.H. Liu, S.Y. Kuo, D.T. Lee, C.S. Lin, J.H. Weng, and S.Y.
tion Tool for Alignment of Numerous Sequences,” BMC Bio- Yuan, “Obstacle-Avoiding Rectilinear Steiner Tree Construc-
informatics, Vol.8, No.63, Feb. 2007. tion: A Steiner-Point Based Algorithm,” IEEE Trans. Comput-
er-Aided Design, pp.1050-1060, July 2012.
3. D.T. Lee, S.J. Shiah, C.M. Lee and Y.C. Wang, “State of
Charge Estimation for Electric Scooters by Using Learning 11. M.J. Kao, H.L. Chen and D.T. Lee, “Capacitated Domination
Mechanisms,” IEEE Trans. Vehichlar Technology, Vol.56, Problem: Complexity and Approximation Algorithms,” Algo-
No.2, pp. 544-556, March 2007. rithmica, Vol.67, pp. 1-43, 2013.
4. T.C. Lin and D.T. Lee, “Randomized Algorithm for the Sum 12. M.J. Kao, B. Katz, M. Krug, D.T. Lee, I. Rutter, D. Wagner,
Selection Problem,” Theoretical Comput. Sci., Vol.377, No.1- “The Density Maximization Problem in Graphs,” J. Combina-
3, pp. 151-156, May 2007. torial Optimization, pp. 723-754, Nov. 2013.
5. D.T. Lee, T.C. Lin and H.I. Lu, “Fast Algorithms for the Den- 13. C.H. Liu, E. Papadopoulou and D.T. Lee, “The k-Nearest-
sity Finding Problem,” Algorithmica, Vol.53, No.3, pp. 298- Neighbor Voronoi Diagram Revisited,” Algorithmica, to ap-
313, Feb., 2009. pear.
6. J.D. Wei, M.H. Tsai, G.C. Lee, J.H. Huang and D.T. Lee, 14. Chun-Xun Lin, C. H. Liu, I-C. Chen, D.T. Lee, and T.-Y. Ho,

“GeoBuilder: A Geometric Algorithm Visualization and De- “An Efficient Bi-criteria Flow Channel Routing Algorithm for

bugging System for 2D and 3D Geometric Computing,” Flow-based Microfluidic Biochips,” Proc. IEEE/ACM DAC,
IEEE Transactions on Visualization and Computer Graphics, San Francisco, June 2014.
Vol.15, No.2, pp. 234-248, March 2009.
15. F. Aurenhammer, R. Klein and D.T. Lee, Voronoi Diagrams
7. T.C. Lin and D.T. Lee, “Efficient Algorithms for the Sum Se- and Delaunay Triangulations, World Scientifi c Publishing,
lection Problem and k Maximum Sums Problem,” Theoretical 2013.
Comput. Sci., Vol.411, No.7-9 pp. 986-994, Feb. 2010.
8. M.J. Kao, C.S. Liao and D.T. Lee, “Capacitated Domination
Problem,” Algorithmica, Vol.60, No.2, pp. 274-300, July 2011.

47