Historical overview.
In connection with the development of information technology and rapid
extension of the field of application the Chair of Mathematical Statistics
and Programming was established in 1969, in 1979 the Chair of Programming
(head J.Kiho) was separated. The Institute of Computer Science was
established as a result of the last restructuring of Tartu University on the
basis of the former Chair of Programming in 1993
The first head of the Institute was Jaanus Pöial, in 1994 Rein Prank took
over and in 1995 Professor Jüri Kiho was elected to lead the Institute. In
1997 Professor Mati Tombak was the leader, in 1998 Jüri Kiho and in 1999
Rein Prank resumed the post again. Since January 2000 the Head of the
Institute is Mare Koit.
The Institute of Computer Science is engaged in long-term cooperation with
the Chair of General Linguistics of the Faculty of Philosophy together with
which research in the field of language technology has been carried out. It
involves the ICS's staff members and PhD students M.Koit, T.Roosmaa,
K.Müürisep, H.Uibo and T.Puolakainen.
In 1997 Data Security Laboratory was established as a result of common
efforts of the ICS and Cybernetica AS. The latter is directing the
laboratory's research and development. Most of the researchers of the
laboratory are parallelly members of the ICS staff, PhD and MSc students:
A.Buldas, H.Lipmaa, J.Villemson, P.Laud, M.Roos, S.Heiberg, A.Seeba, U.Puus
In the present account
In the present account we include information about the above mentioned
research results produced by the ICS members.
The main fields of scientific research at the ICS are:
public key infrastructure, language technology, algebraic methods
on computer science, counting and decomposition of Boolean functions,
algorithmics, functional programming, compiler technology, sketchy
programming.
Structure of ICS
At the ICS there are two chairs: the Chair of Theoretical Computer Science (Professor Mati Tombak) and the Chair of Software Systems (Docent Jüri Kiho). When necessary conditions are created, it is also planned to open Chairs of Computer Science Didactics, Artifical Intelligence and Discrete Mathematics.
Academic staff
| Profession | Name | Qualific. | Post | Born |
| Docent, head of Inst. | Mare Koit | PhD | 1 | 1945 |
| Professor | Mati Tombak | PhD | 1 | 1942 |
| Docent | Ahto Buldas | PhD | 0.5 | 1967 |
| Docent | Jüri Kiho | PhD | 1 | 1941 |
| Docent | Rein Prank | PhD | 1 | 1949 |
| Docent | Jaanus Pöial | PhD | 1 | 1959 |
| Docent,Vice-Dean | Tiit Roosmaa | PhD | 1 | 1955 |
| Lecturer | Helger Lipmaa | PhD | 0.5 | 1972 |
| Lecturer | Kaili Müürisep | PhD | 1 | 1972 |
| Lecturer | Tõnu Tamme | MSc | 1 | 1958 |
| Lecturer | Heli Uibo | MSc | 0.5 | 1971 |
| Lecturer | Varmo Vene | PhD | 1 | 1968 |
| Lecturer | Anne Villems | MSc | 1 | 1945 |
| Lecturer | Jan Villemson | MSc | 0.5 | 1974 |
| Senior Researcher | Ain Isotamm | PhD | 1 | 1942 |
| Researcher | Olga Sokratova | MSc | 1 | 1971 |
| Researcher | Reimo Palm | MSc | 1 | 1973 |
| Professor Emeritus | Ülo Kaasik | PhD | 1926 |
Administrative staff
| Jaan Ehasalu | administrator of computer classrooms | 1946 |
| Ülle Holm | secretary | 1972 |
| Tiina Lasn | senior specialist of open university training | 1942 |
| Tiiu Tombak | chief administrator | 1943 |
Coordination and administration of research
Due to specifics of teaching, institute research has to cover as many different areas as possible in computer science. Therefore the research is organized by small teams which consist of one or more members of institute's academic staff and their doctorate and master students.
The language technology group is working in cooperation with the Chair of General Linguistics (Faculty of Philosophy). Participants from the ICS are Mare Koit, Tiit Roosmaa, Kaili Müürisep, Heli Uibo, Tiina Puolakainen.
The Laboratory of Data Security - a joint laboratory of Cybernetica AS and the University of Tartu. Research is coordinated by Cybernetica AS Participants from the ICS are Ahto Buldas, Helger Lipmaa (until 2000), Jan Villemson, Peeter Laud (until 1999), Meelis Roos, Sven Heiberg, Asko Seeba, Uuno Puus.
Computer aided teaching - Rein Prank, Tauno Õunapuu (until 1997), Eno Tõnisson, Anne Villems, Karin Ruul.
Sketchy modelling of structured data - Jüri Kiho, Mart Tudre, Roman Ustitsh.
Algebraic methods in Computer Science - Uno Kaljulaid (until 1999), Olga Sokratova, Tiina Zingel, Vassili Garkusha.
Functional programming - Varmo Vene, Härmel Nestra.
Computational complexity, algorithmics and combinatorics - Mati Tombak, Ain Isotamm, Tõnu Tamme, Olga Kislitsina, Reimo Palm, Albert Tumanov.
Compiler technology - Jaanus Pöial, Mati Tombak, Peeter Laud.
Funding
| Year | Targeted funding | Grants | Agreements connected with RD |
Funding of infrastructural costs * |
|||
| No | Sum total | No | Sum total | No | Sum total | Sum Total | |
| 1995 | 1 | 124,700 | 4 | 150,700 | 1 | 419,500 | 265,200 |
| 1996 | 1 | 141,200 | 3 | 122,700 | 1 | 319,300 | 163,900 |
| 1997 | 1 | 228,800 | 4 | 157,500 | 2 | 505,000 | 422,200 |
| 1998 | 1 | 280,000 | 5 | 280,000 | 4 | 529,300 | 337,200 |
| 1999 | 1 | 370,000 | 4 | 262,000 | 4 | 639,000 | 349,600 |
| 2000 | 1 | 352,000 | 2 | 128,000 | 4 | 161,700 | 31,400 |
* Infrastructure has been developed both by public educational funding and the TEMPUS project grants.
| Pre-reviewed articles | Including CC articles | Other publications | Single publications | Total | Abstracts | |
| In Estonia | Abroad | |||||
|
|
|
|
|
|
|
|
Plan of the development 2001 - 2005
Based on the Development Plan for 2001-2005 of the Faculty of Mathematics
(approved on 26 May 2000 by the Council of the Faculty of Mathematics)The first reading on 7 June 2000 by the general assembly of the ICS
The second reading on 7 December 2000Development plan working group: M.Tombak, J.Kiho, T.Roosmaa, V.Vene, M.Koit.
I. Introduction
1. The role of the institute of Computer Science in Estonia and
on an international scale.
In Estonia computer science has been recognized as one of the most important fields of activity for the state. The Institute of Computer Science at the University of Tartu is a leading centre of excellence in computer science responsible for research in computer science and corresponding academic instruction. The ICS educates information specialists for obtaining the Bachelor's, Master's and Doctoral degrees, applied information specialists (information technologists) at the Diploma level, also teachers of computer science at secondary schools. The ICS teaches computer science to students of other faculties at Tartu University. In the curriculum design the corresponding curricula of the Nordic and Western European universities have been taken as a basis. At present a new curriculum for the Master's Degree in the field of multimedia and teaching systems is being prepared (TEMPUS S_JEP-12418, 15.12.97-14.12.00). Internationally the institute has close scientific contacts with several universities in Germany, the Netherlands, Finland etc.
2. Strategic strengths and weaknesses
The ICS's strategic strength is expressed in the fact that it
belongs to the Faculty of Mathematics due to which students can
obtain a sound academic basis in mathematics allowing to teach
them demanding courses in computer science. The Open University
courses have been started with the purpose of giving school-teachers
two-year in-service training for obtaining the (additional) professional
qualification of a teacher of computer science at secondary school
(or also at basic school).
One of the the weaknesses of the ICS is a constant lack of teaching
staff. This is why some subjects are taught on a contract basis
and sometimes the lecturer has no proper teacher-training education/teaching
experience, motivation or communication skills. The number of
students admitted by the university has more than doubled but
public funding has not grown correspondingly.
The second problem is the drop-out of students. Already in the
second year of studies students have sufficient knowledge and
skills to find a job in companies for a decent salary; to combine
work and studies is a difficult task.
The third problem is the resultativiness of scientific research.
The fourth problem is insufficient material base (improper teaching
and research space, lecture-rooms, hardware and software, scientific
literature/teaching aids).
II. Principles and objectives of development.
3. At the University of Tartu the ICS has a leading role in
teaching computer science and coordinating research and development
in this field.
4. At the Bachelor level wide-scale theoretical mathematical
education is combined with applied knowledge to lay the sufficient
theoretical foundation for further studies in the chosen speciality,
on the one hand, and, on the other hand, to give young people
an opportunity to go to work after obtaining the Bachelor's Degree
or continuing Master studies in the same field or some other closely
related speciality.
5. At the Master level the aim of instruction is, firstly, the
continuation of fundamental education and, secondly, more flexible
adaptation to the changing needs of the society. Considering the
extension of Master studies and the need to raise the efficiency
of instruction, the standardized (obligatory) part of the curriculum
is enlarged.
6. The aim of PhD education is to give qualifications to specialists
of computer science who can do research work in the chosen field,
raising problems and solving them. The academic career is only
one (although the most important) of the possible options for
the people who have completed their PhD studies.
7. The ICS bears responsibility for the education content and
its level at Tartu University while teaching teachers and delivering
courses of computer science for use in the schools. The aim is
to reach the level of teaching at schools where every teacher
is able to use a computer in his or her class and know the corresponding
teaching software.
The computer science teachers should instruct their colleagues
and be specially educated for this purpose.
8. In the situation when computer science is taught in Estonian
schools by people who have no corresponding teaching qualifications
in the subject, the ICS will continue delivering courses for computer
science school teachers under the auspices of the Open University
constantly updating the content and scope of courses in conformity
with the developing needs. Mathematics teachers will receive further
training in the use of computers. In the future the ICS will develop
a constantly functioning system for requalification and further
education.
9. In the cooperation with the Distance Learning Centre of Tartu
University the ICS is at the head of introducing the application
of distance learning virtual instruction methods based on information
technology at the university. The ICS also supervises, in the
case of need, the teaching staff of other faculties and organises
corresponding courses. The distance learning environment is used
in conducting further education courses and teaching full-time
students at the university.
10. The utmost goal of the ICS is to be a scientific centre of
excellence paying more attention to the application of specialized
knowledge and skills of the teaching staff for the needs of the
Estonian society, to help solve problems in the country's economy
and scientific research. To achieve this aim, the ICS is constantly
looking for new cooperation partners and tightening the already
existing relations with all possible partners including businesses.
The ICS is looking for new opportunities to participate in international
projects.
11. The ICS's main goals of development for the coming five years
are:
1) To solve problems connected with the teaching and working space
by the construction of the new wing to 2, Liivi Street building
and completing the repair work in the old building.
2) Strengthening the ranks of the teaching and research staff,
and their raising the qualifications.
a) Further education in the speciality and the teaching methods.
b) Designing a system for constant upgrading of the hardware and
software at the disposal of the staff.
3) Guaranteeing high quality of instruction, better motivation
of students.
a) Carrying out a questionnaire of graduates to receive feedback.
b) A questionnaire of employers in Tartu and Tallinn.
c) Student projects with the help of business firms (after the
model practised at the Technological University of Helsinki).
d) Updating of curricula.
e) Installation of new study laboratories (multimedia, software
technology, systems administration).
4) Scientific literature, textbook, study aids.
a) Designing a system to guarantee access to study materials (either
textbooks or electronic aids).
b) Purchasing of new scientific literature, journals - making
common efforts with university library.
c) Updating the ICS's library stocks guaranteeing access through
the Internet (making accessible the solutions used in the BSc
theses on computer science issues in 1999 and 2000).
III. The structure of institute
12. Chairs: the Chair of Theoretical Computer Science (professor
M. Tombak) and the Chair of Software Systems (ass. prof. J. Kiho) have been
opened; until recently the Chairs of Artificial Intelligence,
Discrete Mathematics and Computer Science Didactics have not been
opened. The Chair of Computer Science Didactics will be renamed
the Chair of Educational Computer Science. A new Chair of Information
Technology will be established.
13. The computer classrooms subordinated to the ICS will be transferred
to the direct subordination of the Dean of the Faculty of Mathematics.
The new study laboratories (to be opened in the future) will be
subordinated to the ICS.
IV. Research and instruction
14. The ICS continues teaching its subjects in conformity
with the curriculum of computer sciences. In the academic year
2000/2001 (together with the Faculty of Physics and Chemistry)
the Diploma-level computer science course will be launched replacing
the present curriculum of applied computer science. In connection
with the probable transfer to the 3+2 year educational system,
preparations must be made for designing new curricula according
to which specialized education is provided to a greater extent
during Master studies.
15. The importance of interactive forms of instruction (practical
session, seminar, colloquium, project) is growing. To decrease
the students' drop-out, independent study must be motivated and
stimulated to a greater extent. New teaching methods making use
of information technology must be introduced (interactive courses,
simulation games, etc.).
16. At the Open University the courses for the teachers of computer
science will continue. Teachers of mathematics will receive subject
modular training how to use computers and specialized software
in the process of teaching. Teachers of the other subjects are
offered courses how to use teaching software in their fields.
A curriculum for obtaining the Applied Master's Degree by in-service
teachers will be adopted.
17. Further education courses in information technology will
be available at different levels using distance learning opportunities.
18. At all the courses the importance of distance learning methods
and environments will grow.
19. A system will be worked out for purchasing the latest software
for research and instruction purposes.
20. It is planned to send young talented people abroad to obtain
the PhD degree at foreign universities of high reputation, especially
in the applied fields (ERASMUS).
V. Students and the academic staff
21. The number of admittance of students to the Bachelor course
will remain the same. The admittance to the Diploma level course
in information technology will grow two times.
22. The system of the student project work will be launched.
23. The growth of the importance of Master studies is planned,
consequently the admittance of students must increase.
24. To safeguard the continuity of the teaching staff, the number
of posts for research workers is to be increased to employ PhD
students and the young doctors.
Assessment of working space, hardware. Working space.
The main working rooms of the institute are at 2, Liivi
Street. As the building needs major repairs for a long time, among
the basic hazards we should mention the amortized electric supply
system (which was not originally designed to feed the constantly
growing number of computers) and rotten window-frames (which makes
it impossible to open windows in many rooms to air them). The
computer classes which were opened in the former operation hall
are without heating. Also, in other rooms temperature is much
lower in winter than required. Ventilation is insufficient, especially
in the computer classes opened at 36, Lai Street and 46, Vanemuise
Street.
Conclusions: working conditions of the students and staff member
need rapid improvement. The start for the implementation of the
design of major repairs to 2, Liivi Street building and the construction
of an additional wing to the same building must be made in the
near future.
Basic hardware
1995
Two personal computers, a fax and a coping machine have been bought.
Two new computer classes have been installed and opened: the PC-class
(2, Liivi Street) and the Sun-working-station class (2, Liivi
Street, room 107). The latter was funded by a TEMPUS project.
Considerable assistance has been received from several TEMPUS
projects of the ICS to perfect hard-and software with new purchases.
1996
3 P5/120 computers,
Printer EPSON LX-300,
Notebook Compaq,
TEMPUS JEP 06145 funding:
96MB additional memory to 10 Sun Sparc worksations,
SUN SPARC5 workstations (5),
SUN SPARC classic/x,
Additional memory NVRAM,
Printer HP LJ4MP.
1997
Copying machine "Mita DC-3060" with additional equipment.
TEMPUS 07256-94 funding: Network Computer class with server, for
the teacher training class-server upgrade with Java workstations.
1998
1 computer class (Astro Optima Celeron)
1 computer class (Swedish humanitarian aid)
Philips Proscreen 4700
SuperStack II Switch 1100 24-port
SuperStack II Switch 1100 24-port
SuperStack II Switch 320
MS Office Pro 97
4 computers (Astro Optima 200)
5 computers (Astro Optima 200)
3 computers (Astro Optima 200)
WinNT 4.0 (25)
1999
10 computers (Pentium III 450 MHz, 128 Mb) for the ICS's public educational
funding.
Videoconferencing technology: a camera, a microphone, speakers,
video card funded by a TEMPUS project.
Multimedia hardware Adobe Premiere (10), Director, CorelDraw
(5), Adobe Photoshop(10), Macromedia Freehand (5) funded by a
TEMPUS project.
Videoconferencing system PictureTel 550 funded by a TEMPUS project.
Conclusions: The ICS has a basic equipment but upgrading of hardware and software does not take place in a sufficient speed. The computer network of Tartu University is not able to service satisfactorily the rapidly grown number of users and this is why the Internet-connection is very often slow.
The ICS library
The library of the Institute of Computer Science was founded
on the basis of the former library belonging to the Computing
Centre of Tartu University.
New acquisitions to the library include books bought by the ICS,
donated by individuals and other educational establishments (Finland,
Sweden, the USA) including the Centre of Computer Science of Estonian
Universities.
In the library there are textbooks, scientific journals and different
publications in Estonian, English, Russian, German, Finnish, etc.
There is a specialized fund containing diploma papers, candidate
and doctoral theses, term papers, Bachelor and Master theses,
PhD theses - all connected with the institute.
Mostly the publications are in one single copy. An exception
is a multiple copy Java Software Solutions: Foundations of Program
Design which was bought in connection with the opening of a new
speciality - applied computer science - in 1997 for the use by
students during the whole academic year.
The majority of books are shelved and can be read in the institute's
common room (2, Liivi Street, Room 209).
Data about books in conformity with the 1994 cataloguing are available
in the computer database which also contains data about loans.
A part of the books has been stored in the offices of the staff
members.
Each year funding of the library has decreased and the member
of new bought acquisitions is very small, but, however, donations
from scientific grants, projects and individual lectures have
alleviated the situation.
By readers earlier publications are used to the minimum degree
but the demand for new literature is considerable.
The library of the ICS contains about 400 theses and dipolma papers,
1,328 publications in Russian, 1159 units in other languages.
In the years 1995-1997 thanks to the Centre of Computer Sciences
of the Estonian Universities 53 extremely necessary books were
received, 7 books were bought for the money the TEMPUS-JEP-06145
project.
Financical account:
1995 4,658.55 EEK
1996 53,859.25 EEK
1997 62,359.59 EEK
1998 6,310.90 EEK
1999 16,527.80 EEK
2000 17,679.00 EEK
2. Basic research fields
Subject: Attributed models as tools for knowledge
representation
1995 - 1996
TUMTAT011SO
Project leader: Merik Meriste
Attributed automaton is a formalism for conceptual knowledge
specification using regular syntax with attributes representing
contextual relations as well as semantic properties of concepts.
Attributed automaton can be treated as a generalization of a finite
automaton with attributes and computational relations attached
to states and transitions respectively. In this project we developed
a new specification method for attributed automata based on functional
combinators. It has good compositional and algebraic properties
which allow systematic derivation of efficient implementations
from readable specifications of attributed automata using correctness
preserving transformations. Also, it is easily extendible to
cope transformational, interactive and other different kind of
attributed automata.
We have also investigated possible applications of attributed automata for modelling interactive systems. Continued a joint research with Turku University and Kuopio University to develeop medical signal processing software based on attributed models.
Funding: 141,200 EEK
Researchers:
Merik Meriste
Varmo Vene
Publications:
Koski A., Juhola M., Meriste M. Syntactic Recognition of ECG Signals by Attributed Finite Automata, Pattern Recognition, 28(12), 1995, pp. 1927-1940.
Meriste, M., Penjam, J. Attributed Models of Executable Specifications.
Research Report CS80/95, Institute of Cybernetics, Tallinn 1995,
28 p.
URL: file://greta.cs.ioc.ee/pub/CS_Reports/CS80_95.ps.Z (KT)
Meriste, M., Penjam, J. Attributed Models of Executable Specifications. In Proc. of PLILP'95, Lect.Notes. Comp. Sci., no. 982, Springer-Verlag, 1995, pp. 459-460 (AA).
Meriste, M., Vene, V. Attributed Automata and Language Recognizers.
Proc. 4th
Symposium on Programming Languages and Software Tools, Visegrad,
Hungary, June 9-10, 1995 pp. 114 -121.
Meriste, M., Penjam, J. et al. Knowledge Based Software Techniques.
Technical Report CS83/95, Dept. of Computer Science, Institute
of Cybernetics, Tallinn 1995, 45 p.
Uustalu T., Vene V. A Cube of Proof-systems for Intuitionistic
Predicate-logic.- In:. Abstracts of NWPT'96. Oslo, Dec. 3-5, 1996,
31 p.
Research fields 1.2 and 2.9
Subject: Computer Science Models and Techniques for Information
Technology
01.01.1997 - 31.12.2001
TMTAT0520
Leaders: J.Kiho, M.Tombak
Cooperation partners: The Tallinn Technical University, Institute of Cybernetics, Tallinn
Funding:
1997 - 228,800 EEK
1998 - 280,000 EEK
1999 - 370,000 EEK
2000 - 352,000 EEK
2001 applied for 600,000 EEK
Researchers:
| Ahto Buldas | - docent (starting from 2000) |
| Ain Isotamm | - senior researcher |
| Uno Kaljulaid | - docent (until 1999) |
| Mare Koit | - docent |
| Helger Lipmaa | - lecturer |
| Kaili Müürisep | - lecturer |
| Reimo Palm | - researcher, Phd student |
| Rein Prank | - docent |
| Jaanus Pöial | - docent |
| Tiit Roosmaa | - docent |
| Olga Sokratova | - researcher, PhD student |
| Tõnu Tamme | - lecturer |
| Heli Uibo | - lecturer, PhD student |
| Eero Vainikko | - lecturer (until 1999) |
| Varmo Vene | - lecturer |
| Anne Villems | - lecturer |
| Jan Villemson | - lecturer, PhD Student |
PhD.Students :
| Jelena Dubrovskaja, MSc | Karin Ruul, MSc |
| Olga Kislitsina, MSc | Indrek Sander, MSc |
| Peeter Laud, MSc | Aulis Sibola, MSc |
| Härmel Nestra, MSc | Tiina Zingel, MSc |
| Tiina Puolakainen, MSc | Albert Tumanov, MSc |
| Meelis Roos, MSc | Eno Tõnisson, MSc |
MSc.Students:
| Vassili Garkusha | Rene Prillop |
| Lev Gordon | Uuno Puus |
| Veljo Hagu | Margit Reinkubjas |
| Kaido Hallik | Riina Reinumägi |
| Kristo Heero | Rivo Roo |
| Sven Heiberg | Peep-Ain Saar |
| Andrei Ivanov | Asko Seeba |
| Andres Järviste | Merle Sibola |
| Kaarel Kaljurand | Jelena Zaitseva |
| Priit Karu | Mark Tehver |
| Gunnar Kudrjavets | Asko Tiidumaa |
| Maret Kullasaar | Taavi Tiisler |
| Gunnar Nellis | Mart Tudre |
| Evely Nurmsalu | Roman Ustitsh |
| Ahti Peder | Kaire Vahi |
Results: see 13
| Doctoral Theses: | 1999 - 1 |
| 2000 -2 |
| Master Theses: | 1997 - 3 |
| 1998 - 8 | |
| 1999 - 2 | |
| 2000 - 4 |
Publications
Palm V., Jalas A., Kiho J., Tenno T. A Computerized System
for Storage, Processing and Prognostication of Data with Orientation
Towards the Use of Correlation Equations., 1(104), 1997, pp. 111-133.
(OrganicReactivity, vol.31).
Jalas A., Kiho J., Palm V., Tenno T. Data Structure and Menu-Based
Access of the Rate and Equilibrium Constants of Heterolytic Organic
Reactions., 1(104), 1997, pp. 135-140. (Organic Reactivity, vol.31)
Nerbonne J., Karttunen L., Paskaleva E., Proszeky G., Roosmaa T. Reading more into Foreign Languages. Proceedings of the Fifth Conference on Applied Natural Language Processing. Washington, 1997, pp. 830-835.
Proszeky G., Roosmaa T. English for Estonians, Hungarians and Bulgarians. Language teaching and Nerbonne, L. Karttunen, E. Paskaleva, G. Proszeky, T. Roosmaa. Reading more into Foreign Language Technology conf. proc. Gröningen, 1997, 8p.
Bjørstad E., Dryja M., Vainikko E. Robust Additive Schwarz Methods on Unstructured Grids. Domain Decomposition in Science and Engineering. Proceedings from the 9th International Conference on Domain Decomposition Metods. Bergen:John Wiley & Sons, June 1996, 1997. 11 p.
Koit M. Implementing a dialog system.- Proc. of international conference on Computational Linguistics and its applications "Dialogue 97". Moscow, 1997. 12 p.
Kiho J., Brodski D., Podlipski A. Control Structure Transformations in the Program Multiviewer. Proc. 5-th Symposium on Programming Languages and Software Tools. Finland, Jyväskylä, June 7-8, 1997, pp. 61-71.
Sillitoe I., Tombak M., Isotamm A. On the representation of Boolean functions using compact look-up tables via parallel and variable overlapping schemes. Proceedings of the Fifth Symposium on Programming Languages and Software Tools. Finland, Jyväskylä, 1997, pp. 96-105.
Prank R., Õunapuu T. Intelligent Tutoring System for Proof Building Exercises. New Media and Telematic Technologies for Education in Eastern European Countries, (The Netherlands), Enschede: Twente University Press, pp. 371-376.
Pöial J. Validation of Stack Effects in Java Bytecode. Proceedings of the Fifth Symposium on Programming Languages and Software Tools. Finland, Jyväskylä, 1997, pp. 128 - 134.
Uustalu T., Vene V. A Cube of Proof Systems for the Intuitionistic Predicate m,n-logic (short conference version). Selected Papers 8th Nordic Workshop on Programming Theory, NWPT'96. Norway,Oslo, 4-6 Dec. 1996 (post-conference proceedings). University of Oslo, Dept. of Informatics, 1997, pp. 237-246. (Research Report 248).
Vene V., Uustalu T., Tõugu E. Logical Semantics of NUT Extended with Production Rules. Proceedings of the Fifth Symposium on Programming Languages and Software Tools. Jyväskylä, June 7-8, 1997, pp. 145-154.
Buldas A., Laud P., Lipmaa H., Villemson J. Time-Stamping with Binary Linking Schemes Advances in Cryptology - CRYPTO '98.- Lecture Notes in Computer Science. Springer-Verlag, 1998, pp. 486-501. (vol.1462).
Lipmaa H. IDEA: A Cipher For Multimedia Architectures? Proceedings of SAC '98, LNCS.
Prank R. Using Computers for Problem Solving Tests. International Conference on the Teaching of Mathematics. Greece, Samos: John Wiley & Sons, July 3-6, 1998, pp. 248-250. Inc. Publishers.
Vene V., Uustalu T. Functional Programming with Apomorphisms (Corecursion). Proceedings of the Estonian Academy of Sciences: Phys., Maths., 47(3):147-161, Sept. 1998. (Special Issue 9th Nordic Workshop on Programming Theory, NWPT'97, Tallinn, Estonia, 15-17 Oct.1997).
Kiho J. Quasi-structured programs. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica. Tomus XVII. 1998. Pp. 219-234.
Pöial J. Remarks on language extensibility. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica. Tomus XVII. 1998. Pp. 331-338.
Tombak M., Sillitoe I. On the superposition of Boolean functions. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica. Tomus XVII. 1998. Pp. 381-389.
Uustalu T., Vene V. "Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically". INFORMATICA, 10(1): 5-26, 1999.
Uustalu T., Vene V. "Mendler-Style Inductive Types, Categorically". Nordic Journal of Computing, 6(3):343-361, 1999.
Kiho J., Ustitch R., Tudre M. Designing Computer Texts with AMADEUS. In: J.Penjam (Ed.) Software Technology. Proceedings of the Fenno-Ugric Symposium FUSST'99. Technical Report CS 104/99. Institute of Cybernetics at Tallinn Technical University. Tallinn 1999. Pp. 151-162.
Müürisep K. Developing a Syntactic Analyser for Estonian. In: J.Penjam (Ed.) Software Technology. Proceedings of the Fenno-Ugric Symposium FUSST'99. Technical Report CS 104/99. Institute of Cybernetics at Tallinn Technical University. Tallinn 1999. Pp. 213-220.
Nirk T. The Splicing Languages of MH Systems. In: J.Penjam (Ed.) Software Technology. Proceedings of the Fenno-Ugric Symposium FUSST'99. Technical Report CS 104/99. Institute of Cybernetics at Tallinn Technical University. Tallinn 1999. Pp. 233-236.
Koit M. Trenirovka obshchenija s pomoshchju kompjutera: ob odnom primenenii modeli dialoga. - Proc. of Dialogue'2000. Ed. A.S. Narin'yani. Protvino, 2000. Vol. 2, pp. 182-188.
Koit M., Õim H. Developing a model of natural dialogue. - LREC2000. Secong International Conference on Language Resources and Evaluation. Workshop Proceedings: From Spoken Dialogue to Full Natural Interactive Dialogue - Theory, Empirical Analysis and Evaluation. Ed. L. Dybkjaer. Athens, 2000. Pp. 18-21.
Kahusk N., Kaljurand K., Koit M., Vider K. Kasutajaliides info hankimiseks elektroonilisest käsiraamatust: Zürichi ja Tartu ühisprojekt. - TÜ üldkeeleteaduse õppetooli toimetised 1:Arvutuslingvistikalt inimesele. Toim. T. Hennoste. Tartu, 2000, lk. 167-182.
Buldas A., Lipmaa H., Schoenmakers B. Optimally Efficient Accountable Time-Stamping;. In Yuliang Zheng and Hideki Imai, editors, Public Key Cryptography '2000, volume 1751 of Lecture Notes in Computer Science, pp. 293-305, Melbourne, Australia, 18--20 January 2000. Springer-Verlag.
Buldas A., Laud P., Lipmaa H., Accountable Certificate Management using Undeniable Attestations". To appear in 7th ACM Conference on Computer and Communication Security, 1-4 Nov 2000, Athens, Greece.
Freudenthal M., Heiberg S., Willemson J. Personal Security Environment on Palm PDA. To appear in Annual Computer Security Applications Conference, 11-15 Dec 2000, Sheraton New Orleans, Louisiana, USA.
Muischnek K., Müürisep K., Puolakainen T. Parsing of Estonian: Morphological Disambiguation and Determination of Syntactic Functions. Congressus Nonus Internationalis Fenno-Ugristarum Pars II, pp. 348-349. Tartu 2000.
Nestra H. Handling Substitution without Induction. Proceedings
of the ESSLLI-2000 Student Session, pages 178-188, C. Pilière
(editor), University of Birmingham, August 2000.
Prank R. Some Further Steps after the Computerisation of Predicate
Calculus. First International Congress on Tools for Teaching Logic.
Proceedings. University of Salamanca, 2000, pp. 131-136.
Sokratova O. The Mal'cev lemma and rewriting on semirings, accepted
to publications in Theoret. Comp. Sci.
Sokratova O. On semimodules over commutative, additively idempotent semirings, accepted to publications in Semigroup Forum.
Sokratova O., Kaljulaid U. W-rings and their flat representations, Contributions to General Algebra (2000) 377-390.
Kelarev A., Sokratova O. Syntactic semigroups and graph algebras, Bull. Australian Math. Soc. (2000) 471-477.
Kelarev A., Sokratova O. A class of semisimple automata, accepted to publications in Korean J. Comput. Appl. Math.
Uibo H. On Using the Two-Level Model as the Basis of Morphological Analysis and Synthesis of Estonian. In: NODALIDA'99. Proceedings from the 12th "Nordiske datalingvistikkdager". Trondheim, 9-10 December, 1999. Department of Linguistics, NTNU, 2000. Pp. 228-242.
Uustalu T., Vene V. Coding recursion a la Mendler (extended
abstract). In J. Jeuring, ed., Proceedings 2nd Workshop on Generic
Programming, WGP'2000, (Ponte de Lima, Portugal, 6 July 2000),
Tech. Report UU-CS-2000-19, Dept. of Computer Science, Utrecht
University, pp. 69-85, June 2000.
Uustalu T., Vene V. Least and greatest fixed-points in intuitionistic
natural deduction. Theoretical Computer Science, to appear (accepted
March 2000).
Application results: see 4 and 5
3. Overview of research
grants
1) ESF (Estonian Scientific Foundation) grant No 425
Methods of discrete mathematics and the application in computer
science
1995-1997
Leader: docent Uno Kaljulaid
Main implementers: Olga Sokratova, Tiina Nirk
85,000 EEK
The problem of a connection between the right ordering and the evolution in torsion-free groups is solved. The applicable construction of a wreath product for investigation of representations of torsion-free groups is introduced. The construction of a fiber product of automata is introduced and used. A connection between the freeness of matrix groups and the rationality of formal languages is established. Ore W-ring of fractions is developed further to general localization methods. Two immersion theorems are proven.
Publications:
1.U.Kaljulaid Revisiting wreath products, with applications to
representations and invariants. Kurosh Algebraic Conference'98.
Abstracts of Talks, Moscow University Press, 1998, pp. 64-65.
2.U. Kaljulaid. A problem concerning right ordered groups. Kourovka
Notebook, 14. edition, Novosibirsk, 1998.
1 MSc thesis defended (Tiina Nirk 1996)
2) ESF grant No 1718
Theory of Attributed Automata
1995-1996
Leader sen.researcher Merik Meriste
Main implementers: Varmo Vene, Mati Kilp, Jaan Penjam, Ahto Kalja,
Jaak Metsallik, Andrus Järg (Inst. of Cybern.)
133,400 EEK
Attributed automaton is a formalism for conceptual knowledge specification using regular syntax with attributes representing contextual relations as well as semantic properties of concepts. Attributed automaton can be treated as a generalization of a finite automaton with attributes and computational relations attached to states and transitions respectively. It has good compositional and algebraic properties and it is easily extendible to cope transformational, interactive and other different kind of attributed automata.
3) ESF grant No 1318
Composition of a logic book
1995-1997
Leader: Tõnu Tamme
Main implementers: Rein Prank, Tanel Tammet
50,000 EEK + Open Estonia Foundation - 35,000 EEK
Composition of a logic textbook for Estonian universities.
'Logic: from thinking to proving' (412 pp., in Estonian), published in 1997.
1 MSc thesis defended (Tõnu Tamme 1996)
4) ESF grant No. 1203
Counting Hierarchy and Complexity of Qantified Boolean Formulae
1994-1995
Leader: Mati Tombak
Main implementers: Helger Lipmaa, Olga Kislitsina
1995 40,000 EEK
A new algorithm for sounting solutions of propositional formulae, which is based on founding a nonintersecting cover of formulas points on hypercube has been developed. A method for investigating properties of Boolean functions has been developed.
Publications:
Ian P. W. Sillitoe, Mati Tombak, Ain Isotamm. On the Representation
of Boolean Functions using Compact Look-Up Tables via Parallel
and Variable Overlapping Schemes. Proceedings of the Fifth Symposium
on Programming Languages and Software Tools, University of Helsinki,
Finland, 1997, pp. 96-105.
3 MSc theses defended (Helger Lipmaa 1995, Olga Kislitsina 1996, Ivo Mehide 1996).
5) ETF grant nr. 2981
Research and Studies in the Field of Cryptology
1997-1998
Leader: PhD student Helger Lipmaa
Main implementers: Ahto Buldas (Inst of Cybern.), Reimo Palm,
Jan Villemson
25,000 EEK
In cooperation with Cybernetica AS public key infrastructure problems, especially the problem of time-stamping, are investigated
Publications:
H Lipmaa, Security in On-Line Governance. Survey prepared under
UNESCO project "Developing Telematics and Information Networks
for On-Line Governance", June 1999
1 MSc thesis (Meelis Roos 1999) and 1 PhD thesis (Helger Lipmaa
1999) are defended
6) ETF grant nr. 2976
Mathematics of program construction
1997-1999
Leaders: 1997 sen. res. Merik Meriste, 1998-1999 res. Varmo Vene
Main implementers: Tarmo Uustalu (KTH, Stockholm), Härmel
Nestra.
230,000 EEK
An alternative semantic of inductive and coinductive types proposed which is based on Mendler-style algebras. The approach generalizes the classical semantics in the sense that both theories are equivalent when base functor is covariant, but it also allows to describe (co)inductive types with mixed variant base in a way which does not require the carriers of initial algebras and terminal coalgebras to be isomorphic..
Publications:
T.Uustalu, V.Vene.
A cube of proof systems for the intuitionistic predicate m,n-logic. In M Haveraaen and O Owe, eds, Selected Papers 8th Nordic
Workshop on Programming Theory, NPWT'96, Oslo, Norway, 4-6 Dec
1996, Research Report 248, Dept of Informatics, University of Oslo,
pp. 237-246. May 1997.
T.Uustalu, V.Vene. Mendler-style inductive types, categorically.Nordic Journal of Computing, 6(3):343-361, 1999.
T.Uustalu, V.Vene.
Primitive (co)recursion and course-of-value (co)iteration, categorically.
INFORMATICA, 10(1):5-26, 1999.
T.Uustalu V.Vene. Least and greatest fixedpoints in intuitionistic natural deduction. Theoretical Computer Science, to appear (accepted March 2000).
T.Uustalu V.Vene.
Coding recursion a la Mendler (extended abstract). In J Jeuring,
ed, Proceedings 2nd Workshop on Generic Programming, WGP'2000,
Ponte de Lima, Portugal, 6 July 2000, Tech Report UU-CS-2000-19,
Dept of Computer Science, Utrecht University, pp. 69-85. June 2000.
V.Vene. Categorical Programming with Inductive and Coinductive Types. PhD thesis (Diss Math Univ Tartuensis 23), Dept of Computer Science, University of Tartu, August 2000.
V.Vene, T.Uustalu.
Functional programming with apomorphisms (corecursion). Proceedings
of the Estonian Academy of Sciences: Physics, Mathematics, 47(3):147-161,
1998.
1 MSc thesis (Härmel Nestra 1998) and 1 PhD thesis (Varmo Vene 2000) are defended
7) ESF grant No 3056
Theoretical and constructive research in complexity theory.
1997-2000
Leader: Mati Tombak
Main implementers: Ain Isotamm, Tõnu Tamme, Reimo Palm,
Olga Kislitsina, Albert Tumanov
1997: 45,000 EEK
1998: 60,000 EEK
1999: 70,000 EEK
2000: 70,000 EEK
A method for describing properties of Boolean functions by families of propositional formulae has been applied to various properties. Davis-Putnam type backtracking algorithms for counting solutions have been investigated and applied for combinatorial counting problems.
Publications:
1. M.Tombak, A.Isotamm, I. Sillitoe. On the representation of
Boolean functions using compact look-up tables via parallel and
variable overlapping schemes. Proceedings of the Fifth Symposium
on Programming Languages and Software Tools, Jyväskylä,
Finland, 1997, pp. 96-105.
2. Sillitoe I. P. W., Tombak M. A compact look-up table structure
for low level binary image processing. Journal of Real-Time Imaging.Vol
4 No 3 Jun 1998, pp. 203-210.
3. M.Tombak, I.Sillitoe. On the superposition of Boolean functions.
Annales Universitatis Scientiarum Budapestinensis de Rolando
Eötvös Nominatae. Sectio Computatorica. Tomus XVII. 1998. Pp. 381-389.
4. T.Nirk. The Splicing Languages of MH Systems. In: J.Penjam
(Ed.) Software Technology. Proceedings of the Fenno-Ugric Symposium
FUSST'99. Technical Report CS 104/99. Institute of Cybernetics
at Tallinn Technical University. Tallinn 1999. Pp. 233-236.
1 MSc thesis defended (Albert Tumanov 1998)
8) ESF grant No 3343
Development of a Program Multiviewer
1998-1999
Leader: Jüri Kiho
Main implementers: Asko Oja (SUPPRO AS), Dmitri Brodski, Maksim
Larjushkin, Aleksei Podlipski, Roman Ustich, Mart Tudre, Margus
Sutt, Jaanus Kiipli.
94,000 EEK
Develop a program editor of a new kind, which enables to handle
textual source programs as well as their graphical representations
(sketchy programs) in an integrated environment.
A general model for computer texts elaborated. Corresponding
Java-based system (Amadeus) developed.
Publications:
9) ESF grant No 3276
Description of stack based languages using systems of syntactic
equations.
1998
Leader: Jaanus Pöial
40,000 EEK
J. Pöial, Alternative Syntactic Methods for Defining Stack
Based Languages, Proc. NWPER'98 Nordic Workshop on Programming
Environment Research, University of Bergen, Informatics report
No. 152, June 1998, pp. 227 - 232.
Traditional formal methods of syntax description for programming languages (e.g. context free grammars) are not always convenient for practical applications. In some cases the language has quite weak syntactic structure and it is better to describe the correct programs using semantics of operations instead. There exists a class of widespread languages in practice that use stack machines for interpretation of programs, the so called stack based languages (Java virtual machine language Forth, Postscript, etc.). Semantics of stack operations determines the language of correct programs in sense of parameter passing through the stack. This is one alternative method to define the syntax of a stack based language. The main question is whether there exists a better way of defining the same language.
In this grant we investigate systems of syntactic equations (general rewriting rules) on sequences of stack operations. Stack operations have a certain effect on the stack that can be described using input and output parameters. Stack effect calculus allows to define the language of correct sequences of stack operations (programs). It is important to know under which conditions the system of syntactic equations and the set of stack effects define the same language, because both methods seem to work better for stack based languages than context free grammars.
10) ESF grant No 3314
A Formal Grammar of the Estonian Language
1998-2000
Leader: Tiit Roosmaa
Main implementers: Mare Koit, Kaili Müürisep, Tiina
Puolakainen, Heli Uibo, Kadri Muischnek (Faculty of Philosophy).
176,000 EEK.
To construct a constraint grammar for the Estonian language and a syntactic analyser based on it, i.e. computer program which, together with the morphological analyser, should enable us to fully automatise the analysis of Estonian texts.
The first syntactic parser for the Estonian language has been
developed. We have gained the recall 99.2% and precision 89.6%
by error-free (morphologically unambiguous) input and the recall
96.4% and precision 78.1% by automatically morphologically analysed
input.
Practical applications: noun phrase extractor and automatic summariser
for Estonian, the helpful tool for translators.
Publications:
1. T. Puolakainen. Morphological Disambiguation of Estonian using
Constraint Grammar. Proc. of Dialog'98, Moscow, 1998, 626-635.
2. K. Müürisep. Syntactic Analysis of Estonian using
Constraint Grammar. Proc. of Dialog'98, Moscow, 1998, pp. 619-625.
3. T. Hennoste, M. Koit, T. Roosmaa, M. Saluveer. Structure and
Usage of the Tartu University Corpus of Written Estonian. International
Journal of Corpus Linguistics. Amsterdam, John Benjamins Publishing
Co., 3(2), 1998, pp. 279-304.
4. K. Müürisep. Determination of Syntactic Functions
in Estonian Constraint Grammar. Proc. Of EACL'99. Bergen, 1999,
pp. 291-292.
5. K. Müürisep. Developing a Syntactic Analyser for
Estonian. Jaan Penjam (ed.). Proc. Of the Fenno-Ugric Symposium
FUSST'99. Technical Report CS 104/99. Institute of Cybernetics
at Tallinn Technical University. Tallinn, 1999, pp. 213-220.
1 MSc thesis (Heli Uibo 1999) and 1 PhD thesis (Kaili Müürisep 2000) are defended.
4. Results of application
Syntactic analyser for Estonian
Estonian Informatics Centre
Tiit Roosmaa, Mare Koit, Kaili Müürisep, Tiina Puolakainen,
Heli Uibo, Kadri Muischnek (Faculty of Philosophy).
Goal: To implement the experimental version of the syntactic
analyser of Estonian.
Results: The syntactic analyser of Estonian has been tested
on legal texts.
Practical application: The Estonian Translation and Legislative
Support Centre can use a program as the helpful tool for translators.
Noun Phrase Extractor for Estonian
Estonian Informatics Centre, contract 916/2404/R2-2
Mare Koit, Tiit Roosmaa, Kaili Müürisep, Tiina Puolakainen,
Heli Uibo, Kadri Muischnek (Faculty of Philosophy).
Goal: To implement the noun phrase extractor for Estonian
- the computer program running on the OS Windows the input of
which is an arbitrary text in Estonian and the output of which
are all noun phrases found in the text.
Results: The noun phrase extractor has been successfully
tested on newspaper and legal texts.
Practical application: The Estonian Translation and Legislative
Support Centre can use a program as the helpful tool for translators.
Testing corpus for automatic analysis of Estonian
Estonian Informatics Centre, contract 915/2404/R2-2
Tiit Roosmaa, Mare Koit, Kaili Müürisep, Tiina Puolakainen,
Heli Uibo, Kadri Muischnek (Faculty of Philosophy).
Goal: To compile the corpus for testing of the syntactic
parser by hand-annotating the texts from various text types (newspapers,
fiction, laws).
Results: The testing corpus has been compiled consisting
of 23,000 words, including 10,000 words of newspaper texts, 6,500
words of fiction and 6,000 words of legal texts.
Practial application: The corpus has been used for testing
the syntactic parser of Estonian, written by Kaili Müürisep.
Public key infrastructure
Ahto Buldas, Helger Lipmaa, Jan Villemson, Peeter Laud, Meelis
Roos, Sven Heiberg.
As in December 2000 the Estonia law of digital signatures will
be applied, the
Cybernetica AS researchers have been deeply involved in the research
of public key infrastructures, long-term digital signature validation,
time-stamping and notary protocols. Recent developments also include
considering the issues of secret key management, personal security
environments and security problems of mobile communication platforms.
As a result of the innovative research done in Cybernetica AS,
the company has built a time-stamping server and a notary server.
The latter is currently being tested and will be applied as the
main technology component for Estonian public key infrastructure
enabling long-term validation of digital signatures. Cybernetica AS
researchers are also active in the international standardization
process making their innovative solutions available worldwide.
Software for Learning Mathematical Logic
Rein Prank, Tauno Õunapuu
a) Finding ways for better teaching of Predicate Logic,
b) new software package implemented for the exercises on quantifiers,
c) experimental use with the students.
Test Administration Systems
Rein Prank
a) Investigating the possibilities of subject-oriented question
types,
b) Proposals on new question types with complex form of the answer,
c) New types implemented in package APSTEST2.
Sketchy representation of structured data
Jüri Kiho
Originated from previous theoretical and experimental work in
the field, a new project ( AmadeusJ) was launched in 1998. It
aims to develop an integrated environment for handling sketchy
texts, i.e. computer texts modeled in accord with the sketchy
text model. Both multi-view and multi-base features are supported:
graphical views as well as base languages are considered as variable
attributes assigned to certain parts of text structures. The system
is open, allowing easily to add new views and base languages.
The main, summarizing publication: J.Kiho. SKM. Sketchy Modelling
of Computer Texts. Research Report. University of Tartu. Institute
of Computer Science. Tartu, 2000, 64 p.
c) application:
Currently, the system is directly used in the teaching process
as well as an aid for preparing algorithm-related study materials.
Molecular graph handling
Jüri Kiho
Development of a computerized system for the storage, processing
and prognostication of data with orientation toward the use of
correlation equations.
Decomposition of Boolean functions
Mati Tombak, Ain Isotamm.
Using results of theoretical research, done by Mati Tombak in
cooperation with Ian P. W. Sillitoe (University of Borås, Sweden)
a program for testing decomposability of arbitrary Boolean function
has been implemented by a given scheme. The test was applied for
research on morphological image processing by Ian Sillitoe.
Counting solutions of propositional formulae
Mati Tombak, Ain Isotamm, Tõnu Tamme, Albert Tumanov, Ahti
Peder.
Various algorithms and backracking strategies for counting solutions
have been investigated, implemented and tested. These programs
can be used for combinatorial counting of various mathematical
objects which have a description by families of propositional
formulae. The program is especially useful for hard combinatorial
counting problems for which no closed formula is known.
5. Development
Theoretical research on the approximation of NP-complete problems
has been applied for planning of the accounting of population
and for the server of logistics of the company "Regio".
The first problem: given a map of the town with an estimated number
of habitants for every house. Needed to divide the city into compact
regions with 302-368 habitants. The second problem is the Travelling
Salesman Problem with a lot of additional constraints. Both problems
are NP-complete and therefore not solvable exactly within the
real time limit. The approximation algorithms for these tasks
allowed to use the programs for solving real tasks in interactive
mode have been designed.
(M. Tombak, A. Isotamm)
The new software package implemented for the course Elements
of Mathematical Logic:
Exercises in Model Theory of Predicate Logic.
Exercise types:
1) finding the truth-value of the given formula in the given model,
2) building the model satisfying the given formulas.
For the first time the package is used in the spring term of 2000.
(R.Prank, T.Linnas)
Test Administration Systems APSTEST2 has been implemented.
(R. Prank, T.Kelder, A.Nigul)
6. Brief overview of research and development
1995
Events
1) "International Conference on Distributed Platforms",
Dresden 1996, member of program committee prof. J.Kiho.
2) 4th Symposium on Programming Languages and Software Tools 8-14 June 1995, Visegrad, Hungary, member of program committee prof. M.Tombak, docent J.Pöial
3) Workshop on General Principles of Informatics Curricula. 21 January 1995, Tartu, Estonia, member of organising committee docent J. Pöial.
4) Workshop on General Principles of informatics Curricula. 21 January 1995, Tartu, Estonia, member of organising committee prof. M.Tombak.
1996
Prizes
1) International Pupils´ Informatics Olympiad IOI'96 Hungary,
1 silver and 2 bronze medals. (Team supervisor docent R.Prank).
2) J.Villemson - a prize from the University of Münster for an excellent BSc thesis which will be developed into a MSc thesis.
Events
1) Seminar for students of theoretical and computer linguistics
with 20 students from the Universities of Tartu and Zurich
participating.
2) 4th corpus day (computer linguistics seminar at Tartu University), 30 participants.
3) International winter school - „New trends in computer science and information technology", 3-8 March at Pühajärve, 25 participants.
4) Seminar "Graduate Schools - Current State, Experience
and Problems" 10-12 January, 1996 in Tartu, 30 participants.
5) Seminar "Graduate Schools - Management, Financing and
PR"
6-7 June 1996 in Tartu, 25 participants.
6) Telemaatika '97 - Internet in Estonian schools, 170 participants.
7) Web for School Tartu workshop, 49 participants.
1997
Events
1) Centre of Computer Science of the Estonian Universities winter
school "New trends in computer science" 6-7 March in
Palmse, M.Tombak was one of the organisers.
2) 2nd Swiss-Estonian seminar for students of theoretical and computer linguistics, 21-30 June. Switzerland (Zurich); organiser M.Koit.
3) 5th corpus day "Language technology and the Estonian language" 4 December, in Tartu - organisers M.Koit and T.Roosmaa.
1998
Prizes
1) P.Laud - Estonian Science Foundation prize for successful scientific
research
2) H.Lipmaa - Estonian Science Foundation prize for successful
scientific research
3) J.Villemson - Estonian Science Foundation prize for successful
scientific research
Events
1) 14-15 December. Language technology conference (together with
Chair of General Linguistics).
2) 23 Aug. - 5 Sept. International Summer School "Formal grammars and their applications"(together with Chair of General Linguistics).
3) 1-5 March 3rd winter school of the Centre of the Computer Science of Estonian Universities in Palmse (together with the Institute of Cybernetics).
4) Mathematics teaching software seminar for schoolteachers and students, September-December (R.Prank, E.Tõnisson).
5) Further education for school directors of Southern Estonia, Otepää, November 1998 (A.Villems).
6) Adult education day, November 1998, "Contemporary educational environment" (A.Villems).
7) Baltic-Nordic Teacher Training using ICT in language learning, Lohusalu, October 1998 (A.Villems).
1999
European Scools Project annual conference, March 1999, 105 participants
from 17 countries (member of organising committee A.Villems).
2000
ISAGA 2000 - International Simulation and Gaming Association 31
annual meeting in Tartu, 1-7 July (member of organising committee
A.Villems).
7. Cooperation partners in other Estonian universities and
research institutions.
1995
1) Software Department of the Institute of Cybernetics in Tallinn
- U.Kaljulaid
1996
1) Institute of Estonian Language in Tallinn (language technology)
- M.Koit, T.Roosmaa.
2) Software Department of the Institute of Cybernetics (common
research in the field of attribute models methodology and implementation)
- U.Kaljulaid, M.Meriste.
3) The Institute of Computer Science at the Tallinn Technical
University (L.Võhandu, R.Kuusik) in the theory of complexity
(M.Tombak).
4) The Tallinn Technical University (H.Rohtla) and the Tallinn
Pedagogical University (P.Normak) in the framework of TEMPUS
07256 (A.Villems).
1997
1) An agreement of cooperation was concluded (1997-2000) with
Cybernetica AS as a result of which a common laboratory was
established for Data Security Research (Tartu University and Cybernetica
AS).
2) Cooperation between Tartu University and the Tallinn Technical
University and the Institute of Cybernetics (intermediator - the
Centre of Computer Science of Estonian Universities). The cooperation
result - Winter School for degree students at Palmse.
3) The Department of Software at the Institute of Cybernetics
in Tallinn (J.Penjam) - U.Kaljulaid.
4) The Tallinn Technical University: TEMPUS CME 2078-96 "Quality
Assurance System for Informatics Education" - J.Kiho.
5) The Institute of the Estonian Language - in the framework of
the agreement with the Estonian Informatics Centre "Syntax
analyser of the Estonian language". - M.Koit, T.Roosmaa.
6) Cybernetica AS. A technical account has been completed: "Protocols
of time-stamp security demands and technical specifications".
P.Laud, J.Villemson.
Since November 1996 until 2000 H.Lipmaa has been working as a researcher
at Cybernetica AS and his responsibility was to promote, analyse and launch
the research of cryptography and data protection.
7) Tiger Leap Foundation (A.Villems as an expert).
1998
1) Software Department of the Institute of Cybernetics in Tallinn
(U.Kaljulaid).
2) The Tallinn Technical University: TEMPUS CME 2078-96 "Quality
Assurance System for Informatics Education" (J.Kiho).
3) The Institute of the Estonian Language - in the framework
of the agreement with the Estonian Informatics Centre "Syntax
analyser of the Estonian language" (M.Koit, T.Roosmaa).
4) Cybernetica AS: the projects of the Data Security Laboratory
involve 3 PhD students, 1 MSc student and 12 BSc students in the
speciality of computer science of the ICS.
5) Tiger Leap Foundation (A.Villems as an expert).
6) Cooperation between Tartu University and the Tallinn Technical
University and the Institute of Cybernetics (intermediator - the
Centre of Computer Science of Estonian Universities). The cooperation
result - Winter School for degree students at Palmse.
1999
1) The Tallinn Technical University, the Tallinn Pedagogical
University and the Estonian Academy of Arts in the framework of
TEMPUS S_JEP-12418 project.
2) Cybernetica AS, Data Security Laboratory.
3) The Institute of the Estonian Language in the framework of
the agreement of the Estonian Informatics Centre: "The test
corpus of the Estonian language", "The filter of noun
phrases" (M.Koit, T.Roosmaa, H.Uibo).
4) Cooperation between Tartu University and the Tallinn Technical
University and the Institute of Cybernetics (intermediator - the
Centre of Computer Science of Estonian Universities). The cooperation
result - Winter School for degree students at Palmse.
2000
1) The Tallinn Technical University, the Tallinn Pedagogical
University and the Estonian Academy of Arts in the framework of
TEMPUS S_JEP-12418 project.
2) Cooperation between Tartu University and the Tallinn Technical
University and the Institute of Cybernetics (intermediator - the
Centre of Computer Science of Estonian Universities). The cooperation
result - Winter School for degree students at Palmse.
3) Cybernetica AS, Data Security Laboratory.
4) The Institute of the Estonian Language and the Institute of
Cybernetics at the Tallinn Technical University (language
technology)- M.Koit, T.Roosmaa, K.Müürisep, H.Uibo.
8. Participation in international research
and development (cooperation) projects
| Project title | Co-op partners | Source of funding | Grant sum |
|
COPERNICUS project No #343 GLOSSER 1.04.95-31.03.97 |
Bulgarian Academy of Sciences, Institute of Mathematics;
Morphologics, Inc. (Budapest); Rank Xerox (Grenoble, France); Groningen University (the Netherlands); The Institute of the Estonian Language |
EU | 72,000 ECU |
|
Docent J.Pöial
TEMPUS CME-01011 - A Graduate School in CS & IT in Estonia.
|
University of Turku, Tampere Technical University, the Computer Science Centre of the Estonian Universitites EU |
EU |
90,000 ECU |
|
Lecturer A.Villems TEMPUS JEP 07256-94 project "IT in Teacher Education"
(1994-1997). |
University of Barcelona,
|
EU |
Budget (TU) 126,534 ECU (Equipment, mobility, staffing) |
|
M.Meriste, J.Pöial TEMPUS Project S_JEP06145: "IT & CS Education Development Center for Estonian Universities" Duration: 1993-1996. |
Tallinn Technical University, Institute of Cybernetics of EAS, University of Århus, Universität des Saarlandes, University of Nice-Sophia Antipolis, Eindhoven University of Technology | EU | Sum total 89,000 ECU |
|
J. Kiho TEMPUS CME 02078-96 Quality Assurance System for Estonian Higher Education in Computing Related Fields. Duration: 16.09.95 - 15.09.98. |
University of Aarhus (contractor), the Tallinn Technical University (coordinator), London City University, the Technical University Dresden, University of Nice, University of Rostock | EU | Sum total 61,260 ECU |
|
E.Vainikko ESPRIT IV Project No. 20160 PARASOL - An Integrated Programming Environment for Parallel Sparse Matrix Solvers. Participation through the University of Bergen 1 January 96 - 31 December 98. |
CERFACS, GMD-SCAI, ONERA, RAL, University of Bergen (France,
England, Germany, Norway |
- | |
|
TEMPUS S_JEP-12418-97 Contact person at Tartu University: ass. prof. Rein Prank 15 Dec 1997 - 14 Dec 2000 |
Contractor the Tampere Technical University (prof. Hannu Jaakkola) Estonian coordinator: the Tallinn Pedagogical University (prof. Peeter Normak) |
Total scope: 286,100 ECU First year to Tartu University 8,000 ECU hardware and software, 10,000 ECU foreign business trips. 2nd year to Tartu University 8,500 ECU hardware and software, 9,600 ECU foreign business trips. 3rd year to Tartu University 8,000 ECU hardware and software, 10,000 ECU foreign business trips. |
|
|
M. Koit VMTAT07299 Answer extraction from electronic documents in linguistics based information retrieval November 1999 - October 2001 |
University of Zurich |
University of Zurich, Gebert-Rüf- Stiftung |
104,691 CHF |
|
H.Lipmaa Phare HESR; time stamp project, (Cybernetica AS). |
PHARE | 250,000 EEK |
1995
Master Theses
H.Lipmaa (1972) Theoretical Computer Science (Th) Survey on
the communication complexity. Supervisor M.Tombak.
I.Sander (1971) Software Systems (Ss) Developing Information
Systems in Client/Server Environment. Supervisor K.Ääremaa.
1996
Master Theses
O. Kislitsina (1972) Th. Examples of Complete Problems for
Complexity Classes NP and D^P". Supervisor M.Tombak.
I. Mehide (1970) Th. Using genetic algorithms to solve
satisfiability problems. (Jun 25) Supervisor M.Tombak.
K. Müürisep (1972) Th. Constraint Grammar Parser
for Estonian. Supervisor M.Koit.
T. Nirk (1972) Th. Languages and their Spectra. Supervisor
U.Kaljulaid
.
T. Puolakainen (1973) Th. Morphologic Disambiguation of
Estonian using Constraint Grammar. (Jun 25) Supervisor M.Koit.
V. Soo (1959) Ss. " Network Technology": Lecture
Notes.
T. Tamme (1958) Th. Logic book. Part I. Classical logic.
A.Villems (1945) Ss. "Databases Relational Model":
Lecture Notes.
Doctoral Thesis
S.Tupailo Th. Hilbert's Epsilon-Symbol in Predicative Subsystems
of Analysis. Supervisor prof. G.Mints (Stanford University).
1997
Master Theses
A.Kelder (1973) Ss. Object-Oriented Interface for Relational
DBMS. (Jun 11) Supervisor H.-M. Haav.
V.Leping (1952) Ss. Lecture Course in Informatics for Economical
Faculty. (March 25) Suprvisor A.Isotamm.
R.Vaarandi (1972) Ss. Distributed file systems. (Jan 10)
Supervisor V.Soo.
Doctoral Thesis
E.Vainikko (1963) Ss. Robust Additive Schwarz Methods - Parallel
Implementations and Applications. (March) Supervisor P.E.Bjørstad
(Norra).
1998
Master Theses
T.Avaste Ss. Distributed database management methods. (Jun
10) Supervisor A.Villems.
I.Bossenko (1973) Ss. Writing Application with Multiple
RDBMS support. (March 12) Supervisor I.Haamer.
A.Laksberg Th. On the Complexity of Grammatical Inference
Models. (Jun 11) Supervisor T.Tamme.
P.Laud (1977) Th. Generalized Context - Free Grammars.
(Jun 12) Supervisor U.Kaljulaid.
E.Leego (1972) Th. WWW as a System of Real Hypermedia. (Jun 19)
Supervisor M.Tombak.
H.Nestra (1974) Th. Polytypic functional programming: from
catecorical groundwork to practice. (Jun 11) Supervisor V.Vene.
A.Tumanov (1975) Th. Counting of Quarto Draws. (Jun 19)
Supervisor M.Tombak.
J.Villemson (1974) Th. Cube graphs and their generalizations
as vertex-transitive permutation graphs. (Jun 12) Supervisor U.Kaljulaid.
1999
Master Theses
Meelis Roos (1975) Th. Integrating Time-Stamping and Notarization.
(Jun 06) Supervisor H. Lipmaa.
Heli Uibo (1971) Ss. The Analysis and Generation of Estonian
Word-Forms Using the Two-Level Morphology Model. (Jun 11) Supervisor
T.Roosmaa.
Doctoral Theses
H.Lipmaa (1972) Th. Secure and Efficient Time-Stamping Systems.
(Jun 30) Supervisor M.Tombak.
2000
Master Theses
Jelena Dubrovskaja (1977) Ss. Computer Aided Teaching of Estonian
as a Foreign Language. (Jun 30) Supervisor M. Koit.
Aulis Sibola (1975) Ss. Web Infosystems. (Jun 19) Supervisor
J.Pöial.
Tiina Tamme (1962) Ss. The Electronic Document Exchange:
Standards and Problems. (Jun 19) Supervisor J.Pöial.
Karin Ruul (1974) Ss. Testing in Sample of Distance Learning
Course of "Introduction to Spreadsheet". (Jun 19) Supervisor
A.Villems.
Doctoral Theses
Varmo Vene (1968) Th. Categorical Programming with Inductive
and Coinductive Types. (Sept 03) Supervisor M.Meriste.
Kaili Müürisep (1972) Th. Computer Grammar of
Estonian: Syntax. (Sept 03) Supervisor M. Koit.
PhD Students
Jelena Dubrovskaja (1977) Th. Computer Assisted Estonian
Language Learning. Supervisor R.Prank.
Olga Kislitsina (1972) Th. Combinatorics of Boolean Functions.
Supervisor M.Tombak.
Peeter Laud (1977) Th. Diagnostics of Compilers. Supervisor
R.Wilhelm.
Härmel Nestra (1974) Th. Type theory. Supervisor V.Vene.
Reimo Palm (1973) Th. Quantum Computing. Supervisor M.Tombak.
Tiina Puolakainen (1973) Th. Formal grammar of Estonian:
morphological disambiguation. Supervisor M.Koit.
Meelis Roos (1975) Th. Security of digital documents. Supervisor
H.Lipmaa.
Karin Ruul (1974) Ss. Distance Learning, Testing, Electronic
Performance Support System (EPSS). Supervisor J.Pöial.
Indrek Sander (1971) Ss. Field: Information system process
model. Supervisor J.Kiho.
Aulis Sibola (1975) Ss. Databases and Their Web Interfaces.
Supervisor J.Pöial.
Tiina Zingel (1972) Th. MH systems. Supervisor M.Tombak.
Albert Tumanov(1975) Th. Counting Algorithms. Supervisor
M.Tombak.
Eno Tõnisson (1969) Ss. Use of computer algebra
systems in teaching and learning mathematics. Supervisor R.Prank.
Heli Uibo (1971) Ss. Two-Level Morphology Model: Application
to the Estonian Language. Supervisor T.Roosmaa.
Jan Villemson (1974) Th. Long-term validation of digital
signatures. Supervisor A.Buldas.
MSc Students
Vassili Garkusha (1976) Th. Information of words. Supervisor
O.Sokratova.
Leo Gordon (1976) Ss. Field: Web-interfaced distributed remote
control system. Supervisor M.Danilkin.
Veljo Hagu (1975) Ss. Prototyping a limited-dictionary
speech recognition software. Supervisor M.Koit.
Kaido Hallik (1973) Ss. Field: Distant Education Software.
Supervisors A.Villems, J.Pöial.
Kristo Heero (1977) Ss. Field: Sketchy Processing Technologies.
Supervisor J.Kiho.
Sven Heiberg (1977) Th. Field: Public Key Infrastructures
and Personal Security Environments. Supervisor H.Lipmaa.
Andrei Ivanov (1978) Ss. Interactive learning software
for the computer applications course. Supervisor M.Koit.
Andres Järviste (1970) Ss. Field: SE and component
techniques, UML. Supervisor J.Kiho.
Kaarel Kaljurand (1975) Ss. - Automatic syntactic analysis
of natural language. Supervisor K.Müürisep.
Priit Karu (1978) Th. Comparison of Fast Public-key Cryptosystems.
Supervisor H.Lipmaa.
Gunnar Kudrjavets (1977) Ss. Software architecture of speech
recognition system. Supervisor J.Pöial.
Maret Kullasaar (1976) Th. Dialogue corpus development
by the Wizard-of-Oz technique. Supervisor M.Koit.
Gunnar Nellis (1974) Ss. Course "Introduction to
Multimedia".
Supervisor I.Sander.
Evely Nurmsalu (1975) Th. Tagging software for Estonian
dialogue corpus. Supervisor M.Koit.
Ahti Peder (1976) Th. Compiler for Logic Formulas. Supervisor
M.Tombak.
Rene Prillop (1974) Th. Field: Computer Linguistics. Supervisor
H.Kaalep.
Uuno Puus (1956) Th. Field: Database security. Supervisor
A.Buldas, J.Villemson.
Riina Reinumägi (1964) Ss. Using MS Excel in Teaching
Mathematics. Supervisor R.Prank.
Rivo Roo (1978) Th. Methologies of Software Development.
Supervisor J.Villemson.
Peep-Ain Saar (1977) Ss. Designing location-based applications.
Supervisor J.Kiho.
Asko Seeba (1975) Ss. Applying Unified Software Development
Process. Supervisor A.Villems.
Merle Sibola (1975) Ss. Electronical Document Management
Systems. Supervisor A. Villems.
Jelena Zaitseva (1978) Ss. Security in the Internet. Supervisor
J.Pöial.
Mark Tehver (1976) Ss. High-performance microarchitecture
simulation. Supervisor E.Vainikko, J.Kiho.
Asko Tiidumaa (1974) Ss. Field: Using Knowledge Discovery
for Interactive Web Enivronments. Supervisor A.Villems.
Taavi Tiisler (1977) Ss. Field: Techniques of data modeling.
Supervisor I.Sander.
Mart Tudre (1973) Ss. Field: Instrumental Software Tools.
Supervisor J.Kiho.
Roman Ustitsh (1977) Ss. Field: Sketchy modeling. Supervisor
J.Kiho.
Kaire Vahi (1975) Th. Software for Expression manipulation
Exercises. Supervisor R.Prank.
U. Kaljulaid (died September 26, 1999)
Education:
Pärnu I High School, 1959
1959 - 1963 Tartu State University
1963 - 1965 Moscow University; graduated from Mech.-Math. Faculty,
with MSc thesis in math. (under Yu. Manin, algebraic geometry)
Ph.D. thesis in algebra, supervisor B.I.Plotkin (Riga), defended
at the Institute of Mathematics of the Belorussian Academy of
Sciences,1979.
Academic experience:
1973 - 1983 assist. and docent at the Dept. of Math. Tartu
University
1983 lector at the Institute of Computer Science, Tartu
University
Conferences:
1995
Conference "Algebra and Mathematical Cybernetics". Report
at the plenary session "A construction of right ordered groups
and their representations" 20- 22 November 1995, Minsk.
1996
In September Craford Symposium in Lund devoted to fundamental
issues of mathematical ecology, report " On rationally of
formal series".
1997
In Genua the conference "Categories and computer science"
(7th Biannual Intern. Conf. on Categories and Computer Science,
Santa Margherita, Italy).
At the Scandinavian countries' conference on programming theory
report "Automata, categories and side changeing systems";
In Novosibirsk at the international conference on algebra and
logic "Mal'tsevs-kije Tðtenija": report (co-author
O.Sokratova "Omega-rings, their flat and projective representations
".
1998
International Algebra Conference, Moscow; May 1998. "Wreth
product and its applications".
Publications:
19961997
1. U. Kaljulaid, O. Sokratova. W
-rings; their flat and projective
representations. Invited talk at the Mal'cev Meeting, 3p. Novosibirsk.
2. U. Kaljulaid, J.Penjam. On two algebraic constructions for
automata. Research report CS92/97 of The Institute of Cybernetics,
Tallinn, 1997, 27p. 1997.
1998
1. U. Kaljulaid. O.Sokratova. Flatness and localization for -semigroups.
Research Report CS 96/98, Tallinn 1998, 49 p.
2. U.Kaljulaid Revisiting wreath products, with applications to
representations and invariants. Kurosh Algebraic Conference'98.
Abstracts of Talks, Moscow University Press, 1998, pp. 64-65.
3. U. Kaljulaid. A problem concerning right ordered groups. Kourovka
Notebook, 14. edition, Novosibirsk, 1998.
Jüri Kiho
Date/place of birth: 02.08.1941 / Tartu
Citizenship: Estonian
Family status: married, three children
Address, phone: Tartu, Mõisavahe 5-15, 485797
Current position: University of Tartu, Institute of Computer Science, Chair of Software Systems, docent chair holder
Higher education: diploma in numerical mathematics, University of Tartu, 1964.
Research and professional experience, institutional
affiliation:
1965 - University of Tartu, Computer Centre, researcher
1967 - University of Tartu, Chair of Numerical Methods, MSc. student
1970 - University of Tartu, Chair of Math. Statistics and Computer
Programming, sen researcher, docent
1979 - University of Tartu, Chair of Computer Programming, director
1992 - University of Tartu, professor of software systems
1997 - University of Tartu, Institute of Computer Science, Chair
of Software Systems, docent, chair holder in charge
of head of Institute of Computer Science: 1995,1996, 1998
Research/educational training:
1977/78 - Oslo University
1994 - Århus University
1995 - Dresden Technical University
1996 - Nice University
1997 - London City University
Academic degrees: PhD from Moscow All-Union Research Institute for Scientific Research and Technical Information, 1973; Principles of Infological System for Quantitative Organic Chemistry
Languages: Estonian, Russian, English, German (passive)
Research programs (last 5 years):
1) Program structure analysis
a) goals:
In order to increase the productivity of program development,
several diagramming techniques have been developed to compliment
conventional pure-textual program representation methods. To handle
real software, it is important to have tools for processing also
non-structured programs. Therefore, the concept of quasi-structured
programs and the corresponding formal notation are to be introduced.
b) results:
It is proved constructively that any reducible flowgraph can be
represented by a quasi-structured program under the strong equivalence.
Publication:
J.Kiho. Quasi-structured programs. Annales University Sci. Budapest,
Sect Comp. 17(1998) 219-234
c) application:
There exists quite a natural way to represent quasi-structured
programs in the form of most comprehensible diagrams. Therefore
the concept may serve as a basis for further theoretical research
as well as for developing effective tools for quasi-structured
programming and software engineering.
2) Sketchy modeling of computer texts, multiviewers
a) goal:
The main domain of sketchy modeling techniques lays at the edge
of human-computer interaction - at the touching point where data
units of "common interest" must be clearly
"understandable"
both for human beings and computers. Such data form a huge application
area, including all kinds of computer texts - program source texts
as well as any other textual user-written input data or user-read
output data. Therefore, it is desirable to develop modeling methods
offering a uniform and highly flexible framework for graphical
representing and handling of computer texts' structures.
b) results:
Originated from the previous theoretical and experimental work
in the field, a new project (AmadeusJ) was launched in 1998. It
aims to develop an integrated environment for handling sketchy
texts, i.e. computer texts modeled in accord with the sketchy
text model. Both multi-view and multi-base features are supported:
graphical views as well as base languages are considered as variable
attributes assigned to certain parts of text structures. The system
is open, allowing easily to add new views and base languages.
The main, summarizing publication:
J.Kiho. SKM. Sketchy Modelling of Computer Texts. Research Report.
University of Tartu. Institute of Computer Science Tartu, 200, 64 p.
c) application:
Currently, the system is directly used in the teaching process
as well as an aid for preparing algorithm-related study materials.
3) Molecular graph handling
a) goals:
Development of a computerized system for the storage, processing
and prognostication of data with orientation toward the use of
correlation equations.
b) results:
Jalas A., Kiho J., Palm V., Tenno T. A computerized system for
the storage, processing and prognostication of data with orientation
toward the use of correlation equations. The 7-th International
Conference on Correlation Analysis in Chemistry. Japan: ACROS FUKUOKA,
Sept.1-6, 1996, p.18.
V.Palm, A.Jalas, J.Kiho, T.Tenno. A Computerized System for Storage,
Processing and Prognostication of Data with Orientation Towards
the Use of Correlation Equations. Organic Reactivity, vol.31,
1(104), 1997, pp. 111-133.
A.Jalas, J.Kiho, V.Palm, T.Tenno. Data Structure and Menu-Based
Access of the Rate and Equilibrium Constants of Heterolytic Organic
Reactions. Organic Reactivity, vol.31, 1(104), 1997, 135-140.
c) application:
The system is in use at the University of Tartu.
Grant fundings:
1) Estonian Science Foundation, 1993-1994, grant no 414
title: Visual Multisystem Programming Environment
program:
Develop a new-style programming environment where special graphical
pictures for compound constructs are used.
cost: 30,000EEK
results:
A sketchy programming system SKM for base languages C and Pascal
developed.
Publication (theoretical results):
Kiho,J. Self-Reducing Control Structures in the Sketchy Programming
Environment. Proc of Nordic Workshop on Programming Environment
Reseach. Lund, June 1-3, 1994, 333-334.
application:
The SKM system was used as a prototype for further research and
refinements.
2) Estonian Science Foundation, 1998-1999, grant no 3343
title: Development of a Program Multiviewer
program:
Develop a program editor of a new kind which enables to handle
textual source programs as well as their graphical representations
(sketchy programs) in an integrated environment.
cost: 94,000 EEK
results:
A general model for computer texts elaborated. Corresponding Java-based
system (Amadeus) developed.
Publications:
Course development: algorithms and data structures, software engineering, software systems (seminar), programming (Java)
Other projects:
Dissertations supervised:
M.Meriste, PhD. techn.sci
T.Roosmaa, PhD. techn.sci
Research and development perspective:
Present achievements in the field of sketchy modeling and programming
together with the current developments in the area form a solid
starting point for designing and implementing quality software
products for Sketchy Modeling (SKM). The general modeling concepts
should be fully implemented, using, possibly, the current version
of AmadeusJ as a prototype. First of all, the notion of hyper-symbol
must be incorporated. It would result in essentially higher flexibility
and modeling power of the tools. Another urgent task is to develop
automated sketchifiers and textualizers which make use of formally
defined sketchy mappings. It is inevitable for opening a boarder
way to really intensive and wide applications of SKM, in particular,
developing a graphical editors' compiler for structured computer
texts.
Conferences:
1995
1996
1998
Publications:
1995
1. Kiho, J. Quasi-Structured Programs. Proc of the 4th Symposium
on Programming Languages and Softwere Tools. Visegrad, Hungary,
June 8 - 14, 1995. Pp. 67 - 78.
2. Kiho, J., Oja, A. Designing a Program Multiviewer. Abstracts of the Nordic Workshop on Programming Theory, Göteborg, Sweden, Nov 1-3, 1995, pp. 24-25.
1996
1. Kiho J. Quasi-structured programs. Accepted by Annales Universitatis
Scientarum Budapestinensis de Rolando Eötvös Nominatae
Sectio Computatorica. Hungary, Budapest, 1996, 12 p.
1997
1. Palm V., Jalas A., Kiho J., Tenno T. A Computerized System
for Storage, Processing and Prognostication of Data with Orientation
Towards the Use of Correlation Equations., 1(104), 1997, pp. 111-133.
(OrganicReactivity, vol.31).
2. Jalas A., Kiho J., Palm V., Tenno T. Data Structure and Menu-Based Access of the Rate and Equilibrium Constants of Heterolytic Organic Reactions., 1(104), 1997, pp. 135-140. (Organic Reactivity, vol.31)
1999
1. Kiho J. Quasi-structured programs. Annales Universitatis Scientiarum
Budapestinensis de Rolando Eötvös Nominatae. Sectio
Computatorica. Tomus XVII. 1998 (Published 1999). Pp. 219-234.
2000
1. J.Kiho. SKM. Sketchy Modelling of Computer Texts. Research
Report. University of Tartu. Institute of Computer Science. Tartu,
64 p., 2000.
2. J.Kiho. Väike Java leksikon.TÜ kirjastus, Tartu, 2000. 39 lk.
Mare Koit
Education:
1963 Finished Viljandi Carl Robert Jakobson Secondary School
1968 Diploma of Mathematician, Faculty of Mathematics, University
of Tartu
1970 - 1974 Postgraduate student, Faculty of Mathematics, University
of Tartu
1980 PhD, Mathematics, USSR Academy of Sciences, Moscow
Academic experience:
1968 - 1970 and 1974-1985: Lecturer, Faculty of Mathematics, University
of Tartu
1985 - present: Docent, Faculty of Mathematics, University of Tartu
2000: head of the Institute of Computer Science, University of
Tartu
Research/educational training:
University of Saarland 26.06.-17.07.1995
Lorand Eötvös University of Budapest 1.12-14.12.1996
Professional activities:
Conferences 1995-2000:
1995
International conference on Computational Linguistics and its
applications "Dialogue 95", Kazan;
1996
International conference on Computational Linguistics and its
applications "Dialogue 96", Moscow;
1997
The Sixth Scandinavian Conference on Artificial Intelligence SCAI'97,
Helsinki;
1998
1) International Conference on Text, Speech, Dialogue TSD'98,
Brno;
2) International Conference on cognitive strategies for language
communication CSC'98, Partenit;
1999
International conference on Computational Linguistics
and its applications "Dialogue 99", Tarusa;
2000
International conference on Computational Linguistics
and its applications "Dialogue 2000", Protvino.
Publications 1995-2000:
I.
1. M. Koit. Artificial Intelligence in Estonia (in Russian)//Artificial
Intelligence, Moscow, 1995, No 4, pp. 47-55.
2. T.Hennoste, M.Koit T.Roosmaa, M.Saluveer. Structure and Usage
of the Tartu University Corpus of Written Estonian. International
Journal of Corpus Linguistics. Amsterdam, John Benjamins Publishing
Co. Vol 3(2),1998, pp. 1-26.
3. M. Koit, H. Õim. Developing a model of natural dialogue //LREC
2000. Second Conference on Language Resources and Evaluation.
Workshop Proc. from Spoken Language to Full Natural Dialogue -Theory,
Empirical Analysis and Evaluation. Ed. L. Dybkjaer. Athens, Greece,
2000, pp. 18-21.
II.-
III.
1. M.Koit, T.Roosmaa. Overview of the uses of the corpus of Estonian
literary language: current possibilities. Estonian in the Changing
World, University of Tartu, 1996, pp. 33-42.
2. M.Koit. Implementing a dialogue model on the computer. Estonian
in the Changing World, University of Tartu, 1996, pp. 99-114.
3. M.Koit, T.Roosmaa, H.Õim. Teaching computational linguistics:
one vision. Estonian in the Changing World, University of Tartu,
1996, pp. 115-122.
4. M. Koit. Towards development of a model of dialogue (in Russian).
Proc. of international conference on Computational Linguistics
and its applications "Dialogue 96", Moscow1996, 4 p.
5. M. Koit. Developing and studying Computational Linguistics
(in Estonian). Language and Literature No. 3, Tallinn 1996, pp.
171-178.
6. M. Koit. Modelling human-computer interaction. G. Grahne (ed.).
SCAI-97 - Sixth Scandinavian Conference on Artificial Intelligence:
Research announcements. Technical report C-1997-49, Dpt of Computer
Science, University of Helsinki, 1997. 8 p.
7. M.Koit, H. Õim. Dialog s komp'juterom na estestvennom
jazyke. Tr. Po russkoj i slavjanskoj filologii. Lingvistika. Novaja
serija II. Pragmaticheskij aspekt issledovanija jazyka. S. 58-67.
Tartu, Tartuskij universitet, 1999.
8. M. Koit. Dialogue managing in a dialogue system. Proc. of DIALOGUE'99,
Vol. 2, pp. 124-129. Tarusa, 1999.
9. M.Koit. O realizacii dialogovoj sistemy. Obrabotka teksta i
kognitivnye tehnologii. Vol. 2,pp. 32-50. Moskva-Pushcino, 1999.
10. M.Koit, H. Õim. Communicative strategies in human-computer
interaction: a model that involves natural reasoning. 23. Deutsche
Jahrestagung für Künstliche Intelligenz, Bonn, 1999.
Final paper 14 pp.
http://www.ikp.uni-bonn.de/NDS99/Finals/1_2.ps
11. M. Koit. Training conversation with help of computer (in Russian).
Proc. of Dialogue'2000, vol. 2. Protvino, 2000, pp. 182-188.
12. N. Kahusk, K. Kaljurand, M. Koit, K. Vider. User interface
for information extracting from an electronic manual (in Estonian).
TÜ üldkeeleteaduse õppetooli toimetised 1.
Arvutuslingvistikalt
inimesele. Ed. T. Hennoste, Tartu, 2000, pp. 167-182.
13. M. Koit, H. Õim. Modelling conversational agent (in
Estonian). TÜ üldkeeleteaduse õppetooli toimetised
1. Arvutuslingvistikalt inimesele. Ed. T. Hennoste, Tartu, 2000,
pp. 285-308.
IV.
1. M. Koit. User modelling in a dialogue system. Proc. of international
conference on Computational Linguistics and its applications "Dialogue
95", Kasan 1995, 1 p.
2. M. Koit. Modelling human-computer interaction. Proc. of SCAI-97.
Vol 40 in Fronties in Artificial Intelligence and Applications
(J. Brenker, R. Lopez de Mantoras, S. Ohsuga, eds.). IOS Press,
Amsterdam, 1997, 2 p.
3. M.Koit. H.Õim. Developing a Model of Dialog Strategy.
Text, Speech, Dialogue - Proceedings of TSD'98. Brno, Czech Republic,
1998. Pp. 387-390.
4. M.Koit, H.Õim. The Concept of Communicative Strategies:
A Theoretical Model and an Implementation. Proc. of International
Conference "Cognitive Strategies for Language Communication"
CSC'98. Crimea, Partenit, 1998, pp. 23-24.
5. M.Koit, H. Õim. Communicative strategies in human-computer
interaction: a model that involves natural reasoning. 23. Deutsche
Jahrestagung für Künstliche Intelligenz, Bonn, 1999.
Abstract 2 pp.
http://www.ikp.uni-bonn.de/NDS99/Abstracts/8.ps
Helger Lipmaa
Date of birth: 8. April 1972
Education:
1979-1987 Pärnu Ülejõe Gümnaasium (primary
education)
1987-1990 Pärnu Koidula Gümnaasium (high school)
1990-1993 University of Tartu, Department of Mathematics (undergraduate).
1993-1995 University of Tartu, Department of Mathematics, Institute
of Computer Science (Master student)
1995-1999 University of Tartu, Department of Mathematics, Institute
of Computer Science (PhD student)
Academic degrees:
Master of informatics at the University of Tartu, 1995. Subject:
"Review of Communication Complexity".
PhD of informatics at the University of Tartu, 1999. Subject:
" Secure and Efficient
Time-Stamping Systems.''
Occupations:
1991-1991 Programmer, Pärnu Commercial Bank.
1992-1992 Programmer, MesoCom Ltd (large scale databases).
1994-1995 System-administrator and webmaster at the Department
of Mathematics, University of Tartu, Estonia (Linux, WWW, ...).
1995-1995 Junior researcher at the Institute of Computer Science,
University of Tartu (complexity theory).
1995-1996 Senior assistant at the Institute of Computer Science
, University of Tartu.
(complexity theory).
1996-1997 Junior researcher at the Institute of Cybernetics, Tallinn
(cryptography).
1997-2000 Senior research engineer at Cybernetica AS, a
spin-off company of the
Institute of Cybernetics (cryptography).
2000-... Part-time lecturer at the Institute of Computer Science,
University of Tartu.
2000-2000 Part-time researcher at theTelecommunications Software
and Multimedia
Laboratory (TML), Helsinki University of Technology.
2000-... Senior researcher at TML, Helsinki University of Technology.
Additional studies:
1994 DAIMI, Århus University, Denmark (3 months, complexity theory)
1996 DAIMI, Århus University, Denmark (4.5 months, complexity
theory and
cryptography)
1997 New Trends in Computer Science and Information Technology,
Palmse (1 week)
1997 School on Natural Computation, Turku (1 week)
1998 Parallel and Quantum Computation, Palmse, Estonia (1 week)
1998 Summer School in Cryptography and Data Security, Århus,
Denmark (1 week)
1999 Fourth Estonian Winter School in Computer Science, Palmse,
Estonia (1 week)
2000 Fifth Estonian Winter School in Computer Science, Palmse,
Estonia (1 week)
2000 Nevanlinna Prize Special Event, Helsinki, Finalnd (1 day)
Research-administrative experience:
Winter School "Parallel and Quantum Computing" (1998),
Director.
Fifth Estonian Winter School in Computer Schience (2000), member
of organizing committee.
Sixth Estonian Winter School in Computer Schience (2001), member
of organizing
committee.
One of the organizers of the 1998 cryptography seminars in Tartu.
One of the organizers of the 1998-99 quantum seminars in Tartu.
One of the organizers of the 2000 seminar on the `Information
Technology and its Business Aspects'' in Tartu
Has invited several international guests to Estonia.
Has reviewed for ACM Transactions on Information and System Security, International Workshop on Information Security and IEEE Transactions on VLSI Systems.
Computer experience: started active programming during high school studies (assembly coding for 6502 and Z80, finished several games and a full game development environments for both processors). Has programmed in a plethora of programming languages (including some constructed by himself) and operating systems (including Apple DOS, CP/M, MSX DOS, MS DOS and derivatives, VMS, different Unix platforms).
Main research area: cryptology. Strong and innovative background in implementations (Fast IDEA implementation for the Pentium MMX - the first known cryptographic use of Pentium MMX; world fastest implementations of the new AES-Rijndael-and RC6, MARS, and Twofish, three other leading AES candidates, for the Pentium II), applications and theory of cryptography. A coauthor of secure and efficient accountable time-stamping and certificate management systems.
U.S. patent application Application No. 09,375,935 for: TIME-STAMPING WITH BINARY LINKING SCHEMES. File No.: A-66712. (inventors Ahto Buldas, Peeter Laud, Helger Lipmaa and Jan Villemson).
Standardisation activities: his work, co-authored with Buldas et alt., on the time-stamping, is under standardisation in the ISO SC27 workgroup. Active participant in the AES (Advanced Encryption Standard) process, conference publication [4] and workshop publication [1], technical report [7] cited below.)
Awards, grants (not complete):
1994-95 Estonian Science Foundation grant. no. 1203.
"Counting hierarchy and complexity of Boolean formulae with
quantifiers"
1996 Tempus Individual Mobility Grant
1997 Estonian Science Foundation grant, `Research and Studies
in the Field of Cryptology''
1998 Award from the Estonian Science Foundation, Commission for
Exact Sciences
1998 Estonian Science Foundation grant 3742, `Digital Time-Stamping''
1999 Phare HESR grant `Time-Stamping Server''
1999 Award from the Estonian Science Foundation, Commission for
Exact Sciences for successful research
Publications:
Refereed journals and proceedings
1. A.Buldas, P.Laud, H.Lipmaa, J.Villemson, "Time-Stamping
with Binary Linking Schemes." In Hugo Krawczyk, editor, Advances
in Cryptology - CRYPTO '98, volume 1462 of Lecture Notes in Computer
Science, pp. 486-501. Springer-Verlag, 1998.
2. H.Lipmaa, "IDEA: A cipher for multimedia architectures?"
In Stafford Tavares and Henk Meijer, editors, Selected Areas in
Cryptography '98, volume 1556 of Lecture Notes in Computer Science,
pp. 248-263, Kingston, Canada, 17-18 August 1998. Springer-Verlag.
3. A.Buldas, H.Lipmaa, B.Schoenmakers, "Optimally Efficient Accountable
Time-Stamping." In Hideki Imai and Yulieng Zheng, editors, Public
Key Cryptography '2000, volume 1751 of Lecture Notes in Computer
Science, pp. 293-305, Melbourne, Australia, 18-20 January 2000.
Springer Verlag.
4. K.Aoki, H.Lipmaa, "Fast Implementations of AES Candidates".
Third AES Candidate Conference, New York City, USA, 13-14 April
2000.
5. A.Buldas, P.Laud, and H.Lipmaa, "Accountable Certificate Management
using Undeniable Attestations." To appear in 7th ACM Conference
on Computer and Communication Security, 1-4 Nov 2000, Athens,
Greece.
International Workshops
1. H.Lipmaa, P.Rogaway, D.Wagner, "Comments Comments to NIST
Concerning AES Modes of Operations: CTR-Mode Encryption". Accepted
to Symmetric Key Block Cipher Modes of Operation Workshop, 18
Oct 2000, Baltimore, Maryland, USA.
Chapters in Books
1. V.Hanson, A.Buldas, T.Martens, H.Lipmaa, A.Ansper,
V.Tulit,"Infosüsteemide
turve I. Turvarisk" Cybernetica AS, 1997, 125 p. ["Security
of Information Systems I.", book, in Estonian]
2. V.Hanson, A.Buldas, T.Martens, H.Lipmaa, A.Ansper,
V.Tulit,"Infosüsteemide
turve II. Turbetehnoloogia" Cybernetica AS, 1998, 372 p.
["Security of Information Systems II", book, in Estonian]
Thesis
1. Master thesis "Survey on the communication complexity",
University of Tartu, 1995 (in Estonian)
2. PhD thesis "Secure and Efficient Time-Stamping Systems", University
of Tartu, 1999.
Surveys and Technical Reports
1. H.Lipmaa, "Turvalised virtuaalsed privaatvõrgud,"
Arvutimaailm 2/97, pp 6-7 ["Virtual Private Networks", a survey
in Estonian.], 1997
2. A.Buldas, P.Laud, H.Lipmaa, J.Villemson. " Ajatempli protokollid,
turvavajadused ja tehnilised nõuded,"; Technical Report
DO-LU-X-22-1297, Cybernetica AS, 1997, 46 p. ["Timestamp
protocols, security needs and technical requirements". Written
by the order of Estonian Informatics Centre for the work of committee
preparing the legal use of electronic documents. In Estonian.]
3. A.Buldas, H.Lipmaa, "Digital Signatures, Timestamps and
the corresponding Infrastructure", Cybernetica AS,
Technical Report 1998-21, Jan 1998, 7 p.
4. A.Buldas, H.Lipmaa, "Ajatemplid digitaaldokumentidel", Arvutimaailm
2/98, pp. 45-47 [`Time-stamps on the digital documents'', a technical
survey in Estonian.]
5. H.Lipmaa, "Kvantarvutid", Eesti Füüsika Seltsi
9. aastaraamat, 1999, pp. 102-125 ["Quantum Computing", Ninth
Annual of the Estonian Physical Society. In Estonian.]
6. H.Lipmaa, "AES Candidates: A Survey of Implementations",
Technical Report. Available from the list of submissions to the
AES2 conference NIST Webpage, 8 p., 1999.
7. H.Lipmaa, "Security in On-Line Governance". Survey prepared
under UNESCO project "Developing Telematics and Information
Networks for On-Line Governance", June 1999.
8. H.Lipmaa, "Digital Signatures and Authentication", June 1999.
Updated version of a module in "Security in On-Line Governance''.
Invited Presentations
1. "Virtual Private Networks", The Second Annual Information
Security Training Seminar of the Institute of Cybernetics, 1996.
2. "IP-level encryption", The Third Annual Information Security
Training Seminar, 1997, Cybernetica AS Technical Report
DO-ÜV-T-20-1297, 16 p.
3. "Quantum algorithms", Estonian Autumn School of Young Physicists,
04.10.98-06.10.98.
4. "Fast cryptographic algorithms on multimedia processors",
The Autumn Seminar of the Institute of Cybernetics, 1998.
5. "Formal security analysis of cryptographic protocols", The
Autumn Seminar of the Institute of Cybernetics, 1998.
6. "Quantum algorithms", Seminars on quantum mechanics 1998.
7. "Three-Move Identification Schemes", Cybernetica Seminars,
May 23 1999, slides 36 p.
8. "Optimally Efficient Accountable Time-Stamping", The Autumn
Seminar of the Institute of Cybernetics, 1999.
9. A.Buldas, H.Lipmaa, "Cryptographic methods and the security
of e-commerce", E-commerce seminar of Estonian Chamber of
Commerce and Industry, 27.10.1999.
10. "Fast Implementations of AES Candidates", Queensland University
of Technology, Brisbane, Australia, 24.01.2000.
11. "Secure and Efficient Time-Stamping Systems", University
of Wollongong, Wollongong, Australia, 25.01.2000.
12. "Secure and Efficient Time-Stamping Systems", Helsinki University
of Technology, Helsinki, Finland, 07.03.2000.
13. "Secure and Efficient Time-Stamping Systems", University
of Latvia, Riga, Latvia, 17.03.2000.
14. "Cryptography: from theory to practice", assembly of Estonian
Mathematical Society, 25.03.2000.
15. "Accountable Certificate Management", Helsinki University,
Helsinki, Finland, 26.09.2000.
Merik Meriste (worked at the ICS until 1997)
Position: senior researcher, Centre of Strategic Competence, University of Tartu
Date of birth: Sept. 17, 1950
Education:
1968-1973 University of Tartu, studies in the Faculty of Mathematics
1979-1982 University of Tartu, postgraduate studies in computer
science
Professional experience:
u
1973-1975 programmer, Computing Centre, University of Tartu
1975-1983 senior lecturer, Department of Computer Science, University
of Tartu
1984-1987 senior researcher, Laboratory of Computer Technology,
University of Tartu
1985 professional training in the Siberian Division of the Acad.
of Sci. USSR (4 months)
1987-1988 researcher, Department of Informatics, University of
Helsinki
1988-1992 senior researcher, Laboratory of Computer Technology,
University of Tartu
1990-1992 lecturer, Department of Informatics, University of Turku
1993-1997 senior researcher, Institute of Computer Science, University
of Tartu
1997- senior researcher, Centre of Strategic Competence, University
of Tartu
Academic degrees:
candidate of technical sciences (PhD), Institute of Cybernetics,
1984;
thesis "Abstract Attribute Grammars".
Research-administrative experience: Head of Computing Centre, University of Tartu (1995-1997), , Director of Centre of Strategic Competence, University of Tartu (1997-1999), member of : Council of CSC of TU, EITS, GI (Gesellschaft für Informatik, D), IEEE, ALT (Association for Learning Technology, UK).
Research program:
Programming languages, theory and applications of attributed automata,
syntactical signal analysis, attribute grammars, informational
environments and technological policies of organisations, technology
management, costructivist learning technologies
Grant funding:
1995-1996 ESF grant 1718 "Theory of Attributed Automata"
1997 ESF grant 2976 "Mathematical Construction of Programs"
Conferences:
1995:
Conference PLILP'95 - report (co-author J.Penjam) "Attributed
models of executable specifications."
1996
IMHE workshop, Tartu, April, report "Towards Information
Strategy in Tartu University".
Participated in the meeting of the Executive Committee of EUNIS (European Universities Information Systems Association), and its annual congress.
Seminar "Teaching IT and CS - Methodology, Contents and New Trends" 3 May 1996 in Tallinn. J.Kiho, M.Meriste, J.Pöial, M.Tombak.
Participation in the work of Societies :
Publications:
1995
M. Meriste, J.Penjam. Attributed Models of Executable Specifications.
Research Report CS80/95, Institute of Cybernetics, Tallinn 1995,
28 p.
M. Meriste, J.Penjam, Attributed Models of Executable Specifications. In Proc. Of PLILP'95, Lect.Notes. Comp. Sci., no. 982, Springer -Verlag, 1995, pp. 459-460.
M. Meriste, J.Penjam. et al. Knowledge Based Software Techniques. Technical Report CS81/95, Dept. of Computer Science, Institute of Cybernetics, Tallinn 1995, 40 p.
M. Meriste, V.Vene, Attributed Automata and Language Recognizers. Proc. 4th Symposium on Programming Languages and Software Tools, Visegrad, Hungary, June 9-10, 1995 pp. 114 -121.
M.Meriste, J.Penjam, et al. Knowledge Based Software Techniques. Technical Report CS83/95, Dept. of Computer Science, Institute of Cybernetics, Tallinn 1995, 45 p.
1996
M.Meriste, J.Penjam, V.Vene Models of Attributed Automata. Institute
of Cybernetics, Estonian Academy of Sciences and Department of
Computer Science (Res. Rep. CS90/96). Tallinn, 1996, 21 p.
Rein Prank
Education:
Moscow University, 1973. Mathematics
Moscow University, 1982. PhD Phys.-Math. Sci (Mathematical Logic)
Academic experience:
1973-76 University of Tartu. Faculty of Mathematics. Sen. lecturer
1976-79 Moscow University post-graduate student
1979-85 University of Tartu. Faculty of Mathematics. Sen. lecturer
Since 1985 University of Tartu. Faculty of Mathematics. Docent
Further education in the speciality:
1993 University of Giessen (Germany) 3 weeks
1995 University of Barcelona 3 weeks
1996 University of Strathclyde (Glasgow) 2 weeks
1997 Helsinki, Jyväskylä, Tampere 2 weeks
1999 Tallaght Institute of Technology (Dublin) 2 weeks
The main research fields in the last five years:
1) Diagnosis and feedback in problem solving environments for
Mathematics
a) Finding the ways for better diagnosis and feedback,
b) Description of dependencies between problem solving interface
and the ability to understand the intentions of the student
2) Software for Learning Mathematical Logic
a) Finding ways for better teaching of Predicate Logic,
b) new software for the exercises on quantifiers,
c) experimental use with the students
3) Test Administration Systems
a) Investigating the possibilities of subject-oriented question
types
b) Proposals on new question types with complex form of the answer
c) New types implemented in package APSTEST2.
Grants and contracts:
Test Administration System APSTEST (together with APSProg Company)
Estonian Tiger Leap Foundation
105,000 + 140,000 EEK
1997-1998, 1998-1999
Program implemented. Distributed by Tiger Leap in Estonian Schools
Other scientific and organisational engagements:
1) Representative of Estonia in the Central European Chapter of
the Association for the Advancement of Computing in Education
(http://www.aace.org/cec/)
2) Member of the CAL Software Expert Board of the Estonian Tiger
Leap Foundation
3) Member of the Estonian Mathematical Society, the Estonian Society
of Infotechnology
Research and development:
Member of the CAL Software Expert Board of the the Estonian Tiger
Leap Foundation
Results:
Software for solving exercises on Mathematics:
1) Diagnosis and feedback in problem solving environments for
Mathematics
(R.Prank, E.Tõnisson)
a) Finding the ways for better diagnosis and feedback,
b) Description of dependencies between problem solving interface
and the ability to understand the intentions and mistakes of the
student
2) Software for Learning Mathematical Logic
(R.Prank, T.Õunapuu)
a) Finding ways for better teaching of Predicate Logic,
b) new software package implemented for the exercises on quantifiers,
c) experimental use with the students
3) Test Administration Systems (R.Prank)
a) Investigating the possibilities of subject-oriented question
types
b) Proposals on new question types with complex form of the answer
c) New types implemented in package APSTEST2.
4) Computer Algebra Systems in Mathematics Education
(E.Tõnisson)
a) Investigating different scenarios of using CAS in Teaching/Learning,
b) Description of shortcomings of CAS by solving typical educational
tasks. Proposals for changes in the functionality of CAS.
The working group is starting the collaboration with the authors
of MuPAD CAS (University of Paderborn, Germany).
Conferences:
1995
1. Report "Computerised Exercises on Elementary Mathematical
Logic"The 5th Nordic Conference on Computer Aided Learning, Stockholm.
2. Report "Are we ready for teaching Information Technology
to the teacher" XII Conference on Research of Teaching Mathematics and Sciences",
Helsinki.
1997
1. Report "Good Diagnostics = Adequate Problem Solving Interface".
International Conference in Technology in Mathematics Teaching
ICTMT3. Koblenz.
1998
1. Report " Using Computers for Problem Solving Tests".International Conference on the Teaching of Mathematics. Samos
(Greece).
2. Conference on computer science at school Links'98. Stockholm.
3. "Test administration package APSTEST". At the Royal Technical University in Stockholm: the Baltic
Project CREMED (Creative Media) multimedia seminar. Stockholm.
1999
1. Report "A scheme for conservative use of Computer Algebra"
IMACS-ACA 1999 Applications of Computer Algebra . Madrid (Spain).
2. Report "Testing knowledge of definitions and theorems
by computer" International Conference on Technology in Mathematics
Teaching, Plymouth.
2000
1.Report: "Some Further Steps after the Computerisation
of Predicate Calculus". First International Congress on Tools for Teaching Logic University
of Salamanca.
Professional activities:
Publications:
1995
1. 1.R.Prank. Using Computers for Problem Solving Tests. International
Conference on the Teaching of Mathematics. Samos, Greece, July
3-6, 1 Sons, Inc. Publishers. Pp. 248-250.
2. R. Prank. Computerised exercises on elementary mathematical
logic. The fifth Nordic conference on Computer Aided Learning,
Karolinska Institute, Stockholm, 1995, p. 22.
1996
1. R. Prank. Towards Flexible programs For Exercises in Mathematics.
Hypermedia in Tallinn'96. May 22-24, 1996. Proceedings, Tallinn
Technical University, 1996, pp. 188-192.
1997
1. R. Prank, T. Õunapuu. Intelligent Tutoring System for
Proof Building Exercises New Media and Telematic Technologies
for Education in Eastern European Countries. Twente University
Press, Enschede (The Netherlands); pp. 371-376.
2. R. Prank Good diagnostics = adequate stepwise solution interface?
Proc. International Conference on Technology in Mathematics Teaching.
Koblenz, 1997, CD-publication. 10 p.
1998
1. R.Prank. Using Computers for Problem Solving Tests. International
Conference on the Teaching of Mathematics. Samos, Greece, July
3-6, 1998. John Wiley & Sons, Inc. Publishers. Pp. 248-250
1999
1. R.Prank. Testing knowledge of definitions and theorems by computer.
ICTMT4. The International Conference on Technology in Mathematics
Teaching. University of Plymouth, 1999. p. 29.
2000
1. R.Prank. Some Further Steps after the Computerisation of Predicate
Calculus. First International Congress on Tools for Teaching Logic.
Proceedings. University of Salamanca, 2000, Pp. 131-136.
J.Pöial
Education:
University of Tartu, 1982, MSc (5 year degree) in Mathematics,
1982
University of Tartu, 1986, PhD (9 year degree) in Computer Science,
1987
Academic experience:
University of Tartu, docent, 1989 - 2004
University of Tartu, assistant, 1986 - 1989
University of Tartu, researcher (research fellow), 1985 - 1986
University of Tartu, PhD student, 1982 - 1986
University of Tartu, (MSc) student, 1977 - 1982
Further education in the speciality:
1994 University of Nice (prof. J.-P. Rigault)
1996 University of Nice (prof. J.-P. Rigault)
2000 'i Institute of Technology in Tallagh (Ireland)
Main topics of research:
Programming languages and compilation techniques
Formal languages and semigroups
Extensible languages and semantics
a) goal: formalisation of semantics of stack based languages
b) results: two new models of semantic description - stack effect
calculus and syntactic equations
c) applications: compiler compiler, verification of Java bytecode
programs
Grants and contracts:
a) Title: Description of a Stack Based Language via System of
Syntactic Equations
b) Funding: Estonian Science Foundation
c) Program: 1-year grant to investigate syntactic equations
d) Total cost 40,000 EEK
e) Deadline 1998
f) Results are published at NWPER'98
g) This particular grant was given for theoretical research
Other organisational and speciality-related engagements:
Member of EuroFORTH conference program committee 1994-1998
Member of program committee of Fenno-Ugric conferences in programming
languages and software tools 1993-1999
Member of program committee of Baltic DataBase conferences 1996, 1998
Member of different committies at the University of Tartu (informatics, centre of technology)
Research and development:
Two PhD students and several MSc students
Aims of research:
Many applications for compilers, Java, robotics, web, ...
Cooperation in Estonia and abroad:
Baltic conferences in DB and IS
Fenno-Ugric conferences in programming languages and software tools
Nordic conferences (NWPT, NWPER, ...)
Tempus (different projects)
Conferences:
1995
4th Symposium on Programming Languages and Software Tools, June
8-14, Visegrad, Hungary. Report "Remarks on Language
Extensibility".
1996
Seminar "Teaching IT and CS - Methodology, Contents and New
Trends" 3 May 1996 in Tallinn. J.Kiho, M.Meriste, J.Pöial,
M.Tombak.
Seminar "Graduate Schools - Management, Financing and PR" 6-7 June 1996 in Tartu. Report by J.Pöial, J.Kiho "Estonian Model of Graduate School".
Tempus project CME-01011-95 seminar 26-27 August in Kista (in Sweden). Report "Final Report of CME 01011-95.
1997
Fifth Symposium on Programming Languages and Softwarte Tools,
Report "Validation of Stack Effects in Java Bytecode".
International symposium, in Jyväskylä (Finland)
on 7-8 June "
1998
NWPER'98 - Nordic Workshop on Programming Environment Research
Report "Alternative Syntactic Methods for Defining Stack
Based Languages". In Ronneby, (Sweden) on 20-23 August.
Publications:
1995
1. J.Pöial, M.Tombak, V.Soo, A Forth-Oriented Compiler and
its Applications. Forth Dimensions (ISSN-0884-0822), Oakland,
California, USA, 1995 Vol XVI No 5, Jan-Feb 95, pp. 21-22.
2. J.Pöial. Remarks on Language Extensibility. Proc. 4th
Symposium on Programming Languages and Software Tools, Visegrad,
Hungary, June 9-10, 1995, pp. 108 - 113.
1996
1. T.Järvi, J.Pöial, J. Penjam, J.Vain. A Graduate School
in Information Technology and Computer Science in Estonia:Feasibility
Study.- Tempus CME-01011-95 Final Report.Tartu, October 1996,
10 pp.
1997
1. J. Pöial Validation of Stack Effects in Java Bytecode.
Proceedings of the Fifth Symposium on Programming Languages and
Software Tools, June 7 - 8, 1997, Jyväskylä, Finland,
Report C-1997-37, Department of Computer Science, University of
Helsinki, 1997, pp. 128 - 134.
1998
1. J. Pöial, Alternative Syntactic Methods for Defining Stack
Based Languages, Proc. NWPER'98 Nordic Workshop on Programming
Environment Research, University of Bergen, Informatics report
No. 152, June 1998, pp. 227-232.
1999
1. J.Pöial. Remarks on language extensibility. Annales Universitatis
Scientiarum Budapestinensis de Rolando Eötvös Nominatae.
Sectio Computatorica. Tomus XVII. 1998. Pp. 331-338
Tiit Roosmaa
Position: University of Tartu, Associate Prof. of Computer Science
Date of birth: February 14, 1955
Educational history:
1978, University of Tartu, BSc
in Mathematics
Research and professional experience:
1978-1980 University of Tartu, Laboratory of AI, researcher;
1980 - 1983 University of Tartu, Department of programming, PhD
student;
1984 - 1993 University of Tartu, Department of programming, lecturer,
docent;
since 1993 University of Tartu, Institute of Computer Science,
docent;
Since 1989 Vice Dean Faculty of Mathematics.
Training and retraining:
1993 - University of Helsinki,
1994 - Charles University, Prague, Institute of Linguistics, Budapest;
1995 - Birmingham University, Institute of Computational Linguistics,
Pisa;
1996 - UMIST, Manchester;
1997 - Tampere Technical University, Hypermedia Laboratory;
1998 - Twente University;
1999 - Sunderland University;
2000 - Institute of Technology Tallaght, Dublin.
Academic degrees:
PhD in Computer Science from the Institute of Cybernetics, Tallinn,
1987 "Developing a knowledge base and its implementation
in the systems of analysis of natural language texts".
Research-administrative experience:
Vice-Dean Faculty of Mathematics
Current research program:
Computational Linguistics, Language Technology.
Last grant funding:
Publications:
1995-2000
1. G. Proszeky, T. Roosmaa. English for Bulgarians, Estonians, and Hungarians. Language Teaching and Language Technology. Swets and Zeitlinger, Lisse. 1997, 8 p.
2. J. Nerbonne, L. Karttunen, E. Paskaleva, G. Proszeky, T. Roosmaa.Reading more into foreign languages. The Fifth Conference on Applied Natural Language, Washington, ACL, 1997, pp. 830- 835.
3. T. Hennoste, M. Koit, T. Roosmaa, M. Saluveer. Structure and usage of the Tartu University Corpus of Written Estonian. International Journal of Corpus Linguistics. Amsterdam, John Benjamins Publishing Co., 3 (2), 1998, pp. 1-26.
4. M. Koit, T. Roosmaa. Overview of the Uses of the Corpus of Estonian Literary Language: Current Possibilities. Estonian in the Changing World, Tartu, 1996, pp. 33-42.
5. H. Õim, M. Koit, T. Roosmaa. Teaching Computational Linguistics: One Vision. Estonian in the Changing World, Tartu, 1996, pp. 115 - 122.
6. T. Roosmaa. Using Natural Language Processing Tools for Reading Texts in a Foreign Language; Databases and Information Systems, Proceedings of the Third International Baltic Workshop, Riga Volume 1, 1998, pp. 167-174.
Prjects and Grants:
A formal grammar for the Estonian language (ESF grant 3314, 1998-2000; 171,000 EEK)
There exists a morphological analyser for the automatic processing
of the Estonian language which can determine the inflectional
forms in texts. The next logical step in the automatic processing
is syntactical analysis which presupposes the elaboration of a
formal grammar for the language.
The goal of the project is to construct a constraint grammar for
the Estonian language and a syntactic analyser based on it, i.e
a computer program which, together with the morphological analyser,
should enable us to fully automatize the analysis of Estonian
texts.
The expected correctness of this type of syntactic analysis should
be at least 80% and the recall over 90%.
GLOSSER, Copernicus Joint Research Project #343, 1995-1997, 72 MECU
Project partners:
Alfa-informatica, University of Groningen
Rank Xerox, Grenoble
Morphologic, Budapest
Linguistic Modelling Laboratory, Bulgarian Academy of Sciences,
Sofia
University of Tartu
The GLOSSER project aimed at applying natural language processing
techniques, especially morphological processing and corpora analysis,
to technology for computer-assisted language learning (CALL).
The project ran for two years and built three software prototypes
as a demonstration of concept.
The GLOSSER prototypes are designed to help numerous people who
know a bit of language but cannot read quickly and reliably. The
prototypes support their knowledge of basic grammar (i.e. morphology)
and remove the tedious task of thumbing through the dictionary.
Finally, they provide further examples of words in use in large
text corpora. The aim of the program is to assist people in reading
- whether their final purpose is understanding a specific text
improving their language ability. The program works with any text.
TELRI II, EC Copernicus project, 1999-2001
The Concerted Action TELRI II is a pan-European alliance of
currently 28 focal national language (technology) institutions
with the emphasis on Central and Eastern European and CIS countries.
It is planned to extend this alliance during the course of the
Concerted Action with at least 3 new nodes in CEE/CIS.
TELRI II´s primary objectives are:
Tõnu Tamme
Education:
University of Tartu, MSc in computer science 1996
Moscow University 1985-1988, post-graduate studies in mathematical
logic
University of Tartu 1977-1982, diploma in mathematics 1982
Academic experience:
1993-... University of Tartu, Institute of Computer Science, lecturer
1988-1993 University of Tartu, Laboratory of Applied Mathematics,
junior
researcher
1982-1985 University of Tartu, Computing Centre, technician, engineer
Retraining:
Imperial College of Science and Medicine, Sept.-Oct. 1996, London
Århus University, February 1996
Imperial College of Science and Medicine, June 1995, London
Main Scientific Topics:
Logic programming
In 1998 T.Tamme wrote lecture notes for the course 'Prolog for
linguists' (101 pp., in Estonian). The use, Prolog and constraint
logic programming for solving hard combinatorial problems. I have
worked together with Mati Tombak to develop new algorithms and
environments for solving combinatorial counting problems. Prolog
implementations of the algorithms can compute Dedekind numbers
up to 7.
The future aim is to develop Prolog's extra logical facilities
to make it a better programming language. This work has just begun.
Agent technology
In 1997 T.Tamme wrote together with his student Tambet Matiisen
an overview of this area. In 1998 they developed a www information
agent.
Logic
In 1997 T.Tamme composed together with Tanel Tammet and Rein Prank
the textbook 'Logic: from thinking to proving' (412 pp., in Estonian).
The authors hope it will be useful for sudying logic for philosophers,
mathematicians and computer scientists.
Tamme T., Tammet T., Prank R. Loogika. Mõtlemisest tõestamiseni. Tartu Ülikooli Kirjastus, 1997. (x+412 p.)
Grants:
ESF and OEF grant
Composition of a logic book
1995-1996
50.000+35.000=85.000 EEK
Goal: Composition of a logic textbook for Estonian universities.
Results: The book was printed in 1997.
Mati Tombak
Position: Professor, Institute of Computer Science, University. of Tartu.
Date of birth: January 25, 1942.
Educational history: diploma in mathematics, University. of Tartu, 1969.
Academic degrees: PhD from Leningrad University, 1981,
thesis:
On the reduction problems in precedence grammars.
Research and professional experience:
1969-1975 - Researcher, Tallinn Technical University, Faculty
of Economics.
1975-1978 - Researcher, Tartu University, Faculty of Mathematics.
1978-1984 - Lecturer, Tartu University, Faculty of Mathematics.
1984-1992 - Docent, Tartu University, Faculty of
Mathematics.
1992-1996 - Acting Professor, Tartu University, Faculty of Mathematics.
1997- Professor, Tartu University, Faculty of Mathematics.
Research/educational training:
1980 - Leningrad University.
1985 - Tallinn Technical University.
1993 - Loughborough Technical University.
1994 - University of Helsinki.
1995 - Borås University.
1996 - Aarhus University.
1997 - University of Turku.
Professional activities:
Topics of interest:
| MSc theses: | H.Lipmaa |
| O.Kislitsina | |
| I.Mehide | |
| E.Leego | |
| A.Tumanov | |
| PhD theses: | H.Lipmaa |
Grants:
ESF grant No. 1203
Counting Hierarchy and Complexity of Qantified Boolean Formulae
1994-1995
Leader: Mati Tombak
Main implementers: Helger Lipmaa, Olga Kislitsina
A new algorithm for counting colutions
of propositional formulae, which is based on founding a nonintersecting
cover of formulas points on hypercube has been developed. A method for investigating
properties of Boolean functions has been developed.
Publications:
Ian P. W. Sillitoe, Mati Tombak, Ain Isotamm. On the Representation
of Boolean Functions using Compact Look-Up Tables via Parallel
and Variable Overlapping Schemes. Proceedings of the Fifth Symposium
on Programming Languages and Software Tools, University of Helsinki,
Finland, 1997, pp. 96-105.
3 MSc theses defended (Helger Lipmaa 1995, Olga Kislitsina
1996, Ivo Mehide 1996).
ESF grant No 3056
Theoretical and constructive research in complexity theory.
1997-2000
Leader: Mati Tombak
Main implementers: Ain Isotamm, Tõnu Tamme, Reimo Palm, Olga
Kislitsina, Albert Tumanov
A method for describing properties of Boolean functions by
families of propositional formulae has been applied to various
properties. Davis-Putnam type backtracking algorithms for counting
solutions have been investigated and applied for combinatorial
counting problems.
Publications:
1. M.Tombak, A.Isotamm, I. Sillitoe. On the representation
of Boolean functions using compact look-up tables via parallel
and variable overlapping schemes. Proceedings of the Fifth Symposium
on Programming Languages and Software Tools, Jyväskylä,
Finland, 1997, pp. 96-105.
2. Sillitoe I. P. W., Tombak M. A compact look-up table structure
for low level binary image processing. Journal of Real-Time Imaging.,Vol
4 No 3 Jun 1998 pp. 203-210
3. M.Tombak, I.Sillitoe. On the superposition of Boolean functions.
Annales Universitatis Scientiarum Budapestinensis de Rolando
Eötvös Nominatae. Sectio Computatorica. Tomus XVII. 1998.
Pp. 381-389.
4. T.Nirk. The Splicing Languages of MH Systems. In: J.Penjam
(Ed.) Software Technology. Proceedings of the Fenno-Ugric Symposium
FUSST'99. Technical Report CS 104/99. Institute of Cybernetics
at Tallinn Technical University. Tallinn 1999. Pp. 233-236.
1 MSc thesis defended (Albert Tumanov 1998)
Conferences and seminars:
Publications:
1.Tombak, M., Sillitoe, I. On the Superposition of Boolean Functions. Proceedings of the Fourth Symposium on Programming Languages and Software Tools, Budapest, 1995, pp. 288-295.
2. Sillitoe I., Tombak M. A compact look-up table structure for low level binary image processing. Journal of Real-Time Imaging., Vol 4 No 3 Jun 1998, pp. 203-210.
3. Tombak M., Isotamm A., Sillitoe I. On the representation of
Boolean functions using compact look-up tables via parallel and
variable overlapping schemes. Proceedings of the Fifth Symposium
on Programming Languages and Software Tools, Jyväskylä,
Finland, 1997, pp. 96-105.
4. Tombak M., Sillitoe I. On the superposition of Boolean functions. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica. Tomus XVII. 1998. Pp. 381-389.
Varmo Vene
Education:
2000 - PhD (computer science) University of Tartu, Faculty of
Mathematics
1994 - MSc (computer science) University of Tartu, Faculty of
Mathematics
Academic experience:
2000 - Lecturer, Institute of Computer Science, University of
Tartu.
1998 - Researcher, Institute of Cybernetics, Tallinn Technical
University.
1994 - 2000 Researcher, Institute of Computer Science, University
of Tartu.
Further education:
1994 - Department of Computer Science, University of Saarland
1996 - Department of Teleinformatics, Royal Technical University,
Stockholm
Received grants and contracts
Theme: Mathematical Construction of Programs
ETF 2976 (1998 - 1999)
1998 - 75,000 EEK
1999 - 80,000 EEK
Results:
One of the important objects of interest for the mathematics of
program construction is programming with inductive and coinductive
types.
Our research efforts have been focussed on the comparison and
systematization of existing generic formalizations of inductive
and coinductive types and the associating terminating (co)recursions
schemes and on the development of the new ones, both in the syntax-oriented
type theory and with the help of more semantic category-theoretical
tools. On the type theory side, we carried out a comparative study
lambda-calculi with the least and greatest fixedpoint operators
and developed a taxonomy of eight tenable systems, whereof four
were new, and studied their potential utility for program extraction.
On the categorical logic side, we studied various terminating
recursion and corecursion schemes and their properties: we developed
categorical accounts for primitive corecursion (apomorphisms),
course-of-value (co)iteration (histo- and futumorphisms) , and
studied the use of these constructions in program calculation.
We proposed a new categorical semantics of (co)inductive types
that is based on the concept of the so-called Mendler-style algebras
and generalized the existing theory for the types with a mixed-variant
base functor. The Mendler-style algebras were also used for an
alternative categorical coding of different recursion schemes.
The results of these studies provided a basis for a doctoral thesis.
Publications
1.Meriste, M., Vene, V. Attributed Automata and Language Recognizers.
Proc. 4th Symposium on Programming Languages and Software Tools, Visegrad,
Hungary, June 9-10, 1995, pp. 114 -121.
2. M.Meriste, J.Penjam, V.Vene. Models of Attributed Automata.-
Institute of Cybernetics, Estonian Academy of Sciences and Department
of Computer Science. Tallinn, 1996, 21 p.- (Res. Rep. CS90/96).
3. T.Uustalu, V.Vene. A Cube of Proof-systems for Intuitionistic
Predicate-logic.- In:. Abstracts of NWPT'96. Oslo, Dec. 3-5, 1996,
p. 31.
4. T.Uustalu, V.Vene. A cube of proof systems for the intuitionistic
predicate m,n-logic.In M Haveraaen and O Owe, eds, Selected
Papers 8th Nordic Workshop on Programming Theory, NPWT'96, Oslo,
Norway, 4-6 Dec 1996, Research Report 248, Dept of Informatics,
Univ of Oslo, pp. 237-246, May 1997.
5. V.Vene, T.Uustalu, E.Tõugu. Logical Semantics of NUT
Extended with Production Rules.- Proceedings of the Fifth Symposium
on Programming Languages and Software Tools. Jyväskylä,
June 7-8, 1997, pp. 145-154.
6. T.Uustalu, V.Vene. A Cube of Proof Systems for the Intuitionistic
Predicate -Logic (full version). Stockholm, Royal Inst. of Techn.
Dept. of Teleinformatics, , 1997.- (Report R 97:15).
7. V. Vene, T Uustalu. Functional programming with apomorphisms
(corecursion).Proceedings of the Estonian Academy of Sciences:
Physics, Mathematics, 47(3):147-161, 1998.
8. V.Vene, T.Uustalu. Mendler-Style Inductive Types, Categorically
(Extended Abstract). In L. S. Barbosa, J. A. Saraiva, eds.- Proceedings
of the AFP'98 Workshop on Research Themes in Functional Programming,
Portugal, Braga, Dept. of Informatics, 18 Sept. 1998, (Tech. Report
UM-DI TR 98-03).
9. T.Uustalu, V.Vene. Mendler-style inductive types, categorically.
Nordic Journal of Computing, 6(3):343-361, 1999.
10. T.Uustalu, V.Vene. Primitive (co)recursion and course-of-value
(co)iteration, categorically. INFORMATICA, 10(1):5-26, 1999.
11. T.Uustalu, V.Vene. Least and greatest fixedpoints in intuitionistic
natural deduction. Theoretical Computer Science, to appear (accepted
March 2000).
12. T.Uustalu, V.Vene. Coding recursion a la Mendler (extended
abstract).In J Jeuring, ed, Proceedings 2nd Workshop on Generic
Programming, WGP'2000, Ponte de Lima, Portugal, 6 July 2000},
Tech Report UU-CS-2000-19, Dept of Computer Science, Utrecht Univ,
pp. 69-85. June 2000.
13. V.Vene. Categorical Programming with Inductive and Coinductive
Types. PhD thesis (Diss Math Univ Tartuensis 23), Dept of Computer
Science, Univ of Tartu, August 2000.
Conferences:
1995
4th Symposium on Programming Languages and Software Tools, Visegrad,
June 8 - 14. Report "Attributed Automata and Language
Recognizers".
1997
Report "Logical Semantics of NUT Extended with Production
Rules.
Fift Symposium on Programming Languages and Software Tools, international
symposium, 7. - 8. June Jyväskylä, Finland.
Report "A Cube of Natural-Deduction Calculi for Intuitionistic m,n-Logic (with Application Examples from Program Construction) . International Meeting on Theories of Types and Proofs. TTP-Tokyo*97, Tokyo 8-18 September.
Report "Functional Programming with Apomorphisms Co-Recursion. 9th Nordic Workshop on Programming Theory, Tallinn, 15-17 October.
1998
Conference Foundational Methods in Computer Science (FMCS'98),
Portland, Oregon, USA, 28-31 May. Report "Primitive (Co)Recursion
and Course-of-Value (Co)Iteration, Categorically".
Seminar at the Department of Teleinformatics, Royal Technical
University, Stockholm, 25 June. Report "Primitive (Co)Recursion
and Course-of-Value (Co)Iteration, Categorically.
Conference: International Workshop on Supercompilation, Pereslavl,
Russia , 30 July-6 August. Report "(Co-)Inductive types,
Categorically".
Conference: 10th Nordic Workshop on Programming Theory (NWPT'98), Turku, Finland, 14-16 October. Report "Mendler-Style Inductive Types, Categorically".
1999
Report "Mendler-Style Inductive Types", Conference:
Foundational Methods in Computer Science (FMCS'99), , 3-6 June
1999 Calgary, Canada.
Report "Mendler-Style Inductive Types", Oregon Institute, Department of Software (Oregon Graduate Institute, PacSoft) seminar, Portland, June 1999, Oregon, USA, 8.
2000
Workshop on Foundational Methods in Computer Science (FMCS2000),
Vancouver, BC, Canada, 1-4 June. Report "Mendler-style recursion
schemes for inductive types".
2nd Int Workshop on Generic Programming (WGP'00), Ponte de Lima, Portugal, 6 July. Report "Coding recursion a la Mendler".
12th Nordic Workshop on Programming Theory (NWPT'00), Bergen,
Norway, 11-13 October Report "Comonadic Iteration"
Anne Villems
Education:
Graduated: 1970, Faculty of Mathematics, University of Tartu,
Estonia
PhD student: 1976-1978, Department of Computer Science, University
of Tartu
Professional career:
Since 1970 affiliated with the Department of Computer Science,
University of Tartu: assistant, lecturer.
Professional activities:
Participation in scientific organisations:
Conferences:
1995
1. ESP (European Schools Project), annual conference, Cambridge,
March 22-25 1995. Presentation: "Telematics in Estonia".
2. Workshop: CEENet Network Technology Workshop, Warsaw, Sept 15-25 1995. Trainer for the Internet Servicies Track.
3. European Schools Project and Internet Services in Education, Zvolen, Slovakia, Nov 10-12. Presentation "ESP and Development of Schools Network in Estonia".
1996
1. ESP (European Schools Project), annual conference in Leuven,
March 1996. Support from OEF. Presentation.
2. "Pan-European collaborative projects in teacher education",
support from OEF. Presentation with Rohtla, H. and Normak, P.
"Information Technology in Estonian Teacher Education",
second presentation with Donnelly, P., Barajas, M, Winch, J. and
Sancho, J.
3. ISAGA annual conference in Jurmala, July 1996.
4. ATEE (Association of Teacher Education in Europe) annual conference
in Glasgow. 3 presentations: "Using telecommunication in
tutoring teachers: case study from two Spanish and Estonian
experiences",
"Computer Mediated Communication (CMC) as a tool in Estonia
Education" and "Information Technology in Estonian Teacher
Training".
5. Seminar "Graduate Schools - Management, Financing and
PR", June 6-7 1996, Tartu.
1997
1. Conference "Cross Cultural Communication", Pointiere,
France, presentation: "CCED - collaborative Leaning Project
for University Students".
2. ESP (European School Project) annual conference in Slovenia,
Portoroz, presentation: Tiger Leap Project and Teacher Training
in Estonia.
3. Global Learning '97 Toronto, financed by World Bank and UNDP,
member of official delegation from Estonia.
4. ISAGA'97 8-11 July, Tilburg (Netherland), presentation.
5. Valmiera, Latvia, Women and Men in Dialogue, presentation:
"IT in Education - one way to create equal possibilities".
6. EU CEEC panel, presentation "Teacher Training via
Internet".
7. AKVA (Association of Finnish computer teachers) seminar, Kolga,
presentation: Tiger Leap Project in Estonia.
8. International seminar of folkloristics, presentation: Internet
- salvation or death for education.
9. CREMED seminar in KTH 3-4 December 1997, Stockholm. Crative
Media.
1998
1. Baltic-Nordic Teacher Training using ICT in language learning",
Lohusalu, October 1998.
2. ESP annual conference, March 1998, Kopenhagen, ICT in Estonian
Education.
3. CEENET General Assembly in Tartu. 29-31 May; presentation and
member of the organising committee.
4. Baltic IT&T'98, 15-18 April, Riga, Presentation "Teacher
training - the key issue in education of the information society".
5. ISAGA'98, St.Peterburg, Presentation: Education Change in the
IT Era: Vision and Reality".
6. International seminar, organised by OEF, July , Tallinn, invited
presentation: "Is teacher a leader, a brakesman or just dragging
along?"
1999
1. CEENet Workshop, Budapest, August 18-26 , track 3 "Wired
Education" leader of the track, 27 participants from 17 countries,
financed by OSI and NATO.
2. ESP annual conference in Tartu, March 1999, presentation and
head of organising committee.
3. Presentation about DE in Tbilisi, Georgia, 14-19 October, seminar
organised by NATO.
4. IT&T, presentation "A Pilot Project in Web-Based Distance
Education", 28-30 April, Riga.
5. ISAGA'99, 12-1. July , Sydney. Presentation.
6. Presentation in the Computer Science Department, University
of Canberra.
2000
1. ESP2000 in Haugesund, 6-9 April 2000. Presentation.
Publications
1995
1. Villems, A. Two e-mail based projects from Estonia. In From
Smoke Signals to
Satellite II. An International Survey of Distance Education and
Teacher Training by ICEM - International Council for Educational Media. University
of Central Florida, pp. 47 - 52. Florida, pp. 47 - 52.
http://www.ibs.ee/chronicle/2e-mail.html.
2. Villems, A. Arvutid ja Eesti kool. Kogumik "Avatud Eesti
Fond 1990-1995" Tallinn 1995, pp. 18-19.
3. Villems, A. Informatics in Teacher Education. Proceedings of
the Workshop TEMPUS JEP-06145. General Principles of Informatics
Curricula' 95. Tartu 1995, pp. 31-32.
1996
1. Villems A. Computer Mediated Communication (CMC) as a tool
in Estonia Education. Hypermedia'96. Tallinn, 1996, pp.231-235.
2. Normak P., Rohtla H., Villems A. Information Technology in
Estonian Teacher Training. Pan-European Collaborative Projects
in Teacher Education. Cesky Krulov, July 1996, pp. 176-181.
3. Barajas M., Villems A. Using telecommunication in tutoring
teachers: case study from two Spanish and Estonian experiences.
ATEE Conference Glasgow, September 1996.
4. Villems A. Andmebaasid. Relatsiooniline mudel. Master thesis.
(WWW-s).
5. Villems A., Leego E. Infosüsteem Internetis:Kursuse materjalid.
6. Barajas M., Donnelly P., MacCarney J., Rohtla A., Sancho J.,
Villems A., Winch J. TEMPUS PROJECT S-JEP 07256 Estonia: Information
Technology in Teacher Education.- Pan-European Collaborative Projects
in Teacher Education. Cesky Krulov, July 1996, p. 227.
1998
Villems A. "Teacher Training - the Key Issue in Education
in the Information Society" Baltic Reviews, 1998 pp.71-73.
(Only their pre-reviewed papers have been indicated)
Vassili Garkusha (1976) MSc studentAhto Buldas (1967) Docent; publications - 6
Sven Heiberg (1977) MSc student; publications - 1
Olga Kislitsina (1972) MSc, PhD student
Peeter Laud (1977) MSc, PhD student; publications - 3
Reimo Palm (1973) MSc, PhD student, Researcher
Tiina Puolakainen (1973) MSc, PhD student; publications
- 3
Meelis Roos (1975) MSc, PhD student; publications - 1
Olga Sokratova (1971) MSc, researcher; publications - 7
Mart Tudre (1973) MSc student
Albert Tumanov (1975) MSc, PhD student
Eno Tõnisson (1969) MSc, PhD student publications - 2
Heli Uibo (1971) MSc MSc, PhD student, lecturer; publications
- 3
Jan Villemson (1974) MSc, PhD student, lecturer; publications
- 3
Language technology group
Computer grammar for Estonian
Goal: to implement the syntactic analyser of Estonian
Results: The formal grammar of Estonian is based on Constraint
Grammar formalism (developed at the University of Helsinki) with
the rules extending capabilities of the original formalism. The
grammar contains 1000 rules of the morphological disambiguation,
180 mapping rules, and 1100 syntactic constraints. The grammar
has been tested on the corpus. The syntactic analyser of Estonian
uses grammar rules to analyse Estonian. The precision of the analyser
is 83-90%, and the error rate 2-3.5%.
Practical applications: The syntactic analyser has been used as the
basis of noun-phrase-detecting software, and as a heart of software
for automatic summaries from newspaper texts. It can be used as
a module in the grammatic corrector of Estonian.
Noun phrase extractor of Estonian
Goal: To implement the noun phrase extractor for Estonian - the
program the input of which is an arbitrary text in Estonian and
the output of which constitutes noun phrases found in the text.
Results: The noun phrase extractor has been successfully tested
on newspaper and legal texts.
Practical application: Estonian Translation and Legislative Support
Centre will use the program as the helpful tool for translation
and information retrieval.
Test corpus of Estonian
Goal: To compile the corpus for testing of the syntactic analyser
by hand-annotating the texts from various text types (newspapers,
fiction, laws).
Results: The test corpus has been compiled consisting of 23,000
words, including 10,000 words of newspaper texts, 6,500 words
of fiction and 6,000 words of legal texts.
Practical application: The corpus has been used for testing the
syntactic analyser of Estonian. The corpus will be a basis for
the Estonian treebank.
Two-level morphology of Estonian
Goal: To describe the Estonian morphological system in the two-level
formalism, developed by Kimmo Koskenniemi.
Results: The experimental two-level morphology for Estonian has
been composed using the XEROX finite state software tools. The
experimental two-level morphology of Estonian has shown that the
model is quite usable for Estonian simple word recognition and
production.
Participants: Mare Koit, Tiit Roosmaa, Kaili Müürisep, Heli Uibo, Tiina Puolakainen.
Publications: [4,14,22,23,24,25,26,47,48,71,72,73,79,80,82,84,99,100,
101,102,108,109,110,120,121,127,128,129,130,137,138,141,149,150,151]
Laboratory of Data Security
As in December 2000 the Estonia law of digital signatures will be applied, the Cybernetica's researchers have been deeply involved in the research of public key infrastructures, long-term digital signature validation, time-stamping and notary protocols. Recent developments also include considering the issues of secret key management, personal security environments and security problems of mobile communication platforms. As a result of the innovative research done in Cybernetica, the company has built a time-stamping server and a notary server. The latter is currently being tested and will be applied as the main technology component for the Estonian public key infrastructure enabling long-term validation of digital signatures. Cybernetica's researchers are also active in the international standardization process making their innovative solutions available worldwide.
Some research has been done in developing fast implementations of several block ciphers, including Rijndael, the new Advanced Encryption Standard and IDEA, one of the best-known old block ciphers. The implementation of IDEA was also the first demonstration - and even two years later one of the very few ones - that the usage of the new multimedia technology extensions, Intel's MMX, can considerably speed up some cryptographic primitives. This research raised the question whether one can construct new, MMX-friendly, fast cryptographic primitives that use the same basic operations as the multimedia applications. As further results by other researchers have shown, this is absolutely possible.
Participants: Ahto Buldas, Helger Lipmaa, Jan Villemson, Peeter Laud, Meelis Roos, Sven Heiberg, Asko Seeba, Uuno Puus, Priit Karu.
Publications: [49,50,51,74,75,76,77,105,106,107,114,115,124,131,132,133,134,135, 136].
Computer aided teaching.
1) Diagnosis and feedback in problem solving environments for
Mathematics
a) Finding the ways for better diagnosis and feedback,
b) Description of dependencies between problem solving interface
and the
ability to understand the intentions and mistakes of the student
2) Software for Learning Mathematical Logic
a) Finding ways for better teaching of Predicate Logic,
b) new software package implemented for the exercises on quantifiers,
c) experimental use with the students
3) Test Administration Systems (R.Prank)
a) Investigating the possibilities of subject-oriented question
types
b) Proposals on new question types with complex form of the answer
c) New types implemented in package APSTEST2.
4) Computer Algebra Systems in Mathematics Education (E.Tõnisson)
a) Investigating different scenarios of using CAS in Teaching/Learning,
b) Description of shortcomings of CAS by solving typical educational
tasks. Proposals for changes in the functionality of CAS.
The working group is starting the collaboration with the authors
of MuPAD CAS (University of Paderborn, Germany).
Participants: Rein Prank, Tauno Õunapuu, Eno Tõnisson,
Anne Villems,
Karin Ruul.
Publications: [10,17,28,29,34,35,36,38,39,53,78,85,86,87,88,92,93,112,140].
Sketchy modelling of structured data.
1) program structure analysis.
a) goals:
In order to increase productivity of program development, several
diagramming techniques have been developed to compliment conventional
pure-textual program representation methods. To handle real software,
it is important to have tools for processing also non-structured
programs. Therefore, the concept of quasi-structured programs
and the corresponding formal notation are to be introduced.
b) results:
It is proved constructively that any reducible flowgraph can be
represented by a quasi-structured program under the strong equivalence.
c) application:
There exists quite a natural way to represent quasi-structured
programs in the form of most comprehensible diagrams. Therefore
the concept may serve as a basis for further theoretical research
as well as for developing effective tools for quasi-structured
programming and software engineering.
2) sketchy modeling of computer texts, multiviewers goal:
The main domain of sketchy modeling techniques lays at the edge
of human-computer interaction - at the touching point where data
units of "common interest" must be clearly
"understandable"
both for human beings and computers. Such data form a huge application
area, including all kinds of computer texts-- program source texts
as well as any other textual user-written input data or user-read
output data. Therefore, it is desirable to develop modeling methods
offering a uniform and highly flexible frame-work for graphical
representing and handling computer texts' structures.
b) results:
Originated from previous theoretical and experimental work in
the field, a new project AmadeusJ was launched in 1998. It aims
to develop an integrated environment for handling sketchy texts,
i.e. computer texts modeled in accord with the sketchy text model.
Both multi-view and multi-base features are supported: graphical
views as well as base languages are considered as variable attributes
assigned to certain parts of text structures. The system is open,
allowing easily to add new views and base languages. The main,
summarizing publication: [125]
c) application:
Currently, the system is directly used in the teaching process
as well as an aid for preparing algorithm-related study materials.
3) molecular graph handling
a) goals:
Development of a computerized system for the storage, processing
and prognostication of data with orientation toward the use of
correlation equations.
c) application:
The system is in use at the University of Tartu.
Participants: Jüri Kiho, Mart Tudre, Roman Ustitsh.
Publications: [2,3,19,20,21,42,43,44,70,97,98,125].
Algebraic methods in Computer Science:
W-ring and acts over them, with applications to automata. An
W-ring is a universal algebra of signature W equipped with a binary
associative multiplication connected with operations in W by two-sided
distributivity. W-rings provide a natural
common generalization
of rings, semirings, distributive lattices, and semigroups.
We obtained several new constructions and results on W -rings
and acts over them. Special attention is devoted to W-rings with
hamiltonian W-algebras, which include the
classes of rings and
monoids. A construction of a semigroup W-ring
is defined. Using
this construction, the following generalization of a theorem by
P.M. Cohn is proved: every commutative W-ring
with zero such
that its W-algebra belongs to some hamiltonian variety can be
embedded into an W-ring where every element is either a unit
or a zero divisor. Also, the power series over an W-ring are
constructed. The classical W-ring of fractions
of an W-ring
is defined. We prove the possibility and uniqueness for the immersion
of an W-ring approximated by an inverse system
of congruences,
into the inverse limit of corresponding W-rings
of fractions.
We study two important properties of acts over W-rings - flatness
and projectivity.
By analogy with modules over a ring, tensor products have been
considered by many mathematicians for different autonomous (commutative)
varieties of algebras and various concepts of flatness have been
proposed for other algebraic structures. We consider tensor products
of acts over W-rings, the case that has not been settled before.We
investigate flatness and strong flatness for acts over W-rings
and prove a generalization of the Govorov-Lazard and the Stenström
theorems: an act over an W-ring is strongly flat if and only
if it is a direct limit of finitely
generated free acts. We also prove that under a natural restriction
on the underlying variety strong flatness of acts over W-rings
implies pullback flatness.
We also investigate projective acts over W-rings and describe
projective
acts by means of suitable chains of their retracts. The result
generalizes
Kaplansky's theorem: every projective module is M a direct sum
of countably generated submodules.
We apply the developed constructions on W-rings
and their
acts. to the automata theory. We consider W-machines in an arbitrary
variety A of commutative W-algebras. These machines are investigated
using W-rings and acts over them. W-machines include the case
of linear machines (when R is a ring) and the case of pure machines
(when A is a category of sets and R is a one-element monoid).
For universal W-machines, we prove that
Atm(
The recognizable subsets of free W-rings are
investigated. They are defined using W-automata
as recognizers. For a subset L of
a free W-ring, we define the Myhill and Nerode congruences and
prove a generalization of the well-known Myhill-Nerode Theorem.
Semirings constitute one of the most important special cases of
W-rings, because they have become an important tool in applied
mathematics and theoretical computer science. We describe projective
semimodules. The following generalization of Kaplansky's theorem
is proved: a semimodule is projective if and only if it is as
a retract of a direct sum of its countably generated projective
retracts with zero intersection. A sufficient condition for projectivity
of a semimodule by means of congruences is also given.
Also, we consider semimodules over commutative, additively idempotent
semirings. Using the construction of a derived act developed for
W-rings, we show that, for any nonzero commutative, additively
idempotent semiring, not all projective semimodules are free and
not all strongly-flat semimodules are projective.
If C is a monoidal category of acts over a commutative W-ring,
then there exists a monadic adjunction between C and its underlying
multicategory. Therefore the results and techniques developed
here may be useful for multicategories, as well. For example,
semimodules over a commutative semiring give a linear category
useful for several applications. Note that a certain linear category
(the so-called category of coherent spaces) has provided the first
semantics for linear logic.
Rewriting on semirings Modern algebra is interested not only
in the structural properties of the mathematical objects, but
also in performing computations in these structures. Term rewriting
provides one of the most successful approaches of symbolic computation.
Madlener and Reinert showed how congruences of monoids can be
characterized by ideals in corresponding monoid rings, and used
this method in order to transfer various facts on string rewriting
systems presenting monoids to the algebraic setting of subalgebras
and ideals in monoid rings. We generalize their result to monoid
and groupsemirings, and establish a connection between congruences
on free monoids and groups and its monoid and group semirings,
respectively This is a step towards polynomial rewriting on semirings
transferring well-known techniques of string rewriting systems
to the case of semirings, as well.
The aims of the proposed project are the following:
1. to develop rewriting techniques for free monoid and group semirings;
to cosider connections between of the word problem and the congruence
problem in the case of certain presentations such that free groups
and context-free groups;
2. to obtain algorithms for completion of rewriting systems and
to implement them in computer algebra systems (GAP);
3. to study the relation between the developed semirings rewriting
systems and various types of automata (such as Cayley graphs,
Petri nets).
Graph algebras Graph algebras make it possible to apply methods
of universal algebra to various problems of discrete mathematics
and operations research. We gave a complete description of all
graph algebras isomorphic to syntactic semigroups of languages.
We investigated three important properties of congruences on automata
introduced by Prof. R.Oehmke, which are analogues of semisimplicity
We established that every automaton defined by right multiplications
of each graph algebra satisfies all these three properties. We
also described all languages recognized by automata of this sort.
We are going to consider automata defined by left multiplications
in graph algebras, and describe languages recognized by these
automata in terms of combinatorial properties of words which belong
to these languages.
Cubic graphs. The study of computer networks and corresponding graph-theoretical notions has to be supported by developing some good constructions as well. Good means a collection of requirements such as reasonably small valency, small diameter and possibility to extend the graph retaining the desired properties. Part of this goal can be achieved demanding vertex-transitivity of the graph, extending the graph can be done by applying the permutation graph construction. In this research we have gone even further: a concrete family of graphs - the cubic graphs Qn - is specified. Several generalizations are treated and a common view to all these generalizations is given. In order to support the main arguments there are some additional concepts defined - distance enumerator and permutation product - having theoretical importance of their own as well.
Participants: Uno Kaljulaid, Olga Sokratova, Tiina Zingel, Vassili Garkusha, Jan Villemson.
Publications: [18,40,41,67,68,69,96,111,116,142,143,144,145,146,147,148]
Functional programming.
Our research efforts have been focussed on the comparison and systematization of existing generic formalizations of inductive and coinductive types and the associating terminating (co)recursions schemes and on the development of new ones, both in syntax-oriented type theory and with the help of more semantic category-theoretical tools. On the type theory side, we carried out a comparative study lambda-calculi with least and greatest fixedpoint operators and developed a taxonomy of eight tenable systems, whereof four were new, and studied their potential utility for program extraction. On the categorical logic side, we studied various terminating recursion and corecursion schemes and their properties: we developed categorical accounts for primitive corecursion (apomorphisms), course-of-value (co)iteration (histo- and futumorphisms) and studied the use of these constructions in program calculation. We proposed a new categorical semantics of (co)inductive types that is based on the concept of so-called Mendler-style algebras and generalizes the existing theory for types with mixed-variant base functor. Mendler-style algebras were also used for an alternative categorical coding of different recursion schemes. The results of these studies provided a basis for a doctoral thesis of Vene. Nestra wrote a master's thesis on the category-theoretic foundations of generic/polytypic programming.Participants: Varmo Vene, Härmel Nestra
Publications: [62,63,64,89,90,122,123,152,153,154]
Computational complexity, algorithmics and combinatorics.
The goal of combinatorial counting theory is to deduce a "closed
formula" for the given problem. It is easy for some problems,
a more sophisticated task for others and insurmountable for most
of the problems. In some cases the closed formula has been derived,
but it does not give any help for computing objects due to high
complexity of computations (see for example A. Kisielewicz's formula
for counting monotone Boolean functions - J. Reine Angew. Math
1988, 386, 139-144). It is more convinient in some cases to deduce
a logical description of the problem in the form of the parametrized
family of propositional formulae. Together with an algorithm for
counting solutions of propositional formulae, the logical description
can be used for calculations exactly as closed arithmetical formula
together with the rules of arthmetics. The goals of our group
are:
1. Deduce logical descriptions of various combinatorial problems.
2. Improve methods and algorithms for counting solutions of propositional
formulae
Results:
Given logical descriptions of meandric numbers and some chessboard
problems. A general method for the representation of the properties
of Boolean functions has been derived. Every Boolean function
of n variables can be represented by its truth-table, so we use
2^n propositional variables x_0,...x_n; one variable for each entry
of the truth-table. Using this encoding we can consider propositional
formulae with variables x_0,...,x_{2^{n}-1} as desriptions of the properties
of n-variable Boolean functions.There have been deduced logical
descriptions for classes of functions:monotone BF, antimonotone
BF, antichains, complements of antichains, fully-sensitive BF,
unate BF, symmetric BF, symmetrizable BF, homogenous BF, self-dual
BF, functions which are decomposable by given scheme.
Using a standard arithmetization argument, every logical description
can be performed as a closed arithmetical formula (for example
arithmetization of the logical descripton of the antichain gives
us exactly Kisielewicz's formula).
The formulae can be used as benchmark problems for counting programs.
Using these benchmarks many strategies of counting algorithms
were tested. The logical description of decomposability was used
for programming a decomposability test, which has been applied
in the morphological binary image processing project in cooperation
with professor Ian Paul William Sillitoe from Borås University
(Sweden).
For convenience of testing logical descriptions, a prototype of
special metacompiler, which translates parametrized description
of the family of propositional formulae into concrete formula
has been implemented. After refining it can became a useful tool
for satisfiability solver builders community.
Participants: Mati Tombak, Ain Isotamm, Tõnu Tamme, Olga Kislitsina, Reimo Palm, Jan Villemson, Albert Tumanov, Ahti Peder.
Publications: [13,32,59,95,117]
Compiler technology.
Working in the field of compiler construction starting from
the year 1981 J.Poial has investigated the problems of effective
intermediate code generation. The leader of the team this time
prof. M.Tombak has chosen the stack based language Forth to play
the role of an intermediate language in the compilers. Forth is
a widespread programming language that suites well for the specific
needs of code generation. The Forth-based compiler compiler called
TARTU has been developed by our team in years 1982 - 1992.
This project created interest in the formalisation of semantics
of stack based languages. In the year 1986 J.Pöial wrote
his PhD thesis on the formal specification of Forth-programs (defended
in 1987). This work has been of interest at EuroFORTH'90 conference
and new fields of application of this theory have been discovered.
The same topic has been later investigated by W.Stoddart and P.Knaggs
from UK proceeding from J.Poial's original problem formulation
and results. We have worked on this topic together until year
1994. The similar research has been carried out by German scientist
U.Hoffmann. We all have presented our results on EuroFORTH conferences
1991, 1993, 1994. Starting from this time J.Poial has interest
to the formal description of the set of so-called correct programs.
New motivation to develop this theory is related to the popularity
of Java programming language because the Java virtual machine
is a stack based machine. In 1997 J.Poial has published a paper
on verification of Java bytecode. In this work one particular
case was investigated where the language of correct programs in
sense of semantics of stack operations is expressed as a system
of so-called syntactic equations.
Traditional formal methods of syntax description for programming
languages (e.g. context free grammars) are not always convenient
for practical applications. In some cases the language has quite
a weak syntactic structure and it is better to describe the correct
programs using semantics of operations instead. There exists a
class of widespread languages in practice that use stack machines
for the interpretation of programs, the so called stack based
languages (Java virtual machine language, Forth, Postscript, etc.).
Semantics of stack operations determines the language of correct
programs in sense of parameter passing through the stack This
is one alternative method to define the syntax of a stack based
language. The main question is whether there exists a better way
of defining the same language.
Systems of syntactic equations (general rewriting rules) on sequences
of stack operations have been investigated. Stack operations have
a certain effect on the stack that can be described using input
and output parameters. Stack effect calculus allows us to define
the language of correct sequences of stack operations (programs).
It is important to know under which conditions the system of syntactic
equations and the set of stack effects define the same language,
because both methods seem to work better for stack based languages
than context free grammars.
A generalization of Ogden's lemma has been proved for generalized bracket grammars. As a consequence of this result it has been proved, that the Lyndon's language is not representable by generalized bracket grammar. The result is quite interesting, because only in 1997 non context-freeness of Lyndon language was proven.
Participants: Jaanus Pöial, Mati Tombak, Uno Kaljulaid, Peeter Laud.
Publications: [11,12,55,94,103,104,113]
Compiling lexicons, dictionaries and encyclopedias.
Four books, about 900 pages alltogether have been published.
Participants: Ülo Kaasik, Jüri Kiho
Publications: [1,46,66,126,155]