Cinsdikici's Diary

Assoc.Prof.Dr. Muhammed Cinsdikici

Archive for the ‘Courses’ Category

Cinsdikici Courses

UBI506 – Operating Systems Course

Posted by cinsdikici on March 3, 2016

Course Unit Title Operating Systems
Course Unit Code UBE 506
Course Time: Wednesday [18:00-21:00], Friday [9:30-12:00]
Course Room: UBE, Room 103
Level of Course Unit M.Sc.
Number of ECTS Credits Allocated 7,5
Theoretical 3
Semester Spring
Name of Lecturer(s) Asst. Prof. Dr.Muhammed Cinsdikici, cinsdikici@gmail.com, office phone: 3205
Mode of Delivery Face-To-Face
Language Turkish
Assistant Kaya Oğuz, kaya.oguz@ege.edu.tr, office phone: 3242
Prerequisities
Objectives of the Course The aim of this course is to introduce the theory and implementation of operating system concepts with emphasis on concepts on sample operating systems like Unix, Linux, Windows and show how the sharing resources.
Textbook 1. Silberschatz Galwin, Operating System Concepts, 9.th Edition, Wiley, 20142. Andrew S. Tanenbaum, Albert S.Woodhull, The Minix book: Operating Systems – Design and Implementation- (3.rd Edition),Prentice Hall, 2006
Learning Outcomes
  1. To conceive the components of operating systems.
  2. Ability to explain general working  principles of operating systems.
  3. Ability to compare the  kinds and properties of operating systems.
  4. To realize the problems about sharing resources of a computer system.
  5. Ability to conceive operating system’s services.
  6. Ability to explain the concepts of process, deadlock; process scheduling algorithms, memory management and file systems.
  7. Ability to investigate the resource sharing methods’ effects to a computer performance
  8. Ability to develop software which contains multithreaded architecture and is protected from deadlock
  9. Ability to give a presentation, explanation about specific subject related the operating systems by research deeply.
  10. Awareness of ethics problems about operating systems.
Course Contents Process, process communication, Scheduling Synchronization, memory management, virtual memory, paging, swapping, file systems, input-output security, protection, deadlock avoidance algorithms, Unix basic concepts, introduction to distributed systems.
Grading & Projects %15 HomeWorks + %30 MidTerm + %40 Final Exam + %15

Final Project Late submission of the homeworks and projects are not going to be accepted. 

The assessment principals are;

————————————-

On time submission are scored as max.100/100

One week late submissions are scored as max. 80/100

Two weeks late submissions are scored as max. 60/100Others are scored as 0.

Weekly Detailed Course Contents
WEEK NAME   SUBJECTS  
  Theoretical Slides Laboratory Suplementary Materials
1 Introduction Definition of operating system, basis components of an computer system, interrupt handling types, storage hierarchy, structure of an operating system, basis chapter abstracts: process management, memory management. Introduction Computer Pioneers HistoryCharles Babbages Difference MachineHuman’s OS
2 System Structures Operating system services, operating system interfaces  (GUI and CLI), system calls and relation with operating system, system programs, MS-DOS structure, Unix system structure, microkernel  system structure, Mac OS X and Solaris system structure, virtual machines. OS Structures Research Assignment History of GUI

MsDOS Source Codes

 

[Thnx to my student Muhammed Ali Sürücü for the following suplimentary materials]

System Calls on Linux with code sample

Linux System Call Quick Reference

 

3 Process Concept Process, process scheduling, process synchronization, interoperating processes, process communication, inter process synchronization on server-client  Processes Process Creation Lab on Linux OS
4 MultiThreaded Programming Threads, multi-thread model, POSIX threads (Pthread),  Windows XP threads, Linux and Java threads  Threads Java Thread Library Coding
5 Synchronization Process synchronization, critical section problem, Peterson’s solution, hardware-base synchronization, semaphores, classical synchronization problems, monitor concept. Process Synchronization Semaphore implementationCode assignment aboutJava threads
6 Process Scheduling CPU scheduling subjects: scheduling criterias, multi CPU scheduling, scheduling algorithms, real-time scheduling, thread scheduling, examples from operating systems, Java thread synchronization code example. CPU Scheduling[Previous Version of the  Slide]  Research for Queue Systems Customer Queueing SystemSimulating QueueSabarimala Virtual Queue System 🙂
7   Midterm    
8 Deadlocks Deadlock problem, deadlock prevention methods, avoidance methods from deadlock, deadlock recovery. Classical deadlock problems and solutions, sample codes Deadlock  Deadlock avoidance implementation OS DeadlockBankers AlgorithmDeadlock in traffic
9 Memory Management Strategies Memory management, swapping, contiguous allocation paging, segmentation, segmentation with paging. Memory Management LitterateurResearch  How CPU Works?Fetch/Decode/ExecutePage Tables
10 Virtual-Memory Management Virtual memory, paging on demand, process creation, page reallocation, frame replacement, Segmentation on demand, examples from operating systems. Virtual Memory Management Book Reading LRU Approaximation: Second Chance (!)

Clock & Second Chance Algorithm s Presentation

11 Mass Storage Structure Disk Structure, Disk Scheduling, Disk Management, Swap-Space management  Mass Storage Structure  Research on Disk Drives
12 File System Interface File system interface, file concept, file access, file sharing and file protection, file associating.  File System Interface  Linux/Win8 File Management System Information
13 File-Systems Implementation File systems implementation, Allocation methods, free space management  File Systems Implementation  FAT32/NTFS Info
14 Case Studies Linux Systems, Windows 7
15   Final Exam    

 

Recommended or Required Reading     2. Silberschatz Galwin, Operating System Concepts with JAVA, Wiley, 20041. Andrew S. Tanenbaum, Albert S.Woodhull, The Minix book: Operating Systems – Design and Implementation- (3.rd Edition),Prentice Hall, 20062. Silberschatz Galwin, Operating System Concepts with JAVA, Wiley, 2004

Read the rest of this entry »

Advertisements

Posted in Operating Systems | Leave a Comment »

Bilisim Aglari ve Veri Haberlesmesi

Posted by cinsdikici on February 24, 2015

Ders Adı Bilişim Ağları ve Veri Haberleşmesi
Ders Kodu 8031002222009.1
Ders Gün/Saat Bilgisi Salı [17:00-18:40], Perşembe [17:00-18:40]
Derslik Bilgisi Ege M.Y.O, F22 Haberleşme Laboratuarı
Dersin Verildiği Program Önlisans, Ege M.Y.O. Elektronik Haberleşme Teknolojisi 2. Öğretim Programı
Dersin AKTS / Kredi Bilgisi  2.5 / 3
Dersin Teorik/Pratik Saati 2 + 2
Ders Dönemi Bahar (2.yıl 2.dönem)
Dersi Veren Öğretim Üyesi Doç.Dr.Muhammed Cinsdikici, cinsdikici@gmail.com, office phone: 3205
Dersin Veriliş Modeli Yüz-Yüze
Dersin Dili Türkçe
Dersin Asistanı
Ders için Ön Koşullar
Dersin Amacı Bilgisayar Ağları ile ilgili teorik alt yapının oluşturulması, bu altyapı üzerine pratik Ağ Topoloji Uygulamalarının yapılandırılması. TCP/IP ağının kurulumunun yapılandırılması.
Dersin Kitabı CCNA Intro Sınav Sertifikasyon Rehberi, Wendell Odom, Çeviren:Mehmet Önder/Hakan Karataş, ISBN: 975-322-406-0
Öğrenme Çıktıları(Seyhan Coşkun hazırladığı döküman kullanılmıştır)
  1. Veri iletişiminin temel kavramları hakkında bilgi sahibi olur.
  2. Standart ağ topolojileri ve cihazlarını öğrenebilme.
  3. TCP/IP protokolleri standart özelliklerini kavrayabilme ve açıklayabilme.
  4. Ağ protokolleri ve katmanlı mimariyi öğrenebilme
  5. LAN’lar ve WAN’ların standartları ve teknolojilerini öğrenebilme.
Dersin İçeriği TCP/IP Modeli, OSI Ağ Modeli, LAN/WAN Yapıları, IP Adresleme Temelleri, TCP/UDP Protokolleri, Anahtarlama, Yönlendirme, Sanal Ağlar, TCP/IP Topolojileri Oluşturma
Dersin Değerlendirilmesi %15 Ödevler + %30 Ara Sınav + %40 Final Sınavı + %15 Final Projesi–> Ödevlerde geç teslim ile ilgili bilgilendirme: Zamaninda teslim: 100/100 üzerinden1 Hafta gecikmeli : 80/100 üzerinden2 Hafta gecikmeli: 60/100 üzerindenSonraki teslimler: 0/100
Haftalık Bazda Detaylandirilmis Ders İcerikleri
WEEK NAME   SUBJECTS  
  Teorik İçerik Sunum Lab Çalışması Ek İçerik
1 TCP/IP ve OSI Modelleri TCP/IP Protokol mimarisi, Uygulama/Taşıma/Ağlar Arası Katmanlar, Veri Paketleme, OSI Referans Modeli, a. Hafta1-Cinsdikici-Bilisim Aglari ve Veri Haberlesmesi
b. Hafta2-Cinsdikici-OSI ve TCP IP Modeli
2 Data Link (Veri Bağı) Katmanı ve LAN Temelleri OSI 2.Katman özellikleri, Data Link Katmanı Özellikleri, Adresleme, Ethernet Standartları, Frame Özellikleri Hafta3_4-Cinsdikici-Veri Bagi Katmani
3 WAN Temelleri Noktadan Noktaya (Point-to-Point) WAN Bağlantıları, Örnek: ATM/Sonet
4 IP Adresleme Temelleri OSI 3.katman temelleri, IP Adresleme Temelleri, IP Sınıflandırma, 3.Katman protokolleri, Adres Çözümlemeler, Yönlendirme ve Yönlendirme Protokolleri TEmelleri Hafta5-6_RAW-IP Temelleri  IP & Mask Usage (Subnetting)Subnetting Step-by-Step
5 TCP ve UDP Temelleri OSI 4.Katman temelleri, TCP protokolü, TCP port adresleme, hata düzeltimi, akış denetimi, UDP protokolü.  Hafta7-8_RAW-TCP and UDPHafta9-TCP_IP Services and Utilities  DHCP Configuration in Cisco Packet Tracer  IP Helper
Yönlendirme Cihazları Uygulaması / Anahtar Cihazları Uygulaması Simülatör kullanımı ile yönlendirici (router) yapılandırma / Simülatör kullanımı ile anahtar (switch) yapılandırma
7   ARA SINAV    
8 LAN Kablolama, Standartlari ve Topolojileri——————-LAN Topolojisinin Anahtarlar ile Kurgulanması UTP/STP kablolama, temelleri, Koaksiyel kablolama, Fiber Kablolama, Kablosuz İletişim——————————-Köprüleme/Anahtarlama, LAN bölütleme, Spanning Tree ve Gerekliliği  Hafta-10 Network Cihazları
9 Sanal LAN yapıları (Vlan) Sanal LAN yapısı, Trunk oluşturma, 802.1q protokolü, VLAN’ler arası geçiş trafiği
10 IP Adresleme ve Alt Ağ (Subnet) oluşturma IP Adresleme, Adres ve Alt ağ Çözümleme Yorumlama, HosT/Subnet ilişkisi, CIDR kavramı, Broadcast Uzayı  Hafta 11-IP Adresleme ve AltAg Kurulumlari
11 Yönlendirme Protokolleri (Routing) Yönlendirme Protokolleri, RIP/IGRP/BGP/OSPF protokolleri   Hafta 12- Yonlendrme-protokolleri
12 TCP/IP Temel İletişim Yazılımı TCP protokolü ile iki makine arasında iletişim sağlayacak C# yazılım geliştirme: Basit Tcp Server/Client, Sorunlu Tcp Server/Client, En İyi Server/Client kodlamaları
13 UDP/IP Temel İletişim Yazılımı UDP protokolü ile iki makine arasında iletişim sağlayacak C#yazılım geliştirme: Basit UDP Server/Client, Sorunlu UDP Server/Client, En İyi UDP Server/Client kodlamaları
14 Asenkron TCP/IP ve Çoklu TCP/IP yazilimlari Asenkron iletişim sağlayabilen TCP/IP server/client ve Thread’lerle kurgulanmış, çoklu TCP/IP Server kodlamaları
15   FINAL SINAVI    

 

Recommended or Required Reading     1.C# Network Programming, Richard Blum, Sybex, ISBN: 978-0-7821-4176-4, 20022.Java Network Programming, Merlin & Conrad Hughes et.all, Manning, ISBN-13: 978-0138412067, 19973.CCNA ICND Sınav Sertifikasyon Rehberi, Wendell Odom, Çeviren:Muhammed Cinsdikici, Ali Yavuz Çakır, ISBN: 975-322-484-0Yazılım Paketleri:Cisco Packet Tracer 6.2. Student EditionCisco Packet Tracer 6.2. Student Edition TutorialCisco Aspire Game for Network Admins

Read the rest of this entry »

Posted in Bilisim Aglari | Leave a Comment »

UBI-547 Network Programming

Posted by cinsdikici on September 27, 2014

Course Unit Title Network Programming
Course Unit Code UBI 547
Course Time: Tuesday [18:00-21:00], Thursday [9:30-12:00]
Course Room: UBE, Room 103
Level of Course Unit M.Sc.
Number of ECTS Credits Allocated 7,5
Theoretical 3
Semester Fall
Name of Lecturer(s) Asst. Prof. Dr.Muhammed Cinsdikici
Mode of Delivery Face-To-Face
Language Turkish
Assistant Kaya Oğuz, kaya.oguz@ege.edu.tr, office phone: 3242
Prerequisities
Objectives of the Course Objectives of this course includes providing students with the understanding of current trends in communication protocols and providing them information about socket programming, inter-process communications and network research.
Textbook 1. InterProcess Communications in LINUX, John Shapley Gray, Prentice Hall, ISBN-13: 978-0130460424, 2003

2. C# Network Programming, Richard Blum, Sybex, ISBN: 978-0-7821-4176-4, 2002

3. Java Network Programming, Merlin & Conrad Hughes et.all, Manning, ISBN-13: 978-0138412067, 1997

Learning Outcomes
  1. Ability to understand OSI layers and protocols.
  2.  Ability to develop applications using TCP / ODP protocols
  3. Ability to develop multithreaded applications, ensure synchronization in shared memory environments.
  4. Ability to design complex network applications and present it.
Course Contents Linux Processes and Environment, Primitive Communications, Pipes, Process Message Queues, Semaphores, Shared Memory, Remote Procedure Call, Network Layer Programming [Sockets, TCP/UDP Programming], Application Programming Samples [ICMP, SNMP, SMTP, HTTP]
Grading & Projects %30 HomeWorks + %20 MidTerm + %20 Final Exam + %30 Final Project Late submission of the homeworks and projects are not going to be accepted. The assessment principals are;

————————————-

On time submission are scored as max.100/100

One week late submissions are scored as max. 80/100

Two weeks late submissions are scored as max. 60/100

Others are scored as 0.

Weekly Detailed Course Contents
WEEK NAME   SUBJECTS  
  Theoretical Slides Laboratory Suplementary Materials
1 Introduction Introduction YoLinux Fork / Exec Page
2 Processing Environments Processing Env Research Assignment
3 Process Life Cycle Process Life Cycle Process Creation Lab on Linux OS  ProcessesShells / SignalsProcesses and Threads
4 Primitive Communications Primitive Communications Java Thread Library Coding
5 Pipes Pipes – Sample Chapter Semaphore implementationCode assignment aboutJava threads
6 Message Queues  Research for Queue Systems Customer Queueing SystemSimulating QueueSabarimala Virtual Queue System 🙂
7   Midterm    
8 Semaphores Semaphore Deadlock avoidance implementation OS DeadlockBankers AlgorithmDeadlock in traffic
9 Shared Memory Memory Management LitterateurResearch  How CPU Works?Fetch/Decode/ExecutePage Tables
10 Remote Procedure Call / Remote Method Invocation Book Reading LRU Approaximation: Second Chance (!)Clock & Second Chance Algorithm s Presentation
11 Sockets  Research on Disk Drives
12 TCP Programming  Linux/Win8 File Management System Information
13 UDP Programming  FAT32/NTFS Info  UDP Protocol Details
14 Case Studies
15   Final Exam    

 

Recommended or Required Reading     2. Silberschatz Galwin, Operating System Concepts with JAVA, Wiley, 20041. Andrew S. Tanenbaum, Albert S.Woodhull, The Minix book: Operating Systems – Design and Implementation- (3.rd Edition),Prentice Hall, 20062. Silberschatz Galwin, Operating System Concepts with JAVA, Wiley, 2004

Read the rest of this entry »

Posted in Network Programming | Leave a Comment »

UBI621 – Digital Image Processing

Posted by cinsdikici on September 11, 2014

Course Unit Title Digital Image Processing
Course Unit Code UBI 621
Course Time: Friday [09:00-12:00]
Course Room: UBE, Room 103
Level of Course Unit PhD
Number of ECTS Credits Allocated 7,5
Theoretical 3
Semester Fall
Lecturer Assoc. Prof. Dr.Muhammed Cinsdikici,
Contact Info cinsdikici@gmail.com, office phone: 3205
Mode of Delivery Face-To-Face
Language Turkish
Assistant
Prerequisities Matlab Coding, C# coding, Linear Algebra,  No prior knowledge of vision is assumed.
Objectives of the Course – to make the student identify image processing methods,- comprehend importance of using computer in image processing,- construct basic image implementations with MATLAB program packet- develop image processing algorithms.
Textbook(s)
  1. Computer Vision: A modern Approach (2nd edt), David A. Forsyth, Jean Ponce, Prentice Hall, ISBN: 978-0136085928, 2011
  2. Computer Vision: Algorithms and Applications , Richard Szeliski, ISBN: 978-1-84882-934-3, Springer, 2011
  3. Digital Image Processing 3rd Edition (DIP/3e), Rafael C. Gonzalez, Richard E. Woods, Prentice Hall, ISBN:978-0135052679, 2008.
  4. Practical Image and Video Processing, Oge Marques, Wiley, ISBN: 978-0470048153 ,2011
Learning Outcomes At the end of this course, a student should be able to:

  1. Calculate image histograms and gray-scale transformation for image enhancement, explain histogram equilazation method
  2. Identify filtering methods in spatial and frequency domains and develop algorithms
  3. Calculate 2-dimensional Fourier Transformation of an image; calculate and analyse 2-dimensional convolution and apply it for the filtering purpose
  4. Comprehend mathematical morphology fundamentals and apply them for image processing purposes
  5. Recall basic MATLAB instructions and functions for basic image processing operations
  6. Apply image processing algorithms for real life problems
  7. Have the motivation to propose new solutions for image processing problems
  8. Realize the advantages of MATLAB program packet in algorithm development and develop image processing algorithms in MATLAB environment
Course Contents Objectives of this course are; to make the student identify image processing methods, comprehend importance of using computer in image processing, construct basic image implementations with MATLAB program packet and develop image processing algorithms.
Grading & Projects %30 HomeWorks + %20 MidTerm + %20 Final Exam + %30 Final Project Late submission of the homeworks and projects are not going to be accepted. The assessment principals are;————————————-On time submission are scored as max.100/100One week late submissions are scored as max. 80/100Two weeks late submissions are scored as max. 60/100Others are scored as 0.

 

ekly Detailed Course Contents
WEEK NAME   SUBJECTS  
  Theoretical Slides Laboratory Suplementary Materials
1 Introduction /Fundementals  Image Representation, Image Reading/Writing, Indexing Images, Converting Image Classes  Research Allignment  PinHole Camera (Obscura)
2 Intensity Transformations & Spatial Filtering  Image Intensity Transformations, Histogram Processing, Equalization/Matching, Linear/NonLinear Filtering a. Lecture-2-Filtering_Derivative_Noise

 

b. Intensity Transformations

 

c1. Histogram Equalization

 

c2. Histogram Equalization with Step by Step Exp

Base Paper Definition + Literatur Searching  a. Histogram Equalization Open Matlab Code

 

b. Local Histogram Equalization Open Matlab Code

3 Edge Detectors Primitive Detectors, Marr Hilderith, Canny Edge Detectors  Lecture-3-EdgeDetection Hmw#1: Histogram Matching a.  Marr Hilderith MatlabCode_Mohamed Athiqb. Canny Edge Detector Code Explanationc. Canny Edge Detector with Javad. Canny Edge Detector Tutorial Pagee. Canny Edge Detector without Matlabs functions
4 Image Features  Harris Corners, SIFT Features, SURF FEatures a.Lecture-4-Harris Corner Detection_Interest Points

 

b. Lecture-5-SIFT

Hmw#2: Detecting Corners with Harris Operator  a. Harris Corner Detector Logic

 

b. Edge & Corner Detection Lecture

 

c. Original SIFT code

 

d. SIFT Tutorial by Utkarsh Sinhae. ASIFT Method

 

f. SIFT Matlab Code

5 Frequency Domain Processing  Fundemental Concepts, BandPass (Low, High, Specified Intervals) Filters, Fourier Transforms a.Chapter 5 – Fourier Transformb. FFT Tutorial Video

 

c. Fourier for Beginners.

Hmw#3: SIFT Feature detection  a. Fourier Series and Transformation – Part 2

 

b. Fourier Series and Transformation – Part 3

 

c. Fourier Series Simpler Explanation Part I

 

d. Fourier Series Simpler Explanation Part II

6 Image Restoration Adding Noise, Noise Characteristics, Noise Filtering, Wiener Filtering, Geometric Transformations
7   Midterm    
8 Color Image Processing  Color Spaces (RGB, HSI, HSV, Lab)
9 Wavelet  Wavelet Transform, Inverse Wavelet
10 Image Compression  Huffman Codes (Encoding/Decoding), Color Compression, JPEG Compression
11 Morphological Image Procesing  Dilation, Erosion, Opening, Closing, Mophological Reconstruction
12 Image Segmentation  Point/Line/Edge Detection, Hough Transform, Thresholding, Region-Based Segmentation
13 Object Recognition  Distance Measure, Shape/Pattern Matching
14 Case Studies
15   Final Exam    

 

Additional  Reading     Video & Image Processing Tutorial Using C#/VS.Net, http://www.cogitance.com/files/videoprocessing/videoprocessing.htm

Read the rest of this entry »

Posted in Image Processing | Leave a Comment »

UBI 544 – Distributed Systems

Posted by cinsdikici on February 3, 2013

Course Time:

Wednesday, 09:30-12:00

Place:

UBE, Room 103

Instructor:

Assoc.Prof.Dr.Muhammed G. Cinsdikici, cinsdikici@gmail.com

Office Hours:

Wednesday, 13.30-15.30

Office Phone:

3205

Assistant:

Elif Acar Haytaoglu, elifacar101@yahoo.com

Office Phone:

3238

Platforms:  dissys@googlegroups.com

Description:

Overview of Operating Systems, Process Synchronization and Deadlocks, Threads and Thread Synchronization, Synchronization In Distributed Systems, Management of Time: Logical Clocks, Vector Clocks, Global States, Termination Detection. Distributed Mutual Exclusion: Central Algorithms, Lamport’s Distributed Algorithm, Token Based and Heuristic Algorithms. Distributed Deadlock Detection: Centralized and Distributed Algorithms, Election Algorithms, Agreement Protocols : Byzantine Agreement, Dynamic Scheduling in Distributed Systems, Static Scheduling in Distributed Systems, Distributed File Systems, Fault Tolerance in Distributed Systems, Distributed Real-Time Systems.

Prerequisites:

Operating Systems and Network Programing graduate/undergraduate level.

Textbooks:

1.** Advanced Concepts in Operating System, Mukesh Singhall and Niranjan Shivaratri, McGraw-Hill, 1994.2.** Distributed Computing: Principles, Algorithms, and Systems, Ajay D. Kshemkalyani, Chicago Mukesh Singhal, Cambridge Press, 2008, ISBN-13: 97805218763463.* Distributed Systems: Principles and Paradigms 2/E, Andrew S. Tanenbaum, Maarten van Steen, Prentice-Hall, 20084. Advanced .Net Remoting (C# Edition), Ingo Rammer & Mario Szpuszta, Apress, 2001.

5. InterProcess Communications in LINUX, John Shapley Gray, Prentice Hall, 2003

Bookstore Info –> http://pandora.com.tr

Projects

All Projects are due at the beginning of class. Due dates for projects will be announced at least a week ahead of time. No late submission will be accepted!.

Tests:

Students will have one final exam. Students will be tested on all material covered from lectures and text. Exams will test student’s ability of solving problems and understanding of concepts.

Grading:

 %15 Hmwrks + %15 Final Project + %30 MidTerm Exam + %40 Final Exam

Late Submission:

Late submission of projects will not be accepted.

Course Topics:

Lectures: Lecture01 – Introduction / Definition / Concepts

* Expanded by Paul Barry and Muhammed Cinsdikici chapter 01.ppt

* Tanenbaum Chapter 1-Introduction

* Tanenbaum Chapter 2-Architecture

* Kayhan_Erciye? CS633 03 chapter 1.ppt

* Prof.Dr.Stefan Leue (University of Freiburg)chapter 1.pdf

* Ihor Kuz (Urniversity_of_new_south_wales)chapter1.pdf

Lecture02 – Communication

* Cisco Systems OSI Model Presentation

* Expanded by Paul Barry and Muhammed Cinsdikici chapter 02.ppt

* Tanenbaum Chapter 4-Communication

* Prof.Dr.Stefan Leue (University of Freiburg)chapter 2.pdf

* Ihor Kuz (Urniversity_of_new_south_wales)chapter2.pdf

* Muhammed Cinsdikici MPI-Programming-Presentation.ppt

Lecture03 – Processes / Threads

* Threads

* Processes,

*Migration (University of Victoria Lecture Notes for Tanenbaum)

* Tanenbaum Chapter 3-Threads

* Expanded by Paul Barry and Muhammed Cinsdikici chapter 03.ppt

Thread Synchronization Sample Codes

Lecture04 – RPC/RMI

* RPC.ppt,

* RPC_Programming.ppt,

* Advanced-Socket Programming.ppt

* Jhon Shapley Gray, “IPC on Linux”, Chapter RPC.

* Geylani-RMI-Presentation.ppt

* Geylani-RMI Sample Codes

Lecture05 – Naming

* Expanded by Paul Barry and Muhammed Cinsdikici chapter 04.ppt

* Tanenbaum Chapter 5-Naming

* Ihor Kuz (Urniversity_of_new_south_wales)chapter11.pdf

Lecture06 – Synchronization

* Expanded by Paul Barry and Muhammed Cinsdikici chapter 05.ppt

* Tanenbaum Chapter 6-Synchronization / Elections / Mutual Exclusion

* Kayhan_Erciye? CS633 03 chapter 4.ppt

* Prof.Dr.Stefan Leue (University of Freiburg)chapter 3.pdf

* Ihor Kuz (Urniversity_of_new_south_wales) Sync-Part I.pdf & Sync-Part II.pdf

* Clocks (University of Victoria Lecture Notes for Tanenbaum)

* Supper-Clocks-Presentation-aos-5.ppt

* Clocks-Presentation-ch2.pdf

* MainClocks.htm

Lecture07 – Election Algorithms / Mutual Exclusion

* Mutual Exclusion-UVA-Comp.Science.pdf

* Tanenbaum Chapter 6-Synchronization / Elections / Mutual Exclusion

* Daniel Manasce-Sync in Dis.Systems.pdf

* Andrew Tanenbaum-7/e . chapter 06.ppt

* A Toolkit for the Simulation of Distributed Algorithms in Java.html

Lecture08 – Distributed Deadlock

* Distributed Deadlock

* Deadlocks in Distributed Systems

* Chandy-Misra-Haar’s Distributed Deadlock Detection

* Distributed DBMS Advanced Topics

Lecture09 – Agreement Protocols

* Agreement Protocols

* Byzantine Generals

* Consensus Concepts

Lecture10 –Fault Tolerance

 

Projects / Assignments:

Assignment 01 – Assignment#0Assignment 02 – Assignment#1Assignment 03 – Assignment#2Assignment 04 – Assignment#3Assignment 05 – Assignment#4Final Project – FINAL PROJECT

Posted in Distributed Systems | Leave a Comment »

MAB-233 Intro to Object Oriented Programming with JAVA

Posted by cinsdikici on October 22, 2012

OOBP

OOBP

Course Time: Wednesday, 10:30-12:30
Place: Izmir Unv., Room 304
Instructor: Assoc.Prof.Dr.Muhammed G. Cinsdikici, cinsdikici@gmail.com
Assistant: Deniz Özsoyeller
Lab Hour: Friday,10.30-12.20
Office Phone: +90(232) 311 3205
Platforms
* Group Info: izmirjava@googlegroups.com
Content: Introduction to Java. Class and Object Concepts, Control definitions, Methods in detail, arrays, Classes in detail, inheritence, multiclass, exception handling, files and streams, recursion, search and sorting.
Prerequisites: Graduate/undergraduate degrees from engineering faculties or software related departments. Fundemental computer archite. Familiarity with Operating Systems.
Textbooks: Java: How to Program, 9nd edition, Deitel & Deitel, 2012
Projects All Projects are due at the beginning of class. Due dates for projects will be announcedat least a week ahead of time. No late submission will be accepted!.
Tests: Students will have one final exam. Students will be tested on all material covered from lectures and text. Exams will test student’s ability of solving problems and understandingof concepts.
Grading: %20 HomeWorks + %30 MidTerm + %50 Final Exam
Late Submission: Late submission of projects will not be accepted.
Tools & Materials: 1. Netbeans / Eclips2. Java sdk & re
Week Date Lecture Readings Notes HomeWorks
1 03 October 2012 Introduction to Object Oriented Prg & Java
2 10 October 2012 Object and Class Concept
3 17 October 2012 Controls-I Hmw# 1
4 24 October 2012 Controls-II
5 31 October 2012 Deep Looking to Methods
6 07 November 2012 Arrays Hmw# 2
7 14 November 2012 Deep Looking to Object Classes
8 19-26  November 2012 Midterm
9 28  November 2012 Inheritance Hmw# 3
10 05 December 2012 Polymorphisim
11 12  December 2012 Exception Handling
12 19  December 2012 Strings & Character Objects Hmw# 4
13 26  December 2012 Files, Streams & Object Serialization
14 02 February 2012 Recursion, Search & Sort – I
15 09 February 2012 Recursion, Search & Sort – II
16 14-25 February 2012 Final Exam

 

Projects / Assignments:

Posted in OOP with Java | Leave a Comment »

MBIL 203 – Data Structures

Posted by cinsdikici on December 3, 2011

Course Time: Thursday, 09:30-12:00
Place: UBE, Room 19
Instructor: Assoc.Prof.Dr.Muhammed G. Cinsdikici, muhammed.cinsdikici@ege.edu.tr // cinsdikici@gmail.com
Assistant: Res.As. Züleyha Dağdeviren
Ofice Hour: Thursday,13.30-15.00
Office Phone: +90 (232) 484 34 34
Platforms 1. Netbeans / Eclipse

2. Java SDK & RE

Outcomes:
The purposes of the course for students are.1. Learn to program in Java
2. Learn to use the STL (Standard Template Library)
3. Learn to evaluate, select, and use libraries implementing algorithms and data structures
4. Learn key principles of algorithm and data structure design, students successfully completing the course will be able to;
a. Produce Java programs using, classes, objects, templates, pointers, references and I/O
b. Programs using binary trees and associated algorithms,
c. Designs of programming solutions independent of programming languages
d. Descriptions of the time and space requirements of algorithms and data structures to make appropriate design decisions5. The concept of templates in terms of generic programmingThe students successfully completing the course will be able to
1. Participate in project design teams
2. Contribute to various phases of software development from requirements through implementation
3. Trouble-shoot programs and implement fixes for software with performance problems
4. Port difficult-to-maintain legacy code to smaller, efficient, extensible code
Overview: How to program in Java, including how to evaluate, select, and use libraries that implement a variety of algorithms and data structures- Familiarize themselves with some of the key principles for designing algorithms and data structures.- Know how to write Java codes using templates, classes and objects, references, and Java input and output.

– Know how to write programs using binary search trees, and pointer and array representations of graphs.

– Learn about the time and space requirements of various algorithms and data structures, which will help them make sound programming choices.

-Learn how to implement the design principles of divide-and-conquer, backtracking, and dynamic programming.

Prerequisites: Graduate/undergraduate degrees from engineering faculties or software related departments. Fundemental computer architecture background. Familiarity Operating Systems
Textbooks Data Structures and Other Objects Using Java, 4/E, M.Main, Pearson, 2012Data Structures & Algorithms, M.T. Goodrich, R.Tamassia, Wiley, 2011

Data Structures & Algorithm Analysis in Java, M.A.Weiss, Pearson, 2007

Programlama ve Veri Yapılarına Giriş (C, C++ ve JAVA ile), Şadi Evren ŞEKER, 2009

 

Projects All Projects are due at the beginning of class. Due dates for projects will be announcedat least a week ahead of time. No late submission will be accepted!.
Tests: Students will have one final exam. Students will be tested on all material covered fromlectures and text. Exams will test student’s ability of solving problems and understandingof concepts.
Grading: %20 HomeWorks + %30 MidTerm + %50 Final Exam
Late Submission: Late submission of projects will not be accepted.
Tools & Materials:
* Microsoft Academic Program – Operating Systems- Student Resource Kit (1.93 Gbyte – ISO)
Lectures:
Week Date Lecture Reading Notes Homework
1 03 October 2012 Introduction to Java Programming
2 10 October 2012 Object Oriented Design
3 17 October 2012 Arrays Hmw# 1
4 24 October 2012 Linked Lists
5 31 October 2012 Stacks
6 07 November 2012 Queues Hmw# 2
7 14 November 2012 Generic Programming
8 19-26 November Midterm Exam
9 28 November 2012 Recursion Hmw# 3
10 05 December 2012 Tree’s: Fundementals
11 12 December 2012 Tree’s: More.. (Heap, B-Tree)
12 19 December 2012 Search Algorithms Hmw# 4
13 26 December 2012 Sort Algorithms
14 02 February 2012 Text Processing
15 09 February 2013 Graphs
16 14-25 February 2013 Final Exam
Projects / Assignments: Assignment 01 – Assignment#0Assignment 02 – Assignment#1Assignment 03 – Assignment#2Assignment 04 – Assignment#3Assignment 05 – Assignment#4Final Project – FINAL PROJECT

Posted in Data Structures | Leave a Comment »

MBIL-102 INTRODUCTION to C PROGRAMMING

Posted by cinsdikici on December 3, 2011

Course Time: Monday, 09:30-12:30
Place: UBE, Room 220
Instructor: Assoc.Prof.Dr.Muhammed G. Cinsdikici, cinsdikici@gmail.com
Assistant:
Ofice Hour: Monday,13.30-14.30
Office Phone: +90(232) 311 3205
Platforms
* Group Info: gedizcprog@googlegroups.com
Content: Programming with C, Structured Development in C, Functions, Arrays, Pointers, Data Structures, File Processing and other important programming concepts.
Prerequisites: Graduate/undergraduate degrees from engineering faculties.Fundemental computer architeFamiliarity with UNIX/Linux Operating Systemscture background.
Textbooks: C How to Program (6.th Edt), Paul Deitel and Harvey Deitel, Pearson, 2010The bookseller info:

1. Pandora, pandora.com.tr

http://www.pandora.com.tr/urun/c-how-to-program-6e-pie/191946

2. Amazon, amazon.com

http://www.amazon.com/C-How-Program-Paul-Deitel/dp/0136123562/ref=sr_1_1?ie=UTF8&qid=1300043301&sr=8-1

Projects All Projects are due at the beginning of class. Due dates for projects will be announcedat least a week ahead of time. No late submission will be accepted!.
Tests: Students will have one final exam. Students will be tested on all material covered from lectures and text. Exams will test student’s ability of solving problems and understandingof concepts.
Grading: %20 HomeWorks + %30 MidTerm + %30 Final Exam + %20 Final Project
Late Submission: Late submission of projects will not be accepted.
Tools & Materials: 1. Microsoft Visual C++ Express Edition (for Windows) [http://www.microsoft.com/express/vc]

2. GNU C++ (for Linux) [http://gcc.gnu.org/install]

3. Deitel’s Home for book [http://www.deitel.com/Books/C/CHowtoProgram6e/tabid/3527/Default.aspx]

Lectures:

Lecture01 – Introduction to Computers, the Internet and the Web

Lecture02 – Introduction to C Programming

Lecture03 – Structured Program Development in C

Lecture04 – C Program Control

Lecture05 – C Functions

Lecture06 – C Arrays

Lecture07 – C Pointers

Lecture08 – C Characters and Strings

Lecture09 – C Formatted Input/Output

Lecture10 – C Structures, Unions, Bit Manipulations and Enumerations

Lecture11 – C File Processing

Lecture12 – C Data Structures

Lecture13 – C Preprocessor

Lecture14 – Other C Topics

Lecture15 – C++ as a Better C; Introducing Object Technology

Lecture16 – Introduction to Classes and Objects

Lecture17 – Classes: A Deeper Look, Part 1

Lecture18 – Classes: A Deeper Look, Part 2

Lecture19 – Operator Overloading

Lecture20 – Object-Oriented Programming: Inheritance

 

Lecture21 – Object-Oriented Programming: Polymorphism

Lecture22 – Templates

Lecture23 – Stream Input/Output

Lecture24 – Exception Handling

Projects / Assignments: Assignment 01 – Assignment#0Assignment 02 – Assignment#1

Assignment 03 – Assignment#2

Assignment 04 – Assignment#3

Assignment 05 – Assignment#4

Final Project – FINAL PROJECT

Posted in C Programming | Leave a Comment »

UBI 521 – Machine Learning (Fall, 2016)

Posted by cinsdikici on December 3, 2011

Course Time:

Wednesday, 13:15-16:15

Place:

UBE, Room 103

Instructor:

Assoc.Prof.Dr.Muhammed G. Cinsdikici, cinsdikici@gmail.com

Office Hours: Wednesday,13.30-15.30 Office Phone: 3205 / 0(232)311 3205

Assistant(s):

Cemre Candemir / Dr.Kaya Oğuz (Office Phone:3242 / 0(232)311 3242)

Class Group

Ube ML Class Google Group

Description:

Machine Learning Introduction, Regression, Multivariate Regression, Gradient Descent Learning, Logistic Regression, Regularization, Artficial neural networks, biological foundations, cognitive processes and their modeling using artificial neural networks, problem solving using neural networks, supervised/unsupervised learning, Support Vector Machines, Principle Component Analysis, Naive Bayesian Learning.

Prerequisites:

Matlab or one of the Programing languages (Java, C#), Statistics & Mathematics background for engineering departments

Textbooks:

2015, Sebastian Raschka, “Python Machine Learning”, PACKT Publishing, ISBN: 978-1-783-55513-0

2014, Ethem Alpaydin, “Introduction to Machine Learning – 3rd edt, MIT Press, ISBN: 978-0-262-02818-9

2012, Kevin P. Murphy, “Machine Learning”, MIT Press, ISBN: 978-0-262-01802-9

2009, Simon Haykin, “Neural Networks and Learning Machines – 3rd edt”, Prentice Hall, ISBN: 978-0-131-47139-9

2007, Christopher Bishop, “Pattern Recognition and Machine Learning”, Springer, ISBN: 978-0-387-31073-2

2004, Mehmet Ö. Efe, “Artificial Neural Networks and Their Applications”, Boğaziçi University Publications, ISBN: 975-5-18223-3

1994, Laurene Fausett, “Fundementals of Neural Networks”, Prentice Hall, ISBN: 978-0-133-34186-7.

Projects

All Projects are due at the beginning of class. Due dates for projects will be announced at least a week ahead of time. No late submission will be accepted!.

Tests:

Students will have one final exam. Students have to submit their final Technical Report to any journal in SCI or SCI-Expanded or conference in related area.

Grading:

  %30 MidTerm + %20 Homeworks + %25 FinalExam + %25 Final Project

Late Submission:

Late submission of projects will not be accepted.

Programming Platforms/Tools:

1. Matlab 2011b

2. Python 2.7 + Machine Learning Libraries

3. Visiual Studio 2015  + {OpenCV / Accord.NET etc..}

Suplimentary Best Video Lectures:

1. Andrew NG – Machine Learning – Stanford

2. Yaser Abu Mostafa – Machine Learning – Caltech

3. Patrick Winston – Artificial Intelligence – MIT

Lectures:

Lecture01 –  Introduction to Machine Learning

* Introduction to Machine Learning

Lecture02 –  Linear Regression with One Variable

* Linear Regression with One Variable

* Linear Algebra Background

Lecture03 – Linear Regression with Multiple Variables

* Linear Regression with Multiple Variables

                      * Matlab Scripting Backgound (Optional: Python) 

* Matrix Tutorial (Option)

Lecture04 – Logistic Regression

* Logistic Regression

Lecture05 – Regularization

* Regularization

Lecture06 – Neural Network Fundementals, Components

* Cinsdikici-Introduction Presentation

* Simon Haykin – Introduction to Neural Nets

* Simon Haykin – Perceptron

* Neural Nets Presentation

* Prof. Leslie Smith – Introduction to Neural Network

* Christos Stergiou and Dimitrios Siganos – Introduction to Neural Networks

* Genevieve Orr – Motivation for Neural Networks

* Learning Artificial Neural Networks [Robotics]

* Continuous_Mathematic_Notes.pdf

* Perceptron – Applet Demo

Lecture07 – Neural Network Models

*BackPropagation

* Khonen’s {SOM / LVQ 1, 2, 3}

Lecture08 – NeoCognitron – “Convolutional Neural Net” Deep Learning Model

                        * Cinsdikici – Neocognitron Variants/LeNet5

Lecture09 – SVM – Support Vector Machines

Lecture10 – Clustering

Read the rest of this entry »

Posted in Machine Learning | Leave a Comment »