---

 

1.   Purpose of Programs

Students must complete a dissertation as well as courses, both in the master's program and in the

doctoral program.

 

The master's program aims

1)  to acquire knowledge and experience essential for experts in computer science, and

2)  to improve capability for finding and solving problems in computer science.

 

The doctoral program aims

1)  to acquire advanced knowledge of computer science,

2)  to improve capability to appreciate their own situations in their research area both from the

scientific standpoint and from the social standpoint, and

3)  to develop leadership qualities for finding and solving problems in computer science.

 

2.   Categories of Courses

The curriculum consists of the courses in Table 1 which are classified as follows:

1)  Basic Courses

Fundamental knowledge essential in computer science is given in the basic courses.

2)  Advanced Courses

The advanced courses are offered for specialized subjects. Students in the master's program

should consider their intended research area. Students in the doctoral program should take

these courses to obtain broad and advanced knowledge.

Table 1

Class	Credit	Lecturer	Semester	Note
Advanced Computer Architecture	2-0-0	Maejima	Autumn
* Mathematical Theory of Programs	2-0-0	Kobayashi	Spring
* Knowledge Engineering	2-0-0	Tokunaga	Autumn	O
* Fault Tolerant Systems	2-0-0	Yoneda,	Autumn
		Gondow
* Concurrent System Theory	2-0-0	Yonezaki	Spring	English
* Software Design Methodology	2-0-0	Gondow,	Spring
		Yoneda
* Advanced Artificial Intelligence	2-0-0	Shinoda	Autumn	English
* Multi-media Information Processing	2-0-0	Kamei, Saito	Spring
Advanced Operating Systems	2-0-0	Watanabe	Autumn	O
* Theory of Pseudo-Biorthogonal Bases	2-0-0		Spring	E
Natural Language Processing	2-0-0		Spring
* Pattern Information Processing	2-0-0	Sugiyama	Autumn	English
* Foundations of Computing Environments	2-0-0	Tokuda	Autumn	English
* Logic and Software	2-0-0	Nishizaki	Spring
* Machine Learning	2-0-0	Murata, Sato	Spring
* Computer Graphics	2-0-0	Nakajima	Spring	English in O, Japanese in E
* Advanced Coding Theory	2-0-0	Fujiwara	Spring	English in O, Japanese in E
* Machine Inference	2-0-0	Sato, Murata	Spring
* Computational Linguistics	2-0-0	Tokunaga	Autumn	E
* Advanced Software Engineering	2-0-0	Saeki	Autumn
* Human Interface	2-0-0	Furui	Spring	English
* Speech Information Processing	2-0-0	Furui	Autumn	English, O
* Autonomous Decentralized System	2-0-0	Mori	Spring
* Advanced Data Engineering	2-0-0	Yokota	Autumn
* Advanced Network Programming	2-0-0	Mochizuki	Autumn
Advanced Information Security	2-0-0	Maruyama,	Autumn
		Eto,Kudo
Computational Complexity Theory	2-0-0	Watanabe	Spring	Note3
Mathematical Models and Computer Science	2-0-0	Kojima	Autumn	Note3
Human Interfaces in Computing Systems	2-0-0	Matsuoka	Autumn	Note3
Theory & Applications of Wide Areal Knowledge-Base	2-0-0	Osaragi	Autumn	Note3
Special Experiments I on Computer Science	0-0-2	Mentor	Spring	Master's Courses
Special Experiments II on Computer Science	0-0-2	Mentor	Autumn	Master's Courses
+ Seminar I on Computer Science	1	Mentor	Spring	Master's Courses
+ Seminar II on Computer Science	1	Mentor	Autumn	Master's Courses
+ Seminar III on Computer Science	1	Mentor	Spring	Master's Courses
+ Seminar IV on Computer Science	1	Mentor	Autumn	Master's Courses
+ Seminar V on Computer Science	2	Mentor	Spring	Doctoral Courses
+ Seminar VI on Computer Science	2	Mentor	Autumn	Doctoral Courses
+ Seminar VII on Computer Science	2	Mentor	Spring	Doctoral Courses
+ Seminar VIII on Computer Science	2	Mentor	Autumn	Doctoral Courses
+ Seminar IX on Computer Science	2	Mentor	Spring	Doctoral Courses
+ Seminar X on Computer Science	2	Mentor	Autumn	Doctoral Courses

 

Notes

(1)  The classes with “+” symbols should be passed in the indicated academic years.

(2)  “E” or “O” symbols in the comment column show that those classes are opened in even or odd

years, respectively. Classes without such symbols are opened every year.

(3)  Classes with “Note 3” symbols are offered by the other Departments, but they are identified

with those offered by our Department. Therefore, if students of our Department pass such

classes, the credits are counted as those of our Department.

(4)  For classes with “*” symbols, the English versions of those classes where lectures and seminars

are given in English will be opened by request.

These courses are categorized into four research areas (Table 2,3,4, and 5) as follows:

 

Table 2 (Computer Systems)

Basic Courses

Advanced Computer Architectures

Fault Tolerant Systems

Advanced Operating Systems

Advanced Courses

Computer Environments

Advanced Coding Theory

Autonomous Decentralized System

Advanced Parallel Data Engineering

 

Table 3 (Software)

Basic Courses

Mathematical Theory of Programs

Software Design Methodology

Concurrent System Theory

Advanced Courses

Logic and Software

Advanced Software Engineering

Advanced Information Security

 

Table 4 (Artificial Intelligence)

Basic Courses

Knowledge Engineering

Advanced Artificial Intelligence

Natural Language Processing

Advanced Courses

Machine Learning

Computational Linguistics

Machine Inference

 

Table 5 (Cognitive Engineering)

Basic Courses

Theory of Pseudo Biorthogonal Bases

Pattern Information Processing

Multi-media Information Processing

Advanced Courses

Computer Graphics

Human Interface

Speech Information Processing

 

3)  (Recommended Courses)

The courses in Table 6 are given in other departments but are recommended to students of our

department.

 

Table 6 (Recommended Courses)

Dept. of Mathematical and Computing Science

Computational Complexity Theory

Mathematical Models and Computer Science

Human Interfaces in Computing Systems

Dept. of Mechanical and Environmental Informatics

Theory & Applications of Wide Areal Knowledge-Base

4)  (Experiments and Seminars)

Topics related to master's or doctoral research are addressed in the experiments and the

seminars:

 

Table 7

Special Experiments I on Computer Science (Master's Courses)

Special Experiments II on Computer Science (Master's Courses)

 

Table 8

Seminar I on Computer Science (Master's Courses)

Seminar II on Computer Science (Master's Courses)

Seminar III on Computer Science (Master's Courses)

Seminar IV on Computer Science (Master's Courses)

Seminar V on Computer Science (Master's Courses)

Seminar VI on Computer Science (Master's Courses)

Seminar VII on Computer Science (Master's Courses)

Seminar VIII on Computer Science (Master's Courses)

Seminar IX on Computer Science (Master's Courses)

Seminar X on Computer Science (Master's Courses)

 

3.   Requirements for the completion of programs

We give each student the following requirements about the number of credits for the completion of the

Master's Program or the Doctoral Program in addition to the University general rules so that students

can acquire both depth and breadth of the topics of Computer Science.

(Note that these requirements are only for students who enrolled in the Master's Program in 1994 or later,

and for students who enrolled in the Doctoral Program in 1996 or later.)

 

*  Students in the Master's Program must acquire 16 or more credits satisfying the condition that the passed

classes are from at least three different tables shown in Table 2, 3, 4, and 5.

*  Students in the Doctoral Program must acquire 8 or more credits shown in Table 2, 3, 4, and 5

which are not included in those earned in the Master's Program.

The credits for the undergraduate program are not counted as the credits in the above

requirements. If a student has earned some credits shown in Table 2, 3, 4, 5, and 6 before entering our

Department, up to 10 those credits are counted as the ones in the above requirements.

 

4.   Choice of classes

*  When a student chooses classes to take in our Department, he or she should discuss his/her study and

research plans with the supervisor and take classes systematically according to the carefully

considered study plan. Making an excessively hard plan should be avoided.

*  Students are expected to take the undergraduate classes which are related to their research interests

before entering our Department.

Advanced Coding Theory

2005 Spring Semester (2-0-0) Odd Years only

Prof. Eiji FUJIWARA

I.     Practical code design method and application of coding theory to computer systems

II.       1.    Codes for High-Speed memories (codes for bit errors, byte errors, and bit plus byte errors)

2.    Codes for mass memories (tape memory codes, and disc memory codes)

3.    Practical codes and their design techniques: Parity codes, Hamming/Hsiao SEC-DED

codes, Reed-Solomon codes, ORC, AXP codes, Fire codes, CIRC, LDC, Interleaving

 

Human Interface

2005 Spring Semester (2-0-0)

Prof. Sadaoki FURUI

I.     Principles and techniques for human-computer interface design

II.       Models of human computer interaction, Models of human information processing, Multimedia

interface, Direct manipulation, Graphical user interface, Hypertext/hypermedia, Groupware.

Ergonomics, Usability, and Human interface design.

 

Speech Information Processing

2005 Autumn Semester (2-0-0) Odd Years only

Prof. Sadaoki FURUI

I.     Principles and techniques for speech information processing

II.       Speech and language, relationships between various information included in speech, statistical

properties of speech signals, speech analysis techniques, speech coding, speech synthesis,

speech recognition, acoustic processing of speech (hidden Markov models and neural

networks),  linguistic  processing  of speech,  search/optimization/adaptation,  speaker

recognition, and applications of speech processing techniques.

 

Pattern Information Processing

2004 Autumn Semester (2-0-0)

Assoc. Prof. Masashi SUGIYAMA

I.     The pattern information has continuity and topology as its intrinsic properties. Contrary to the

symbolic information which lacks these properties, the pattern information can analytically

deal with problems using these properties. Focussing on artificial neural networks, roles of

continuity and topology on optimization and learning problems are discussed.

II.       Symbol v.s. Pattern, Mathematical concepts of continuity and topology, Roles of continuity

and topology in optimization problems, Optimization by Boltzmann Machines (Symbolic

Processing), Optimization by continuous Hopfield Models (Pattern Processing), Roles of

continuity and topology in learning problems (Gradient descent and Topology map)

Computer Graphics

2005 Spring Semester (2-0-0) Odd Years only

Prof. Masayuki NAKAJIMA

I.     Computer basic theory (2-D CG theory, effective line drawing theory, 3-D CG theory and

Modeling), Image rendering (texture mapping, ray tracing, volume rendering and fractal

theory), Computer animation (key-frame method, morphing and real-time animation)

II.       Computer Graphics Applications (virtual reality, Scientific visualization, medical imaging,

internet applications, multimedia applications and entertainment applications)

 

Foundations of Computing Environments

2005 Autumn Semester (2-0-0)

Prof. Takehiro TOKUDA

I.     Principles of concurrent/distributed algorithms and their applications to computing

environments

II.       Concurrent systems, Distributed systems, Mutual exclusion problems, Communication

problems, Graph problems, and Applications

 

Concurrent System Theory

2005 Spring Semester (2-0-0)

Prof. Naoki YONEZAKI

I.     Concepts and techniques for formalizing concurrent systems

II.       Concurrent systems, Communicating sequential processes, Temporal logic, Algebraic

approach, Analysis of concurrent systems

 

Advanced Artificial Intelligence

2004 Autumn Semester (2-0-0)

Assoc. Prof. Koichi SHINODA

I. 　Principles and techniques for artificial intelligence.

II.  Nonmonotonic reasoning, Statistical pattern recognition,

Hidden Markov model, and Bayesian network.