Welcome to Hai Trong Vu's homepage

STUDY, THE GOOD THINGS TO DO IN LIFE...

"We know how to find things. And we are good learners. That's all we need to be successful." - Hai Trong Vu, 2005.

Here are some courses that I have taken (or taking) at the University of Texas at Dallas (UTD). You are very welcome to discuss with me about topics of any, but not restricted to, of these courses.

1) SCIENTIFIC WRITING: (spring 2005) this course provides you the skills to write a scientific paper, thesis, dissertation of technical report.

2) DISCRETE STRUCTURE: (spring 2005) this courses provides you the basic knowledge about discrete math, especially the important set theory, number theory, graph theory, etc.

3) ADVANCE COMPUTER NETWORK: (spring 2005) this is one of my favorite courses, it gives you a broad overview about advanced network technologies such as routing, switching, VoIP, IPv6, applications and security issues in networks. In this course I have done a very interesting academic project, in which I and my friends in the group developed an adaptive, energy constraint for sensor networks.

4) SECURITY FOR SENSOR NETWORKS: (summer 2005) this is a research course I have done with Dr. Youtao Zhang in his Compiler and Computer Architecture lab.

5) AUTOMATA THEORY: (summer 2005) basic knowledge, very important for theory of computation, compiler, system design, software engineer...

6) COMPILER CONSTRUCTION: (fall 2005) you might think that the compiler is not your job. You should think about it again. This is a very useful course and it help you not only how a compiler works but also other issues about computer architecture.

7) ADVANCED OPERATING SYSTEMS: (spring 2006) the course provides you the knowledge about problems and algorithms in distributed systems which consist of many sites located far away from each other communicating through messages.

8) DATABASE STRUCTURE: (spring 2006) an interesting and useful course.

9) SYNTHESIS AND OPTIMIZATION OF HIGH-PERFORMANCE SYSTEMS: (spring 2006) a very practical course which provides you techniques of how to speed up your system by synthesizing and optimizing it.

10) DISTRIBUTED COMPUTING: (summer 2006) a very good course focuses on designing provably correct algorithms for solving problems that arise while building distributed systems.

11) ADVANCE ALGORITHM DESIGN AND ANALYSIS: (fall 2006) this course is really really tough, but it is extremely interesting and useful. Having knowledge of algorithm, you can solve not only problems in computer science but also many more practical issues. If you can study well in this course and master the material, I am sure you can get a job easily !!

12) INFORMATION SECURITY: (fall 2006) this is the fun part. I came to UTD because I love security and this school offers me a good chance to do research as well as taking courses in this area. Having studied a number of cryptography systems, I also worked on many interesting projects such as cracking a security system, breaking secret keys and cipher texts, designing a secure Unix-like file system, preventing buffer overflow and denial of service... I really enjoy studying this class.

13) APPROXIMATION ALGORITHMS: (spring 2007) we have seen many problems in which we can solve using algorithms that run in polynomial time. However, there are many other problems could not be solve in polynomial time, such problems are usually be solved using approximation algorithms, in which we do not archive optimal solution but some solutions that give 'good' performance result compared to the optimum ones.

14) NETWORK SECURITY: (fall 2007) anything related to network security, such as cryptography systems, standards, network attacks and defenses, viruses, worms, Trojan... Very fun course largely focuses on recent research topics.

15) MOBILE COMPUTING: (fall 2007) in the world in which most of people are using some sort of mobile devices, such as laptop, cell phone, PDA... How do we ensure the availability, connectivity and acceptable performance for these mobile services? That's the question we are trying to solve in this course.

16) THEORY OF COMPUTATION: (spring 2008) everything about automata theory, computability and complexity. This is a must course for every computer science student, especially for a PhD student.