PhD Comprehensive I. Breadth Document. Hamid Zarrabi-Zadeh. Supervisor. Prof. Timothy Chan

Transcription

1 PhD Comprehensive I Breadth Document Hamid Zarrabi-Zadeh hzarrabi@cs.uwaterloo.ca Supervisor Prof. Timothy Chan School of Computer Science University of Waterloo October 2003

2 Area Course Number Mathematics of Computation Algorithms and Complexity Scientific and Symbolic Computation Courses Taken * Course Title Grade Text Book(s) Computational Geometry 92 A Advanced Algorithms 85 A Computing Technology Hardware and Software Systems Programming Languages Applications Artificial Intelligence Database Systems Graphics and User Interfaces Theory of Machines and Languages Parallel Algorithms and Architectures Numerical Computation Methods Computer Systems Performance Evaluation 86 A 90 A+ 100 A+ 92 A Compiler Design 90 A Design of Programming Languages 85 A Speech Processing 87 A Distributed Database Systems 90 A Database Systems 88 A Computer Graphics 90 A+ M. de Berg, M. van Kreveld, M. Overmars, O. Schwazkopf, Computational Geometry: Algorithms and Application, Springer, F. P. Preparate, M. I. Shamos, Computational Geometry, An Introduction, Springer-Verlag, T. Cormen, C. Leiserson and R. Riverst, Introduction to Algorithms, MIT Press, M. R. Garey, D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP- Completeness, W. H. Freeman and Company, P. J. Denning, J. B. Dennis, J. E. Qualitz, Machines, Languages, and Computation, Prentice-Hall, F. T. Leighton, Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann Publishers, J. Quinn, Parallel Computing: Theory and Practice, McGraw Hill, B. Gholizade, Numerical Computation, Sharif University Press, K. Kant, Introduction to Computer Systems Performance Evaluation, McGraw Hill, J. P. Tremblay, P. G. Sorenson, The Theory & Practice of Compiler Writing, McGraw-Hill, J. Maclenman, Principles of Programming Languages, CBS College Publishing, J. L. Flanagan, Speech Analysis, Synthesis and Perception, Springer-Verlag, J.R. Deller, J. G. Proakis, J. H. L. Hansen, Discrete- Time Processing of Speech Signals, Macmillan Pub. Co., R. Jalili, Concurrency Control and Recovery in Database Systems, Sharif University Press, C.J. Date, An Introduction to Database Systems, Addison Wesley, R. Elmasri and B. Navathe, Fundamental of Data Base System, Addison Wesley, D. Hearn and M.P. Baker, Computer Graphics, Prentice-Hall, * All courses have been taken in Department of Computer Engineering at Sharif University of Technology. + Plus sign indicates Grad Courses in Sharif University of Technology. 2

3 Computational Geometry (40-735) Dr. M. Ghodsi Associate Professor 1. Sample problems and motivations 2. Plane sweep a. Segment-intersection test b. Convex-polygon queries 3. Polygon triangulation a. The DCEL data structure b. The art-gallery theorem 4. Linear programming a. Half-planes intersection b. Unbounded linear programming c. Smallest enclosing disk of a 2D point set 5. Orthogonal range searching a. 1D range searching. b. 2D kd-trees c. 2D Range trees 6. Point location 7. Voronoi diagram 8. Duality; Arrangements of lines 9. Delaunay triangulation 10. The crossing-number lemma, Miscellaneous Text Books 1. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwazkopf, Computational Geometry: Algorithms and Application, Springer, F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, Other References 1. J. O'Rourke, Computational Geometry in C, Second Edition, Cambridge University Press, G. T. Toussaint, Ed., Computational Geometry, North-Holland, J. E. Goodman and J. O'Rourke, Eds., Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, M. C. Lin and D. Manocha, (Eds.), Applied Computational Geometry, Springer-Verlag,

4 Advanced Algorithms (40-765) Dr. M. Ghodsi Associate Professor 1. Preliminaries: algorithm analysis, amortized analysis 2. NP-Complete problems: a. Introduction, history b. Inherently intractable problems, intractable, problem categories P, NP, and NPhard c. NP-Completeness theory, Cook s theorem, satisfiability problem d. Methods for proving that a problem is NP-Complete e. Major problems: 3-SAT, 3Dmatching, Vertex-Cover, Clique, Hamiltonian Cycle, Partition f. Pseudo-polynomial solutions for some of these problems 3. Graph and Network s algorithms: a. Flow networks and their applications b. Ford Fulkerson s algorithm, and Edmond-Karp s algorithm c. Converting several important problems to this problem 4. Matching Problem: a. Algorithms based on Flow Networks and Alternating Path b. Assignment Problem c. Transportation and Location Problems d. Stable Marriage problem 5. String Matching Problem: Robin-Karp, Knuth-Morris-Prath, and Boyer-Moore algorithms 6. Approximate algorithms for NP-hard problems Text Books 1. T. Cormen, C. Leiserson, and R. Riverst, Introduction to Algorithms, MIT Press, M. R. Garey, D. S. Johnson, Computers and Intractibility, A Guide to Theory of NP- Completeness, W. H. Freeman And Company,

5 Theory of Machines & Languages (40-415) Dr. A. Movaghar Associate Professor 1. Introduction to the Theory of Computation 2. Finite Automata 3. Regular Languages and Regular Grammars 4. Properties of Regular Languages 5. Context-Free Languages 6. Simplification of Context-Free Grammars and Normal Forms 7. Pushdown Automata 8. Properties of Context-Free Languages 9. Turing Machines 10. Other Models of Turing Machines 11. A Hierarchy of Formal Languages and Automata Text Book P. J. Denning, J. B. Dennis, J. E. Qualitz, Machines, Languages, and Computation, Prentice-Hall, Other References 1. P. Linz, Introduction to Formal Languages and Automata, Jones & Bartlett Publishers, 2nd Edition, H.R. Lewis & C.H. Papadimitriou, Elements of the Theory of Computation, Addison-Wesley,

6 Parallel Processing (40-647) Dr. M. Ghodsi Associate Professor 1. Need for parallel processing 2. Parallel processing models 3. Complexity of parallel algorithms 4. PRAM algorithms 5. Problem solving on PRAMS a. Matrix computations b. Sorting c. Graph algorithms 6. Introducing some parallel languages 7. Introducing MPI and programming with it 8. Systolic systems and algorithms 9. Designing systolic systems on Arrays, Meshes and Trees a. Bit and Word operations (Add and Multiply) b. Parallel prefix operation c. Sorting (simple, odd-even, ) d. Convolution e. Linear equations system f. Graph algorithms (Connected Components, Minimum Spanning Tree) g. Packet routing (Greedy algorithm and its analysis) 10. Image processing and Computational Geometry problems a. Image components labeling (Levialdi s algorithm) b. Nearest neighbor c. Convex hull 11. Retiming theorem: converting synchronized algorithms to systolic counterparts 12. Parallel algorithms on hypercube, butterfly, and shuffle exchange topologies a. Packet routing b. Sorting c. Automatic conversion of normal algorithms from one topology to others Text Books 1. F. T. Leighton, Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann, M. Quinn, Parallel Computing: Theory and Practice, McGraw Hill, Other References 1. B. Parhami, Introduction to Parallel Processing: Algorithms and Architectures, MPI Forum, MPI: A Message-Passing Interface Standard,

7 Numerical Computation Methods (40-215) Dr. B. Gholizadeh Assistant Professor 1. Equation solving methods: a. Midpoint, iterative, secant b. Single step methods and multi step methods c. Newton-Rafston d. Biersto, Birj-Veita 2. Errors: a. Types of error b. Growth of error and error propagation c. Process graph 3. Instability: case studies 4. Linear equations system: a. Gaussian elimination b. Linear methods by inverted matrix c. Jacobian iterative method d. Gauss-Sidel iterative method 5. Interpolation: a. Lagrange b. Newton c. Etckin-Novil d. Finite differences e. Iterative linear 6. Numerical integration and differentiation: a. Rules of differentiation b. Methods for integration: Trapezoidal, Simpson, Ramburg, and Gauss 7. Curves fitting: a. Least squares line b. Least squares polynomials c. Cubic splines 8. Numerical solutions for differential equations: a. Taylor methods b. Rong-Kootta: Euler, Houn, quadratic general equation, quadratic Rong-Kootta c. Predictor-corrector methods Text Book B. Gholizadeh, Numerical Computation Methods, Sharif University Press, Other References 1. J. H. Mathews, Numerical Methods For Computer Science, Engineering & Mathematics, Prentice Hall, Graham de Vahl Davis, Numerical Methods in Engineering & Science, Allen & Unwin, J.D. Faires and R.L. Burden, Numerical Methods, PWS Publishing Company,

8 Computer Systems Performance Evaluation (40-824) Dr. A. Movaghar Associate Professor 1. Performance Evaluation Techniques a. Evaluation Metrics b. Applications of Performance Evaluation 2. Measurement Based Techniques a. Capacity Planning and Benchmarking b. Monitoring 3. Simulation Methods 4. Data Analysis 5. Queuing Models 6. Stochastic Analysis a. Discrete-Time Markov Chains b. Continuous-Time Markov Chains c. Markov Reward Model 7. Queuing Networks Text Book K. Kant, Introduction to Computer Systems Performance Evaluation, McGraw-Hill, Other References 1. P. G. Harrison, N. M. Patel, Performance Modeling of Communication Networks and Computer Architectures, Addison-Wesley, C. H. Saur, K. M. Chandy, Computer Systems Performance Modeling, Prentice-Hall, Inc.,

9 Compiler Design (40-414) Dr. S. Neyaki Assistant Professor 1. General Concepts of Parsing 2. Concepts of Languages (regular expressions, context-free grammars, etc.) 3. Lexical and Syntax Analysis 4. Type Checking 5. Concepts of Parsing (LL(k) grammars, LR parsing, SLR(1) parsing, ) 6. Storage and Organization (Scope rules, Symbol Table organization, etc.) 7. Code generation 8. Code Optimization 9. Course Project: a. defining grammar for a simple language (similar to Pascal) b. producing scanner and parser for the language c. implementing a compiler for it d. optimizing the compiler (optional) Text Book 1. J. P. Tremblay, P. G. Sorenson, The Theory & Practice of Compiler Writing, McGraw-Hill, Other Reference 1. A. V. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools, Addison- Wesley, Pittman & Peters, The Art of Compiler Design, Prentice Hall, N. Fisher, Crafting a Compiler with C, Addison Wesley,

10 Design of Programming Languages (40-364) Dr. S. Neyaki Assistant Professor 1. Overview of programming languages 2. Designing languages a. Virtual computer model b. Language paradigms 3. Data Types 4. Procedures and Functions 5. Encapsulation 6. Polymorphism: Inheritance 7. Memory Management Methods (Implementation) 8. Abstractions 9. Functional Programming 10. Logic Programming 11. Advanced topics: a. Exceptions b. Coroutines Text Book J. Maclenman, Principles of Programming Languages, CBS College Publishing, Other Reference C. Ghezzi, and M. Jazayeri, Programming Language Concepts, John Wiley & Sons,

11 Speech Processing (40-967) Dr. A. Sameti Assistant Professor 1. Speech production model 2. Speech perception a. Classes of speech sound (consonants, vowels, etc.) b. Spectral characteristics of consonants and vowels, formants 3. Speech analysis techniques 4. Speech synthesis techniques 5. Speech recognition a. Hidden-Markov Models b. Neural networks c. Petri-nets 6. Speech enhancement Text Books 1. J. L. Flanagan, Speech Analysis, Synthesis and Perception, Springer-Verlag, J.R. Deller, J. G. Proakis, J. H. L. Hansen, Discrete-Time Processing of Speech Signals, Macmillan Pub. Co.,

12 Databases Systems II (40-938) Dr. R. Jalili Assistant Professor 1. Serializability theory 2. Concurrency control and its algorithms in centralized databases 3. Multiversion concurrency control (theory and algorithms) 4. Concurrency control in object model and its using in relational databases 5. Recovery (algorithms and implementation problems) 6. Replicated and distributed databases (theory and algorithms) Text Books 1. R. Jalili, Concurrency Control and Recovery in Database Systems, Sharif University Press, C.J. Date, An Introduction to Database Systems, Addison Wesley, Other Reference 1. G. Weikum & G. Vossen, Transactional Information Systems, Morgan Kaufmann Publishers, V. Kumar & M. Hsu, Recovery Mechanisms in Database Systems, Prentice-Hall, P. A. Bernstein, V. Hadzilacos & N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley,

13 Databases Systems (40-384) Dr. R. Jalili Assistant Professor 1. Introduction and definitions: a. Data and information b. Database definition and necessity of databases c. Data independency 2. A typical database architecture: a. 3-level architecture: external level, conceptual level, and internal level b. Database user, database administrator, and data communication administrator 3. Different models of database systems: hierarchical model, relational model, and network model 4. Relational model: a. Relation or table b. SQL c. Data modeling using the entity relationship approach d. Record storage and primary file organizations e. Index structures for files 5. Elements of relational model: domain, relation and its different types 6. Relational model integrity: candidate key, primary key, external key 7. Relational Algebra, Relational Arithmetic 8. SQL: a relational database language 9. A relational database management system 10. Functional dependencies and normalization for relational database: a. 1NF, 2NF, 3NF, BCNF, 4NF, 5NF b. MVP (multi value dependency) c. JD (join dependency) 11. Relational database design algorithms and further dependencies 12. Object oriented databases Text Book R. Elmasri and B. Navathe, Fundamental of Data Base System, Addison Wesley, References 1. C. J. Date, Introduction to Database Systems, Sixth edition, Addison Wesley, S. Abitebout, R. Hull and V. Vianu, Foundations of Databases, Addison Wesley,

14 Computer Graphics (40-447) Dr. B. Gholizadeh Assistant Professor 1. A Survey of Computer Graphics 2. Overview of Graphics Systems 3. Output Primitives 4. Attributes of Output Primitives 5. Two-Dimensional Geometric Transformations 6. Two-Dimensional Viewing 7. Structures and Hierarchical Modeling 8. Graphical User Interfaces and Interactive Input Methods 9. Three-Dimensional Concepts 10. Three-Dimensional Object Representations 11. Three-Dimensional Geometric and Modeling Transformations 12. Three-Dimensional Viewing 13. Visible-Surface Detection Methods 14. Illumination Models and Surface-Rendering Methods 15. Color Models and Color Applications Text Book D. Hearn and M.P. Baker, Computer Graphics, Prentice-Hall, Other References 1. D. Roger and J.A. Adams, Mathematical Elements for Computer Graphics, McGraw-Hill, Watt, 3D Computer Graphics, Addison-Wesley, F. S. Hill, Computer Graphics, MacMillan Publishing Company,