ELTE IK fejléc
Navigációs hivatkozások átugrása
Tanulj nálunk!
Navigációs hivatkozások átugrása
Informatika Doktori Iskola
Kari doktori támogatások rendszere
Erasmus Mundus - TEAM
Egyéb ösztöndíjak
Kari tudományos díj
Vendégelőadások 2014/2015
Vendégelőadások 2013/2014 őszi félév
Vendégelőadások 2011/2012 tavaszi félév
Vendégelőadások 2011/2012 őszi félév
Vendégelőadások 2010/2011 tavaszi félév
Vendégelőadások 2010/2011 őszi félév
Nyári Iskolák

IKP-VEND/2 Approaches in Distributed Artificial Intelligence

oktató: Dr. Bora I. Kumowa (Izmir Institute of Technology)

Időpont: 2010. szeptember 13-18.

kreditérték: 1 kredit


hétfő (szept.13.)

kedd (szept. 14.)

szerda (szept. 15.)

csütörtök (szept. 16.)

péntek (szept. 7)








0-311 König




0.100B Cseh-Szombathy

The main objective is to study advanced concepts for distributed artificial intelligence applications, such as distribution, simulation, planning, co-evolutionary computation, fuzzy logic, syllogisticreasoning and sample combinations of these concepts for efficiently solving hard problems. Distributed planning is required for enabling co-operative working of agents. Distributed simulation is required for virtual execution of distributed plans, in order to test a plan before its real implementation. Efficient data distribution techniques are essential for managing distributed knowledge and other resources effectively. Co-evolutionary computation helps solving hard problems in polynomial time, such as distributed planning. Syllogistic approximate reasoning can be employed for automated reasoning over inductively learned knowledge and therefore promises an efficient approach for distributed planning over inductively learned knowledge.


IKP-9167V - Erlang by Example course

Előadó: Nagyné Vig Aniko

2010.09.13-17. minden nap 14-16 óra

helyszín: ELTE IKKK épület (Barakk), 1117 Bp., Bogdánfy u. 10/B

The course is designed for beginners in Erlang and for students who already attended the Erlang course, but would like to enrich their knowledge and programming style. The lessons will contain very short introductions about the requested areas followed by workshop like exercises. 

Course objectives:

  • Read, write and design Erlang programs
  • Develop concurrent systems in Erlang
  • Develop distributed systems in Erlang
  • Perform hot code updates
  • Use the Erlang development environment and tools
  • Apply test practices for Erlang development

Course contents:

  • Basic Erlang - data types, variables, complex data structures, pattern matching, function calls, modules, starting the system, shell commands, erlang mode for Emacs
  • Sequential Programming -- Conditional evaluation, guards, recursion, built in functions, libraries, manual pages, the debugger, runtime errors, catch and throw
  • Concurrent Programming -- Creating processes, message passing, receiving messages, data in messages, registered processes, timeouts, the Process manager
  • Process Design Patterns -- Client server models, finite state machines, event handlers
  • Process Error Handling -- links, exit signals, definitions, propagation semantics, robust systems, a robust server
  • CodeUpdating -- Software update, code server, the .erlang file
  • Records and Funs -- Records, records and the shell, funs, higher order functions
  • Erlang Term Storage -- ETS tables, handling elements, searching and traversing, match specifications and selection, table visualizer
  • Distributed Programming -- Distributed systems, Erlang distribution, node connections, distributed BIFS, net kernel
  • Ports and Sockets -- Ports, sockets, UDP, TCP
  • Style and Efficiency -- Style, efficiency, coding strategies


IKP-9166V - Erlang OTP course

Előadó: Nagy Tamas

2010.09.13-17. minden nap 16-18 óra

helyszín: ELTE IKKK épület (Barakk), 1117 Bp., Bogdánfy u. 10/B

The course is designed for advanced Erlang students, who already successfully attended the Erlang course. 

Course Objectives: 

  • Use existing Design Patterns supported by Erlang and OTP
  • Apply Generic Behaviours, Finite State Machines and Event handler Patterns
  • Use the Supervisor and Applicaton Behaviours Patterns
  • Write your own Design Patterns
  • Structure large Erlang based systems
  • Design fault-tolerant systems

Course contents:

  • Introduction -- OTP components, applications and libraries, system design principles
  • Behaviours -- Design patterns, behaviours and a server example
  • Generic Servers -- Generic servers, starting a server, message passing, termination, other messages, timeouts, other issues
  • Finite State Machines - Finite state machines, FSM example, generic FSMs, asynchronous messages, synchronous messages, termination, timeouts
  • Supervisors -- Supervisors, Supervisor example, generic supervisors, dynamic children, non OTP compliant processes
  • EventHandlers -- Events, event handlers, adding handlers, sending events, swapping handlers, deleting handlers, event handler example
  • Applications -- Applications, starting applications, stopping applications, application files, distributed applications, application monitor
  • SpecialProcesses -- Non OTP behaviours, starting non OTP behaviours, system messages, special process example, creating behaviours.


IKP-9166/V1 From Domains to Requirements – a new approach to software engineering

Oktató: Prof. Dines Bjørner (Technical University of Denmark)

Időpont: 2010. október 11 –22., hétfő-péntek minden nap

AM Lecture Session 9:00-11:00 óra

PM Project Tutoring Session 14:00-16:00 óra

kreditérték: 2 kredit  

Helyszín: ELTE Informatikai Kar, 1117 Bp., Pázmány Péter sétány 1/C, 2.702-es terem


  • The aim of the course is to cover a number of "front-of-the-wave" software engineering topics:
    • two of the three Triptych of Software Engineering phases of
      • Domain Engineering and
      • Requirements Engineering.

It is the aim to show how these two phases relate.

    • To show the dual benefit of both
      • precise national language Narratives coupled with
      • Formal Specification.
    • To show that the new element of software engineering, namely domain engineering,
      has a number of precise methodological stages of
      • intrinsic,
      • support technology,
      • rules & regulations,
      • script,
      • management & organisation and
      • human behaviour


  • To show that requirements engineering now has a rather different methodology, including:
    • domain requirements, with its
      • projection,
      • instantiation,
      • determination,
      • extension and
      • fitting

domain-to-requirements operations.

A kurzusról részletes információk a következő honlapon érhetők el:



IKP-9162/V1 Advanced functional programming

Professor Marinus J. Plasmeijer (University of Nijmegen)

Időpont: 2010. November 8-12.

kreditérték: 1 kredit


hétfő (nov. 8.)

kedd (nov. 9.)

szerda (nov. 10.)

csütörtök (nov. 11.)

péntek (nov. 12.)








0-311 König


0-805 Fejér Lipót terem


0.100B Cseh-Szombathy


In this course advanced programming concepts will be taught. We will address:

1. generic programming;

2. combinatorical programming;

3. advanced concurrency concepts;

4. advanced data structures.



Insight in some state-of-the-art advanced programming concepts, their theoretical background and their practical applicability.


1.       generic programming: theoretical background, overloading, type constructor classes, kind indexing;practical applications: common generic functions, web-applications, workflow applications;

2.       combinatorical programming (monadic programming, parser combinators);

3.       advanced concurrency concepts (Software Transactional Memory);

4.       advanced data structures (Generalized Algebraic Datatypes).


Examination: Written, closed book.

Pre-requisites: Basic knowledge about functional programming in general (Clean or Haskell). 

Literature: Scientific papers on the topics above which will be handed out during the course. 

Extra information: For practical experience we use the state-of-the-art functional language Clean.


Tricks of the Hackers: System Function Hooking in MS Windows

Előadó: Dr. Wolfgang Koch (Jénai Friedrich Schiller Egyetem)

Időpont: 2010. szeptember 30. (csütörtök) 14:00-16:00 óra

Helyszín: ELTE Informatikai Kar 2.512-es terem (Információs Rendszerek Tanszék) 

Intercepting API calls is a mechanism for testing, monitoring, and reverse engineering as well as for altering the behaviour of the operating system or of 3rd party products. User mode API hooking, which can be done by modifying the Import Address Table of the target module, affects the manipulated process only. To be effective on a system wide basis, a hook must be placed in the operating system, in kernel mode. A kernel mode driver can be written that changes addresses in the System Service Dispatch Table (SSDT) to point to new functions the driver pushed under- neath the OS to replace system service functions of the native API. This is the way, stealth viruses and root kits work to conceal their presence. Computer engineers should be aware of these possibilities, in order to avert them.

In the talk, this method is demonstrated by hooking a system function that is essential to create processes. The hook can be utilized in any kind of parental control software, e.g. for logging or for preventing certain programs from running. This can be expanded to accomplish a secure environment that prevents execution of any program that does not appear on a list of allowed software. As a result, the PC is protected against add-on spyware, worms, and trojans.


IKP-9169V Computational topology

Előadó: Dr. Martin Hünniger (Jénai Friedrich Schiller Egyetem)

Időpont: 2010. szeptember 27-október 1. minden nap 16:00-17:30 óra

Helyszín: ELTE Informatikai Kar 2.212-es terem (Komputeralgebra Tanszék)

Topological methods play a crucial role in modern image analysis, data mining and statistical methods. Since topology is mostly a field of pure mathematics, the topic is a new field to most computer scientists. The lecture will provide an introduction to computational topology by providing the mathematical background and an overview on the most useful algorithms for computing topological invariants like homology, Betti-numbers and the persistent topology. 

The lecture aims to be self contained and no foreknowledge is required. But some basics in group theory and interest in algorithm theory can be quite handy.


 Title:  k-root words, new distance results, and new problems

előadó: Dr. Gerhard Lischke (Jénai Friedrich Schiller Egyetem)

időpont: 2010. október 7. (csütörtök) 14:00-16:00 óra

helyszín: ELTE Informatikai Kar 2.212-es terem (Komputeralgebra Tanszék) 

In connection with generalized periodicity and primitivity of words, in the last year we formulated 7 important unsolved questions. In the meantime two of them could be solved partially. We defined six kinds of roots of words and asked for the existence of words the six roots of them are different each other. By the definition of Lohmann words and showing their existence we give an affirmative answer on this question. The second question concerns the greatest minimal distance of words of length n to the languages of generalized periodic words over two-letter alphabets, where we could confirm a formerly conjecture. The solved problems raise some new questions.



Elérhetőség - Formázott szöveghez, táblázatokhoz és képekhez.  Elérhetőség

Tudományos és Nemzetközi Kapcsolatok Csoportja

Cím: 1117 Budapest, Pázmány Péter sétány 1/C, 2.317-es szoba 
Postacím: 1518 Budapest, Pf. 120
Tel.: 372-2500/8199
Fax: 381-2236, 372-2500/8136
E-mail: ik_tnkcs@inf.elte.hu

Nagyobb térképre váltás