Lecturers: Andreas Rieder, Christian Wieners, Nicolas Neuss Credit points (CP): 7,5 Hours per week: 4/2/2
Term: Wintersemester Level: 1 Teaching language: Deutsch
Part of the modules: Mathematics [IW1MAMATH] (S.24)
Learning Control / Examinations
Assessment will consist of a written exam following §4, Abs. 2, 1 of the Prüfungsordnung für Informationswirtschaft and a marked proof of attendance as result checking following §4, Abs. 2, 1 of the Prüfungsordnung für Informationswirtschaft.
Prerequisites
None.
Conditions
None.
Learning Outcomes
The aim of of the course “Mathematics I” is to impart a comprehension of basic methods in linear algebra.
Content
The two lectures „Mathematics I and II for the subject area Information Systems“ ,edoate basic mathematical knowlegde which is requiered to understand modern computer science and economical sciences. Part I is concerned with linear algebra including the basic algebraic structures, vector spaces and linear mappings. These structures are important for example in computer science.
Media
blackboard, data projector and transparencies if necessary
Basic literature
None.
Complementary literature
• Offer for interested and top students Ammann / Escher: Analysis I–III, Birkhäuer • Tutorials / simpler literature alternatives
Henze / Last: Mathematik für Wirtschaftsingenieure I–II, Teubner Ansorge / Oberle: Mathematik für Ingenieure I–III, Wiley
76 7.1 Courses of term 1-4
Course: Mathematics II for Information Engineering and Management Course key: [01877]
Lecturers: Andreas Rieder, Christian Wieners, Nicolas Neuss Credit points (CP): 7,5 Hours per week: 4/2/2
Term: Sommersemester Level: 1 Teaching language: Deutsch
Part of the modules: Mathematics [IW1MAMATH] (S.24)
Learning Control / Examinations
Assessment will consist of a written exam following §4, Abs. 2, 1 of the Prüfungsordnung für Informationswirtschaft and a marked proof of attendance as result checking following §4, Abs. 2, 1 of the Prüfungsordnung für Informationswirtschaft.
Prerequisites
Mathematics I
Conditions
None.
Learning Outcomes
The aim of the course “Mathematics I” is to impart a comprehension of basic methods in analysis.
Content
The letures in mathematics give an overview in basic mathematical knowlegde which is requiered to understand modern computer science and economical sciences. Part II constists of analysis including an introduction into the calculus of functions of one or several variables.
Media
blackboard, data projector and transparencies if necessary
Basic literature
none
Complementary literature
• Offer for interested and top students Ammann / Escher: Analysis I–III, Birkhäuer • Tutorials / simpler literature alternatives
Henze / Last: Mathematik für Wirtschaftsingenieure I–II, Teubner Ansorge / Oberle: Mathematik für Ingenieure I–III, Wiley
7.2 Courses of term 5-6
Course: Logistics
Course key: [21078]
Lecturers: Kai Furmans
Credit points (CP): 6 Hours per week: 3/1 Term: Sommersemester Level: 3
Teaching language: Deutsch
Part of the modules: eBusiness Management [IW3WWEBM0] (S.35), Supply Chain Management [IW3WWEBM1] (S.37)
Learning Control / Examinations
The assessment consists of a written exam according to Section 4 (2), 1 of the examination regulation. The grade of the exam may be improved by passing exercises.
Prerequisites
Requied are lectures on “Linear Algebra” and “Stochastic”.
Conditions
None.
Learning Outcomes
After successfully finishing this course, the student is able to plan simple material handling and logistic systems and is able to assign the right models to a certain task. He is able to evaluate the performance of the most important elements of material handling and logistic systems.
Content
Introduction
• historical overview • lines of development Structure of logistics systems Distribution logistics
• location planning • Vehicle Routing Planning • distribution centers Inventory management
• demand forecasting
• Inventory management policies • Bullwhip effect Production logistics • layout planning • material handling • flow control Supply Managament • information flow • transportation organization
• controlling and development of a logistics system • co-operation mechanisms
• Lean SCM • SCOR model Identification Technologies
Media
Blackboard, Beramer, In Excercises also PCs
Complementary literature
• Arnold/Isermann/Kuhn/Tempelmeier. Handbuch Logistik, Springer Verlag, 2002 (Neuauflage in Arbeit) • Domschke. Logistik, Rundreisen und Touren, Oldenbourg Verlag, 1982
• Domschke/Drexl. Logistik, Standorte, Oldenbourg Verlag, 1996 • Gudehus. Logistik, Springer Verlag, 2007
• Neumann-Morlock. Operations-Research, Hanser-Verlag, 1993
• Tempelmeier. Bestandsmanagement in Supply Chains, Books on Demand 2006 • Schönsleben. Integrales Logistikmanagement, Springer, 1998
78 7.2 Courses of term 5-6
Course: Data Protection Law
Course key: [24018]
Lecturers: Indra Spiecker genannt Döhmann Credit points (CP): 3 Hours per week: 2/0 Term: Wintersemester Level: 4
Teaching language: Deutsch
Part of the modules: Intellectual Property and Data Protection Law [IW3INJURA] (S.49)
Learning Control / Examinations
Assessment will consist of a written exam (following §4(2), 1 SPO).
Prerequisites
None.
Conditions
None.
Learning Outcomes
Increasing significance of information technology for data processing and interconnectedness of the society by means of tele- communication does not only enhance the social and economical relevance of data in general, it raises the question about legal rules for the protection of personalised data as well. The problem for those who are responsible for the application of law is that national rules in this area are in constant flux due to technological progress and Europeanisation of law. Additionally there is a vast number of sector-specific regulation (such as labour law). Bearing all this in mind, the lecture´s main focus is the presentation of the basic principles of the German Federal Act on Data Protection (Bundesdatenschutzgesetz). In doing so, new concepts of data protection like self-data protection or system data protection will be analysed. A further focal point is the examination of evolution of sector-specific data protection law, considering as example regulation of data protection in connection with teleservice or mediaservice. Students should learn how to negotiate their ways in the interaction of different levels of legal norms and solve simple problems of data protection law.
Content
After illustrating contents and history of data protection law there will be presented backgrounds with respect to Community law and under constitutional law. Further on, the German Federal Act on Data Protection will be focussed. At this will be set forth basic principles of regulation (such as necessity), personalised data as an object of regulation, rights of those who are affected as well as the legitimacy of different procedures of data processing. Oranisational regulations, particularly data security official will be approached as well. Further on, in a case study current concepts of data protection and the problem of video surveillance will be discussed. Finally, there are three units on sector-specific regulation of telecommunication and teleservice / mediaservice.
Media
abstracts, sketches on blackboard, slides
Basic literature
Will be announced in the course.
Complementary literature
Wil be announced in the course.
Remarks
In cooperation with the House of Competence, Students should be rhetorical trained asking and answering questions (short- answer-and-question-technique). Therefor most likely a coach will attend several lessons.
Course: Industrial Property and Copyright Law
Course key: [24070]
Lecturers: Thomas Dreier
Credit points (CP): 3 Hours per week: 2/0 Term: Wintersemester Level: 3
Teaching language: Deutsch
Part of the modules: Intellectual Property and Data Protection Law [IW3INJURA] (S.49)
Learning Control / Examinations
Assessment will consist of a written exam (§4, Abs. 2, 1 of the SPO).
Prerequisites
None.
Conditions
None.
Learning Outcomes
It is the aim of this course to give students an overview of the law of intellectual property. The course focuses on patent law, trademark law, copyright law and also presents other laws of industrial property, including the additional legal protection by unfair competition law. Students shall understand the differences between registration and non-registration rights. Key concepts such as territoriality, conditions for protection, exclusive rights, limitations and exceptions, infringement and sacntions will be discussed. In addition, the focus will be on licensing of IP rights. The course covers national, european and international IP law.
Content
The course gives an introduction in to the legal protection of intellectual property. The different rationals for granting legal protection to immaterial goods will be explained, as well as the difference between registration and non-registration rights, and the system of international IP protection oon the basis of the principle of territoriality will be explained. Following, the different IP rights will be discussed with regard to their respective conditions and scope of protection. An overview of licensing and of the sanctions in case of infringement of IP rights will be given.
Media
Slides.
Basic literature
Ilzhöfer, Volker Patent-, Marken- und Urheberrecht Verlag Vahlen, 7current edition
Complementary literature
Additional literature tba
80 7.2 Courses of term 5-6
Course: Public Key Cryptography
Course key: [24072]
Lecturers: Willi Geiselmann
Credit points (CP): 5 Hours per week: 2/1 Term: Wintersemester Level: 3
Teaching language: Deutsch
Part of the modules: Algorithm Design [IW3INALG0] (S.26), Information Services in Networks [IW3INIDL0] (S.29)
Learning Control / Examinations
The assessment will consist of a written 1 hour exam according to § 4 Abs. 2 Nr. 1 SPO.
Prerequisites
None.
Conditions
None.
Learning Outcomes
The student gets acquainted with practical methods and mechanisms of IT-security, as well as with the theoretical background of IT-security.
Content
First, the basic concepts of cryptography are presented, e.g. one-way function, hash function, and digital signatures. Then some of the most important cryptographic algorithms will be discussed, pointing out its strengths and weaknesses. In particular, public- key encryption, digital signatures (RSA, ElGamal, Knapsack and McEliece), and key exchange (Diffie-Hellman) will be presented. The security of public-key systems, is based almost exclusively on number theoretical problems like prime tests, factoring large numbers and calculate discrete logarithms in finite groups. To understand the choice of parameters of cryptographic systems and to evaluate the security of them, some of the algorithms for solving these number theoretical problems are presented. Finally, current protocols such as Secure Shell (SSH), Transport Layer Security (TLS) and anonymous digital cash will be discussed. These protocols make use of the basic cryptographic algorithms to solve tasks such as authentication and key exchange.
Media
lecture notes
Basic literature
• lecture notes, available at http://iaks-www.ira.uka.de/lehre/pubkey/index.html (username and password will be announced in the lecture)
• J. Buchmann, Introduction to Cryptography, Springer, Heidelberg, 2003.
Complementary literature
• W. Stallings, Cryptography and Network Security, Prentice Hall, New Jersey, 1999. • M. Bishop, Introduction to Computer Security, Addison-Wesley, Boston, 2005.
Course: Vernetzte IT-Infrastrukturen
Course key: [24074]
Lecturers: Wilfried Juling
Credit points (CP): 5 Hours per week: 2/1 Term: Wintersemester Level: 4
Teaching language: Deutsch
Part of the modules: Algorithm Design [IW3INALG0] (S.26), Information Services in Networks [IW3INIDL0] (S.29)
Learning Control / Examinations
A written exam of 60 minutes, according to §4 Abs. 2 Nr. 1 SPO.
Prerequisites
None.
Conditions
Dependencies according to the module.
Learning Outcomes
Goal of this lecture is to introduce the basic descriptions and methodologies of computer networks.
Content
The lecture introduces formal methods to describe communication in general. After a brief discussion covering the basics of signal processing as well as physical constraints of telecommunication technologies, the lecture follows the architectural pattern of the OSI Reference Model to point out its given systematics. Based on elementary network technologies like Ethernet and Token Ring the lecture outlines essential problems concerned with frame alignment, shared or controled medium access or error processing. Further topics deal with the realization of worldwide networks regarding protocols, technologies and alogrithms used to construct them. Particularly, technical solutions and algorithms from the TCP/IP stack of the Internet Reference Model are discussed. Furthermore, the functionality and application scope of modern components to interconnect heterogenous networks are presented. Finally dedicated communication technologies like ISDN and higher level application protocols like HTTP or SMTP are introduced to indicate the pervasion of network communication technologies towards people.
Media
Slides
Basic literature
• A.S. Tanenbaum, Computer Networks Prentice Hall, 4. Auflage, ISBN 0130661023, 2002.
• Larry L. Peterson, Bruce S. Davie, Computer Networks - A Systems Approach, 3rd ed., Morgan Kaufmann Publishers, 2003.
Complementary literature
• F. Halsall, Data Communications, Computer Networks and OSI, Addison-Wesley, 4. Auflage, ISBN 0-201-18244-0, 1997. • J.F. Kurose, K.W. Ross, Computer Networking - A Top-Down Approach featuring the Internet. Addison-Wesley, 2005.
82 7.2 Courses of term 5-6
Course: Algorithm Design
Course key: [24079]
Lecturers: Dorothea Wagner, Peter Sanders Credit points (CP): 6 Hours per week: 3/1 Term: Wintersemester Level: 4
Teaching language: Deutsch
Part of the modules: Algorithm Design [IW3INALG0] (S.26)
Learning Control / Examinations
Assessment will consist of a written exam (1h) accordimg to § 4 Abs. 2 Nr. 1 SPO.
Prerequisites None. Conditions None. Learning Outcomes The students
• get a deep insight into the most important subareas of algorithmics, • get a broad algorithmic understanding,
• get the ability to understand and determine the running times of algorithms,
• get the knowledge of fundamental algorithms and data structures, as well as the ability to apply them to new problems.
Content
The Lecture “Algorithm Design” (german name is “Algorithmentechnik”) deepens the most important subareas of algorithmics. This, for example, includes graph algorithms, advanced data structures, design principles for algorithms, algorithmic geometry, and combinatorial optimization. Moreover, different methodic approaches are deepened. For Example, randomized algorithms, approximation algorithms, parallel algorithms, online algorithms, and algorithm engineering.
Basic literature
None
Complementary literature
• K. Mehlhorn, P. Sanders. Algorithms and Data Structures – The Basic Toolbox. Springer, 2008, to appear.
• T. H. Cormen, C. E. Leiserson, R. L. Rivest u.a. Introduction to Algorithms / Algorithmen – eine Einführung. MIT Press, 1990-2001 / Oldenburg 2004.
• Thomas Ottmann und Peter Widmayer. Algorithmen und Datenstrukturen. Spektrum, Akad. Verl., 1990-2002. • Uwe Schöning. Algorithmik. Spektrum Akademischer Verlag, 2001.
• Reinhard Diestel. Graph Theory. Springer-Verlag, 2005.
• D. Jungnickel. Graphen, Netzwerke und Algorithmen. BI-Wissenschaftsverlag, 1994.
• J. D. Horton A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal on Computing Vol. 16, Issue 12, 1987.
• Leon Peeters. Cyclic Railway Timetable Optimization. Dissertation, 2003. • R. G. Downey, M. R. Fellows, Parameterized Complexity. Springer, 1999.
Course: Practical Course in Algorithm Design
Course key: [24079p]
Lecturers: Peter Sanders, Dorothea Wagner, Marcus Krug Credit points (CP): 5 Hours per week: 4
Term: Winter-/Sommersemester Level: 4 Teaching language: Deutsch
Part of the modules: Algorithm Design [IW3INALG0] (S.26)
Learning Control / Examinations Prerequisites
Lecture Algorithmentechnik
Conditions
None.
Learning Outcomes
The purpose of the practical course in algorithm design is to make learned knowledge work. The students are given varying topics from algorithmics, which they have to implement in small working groups. Possible Topics are, for exmaple, algorithms for flow problems, shortest path problems, or clustering techniques. In this way students learn to write efficient code.
Content
In the practical course Algorithm Engineering the students are given miscallaneous questions from algorithmics, which they have to implement independently in small working groups. The main focus lies on object oriented programming with Java or C++. Linear programming may also occur.
84 7.2 Courses of term 5-6
Course: Seminar in Algorithm Design
Course key: [24079s]
Lecturers: Dorothea Wagner
Credit points (CP): 3 Hours per week: 2 Term: Winter-/Sommersemester Level: 3 Teaching language: Deutsch
Part of the modules: Algorithm Design [IW3INALG0] (S.26)
Learning Control / Examinations
Assessment will consist a written elaboration of the performed task and an oral presentation thereof following §4, Abs. 2, 3 of the Prüfungsordnung für Informationswirtschaft. Prerequisites None. Conditions None. Learning Outcomes Students shall
• conduct literature research starting from a given topic, identify, locate, evaluate and summarize relevant literature.
• compose their written elaboration (and later their bachelor/masters thesis) with a minimum of introductory effort, and thereby respect given templates similiar to those enforced in standard scientific publication processes.
• devise a presentation in the context of the scientifc topic. To this end, techniques are presented that enable the processing and the presentation of content in a way suitable for the audience.
• present their research results in a written form similar to standard scientific dissemination.
Content
Course: Workflowmanagement-Systems
Course key: [24111]
Lecturers: Jutta Mülle
Credit points (CP): 3 Hours per week: 2 Term: Wintersemester Level: 4
Teaching language: Deutsch
Part of the modules: Information and Knowledge Systems [IW3INISW0] (S.30)
Learning Control / Examinations
It will be announced in advance if the assessment consists of an 1h written exam following §4, Abs. 2, 1 of the Prüfungsordnung or of a 20 minute oral examination following §4, Abs. 2, 2 of the Prüfungsordnung.
Prerequisites
Knowledge about database systems, e.g. from the lecture Communications and Database Systems [24574].
Conditions
None.
Learning Outcomes
A goal of the course is that the participants are able to model workflows, to explain modelling aspects and their relationships, to compare modelling methods, and to evaluate the usability of these methods in different application areas. They should understand the technical construction of workflow-management systems with the most important components and different architectures and implementation alternatives. Finally, the participants should have obtained an overview on actual relevant standardization proposals and how to use these approaches, and they should be aware of actual research topics.
Content
Workflow Management Systems (WFMS) support the management of business processes according to pre-defined process descriptions. Managing processes flexibly, i.e., handle deviations, e.g., in order to catch exceptions, adapt processes to modified process environments or to support ad-hoc workflows, becomes more and more important.
The course starts with discussing WFMS in the context of business-information systems and their relationship with the more common business-process modelling. Petri nets and pi-calculus are introduced as basic formalisms. Then, methods to model workflows and the design process for workflow-management applications are presented in detail and supplemented with exercises. An advanced aspect is new research in WFMS technology. In particular, the use of internet techniques like web services and stan- dardization approaches for process modeling, orchestration, and choreography in service-oriented architectures will be presented. In the realization part of the course, various implementation techniques and architectural issues to realize workflow-management systems as well as diverse system types and concrete workflow-management systems are presented.
Media
Slides.
Basic literature
• W.M.P. van der Aalst. The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers, Seiten 1-45, Band 7:1, 1998.
• S. Jablonski, M. Böhm, W. Schulze (Hrsg.): Workflow-Management - Entwicklung von Anwendungen und Systemen. dpunkt- Verlag, Heidelberg, 1997
• Frank Leymann, Dieter Roller: Production Workflows - Concepts and Techniques. Prentice-Hall, 2000 • W.M.P. van der Aalst: Workflow Management: Models, Methods, and Systems. MIT Press, 368 pp., 2002 • Michael Havey: Essential Business Process Modeling. O´Reilly Media, Inc., 2005
Complementary literature
• M. Dumas, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede (eds.): Process-Aware Information Systems. Wiley, 2005 • D. Harel: Statecharts: A Visual Formalism for Complex Systems, Science of Computer Programming Vol. 8, 1987.
• Dirk Wodtke, Gerhard Weikum A Formal Foundation for Distributed Workflow Execution Based on State Charts. Foto N. Afrati, Phokion Kolaitis (Eds.): Database Theory - ICDT ´97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings. Lecture Notes in Computer Science 1186, Springer Verlag, Seiten 230-246, 1997.
• H.M.W. Verbeek, T. Basten, and W.M.P. van der Aalst Diagnosing workflow processes using Woflan. Computing Science Report 99/02, Eindhoven University of Technology, Eindhoven, 1999.
86 7.2 Courses of term 5-6
Course: Data Warehousing and Mining
Course key: [24118]
Lecturers: Klemens Böhm
Credit points (CP): 5 Hours per week: 2/1 Term: Wintersemester Level: 4
Teaching language: Deutsch
Part of the modules: Information and Knowledge Systems [IW3INISW0] (S.30)
Learning Control / Examinations
It will be announced in advance if the assessment consists of an 1h written exam following §4, Abs. 2, 1 of the Prüfungsordnung or of a 20 minute oral examination following §4, Abs. 2, 2 of the Prüfungsordnung.
Prerequisites
Knowledge about database systems, e.g. from the lecture Communications and Database Systems [24574].
Conditions
None.
Learning Outcomes
At the end of the lecture, the participants should be aware of – and able to explain – the necessity of data warehousing and of data