Petri Heinonen (peheinon@mit.jyu.fi)
Tommi Lahtonen (tjlahton@mit.jyu.fi)
Time schedule: Lectures 20h on weeks 43-49, Tue and Thu 16-18 in Ag aud.1, exercises 14h. Contents: Creating WWW pages according to the W3C recommendations. Cascading Style Sheets (CSS). Forms. Information retrieval from WWW. Local Area Networks. Viruses. Security. Lectured in Finnish. Teaching methods: Lectures, exercises, assignment. Pass types: Final exam.
Timo Männikkö (mannikko@mit.jyu.fi)
Time schedule: Lectures 48h on weeks 36-47, Thu 12-14 and Fri 8-10 in Ag C231.1, exercises 16h. Contents: Methods of numerical mathematics, e.g. solving nonlinear equations, solving linear systems of equations, interpolation, quadrature and differentiation, solving differential equations. Lectured in Finnish. Can be completed in English. Literature: Conte & de Boor: Elementary numerical analysis, An algorithmic approach (3rd edition), McGraw-Hill, 1980, pp. 1-45, 51-61, 72-184, 208-234, 284-404. Prerequisities: Basic studies in Mathematics, programming skills (C/C++ or Fortran90). Teaching methods: Lectures, exrcises, assignment. Pass types: 2 mid-course exams.
http://www.mit.jyu.fi/~mannikko/nm/
Pentti Hämäläinen (hamalain@mit.jyu.fi)
Time schedule: Lectures 30h on weeks 36-42, Mon 14-16 in Ag aud.3 and Wed 14-16 in Ag aud.2, exercises 12h. Contents: Basic data structures. Tree structures. Graphs and networks. Priority queues. Searching and sorting. Literature: Weiss: Data Structures and Algoritmihm Analysis in C++. Prerequisities: C++ Programming. Teaching methods: Lectures, exercises, assignment. Pass types: Final exam.
Pentti Hämäläinen (hamalain@mit.jyu.fi)
Time schedule: Lectures 24h on weeks 43-49, Mon and Wed 14-16 in Ag aud.2, exercises 12h. Contents: Algorithm design methods: divide-and-conquer, dynamic programming, greedy algorithms. Analysis of algorithms. Polynomial time reductions and NP-complete problems. Literature: Weiss: Data Structures and Algorithm Analysis in C++. Prerequisities: Data Structures and Algorithms 1. Teaching methods: Lectures, exercises, assignment. Pass types: Final exam.
Markus Inkeroinen (marink@mit.jyu.fi)
Time schedule: Introductory lecture 2h on week 37, Mon 8-10 in Ag aud.2. Contents: Fortran 90/95 programming language in Unix environment. Subroutine library NAG. This course and the course Numerical Methods can be taken simultaneously. Prerequisities: Introduction to Programming. Preferably also C++ Programming. Teaching methods: Lecture, exercises 14h or assignment.Independent study with the help of lecture notes and WWW material. Pass types: Final exam.
Vesa Lappalainen (vesal@mit.jyu.fi)
Contents: Programming of graphical user interfaces in Windows environment. Component based programming with Delphi. Quick introduction to object oriented programming on the beginning of the course. Prerequisities: C++ Programming. Teaching methods: Lectures, exercises, assignment. Pass types: Final exam.
http://www.mit.jyu.fi/~vesal/kurssit/winohj02/
Tommi Kärkkäinen (tka@mit.jyu.fi)
Time schedule: Lectures 16h on weeks 43-49, Tue 14-16 in Ag Beeta, exercises 28h (last one on week 10/03). Contents: The course starts with a short introduction to Matlab-environment. The principal topic is construction, prototyping, testing, visualization, and application of MLP neural network using the environment. Basic work form is based on the activity during exercises. Literature: Lecture notes (partly in Finnish) Reed&Marks: Neural Smithing - Supervised Learning in Feedforward Artificial Neural Networks Orr&Muller (eds.): Neural Networks: Tricks of the Trade
Timo Tiihonen (tiihonen@mit.jyu.fi)
Time schedule: Lectures 40h on weeks 36-49, Tue 12-14 and Thu 8-10 in Ag C231.1, exercises 16h. Contents: Random numbers and Monte Carlo methods, methods for discrete time simulation, statistical analysis of simulation experiments, design of simulation experiments. Lectured in english. Prerequisities: Basics of probability/statistics, basic programming skills. Teaching methods: Lectures, exercises.
http://www.mit.jyu.fi/tiihonen/simul/
Jarmo Ernvall (ernvall@mit.jyu.fi)
Time schedule: Lectures 36h on weeks 36.44, Tue 8-10 and Wed 10-12 in Ag Alfa, exercises 18h. Contents: Methods of algorithm analysis, balanced binary trees, heaps, binomic forests, network algorithms, computational geometry. Literature: Cormen, Leiserson & Rivest: Introduction to Algorithms. Prerequisities: Data Structures and Algorithms 1 and 2, Courses in Mathematics: Approbatur and Introduction to Discrete Mathematics (recommended). Teaching methods: Lectures, exercises.
http://www.cc.jyu.fi/~ernvall/alg.html
Jouni Raitamäki (jtr@mit.jyu.fi)
Time schedule: Lectures 20h on weeks 37-41, Tue and Wed 10-12 in Ag Beeta. Contents: Features and patterns. Principles of statistical classification. Bayes decision theory. Clustering methods. Projection methods. The linear perceptron model. Validating results. Sample applications. Literature: Duda, Hart: Pattern Classification and Scene Analysis, part I. Prerequisities: Introduction to Probability Theory. Teaching methods: Lectures, exercises. Pass types: Final exam.
Time schedule: Lectures on weeks 37-48, Thu 14-16 and Fri 10-12 in Ag Beeta, exercises 16h. Contents: Principles of computer graphics. Geometric transforms in two and three space dimensions. Composition of geometric models. Algorithms for problems in plane geometry. Scan conversion of primitive shapes. Rotations in three dimensions, quaternions. Projections, normalization of a view. Visible surface determination. Illumination models, mapping techniques. Elementary ray tracing. Teaching methods: Lectures, exercises. Pass types: Final exam, assignment.
http://www.mit.jyu.fi/tro/gtk02/
Jarkko Vuori (Jarkko.Vuori@jyu.fi)
Time schedule: Lectures 28h on weeks 43-50, Tue and Thu 10-12 in Ag Alfa. Contents: This course handles real-time scheduling with Rate Monotonic method and concurrent programming. Literature: Lecture notes. Prerequisities: TIE 221 Basics of Operating Systems. Teaching methods: Lectures. Pass types: Exam.
http://tisu.mit.jyu.fi/embedded/TIE342/TIE342.htm
Time schedule: Lectures 20h on weeks 43-49, exercises 10h. Contents: Going deeply into core of embedded systems: processor architectures, attached components, channels, and memory techniques. Also requirements of carriable devices for powerful embedded systems are studied. Assignment of a topic informed later. Literature: Lecturenotes. Prerequisities: Electronics 1. Teaching methods: Lectures, exercises, assignment. Pass types: Exam.
Antti-Juhani Kaijanaho (antkaij@mit.jyu.fi)
Time schedule: Lectures 30h on weeks 37-44, Tue 12-14 in Ag Beeta and Wed 12-14 in Ag C231.1, exercises 14h. Contents: Concepts and constructs of programming languages, procedural languages, object-oriented languages, functional languages, logic languages, scripting languages, language specification techniques. The course includes a seminar and either a traditional exam or a dialogue exam, at the student's choice. Literature: Scott: Programming Language Pragmatics; Sethi: Programming languages - concepts and constructs; Sebesta: Concepts of Programming Languages; Louden: Programming languages - principles and practice. Prerequisities: Data Structures and Algorithms 1, Automata and Formal Languages.
http://www.mit.jyu.fi/antkaij/opetus/okp2002/
Tommi Hytönen (tommi.hytonen@jyu.fi)
Time schedule: Lectures 24h on weeks 43-48, Tue 8-10 and Thu 12-14 in Ag aud.2, exercises 12h Contents: Architecture of fixed telecommunications network, switching and switch control, transmission techniques. Phone, modem and other terminal equipments. Digital interfaces, packet switching, ISDN and broadband communication. Teleservices. Lectured in Finnish. Can be completed in English. Prerequisities: Introduction to Communication Systems. Teaching methods: Lectures, exercises.
Antti Niemi (antti.niemi@mit.jyu.fi)
Time schedule: Lectures 36h, exercises 14h, autumn 2002. Contents: Important functions. LTI-system and convolution, discrete and continuous. Fourier-series, trigonometric and exponential form. The amplitude and phase spectrum of a signal. Modulation. The Fourier transform, the density spectrum. The energy of a signal, Parseval's identity. The discrete Fourier transform. The sampling theorem, window functions. The Laplace transform and its inverse. The transfer function, stability of a system. The Z-transform and difference equations. (The wavelet-transform) Literature: Antti Niemi: Fourier-analyysi ja Laplace-muunnos. Teaching methods: Lectures, demonstrations. Pass types: Exam.
Jyrki Joutsensalo (jyrkij@mit.jyu.fi)
Time schedule: Lectures 28h on weeks 43-49, Mon and Thu 10-12 in Ag C231.1, exercises 8h. Contents: Principles and applications of signal processing. Linear discrete time systems (LTI), sampling, convolution, aliasing, transfer function, discrete Fourier transform etc. Literature: A.V. Oppenheim and A.S Wilsky, Signals and Systems, Prentice-Hall 1983. Prerequisities: Integral transforms. Teaching methods: Lectures, exercises. Pass types: Exam.
Lari Kannisto (kalahe@cc.jyu.fi)
Time schedule: Lectures 36h on weks 37-45, Mon 10-12 in Ag Alfa and Wed 10-12 in Ag aud.3. Contents: Introduction to SDL (Specification and Description Language): SDL's capabilities and limitations, process behavior definitions by using finite state machines, presenting information in SDL. Theory and Implementation of Telecommunication Protocols. Literature: G. J. Holzmann: Design and Validation of Computer Protocols, Prentice Hall, 1991. http://cm.bell-labs.com/cm/cs/what/spin/Doc/Book91.html Stevens, W.R.: TCP/IP Illustrated, Vol. 1.: The Protocols, Addison-Wesley, 1994. Stallings, W.: Data and Computer Communications, Prentice-Hall, 1999 http://WilliamStallings.com/DCC6e.html Stallings, W.: High-Speed Networks: TCP/IP and ATM Design Principles, Prentice-Hall, 1998 http://williamstallings.com/HsNet.html Prerequisities: Basic knowledge on programming and telecommunications. Teaching methods: Lectures, assignment.
Timo Hämäläinen (timoh@cc.jyu.fi)
Time schedule: Lectures on weeks 36-42, Tue and Wed 12-14 in Ag C234.1, laboratory work 16h. Contents: Lectures 24 h, exercises 16 h. Designing of the WAN networks; components, protocols and management. The student learns the basics of routing protocols (RIP, OSPF, BGP) Mechanisms for QoS will also be shown. Lectured in Finnish. Can be completed in English. Ask literature from lecturer. Literature: W. Stallings: Data and Computer Communications, Fifth edition, Prentice Hal$ Chapters 12, 13, 14, 15, 16, 17. 6th edition chapters:12-17. Lisäluettavaa: C. Huitema: Routing in the Internet W. Stallings: High-speed networks, TCP/IP and design principles Teaching methods: Lectures, exercises. Pass types: Exam, exercises
http://www.cc.jyu.fi/~timoh/kurssit/verkot/verkot.html
Vagan Terziyan (vagan@it.jyu.fi)
Time schedule: Lectures 16h on weeks 47-50, Thu and Fri 10-12 in Ag C234.1, exercises 6h. Contents: The course focuses on the use of Distributed Artificial Intelligence methods and more specifically of Intelligent Agents Technologies in Mobile Computing. Appropriate AI methods and technologies will be reviewed. Also the specifics of the use of Intelligent Agents, Machine Learning, Data Mining and Knowledge Discovery methods in Mobile Environment will be considered. Course also considers modern applications for these methods for WEB Content Personalization, Filtering, User Profiling, Digital Assistance, and others. Lectured in English. Teaching methods: Lectures, exercises, assignment. Pass types: Final exam.
Matthieu Weber (mweber@mit.jyu.fi)
Time schedule: Lectures 12h viikoilla 36-42, Mon 12-14 in Ag C234.1, exercises 6h. Contents: The course focuses on the separation of content and presentation when producing documents, using tools like XML/XSL, SGML/DSSSL, HTML/CSS, HyTime, LaTeX. Lectured in English. Prerequisities: Basic knowledge of Unix systems. Teaching methods: Lectures, exercises. Pass types: Final exam.
Jani Kurhinen (kurhinen@mit.jyu.fi)
Time schedule: Lectures 18h on weeks 37-42, Mon and Wed in Ag C234.1, seminars 6h. Contents: The aim of the course is to give students an introduction to and familiarize them with mobile information devices. New challenges and special features of the mobile terminals as well as different types of a mobility are considered. Lectured in English. Teaching methods: Lectures, group sessions. Pass types: Active participation to group sessions and a final exam.
http://www.cc.jyu.fi/~kurhinen/tli380.html
Matthieu Weber (mweber@mit.jyu.fi)
Time schedule: Lectures 12h on weeks 43-49, Tue 10-12 in Ag C234.1, exercises 24h. Contents: This course deals with two mobile computer -oriented operating systems: EPOC and PalmOS; it also briefly presents Java MicroEdition. The aim is to familiarize the students with the specific features and constraints of those systems and with the tools used to develop applications to those targets. Lectured in english. Prerequisities: TLI380 Mobile Information Devices, Programming in C, C++ and Java. Teaching methods: Lectures, laboratory demonstrations and exercises. Pass types: Final assignment work.