2015年度 シラバス大学院 2015年度 シラバス大学院 2015年度 シラバス大学院
| 2016/02/01 現在 |
| 科目一覧へ戻る |
| 開講学期 ／Semester |
2015年度／Academic Year 1学期 ／First Quarter |
|---|---|
| 対象学年 ／Course for; |
1年 , 2年 |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
西村 憲 |
| 担当教員名 ／Instructor |
西村 憲 |
| 推奨トラック ／Recommended track |
－ |
| 履修規程上の先修条件 ／Prerequisites |
－ |
| 更新日／Last updated on | 2015/02/05 |
|---|---|
| 授業の概要 ／Course outline |
This a basic course in logic design (conversion course) for students who did not take any classes in logic design before. The first part of the course is devoted to the basics of Boolean Algebra and representation of binary numbers for computer arithmetics. The second part is devoted to the combinational logic synthesis is the topic. A Boolean minimization method for two-level sum-of-product forms is considered. The technique is based on using Karnaugh maps. We then discuss basics of multi-level minimization and show why it is important. We review issues of hazards and timing analysis. Methods for hazard-free synthesis are considered. The third part is devoted to the basics of computer arithmetics. We will discuss methods for implementing addition, subtraction and multiplication. The forth part discusses basics of sequential logic synthesis. We present basics types of memory elements (flip-flops and latches) and consider methods for the finite state machine (FSM) design including state encoding, state minimization and logic synthesis. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
At the end of the course the student should be able to: * Apply laws of Boolean algebra for manipulating logic expressions * Minimize Boolean functions using Karnaugh maps * Remove static hazards from the logic implementation * Design a finite state machine (FSM) using different types of memory elements * Minimize the number of states of an FSM. |
| 授業スケジュール ／Class schedule |
1. Introduction. Design Flow. Number systems. 2. Conversion between number systems. Representation of negative numbers. 3. Logic functions and Boolean algebra. Laws of Boolean algebra. 4. Logic gates. Implementation of logic functions by switches. 5. Implementation of logic functions. Duality and Laws of Boolean algebra. 6. Two level canonical forms. Positive and negative logic. 7. Minimization of Boolean Functions. 8. Karnaugh maps. 9. Multi-level combinational logic. NAND-NAND and NOR-NOR networks. 10. Timing analysis and hazards. Gates and wire delays. Circuit simulation. 11. Arithmetic circuits: adders. Half-adder. Full-adder. 12. Flip-flops and latches. 13. Registers. Counters. State diagram. State Transition Table. 14. Finite state machines (FSMs). 15. State reduction. Choice of flip-flops. 16. Hardware description languages. |
| 教科書 ／Textbook(s) |
* M. Mano, Digital Design, Prentice-Hall, 1991. * Z. Kiyasu and K. Shimizu, Digital Circuits (in Japanese), Morikita Publishing, 1989. * Handouts prepared by the instructor. |
| 成績評価の方法・基準 ／Grading method/criteria |
* Final Examination (50 points) * Design project (50 points) |
| 科目一覧へ戻る |
| 開講学期 ／Semester |
2015年度／Academic Year 1学期 ／First Quarter |
|---|---|
| 対象学年 ／Course for; |
1年 , 2年 |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
劉 勇 |
| 担当教員名 ／Instructor |
劉 勇 |
| 推奨トラック ／Recommended track |
－ |
| 履修規程上の先修条件 ／Prerequisites |
－ |
| 更新日／Last updated on | 2015/02/27 |
|---|---|
| 授業の概要 ／Course outline |
In this course, students are expected to learn the hardware/software interface in co mputer organization from two examples, including a single-cycle MIPS processor, and a pipelined MIPS processor. Students are also expected to learn the simple memory pr otection and management. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
1. to introduce the important principles of computer organization. 2. to learn the MIPS processor from a simple implementation to a fully pipelined version. 3. to understand the concepts in memory hierarchies. |
| 授業スケジュール ／Class schedule |
1. Introduction of MIPS assembly language 2. Arithmetic for Computers 3. Datapath and Control (1) A single-cycle implementation (2) A multicycle implementation 4. Enhancing performance with pipelining (1) Pipelined datapath (2) Pipelined control 5. Memory hierarchy (1) Basics of caches (2) Virtual Memory |
| 教科書 ／Textbook(s) |
Computer Organization and Design - The Hardware/Software Interface by David. A. Patterson and John L. Hennessy, Morgan Kaufmann Publishers. |
| 成績評価の方法・基準 ／Grading method/criteria |
Students are required to write reports and give presentations on the topics related to computer organization. |
| 履修上の留意点 ／Note for course registration |
None |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Reading materials will be given in the classes. |
| 科目一覧へ戻る |
| 開講学期 ／Semester |
2015年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1年 , 2年 |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
モハメド ハマダ |
| 担当教員名 ／Instructor |
モハメド ハマダ |
| 推奨トラック ／Recommended track |
－ |
| 履修規程上の先修条件 ／Prerequisites |
－ |
| 更新日／Last updated on | 2015/03/04 |
|---|---|
| 授業の概要 ／Course outline |
The models of languages and computers will be introduced and the Chomsky hierarchy of the abilities of grammars to describe languages is explained. Automata related to this hierarchy are also explained Then we study the fundamental notion of compilers. The syntax and the semantics of programming languages are explained and the lexical analysis is taught. Some famous methods of the syntactical analysis and the semantic analysis are given in detail. The code generation and the code optimization will be mentioned, for the case we have enough time to spare. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
This course gives students the fundamental concepts of the formal language theory and the concept of the compiler as application of the formal language theory. Students can be familiar to the automata and languages and understand the concept of compilers. |
| 授業スケジュール ／Class schedule |
1. Introduction 2. Grammars and languages generated by them 3. Automata and languages accepted/recognized by them 4. Regular languages, regular expressions and finite automata 5. Context-free languages and pushdown automata 6. Chomsky hierarchy of language classes 7. Relation among grammars and automata 8. Mid-term report (or exam) 9. Introduction of compilers 10. Lexical analysis 11. Syntactical analysis, LL(k) grammars and their parser construction 12. Syntactical analysis, LR(k) grammars and their parser construction 13. Syntactical analysis, LR(k) grammars and their parser construction 14. Semantical analysis, Attribute grammars 15. Code generation and code optimization 16. Final report (and/or exam) |
| 教科書 ／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 |
Evaluation will be based on: 1. Reports 2. Seminars 3. Programs (or exams) |
| 履修上の留意点 ／Note for course registration |
As this course is given to students who have not studied the formal language and automata theory nor the fundamentals of compilers, there is no prerequisites. But we expect students have some experiences to use computers or to write programs. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Will be given during lectures. |
| 科目一覧へ戻る |
| 開講学期 ／Semester |
2015年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1年 , 2年 |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
サバシュ バーラ |
| 担当教員名 ／Instructor |
サバシュ バーラ |
| 推奨トラック ／Recommended track |
－ |
| 履修規程上の先修条件 ／Prerequisites |
－ |
| 更新日／Last updated on | 2015/03/04 |
|---|---|
| 授業の概要 ／Course outline |
This course is the foundation level course for graduate students. It covers the application developer's view and also covers internal architecture of modern database management systems. It introduces existing designs and raises unsolved problems and design issues. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
At the end of the course the student should be able to understand : - Architecture of a Database Management System. - Multidatabase Systems. - Data Transparency and site Autonomy. - Transaction Management. - Database security. - Recovery in Distributed Databases. - Replicated Data Management. |
| 授業スケジュール ／Class schedule |
-------------------------- 1 Introduction to Applicationss 2 Algebra and Calculus 3 Relational Model 4 Entity-Relationships Model 5 SQL 6 Data Security 7 Multidatabase Systems 8 Transactions ---------------------- |
| 教科書 ／Textbook(s) |
- Various materials prepared by the instructor. - Korth, H, A. Silverschatz, S. Sudershan, Database Systems Concepts, McGraw Hill Book Co. 2010, 6th Edition - Various materials prepared by the instructor. |
| 成績評価の方法・基準 ／Grading method/criteria |
Two short quizzes ( 20 points ), One examination ( 30 points ), Database Programming projects ( 25 points ). |
| 履修上の留意点 ／Note for course registration |
Courses on: Operating Systems; Algorithms and Data Structures |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
Course directory for handouts and exercise sheets. References: Study material and notes recommended by the instructor(s). |
| 科目一覧へ戻る |
| 開講学期 ／Semester |
2015年度／Academic Year 2学期 ／Second Quarter |
|---|---|
| 対象学年 ／Course for; |
1年 , 2年 |
| 単位数 ／Credits |
2.0 |
| 責任者 ／Coordinator |
朱 欣 |
| 担当教員名 ／Instructor |
朱 欣 |
| 推奨トラック ／Recommended track |
－ |
| 履修規程上の先修条件 ／Prerequisites |
－ |
| 更新日／Last updated on | 2015/02/05 |
|---|---|
| 授業の概要 ／Course outline |
Computer Graphics (CG) are the technology related to the creation, representation, and manipulation of images by a computer. Currently, CG has been one of the most important computer technologies with applications in computer-aided design, computer art, entertainment, virtual reality, and scientific visualization. This course is to introduce the basic knowledge and programming skills of CG for graduate students who did not learn CG in their undergraduate study. Besides the lectures and homework, a final project will be assigned to students to create complicated graphics using the knowledge and skills learned in this course. |
| 授業の目的と到達目標 ／Objectives and attainment goals |
This course will help students to understand the basic concepts, theories, and techniques of CG and obtain the basic CG programming skills with OpenGL. |
| 授業スケジュール ／Class schedule |
1. Introduction to computer graphics: concepts, mathematics, and programming 2. Introduction to OpenGL 3. Drawing geometric objects and 3D viewing 4. Model and view transform 5. Color, light, blending, antialiasing, and fog 6. Texture mapping, framebuffer, Z buffer, and ray tracing 7. Shape modeling and data structure 8. Bezier and Nurbs curve and surface |
| 教科書 ／Textbook(s) |
F. Hill et al., Computer Graphics Using OpenGL, 3rd ed., Pearson Education, ISBN-13: 978-0131362628, June 13, 2008 Dave Shreiner et al., OpenGL Programming Guide: The Official Guide to Learning OpenGL, Versions 3.0 and 3.1, 7th ed., Addison Wesley, ISBN-13:978-0321552624, July 31, 2009 OpenGL Architecture Reviewing Board, OpenGL Reference Manual: The Official Document to OpenGL, Version 1.4, 4th ed., Addison Wesley, ISBN-13: 978-0321173836, March 26, 2004 |
| 成績評価の方法・基準 ／Grading method/criteria |
出席 ２０％ 宿題 ４０％ プロジェクト ４０％ |
| 履修上の留意点 ／Note for course registration |
Basic skills of C languages are necessary. |
| 参考(授業ホームページ、図書など) ／Reference (course website, literature, etc.) |
http://www.u-aizu.ac.jp/~zhuxin/course http://www.opengl.org/ |