Turku Centre for Computer Science Annual Report 1996

Transcription

1 Turku Centre for Computer Science Annual Report 1996 Editorial board: Mats Aspnäs Ralph-Johan Back Timo Järvi Tiina Lehto TUCS Turku Centre for Computer Science TUCS General Publication No 4 May 1997 ISBN X ISSN

2

3 Contents 1 Introduction Overview A Short History of TUCS The Year Organization Financing Facilities Research Algorithmics Group Coding Theory Group Computational Intelligence for Business Information Systems Research Group Institute for Advanced Management Systems Research Probabilistic Algorithms and Software Quality Programming Methodology Group Strategic Information Systems Planning Theory Group: Mathematical Structures in Computer Science 13 3 TUCS Graduate School Curriculum Requirements Academic year Financing the Studies Application procedure Personnel Faculty Adjunct Faculty Researchers Visiting Researchers and Post Docs Ph.D. Students TUCS Laboratory TUCS Office i

4 5 Accepted Theses Theses for Doctor of Philosophy Theses for Licentiate of Philosophy Publications TUCS Dissertations TUCS Technical Reports TUCS General Publications Courses General Courses Litterature Courses Short Courses Conference participation 53 ii

5 Chapter 1 Introduction Turku Centre for Computer Science (TUCS) is a research centre in Computer Science for the three universities in Turku, Finland: University of Turku, Åbo Akademi University and Turku School of Economics and Business Administration. TUCS is a Centre of Excellence in research, one of 17 such centres in Finland chosen by the Academy of Finland. 1.1 Overview Turku Centre for Computer Science was officially started in March 1994, as a co-operation between the three universities in Turku in the area of Computer Science and Discrete Mathematics. The explicit purpose was to combine research, advanced level teaching and Ph.D. education of the participating departments into a single school for graduate studies. The first students started at TUCS in September Presently, TUCS has 45 full time Ph.D. students and 10 Ph.D. students who are carrying out their studies while working in the industry. TUCS has from the very start profiled itself as an international research center. The working language is English and all courses are taught in English. A large number of the Ph.D. students at TUCS are from abroad (presently approximately 40%). TUCS also has an extensive recruitment of post doc and senior researchers, so that in 1996, 12 researchers in this category worked at TUCS, for a period of at least half a year. The recruitment to Ph.D. student and research positions is world wide. TUCS has presently 9 research groups. Its research groups cover the main areas of Computer Science, from very theoretical basic research to Computer Science applications in industrial and business information systems. The research groups are organized around one to three professors and consist in addition of senior researchers, post doctoral students, Ph.D. students and M.Sc. students. The research groups are involved in a number 1

6 of more specific research projects, mostly with extenrnal funding from the Academy of Finland (basic research), TEKES (industrial applied research) or directly from the industry. The supervision of Ph.D. students is done within these research groups. Besides having a graduate school and common courses and seminars, TUCS also cordinates the other main research activities of the participating departments. It publishes a joint technical report series, with 85 technical reports published only in the first year, It also publishes Ph.D. thesis and conference proceedings. TUCS publications are all available on the world wide web for immediate downloading and inspection. The web also provides the most updated and detailed information about TUCS, its daily activities and its accumulated results. The web address is A Short History of TUCS Turku has three different universities, University of Turku, Åbo Akademi University and Turku School of Business Administration. The teaching language in Åbo Akademi is Swedish, in the other universities it is Finnish. All three universities have departments in the area of Computer Science at large. In 1988, these departments all moved into common localities in Data City, the first part of the present Turku Technology Center to be built. The technology center is now at least three times bigger, with newer buildings devoted to Biotechnology, Electronics and Material Sciences. The next step was forming of a joint graduate school in Computer Science for the departments that were situated in Data City. The initiative for forming the graduate school was taken by Ralph-Johan Back in August 1993, and a small working group was set up to plan the school. This working group consisted of professors Ralph-Johan Back (Åbo Akademi, Computer Science), Timo Järvi (University of Turku, Computer Science), Tapio Reponen (Turku School of Business and Administration, Information Systems) and Arto Salomaa (University of Turku, Discrete Mathematics). The working group made quick progress, and the Turku Graduate School in Computer Science was formed in November After discussions with the Academy of Finland, in particular its research director Elisabeth Helander, it was decided that the scope of the Graduate School should be expanded to be a full research center in Computer Science, and that the Graduate School was to be a part of this research center. Turku Centre for Computer Science, abbreviated TUCS, was consequently formed in February The working language of TUCS was decided to be English. Partly this was a way of solving the problem of combining three universities with two different teaching languages, Finnish and Swedish, but more importantly, it was a conscious decision to give TUCS a markedly international profile. 2

7 This has also succeeded, to an extent that was not really even foreseen in the beginning, with all TUCS courses now being lectured in English, a large part of the Ph.D. students coming from abroad, and a large number of foreign post docs and more senior researchers visiting TUCS for longer periods. TUCS received generous support from the Ministry of Education in its first two years, as it was a pilot project. Organizing Ph.D. studies in the form of a Graduate School was a new organizational form in Finland, as was also the extensive co-operation between three different universities. TUCS was the first graduate school to start in Finland. The graduate school model was considered very successfull by the Ministry of Education, who decided to go for it wholeheartedly. In the next two years alltogether 93 graduate schools were formed in Finland, in all areas of science. There are now 4 other graduate schools in Computer Science besides TUCS: HECSE in Helsinki, TISE in Tampere, COMAS in Jyväskylä and ECSE in Eastern Finland (Joensuu, Lappeenranta, Kuopio). TUCS has acquired its own share of the full-time Ph.D. student positions that were allocated to the new graduate schools, it has had 10 such positions since TUCS was also immediately selected as a Centre of Excellence in research, for 1995, by the Academy of Finland. This was a very strong acknowledgment, considering that only 12 Centers of Excellence were selected all together, in all fields of science and humanities. This status was based on the existing research in the participating departments. The research group of Prof. Arto Salomaa in formal languages and cryptology at University of Turku and the research group of Prof. Ralph-Johan Back in programming methodology at Åbo Akademi University were specifically mentioned as a motivation for the Center of Excellence status. All reserach groups at TUCS have strong reserach and are well-known internationally. The combined research strenght of TUCS has given it Center of Excellence status in the following years also ( ), with the total number of such centers in 1996 having risen to 17. TUCS funding is based on the Graduate school Ph.D. positions and the Center of Excellence status, for which the Universities get extra resources that are used to support TUCS. This funding is used to finance Ph.D. student positions (for the moment 25 full-time positions), post doc grants (for the moment 4 one-year grants), travelling, equipment and rooms for the Ph.D. students and postdocs, and special research courses. TUCS acquired its own localities in February 1995, when it moved into the 4th floor of Data City. The departments participating in TUCS are now situated on the 2nd, 3rd and 4th floor or Data City. The Mathematics Department of the University of Turku is the only part that is not in these localities, situated some 800 meters away in the main building of the University of Turku. TUCS now has its own staff, with a full-time education secretary and office secretary, two laboratory engineers and 5 researchers. This is in addition to the personnel at the participating departments. Alltogether, 3

8 these departments had 16 tenured positions (professors, associate professors and lecturers), 17 Ph.D. level researchers and 12 visiting researchers in TUCS was originally just a co-operation agreement between the Faculties for Mathematics and Sciences in Åbo Akademi and University of Turku, and the Department of Administration of Turku School of Business Administration. This organizational form was considered too weak, so in 1996 it was decided that TUCS would become an independent research institute, jointly governed by the three participating universities. Thus, starting January 1, 1997, TUCS is now such an independent institute, with its own statutes. It is governed by a board that is in elected by the councils of the three participating universities. The Director of TUCS is also directly appointed by these universities. 1.3 The Year 1996 The Ministry of Education decided to allocate additional funding to the University of Turku and Åbo Akademi for expanding research and education in Computer Science. The main part of these additional resources (with alltogether some 15 new positions in the two universities) were used to expand Computer Science research in two areas, Embedded Systems and Information Systems. A new B.Sc. and M.Sc. program in Engineering was started in Åbo Akademi 1996, specifically targeted at Embedded Systems. The University of Turku is expanding in this direction also. As a consequence of this, TUCS decided in 1996 to add Embedded Systems as a new research area, in addition to the previous areas (Algorithmics, Discrete Mathematics, Information Systems and Software Engineering). Information Systems has expanded to become a new curriculem within the Department of Business Administration of Åbo Akademi, and the number of positions in this area have been increased in both universities. Another important event was starting of the TUCS publication series. The Technical Report series is intended to replace the earlier separate techical report series of the participating departments. The new series has started very well, with 85 titles being published in In addition, TUCS also started a Ph.D. thesis series, with 3 Ph.D. thesis published in the series in 1996 (not all TUCS Ph.D. thesis are published here). Finally, TUCS also has a general publications serie, were other publications go, such as conference proceedings, annual reports etc. TUCS has been active in organizing scientific conferences in The international conference on Higher Order Logic was organized this year in Turku by TUCS. The progam committee was headed by prof. Joakim von Wright from Åbo Akademi/TUCS, and the organization committee also included Jim Grundy and John Harrison, both post docs at TUCS. TUCS academic year 1996 has been quite prolific. TUCS has pro- 4

9 duced 5 Ph.D. thesis in 1996: Malin Brännback (Åbo Akademi, Information Systems), Timo Käkölä (University of Turku, Information Systems), Ville Leppänen (University of Turku, Computer Science), Marjo Lipponen (University of Turku, Discrete Mathematics) and Hannu Salmela (Turku School of Business and Administration, Information Systems). In addition, 6 Ph.Lic. thesis have been produced: Thomas Finne (Åbo Akademi, Information Systems), Kalle Kangas (Turku School of Business and Administration, Information Systems), Tero Laihonen (University of Turku, Discrete Mathematics), Fredrick von Shoultz (Åbo Akademi, Computer Science), Marina Walden, (Åbo Akademi,Computer Science) and Harry Virtanen, (Åbo Akademi, Computer Science). 1.4 Organization The following departments participate in TUCS and its Graduate School: University of Turku Department of Mathematical Sciences Computer Science Mathematics Åbo Akademi University Department of Computer Science Department of Business Administration Institute for Advanced Management Systems Research, IAMSR Turku School of Economics and Business Administration Department of Management Institute of Information Systems Science The board is the organ with the highest authority in TUCS. The board is lead by the chairman (and the vice-chaiman). The director of TUCS (and the vice-director) are responsible to the board, and are responsible for the operation of TUCS. Director: professor Ralph-Johan Back Vice-director: professor Timo Järvi 5

10 The board of Turku Centre for Computer Science consists of professors from the participating departments. During the period the board has had the following members: Chairman: Professor Arto Salomaa, University of Turku, Dept. of Mathematics Vice-chairman: Acting Professor Mikko Ruohonen, Turku School of Economics and Business Administration, Institute of Information Systems Science Professor Ralph Back, Åbo Akademi, Department of Computer Science Professor Christer Carlsson, Åbo Akademi, Institute for Advanced Management Systems Research Professor Timo Järvi, University of Turku, Department of Computer Science Professor Markku Nurminen, University of Turku, Department of Computer Science Professor Aimo Törn, Åbo Akademi, Department of Computer Science 10 board meetings have been held during the year. 1.5 Financing The activities of TUCS are funded mainly by the Ministry of Education, the Academy of Finland, and the three universities of Turku - Turku University, Åbo Akademi University and Turku School of Economics and Business Administration. TUCS financing is based part on its own budget, and part on the funds of the university departments participating in it. The total income of TUCS budget for 1996 was 4.3 million Finnish marks, 2.5 million marks of which consisted of the Centre of Excellence appropriation granted by Ministry of Education through the three universities. The Ministry of Education appropriation for 10 graduate school student positions was 1.3 million marks. In December 1996, 37 per cent of the 43 full time doctoral students were financed by the Centre of Excellence appropriation. 23 per cent of them got their financing from the Ministry of Education, 14 per cent from the departments engaged in the activities of TUCS, and another 12 per cent from other sources (different projects, industry). 9 per cent of the graduate school student salaries were being funded by different projects of the Academy of Finland, and 5 per cent by foreign or EU funding. 6

11 TUCS Total Income 1996 Academy of Finland 5% Other funding 9% Ministry of Education/Centre of Excellence 57% Ministry of Education 29% 1.6 Facilities Figure 1.1: TUCS total income 1996 TUCS and its Graduate School are situated in DataCity in the Turku Technology Center, together with a number of other university departments and companies in computer and communication technology, electronics, biotechnology and material sciences. Most of the participating departments are located in the same building: the Department of Computer Science at University of Turku on the second floor, the Department of Computer Science and IAMSR at Åbo Akademi, together with the Institute of Information Systems Science at Turku School of Economics and Business Administration on the third floor and TUCS and its graduate school on the fourth floor. Only the Department of Mathematics at University of Turku is located elsewhere, on about 10 minutes walking distance. The fact that all the researchers and students in TUCS are located so close to each other has turned out to be a great asset, and helps to achieve cooperation and communication between the different units. 7

12 8

13 Chapter 2 Research The main areas of research at TUCS are Algorithmics (A) Discrete Mathematics (DM) Embedded Systems (ES) Information Systems (IS) Software Engineering (SE) The research groups at TUCS are listed below. More detailed information about these research groups is provided by the leaders of the groups, and from TUCS home page at the World Wide Web. 2.1 Algorithmics Group The group consists of a number of subgroups, studying various topics in design and analysis of computer algorithms and data structures. Characteristic of all subgroups is orientation to solving practical problems, with the purpose to minimize the usage of resources, such as time and storage, as well as to improve the quality of the results obtained. Of the subtopics should especially be mentioned the study of data compression, which has a long tradition in the group. A new emerging research area is the analysis and processing of medical images. Other subtopics include, among others, traveling salesman algorithms, production planning for printed circuit industry, string algorithms, analysis and comparison of biomolecular structures, parallel algorithms, packing algorithms, shape recognition with neural networks, signal analysis of medical diagnostic systems, minimal-space algorithms and database algorithms. 9

14 The research group consists of Timo Järvi and Olli Nevalainen (leaders), senior researchers Timo Raita, Jukka Teuhola, Martti Juhola, Jyrki Katajainen and Martti Penttonen, and Ph.D. students Harri Hakonen, Mika Johnsson, Antero Järvi, Jaakko Järvi, Timo Kaukoranta, Antti Koski, Jan- Christian Lehtinen, Jianming Liang, Ville Leppänen, Gábor Magyar, Janne Näppi, Tomi Pasanen and Marko Toivonen. 2.2 Coding Theory Group The activities of the group are concentrated on mathematical aspects of coding theory, with an emphasis on the error-correcting and CDMA problems which are closely related to the theory of finite fields and character sums or to combinatorics. Current research is based on two partially overlapping projects: Errorcorrecting codes and Sets of sequences with CDMA applications with topics ranging from purely mathematical to application oriented ones. The research group consists of five researchers: Aimo Tietäväinen (leader), senior researchers Iiro Honkala, Jyrki Lahtonen, Hannu Tarnanen, and Ph.D. student Tero Laihonen. 2.3 Computational Intelligence for Business The research of this group is concentrated on developing methods and techniques for integrating computational intelligence into management decision making. The focus is on intelligent computer based systems such as expert systems, genetic algorithms and neural networks. The main application areas within management science come from strategic marketing management and accounting. The group is headed by Barbro Back and Kaisa Sere. Other group members are senior researchers Pirkko Waldén and Hannu Vanharanta and Ph.D. students Eija Koskivaara, Eva Wilppu and Mikko Irjala. 2.4 Information Systems Research Group The research is concentrated on the usability and exploitability of information systems in organizations. Users situation of the information systems is heavily emphasized and the information system is regarded as an inherent part of the work activity and business activity of its users. Both existing and future information systems are studied. The research aims at improving both theoretical understanding and practical methodologies. The research emphasizes the close integration between basic research, applied research and product development. 10

15 The research group consists of Markku I. Nurminen (leader), post-doctoral researcher Jukka Heikkilä and Ph.D. students Ulf Forsman, Jari Kesti, Timo Kestilä, Mika Kirveennummi, Berit Kortteinen, Timo Käkölä, Pekka Reijonen, Marika Toivonen, Vesa Torvinen and Antti Tuomisto. 2.5 Institute for Advanced Management Systems Research IAMSR is a research institute with the objective to study and develop the theory and applications of knowledge based systems in management. Research areas are knowledge based support systems, cognitive maps and hyperknowledge, interdependent mcdm, approximate reasoning and fuzzy logic, neural nets, group decision systems, intelligent agents and virtual reality. The research is carried out in co-operation with major Finnish companies, normally as research contacts spanning several years, which make the research relevant and verifiable to both the theoretical foundations and the practicality of the systems technology developed. The institute is headed by Christer Carlsson and is organized around a nucleus of senior researchers: Pirkko Walden, Malin Brännback and visiting scholar Robert Fullér and Ph.D. students Thomas Finne, Thomas Grandell, Roger Holm, Kristian Kummel, Jouni Lappi, Jan-Anders Lindblad, Niclas Lindgren, Shuhua Liu and Matti Veijola. 2.6 Probabilistic Algorithms and Software Quality Research in this group has focused on global optimization methods and the use of Simulation Nets (extended Petri Nets) for simulation modeling. Some work has also been done in the areas of numerical integration and hashing. Global Optimization means finding the smallest minimum of a mathematical function in a region where the function possibly has several local minima. The research is mainly in the area of probabilistic methods where random sampling plays an important role. The group consists of Aimo Törn (leader), Montaz Ali and Ph.D. student Sami Viitanen. Simulation Nets is a tool for design of software for simulating discrete event systems. Research in this area includes conceptual work on modelling and user friendly implementation of those concepts. Several prototypes capable of reading Simulation Net designs and carrying out the implied simulation including animation have been developed. The group consists of Aimo Törn (leader) and Ph.D. students Åke Gustavsson and Fredrick von Schoultz. Research on Software Quality has covered a broad spectrum of quality issues, from conceptual questions to tools for measurement of software quality characteristics. The activities have been organized in a research project 11

16 SOLE, with members from many universities in Finland and abroad. The group consists of Aimo Törn, Inger Eriksson and Liisa von Hellens (leaders), and 6 Ph.D. students. 2.7 Programming Methodology Group The research is concentrated on the use of formal methods in specification and construction of algorithms, programs and large software systems. The emphasis is on rigorous and mathematically justified derivations of programs from initial specifications.the semantic and logical foundations of programs, program correctness and program derivations are investigated. A number of different programming paradigms are studied, such as derivation of imperative and functional programs, parallel and reactive system construction, object oriented programming and hardware/vlsi design. Computer support for program derivation and mechanization of mathematical proofs is also investigated. Practical applications are studied in areas such as VLSI design, multiprocessor programming and real time control systems. The research group consists of Ralph-Johan Back, Kaisa Sere and Joakim von Wright (leaders), senior researchers Emil Sekerinski and Tom Kuusela, post-doctoral researchers Michael Butler, Jim Grundy, Emil Sekerinski, Hong Shen, Ulla Solin, Xu Qiwen and Ph.D. students Mats Aspnäs, Martin Büchi, Eric Hedman, Philipp Heuberger, Linas Laibinis, Thomas Långbacka, Alexander Malioukov, Leonid Mikhajlov, Anna Mikhajlova, Juha Plosila, Rimvydas Ruksenas, Tiberiu Seceleanu, Elena Troubitsyna, Marina Waldén and Yi Zhao. 2.8 Strategic Information Systems Planning The group studies the application of information technology in organizations, business and other. The group has developed its own EMIS (Evolution Model for Information Systems Strategy Development) -model, for interactive information systems strategy generation. Issues such as outsourcing and its effects, telecommunication networks and their application, expert systems and their application in decision making, education of information system managers and users, change management in and with information systems, business applications of neural networks and multinational information system management are or have been under investigation in the latest time. Most research is done through case research or action research in intensive interaction with close collaboration with business and other organizations. The research group consists of Tapio Reponen and Mikko Ruohonen (leaders), senior researchers Barbro Back, Liisa von Hellens and Reima Suomi, post-doctoral researchers Timo Auer and Hannu Salmela and PhD students 12

17 Juha Pärnistö, Jukka Viitanen, Yele Adelakun, Kalle Kangas, Timo Leino, Olli Sjöblom, Jussi Puhakainen ja Pekka Turunen. 2.9 Theory Group: Mathematical Structures in Computer Science The work consists of broadly-based research dealing with formal languages, automata, complexity theory, combinatorics of words, semigroups, universal algebras, logic programming, term rewriting, concurrency and parallelism, cryptography and data security. The group has a long tradition, going back to the early 60 s when the first courses on automata and computability were given. First doctorates in these areas were completed in the late 60 s. The main European theory conference, ICALP, was organized in Turku 1977 and the first conference on Developments of Language Theory, DLT, was held in Formal language theory can be viewed as an original core area of computer science. It has been applied in the modeling of both natural and programming languages, as well as in various other fields ranging from pattern matching and computer graphics to developmental biology and artificial life. Current research consists of several partially overlapping projects, with topics ranging from purely mathematical to application oriented ones. The research group consists of Arto Salomaa (leader), senior researchers Tero Harju, Juha Honkala, Juhani Karhumäki, Alexandru Mateescu, Gheorghe Păun, Kai Salomaa and Magnus Steinby, post-doctoral researchers Eija Jurvanen, Marjo Lipponen, Wojciech Plandowski and Ari Renvall and Ph.D. students Cunsheng Ding, Mika Hirvensalo, Lucian Ilie, Jouni Järvinen, Arto Lepistö and Valeria Mihalache. 13

18 14

19 Chapter 3 TUCS Graduate School The Graduate School of Turku Centre for Computer Science (TUCS) offers a programme for gaining the Doctoral (Ph.D.) degree in Computer Science. It is open for students from everywhere. The teaching language of the school is English. Prerequisites are either a Master s or a Bachelor s degree in Computer Science or in a closely related field. Study time is expected to be 4 years when starting from Master s level and 6 years from Bachelor s level. The Graduate School offers advanced level courses in Computer Science and supervision of students within existing research projects. Students are expected to take courses from at least two of the research areas represented in TUCS. Each student is assigned a supervisor from one of research projects. 3.1 Curriculum Requirements The curriculum for the degrees of Master of Science and the Doctor of Philosophy follow the Finnish standard requirements. The Ph.D. degree normally requires a Master s degree. The Master s degree requires 40 credits in addition to the B.Sc. exam. Part of these credits are obtained by taking courses and part by writing a Master s thesis. After completing the M.Sc., the student must take an additional 40 credits courses and do research leading up to a Ph.D. thesis. A standard course, covering approximately 50 hours of lectures, 20 hours of assignments in class and a smaller project assignment will usually give 5 credits. There are also smaller courses and seminars, giving 1-3 credits. 3.2 Academic year The academic year is from August 1 to July 31. Fall term runs from September to December, with lectures from the beginning of September to December. Spring term runs from January to May, with lectures from the begin- 15

20 ning of January to May. Course examinations are usually concentrated to the end of the terms. 3.3 Financing the Studies The Graduate School offers a number of grants to new students each year. Receiving a grant obliges a student to participate in a minor amount of teaching tasks (max. 2 hours / week). The grants are given for 2 years at a time, the continuation being conditional on progress made during the previous two years. Maximum time is 4 years starting from a Master s degree and 6 years starting from a Bachelor s degree. There are presently no tuition fees for the Graduate School. The students are expected to enroll in the students union, which involves a rather reasonable annual fee, in exchange for the services offered by the students unions. These services include support with housing arrangements, subsidized health care with specialists as well as sport and social events. The Student Village Foundation of Turku offers rental apartments for students. The secretary of TUCS assists new foreign students to apply for an apartment. 3.4 Application procedure Applicants to the school should write a letter to the Director of TUCS. The letter should contain a formal application to the school, together with the following information: 1. Curriculum vitae 2. Financing plan for studies 3. Application for financial support, if requested 4. Letters of recommendation (2) with referees full contact addresses 5. Official copy of examinations earned; official english translation 6. Certificate of knowledge of English 7. Research interests (optional) As certificate of knowledge of English, TOEFL test (minimum 550 points) or corresponding knowledge in English is required for applicants outside Finland. Deadline for applications is April 30 for studies starting in September. Applications should be sent to the Director of TUCS. Additional information about studies at TUCS and about the application procedure is given by the secretary and the director of TUCS. 16

21 Chapter 4 Personnel 4.1 Faculty The faculty of TUCS consists of persons with a tenured position (professors, associate professors, lecturers and tenured assistant professors) which belong to one of the research groups of TUCS. The present faculty is listed below, with their affiliation, adress and areas of interest. Ralph-Johan Back, professor at Åbo Akademi University, Department of Computer Science. [email protected]. Research interests: Programming methodology, formal methods, parallel and distributed programming. Christer Carlsson, professor at Åbo Akademi University, Institute for Advanced Management Systems Research. [email protected]. Research interests: Knowledge-based systems, fuzzy logic and multi criteria decision making. Timo Järvi, professor at University of Turku, Department of Computer Science. [email protected]. Research interests: Data bases, computer architecture. Juhani Karhumäki, assistant professor at University of Turku, Department of Mathematics. [email protected]. Research interests: Formal languages, automata, cryptography, combinatorics of words. Olli Nevalainen, associate professor at University of Turku, Department of Computer Science. [email protected]. Research interests: Algorithmics. Markku Nurminen, associate professor at University of Turku, Department of Computer Science. [email protected]. Research interests: Information systems. Timo Raita, lecturer at University of Turku, Department of Computer Science. [email protected]. Research interests: Data compression methods. 17

22 Tapio Reponen, professor at Turku School of Economics and Business Administration, Institute of Information Systems Science (on leave for rectorship). Research interests: Information systems strategies, management of IS function. Arto Salomaa, professor at University of Turku, Department of Mathematics. Research interests: Formal languages, automata, cryptography. Magnus Steinby, associate professor at University of Turku, Department of Mathematics. Research interests: Mathematical logic, tree automata. Reima Suomi, associate professor at Turku School of Economics and Business Administration, Institute of Information Systems Science. Research interests: Information systems. Jukka Teuhola, lecturer at University of Turku, Department of Computer Science. Research interests: Databases, algorithmics. Aimo Tietäväinen, professor at University of Turku, Department of Mathematics. Research interests: Coding theory. Aimo Törn, professor at Åbo Akademi University, Department of Computer Science. Research interests: Simulation methodology, global optimization, software quality. Joakim von Wright, associate professor at Åbo Akademi University, Department of Computer Science. Research interests: Programming methodology, mechanical verification. 4.2 Adjunct Faculty The adjunct faculty of TUCS consists of persons with a tenured position, which are actively involved in the research and teching in TUCS but which do not directly belong to any of the research groups of TUCS. Patrik Eklund, Professor at Umeå University, Umeå, Sweden. Research interests: Fuzzy systems, information system application, neural networks. Inger Eriksson, associate professor at Swedish School in Economics and Business Administration. [email protected]. Research interests: Information systems quality, user training. Martti Juhola, professor at University of Kuopio. [email protected]. Research interests: Pattern recognition, medical applications of computing. Jyrki Katajainen, lecturer at University of Copenhagen, Denmark. [email protected]. Research interests: Algorithmics, parallel programming. 18

23 Valtteri Niemi, associate professor at University of Vaasa. Research interests: Cryptography, formal languages. Martti Penttonen, professor at University of Joensuu. Research interests: Parallel computing, structured documents, logic programming, theoretical computer science. 4.3 Researchers The following researchers are actively involved in TUCS and the Graduate School, as members of research teams and as supervisors of M. Sc. and Ph. D. studies. Timo Auer, assistant professor at Helsinki School of Economics and Business Administration, Institute of Information Systems Science. Barbro Back, researcher at Turku School of Economics and Business Administration, Institute of Information Systems Science. Research interests: Expert systems, accounting applications, neural networks. Malin Brännback, acting associate professor at Åbo Akademi, IAMSR. E- Pasi Fränti, assistant at University of Turku, Department of Computer Science. Research interests: Image processing and compression. Tero Harju, assistant professor at University of Turku, Department of Mathematics. Research interests: Automata theory. Jukka Heikkilä, researcher at University of Turku, Department of Computer Science. Research interests: Information systems. Iiro Honkala, assistant professor at University of Turku, Department of Mathematics. Research interests: Coding theory. Juha Honkala, research assistant at University of Turku, Department of Mathematics. Research interests: Formal languages, automata. Timo Knuutila, assistant professor at University of Turku, Department of Computer Science. Research interests: Logic programming, automata, machine learning. Tom Kuusela, assistant professor at University of Turku. Research interests: VLSI-design. 19

24 Timo Käkölä, Ph.Lic., University of Turku, Department of Computer Science. Jyrki Lahtonen, research assistant at University of Turku, Department of Mathematics. Research interests: Coding theory. Ville Leppänen, Assistant at University of Turku, Department of Computer Science. Research interests: Models of parallelism, PRAM and BSP models. Marjo Lipponen, researcher at University of Turku, Department of Mathematics. Research interests: The primitive solutions of the Post Correspondence Problem. Mikko Ruohonen, assistant professor at Turku School of Economics and Business Administration, Institute of Information Systems Science. Research interests: Information systems. Kai Salomaa, research assistant at University of Turku, Department of Mathematics. Research interests: Term rewriting, tree automata. Hannu Salmela, assistant professor at Turku School of Economics and Business Administration, Institute of Information Systems Science. Kaisa Sere, associate professor at University of Kuopio. Research interests: Formal methods, parallel and distributed programming. Ulla Solin, assistant professor at Åbo Akademi University, Department of Computer Science. Research interests: Parallel programming, real time systems. Hannu Tarnanen, research assistant at University of Turku, Department of Mathematics. Research interests: Coding theory. Pirkko Waldén, acting associate professor at Åbo Akademi University, Institute for Advanced Management Systems Rersearch. Research interests: Strategic management, knowledge-based systems, neural nets. 4.4 Visiting Researchers and Post Docs The following researchers have been active at TUCS either as long term visiting researchers or employed as post-doc researchers. 20

25 Montaz Ali, post-doc researcher at Åbo Akademi University, Department of Computer Science, from Loughborough University of Technology, Department of Mathematical Sciences. Research interests: Global optimization. Michael Butler, post-doc researcher at Åbo Akademi University, Department of Computer Science. Currently at University of Southampton, Department of Electronics & Computer Science. Research interests: Formal methods, specification methods. Julien Cassaigne, post-doc researcher at University of Turku, Department of Mathematics, from Institut de Mathèmatiques de Luminy, Systèmes Dynamiques Discrets, Marseilles, France. Robert Fullér, Donner visiting professor at Åbo Akademi University, Institute for Advanced Management Systems Rersearch, from Eötvös Loránd University, Department of Computer Science, Budapest, Hungary. Research interests: Approximate reasoning for optimization, fuzzy neural systems, decision making in fuzzy environment. Jim Grundy, post-doc researcher at Åbo Akademi University, Department of Computer Science, currently at Australian National University, Department of Computer Science, Canberra, Australia. Research interests: Mechanical verification, program refinement. John Harrison, post-doc researcher at Åbo Akademi University, Department of Computer Science, from University of Cambridge, Computer Laboratory, UK. Research interests: Automated reasoning, interactive theorem proving, HOL. Alexandru Mateescu, visiting researcher at University of Turku, Department of Mathematics. Professor at University of Bucharest, Romania. Research interests: Formal languages. Gheorghe Păun, visiting researcher at University of Turku, Department of Mathematics. Senior researcher at the Institute of Mathematics of the Romanian Academy. Research interests: Formal languages, theory and applications. Wojciech Plandowski, post-doc researcher at University of Turku, Department of Mathematics, from Institute of Informatics of Warsaw University, Poland. Research interests: complexity aspects of text problems. Hong Shen, researcher at Åbo Akademi University, Department of Computer Science. Currently at Griffith University, Australia. Research interests: Algorithmics, parallel processing. Wolfgang Weck, post-doc researcher at Åbo Akademi University, Department of Computer Science, from Federal Institute of Technology (ETH), 21

26 Zürich, Switzerland. Research interests: Independently Extensible Software Systems, Component-Oriented Programming. Xu Qiwen, visiting researcher at Åbo Akademi University, Department of Computer Science. currently at United Nations University, International Institute for Software Technology, Macau. Research interests: Formal methods, concurrent systems. 4.5 Ph.D. Students The following students have been enrolled for studies with TUCS Graduate School during the year: Olayele Adelakun, M.Sc., Turku School of Economics and Business Administration, Institute of Infomation System Science. Martin Büchi, M.Sc., Åbo Akademi University, Department of Computer Science. Research interests: Formal Methods. Cunsheng Ding, M.Sc. University of Turku, Department of Computer Science. Tomas Finne, M.Sc., Åbo Akademi University, IAMSR. Research interests: Information Security, DSS, Financial Planning, Risk Management. Åke Gustavsson, Ph.Lic., Åbo Akademi University, Department of Computer Science. Research interests: Simulation modelling, Petri nets (applied for simulation), AI and logic, graph theory. Harri Hakonen, M.Sc., University of Turku, Department of Computer Science. Research interests: String algorithms, Longest Common Subsequences, Substring Search, Modelling (and Compressing) Textual Data Bases. Eric Hedman, M.Sc. Åbo Akademi University, Department of Computer Science. Jukkapekka Hekanaho, M.Sc., Åbo Akademi University, Department of Computer Science. Research interests: Machine learning, genetic algorithms, biases in concept learning. Philipp Heuberger, M.Sc., Åbo Akademi University, Department of Computer Science. Research interests: Refinement calculus, object-oriented programming, action systems, abstract algebra, tool support with and for Oberon. 22

27 Mika Hirvensalo, M.Sc., graduate student at University of Turku, Department of Mathematics. Research interests: Quantum computing. Lucian Ilie, M.Sc., University of Turku, Department of Mathematics. E- mail: Research interests: Formal languages and automata theory, combinatorics on words, computational complexity. Antero Järvi, M.Sc., University of Turku, Department of Computer Science. Jaakko Järvi, M.Sc. University of Turku, Department of Computer Science. Research interests: Biomedical Signal Analysis, Neural networks in signal processing. Jouni Järvinen, M.Sc., University of Turku, Department of Mathematics. E- mail: Research interests: Knowledge Representation Systems, Rough Sets. Kalle Kangas, M.Sc., Turku School of Economics and Business Administration, Institute of Infomation System Science. Timo Kaukoranta, M.Sc. University of Turku, Department of Computer Science. Research interests: Image compression (block truncation coding, vector quantization, image quality) and image processing. Antti Kilpinen, Dr.Tech. researcher at Åbo Akademi University, IAMSR. Research interests: Strategic technology management, decision support systems. Eija Koskivaara, M.Sc., Turku School of Economics and Business Administration, Institute of Infomation System Science. Research interests: Neural networks. Linas Laibinis, M.Sc., Åbo Akademi University, Department of Computer Science. Jouni Lappi, M.Sc., Åbo Akademi University, IAMSR. Research interests: Decision models (particularly Analytical Hierarchy Process), fuzzy logic. Jan-Christian Lehtinen, M.Sc. University of Turku, Department of Computer Science. Research interests: Neural Networks, Radial Basis Functions, Classification of Medical Data, Interpolation and Approximation in Multi-Dimensinal Space. Arto Lepistö, M.Sc., University of Turku, Department of Mathematics. E- mail: Research interests: Combinatorics of words. Jianming Liang, M.Sc., University of Turku, Department of Computer Science. 23

28 Shuhua Liu, M.Sc., Åbo Akademi University, IAMSR. Thomas Långbacka, Ph.Lic., University of Helsinki, Department of Computer Science. Research interests: Parallel/distributed computing, formal specification/verification methods, mechanical theorem proving (the HOL system), user interface design and development. Gábor Magyar, M.Sc., graduate student at University of Turku, Department of Computer Science. Research interests: Combinatorical Optimization. Alexander Malioukov, M.Sc., Åbo Akademi University, Department of Computer Science. Research interests: Object-Oriented Modeling and Design, Graphical Presentation of Formal Specifications, Formal Methods. Valeria Mihalache, M.Sc., University of Turku, Department of Mathematics. Research interests: Formal languages and automata theory, DNA computing, Computational linguistics. Leonid Mikhajlov, M.Sc., Åbo Akademi University, Department of Computer Science. Research interests: Object oriented design and programming, OO design patterns, Application of formal methods to object oriented design and programming, Mechanical verification of OO programs. Anna Mikhajlova, M.Sc., Åbo Akademi University, Department of Computer Science. Research interests: Application of Formal Methods to Object-Oriented Design and Construction, Refinement Calculus, Automated Reasoning (HOL, PVS). Janne Näppi, M.Sc., University of Turku, Department of Computer Science. Research interests: Automatic analysis of digital mammograms, Mammographic lesion models, Medical imaging, Digital image processing, Computer vision. Tomi Pasanen, M.Sc., University of Turku, Department of Computer Science. Research interests: Analysis of algorithms and data structures, especially in-place ones. Juha Pärnistö, M.Sc., Turku School of Economics and Business Administration, Institute of Infomation System Science. Rimvydas Rukšėnas, M.Sc., Åbo Akademi University, Department of Computer Science. Research interests: Formal methods in the design of the asynchronous systems, Mechanisation of the Refinement Calculus, Interactive environments for proof and/or program construction. Fredrik von Schoultz, Ph.Lic., Åbo Akademi University, Department of Computer Science. Research interests: Simulation nets, Simulation as decission support, Project management. 24

29 Tiberiu Seceleanu, M.Sc., Åbo Akademi University, Department of Computer Science. Marko Toivonen, M.Sc. University of Turku, Department of Computer Science. Research interests: Digital Image Processing, Object (Target) Tracking. Vesa Torvinen, M.Sc. University of Turku, Department of Computer Science. Research interests: IS development methodologies. Elena Troubitsyna, M.Sc., Åbo Akademi University, Department of Computer Science. Research interests: Analysis of probabilistic behavior of distributed systems and real-time systems. Marina Waldén, Ph.Lic., Åbo Akademi University, Department of Computer Science. Research interests: Formal construction and analysis of distributed systems. Jukka Viitanen, M.Sc., Turku School of Economics and Business Administration, Institute of Infomation System Science. Eva Wilppu, M.Sc., Turku School of Economics and Business Administration, Institute of Infomation System Science. Yi Zhao, M.Sc., Åbo Akademi University, Department of Computer Science. Research interests: Parallel and distributed systems, Programming methodology. 4.6 TUCS Laboratory The following persons have been employed at the TUCS laboratory during the year: Mats Aspnäs, researcher at Åbo Akademi University, Department of Computer Science. Research interests: Parallel programming. Roberto Hortal, lab. engineer Emil Sekerinski, post-doc researcher at Åbo Akademi University, Department of Computer Science. Research interests: Program refinement, object-oriented programming. 4.7 TUCS Office The following administrative staff have been employed by the TUCS office during the year: 25

30 Mavi Hekanaho, part-time secretary Katri Hentula, secretary Tiina Lehto, education secretary Mia Salo, planning officer,

31 Chapter 5 Accepted Theses The following Ph. D. and Ph. Lic. thesis have been accepted during the year. 5.1 Theses for Doctor of Philosophy 1. Malin Brännback, Strategic Decisions and Decision Support Systems. Åbo Akademi, IAMSR. 2. Timo Käkölä, Dual Information Systems in Hyperknowledge Organizations. University of Turku, Department of Computer Science. 3. Ville Leppänen, Studies on the Realization of PRAM. University of Turku, Department of Computer Science. 4. Marjo Lipponen, On Primitive Solutions of the Post Correspondence Problem. University of Turku, Department of Mathematics. 5. Hannu Salmela, The Requirements for Information Systems Planning in a Turbulent Environment. Turku School of Economics and Business Administration, Institute of Information Systems Science. 5.2 Theses for Licentiate of Philosophy 1. Thomas Finne, Analyzing Information Security: a Knowledge-Based DSS Approach, Åbo Akademi, IAMSR. 2. Kalle Kangas, Information Resources Management in the Russian Trade of a Finnish Conglomerate. Turku School of Economics and Business Administration, Institute of Information Systems Science. 3. Tero Laihonen, Covering Radius and Dual Distance. University of Turku, Department of Mathematics. 27

32 4. Fredrick von Schoultz, Simulation for project administration, Åbo Akademi, Department of Computer Science. 5. Marina Waldén, Superposition as a method to reason about distributed algorithms. Åbo Akademi, Department of Computer Science. 6. Harry Virtanen, Lukasiewicz logic programming. Åbo Akademi, Department of Computer Science. 28

33 Chapter 6 Publications TUCS has three publication series: TUCS Dissertations (ISSN ) contains doctoral dissertations by researchers affiliated with TUCS TUCS Technical Reports (ISSN ) contains technical reports from TUCS. This series is part of NCSTRL, the Networked Computer Science Technical Reports Library, administered by the Computer Science department at Cornell University. TUCS General Publications (ISSN ) contains all other publications from TUCS, like proceedings from conferences organized by TUCS, the annual reports, etc. Most of the publications from TUCS are available on-line in electronic format (as a PostScript file) from TUCS World Wide Web pages at the adress Information about all other publications than those published in TUCS own publication series is available from TUCS web pages at This information is based on a large bibliographic database in BibTeX format, which can be viewed in different ways, e.g. by research group, by publication type (journal paper, conference proceeding, technical report, Ph.D. thesis, book) and by year, or any combination of these. There is also a search method with which you can search for all publications by one author. 6.1 TUCS Dissertations The following doctoral dissertations have been published during the year: 1. Marjo Lipponen, On Primitive Solutions of the Post Correspondence Problem. 29

34 2. Timo Käkölä, Dual Information Systems in Hyperknowledge Organizations. 3. Ville Leppänen, Studies on the Realization of PRAM. 6.2 TUCS Technical Reports The following technical reports have been published during the year: 1. Jim Grundy, Trustworthy Storage and Exchange of Theorems. 2. Jukka Hekanaho, Background Knowledge in GA-based Concept Learning. 3. Mikko Ruohonen, Information Technology Mediated Activities in Organizational Contexts - A Case of Strategic Information Systems Planning. 4. Emil Sekerinski, Deriving Control Programs by Weakest Preconditions. 5. Emil Sekerinski and Kaisa Sere, A Theory of Prioritizing Composition. 6. John Harrison, Optimizing Proof Search in Model Elimination. 7. Jim Grundy and Thomas Långbacka, Towards a Browsable Record of HOL Proofs. 8. Valeria Mihalache, On the Generative Capacity of Parallel Communicating Grammar Systems with Regular Components. 9. Markku I. Nurminen and Vesa Torvinen, Role-based Interpretation of ISs. 10. Lucian Ilie and Arto Salomaa, 2-Testability and relabelings produce everything. 11. Lucian Ilie, On computational complexity of contextual languages. 12. Lucian Ilie, Collapsing hierarchies in parallel communicating grammar systems with communication by command. 13. Cunsheng Ding and Arto Salomaa, On Cooperatively Distributed Ciphering and Hashing. 14. Valeria Mihalache, Szilard Languages Associated to Parallel Communicating Grammar Systems. 30

35 15. Alexandru Mateescu and Arto Salomaa, Parallel Composition of Words with Re-entrant Symbols. 16. Lucian Ilie and Victor Mitrana, Crossing-over on Languages. A Formal Representation of the Recombination of Genes in a Chromosome. 17. Valeria Mihalache, Gheorghe Păun, Grzegorz Rozenberg and Arto Salomaa, Generating Strings by Replication: A Simple Case. 18. Lucian Ilie and Victor Mitrana, Binary Self-Adding Sequences and Languages 19. Tero Harju and Lucian Ilie, Languages obtained from infinite words. 20. Vesa Halava, Tero Harju and Lucian Ilie, On a Geometric Problem of Zig-Zags. 21. Szvetlana Fullér, Intranet and Active DSS: Instruments for Corporate Success. 22. Jim Grundy, A Browsable Format for Proof Presentation. 23. Valeria Mihalache and Arto Salomaa, Growth Functions and Length Sets of Replicating Systems. 24. Philipp Heuberger and Alexandru Mateescu, Weak and Strong Structural Induction and its Mechanical Support by a Proof Tool. 25. Timo Kaukoranta, Pasi Fränti and Olli Nevalainen, Reallocation of GLA codevectors for evading local minimum. 26. Pascale Charpin, Aimo Tietäväinen and Victor Zinoviev, On Binary Cyclic Codes with d= Marjo Lipponen, Decision problems concerning prime words and languages of the PCP. 28. Aimo Tietäväinen, Vinogradov s method and some applications. 29. Thomas Finne, CBISA - a DSS for Analysing a Company s Information Security: A Tool for Decreasing Uncertainty. 30. Thomas Finne, Computer Support for Information Security Analysis in a Small Business Environment. 31. M. Waldén and K. Sere, Deriving Distributed Systems using B-Method. 32. Fredrick von Schoultz, Simulating Project Progress. 33. Fredrick von Schoultz, Uwe Malzahn, Ralf Schulz, An Integrated Project Management Information System 31

36 34. Kimmo Palletvuori, Petri Luostarinen, Kari Muurinen, Olli Nevalainen, On the scheduling of a multipurpose laboratory analysis instrument. 35. Ralph-Johan Back, Joakim von Wright, Interpreting Nondeterminism in the Refinement Calculus. 36. John Harrison, Formalized Mathematics. 37. Aimo Törn, Montaz Ali, Sami Viitanen, Stochastic Global Optimization: Problem Classes and Solution Techniques. 38. Thomas Finne, Why Safeguard Information? 39. Marjo Lipponen and Arto Salomaa, Simple Words in Equality Sets. 40. Barbro Back, Teija Laitinen, Kaisa Sere and Michiel van Wezel, Choosing Bankruptcy Predictors Using Discriminant Analysis, Logit Analysis, and Genetic Algorithms. 41. Alexandru Mateescu, Grzegorz Rozenberg and Arto Salomaa, Shuffle on Trajectories: Syntactic Constraints. 42. Sorina Dumitrescu, Gheorghe Păun, Arto Salomaa, Pattern Languages versus Parallel Communicating Grammar Systems. 43. Gheorghe Păun, Arto Salomaa, From DNA Recombination to DNA Computing Via Formal Languages. 44. Solomon Marcus, Carlos Martin-Vide, Gheorghe Păun, Contextual Grammars versus Natural Languages. 45. Carlos Martin-Vide, Gheorghe Păun, Arto Salomaa, Characterizations of RE Languages by Means of Insertion Grammars. 46. Lucian Ilie, The computational complexity of Marcus contextual languages. 47. M.M.Ali, C.Storey and A.Törn, Application of some recent stochastic global optimization algorithms to practical problems. 48. Barbro Back, Mikko Irjala, Kaisa Sere, Hannu Vanharanta, Managing Complexity in Large Data Bases Using Self-Organizing Maps. 49. Lila Kari, Gheorghe Păun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu, DNA Computing, Matching Systems, and Universality. 50. H.J.M. Goeman, J.N. Kok, K. Sere, R.T. Udink, Coordination in the ImpUnity Framework. 32

37 51. Valeria Mihalache and Arto Salomaa, Language-Theoretic Aspects of String Replication. 52. Mika Johnsson, Timo Leipälä, Teuvo Pulliainen, Olli Nevalainen, Integrated Program Generation System for a PC-board Assembly Line. 53. M. Butler and M. Waldén, Distributed System Development in B. 54. J. Plosila and K. Sere, Action Systems in Pipelined Processor Design. 55. Rimvydas Rukšėnas and Kaisa Sere, Handshaking Expansion as Action System Refinement. 56. Julien Cassaigne, Juhani Karhumäki and Tero Harju, On the decidability of the freeness of matrix semigroups. 57. Julien Cassaigne and Juhani Karhumäki, Examples of undecidable problems for 2-generator matrix semigroups. 58. Juhani Karhumäki, Wojciech Plandowski and Wojciech Rytter, Patternmatching problems for 2-dimensional images described by finite automata. 59. Mika Johnsson, Sari Peltonen, Timo Leipälä, Olli Nevalainen, Work Load Balancing of a Generalized Flexible Flow Line in Printed Circuit Board Production. 60. Juha Plosila, Rimvydas Rukšėnas and Kaisa Sere, Delay-Insensitive Circuits and Action Systems. 61. Alexandru Mateescu, George Daniel Mateescu, Grzegorz Rozenberg and Arto Salomaa, Shuffle-like operations on ω-words. 62. Alexandru Mateescu, Kai Salomaa and Sheng Yu, Decidability of fairness for context-free languages. 63. Valeria Mihalache and Victor Mitrana, Deterministic Cooperating Distributed Grammar Systems. 64. Tomi Pasanen, Elementary average case analysis of Floyd s algorithms to construct heaps. 65. Ralph Back, Jim Grundy, Joakim von Wright, Structured Calculational Proof. 66. Ralph Back, Martin Büchi, Emil Sekerinski, Adding Type-Bound Actions to Action-Oberon. 67. Eija Koskivaara, Artificial neural network models for predicting patterns in auditing monthly balances. 33

38 68. Jurgen Dassow, Victor Mitrana and Arto Salomaa, Context-Free Evolutionary Grammars and Structural Language of Nucleic Acids. 69. Victor Mitrana, On Morphisms Preserving Primitive Words. 70. Victor Mitrana and Ralf Stiebe, The Accepting Power of Finite Automata Over Groups. 71. Jukka Hekanaho, Testing Different Sharing Methods in Concept Learning. 72. Jukka Hekanaho, A GA-based Approach to Disjunctive Concept Learning. 73. T. Harju, J.Karhumäki and D. Krob, Remarks on Generalized Post Correspondence Problem. 74. A. Lepistö, A Characterization of 2 + -free Words over a Binary Alphabet. 75. C. Choffrut, T. Harju and J. Karhumäki, A Note on Decidability Questions on Presentations of Word Semigroups. 76. J. Hromkovic and J. Karhumäki, Two Lower Bounds on Computational Complexity of Infinite Words. 77. C. Choffrut and J. Karhumäki, Combinatorics of words. 78. T. Harju and J. Karhumäki, Morphisms. 79. Eva Wilppu, Controlling Logistics with Neural Networks. 80. Tero Laihonen and Simon Litsyn, On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes. 81. Iiro Honkala, Tero Laihonen and Simon Litsyn, On Covering Radius and Discrete Chebyshev Polynomials. 82. Pascale Charpin, Aimo Tietäväinen and Victor Zinoviev, On the Divisibility of Certain Polynomials over Finite Fields. 83. Iiro Honkala and Aimo Tietäväinen, Codes and Number Theory. 84. Shuhua Liu, Strategic Scanning and Interpretation: the Organization, Strategic Management and Information Processing Context. 85. Shuhua Liu, Applying Intelligent Agents in the Scanning and Interpretation of Strategic Data. 34

39 6.3 TUCS General Publications The following general publications have been published during the year: 1. Joakim von Wright, Jim Grundy, John Harrison (Eds.), Supplementary Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics: TPHOLs Mikko Ruohonen, Juha Pärnistö (Eds.), Proceedings of the First European Doctoral Seminar on Strategic Information Management. 3. Christer Carlsson (Editor), Exploring the Limits of Support Systems. 35

40 36

41 Chapter 7 Courses The following courses have been given during the year. The courses are classified into the main research areas of TUCS as follows: A Algorithmics DM Discrete Mathenatics ES Embedded Systems IS Information Systems SE Software Engineering 7.1 General Courses Algebraic Function Fields and Codes 2.5/5 credits, Fall Spring Lecturer Jyrki Lahtonen. Seminar sessions: participant to give 4-6 hours of seminar talks to obtain 2.5 credits, hours to obtain 5 credits. DM, SE, A. The aim of the course is to cover some algebraic geometry that can be applied to coding theory. Preliminary knowledge: A course in the theory of fields. Observe that the seminar is a continuation of a seminar that started in the fall of 94. Literature: Henning Stichtenoth: Algebraic Function Fields and Codes, Springer (Universitext), Seminar on Programming Methodology credits, Fall Spring Lecturer Ralph Back h seminar sessions. SE, A, DM. The seminar is intended to give an overview of current research directions in the area of programming methodology, in the form of presentations by participants. 37

42 Advanced course on data structures 3 credits, Spring Lecturer Timo Raita. 56 h lectures, examination. A, SE. The course concentrates of various data structures supporting fast search and update operations. The structures are studied from two perspectives. From the theoretical point of view, we analyse their performance using a given model of computation. The practical point of view concentrates of the usability of the structures in a given application. The purpose of the course is to study each structure in depth and to give the student the ability to choose an appropriate data representation for a given problem. Preliminary knowledge: The Design and Analysis of Algorithms (recommended), Data Structures and Algorithms. Literature: T.H. Cormen, C.E. Leiserson and R.L. Rivest: Introduction to Algorithms, MIT Press, G.H. Gonnet and R. Baeza-Yates: Handbook of Algorithms and Data Structures (2nd Edition), Addison-Wesley, Algebra of processes 2 credits, Spring Lecturer Alexandru Mateescu. 20 h lectures, examination. DM, SE, A. The course introduces some algebraic models for concurrency. Starting with Basic Process Algebra, the theory will be extended to parallel processes and parallel processes with communications. Protocols and verification methods are investigated. Preliminary knowledge: Elements of universal algebra are useful but not necessary. Coding theory seminar 2,5 credits, Spring Lecturer Aimo Tietäväinen. 28 h seminar sessions. DM, SE, A. Some latest research results in the field of error-correcting codes, CDMA systems and finite fields are discussed. Preliminary knowledge: Basic knowledge in coding theory. Complexity theory 5 credits, Spring Lecturer Juhani Karhumäki. 56 h lectures, 28 h exercises, examination. DM, SE, A. Complexity theory studies computational complexity of algorithms, that is how many steps will it take to perform certain computations. This theory has developed drastically during the last 20 years, and has revealed new perspectives what can be done and cannot be done by computers. This development has also pointed out several fundamental open problems, such as P=NP -problem. In this course basics of complexity of algorithms are presented concentrating on P=NP -problem and other complexity classes. Preliminary knowledge: Basics on algorithms and formal languages. Recommended literature: H. S. Wilf: Algorithms and Complexity, Prentice Hall,

43 M.R. Garey and D.S. Johnson: Computers and Intractability, Freeman, Decision support systems 5 credits, Spring Lecturer Christer Carlsson. 20 h lectures + examination, cases, exercises, working papers. IS. The aim of the course is to teach 1. the theory and the methodology of decision support systems, 2. techniques for building systems with application software and 3. methods for implementing and using them for planning and decision making in a corporate context. Preliminary knowledge: Modeling Languages and Problem Solving Methods. Literature: M. Klein and Leif B. Methlie: Expert Systems, A Decision Support Approach, Addison Wesley (2nd ed.), E. Turban: Decision Support and Expert Systems, (3rd ed.) MacMillan Publishing Company, New York Distributed databases 5 credits, Spring Lecturer Timo Järvi. 56 h lectures, 14 exercises, examination, and course assignment. A, SE, IS. The reasons for and the pitfalls in distributed databases. Consistency, concurrency, and optimization problems. Preliminary knowledge: Basic course in databases. Literature: Özsu, M. Taner: Principles of distributed database systems, Prentice-Hall Cellary, Gelenbe, Morzy: Concurrency Control in Distributed Database Systems, North-Holland Chorafas, Dimitris N.: Handbook of database management and distributed relational databases, Tab Books (Indepth) Analysis and (re)design of information systems 5 credits, Spring Lecturer Markku Nurminen. Lectures, exercises, literature, examination. IS. The aim of the course is to get acquainted with contemporary approaches to information systems development and to apply them to concrete situations. Some actual themes are listed below. Redesign often will replace design which implies another type of analysis. Object-oriented methods are frequently used. Intended changes vary in their scope from computer interfaces to organisation of work and further to business processes. Networks and other infrastructures create new requirements. Many systems are purchased from an outside vendor. 39

44 Preliminary knowledge: Information systems, information systems development. Probabilistic algorithms 5 credits, Spring Lecturer Aimo Törn. 30 h lectures + 15 h exercises + assignment + examination. SE, A, DM. The students will learn how to solve problems by using probabilistic algorithms. A probabilistic algorithm is an algorithm where the result is obtained by making random explorations. This means that the result must be interpreted statistically, i.e., in the same way as results obtained in laboratory experiments. In some applications the use of probabilistic algorithms is natural, e.g. simulating the behaviour of some existing or planned system over time. In this case the result by nature is stochastic. When the problem to be solved is deterministic applying a probabilistic algorithm is called the Monte Carlo method. In both these cases the accuracy of the result increases with an increasing number of experiments. There are also a number of problems where the result given by the probabilistic algorithm is exact but where the probability of the result to be correct is less than one. By increasing the number of experiments very high probability for the result to be correct can be obtained. For some problems probabilistic algorithms that are always correct and probably fast can be designed. One incentive for using probabilistic algorithms is that their application does not normally require sophisticated mathematical knowledge. Further, the programming is normally rather trivial which means that an acceptable approximate solution can be obtained quickly. One can say that the use of probabilistic algorithms sometimes allows that theoretical knowledge and analytical work is compensated for by making extensive simple machine computations. Literature: G. Brassard and P. Bratley: Algorithmics - Theory and Practice, Prentice-Hall, 1988, Chapter 8. D. Harel: The Spirit of Computing, 2nd edition, Addison-Wesley, 1992, Chapter 11. D.E. Knuth: The Art of Computer programming, Vol 2, Seminumerical Algorithms, Addison-Wesley, 1969, Chapter 3. A. Törn: Simulation Modelling, Reports on Computer Science & Mathematics, Ser. B, No. 12, Problem solving methods 5 credits, Spring Lecturer Christer Carlsson. 28 h lectures + examination, cases, working papers. IS. The aim of the course is to teach the use of modern analytical techniques and modelling tools as a basis for decision support and good and effective decision making in a corporate context. The course will give skills in building, using and critically evaluating MS/OR models with or without computer support. 40

45 Literature: J. Oberstone: Management Science, West Publishing Company, St. Paul Taha, Hamdy A.: Operations Research - An Introduction, (4th ed) MacMillan, New York Seminar on programming methodology credits, Fall Spring Lecturer Ralph Back h seminar sessions. SE, A, DM. The seminar is intended to give an overview of current research directions in the area of programming methodology, in the form of presentations by participants. Social impacts of IT 5 credits, Spring Lecturer Reima Suomi. 28 h lectures + examination, examination on literature. IS. The aim of this course is to familiarize students with the impact of IT, within but also beyond organizational boundaries. Impacts and changes can be seen in terms of, for instance, the social and political structure of society, changes in organization, structures and competition within and between industries, the decentralization or centralization of decision making, the division of labour, employment, privacy, communication and user-participation. Literature: A collection of articles on the topic. The role of IT in business operations 5 credits, Spring Lecturer Mikko Ruohonen. 20 h lectures, 10 h exercises, examination on literature. IS. The aim of this course is to broaden and deepen students understanding on the role of information technology in business. Literature: A collection of the articles on the topics. Topics in logic 2,5 credits, Spring Lecturer Magnus Steinby. 28 h lectures + 10 h exercises + examination. DM, SE, A. The purpose of the course is to introduce some areas of logic which are not covered by a standard course in mathematical logic. The subjects considered here are all also relevant in applications of logic to computer science. The following is a tentative list of topics: Proof methods for propositional logic: semantic tableaux, resolution, sequent calculus. Herbrand models, unification and resolution in predicate logic. Horn clauses. Modal logic. Preliminary knowledge: Mathematical logic or some equivalent course. Literature: The material will be drawn from several sources including the following books: B. F. Chellas: Modal Logic: An introduction, Cambridge University Press, Cambridge H.-D. Ebbinghaus, J. Flum and W. Thomas: Einführung in die Mathematische Logic (3. Aufl.), B.I. Wissenschaftsverlag, Mannheim

46 J.H. Gallier: Logic for Computer Science, Harper-Row, New York A. Nerode and R. A. Shore: Logic for Applications, Springer-Verlag, New York U. Schöning: Logic for Computer Scientist, Birkhäuser, Boston Advanced decision support systems 5 credits, Fall Lecturer Christer Carlsson (IAMSR, Åbo Akademi University). Lectures. SE, A, IS. Advanced Programming Methods 5 credits, Fall Lecturers Ralph-Johan Back, Wolfgang Weck and Alexander Ran. 52 h lectures, examination, assignments. SE, A, IS. The course is concerned with methods for constructing large, reliable,wellstructured and extendable software systems. The object-oriented programming paradigm forms the basis for the methods considered. The programming language Oberon-2 and the Oberon System are used to illustrate the concepts and techniques involved. Among the topics covered are Object-oriented analysis and design Specification of object-oriented programs Class hierarchies and frameworks Object-oriented programming in Oberon-2 Component software technology Design patterns for object oriented systems Preliminary knowledge: Programming course (Pascal, Modula-2, C). Literature: Seidewitz, Ed and Mike Stark: Reliable Oject-Oriented Software, SIGS Books, Moessenboeck, Hanspeter.: Object-oriented programming in Oberon-2, Springer-Verlag Orfali, Robert, Dan Harkey and Jeri Edwards: The Essential Distributed Objects Survival Guide, John Wiley and Son, Oberon Microsystems: Oberon/F: The Framework, Oberon Microsystems, Inc, Gama, Eric and al.: Design Patterns.Addison-Wesley, Artificial intelligence 3 credits, Fall Lecturer Timo Knuutila (University of Turku). 52 h lectures, examination. A, DM, SE. Artificial intelligence tries to apply computers to problems, which humans usually solve better than machines. The course gives an overview of 42

47 the principles, problems and methods of artificial intelligence. The main topics are knowledge representation and heuristic problem solving. Also the principles of predicate logic and theorem proving are explained. Artificial neural networks are introduced as a tool for machine learning. Preliminary knowledge: Discrete mathematics. Data structures and algorithms. Literature: Ginsberg, M.: Essentials of Artificial Intelligence, Morgan Kaufmann Publishers, Rich, E. and Knight, K.: Artificial Intelligence (2nd ed.), McGraw- Hill,1991. Winston, P.H.: Artificial Intelligence (3rd ed.), Addison-Wesley, Basic Digital Design 5 credits, Fall Lecturer Jouni Isoaho (Åbo Akademi University). Lectures and exercises. Starts on Tuesday September 17 at in Auditorium 3101 (Default) in DataCity. ES This is very elementary ( obligatory basic knowledge) course for everybody who intends to work with modern embedded systems. For software students it is also very suitable as an advanced course. The course also provides background required for digital ASIC and VLSI design. Content: Introduction to digital design. Combinatorial and sequential systems. Component specification, optimisation and design. Introduction to VHDL based design. Modern design tools Literature: M.D. Ercegovac, T. Lang and J.H. Moreno: Introduction to Digital Systems, 1996 (more information on the first lecture), Separate lecture material Laboratory Exercises: Laboratory exercises will be arranged by Turku Institute of Technology. Total amount of exercises will be about 48 hours. Mr. Aki Pellinen will be the assistant. More information about exercises will be announced later. Combinatorics of words 5 credits. Fall 1996 / Spring Lecturer Juhani Karhumäki. 56 h lectures, examination. DM. A word is a finite or infinite sequence of symbols (from a finite set). In this course we consider simple, as well as more advanced, combinatorial problems of words. For example, when two words commute, or how long words exist without comtaining a repetition of a certain type (like a square). Also some more algebraic properties of words are considered, results have applications in many fields of discrete mathematics and theoretical computer science. Preliminary knowledge: Basics on algorithmics and combinatorics are needed, and on automata is useful. Recommended litterature: M. Lothaire: Combinatorics of words, Addison- Wesley

48 C. Choffret and J. Karhumäki: Combinatorics of words, in Handbook of Formal Languages, Springer (to appear). Database structures and algorithms 3 credits. Fall Lecturer Jukka Teuhola. 52 h lectures, examination. A, SE. The course gives a broad description of external storage structures and algorithms, applied in modern database systems. Several types of databases are studied, starting from the standard relational database, and continuing with nested relational, object-oriented, spatial, temporal, document and multimedia databases. For each type, typical storage structures and operations are described. Structures include different kinds of trees, dynamic hash structures, indexes, linked structures, grid organization, and signature files. Operations include many kinds of searching (single-key, multi-key, range, approximate), as well as sorting, joining, duplicate deletion, set operations, clustering and compression. Preliminary knowledge: Data structures and algorithms, basic course on databases. Literature: Miscellaneous books and articles (to be announced). Functional Programming 5 credits. Fall Lecturer Aimo Törn. Lectures, exercises, examination, assignment. SE. Traditional programming languages conform to the general architecture of computer systems, with its provision of assignment to variables whose values change while the program is running. This means that programs written in these languages must specify exactly the order in which those changes occur. This style of programming is imperative, that is, it explicitely states the order in which events must occur. An alternative is to consider languages which are declarative rather than imperative in style. That is, they dispense with variables and assignment of values to them so there is no longer any need to order changes to the values of variables. Declarative programs are constructed from expressions (functions) rather than ordered statements. Recursion is a strong element in functional languages. Another feature is that values of functions may be new functions. Together with other features this makes functional languages very powerful so that considerable designs can be expressed in a few lines. This characteristic facilitates fast implementation of requirements and evaluation of functional characteristics which means that FP is well suited for software prototyping. Topics covered include: FP principles, and the languages Scheme, Standard ML, and metoo. Scheme is a dialect of Lisp (List Programming) an untyped prefix notational language developed in the late 50s at MIT by John McCarty, SML (late 80s) is a typed infix notational language, and metoo takes the form of an executable formal specfication language for describing 44

49 and prototyping system designs at the early stage of develpment. Literature: Alexander, H. and V. Jones: Software Design and Prototyping Using metoo, Prentice Hall, New York, Myers, C., C. Clack and E. Poon: Programming with Standard ML, Prentice Hall, New York, Springer, G. and D.P. Friedman: Scheme and the Art of Programming, MIT Press, London, Graph theory 5 credits. Spring Lecturer Tero Harju. 56 h lectures, 28 h exercises, examination. DM. This is an introductory course in the theory of graphs covering planarity, coloring and labeled directed graphs. Graph theory has a wide range of application in mathematics, linguistics, genetics and other research areas. In the theory of communication networks it is the basic tool of research. Recommended litterature: Wilson, R.J.: Introduction to Graph Theory, 3rd edition. Hardware Design Methods 5 credits. Fall Lecturers Kaisa Sere and Jouni Isoaho. 52 h lectures, seminars, examination. ES. Due to decreased product life-times and rapid increase in complexity and performance requirements of current embedded systems, like cellular phones/mobile computing, multimedia platforms and home theater equipments, very efficient design methods have to be used. To fulfill the design time and cost requirements a system design process has to cover both software and hardware designs in a common framework. The Hardware Design Methods course covers the system design process starting from high level specification phase downto implementation of system. Main emphasis is on high level decisions and hardware implementation aspects, but also the important software engineering aspects are covered. The course is targetted for students having background either on software or hardware side. The aim of the course is to provide students an overall understanding of the system design process. The course helps students to do reasonable system decisions and thus help them to utilize their earlier knowledge in embedded system development. Human Resource Management and IS 1 credit. Fall Lecturer Mikko Ruohonen. 14 h lectures. IS. The course will raise the current research and development issues concerning IS human resources. The basic question is how to manage human resources in the context of evolving use of IT. Human resource qualifications both user and IS professional level will change. In addition to that IS organizations are changing.the course will discuss the needs of IS workforce, the role of IS organization and management development topics. 45

50 Literature: A collection of articles Introduction to lattice theory 2.5 credits. Fall Lecturer Magnus Steinby (University of Turku). 28 h lectures, 14 h exercises, examination. DM. Lattics theory is a well-developed branch of abstract algebra which also has applications in other areas of mathematics, computer science, physics etc. We consider the general basics of the theory, modular, distributive and Boolean lattices, complete lattices and closure systems, algebraic lattices and fixpoint theorems. Preliminary knowledge: Some previous course in abstract algebra (groups, rings, etc.). Recommended litterature: Grätzer: General lattice theory (1978). Davey & Priestley: Introduction to lattices and order (1990). Lattice theory in computer science 3 credits. Fall Lecturer Reino Vainio (Åbo Akademi University). 26 h lectures, 10 h exercises. Prerequisite: Magnus Steinby s course Introduction to lattice theory. DM. The treatment of ordered sets and lattices in the course Introduction to Lattice-theory provides a firm foundation on which to build the theory of CPO s and domains. These structures are studied and then related to Scott s information systems. Fixpoint theory is presented both in the classic setting of complete lattices and, as most applications demand, in the setting of CPO s. Literature: B.A. Davey and H.A. Priestley: Introduction to Lattices and Order. Cambridge University Press (First published 1990). Programming Methods Seminar 2+2 credits. Fall 1996, Spring Moderator Ralph-Johan Back (Åbo Akademi University) h seminar session. DM, SE, A. The fall seminar will concentrate on case studies in program refinement, based on von Wright s and my Refinement Calculus book. The intention is to apply the theory and techniques of the book to some standard textbook sized programming excercises. Both manual proofs and mechanized proofs using the Refinement Calculator are of interest. Possible topics are, e.g., Basic algorithms within a specific restricted domain (sorting, integer algorithms, graph algorithms) Families of algorithms related by refinement Distributed algorithms in the action system framework Use of the Refinement Calculator to support simple program derivations 46

51 Angelic programs as a model for describing user interaction Atomicity refinement techniques for concurrent programs Data refinement in algorithm derivation Modelling object-oriented features and techniques in the Refinement Calculus The seminar is inteded for Ph.D. students and for M.Sc. students in search of a topic for their Master s thesis. The main work will be done in small individual projects, combinedwith some common meetings to present the research. The purpose is to produce a collection of articles illustrating different kinds of applications of the Refinement Calclulus theory. Preliminary knowledge: Basics of the Refinement Calculus. Literature: Back, R.J.R and J. von Wright: Refinement Calculus: A Systematic Introduction. Book in preparation, Seminar on algorithmics 2 credits. Fall Moderator Olli Nevalainen (University of Turku). 28 h seminar sessions. A Seminar on Knowledge Based Support Systems Carlsson Åbo Akademi, IAMSR. IS Fall Christer Systems delivery management 5 credits. Fall Lecturer Reima Suomi. 28 h lectures, literature, examinations. IS. This course will deepen education on systems development practices and management. Whereas the basic course TJ5 concentrates more on planning and implementation of information systems, this course will focus more on the management of such activities. Issues such as efficiency, effectiveness and productivity of systems development; organization of system work and outsourcing of IS activities; modern tool support; user requirement analysis; project management in single and multi-organization contexts; measurement of application size and productivity; costing and charging of IS services; negotiations and contracting with outside suppliers; and ethical issues within systems development and usage will be handled. Literature: Ince, D. - Sharp, H. - Woodman, M. Introduction to Software Project Management and Quality Assurance, McGraw-Hill, Jayaratna, N. Understanding and Evaluating Methodologies. A Systemic Framework. McGraw-Hill Book Company, A collection of the articles on the topics. 47

52 Theoretical foundations of information systems 4 credits. Fall Lecturer Markku Nurminen. 48 h lectures, essay, examination. IS. In the near future it will be increasingly important to understand different views on information systems when new development methodologies emerge and the domain of impacts is growing. The underlying assumptions and frameworks behind informations systems and their development are analysed. Different frameworks have different conceptualisations about the domain to be taken into account in the introduction of information technology, starting from a narrow technical definition to broader ones including language, work, social structures and business processes. A review on most important reference disciplines is provided. Preliminary knowledge: Information systems. Theory and methodology 5 credits. Fall Lecturer Christer Carlsson. Lectures, examination. IS Universal algebra I 2.5 credits. Fall Lecturer Magnus Steinby. 30 h lectures, 14 h exercises, examination. DM. Universal algebra was conceived as a common framework for the various branches of abstract algebra, but the present vigour of the field stems from its own goals. The usefulness of universal algebra in theoretical computer science is due to the generality and flexibility of its concepts, and the fact that it offers a natural formalism for discussing the interplay between syntactic and semantic notions. In this introductory course we focus on the fundamental notions of the theory: subalgebras, congruences, morphisms, quotient algebras, direct and subdirect products, subalgebra and congruence lattices, direct and subdirect decompositions, free algebras, terms, identities, and varieties of algebras. Preliminary knowledge: Lattice theory. Recommended litterature: Burris & Sankappanavar: A course in universal algebra (1981). Ihringer: Allgemeine Algebra (1988). Wechler: Universal algebra for computer scientists (1992). 7.2 Litterature Courses Advanced course on operating systems 3 credits. Fall 1996 / Spring Self-study course, examination. Material from Olli Nevalainen (University of Turku). A, ES, SE. The course concentrates on the implementation and efficiency issues of operating systems. Preliminary knowledge: Basics of Operating Systems (recommended). 48

53 Literature: Nutt, G.J.: Centralized and Distributed Operating Systems, Prentice-Hall, 1992 Information systems 5 credits. (Turku School of Economics and Business Administration). IS. The course focuses on development of IS infrastructure in business organisations. Analysis methods of IS costs and benefits are also included. Literature: Dreger, J. Brian, Function Point Analysis. Prentice-Hall, Gattiker, Urs E. - Larwood, Laurie (Eds.), End-user Training. de Gruyter, A collection of articles on the topics. Information systems management 5 credits. (Turku School of Economics and Business Administration). IS. Problems and issues related to information management and data bases are examined from theoretical and practical points of view. Literature: Communications Outlook. OECD Report, Ozkarahen, Esen, Database Management Concepts, Design and Practice. Prentice-Hall, Angell, I. O. - Smithson, S., Information Systems Management Opportunities and Risks. MacMillan Education Ltd, A collection of articles on the topics. Systems planning and design 5 credits. (Turku School of Economics and Business Administration). IS. The course examines planning and design of business and administrative information systems. Literature: Pressman, R. Software Engineering. A Practitioner s Approach. McGraw-Hill, 1994 (European Edition). Friedman, Andrew L., Computer Systems Development. John Wiley & Sons, Gray, M. - Hodson, N. - Gordon, G. Teleworking Explained. John Wiley & Sons, A collection of articles on the topics. The impacts of IT on society 5 credits. (Turku School of Economics and Business Administration). IS. The aim of the course is to expand students understanding of the impacts of IT on society and organisations. Literature: Krcmar, H. - Bjorn-Andersen, N. - O Callaghan, R. Edi in Europe, John Wiley & Sons,

54 Checkland, P. - Scholes, J. Systems Theory in Action. John Wiley & Sons, Boland - Hirscheim, Critical Issues in IS Research. John Wiley & Sons. A collection of articles on the topics. Theoretical background of information systems science 10 credits. (Turku School of Economics and Business Administration). IS. The course will deepen knowledge on theoretical issues and problems of information systems science. An analysis of the evolution of information systems and technologies is also included. Literature: Part I: Checkland, Peter, Systems Thinking, Systems Practice. John Wiley & Sons, Chichester, Markus, M. Lynne, Systems in Organizations. Cambridge, Part II: Proceedings of the 16th International Conference on Information Systems. Amsterdam, A collection of articles on the topics. 7.3 Short Courses Datastructuring techniques 1 credit, Spring Lecturer Jyrki Katajainen. 15 h lectures. DM, A, SE. The dictionary problem is that of supporting membership queries, insertions, and deletions in a dynamic set of objects. The aim of this course is to survey several different solutions for the dictionary problem. The methods surveyed include persistent, self-adjusting, randomized, and deferred data structures. Moreover, we study spatial and temporal locality, asymmetric data structures, and data structures with bounded domain. Solutions that do not use pointers include implicit data structures and dynamic perfect hashing. Preliminary knowledge: Some course on Algorithmics. Literature: J. Katajainen and E. Mäkinen: Member searching - A survey on modern methods, unpublished manuscript. Fuzzy Decision Making 2 credits, Spring 1996, 14 h lectures + case study + examination. Lecturer Robert Fullér. DM, A, SE. The process of information aggregation appears in many applications related to the development of intelligent systems. One sees aggregation in neural networks, fuzzy logic controllers, vision systems, expert systems and multi-criteria decision aids. Fuzzy set theory provides a host of attractive aggregation connectives for integrating membership values representing uncertain information. These 50

55 connectives can be categorized into the following three classes union, intersection and compensation connectives. Union produces a high output whenever any one of the input values representing degrees of satisfaction of different features or criteria is high. Intersection connectives produce a high output only when all of the inputs have high values. Compensative connectives have the property that a higher degree of satisfaction of one of the criteria can compensate for a lower degree of satisfaction of another criteria to a certain extent. The main goals of the short course are to explain how to choose appropriate aggregation operators to decision process where trade-offs are allowed; how to solve linear programming problems with soft objective function and constraints; how to model the decision maker s preferences by fuzzy sets; how to solve multiple objective programs using fuzzy logic; The lectures 1. Fuzzy sets and logic. Bellman and Zadeh s principle to fuzzy decision making. (2 hours) 2. Aggregation operators [t-norms, t-conorms] (2 hours) 3. Aggregation operators [OWA, MICA] (2 hours) 4. Fuzzy linear programming. (2 hours) 5. Fuzzy approaches to multiple objective programming. (2 hours) 6. Fuzzy screening systems. OWA operators: Further issues. (2 hours) 7. Fuzzy AHP. Exercises and solutions. (2 hours) Text algorithms 2 credits, Spring Lecturer Wojciech Rytter, University of Warsaw. 20 h lectures, examination. DM, A. Topics in combinatorics 2 credits, Spring Lecturer Daniel Krob, University of Paris. 20 h lectures, examination. DM, A. 51

56 52

57 Chapter 8 Conference participation TUCS has financed the following conference participations during the year: Adelakun, Olayele The 10th IRIS conference in Gothenburg, Sweden 3rd European conference on the Evaluation of Information Technology, Bath University, UK Qualitative Research in Information Systems, Jyväskylä, Finland Ali, Montaz The II International conference on Adaptive Computing in Engineering Design and Control 96, Plymouth, UK Brännback, Malin IFORS 96, 14th Triennial Conference, Vancouver, Canada Büchi, Martin Marktoberdorf Summer School, Germany Ding, Cunsheng Workshop on Fast Software Encryption, Cambridge, UK Austral Asian Conference on Information Security and Privacy, University of Wollongog, Australia Finne, Thomas Information Processing and Management of Uncertainty in Knowledge Based Systems, Malaga, Spain 53

58 EITC 96 & WG10, Bruxelles Grundy, Jim Symposium: Logic, Mathematics and Computer, Helsinki, Finland Hakonen, Harri 3rd South American Workshop on String Processing Recife, Brasilia Hedman, Eric Summer Scool on inspecting critical software, Tampere, Finland School on Embedded Systems, Veldhoven, Netherlands Hekanaho, Jukka 13th International Conference on Machine learning, Bari, Italy 2nd Nordic Workshop on Genetic Algorithms, Vaasa, Finland Heuberger, Philip Formal Methods Europe, FME 96, Oxford, UK Summer Scool on inspecting critical software, Tampere, Finland BRICS Autumn School in Verification, Århus, Denmark The 1st B Conference, Nantes, France Ilie, Lucian The 2nd ICML, Taragona, Spain Järvi, Antero Biomedical Signal Processing II, Tampere, Finland School on Embedded Systems, Koningshof, Netherlands Järvi, Jaakko School on Embedded Systems, Koningshof, Netherlands Koponen, Sami Mediterranean Workshop in Coding and Information Integrity, Palma de Mallorca, Spain Koskivaara, Eija 19th Annual Congress of the European Accounting Association 54

59 Laibinis, Linas BRICS Autumn School in Verification, Århus, Denmark 8th Nordic Workshop on Programming Theory, Oslo Leppänen, Ville Parallel Architectures, Algorithms and Networks ISPAN 96, Peking, China Liang, Jianming SOCO 96 / IIA 96, Reading, UK Biomedical Signal Processing I and II, Tampere Lipponen, Marjo 8th International Conference on Automata and Formal Languages, Salgótarján, Hungary Liu, Shuhua Advanced Intensive Course on Strategic Management of small and medium sized companies, Helsinki, Finland Design of Intelligent Multi-Agent Systems, Amsterdam, Netherlands Långbacka, Thomas The 96 International Conference on Theorem Proving in Higher Order Logics, Turku, Finland Malioukov, Alexander Summer Scool on inspecting critical software, Tampere, Finland School on Embedded Systems, Veldhoven, Netherlands Mihalache, Valeria The 2nd ICML, Taragona, Spain Mikhajlov, Leonid Summer School on inspecting critical software, Tampere, Finland School on Embedded Systems, Veldhoven, Netherlands 8th Nordic Workshop on Programming Theory, Oslo Näppi, Janne 55

60 Biomedical Signal Processing II, Tampere, Finland Pasanen, Tomi Algoritmitutkimuksen Päivä-seminaari, Joensuu, Finland Plandowski, Wojciech Mathematical Foundations of Computer Science, Cracow, Poland Rukšėnas, Rimvydas Marktoberdorf Summer School, Germany Summer Scool on inspecting critical software, Tampere, Finland School on Embedded Systems, Netherlands von Schoultz, Fredrick School on Embedded Systems, Netherlands Seceleanu, Tiberiu School on Embedded Systems, Netherlands Sekerinski, Emil Meeting of the IFIP Working Group 2.1 on Algorithmic Languages and Calculi Sosyura, Anna Marktoberdorf Summer School, Germany Summer School on inspecting critical software, Tampere, Finland 8th Nordic Workshop on Programming Theory, Oslo Torvinen, Vesa IRIS 19, The future, Göteborg, Sweden 3rd European conference on the evaluation of information technology, University of Bath, UK Troubitsyna, Elena Summer Scool on inspecting critical software, Tampere, Finland European Educational Forum School on Embedded Systems, Netherlands 56

61 8th Nordic Workshop on Programming Theory, Oslo Waldén, Marina Formal Methods Europe 96, Oxford, UK The 1st B Conference, Nantes, France Wilppu, Eva IRIS 19, The Future, Stockholm, Sweden 57

62 Turku Centre for Computer Science Lemminkäisenkatu 14 FIN Turku Finland University of Turku Department of Mathematical Sciences Åbo Akademi University Department of Computer Science Institute for Advanced Management Systems Research Turku School of Economics and Business Administration Institute of Information Systems Science