AY 2026 Graduate School Course Catalog AY 2026 Graduate School Course Catalog AY 2026 Graduate School Course Catalog
| 2026/02/19 |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 1学期 ／First Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
LIU Yong |
| 担当教員名 ／Instructor |
LIU Yong |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
PL02 C Programming PL03 JAVA Programming I PL04 C++ Programming FU01 Algorithms and Data Structures I |
| 更新日／Last updated on | 2026/02/05 |
|---|---|
| 授業の概要 ／Course outline |
An intelligent system must have at least the following means: 1) A means to access and acquire information. 2) A means to integrate, abstract, and be aware of the information. 3) A means to change and to adapt to the environment based on acquired information. The goal of neural network research is to realize an intelligent system using the human brain as a single model to realize all of the above means. There are many research topics in this area, for example 1) How to use neural networks to represent/acquire information/knowledge? 2) How to use neural networks to integrate, abstract, and be aware of the information? 3) How to change a neural network to adapt to the environment? This course introduces the basic models, learning algorithms, and some applications of neural networks. After this course, we should be able to know how to use neural networks for solving some practical problems such as pattern recognition, pattern classification, function approximation, data visualization, and so on. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
In this course, the students will study the following topics: 1) Basic neuron models: McCulloch-Pitts model, nearest neighbor model, radial basis function model, etc. 2) Basic neural network models: multilayer neural network, self-organizing neural network, associative memory, radial basis function neural network, support vector machine, neural network tree, etc. 3) Basic learning algorithms: delta learning rule, back propagation, winner take all, self-organizing feature map, learning vector quantization, etc. 4) Applications: character recognition, function approximation, data visualization, etc. |
| 授業スケジュール ／Class schedule |
1. Introduction - A brief introduction of this course. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). 2. Fundamental concepts - Neuron models and the general learning rule. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). 3. Multilayer neural networks - Structure and the back propagation learning algorithm for multilayer perceptron (MLP). [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). 4. Team project - I - Learning of MLP for solving simple problems. [Preparation/Review] Discuss the MLP learning algorithms and simulation results: preparation (3 hours), review (3 hours). 5. Associative memory - Hopfield neural network, energy function, and convergence. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). 6. Team project II - Application of Hopfield neural network to image restoration. [Preparation/Review] Discuss the learning in Hopfield neural network and simulation results: preparation (3 hours), review (3 hours). 7. Self-organizing neural networks - Kohonen neural network, pattern clustering, and the winner-take-all learning algorithm. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). 8. Team project III - Pattern classification using self-organizing neural networks. [Preparation/Review] Discuss the learning in the self-organizing neural networks and simulation results: preparation (3 hours), review (3 hours). 9. Self-organizing feature map - Dimensionality reduction and data visualization based on the self-organizing feature map algorithm. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). 10. Team project IV - Visualization of high dimensional patterns. [Preparation/Review] Discuss the self-organizing feature map learning and simulation results: preparation (3 hours), review (3 hours). 11. RBF neural networks - Radial basis neural network and support vector machines (SVM). [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). 12. Team project V - Pattern recognition based on SVM. [Preparation/Review] Discuss SVM learning and simulation results: preparation (3 hours), review (3 hours). 13. Neural network trees - Hybridization of neural networks and the decision tree. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). 14. Presentation of team projects [Preparation/Review] Write presentation slides: preparation (2 hours), review (4 hours). |
| 教科書 ／Textbook(s) |
Lecture notes and reference materials will be available on the course page . |
| 成績評価の方法・基準 ／Grading method/criteria |
Projects: 75 (15 x 5) points Final presentation: 25 points |
| 履修上の留意点 ／Note for course registration |
Students are required to do 5 team projects for implementing the taught neural network models by using C, or C++, or Java languages. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
1) Ian Goodfellow and Yoshua Bengio and Aaron Courville, Deep Learning, MIT Press, 2016. 2) Jacek M. Zurada, Introduction to Artificial Neural Systems, PWS Publishing Company, 1995. 3) Simon Haykin, Neural Networks: A Comprehensive Foundation, Macmillan College Publishing Company, 1994. 4) Mohamad H. Hassoun, Foundamentals of Artificial Neural Networks,The MIT Press, 1995. 5) Laurene Fausett, Fundamentals of Neural Networks: Architectures, Algorithms, and Applications, Prentice Hall International, Inc., 1994. 6) B. D. Ripley, Pattern Recognition and Neural Networks, Cambridge University Press., 1996. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
LIU Yong |
| 担当教員名 ／Instructor |
LIU Yong |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
CSA01 Neural Networks I: Fundamental Theory and Applications |
| 更新日／Last updated on | 2026/02/05 |
|---|---|
| 授業の概要 ／Course outline |
The course starts from an overview of evolutionary computation, and a simple example of evolutionary optimization so that the students could quickly grasp the basic ideas of nature-inspired techniques. In the following lectures, design examples in game, learning systems, and intelligent systems will be given. The aim of this course is to let students learn nature-inspired design by examples. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
1. To know what nature-inspired design techniques are and how they are applied to some real problems. 2. To understand the advantages and disadvantages of nature-inspired design techniques compared to other traditional design techniques. 3. To investigate potential applications of nature-inspired techniques to some real world problems. |
| 授業スケジュール ／Class schedule |
1. Introduction to Evolutionary Computation - An overview of evolutionary computation - Genetic algorithms, evolutionary programming, evolution strategies, and genetic programming [Preparation/Review] Study lecture notes and reference materials: preparation (3 hours), review (1 hour). 2. Evolutionary Programming - Global function optimization - Evolutionary programming with adaptation [Preparation/Review] Study lecture notes and reference papers: preparation (1 hour), review (1 hour). 3. Fast Evolutionary Programming - Fast evolutionary programming with Cauchy mutation - How to compare random search methods statistically [Preparation/Review] Study lecture notes and reference papers: preparation (2 hours), review (2 hours). 4. Evolutionary Game - How to learn a game without any teachers - How well the player can learn - How well the evolved strategies can generalize [Preparation/Review] Study lecture notes and reference papers: preparation (3 hours), review (2 hours). 5. Search Operators and Representations - Hybrid evolutionary algorithms with the mixed search operators and representations. [Preparation/Review] Study lecture notes and reference papers: preparation (2 hours), review (2 hours). 6. Team Project 1 on Evolutionary Optimization Students are required to work Team Project 1 on implementing evolutionary optimization for either numerical or combinatorial optimization problems. [Preparation/Review] Discuss the used evolutionary algorithms and the tested problems (4 hours), review the simulation results (2 hours). 7. Selection and Recombination - Different selection schemes - How to incorporate domain knowledge into search operators [Preparation/Review] Study lecture notes and reference materials: preparation (2 hour), review (1 hour). 8. Evolutionary Robots - An example of evolvable system design for a robot controller - Evolutionary algorithms for evolving programmable logic array [Preparation/Review] Study lecture notes and reference materials: preparation (2 hours), review (2 hours). 9. Evolutionary System with Reinforcement Learning - Real time evolvable system with reinforcement learning [Preparation/Review] Study lecture notes and reference materials: preparation (2 hours), review (2 hours). 10. Design of Neural Network Architecture - Architecture learning [Preparation/Review] Study lecture notes and reference materials: preparation (2 hour), review (1 hour). 11. Team Project 2 on Evolutionary Learning Students are required to work Team Project 2 on implementing evolutionary learning for some design problems. [Preparation/Review] Disscuss the used evolutionary learning and the design problems (3 hours), review the simulation results (3 hours). 12. Evolutionary Artificial Neural Networks - Direct encoding representations and indirect encoding representations - Hybrid learning [Preparation/Review] Study lecture notes and reference materials: preparation (2 hours), review (2 hours). 13. Evolutionary Neural Network Ensembles - Evolve a population of neural networks - Fitness sharing [Preparation/Review] Study lecture notes and reference materials: preparation (3 hours), review (2 hours). 14. Presentation of team projects [Preparation/Review] Write presentation slides: preparation (2 hours), review (4 hours). |
| 教科書 ／Textbook(s) |
Lecture notes will be available on the course page. |
| 成績評価の方法・基準 ／Grading method/criteria |
Team projects: 60 (30x2, two projects) Final presentation: 40 |
| 履修上の留意点 ／Note for course registration |
Students are required to do 2 team projects for implementing both evolutionary optimization and evolutionary learning. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
1. Some references will be shown on course pages. 2. Ian Goodfellow and Yoshua Bengio and Aaron Courville, Deep Learning, MIT Press, 2016. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
MORI Kazuyoshi |
| 担当教員名 ／Instructor |
MORI Kazuyoshi |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/02/04 |
|---|---|
| 授業の概要 ／Course outline |
This course is concerned with the multidimensional systems theory. This theory includes multidimensional control system and image processing, and so on. We will proceed precisely with mathematical descriptions. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
This course is concerned with the multidimensional systems theory. This theory includes multidimensional control system and image processing, and so on. We will proceed precisely with mathematical descriptions. |
| 授業スケジュール ／Class schedule |
1. Scalar 2-D Input/Output Systems 2. Stability 3. Structural Stability 4. Multi-Input/Multi-Output Systems 5. Stabilization of Scalar Feedback Systems 6. Characterization of Stabilizers for Scalar Systems 7. Stabilization of Strictly Causal Transfer Matrices 8. Characterization of Stabilizers for MIMO Systems 9. Stabilization of Weakly Causal Systems 10. Stabilization of MIMO Weakly Causal Systems Pre-class and Post-class Learning (including homeworks) may be required (it is expected about 4hours). |
| 教科書 ／Textbook(s) |
To be distributed. |
| 成績評価の方法・基準 ／Grading method/criteria |
Final examination and/or Reports |
| 履修上の留意点 ／Note for course registration |
The language is English. If all students can understand Japanese, Japanese may be used in addtion. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
1. Multidimensional Systems Theory (2nd Ed). D.Reidel Publishing, 2003. (Reference) 2. Schaum's Outline of Theory and Problems of Signals and Systems 3rd Ed.(Schaum's Outlines) (Reference) |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 4学期 ／Fourth Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
HAMADA Mohamed |
| 担当教員名 ／Instructor |
HAMADA Mohamed |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
Automata and Langauges |
| 更新日／Last updated on | 2026/02/03 |
|---|---|
| 授業の概要 ／Course outline |
The models of computations will be introduced and the term rewriting systems (TRS), as a universal model of computation, and its major properties such as termination and confluence will be discussed. Term rewriting is a branch of theoretical computer science which combines elements of logic, universal algebra, automated theorem proving and functional programming. Its foundation is equational logic. TRS constitutes a Turing- complete computational model which is very close to functional programming. It has applications in Algebra, recursion theory, software engineering and programming languages. In general TRSs apply in any context where efficient methods for reasoning with equations are required. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
This course gives students the fundamental concepts of the computational models and the concept of rewriting systems and its applications in many areas of theoretical computer science. It also give the students more understanding of the major properties of term rewriting systems. |
| 授業スケジュール ／Class schedule |
1. Introduction to models of computation 2. Finite automata as a model of computation for formal languages 3. Turing machines as a powerful model of computation 4. Rewriting systems as a general-purpose model of computation 5. Term rewriting systems 6. Unification, most general unifier and unification algorithm 7. Midterm Report/Exam/presentation 8. Church-Rosser property, Confluence, and Local confluence 9. Critical pairs (CP) and CP algorithm 10. Termination of rewriting systems 11. Completion and Knuth-Bendix algorithm 12. Other rewriting systems 13. General review 14. Final report presentation/Exam |
| 教科書 ／Textbook(s) |
1. F. Baader and T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998. 2. Other materials related to the topics will be introduced in the class. Various materials will be prepared |
| 成績評価の方法・基準 ／Grading method/criteria |
1. Class activities: 14% 2. Exercise: 26% 3. Midterm exam/report: 20% 4. Final exam/report: 40% |
| 履修上の留意点 ／Note for course registration |
As this course is given to students who have not studied the fundamentals of term rewriting systems, there is no prerequisites. But we expect students have some basic courses such as discrete mathematics and/or algebra. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Will be given during lectures. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 1学期 ／First Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
ASAI Nobuyoshi |
| 担当教員名 ／Instructor |
ASAI Nobuyoshi |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
Linear Algebras I, II Numerical Analysis |
| 更新日／Last updated on | 2026/02/03 |
|---|---|
| 授業の概要 ／Course outline |
This is a topic course: several topics of matrix based numerical computation will be selected, especially properties of matrices from the view point of decomposition theorems are discussed. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
Give a summary of properties of matrices on matrix computations. |
| 授業スケジュール ／Class schedule |
1. Matrix operations
2. Vector space and linear transformation 3. Vector space and linear transformation 4. Matrix Decompositions 5. Equivalent Decomposition 6. LDU Decomposition 7. Determinant and Inner Product 8. QR Decomposition 9. QR Decomposition 10. Shur Decomposition 11. Shur Decomposition 12. Jordan Decomposition 13. Jordan Decomposition 14. Singular value Decomposition and CS Decomposition [Preparation/Review] Before each class, prepare by studying the lecture materials and the relevant textbook pages for the content indicated in the course plan. Also, complete any unfinished exercises (within the day of the class, or) until the next class. The typical preparation/review time per session (100 min.) is 3-5 hours. |
| 教科書 ／Textbook(s) |
池辺八洲彦、池辺淑子、浅井信吉、宮崎佳典、現代線形代数 -分解定理を中心として-、共立出版、２００９ G. H. Golub, C. F Van Loan, Matrix Computations, The Johns Hopkins University Press, 1996 |
| 成績評価の方法・基準 ／Grading method/criteria |
Class activity, quizzes, and/or reports |
| 履修上の留意点 ／Note for course registration |
Knowledge on the following classes are needed: Linear Algebras I, II Numerical Analysis |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
ASAI Nobuyoshi |
| 担当教員名 ／Instructor |
ASAI Nobuyoshi |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
Linear Algebras I, II Numerical Analysis |
| 更新日／Last updated on | 2026/02/03 |
|---|---|
| 授業の概要 ／Course outline |
This is a topics course: several recent topics of numerical computation will be selected and discussed in detail. ・Elements of the Hilbert space. ・The eigenvalue problem for infinite matrices. ・Application to the special function computation. ・Visualization. ・Introduction to high-performance computing. Case studies include introduction to important software packages and the Internet usage. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
To study some application of functional analysis to numerical computation. |
| 授業スケジュール ／Class schedule |
1. Elements of the Hilbert space(1)
2. Elements of the Hilbert space(2)
3. The eigenvalue problem for infinite matrices(1)
4. The eigenvalue problem for infinite matrices(2)
5. The eigenvalue problem for infinite matrices(3)
6. The eigenvalue problem for infinite matrices(4)
7. Application to the special function computation(1)
8. Application to the special function computation(2)
9. Application to the special function computation(3)
10. Application to the special function computation(4)
11. Visualization(1)
12. Visualization(2)
13. Introduction to high-performance computing(1)
14. Introduction to high-performance computing(2) [Preparation/Review] Before each class, prepare by studying the lecture materials and the relevant textbook pages for the content indicated in the course plan. Also, complete any unfinished exercises (within the day of the class, or) until the next class. The typical preparation/review time per session (100 min.) is 3-5 hours. |
| 教科書 ／Textbook(s) |
A. E. Taylor, D. C. Lay, Introduction to Functional Analysis, Kriger Pub., 1980
G. F. Simmons, Introduction to Topology and Modern Analysis, Mc-Graw Hill, 1963 |
| 成績評価の方法・基準 ／Grading method/criteria |
Quizzes, activities and/or reports. |
| 履修上の留意点 ／Note for course registration |
Knowledge on the following classes are needed: Linear Algebras I, II Numerical Analysis |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
池辺八洲彦、池辺淑子、浅井信吉、宮崎佳典、現代線形代数 -分解定理を中心として-、共立出版、２００９ 池辺八洲彦、稲垣敏之、数値解析入門、昭晃堂、１９９４ |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 3学期 ／Third Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
HAMADA Mohamed |
| 担当教員名 ／Instructor |
HAMADA Mohamed |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
Discrete Mathematics |
| 更新日／Last updated on | 2026/02/03 |
|---|---|
| 授業の概要 ／Course outline |
This course gives students advanced topics in the theory of automata and languages. The characterization of language classes, which is one of the most important themes in the formal language theory, will be introduced. Especially, the homomorphic characterizations of language classes will be discussed in detail. Moreover, some applications of formal language theory will be discussed. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
Students can be familiar to the automata and languages and recognize the importance of the theory of automata and languages, and have enough knowledge to read and understand advanced papers in this field completely. |
| 授業スケジュール ／Class schedule |
1. Introduction and background 2. Review of the theory of automata and languages 3. Methods to describe infinite sets 4. Grammars as generating systems of infinite sets 5. Automata as recognizing systems of infinite sets 6. Chomsky hierarchy of language classes 7. Relation among grammars and automata 8. Midterm exam or report 9. Topics on the theory of automata and languages 10. Subclasses languages defined by automata with restrictions 11. Subclasses languages defined by grammars with restrictions 12. Operations on languages 13. Homomorphic characterization of language classes 14. Applications of the theory of automata and languages |
| 教科書 ／Textbook(s) |
We do not specify textbooks but introduce books related to the topics in the class. Various materials will be prepared. |
| 成績評価の方法・基準 ／Grading method/criteria |
1. Class activities: 14% 2. Exercise: 26% 3. Midterm exam/Report: 25% 4. Final exam: 35% |
| 履修上の留意点 ／Note for course registration |
Automata theory |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
There are so many good textbooks in this field. Some of them will be introduced in the class and some are given here for students' convenience. J. Hopcroft, J. Ullman: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979. A. Meduna: Automata and Languages, Theory and Applications, Springer, 1999. P. Linz: An Introduction to Formal Languages and Automata(3 ed.), Jones and Bartlett, 2001. J. L. Hein: Theory of Computation, An Introduction, Jones and Bartlett, 1996. M. Sipser: Introduction to the Theory of Computation, PWS Publishing Co., 1996. N. Pippenger: Theories of Computability, Cambridge Univ. Press, 1997. R. Greenlaw, H. J. Hoover: Fundamentals of the Theory of Computation, Principles and Proctice, Morgan Kaufmann Pub. Inc., 1998. A. Maruoka, Concise Guide to Computation Theory, Springer, 2011. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 1学期 ／First Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
WATANABE Shigeru |
| 担当教員名 ／Instructor |
WATANABE Shigeru |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/01/08 |
|---|---|
| 授業の概要 ／Course outline |
The purpose of this course is to give ideas of advanced analysis for students who have deep understanding for the undergraduate level mathematics (Fourier analysis, complex analysis, general topology). |
| 授業の目的と到達目標 ／Objectives and attainment goals |
Students will be able to understand Fourier analysis as an introductory theory of function spaces. Students will be able to understand an introduction to the theory of Hilbert spaces. Students will be able to understand an introduction to special functions, and Fourier expansions by orthogonal polynomials. |
| 授業スケジュール ／Class schedule |
1-2. Reviews of undergraduate mathematics 3-6. Introductory theory of function spaces 7-10. Introduction to functional analysis 11-14. Fourier expansions by orthogonal polynomials |
| 教科書 ／Textbook(s) |
Non |
| 成績評価の方法・基準 ／Grading method/criteria |
Reports 100% |
| 履修上の留意点 ／Note for course registration |
Prerequisites: Fourier analysis, complex analysis, general topology |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 3学期 ／Third Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
ASAI Kazuto |
| 担当教員名 ／Instructor |
ASAI Kazuto |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/01/15 |
|---|---|
| 授業の概要 ／Course outline |
Course implementation methods: Combination of face-to-face classes and remote classes In this class, we deal with various topics arising from pure and applied mathematics concerning Algebraic Systems and Combinatorics. This year, we focus mainly on the theory of finite fields in the area of Algebraic Systems. The finite field F_q --- a field with finite (q) elements --- was first found by E. Galois, and so it is often called a Galois field GF(q). The structure of F_q as a field is uniquely determined by the number of elements q, and for the existence of F_q, it is necessary and sufficient for q to be a power of a prime p. Beginning with polynomial rings, we overview the following: prime fields, finite polynomial fields, field extensions, splitting fields, structure of finite fields, primitive elements, Frobenius cycles, cyclotomic polynomials, and functions between finite fields. When we consider numbers, they are often supposed to be real or complex numbers. But here, we shall contact with more abstract numbers, rings, and fields, to develop the ability of mathematical and abstract thinking. Finite fields are purely mathematical objects. For example, mathematicians often try to extend or modify the theory over real/complex numbers to the one over finite fields in their researches. Finite fields, however, have many application such as theory of experimental design, codes, and logical circuits, etc, which is the reason why the finite fields are very important objects for both of Scientists and Engineers. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
Polynomial rings, Prime fields, Positive characteristic, Homomorphisms and isomorphisms, Field extension, Splitting fields, Uniqueness of the q-element field, Structure of finite fields, Primitive elements, Frobenius cycles, and Cyclotomic polynomials. |
| 授業スケジュール ／Class schedule |
1. Polynomial rings. 2. Prime fields F_p. 3. Homomorphisms and isomorphisms. 4. Finite polynomial fields and field extensions. 5--6. Finite fields. 7--8. Structure of finite fields. 9--10. Primitive elements. 11--12. Frobenius cycles. 13--14. Cyclotomic polynomials. |
| 教科書 ／Textbook(s) |
1. Handout: Algebraic systems and combinatorics: -- Finite fields --, by K. Asai 2. Introduction to Finite Fields and Their Applications, Revised ed. (1994), Cambridge University Press, by R. Lidl, H. Niederreiter 3. Finite Fields (Encyclopedia of Mathematics and its Applications) (1997), Cambridge University Press, by R. Lidl, H. Niederreiter 4. Kumiawaserironto Sonoouyou (1979), Iwanami Zensho 316, by I. Takahashi (in Japanese) |
| 成績評価の方法・基準 ／Grading method/criteria |
Report:80％ Presentation:20% |
| 履修上の留意点 ／Note for course registration |
Related courses: Applied Algebra, Linear Algebra I,II. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Home page for the class: http://web-ext.u-aizu.ac.jp/~k-asai/classes/class-texts.html |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 3学期 ／Third Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
HONMA Michio |
| 担当教員名 ／Instructor |
HONMA Michio |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/01/15 |
|---|---|
| 授業の概要 ／Course outline |
This course deals with several basic problems in natural sciences in order to show how the information theory and various computational methods are utilized in the analysis of practical systems. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
At the end of the course the students should be able to: (1) explain the importance and advantages of various numerical methods in the analysis of physical systems. (2) design a suitable model and write a program for solving practical problems. |
| 授業スケジュール ／Class schedule |
(1) Introduction - Numerical derivative, integral, and root finding - Exercise 1 (2) Differential equation 1 - Initial value problem - Exercise 2 (3) Differential equation 2 - Boundary value problem - Exercise 3 (4) Matrix manipulation 1 - Matrix inversion - Exercise 4 (5) Matrix manipulation 2 - Eigenvalue problem - Exercise 5 (6) Monte Carlo method 1 Random numbers and sampling of random variables - Exercise 6 (7) Monte Carlo method 2 Monte Carlo integrals and simulations - Exercise 7 |
| 教科書 ／Textbook(s) |
Lecture materials will be provided on the LMS. |
| 成績評価の方法・基準 ／Grading method/criteria |
Reports (100%) Students should submit a report on the problem given in each exercise class. |
| 履修上の留意点 ／Note for course registration |
Prerequisites: Students should have some experience and knowledge of basic physics (classical mechanics, electricity and magnetism, quantum mechanics, statistical mechanics) and programming. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
(1) An introduction to computer simulation methods : applications to physical systems 2nd ed. Harvey Gould and Jan Tobochnik Addison-Wesley, c1996 (2) Computational physics : FORTRAN version Steven E. Koonin and Dawn C. Meredith Addison-Wesley, c1990 |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 3学期 ／Third Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
FUJITSU Akira |
| 担当教員名 ／Instructor |
FUJITSU Akira |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/02/10 |
|---|---|
| 授業の概要 ／Course outline |
This course provides fundamental comcepts in high energy particle physics. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
At the end of the course the students should: 1. have basic knowledge of high energy physics 2. know how to use computer to study theory of high energy physics |
| 授業スケジュール ／Class schedule |
Lecture schedule 1. Elementary particle physics 2. Special relativity 3. General relativity 4. Quantum mechanics 5. Quantum field theory 6. Planck mass and Hawking radiation 7. DIrac equation for spinors 8. Dirac equation and Pauli's principle 9. Supersymmetry 10. Gauge symmetry and BRST quantiztion 11. Bosonic string 12. Bosonic string and Virasoro algebra 13. Superstring and Super Virasoro algebra 14. Superstring models for elemntary particles |
| 教科書 ／Textbook(s) |
Handout will be provided in LMS. |
| 成績評価の方法・基準 ／Grading method/criteria |
Students must submit a report for every lecture. They should write questions in their reports. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Office hour: Monday, Thursday 1,2,3,4 period |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 3学期 ／Third Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
NARUSE Keitaro |
| 担当教員名 ／Instructor |
NARUSE Keitaro, TSUCHIYA Takahiro |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
None. |
| 更新日／Last updated on | 2026/02/06 |
|---|---|
| 授業の概要 ／Course outline |
This is a graduate school course on stochastic processes and applications. We focus on several classes of elementary stochastic processes which are often used in various applications: random walks, branching processes, discrete Markov chains and, time permitting, the Poisson process and Brownian motion. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
The student will get acquainted with mathematical tools and techniques, as well as the probabilistic intuition necessary for understanding and successful use of stochastic models in a variety of applications within mathematics and in science, engineering, economics, etc. He/she will also learn how to build new models, in yet-unencountered situations and novel frameworks. |
| 授業スケジュール ／Class schedule |
Each class will be conducted in lecture format. 1 Probability Review 2 Stochastic Processes 3 Simple Random Walk: Theory 4 Simple Random Walk: Implementation 5 Random Walks - Advanced Methods 6 Kalman Filter 7 Branching Processes 8 Markov Chains: Theory 9 Markov Chains: Implementation 10 Classification of States 11 Absorption and reward 12 Stationary and Limiting Distributions 13 Robotic applications 14 Wrap up [Preparation/Review] Preparation: Before each class, prepare by studying the lecture materials as well as implementing sample codes for the content indicated in the course plan. Review: Complete any unfinished exercises until the next class, as well as extra probelms and analysis shown in classes. The typical preparation/review time per session is 4–5 hours. |
| 教科書 ／Textbook(s) |
None, lecture notes will be delivered in classes. |
| 成績評価の方法・基準 ／Grading method/criteria |
By assignments. |
| 履修上の留意点 ／Note for course registration |
None. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
LMS |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
YEN Neil Yuwen |
| 担当教員名 ／Instructor |
YEN Neil Yuwen, PEI Yan |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/02/02 |
|---|---|
| 授業の概要 ／Course outline |
Human-centered computing (HCC) is the science of decoding human behavior. It discusses a computational approaches to understand human behavior all aspects of human beings. However, the complexity of this new domain necessitates alterations to common data collection and modeling techniques. This course covers the techniques that underlie the state-of-the-art systems in this emerging field. Students will develop a critical understanding of human-centered computing including fundamentals, approaches and applications/services. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
This course aims at instructing our students (especially master students) the fundamentals of human-centered computing. Through this course, students are expected to: 1) cultivate interdisplinary thinking skills; 2) be able to build systems that combine technologies with organizational designs; 3) understand the human, and translate the human needs to real-world systems. |
| 授業スケジュール ／Class schedule |
This course will give an introduction that covers a wide range of theories, techniques, applications to the well-designed human-computer systems. Examples and academic papers on HCC researches (to each topics above) will be distributed to students who are enrolled in this class. Students will be grouped and make presentation on distributed research papers, and trained to ask questions and provide personal opinions on specific studies. The schedule may be adjusted according to actual conditions. In that case, we will contact you separately. Remote / Online course may be conducted if necessary. |
| 教科書 ／Textbook(s) |
No specific textbook will be used for this course. Slides and handouts will be prepared by instructors, according to the references (see below), and available on the course website for download. Papers, news, and videos related to the theme will be selected from top-rank academic publications (e.g., IEEE/ACM/IEICE Transactions and SCI-indexed peer-reviewed journals), and the Internet (e.g., with copyright permission) will be taught during the classes. |
| 成績評価の方法・基準 ／Grading method/criteria |
Presentation: 30% Report: 70% Please note that the proportion of above grading criteria may be adjusted according to actual conditions. |
| 履修上の留意点 ／Note for course registration |
All the topics will be taught through the reading of past high quality studies. Students are expected to cultivate independent reading ability. The reports and the attendance are also considered very important factors to evaluate the learning performance. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Witold Pedrycz, Fernando Gomide (2007). Fuzzy Systems Engineering: Toward Human-Centric Computing Wiebe Bijker, Of Bicycles, Bakelites, and Bulbs: Toward a Theory of Sociotechnical Change (Inside Technology) Clifford Geertz, The Interpretation Of Cultures (Basic Books Classics) The Presentation of Self in Everyday Life Victor Kaptelinin and Bonnie Nardi, Acting with Technology: Activity Theory and Interaction Design Guy A. Boy (2011). The Handbook of Human-machine Interaction: A Human-centered Design Approach |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 3学期 ／Third Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
HAMEED Saji N. |
| 担当教員名 ／Instructor |
HAMEED Saji N., NAKASATO Naohito |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/01/28 |
|---|---|
| 授業の概要 ／Course outline |
This course provides an introduction to parallel computing including parallel architectures and parallel programming techniques. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
The students will learn the basic parallel programming models including shared memory and distributed memory models. Parallel programming using MPI a will be a main focus. The course will heavily involve coding projects and weekly assignments. |
| 授業スケジュール ／Class schedule |
1. Introduction to Parallel Architecture 2. Introduction to Parallel Programming 3. Performance considerations 4. Programming in MPI 5. Programming in OpenMP |
| 教科書 ／Textbook(s) |
Numerical Analysis for Engineers and Scientists, G. Miller, Cambridge University Press Parallel Programming with MPI, P.S. Pachebo, Morgan Kaufmann Publishers Parallel Programming in C with MPI and OpenMP, M. J. Quinn, McGraw-Hill |
| 成績評価の方法・基準 ／Grading method/criteria |
Assignments = 30%, Project = 20%, Exam = 50% |
| 履修上の留意点 ／Note for course registration |
Computer architecture, mathematics, algorithms and programming Students are expected to have good skills in C or Fortran programming to take this course. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
http://pages.tacc.utexas.edu/~eijkhout/istc/istc.html |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 3学期 ／Third Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
RAGE Uday Kiran |
| 担当教員名 ／Instructor |
RAGE Uday Kiran |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/02/10 |
|---|---|
| 授業の概要 ／Course outline |
This course provides an in-depth study of advanced pattern mining techniques for extracting meaningful knowledge from large, complex, and heterogeneous datasets. Pattern mining plays a central role in data science, big data analytics, and knowledge discovery, enabling the identification of regularities, trends, and relationships hidden in data. The course goes beyond classical frequent pattern mining and focuses on advanced and emerging topics, including maximal and closed pattern mining, periodic and temporal patterns, uncertain and fuzzy pattern mining, high-utility pattern mining, sequence and graph patterns, and scalable pattern mining for big data environments. Emphasis is placed on both theoretical foundations (formal definitions, properties, and complexity issues) and practical algorithm design, enabling students to understand how state-of-the-art pattern mining algorithms are developed, optimized, and applied to real-world datasets. A “Learn by Doing” approach is adopted. Each topic is introduced through conceptual explanations and algorithmic analysis, followed by hands-on exercises involving implementation, experimentation, and evaluation on real or benchmark datasets. Each class consists of one lecture period and two exercise/seminar periods, promoting active learning, discussion, and research-oriented thinking. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
Objectives Modern applications generate massive volumes of transactional, temporal, and uncertain data. Classical pattern mining techniques often fail to handle scalability, redundancy, and complexity issues arising in such data. Advanced pattern mining techniques have emerged to address these challenges. This course aims to equip students with advanced analytical and algorithmic skills required to design, analyze, and apply modern pattern mining methods in research and industrial settings. Attainment Goals By the end of this course, students will be able to: Formally define and analyze different types of patterns and pattern constraints Design and evaluate advanced frequent, closed, and maximal pattern mining algorithms Mine patterns from temporal, sequential, and uncertain datasets Apply fuzzy and high-utility pattern mining techniques Analyze algorithmic complexity and scalability issues Implement and experimentally evaluate pattern mining algorithms Critically read and present recent research papers in pattern mining |
| 授業スケジュール ／Class schedule |
Course Content and Methods Each session includes a lecture focusing on theoretical foundations and algorithms, followed by exercise and seminar sessions involving algorithm implementation, experimentation, paper discussion, or case studies. Exercises are conducted individually or in small groups. Selected sessions involve student-led paper presentations. Schedule (14 Sessions) Session 1 Lecture: Introduction to pattern mining and knowledge discovery Exercise: Review of classical frequent pattern mining algorithms Session 2 Lecture: Pattern types, measures, and constraints Exercise: Constraint-based pattern mining examples Session 3 Lecture: Closed and maximal pattern mining Exercise: Implementation and comparison of closed vs maximal mining Session 4 Lecture: Redundancy reduction and pattern condensation Exercise: Experimental evaluation of pattern reduction techniques Session 5 Lecture: Periodic and cyclic pattern mining Exercise: Mining periodic patterns from temporal data Session 6 Lecture: Sequential pattern mining Exercise: Sequence pattern extraction and analysis Session 7 Lecture: Temporal and interval-based pattern mining Exercise: Mining patterns from time-interval data Session 8 Lecture: Uncertain data and probabilistic pattern mining Exercise: Mining patterns from uncertain databases Session 9 Lecture: Fuzzy pattern mining Exercise: Design and evaluation of fuzzy frequent patterns Session 10 Lecture: High-utility pattern mining Exercise: Utility-based pattern extraction Session 11 Lecture: Pattern mining in big data environments Exercise: Scalability analysis and optimization strategies Session 12 Lecture: Pattern mining in data streams and dynamic data Exercise: Incremental and online pattern mining Session 13 Lecture: Recent research trends in pattern mining Exercise: Student paper presentations and discussions Session 14 Lecture: Integrated case studies and open research problems Exercise: Project discussion and future research directions Pre-class and Post-class Learning Students are expected to read assigned research papers or textbook chapters before each session and complete implementation or analysis tasks after class. Typical out-of-class study time per session: 5–7 hours, including reading, coding, experimentation, and report preparation. |
| 教科書 ／Textbook(s) |
Data Mining: Concepts and Techniques, Jiawei Han, Micheline Kamber, Jian Pei Frequent Pattern Mining, Charu C. Aggarwal Mining of Massive Datasets, Anand Rajaraman, Jeffrey Ullman, Jure Leskovec |
| 成績評価の方法・基準 ／Grading method/criteria |
Student performance is evaluated based on: Quizzes and short tests: 20% Programming assignments / experiments: 30% Paper presentation and seminar participation: 20% Final project or examination: 30% Attendance is not included in grading criteria. |
| 履修上の留意点 ／Note for course registration |
Attendance is mandatory. Students must maintain at least 75% attendance to be eligible for course completion. Failure to satisfy the attendance requirement will result in failure of the course, regardless of academic performance. Prior knowledge of Data Mining, Algorithms, and Database Systems is strongly recommended. Familiarity with Python or Java is desirable. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 4学期 ／Fourth Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
SU Chunhua |
| 担当教員名 ／Instructor |
SU Chunhua, KACHI Yasuyuki |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
MA01–2 Linear Algebra I, II (undergraduate), MA03–4 Calculus I, II (undergraduate), or equivalent. |
| 更新日／Last updated on | 2026/02/06 |
|---|---|
| 授業の概要 ／Course outline |
This is a unique course co-taught by a cryptographer and a pure-mathematician. Kachi (mathematician) teaches the first half and Su (cryptographer) teaches the second half. From the mathematical side we cherry-pick topics that give a good account of themselves within pure-math (commensurate in quality to rival graduate schools’ math programs), with an eye towards its application to post-quantum cryptography. Jacobi sums proved to have applications in primality testing of large integers (à la Adleman–Pomerance–Rumely). The latter is of immense importance in RSA, albeit it is a ‘pre’-quantum public key algorithm. We are naturally prompted to recalibrate the theory of Jacobi sums in hope it might potentially yield an algorithm of cryptographic significance specifically in the ‘post’-quantum context. In that spirit we cover the theory of sums of roots of unity (Gauss sums, Jacobi sums), incorporating the ideas from discrete Fourier analysis. From the cryptography side we gear the course towards post-quantum cryptography: Brief introduction to cryptography (encryption, security, public key cryptography, computational complexity); introduction to post-quantum cryptography; q-linear-code-based encryption scheme; multivariate quadratic cryptosystem; lattice-based cryptosystem; isogeny-based cryptography, and quantum Fourier analysis. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
This is a unique course co-taught by a cryptographer and a pure-mathematician. Kachi (mathematician) teaches the first half and Su (cryptographer) teaches the second half. From the mathematical side we cherry-pick topics that give a good account of themselves within pure-math (commensurate in quality to rival graduate schools’ math programs), with an eye towards its application to post-quantum cryptography. Jacobi sums proved to have applications in primality testing of large integers (à la Adleman–Pomerance–Rumely). The latter is of immense importance in RSA, albeit it is a ‘pre’-quantum public key algorithm. We are naturally prompted to recalibrate the theory of Jacobi sums in hope it might potentially yield an algorithm of cryptographic significance specifically in the ‘post’-quantum context. In that spirit we cover the theory of sums of roots of unity (Gauss sums, Jacobi sums), incorporating the ideas from discrete Fourier analysis. From the cryptography side we gear the course towards post-quantum cryptography: Brief introduction to cryptography (encryption, security, public key cryptography, computational complexity); introduction to post-quantum cryptography; q-linear-code-based encryption scheme; multivariate quadratic cryptosystem; lattice-based cryptosystem; isogeny-based cryptography, and quantum Fourier analysis. |
| 授業スケジュール ／Class schedule |
Part I. 1. Introduction. -Basic Number Theory and Public key encryption 2. Crash course on Fourier transforms and others (classical Fourier analysis). -Revisiting the axiomatic definition of differentiations within the framework of Fourier transforms, with an eye towards fractional derivatives. -General linear group acting on the polynomial ring. -Invariant subring of the polynomial ring by a finite group action. -Some nitty-gritty on Galois theory. -Tensor representations (Kronecker’s tensor product). -Finite abelian covers of the affine space An arising from Galois groups that mesh well with the theory of Gauss–Jacobi sums. 3. Quantum Computing – Basics of Quantum Computing – Shor’s Algorithm – Finite Field Operations – Karatsuba and Number Theoretic Transformation Based Multiplication – Montgomery Multiplication Part II. 4. Lattice Based Cryptography – Basics of lattice based cryptpgraphy – NewHope, Kyber and Saber (NIST post-quantum candidates) – NTRU, NTRU Prime – Digital Signature Algorithm: Dilithium, Falcon 5. Code Based Cryptography – Classic McEliece – HQC 6. Isogeny Based Cryptography – Supersigular Isogeny based Key Exchange (SIKE) – Digital Signature Algorithm based on Isogeny |
| 教科書 ／Textbook(s) |
Post-Quantum Cryptography by Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen https://link.springer.com/book/10.1007/978-3-540-88702-7 |
| 成績評価の方法・基準 ／Grading method/criteria |
The grading is based on reports(50%) and final presentation(50%). |
| 履修上の留意点 ／Note for course registration |
Prerequisite: MA01–2 Linear Algebra I, II (undergraduate), MA03–4 Calculus I, II (undergraduate), or equivalent. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Prerequisite: MA01–2 Linear Algebra I, II (undergraduate), MA03–4 Calculus I, II (undergraduate), or equivalent. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 4学期 ／Fourth Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
VIGLIETTA Giovanni |
| 担当教員名 ／Instructor |
VIGLIETTA Giovanni |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
Prerequisites: FU01 Algorithms and Data Structures I (undergraduate), or equivalent. FU03 Discrete Systems (undergraduate), or equivalent. Optional: FU09 Algorithms and Data Structures II (undergraduate), or equivalent. SEA01 Parallel Distributed & Internet Computing (graduate), or equivalent. |
| 更新日／Last updated on | 2026/01/19 |
|---|---|
| 授業の概要 ／Course outline |
This course provides an introduction to modern algorithmic aspects of distributed systems, with a special focus on decentralized networks. In such networks, resources and data are distributed across multiple devices that collaborate towards a common goal. Examples include peer-to-peer networks of smartphones, wireless sensor networks, or blockchain networks. We will define an abstract model of communication network and study the design and analysis of general algorithmic solutions to common problems, such as Leader Election and Consensus. The course begins with basic scenarios and solutions, progressively tackling more complex situations, including networks with dynamic topologies, anonymous agents, congested channels, and corrupt messages. Building on classical algorithms, the course gradually incorporates cutting-edge techniques and data structures, with particular emphasis on history trees. This course serves as a valuable complement to offerings in the field of Computer Network Systems by focusing specifically on the theory of distributed computing, rather than delving into software engineering aspects. Although it is designed to be self-contained, students who have completed SEA01 Parallel Distributed & Internet Computing (or equivalent courses) will find that this course develops the subject from systems with shared memory to general distributed systems. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
We cover fundamental aspects of the theory of distributed computing, with emphasis on anonymous dynamic networks and the history tree data structure. Goals: 1. Learn basic network models and paradigms, as well as their relationships with real-world distributed systems. 2. Master traditional algorithmic techniques for static networks, and learn how to analyze simple distributed algorithms in various network scenarios. 3. Learn advanced data structures such as history trees, and understand how to apply them to complex distributed systems such as anonymous, dynamic, and congested networks. |
| 授業スケジュール ／Class schedule |
1. Introduction to distributed algorithms and basic network models. 2. Computation in simple static networks such as rings and trees. 3. Basic algorithms for anonymous static networks. 4. History trees: definition and fundamental properties. 5. Basic applications of history trees to anonymous dynamic networks. 6. Applications of history trees to directed networks. 7. Streaming algorithms, port awareness, and disconnected networks. 8. Examples, counterexamples, and lower bounds. 9. Basic termination detection techniques in dynamic networks. 10. Termination in dynamic networks with multiple leaders. 11. Self-stabilization and fault tolerance. 12. Finite-state stabilization. 13. Universal computation in congested networks. 14. New frontiers and open research problems. |
| 教科書 ／Textbook(s) |
N. Santoro, "Design and Analysis of Distributed Algorithms". John Wiley & Sons, 2007. |
| 成績評価の方法・基準 ／Grading method/criteria |
Final Exam. |
| 履修上の留意点 ／Note for course registration |
Students are expected to have a strong familiarity with elementary graph theory and discrete mathematics, algorithm design and analysis, and basic data structures. Some knowledge of network algorithms and parallel and distributed computing is preferred but not required. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
[1] N. Santoro, "Design and Analysis of Distributed Algorithms". John Wiley & Sons, 2007. [2] Computing in Anonymous Dynamic Networks Is Linear Giuseppe A. Di Luna and Giovanni Viglietta, FOCS 2022 https://giovanniviglietta.com/papers/anonymity.pdf [3] History Trees and Their Applications Giovanni Viglietta, SIROCCO 2024 https://giovanniviglietta.com/papers/historytree.pdf [4] Lecture notes provided by the instructor. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
NAKAMURA Akihito |
| 担当教員名 ／Instructor |
NAKAMURA Akihito, WATANABE Yodai, SU Chunhua |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/02/03 |
|---|---|
| 授業の概要 ／Course outline |
Today's computing environment encompasses a wide range of devices, including smartphones, portable/desktop PCs, server computers, IoT devices, and virtual machines on cloud computing platforms. Information security technology is essential to leverage these capabilities while preventing accidents and cyberattacks, enabling the secure processing and communication of diverse data types. This course covers the fundamental concepts and technologies of information security. It also introduces cutting-edge technologies and mechanisms. [keywords] authentication, vulnerability, cyberattack, OS and IoT, public key encryption |
| 授業の目的と到達目標 ／Objectives and attainment goals |
[Objectives] To maximize the functionality and performance of information systems and prevent accidents and cyberattacks, knowledge of information security is essential. This course covers fundamental and advanced knowledge of information security. [Attainment Goals] - Students will acquire fundamental and advanced knowledge of information security concepts and technologies, enabling them to apply this knowledge to software and system design and implementation. - Students will understand the principles of information security management and apply them to practical tasks such as system operations. |
| 授業スケジュール ／Class schedule |
Each class session will be conducted in a lecture format. During class, students will occasionally present quiz answers orally for discussion and solve practice problems to deepen their understanding of the course content. 1, 2. Fundamentals - Goal of information security - Risk, threat, vulnerability, and control - Confidentiality, integrity, availability (C-I-A) triad - Attack paradigm and protection paradigm - Authentication and password 3, 4. Vulnerability - Classes of vulnerabilities - Trends of vulnerability - Vulnerability management - Open standards for vulnerability management 5, 6. Cyberattacks and Controls - DoS and DDoS attacks - Password cracking - Risks of Web applications 7, 8. Security Notions for Public Key Encryption Schemes - Definition of public key encryption schemes - Security goals: Semantic security (SS), Indistinguishability (IND), Non-malleability (NM) - Attacking models: Chosen plaintext attack (CPA), Chosen ciphertext attack (CCA1, CCA2) 9, 10. Relation among Security Notions - Equivalence between SS and IND - NM implies IND, IND-CCA2 implies NM-CCA2 11, 12. Cryptography for IoT Security and Privacy - Cryptography for IoT - Side channel attacks - Authentication by IoT 13, 14. System Security - OS security - Password and access control - FinTech security [Preparation/Review] To maximize learning effectiveness, students should review the relevant sections of the lecture and reference materials and complete preparatory work on the content outlined in the class schedule before attending class. Additionally, students should use the materials or resources they have obtained themselves to review the class content. The recommended time for preparation and review per session is 3 to 5 hours. |
| 教科書 ／Textbook(s) |
No textbook. |
| 成績評価の方法・基準 ／Grading method/criteria |
Method: assignments (reports) 100% Criteria: - Correctness for computational problems - Relevance, quality, presentation, and originality of essays |
| 履修上の留意点 ／Note for course registration |
- Lecture materials will be distributed via the LMS and the university's internal web server. - Late submission of reports will result in point deductions. - The course assumes a basic knowledge of mathematical logic and probability. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
- Office hours: Accepted individually via email, etc., and handled on a case-by-case basis. - The course instructor, Akihito Nakamura, has practical experience: He worked at AIST (National Institute of Advanced Industrial Science and Technology) for 20 years, where he was involved in R&D in information security and cloud computing. Based on his experience, he equips students with the advanced technical knowledge of information security. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 4学期 ／Fourth Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
LI Xiang |
| 担当教員名 ／Instructor |
LI Xiang, SU Chunhua |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/01/26 |
|---|---|
| 授業の概要 ／Course outline |
Signal processing is a fundamental theory and technique in the construction of modern information systems. Over the past half-century, numerous theories and methods have been proposed and extensively studied in this field. This core course begins with a review of the fundamentals of discrete-time signals and systems. Key topics include the concept and classification of discrete-time signals, signal representations in time, frequency, z-domain, and discrete frequency domain, as well as system representation, analysis, and filter design. The course then shifts focus to stochastic signals and systems, expanding beyond the deterministic signals and systems covered in the undergraduate course “Signal Processing and Linear Systems.” Topics explored include estimation theory, random signal modeling, characterization of stochastic signals and systems, nonparametric estimation, adaptive signal processing, and Kalman filtering. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
This course is designed as a fundamental core course for graduate students across all fields of information systems. It provides a comprehensive methodology for fundamental signal processing and introduces advanced topics, with a particular focus on the statistical characteristics of signals and their application in more sophisticated processing techniques. In addition, the course covers the practical implementation of signal processing methods using computer programming. Finally, students will explore real-world applications, such as noise cancellation, system identification, and Kalman filtering. |
| 授業スケジュール ／Class schedule |
1) Introduction 2) Linear, time-invariant systems, impulse response and convolution sum 3) Fourier transform, frequency response and sampling theorem 4) The z-transform and its properties, the inverse z-transform 5) Differential equation, transfer function and system stability 6) Discrete Fourier transform (DFT), Fast Fourier transform (FFT) 7) Finite Impulse Response (FIR) filters and Infinite Impulse Response (IIR) filters 8) Fundamentals of discrete-time signal processing 9) Random variables, sequences, and stochastic process 10) Spectrum estimation 11) Optimum linear filters, Wiener filter 12) Least-squares filtering and prediction, adaptive filters 13) Algorithms and structures for optimum linear filters 14) Kalman filter |
| 教科書 ／Textbook(s) |
[1] Lecture notes prepared by the instructor. [2] Applied Digital Signal Processing: Theory and Practice. Dimitris G Manolakis and Vinay K. Ingle. Cambridge University Press, 2011, ISBN: 9780521110020. [3] Signals and Systems (2nd Edition), Alan V. Oppenheim, Alan S. Willsky and S. Hamid, Pearson, 1997, ISBN: 0138147574. |
| 成績評価の方法・基準 ／Grading method/criteria |
Homeworks (35%) Quizzes (15%) Final Report (50%) |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
[1] Applied Digital Signal Processing: Theory and Practice. Dimitris G Manolakis and Vinay K. Ingle. Cambridge University Press, 2011, ISBN: 9780521110020. [2] Signals and Systems (2nd Edition), Alan V. Oppenheim, Alan S. Willsky and S. Hamid, Pearson, 1997, ISBN: 0138147574. [3] Statistical and Adaptive Signal Processing, Dimitris G. Manolakis et al. Boston: McGraw-Hill, 2000, ISBN: 163081203X. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 3学期 ／Third Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
TSUCHIYA Takahiro |
| 担当教員名 ／Instructor |
TSUCHIYA Takahiro, HASHIMOTO Yasuhiro, WATANABE Yodai |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/01/29 |
|---|---|
| 授業の概要 ／Course outline |
This course provides advanced contents of applied statistics. Most important statistical methods are explained with many examples of data. At the same time, their mathematical foundations are given. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
Students can understand basic applied statistics such as estimation, test, regression, and analysis of variance by using Gaussian, t, F, and chi-square distributions. Moreover, they can learn knowledge on stochastic processes. |
| 授業スケジュール ／Class schedule |
The course contains following topics with 3-4 hours for each including lecture and practical exercises. Module 0: Measure-Theoretic Toolkit for Learning: - A fundamental set theory - Improper integral - linear algebra Module 1: Probability Spaces and Random Variables - The intuitive meaning of Probability model; Sample space, point of omega, Event as measurable set, the probability of an event. - measurable and sigma algebra - measure theory and probability triple - Random variables - Distribution functions; pmfs, pdfs - A first transformation rule for pdfs Module 2: Expectation as a Linear Functional - Expectation \$ |mathbb $\{E\} \$$ - Variance and Covariance - Integrable space $ L^ p $ - Correlation coefficient, MSE - Variance of a sum Module 3: Sample Means and the Central Limit Theorem - Red and white balls - sample space, prior probabilities likelihood - Bayes' theorem - Red and White ball example again*. - Independence - Law of large numbers - Unbiased Estimator of Sample Variance. - Using the sample median quantiles in statistics - Strong Law of Large Numbers - Empirical Distribution Function Module 4: Linear Models and Ordinary Least Squares - An application: Regression - Linear least squares: ordinary least squares - The true coefficient via Central limit theorem Module 5: Case Study Module 6: High-Dimensional Statistics for Learning - Covariance, - Shrinkage - L2-norm Ridge and L1-norm Lasso |
| 教科書 ／Textbook(s) |
Class materials will be distributed. |
| 成績評価の方法・基準 ／Grading method/criteria |
Reports 50％, Quiz 50%. |
| 履修上の留意点 ／Note for course registration |
Courses preferred to be learned prior to this course : Calculus, Linear algebra, Probability, Information theory. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Weighing the Odds: A Course in Probability and Statistics (English Edition) W. Feller, An Introduction to Probability Theory, Vol.1, (Wiley) |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 1学期 ／First Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
YAMAGAMI Masayuki |
| 担当教員名 ／Instructor |
YAMAGAMI Masayuki, ASAI Nobuyoshi |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/01/08 |
|---|---|
| 授業の概要 ／Course outline |
This course provides basic knowledge of quantum information and quantum computations for graduate students who want to learn modern information and computational models. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
At the end of the course, students can acquire 1) Basin knowledge of quantum mechanics for quantum information theory 2) Algorithms of quantum computers 3) Quantum cryptography. |
| 授業スケジュール ／Class schedule |
[Class Format] This course will be conducted in a lecture-based format in every class. [Preparation/Review] Before each class, please review the lecture materials distributed in advance, based on the course schedule. To check your understanding, a short quiz will be assigned in every class. Please be sure to submit the quiz by the next class. The expected study time for preparation and review for each class is approximately 3–5 hours. [First part (Prof. YAMAGAMI Masayuki)] 1: Introduction: Purpose of quantum information 2: Review of quantum mechanics 1 (Quantum systems) 3: Review of quantum mechanics 2 (Interference of quantum states) 4: Definition of quantum computer 5: Elementary quantum algorithm 1 (Deutsch-Jozsa algorithm) 6: Elementary quantum algorithm 2 (Grover's algorithm) 7: Summary and guidance for further study [Second part (Prof. ASAI Nobuyoshi)] 8: Quantum state and vector expression 9: Quantum operation and Matrix Expression 10: Superposition, entanglement, and measurement 11: Quantum Fourier transform 12: Phase Estimation 13: Harrow-Hassidim-Lloyd(HHL) algorithm 14: Summary |
| 教科書 ／Textbook(s) |
No specific textbooks are designated, but the following are usefull books for beginners. 1. Fundamentals of Quantum Information (H. Sagawa and N. Yoshida, World Scientific) 2. Quantum Computing for Everyone (Chris Bernhardt, The MIT Press) 3. Quantum Computers — The Mechanism of Massive Parallel Computation (Shigeki Takeuchi, Kodansha, in Japanese) |
| 成績評価の方法・基準 ／Grading method/criteria |
Reports: 50 points (first part) and 50 points (second part) |
| 履修上の留意点 ／Note for course registration |
A basic proficiency in linear algebra is desired. It is recommended to have basic knowledge of quantum mechanics. However, the course will accept students who do not have any knowledge of quantum mechanics but have strong desire to learn new knowledge. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 1学期 ／First Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
SUZUKI Taro |
| 担当教員名 ／Instructor |
SUZUKI Taro, WATANABE Yodai |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/02/06 |
|---|---|
| 授業の概要 ／Course outline |
Computation is one of the most important concepts in computer science, and indicates the limit of the power of computers, which should be familiar to all people working in computer science or engineering field. By this notion, the problems are classified into two classes, that is, the class consisting computable or solvable problems and one consisting incomputable or unsolvable problems. This course provides the notion of computation and computability through several computation models as the rigorous concepts of computation and their equivalence, and the existence of non-computable problems and some concrete examples of non-computable problems. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
Students can be familiar to the notion of computability defined by several computation models, such as Turing machines, register machines, recursive functions and While programs. Furthermore, they can understand the limit of the computers, that is, that there are problems which are not solved by any computer. |
| 授業スケジュール ／Class schedule |
Each class will be conducted with lectures and exercises. Lectures follow the handouts and supplementary materials distrubuted by LMS in advance. Exercises are assigned during classes, which are inserted between lectures. The class schedule is as follows. Class 1. 1. Introduction to Computablity and Computation Models Classes 2,3,4,5,6,7. 2. Computation Models 2.1 Turing Machine Model 2.2 Random Access Machine(RAM) Model 2.3 Recursive Function Model 2.4 While Program Model Classes 8,9,10. 3. Church-Turing Thesis 3.1 The equivalence in the computation power among models 3.2 Church-Turing Thesis 3.3 Computation on data types other than natural numbers. Classes 11,12. 4. Universal Programs 4.1 Coding of Programs 4.2 Construction of Universal Program Classes 13,14. 5. Unsolvable Problems 5.1 Halting Problem 5.2 Reducibility The correspondence between classes and topics described above may be changed according to the progress of the course. Before each class, prepare by studying the handouts and supplementary materials according to the class schedule. Also, review the handouts, supplementary materials and exercises assigned during every session. The typical preparation/review time per session is 3-5 hours. |
| 教科書 ／Textbook(s) |
The textbook is not specified. The course instructor proceeds according to the handouts distributed during the classes. |
| 成績評価の方法・基準 ／Grading method/criteria |
The evaluations will be done by the final assignment distributed to the students by e-mail soon after the last class,. The students should submit answers to the final assignment by the specified date. Some exercises will be given during almost every class, too. Though they are not included in the evaluation, the students should solve them during classes; otherwise it would be difficult to answer the questions in the final assignment. |
| 履修上の留意点 ／Note for course registration |
Students enrolling this course had better to be familiar to the fundamental concepts studied in F3 Discrete Systems, F1 Algorithms and Data Structure, F8 Automata and languages, and M9 Mathematical Logic in the undergraduate program, although they are not mandatory. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
R. Sommerhalder, S.C. van Westrhenen. The theory of computability : programs, machines, effectiveness and feasibility. Addison-Wesley. 1988. Martin D. Davis, Ron Sigal, Elaine J. Weyuker. Computability, complexity, and languages : fundamentals of theoretical computer science. Academic Press. 1994. Douglas S. Bridges. Computability : a mathematical sketchbook. Springer. 1994. Carl H. Smith. A recursive introduction to the theory of computation. Springer. 1994. Tom Stuart. Understanding computation : from simple machines to impossible programs. O'Reilly. 2013. Chris Hankin. Lambda calculi: a guide for computer scientists. Oxford University Press. 1994. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
LIU Yong |
| 担当教員名 ／Instructor |
LIU Yong, HASHIMOTO Yasuhiro |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
Artificial intelligence (under graduate course) |
| 更新日／Last updated on | 2026/02/05 |
|---|---|
| 授業の概要 ／Course outline |
Most engineering problems can be formulated as optimization problems. Even machine learning (e.g. training of a neural network, finding the best architecture of a deep neural network for image classification) is a special case of optimization. To solve optimization problems, different methods have been studied in mathematical programming, operations research, and so on. Conventional methods, however, are usually not efficient enough when the problem space is large and complex. Many problems faced in artificial intelligence are combinatorial optimization problems. These problems are NP-hard, and we may never find polynomial time solutions. To solve these problems efficiently, different heuristics have been used to "search for sub-optimal solutions". Heuristics are search methods produced based on human intuition and creative thinking, or inspired by some natural phenomena. They are often useful for finding good local solutions quickly in a restricted area. Meta-heuristics are multi-level heuristics that can control the whole process of search, so that global optimal solutions can be obtained systematically and efficiently. Although meta-heuristics cannot always guarantee to obtain the true global optimal solution, they can provide very good results for many practical problems. Usually, meta-heuristics can enhance the computing power of a computer system greatly without increasing the hardware cost. So far, many meta-heuristics have been proposed in the literature. In this course, we classify meta-heuristics into two categories. The first one is "single-point" (SP) search, and the second one is "multi-point" (MP) search. For the former, we study tabu search, simulated annealing, iterated local search, and so on. For the latter, we study evolutionary algorithms, including genetic algorithms, genetic programming, evolutionary strategy, and memetic algorithm; ant colony optimization, and particle swarm optimization. Although the efficiency and efficacy of these methods have been proved through experiments, because they were proposed based on human intuition, the theoretic foundation is still weak. Therefore, in this course, we will mainly introduce the basic idea of each method, and try to explain the physical meaning clearly. Mathematical proofs will be introduced very briefly when necessary. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
In this course, we will study the following topics: (1) Examples of important optimization problems. (2) Conventional optimization methods. (3) Single-point (SP) search methods: * Tabu search. * Simulated annealing. * Iterated local search. * Guided local search. (4) Multi-point (MP) search methods * Genetic algorithm (GA). * Genetic programming (GP). * Evolutionary programming (EP). * Memetic algorithm (MA). * Differential evolution (DE). * Particle swarm optimization (PSO) and ant colony optimization (ACO). After this course, students should be able to (1) Understand the basic ideas of each meta-heuristics algorithm; (2) know how to use meta-heuristics for solving different problems; and (3) become more interested in developing new algorithms. |
| 授業スケジュール ／Class schedule |
Session 1: An Introduction to Optimization - Classification and case study. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 2: Search Algorithms - An brief review of conventional search algorithms. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 3: Tabu Search - List, intensification, and diversification. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 4: Simulated Annealing - Find the global optimum without remembering search history. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 5: Iterated Local Search and Guided Local Search - Strategies for repeated search. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 6: Team Work I - Solving problems using single point search algorithms. [Preparation/Review] Discuss the used single point search algorithms and simulation results: preparation (3 hours), review (3 hours). Session7: Presentation of Team Work I. [Preparation/Review] Write presentation slides: preparation (2 hours), review (4 hours). Session 8: Genetic Algorithm - Basic components and steps of GA. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 9: Other Evolutionary Algorithms - Evolution strategies, evolutionary programming, and genetic programming. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 10: Differential Evolution - Evolve more efficiently, but why? [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 11: Memetic Algorithms - Meme, memotype, memeplex, and memetic evolution. - Combination of memetic algorithm and genetic algorithm. [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 12: Swarm Intelligence - Ant colony optimization - Particle swarm optimization [Preparation/Review] Study lecture notes: preparation (2 hours), review (1 hour). Session 13: Team Work II - Solving problems using multi-point search algorithms [Preparation/Review] Discuss the used multi-point search algorithms and simulation results: preparation (3 hours), review (3 hours). Session 14: Presentation of Team Work II. [Preparation/Review] Write presentation slides: preparation (2 hours), review (4 hours). |
| 教科書 ／Textbook(s) |
Lecture notes will be available on the course page. |
| 成績評価の方法・基準 ／Grading method/criteria |
- Team works: 70 (35 x 2) points. - Team presentation: 30 points. - Active Participation will also be considered in evaluation. |
| 履修上の留意点 ／Note for course registration |
This course is related to optimization problems. If you are interested in knowing how to find (search for) the "best" solution for any given problems, effciently and effectively, please take this course. Note that designing deep neural networks, electronic devices, and so on, are all "special cases" of optimization problems. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
1) M. Gendreau and J. Y. Potvin, Handbook of metaheuristics, 2nd Edition, Springer, 2010. 2) C. Cotta, M. Sevaux, and K. Sorensen, Adaptive and multilevel metaheuristics, Springer, 2010. |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
ASAI Kazuto |
| 担当教員名 ／Instructor |
ASAI Kazuto, HASHIMOTO Yasuhiro, KACHI Yasuyuki, TSUCHIYA Takahiro, WATANABE Yodai |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/01/15 |
|---|---|
| 授業の概要 ／Course outline |
Course implementation methods: Remote classes A graph, composed of vertices and edges, is one of the most fundamental objects in mathematics. In spite of its simple definition, tons of notions concerning graphs are introduced, and it is sometimes very laborious to perform complete introduction of graph theory. In this class, we first overview graph theory terminology to moderate extent, then we change the focus to carefully selected important topics, and advance our knowledge in that area. For example, we focus on vertex/edge connectivity, and introduce Menger's theorem and Mader's theorem; also focus on spanning trees and Kirchhoff's theorem, etc. Graph theory, as a branch of mathematics, growing its branches like a tree, and even at present, contains many difficult open problems. As another aspect, it has a lot of applications to several areas. Graphs can be used to model many types of relations and processes in physical, biological, social and information systems. This is a reason why graph theory is important for many people in wide areas. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
Graphs, Subgraphs, Isomorphic graphs, Degrees of vertices, Walks, Trails, Paths, Distance, Diameter, Coloring, Special graphs, Multigraphs and matrices, Eulerian/Hamiltonian multigraphs, Connectivity, Menger's theorem, Mader's theorem, Planarity (optional), Trees, Spanning trees, Kirchhoff's theorem, Deletion-contraction method, Cayley's formula, Minimum spanning trees, Decompositions of graphs. |
| 授業スケジュール ／Class schedule |
1--2. Definition and basics 3. Walks, trails, paths; Connectivity 4. Distance and diameter; Coloring 5. Special graphs, matrices 6. Eulerian/Hamiltonian multigraphs 7. Connectivity (revisited) 8. Menger's theorem, Mader's theorem 9. Trees, Spanning trees and Kirchhoff's theorem 10. Deletion-contraction method 11. Prufer's bijective proof of Cayley's formula 12. Minimum spanning trees 13. Decomposition of graphs 14. Gyarfas tree packing conjecture |
| 教科書 ／Textbook(s) |
1. Handout: A Graduate Text for the Core Course: -- Graph Theory --, by K. Asai 2. Graph Theory (Graduate Texts in Mathematics, Vol. 173) (2012), Springer, by R. Diestel 3. Pearls in Graph Theory: A Comprehensive Introduction (Dover Books on Mathematics) (2003), Dover Publications, by N. Hartsfield, G. Ringel |
| 成績評価の方法・基準 ／Grading method/criteria |
Report:80％ Presentation:20% |
| 履修上の留意点 ／Note for course registration |
Related courses: Discrete Systems, Algorithms and Data Structures |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Home page for the class: http://web-ext.u-aizu.ac.jp/~k-asai/classes/class-texts.html |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 4学期 ／Fourth Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
NAKASATO Naohito |
| 担当教員名 ／Instructor |
NAKASATO Naohito, ASAI Nobuyoshi, FUJIMOTO Yusuke |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/02/03 |
|---|---|
| 授業の概要 ／Course outline |
This course mainly introduces 1. Ordinary and partial differential equations appear in science or engineering 2. Schemes to discretize the differential equations 3. Computational techniques to get numerical solutions. 4. Use of programming language and numerical libraries for solving differential equations and visualizing the results of simulation; main attention is focused on the use of C, Java, Python, or similar languages. This course starts with the theory and mathematics of differential equations followed by hands-on style exercises as well as computer-related exercises on numerical techniques to solve various differential equations. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
The main goal of this course is to introduce the basic theory of differential equations and several most important numerical techniques and schemes to get solutions to those equations. To program numerical solutions in exercise, we encourage students to use 1. Python for obtaining preliminary results with its efficient visualization and 2. C or Java languages for high-performance programs 3. Or other programming languages as you choose. |
| 授業スケジュール ／Class schedule |
week 1 Floating-point arithmetic operations (N.Nakasato) week 2 Introduction to Ordinary Differential Equations (N.Nakasato) week 3 Introduction to Partial Differential Equations (N.Nakasato & N.Asai) week 4 Topics in Partial Differential Equations (1) (N.Nakasato, N.Asai & Y.Fujimoto) week 5 Topics in Partial Differential Equations (2) (N.Nakasato, N.Asai & Y.Fujimoto) week 6 Practical Applications of Numerical Modeling and Simulations (N.Asai) week 7 Practical Applications of Numerical Modeling and Simulations (Y.Fujimoto) Every week, one lecture (2 periods) will be given followed by an exercise class (2 periods). Before the opening of the course : Review the undergraduate classes on "Linear Algebra", "Integration", and related courses for roughly 20 hr. Pre-class Learning : Review the lecture slide for 1 - 2 hr. If the learning material is given, review the material for 2 hr. Post-class Learning : Continue to solve exercise problems and submit reports for 3 - 4 hr. |
| 教科書 ／Textbook(s) |
The lecture slides will be available in the LMS. Part of the course is based on the following textbooks. Modeling with Differential Equations, by D.Burghes & M.Borrie, Ellis Horwood Ltd , 1981 Partial Differential Equations for Scientists and Engineers, Stanley J. Farlow, Dover Publications, 1993 |
| 成績評価の方法・基準 ／Grading method/criteria |
Homework&Reports (100 points) |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 4学期 ／Fourth Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
KACHI Yasuyuki |
| 担当教員名 ／Instructor |
KACHI Yasuyuki, VIGLIETTA Giovanni |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
Prerequisite: MA01–2 Linear Algebra I & II (undergraduate), MA03–4 Calculus I & II (undergraduate), or equivalent. MA05 Fourier Analysis (undergraduate) is not a prerequisite but conversance with that subject will be paramount. |
| 更新日／Last updated on | 2026/02/06 |
|---|---|
| 授業の概要 ／Course outline |
The course focuses on rudiments on measure theory and Lebesgue integration. We are all familiar with integrals (who aren’t?) They are called Riemann integration to be precise. Lebesgue integration is a souped-up version of Riemann integration. What is it good for? Let’s let the cat out of the bag: In our undergraduate Fourier analysis course (MA05), we teach the subject based on Riemann integrals (for all the right reasons). However, one can see the full-picture of Fourier analysis only when one replaces them with Lebesgue integrals: Mathematically, the space of square-integrable functions, the main object of study in Fourier analysis, becomes a complete metric space, or a Hilbert space, with respect to the Lebesgue measure. Many useful facts and formulas in analysis ultimately boil down to it. To the extent that Fourier analysis is a sine qua non in data science (signal processing, image analysis, etc.), the course content is useful for aspiring data scientists, and more broadly anyone whose working realm has to do with computer science and engineering. The course is in proportion with what’s being taught as part of the standard curriculum at most universities that have math, science and engineering departments/schools nationwide. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
We cover the rudiments of measure theory and Lebesgue integration, with emphasis on the completeness of the L^1- and the L^2-spaces. Goals: 1. Understand that the advent of measure theory and Lebesgue integration was a major paradigm shift in mathematics history. Understand that today measure theory and Lebesgue integration pervade computer science & engineering. 2. Understand the rudiments of measure theory: Borel σ-algebra, σ-additivity (σ-additive functions), Lebesgue measures on R^n, and measure zero sets. 3. Understand the rudiments of Lebesgue integration. Understand that the completeness of the L^1-space gives a boost to the raison d’être of the notion of Lebesgue integration. Likewise, understand the notion of square-integrability, and the completeness of the L^2-space (the Hilbert space). 4. Understand how the notion of Lebesgue integration gives the foundation of Fourier analysis a seamless makeover. |
| 授業スケジュール ／Class schedule |
1. Revisiting the concepts of lengths, areas and limits. One-dimensional intervals. 2. Cantor set. σ-additivity – I. The Peano–Jordan measure. 3. Lebesgue outer/inner measure. Measure zero set. 4. Caratheodory/Lebesgue–Stieltjes outer measure. Measurable set. Borel σ-algebra. 5. σ-additivity – II. Completeness. Measure space, Fatou’s lemma. 6. Lebesgue measure on R^n. Borel subset of R^n. Measurable covers/kernels. 7. f^−1 (interval) for a continuous f. Borel’s normal number. Simple function. 8. Measurable functions. Their sum, product and integrals. Egorov’s theorem. 9. Lebesgue integral. Basic properties. Lebesgue’s dominated convergence theorem. 10. Luzin’s theorem. L^p-spaces. Reisz’s theorem. Hahn/Jordan decompositions. 11. Radon–Nikodym’s Theorem. Vitali lemma. Differentiation of σ-additive functions. 12. Fubini’s theorem. Haussforf measure/dimension. 13. Application to Fourier Analysis I. 14. Application to Fourier Analysis II. |
| 教科書 ／Textbook(s) |
Lecture Notes: {Secondary references] 志賀浩二 『ルベーグ積分 30 講』数学 30 講シリーズ 9 朝倉書店 伊藤清三 『ルベーグ積分入門』 裳華房 |
| 成績評価の方法・基準 ／Grading method/criteria |
Exam and Regular Homework |
| 履修上の留意点 ／Note for course registration |
Prerequisite: MA01–2 Linear Algebra I & II (undergraduate), MA03–4 Calculus I & II (undergraduate), or equivalent. MA05 Fourier Analysis (undergraduate) is not a prerequisite but conversance with that subject will be paramount. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
志賀浩二 『ルベーグ積分 30 講』数学 30 講シリーズ 9 朝倉書店 伊藤清三 『ルベーグ積分入門』 裳華房 |
| Open Competency Codes Table Back |
| 開講学期 ／Semester |
2026年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1st year , 2nd year |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
WATANOBE Yutaka |
| 担当教員名 ／Instructor |
WATANOBE Yutaka, NISHIDATE Yohei |
| 推奨トラック ／Recommended track |
－ |
| 先修科目 ／Essential courses |
－ |
| 更新日／Last updated on | 2026/02/06 |
|---|---|
| 授業の概要 ／Course outline |
Data structures play a key role in computer science and engineering. They are essential components to implement many efficient algorithms. This graduate-level course covers advanced topics not studied in introductory courses on algorithms and data structures. This course focuses on not only theory but also on practice to implement the advanced data structures and algorithms. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
The core course covers several advanced data structures related to balanced search trees, range queries, sets and persistent data structures as well as advanced algorithms for graphs, string, computational geometry and artificial intelligence. Students should seek to develop a solid understanding of common and practical data structures as well as techniques used in their implementation to solve real world problems. |
| 授業スケジュール ／Class schedule |
1. Introduction: Review of fundamental data structures and algorithms as well as theory and techniques to analyze algorithms. 2. Balanced Tree: Basic Binary Search Trees, Treap, Red-Black Trees, AVL Trees, etc. 3. Range Query: Segment Trees, Range Minimum Query, Lazy Evaluation, Heavy-Light Decomposition, etc. 4. Sets: Union Find Trees, Merge Techniques, Persistent Data Structures, etc. 5. Algorithms on String: KMP, BM, Suffix Arrays and Trees, Rolling Hash, Trie, etc. 6. Graph Algorithms: Bridges, Articulation Points, Strongly Connected Components, Max-Flow, Min-Cost-Flow, Bipartite Matching, etc. 7. Computational Geometry. Closest Pairs, Minimum Enclosing Circle, Range Search, Sweep Algorithms, etc. It is subject to change, so some of these topics may be omitted and additional topics can be selected depending on the progress. Each week is divided into two parts: the first half consists of lecture-style sessions, and the second half is dedicated to practical exercises where students work on specific assignments. Before each class, students must review the lecture materials regarding the keywords listed in the schedule. Any assignments not completed during the exercise periods must be finished by the designated deadline. Approximately 5 hours of combined preparation and review per session. |
| 教科書 ／Textbook(s) |
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2. Algorithm Design Manual, Steven S Skiena. 3. Algorithm Design, J. Kleinberg, E. Tardos |
| 成績評価の方法・基準 ／Grading method/criteria |
Assignments 50 % Examinations 50 % |
| 履修上の留意点 ／Note for course registration |
• Reviewing undergraduate courses Algorithms and Dada Structures I and II is expected. • The students should have basic skill of programming in C++ or Java. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
https://onlinejudge.u-aizu.ac.jp/ |