Graduate Calendar Archives: 1998 / 1999

Ottawa-Carleton Institute for Computer Science

Herzberg Building 5302
Telephone: 520-4333
Fax: 520-4334
E-mail: scs@carleton.ca

The Institute

Director of the Institute, B.J. Oommen

Associate Director of the Institute, S.J. Matwin

Students who wish to pursue studies in computer science leading to an M.C.S. or a Ph.D. degree can do so in a joint program offered by the Department of Computer Science at the University of Ottawa and the School of Computer Science at Carleton University under the auspices of the Ottawa-Carleton Institute for Computer Science. The Institute is responsible for supervising the program and for providing a framework for interaction between the two departments at the research level. In addition to the faculty members from the two computer science departments, the Institute also has members with computer science expertise from other departments.

The M.C.S. is also available as part of ConGESE (Consortium for Graduate Education in Software Engineering), a collaborative program offering a specialization in software engineering. This program is geared towards software professionals working for participating industrial partners. The ConGESE program imposes further regulations and requirements on the existing program. The degree will in each case specify the discipline of the participating unit with Specialization in Software Engineering. Additional information is available from the graduate supervisor.

Requests for information, and completed applications, should be sent to the director or associate director of the Institute. A joint admissions committee examines all applications and assigns students to the most appropriate campus and supervisor.

Members of the Institute

The “home” department of each member is indicated by (CSI) for the Department of Computer Science, University of Ottawa; (ELG) for the Department of Electrical Engineering, University of Ottawa; (ADM) for Faculty of Administration, University of Ottawa; (MCG) for the Department of

Mechanical Engineering, University of Ottawa; (SCS) for the School of Computer Science, Carleton University; (MAT) for the School of Mathematics and Statistics, Carleton University; (SCE) for the Department of Systems and Computer Engineering, Carleton University; (C) for the Department of Civil and Environmental Engineering, Carleton University; (BUS) for the School of Business, Carleton University.

• M.D. Atkinson, Complexity, Algorithms, Computational Algebra (SCS - Adjunct)
• L.G. Birta, Simulation, Optimization, Numerical Algorithms (CSI)
• P. Bose, Applied Geometric Computing, Computational Geometry, Data Structures, Algorithms Design and Analysis, Randomized Algorithms, Graph Theory (SCS)
• Sylvia Boyd, Optimization, Combinatorics (CSI)
• R.J. Buhr, Software Design, Design Visualization, Real-Time and Distributed Systems, Object-Oriented Systems, Software Architecture, Use Case-Maps (SCE)
• J.W. Chinneck, Operations Research, Applied Optimization (SCE)
• J.-P. Corriveau, Cognitive Science, Natural Language Understanding, CASE Tools (SCS)
• S.P. Dandamudi, Parallel and Distributed Systems, Database Systems, Performance Evaluation, Computer Architecture, Operating Systems (SCS)
• N.W. Dawes, Diagnosis and Pattern Recognition (SCE - Adjunct)
• Frank Dehne, Computational Geometry, VLSI Algorithms (SCS)
• D. Deugo, Large-Scale Distributed Object Computing, Evolutionary Computation (Genetic Algorithms, Genetic Programming, Artificial Life), Object-Oriented Systems (SCS)
• J.D. Dixon, Algorithms, Algebra, Number Theory (MAT)
• A.E.F. Fahim, Nonlinear Optimization, CAD/CAM Methodology and Software, FMC Control Environment, Robot Control, Expert Systems for Design and Manufacturing (MCG)
• Frantisek Fiala, Combinatorial Algorithms, Vehicle Routing Problems, Software Tools (SCS)
• N.D. Georganas,Computer Communications, Mobile Radio (ELG)
• Morris Goldberg, Image Processing, Pattern Recognition (ELG)
• R.C. Holte, Artificial Intelligence, Machine Learning, Knowledge Compilation (CSI)
• N.M. Holtz,Computer-aided Structural Engineering (C)
• A. Karmouch, Multimedia Communications, Multimedia Real-Time Distributed Information Systems and Databases (ELG)
• G.E. Kersten, Knowledge-based Systems, Intelligent Decision Support, Problem Structuring and Representation (BUS)
• Evangelos Kranakis, Cryptography, Computational Number Theory, Combinatorial Analysis, Computational Geometry, Distributed Computing, Distributed and Data Networks SCS)
• Moshe Krieger, Computer Architecture (ELG)
• Danny Krizanc, Parallel and Distributed Computing, Analysis of Algorithms and Use of Randomization in Computation (SCS)
• T. Kunz, Wireless and Mobile Computing, Load Balancing in Distributed Systems, Distributed Programming Environments for Parallel and Distributed Systems, Distributed Systems Management, Parallel and Distributed Debugging, Program Understanding (SCE)
• R. Laganiere, Computer Vision, Image Processing (CSI)
• W.R. LaLonde, Object-Oriented Systems, Design and Analysis Tools, Animation Systems (SCS)
• Luigi Logrippo, Software Methodology, Communications Protocols (CSI)
• A. Maheshwari, Data Structures and Algorithms, Parallel Computation, Computational Geometry, Graph Algorithms (SCS)
• S.A. Mahmoud, Wireless Communication Systems, Software Project Management, Protocols for High Speed Networks, Speech Processing and Computer Network Design (SCE)
• M. Marchand, Computational Learning Theory, Machine Learning, Neural Networks (CSI)
• S.J. Matwin, Programing Languages, Expert Systems (CSI)
• A. Mili, Formal Specification, Program Transformation (CSI)
• B.C. Mortimer, Combinatorics, Algorithms, Groups Theory (MAT)
• J. E. Neilson, Distributed and Parallel Computing including: Operating Systems, Performance Models, and Design Tools; Simulation and Prototyping Methodology, Computer Systems Performance Engineering (SCS-Adjunct)
• L.D. Nel, Object-Oriented Programing and Obect-Oriented Development, Computer Music and Multimedia (SCS)
• J.B. Oommen, Learning Systems, Stochastic Automata, Syntactic Pattern Recognition, Adaptive Data Structures, Neural Networks (SCS)
• Franz Oppacher, Artificial Intelligence, Genetic Algorithms, Evolutionary Computing, Machine Learning (SCS)
• T.I. Ören, Simulation, Modelling (CSI)
• E.J. Otoo, Databases, Algorithms (SCS)
• Bernard Pagurek, Communications Network Management, Artificial Intelligence and Fault Management, Knowledge-Based Software Debugging (SCE)
• R.L. Probert, Communications, Expert Systems (CSI)
• J.R. Pugh, Object-Oriented Development Environments (SCS - Adjunct)
• Jacques Raymond, Computer Architecture, Graphics (CSI)
• Ivan Rival, Combinatorics, Optimization, Algorithms (CSI)
• J.-R. Sack, Algorithms and Complexity, Computational Geometry, Geographic Information Systems, Parallel Computing, Graphics (SCS)
• Nicola Santoro, Distributed Computing, Fault-Tolerance, Discrete Chaos, Reactive Environments (SCS)
• Philip Scott, Logic, Theoretical Computer Science, Category Theory (CSI)
• J.B. Sidney, Combinatorics, Complexity, Computational Geometry (ADM)
• D.R. Skuce, Artificial Intelligence, Logic Programing (CSI)
• Ivan Stojmenovic, Computational Geometry, Multiple-valued Logics, Parallel Computing (CSI)
• Stan Szpakowicz, Logic Programing, Computational Linguistics (CSI)
• D.A. Thomas, Artificial Intelligence, Fifth Generation Machines (SCS - Adjunct)
• Hasan Ural, Software Reliability and Testing, Data Communication Protocols, Applications of Logic Programing (CSI)
• Jorge Urrutia, Algorithms, Combinatorics, Geometry And Algorithms (CSI)
• Rémi Vaillancourt, Numerical Methods (CSI)
• G.M. White, Networking, Office Automation (CSI)
• C.M. Woodside, Performance Modelling, Performance of Distributed Software, Software Design, Queuing Theory (SCE)
• Negib Zaguia, Optimization, Theory of Algorithms, Theory of Ordered Sets (CSI)

Master of Computer Science

Admission Requirements

Applicants should have an Honours bachelor’s degree in computer science or the equivalent, with at least high honours standing. By equivalent is meant an Honours degree in a program which includes at least twelve computer science half credits, two of which must be at the 400-level, as well as eight half credits in mathematics, one of which must be at the 300- or 400-level. These courses must include the topics indicated below:

Computer Science

Data structures/file management, operating systems, computer architecture, algorithm design and analysis, assembly language and two high-level languages

Mathematics

Calculus, linear algebra, algebraic structures or discrete mathematics, probability and statistics, numerical analysis. Applicants who have a general (3 year) bachelor’s degree, or who otherwise lack the required undergraduate preparation, may be admitted to a qualifying-year program. Refer to the General Regulations section of this Calendar for regulations governing the qualifying year.

Program Requirements

The program includes graduate study and research in four broad areas identified as follows:

• Software Engineering
• Theory of Computing
• Computer Applications
• Computer Systems

Within these areas, the program emphasizes problems of current practical significance and has close links to the scientific and industrial communities.

Normally, students in the program will be expected to complete a thesis; however, students who have substantial relevant work experience may be permitted to take the non-thesis option, which must include a graduate research project course. Each candidate submitting a thesis will be required to undertake an oral defence of the thesis.

Students in the thesis option must take 2.5 credits , fulfil the graduate seminar requirement, and complete a thesis. Students in the non-thesis option must take 4.0 credits, plus a graduate project (a project is equal to 1.0 credit and may be completed in one or two terms), and fulfil the graduate seminar requirement. The course selections must be approved by the student’s academic adviser, and must include at least:

• 0.5 credit in software engineering
• 0.5 credit in the theory of computing
• 0.5 credit in either computer applications or computer systems

The graduate seminar requirement includes a seminar presentation and participation in at least ten sessions in the joint graduate student seminar series.

Both course and thesis work may be completed either by full-time or part-time study.

A candidate may be permitted to carry out thesis work off campus provided that suitable arrangements are made for supervision and experimental work, and prior approval is given by the Institute.

Guidelines for Completion of Master’s Degree

The following completion times are estimates only, based on full-time study, and are intended to provide guidance only.

Students are strongly urged to check with the supervisor of graduate studies to determine the exact requirements of the degree program and other related information. Part-time students should calculate the completion times requirement by doubling the time estimates given below.

Students should complete the course work within the first two terms. Selection of courses should be done in consultation with the supervisor of graduate studies. A thesis supervisor and a thesis topic must be selected by the end of the second term. The supervisor of graduate studies should be formally notified of this selection. The expected completion time for the M.C.S. degree is four to six terms of full-time study depending on the type of thesis and the area of research.

Doctor of Philosophy

Admission Requirements

A master’s degree in Computer Science (or the equivalent) with high second-class standing is normally required for admission into the Ph.D. program. Students who are currently registered in the M.C.S. program may, in exceptional cases, be permitted to transfer into the Ph.D. program if they have completed all course requirements with at least high second-class standing and demonstrate significant promise for advanced research.

Program Requirements

• A minimum of 2.5 credits, at the graduate level which must include: 0.5 credit in software engineering; 0.5 credit in the theory of computing; 0.5 credit in either computer applications or computer systems
• Presentation of at least two seminars in the Ottawa-Carleton Institute for Computer Science seminar series
• A comprehensive examination involving breadth and depth components
• A written thesis proposal defended at an oral examination
• A research thesis, defended at an oral examination

Guidelines for Completion of the Doctoral Degree

The following completion times are estimates based on full-time study, and are intended to provide guidance only.

During the first term, the thesis supervisor and the student must select courses. Course selection must be submitted for approval to the director or associate director of the Institute. An advisory committee comprised of three to five faculty members must be established before the end of the second term. The committee is responsible for the comprehensive examination, the thesis proposal, and for guiding the student’s research. The advisory committee must be approved by the director or associate director of the Institute. Comprehensive examinations must be taken within the first 12 months. All course requirements must be completed within the first 24 months. The student must submit a written thesis proposal and defend it in an oral examination. The expected completion time for the Ph.D. program is nine to twelve terms depending on the type of thesis and the area of research. Before the completion of the program, the student is expected to present at least two seminars in the Ottawa-Carleton Institute for Computer Science seminar series.

Residence Requirement

Students must fulfil a residence requirement of at least four terms of full-time study.

Graduate Courses

Not all of the following courses are offered in a given year. For an up-to-date statement of course offerings for 1998-99, please consult the Registration Instructions and Class Schedule booklet published in the summer. face="Times New Roman">

The courses in the following list are offered by various departments indicated by the prefix of the course code as follows:

Carleton University

University of Ottawa

Software Engineering

Theory of Computing

Computer Applications

Computer Systems

Theses, Projects and Topics