SOFSEM96

Jan Staudek (staudek@informatics.muni.cz)
Fri, 15 Mar 1996 20:01:56 +0100

CALL FOR PAPERS

+------------------------------------------------------------+
| SOFSEM'96 |
| |
| XXIII-rd Seminar on Current Trends |
| in Theory and Practice of Informatics |
+------------------------------------------------------------+

November 23 - November 30, 1996
Hotel Devet-skal, Milovy Czech Republic

------------
Organized by
------------
Czech ACM Chapter,
Czech Society for Computer Science,
Czech Research Consorcium on Informatics and Mathematics,
Institute of Computer Science, Academy of Sciences of Czech Republic,
Masaryk University,
SERC Rutherford Appleton Laboratory,
Slovak Society for Computer Science

-------
Subject
-------
SOFSEM (SOFtware SEMinar) is an eight-day international seminar
devoted to the theory and the practice of software systems. Its program
consists of a series of invited talks given by prominent academic
professionals and researchers. Contributed talks and posters of
participants are also included in the program of SOFSEM. The working
language is English.
-------------------------------
the series "Lecture Notes in Computer Science" and distributed at the
seminar.

+----------------------------------------------------------------------+
| Sofsem'96 is the 23rd in the series of Sofsem seminars held annually.|
| It is intended to foster cooperation among people working in various |
| areas of computer science. Its scientific program offers a unique |
| opportunity to gain a relatively quick and representative |
| overview about the selected parts of computer science, |
| presented by top researchers. |
| Its social program provides an optimal framework for discussions, |
| meetings, contact establishing, and socializing. Especially suited |
| for PhD students and young computer scientists. |
+----------------------------------------------------------------------+

=================
Topics
Program Committee
Program - Abstracts, CVs
INVITED TALKS
Submissions
Contributed Talks
Posters
Fees
Cancellation
Financial support
Exhibitions
Culture Program
Local Arrangements
Sofsem www-page
Venue
Registration
REGISTRATION FORM AND PAYMENT NOTICE
History
One-sheet LaTeX form of CALL FOR PAPER

------
Topics
------
A. Fundamentals
B. Parallel and Distributed Computing
C. AI and Control Systems
D. Databases and electronic documents
E. Programming and SE
F. Scientific Computing and Visualization

--------------------------------------------------------------------------
There is an one-sheet LaTeX form of CALL FOR PAPER at the end of this call
--------------------------------------------------------------------------
-----------------
Program Committee
-----------------
K. G. Jeffery, Chair, (RAL, Oxon, UK),
J. Kral, Co-Chair, (Charles University, Prague, CZ),
P. Asirelli, (I.E.I. - C.N.R., I),
P. Y. Bartos, (SOFTEC, Bratislava, SK)
P. Hajek, (Academy of Science,Prague, CZ),
V. Hlavac, (Czech Technical University Prague, CZ),
J. Grimson, (O' Reilly Institute Trinity College Dublin, IR),
P. Jancar, (Ostrava University, CZ),
M. Kersten, (CWI Amsterdam, NL),
J. Kohoutkova, (Masaryk University, Brno, CZ)
M. Kretinsky, (Masaryk University, Brno, CZ),
L. Matyska, (Masaryk University, Brno, CZ)
A. Micovsky, (SOFTEC spol. s.r.o, Bratislava, SK),
H. Moessenboeck, (University of Linz, A),
L. Motyckova, Secretary (Masaryk University, Brno, CZ)
M. Neilsen, (Aarhus University, DK),
N. Paton, (University of Manchester, UK),
J. Pavelka, (DCIT, Prague, CZ),
F. Plasil, (Charles University, Prague, CZ),
I. Privara, (Institute of Informatics and Statistics, Bratislava, SK)
J. Pokorny, (Charles University, Prague, CZ),
S. Robinson, (RAL, Oxon, UK),
B. Rovan, (Comenius University Bratislava, SK)
H. Siegelmann, (Technion Haifa, Izrael),
S. Shrivastava, (University of Newcastle upon Tyne, UK)
A. Solvberg, (University of Trondheim, N)
J. Staudek, (Masaryk University, Brno, CZ),
G. Tel, (Utrecht University, NL),
J. Valenta, (DCIT, Prague, CZ),
M. Vajtersic, (Academy of Sciences, Bratislava, SK)
J. Wiedermann, (Academy of Sciences, Prague, CZ),
P. Zemcik, (Technical University Brno, CZ),
J. Zlatuska, (Masaryk University, Brno, CZ),

--------------
--------------
D. Bjorner, (UN University, IIST, Macau),
P. van Emde Boas, (CWI Amsterdam, N),
M. Broy, (TU Munich, Germany),
M. Chytil, (Arthur D.Little Int., Prague, CZ),
G. Gottlob, (TU Vienna, A),
K. G. Jeffery, (RAL, Oxon, UK),
M. Zemankova, (NSF, Washington DC, USA)

------------------------
Program - Abstracts, CVs
------------------------

----------------

Kurt Bauknecht, the IFIP President,
Institut fur Informatik, Universitat Zurich, Switzerland

Contributions from professional organisations like IFIP, the
International Federation for Information Processing, to the Advances in
Informations Technology.

INVITED TALKS
-------------

A. Fundamentals:
----------------

Ricardo Baeza-Yates, Polytechnic Univ. of Catalunha, Barcelona, Spain
A Unified View Of String Matching Algorithms

We present a unified view to sequential algorithms for many pattern
matching problems, using a bit-wise simulation of a non-deterministic
finite automaton (NFA) built from the pattern which uses the text as
input. This approach gives very fast practical algorithms which have
good complexity for small patterns on a RAM machine with word length
O(log n).

Ricardo Baeza-Yates received his Ph.D. in CS form the U. of Waterloo,
States award for young researchers in exact sciences. Currently he is
full professor at the CS department of the University of Chile. His
reserch interests include algorithms and data structures, text
retrieval, graphical interfaces and visualization applied to databases.
..........................................................................

Friedhelm Mayer auf der Heide, University of Paderborn, Germany
Communication in Parallel Systems

The talk covers two basic communication issues in parallel computing:
Routing in networks, and data organization in distributed memory
machines. The first part, Routing in Networks, surveys the current
research on efficient routing protocols for store-and-forward and
wormhole routing. In particular, universal routing protocols that work
well for wide classes of networks are considered. The second part, data
organization in distributed memory machines, surveys hashing techniques
for simulating shared memory, using redundant representation of the data.

Friedhelm Meyer auf der Heide finished his PhD in 1981 in Bielefeld,
and his Habilitation in 1986 in Frankfurt. From 1980 to 1986 he was
assistant at the CS department in Frankfurt, with one year on leave at
the IBM Almaden Laboratory in San Jose. From 1986 to 1989 he was
professor at the CS department in Dortmund, scince then he is full
professor at the CS department in Paderborn. His research interests
include parallel algorithms and architectures, randomized algorithms,
and lower bound techniques.
..........................................................................

Felipe Cucker, Universitat Pompeu Fabra, Barcelona, SPAIN
Computing With Real Numbers
..........................................................................

Paul Vitanyi, CWI & University of Amsterdam
Introduction to Kolmogorov Complexity and Its Applications

Kolmogorov complexity is a modern notion of randomness dealing with the
quantity of information in individual objects. A new mathematical proof
technique was developed, now known as the incompressibility method'.
The incompressibility method is a basic general technique such as the
pidgeon hole' argument, the counting method' or the probabilistic
method'. Kolmogorov complexity was proposed by A.N. Kolmogorov to
quantify the randomness of individual objects in an objective and
absolute manner. Likewise, the Kolmogorov complexity of an object is a
form of absolute information of the individual object. Applications of
Kolmogorov complexity by us and others have been given in a plethora of
areas.

Paul Vitanyi heads the Algorithms and Complexity research group at CWI,
and is Professor of Computer Science at the University of Amsterdam He
is a member of the Dutch Institute for Programming research and
Algorithmics (IPA), and the Institute for Logic, Language and Computation
(ILLC) and the Dutch Graduate School in Logic (OzsL)
..........................................................................

B. Parallel and Distributed Computing
-------------------------------------

Vinny Cahill, Trinity College Dublin, Ireland
Object-Oriented Approaches to Flexibility in System Software

This presentation will begin by reviewing recent research into flexible
system software with an emphasis on systems that have employed
object-oriented approaches such as the use of frameworks or meta-object
protocols. We will then describe how these techniques have been employed
in the Tigger project at Trinity College to develop a family of
object-support operating systems intended for use in a variety of
distributed applications ranging from embedded soft realtime systems to
concurrent engineering environments. Some of the novel features of
Tigger including its use of framework technology, a distributed shared
memory (DSM) system supporting a new approach to consistency
maintenance, and the use of meta-object protocols to allow system
behaviour to be altered at run-time will be described.

Vinny Cahill is a lecturer in Computer Science at Trinity College
Dublin. As a member of the Distributed Systems Group, he has been
conducting research into system and language support for object-oriented
distributed programming for a number of years. He is currently applying
this research to areas such as the development of distributed virtual
worlds and concurrent engineering environments.
..........................................................................

Daniel Hagimont, INRIA Rhone-Alpes/ Bull-IMAG Systemes, France
Arias: A Distributed Shared Memory System Integrated with Unix

The goal of the Arias project is to provide extensions to Unix, that
support distributed environments. These extensions should at the same
time allow distributed applications to share data, allow protection of
shared data, and allow data to be stored permanently (i.e., stored on
secondary storage). The Arias system builds on a unique virtual address
space, where each object is named by the same virtual address on all the
machines in the system. Data is duplicated on all sites that share it,
and coherency is guaranteed on the basis of zones (a consecutive number
of bytes), according to an coherency protocol. Protection is based on
the notion of capabilities and protection domains.

Daniel Hagimont is "Charge de Recherche" (research scientist) at INRIA
Rhone-Alpes (Grenoble). He received his PhD from Institut National
Polytechnique de Grenoble in 1993. In 1993-94, he held a post-doctoral
position at the University of British Columbia (Vancouver, Canada). He
is currently a member of the Sirac project at INRIA, Grenoble, where he
leads a group working on distributed shared memory.
..........................................................................

Jan Kleindienst, Frantisek Plasil, Petr Tuma, Charles University,
Academy of Sciences, Prague, Czech Rep.
On the Role of Object Services in CORBA

The main intention of this contribution is to provide the readers with
the fundamental knowledge of Common Object Request Broker Architecture
(CORBA) with an emphasis upon one of its basic components: CORBA Object
Services (COSS). The brief history of CORBA development from CORBA 1.1
to CORBA 2.0 supporing interoperability features is given. Key concepts
specified in CORBA 1.1 and CORBA 2.0 are reviewed: Interface Description
Languge (IDL), client stub, server skeleton, Basic Object Adapter (BOA),
Internet Inter-ORB Protocol (IIOP), request-level bridging and inline
bridging. Based on OMG series of Requests for Proposal (RFP), the
evolution of enlarging the family of CORBA Object Services is analyzed
and commented.

Jan Kleindienst works at the Institute of Computer Science, Czech
Academy of Sciences, Prague and makes his PhD studies at the Charles
University, Prague.
Frantisek Plasil is an associated professor of Computer Science and the
vice-chair to the Department of Software Engineering at the Charles
University, Prague. From 1989 to 1991 he was a visiting professor in
Department of Mathematics and Computer Science, University of Denver.
His recent research interests included programming languages and
compiler construction.
Petr Tuma is a PhD student in the Department of Sofware Engineering at
the Charles University in Prague.
..........................................................................

C. AI and Control Systems
-------------------------
Eric Horvitz, Microsoft Research,Redmond Washington, USA
Decision-Theoretic Reasoning and the Human-Computer Interface:

Recent advances in the use of automated decision-theoretic reasoning to
enhance the human-computer interface will be presented. First, Bayesian
networks and influence diagrams will be reviewed and how these graphical
knowledge representations can be used in systems that compute beliefs
and actions will be described. Following a brief survey of work in
decision-theoretic reasoning, principles and applications of embedded
decision-theoretic agents will be presented. Key concepts in the
contexts provided by the Vista and Lumiere projects will be introduced.
The Vista project centered on building an intelligent interface to
assist NASA Mission Control flight engineers with managing the
complexity of information about Space Shuttle propulsion systems in
time-critical contexts.

Eric Horvitz is a Senior Researcher in the Decision Theory Group at
Microsoft Research and an Affiliate Associate Professor at the University
of Washington. He received a PhD and MD at Stanford University. His
current interests include decision-theoretic models of problem solving
and applications of probability and utility to solve problems in
time-critical decision making.
..........................................................................

Mark Overmars, Utrecht University, The Netherlands
Probabilistic Approaches to Motion Planning

In recent years many different approaches to motion planning have been
suggested. In this talk we describe a new, probabilistic paradigm for
solving the motion planning problem, which proves to be very
time-efficient for a great variety of robots. An advantage over existing
methods is its generality. There are only a few components that are
robot specific, and these are, as will be pointed out, easy to
define/implement. Furthermore, it is a learning approach, that is, it
builds data-structures that, once constructed, can be used for
retrieving arbitrary paths quasi-instantaneously. The power of the
method will be demonstrated both by theoretical results and experimental
results.
..........................................................................

Dan Roth, Weizmann Institute of Science, Israel
Learning in Order to Reason

While the central role of learning in cognition is acknowledged by
many, most lines of research nevertheless study reasoning phenomena
separately from learning phenomena. We present a new framework for the
study of reasoning, in which a learning component has a principle role.
The Learning (in order) to Reason approach combines the interfaces to
the world used by known learning models with the reasoning task and a
performance criterion suitable for it. In particular, we show cases
where simultaneously (1) reasoning from a given representation of the
world is intractable, (2) learning representations of the world is
intractable, but (3) directly learning to reason about the world is
feasible.

Dan Roth received his Ph.D. in Computer Science from Harvard University
in 1994. From 1981 until 1990 he was a software engineer and researcher
for the Israeli Defense Forces -- R&D Unit and is now on the faculty at
the Weizmann institute of Science, Israel. Interested in theories of
learning and inference and in particular in developing an understanding
of how learning supports other high level cognitive tasks.
..........................................................................

D. Databases and electronic documents
-------------------------------------
Jaroslav Pokorny, Charles University, Prague, Czech Rep.
Database Semantics In Heterogenous Environment

The notion of attribute is presented as a universal construct for
describing conceptual and database models. Unifying tools based on the
typed lambda calculus give possibilities to define appropriate notions
for expressing an equivalency of schemes in different models. Moreover,
the expressiveness of conceptual and data models is defined and compared
to the recent approaches. A taxonomy of conceptual and database models
based on these notions is proposed. Particular models will be compared
with respect to their expressiveness. Finally, a method for integrating
heterogeneous environment is designed. Practical consequences of the
theory developed could help in constructing so called co-operative
information systems as well as in transforming user requirements between
two different kinds of information environment.

Jaroslav Pokorny received the Ph.D. degree in theoretical cybernetics
from the Charles University, Prague, Czechoslovakia, in 1984. Currently
he is an associate professor of the Faculty of Mathematics and Physics
at Charles University and head of its Department of Software
Engineering. His research interests include also database design,
information retrieval and software engineering methods.
..........................................................................

Ken Robinson, RAL, Oxon, UK
Business Case Processing - Rationale, Survey and Trends

Modern businesses are increasingly under pressure to improve
competitiveness. In recent years, it has been realised that a
significant way to improve effectiveness is to identify and optimise the
key processes that organisations undertake to achieve their business
objectives. One element that is often important is IT support, and one
important aspect of modern IT support is business case processing (often
called workflow). This talk will cover:
- Why process is important to organisations.
- A survey of available business case processing/workflow systems,
highlighting those features which are most significant.
- A description of the results of a recent European project to develop
a state of the art business case processing system.

Ken Robinson runs User Interface Design Group at the Rutherford
Appleton Laboratory in the UK. Originally trained as a physicist, he soon
gravitated to computing and has worked in a number of areas. For the
last 15 years, he has been working with user interfaces for
highlyinteractive systems, with application to real-world applications.
Recent projects have included both formal and informal business case
processing/workflow systems.
..........................................................................

Arno Siebes, CWI, The Netherlands
The KESO project: towards an inductive query language system.

State-of-the-art Data Mining technology offers a toolbox of algorithms
and techniques developed for precisely defined applications. The usage
of data mining technology requires therefore an intimate knowledge of
this field. The KESO-project will develop a data mining system that is
applicable for a wide variety of data mining problems by domain experts
rather than data mining specialists. In the first part of this talk I
will present an overview of the current state-of-the-art in data mining.
The second part of the talk presents an overview of the KESO project:
what are the concepts underlying its inductive query language'', how
is it related to current algorithms, and how can it be implemented
efficiently?

Arno Siebes received his his Ph.D. in Computer Science in 1990 from
Twente University. His research interests are the semantics of
Object-Oriented databases, the integration of database schema's, active
databases, and data mining. Currently he leads both the data mining
project at CWI and the ESPRIT-IV project KESO.
..........................................................................

E. Programming and SE
---------------------
David Harel,The Weizmann Institute of Science, Israel
Statecharts: Past, Present And Future

This will be an informal talk about the graphical specification
language of statecharts, and the related STATEMATE system. Some of the
issues that arose in developing the language and the tool will be
discussed from both personal and technical points of view. A number of
research areas that have evolved from this work in the 12 years since
the language was proposed will be discussed. Time permitting, recent
work on a version of statecharts tailored for object-oriented
development will be described too.
..........................................................................

Arie de Bruin, Erasmus University, Rotterdam, The Netherlands
New Trends in Game Tree Search

In this talk we consider algorithms that search game trees, defined by
full information zero sum games, like chess, checkers and the like. In
such a tree the nodes are board positions and there is an edge between
two nodes of a move from the position corresponding to the source node
results in the position corresponding to the target node. Almost every
game tree search algorithm computes the so called minimax value of the
root position which is defined as the value of the end position that the
first player will obtain under optimal play of both adversaries.
..........................................................................

Jeremy Dick,B-Core, Oxford, UK
VDM Through Pictures: A Visual Approach to Formal Specification

One of the strengths of structured methods in software engineering is
their use of diagrams to visualize the structure of a system. By
contrast, the use of formal notations, does not provide a good medium
for communication with the non-mathematician. The aim of the work
reported here is to combine formality with visual appeal, to alleviate
the communication problem with the non-specialist, and to accelerate the
Entity-Relationship, Data-Flow and State-Transition diagrams are
discussed in relation to VDM, and two new kinds of diagram are proposed
as more appropriate to the underlying expressiveness of VDM.
..........................................................................

Paul Klint, CWI, Amsterdam, The Netherlands
Core Technologies for System Renovation

Maintenance, migration and renovation are becoming the predominant
concerns of the large users of software in business and industry. How
can problems in these areas be addressed from a software engineering
perspective? First, the need for system renovation will be explained and
an outline of the problems and opportunities involved will be given.
Next, an incremental renovation strategy that is based on two
complementary technologies will be sketched: abstract datatypes as a
basis for generic program manipulation tools and processes as the
foundation for coordination languages.
..........................................................................

F. Scientific Computing and Visualization
-----------------------------------------
Henk A. van der Vorst,University of Utrecht, The Netherlands
Iterative Methods For Nonsymmetric Systems

Iterative solution methods are very attractive for classes of very
large linear systems, for which direct approaches are impractical
because of CPU- and computer memory requirements. We will present an
overview of a number of related modern iterative methods for the
solution of unsymmetric linear systems of equations. Some more attention
will be given to modern hybrid methods, such as Bi-CGSTAB, Bi-CGstab(l),
and GMRESR. Iterative methods are often used in combination with
so-called preconditioning operators (approximations for the inverses of
the operator of the system to be solved) in order to speed up
convergence. In our lectures we will also discuss general implementation
aspects of iterative methods.
..........................................................................

Gitta Domik, University of Paderborn, Germany
Computer Visualization

The challenge of a new, fundamental approach to building visuali-
zation systems finds currently much resonance in the computer science
community. The rendering pipeline used as a fundamental concept in
computer graphics systems is found to be inadequate for visualization
systems. The need for optimizing cost factors, such as storage size
(large search spaces needed) or the time needed for human
decision-making based on large, complex information structures, has to
be recognized. Partial answers are being found in the use of new
paradigms, such as the paradigm of information workspaces; in the use of
intelligent agents to apply contraints to the mapping process; or in the
formulation of hardware requirements to support adequate user
interaction.

Gitta Kienegger-Domik is Professor at the University of Paderborn,
Department of Mathematics and Computer Science. Her M.Sc. at the Graz
University of Technology (Austria) in 1981 was followed with a Ph.D. at
the same University in 1985. Her research interests are in the area of
visualization concepts and techniques, user interface design, and
scientific data analysis.
..........................................................................

-----------
Submissions
-----------
The categories for submissions include Contributed Talks and Posters.
Each submission should have a title giving the following information:
- specification of one of the authors as the contact person.
Please send five printed copies or a postscript file for each
submission.

Contributed Talks
-----------------
8-page drafts in English are expected. A full camera-ready copy of
contributed talks on current topics in Computer Science should be no
longer than 8-pages. Presentation time for contributed talks is 25
minutes. Contributed talks will be included in the Proceedings of SOFSEM
'96, published in the Lecture Notes in Computer Science series by
Springer-Verlag.

The Organizing Committee will supply the authors of accepted contributed
talks with a leaflet of detailed technical instructions and the LaTeX
style file for the preparation of the camera-ready copy.

Posters
-------
We actively encourage poster describing work in progress. Final
versions of two A4 page poster are expected.

---------
Submission of the contributed talk/poster May 15, 1996
Notification of acceptance/rejection July 30, 1996
Camera-ready copy of the contributed talk Sept. 1, 1996

---------------
---------------
Submissions, all communications and enquires should be adressed to:

Lenka Motyckova
Faculty of Informatics
Masaryk University
Botanicka 68a, 602 00 Brno
Czech Republic
e-mail: lenka@informatics.muni.cz

----
Fees
----
Total cost covers the organizational expenses, accommodation, and meals
for the whole (eight-day) seminar as well as the Proceedings:

Early payment (by 1st September 1996) (Kc stands for Czech Crowns)
---------------------------------------------------------------------
type single_room double_room Explanation
of fee
---------------------------------------------------------------------
S0 *) 6 360 Kc 5 000 Kc total costs for CZ ACM, CIS, SIS
S1 6 860 Kc 5 500 Kc total costs for CZ/SK participants
S2 **) 295 USD 240 USD total costs for others ACM members
S3 315 USD 260 USD total costs for others
---------------------------------------------------------------------
*) only for members of CZ ACM, Czech Informatics Society (CIS) and
Slovak Informatics Society (SIS),
**) only for other ACM members,

Important!
The early prices specified above are only valid until 1st September.
After September 1, the prices are increased by 1 300 Kc / 50 USD.
==================================================================

Banking : Ceska sporitelna Brno - mesto, Brno, Czech Rep.
Account Name : Ceska informaticka spolecnost, pobocka Brno
Account Number : 6851659-628/0800
Details of Payment: Fill in your name and affiliation.

------------
Cancellation
------------
Before 1-st November, 80% of the total cost will be refunded;
after 1-st November, 50% of the total cost will be refunded.
No refund will be made once the seminar has started.

-----------------
Financial support
-----------------
You may apply for financial support to partially cover your
accommodation expenses. A strong preference will be given to
talks and/or posters have been accepted. Your application for financial
support must reach the Organizing Committee by 1-st August. We will let
you know by 15-th August whether requested support will be granted for
you.

-----------
Exhibitions
-----------
Organizations and individuals are invited to participate with
demonstrations of non-profit research results and literature
exhibitions. Please submit a description of the demonstration and
responsibility of the demonstrator to provide suitable equipment.
Organizations are invited to submit exhibitions of commercial software
systems, organisation profiles, literature exhibitions, etc. Exhibitors
should contact the following address for further details:

J. Staudek - SOFSEM '96
FI MU Brno
Botanicka 68a
602 00 Brno
Czech Republic
phone: +42-5-4151 2354
FAX: +42-5-4121 2747
e-mail: staudek@fi.muni.cz

---------------
Culture Program
---------------
Jaroslav Cejka, Ivan Dominak, Dump Show, Jazz Quartet

------------------
Local Arrangements
------------------
sofsem@ics.muni.cz

---------------
Sofsem www-page
---------------
http://www.ics.muni.cz/sofsem/sofsem.html

-----
Venue
-----
The winter school will be held at the Hotel Devet-skal (Nine Rocks),
Milovy. The hotel is located in the Bohemian-Moravian Highlands (central
part of the Czech Republic) near the town of Zdar nad Sazavou. The
recreation facility offers swimming pool, sauna, fitness centre,
day-club, coffee-rooms, and other services. The location is easily
accessible from airports at Prague or Vienna (2-3 hours by car, bus or
train).

------------
Registration
------------
To register, please mail the filled-in registration form and the

Z. Walletzka, SOFSEM '96
UVT MU, Botanicka 68a,
602 00 Brno, Czech Republic
phone: +42-5-4121 1646
fax: +42-5-4121 2747
e-mail: sofsem@ics.muni.cz

========================================================================

REGISTRATION FORM AND PAYMENT NOTICE

Z. Walletzka --- SOFSEM '96
UVT MU
Botanicka 68, 602 00 Brno
Czech Republic
fax: +42-5-4121 2747
e-mail: sofsem@ics.muni.cz

Family name (Mr, Ms) : ........................

First name: ........................

Affiliation: ........................

Current position: ........................

Phone: ........................

E-mail: ........................

Amount of Payment: ........................

Date of Payment: ........................

Details of Payment: ........................

Single or Double Room: ........................

Vegetarian Meals: YES NO

Type of Fee: S0 S1 S2 S3

ACM member number: ........................

Member of CIS/SIS YES NO

Passport: ........................
(CZ/SK participants
"rodne cislo / COP" ........................)

........................

Date: ........................

=====================================================================

--------
ApS Brno, s.r.o., Digital Equipment, s.r.o., Help Service, s.r.o.,
Hewlett Packard, s.r.o, IBM CR, s.r.o., Oracle Czech, s.r.o.,
Prington, a.s., financial leasing

-------
History
-------
SOFSEM is a seminar with a long term tradition that has been evolving
into its present form for more than 20 years. Soon after its
establishing in 1974 SOFSEM became the foremost Czechoslovak seminar
devoted to theoretical and practical problems of software systems. In
fact, during those early days of computer science and technology SOFSEM
supplemented the university education and academic research by mediating
a fast transfer of the latest relevant knowledge to the SOFSEM audience.
Traditionally, this audience consisted of university professors,
professionals from the field. First local and later on also
international experts have been invited. Each of them was to present a
series of lectures related to some recent topics in computer science.
The basic format of each SOFSEM consisted of several series of invited
talks. Each of them had the duration of 3 to 5 hours. This was
complemented by selected contributions of participants presented during
two half-days in two parallel sessions. Until 1994, the total duration
of SOFSEMs was two weeks.

The most substantial changes concerning SOFSEM have been realized after
the 'velvet' revolution in Czechoslovakia in 1989. By that time, SOFSEM
has subsequently transformed from a mainly national seminar into a truly
international conference. In 1993, an international advisory board was
created to provide assistance to the program committee in the
preparation of a scientific program. Beginning with SOFSEM'95, after two
years of exhaustive discussions SOFSEM was shortened to eight days while
almost preserving the number of invited lectures. At the same time
SOFSEM proceedings now appear as a volume in the Springer Verlag series
Lecture Notes in Computer Science. Also after the split of
Czechoslovakia in 1993 it is still assumed that SOFSEM will continue to
be held in either the Czech Republic or the Slovak Republic.

Thus, through its numerous invited papers and selected contributed
papers as well as its excellent working atmosphere, the current SOFSEM
is a mix of a winter school, a conference, and an advanced workshop.
Driven by an international advisory and endowment boards and
international program committe in reflecting the recent trends both in
theory and practice, the current SOFSEM prolongs its tradition in
striving for multidisciplinarity and generalizations in informatics. At
the same time it intends to foster international co-operation among
professionals working in various areas of computer science.

===========================================================================

One-sheet LaTeX form of CALL FOR PAPER follows:

===========================================================================
\documentclass[10pt]{article}
\setlength{\textwidth}{160mm}
\setlength{\textheight}{220mm}
\setlength{\oddsidemargin}{0mm}
\pagestyle{empty}
\newsavebox{\savepar}
\newenvironment{boxit}{\begin{lrbox}{\savepar}
\begin{minipage}[b]{135mm}}
{\end{minipage}\end{lrbox}\fbox{\usebox{\savepar}}}

\begin{document}
\parbox{20mm}{
\noindent
\begin{picture}(52,20)
\multiput(8,1)(0,22){2}{\circle*{16}}
\multiput(24,-6)(0,22){2}{\rule{38\unitlength}{14\unitlength}}
\end{picture}}
\parbox{140mm}{
\begin{center}
{\Large\textbf{CALL FOR PAPERS -- {\Huge\textbf{\textsf{SOFSEM '96}}}}}
\\[1ex]
{\large\textbf{XXIII-rd Annual Winter School on \\Current Trends
in Theory and Practice of Informatics}\\[1ex]
\textbf{November 23 -- 30, 1996, Milovy, Czech Republic}}
\end{center}
}
\begin{center}
\noindent
{\footnotesize \textbf{Organized by}\\[0.5ex]
Czech ACM Chapter, Czech Society for Computer Science, Czech Research
Consorcium on Informatics and Mathematics,\\
Institute of Computer Science, Academy of Sciences, Masaryk University,
SERC Rutherford Appleton Laboratory, \\[-0.7ex]
Slovak Society for Computer Science}
\end{center}

\noindent SOFSEM (SOFtware SEMinar) is an international winter school
devoted to the theory and the practice of software systems. Its program
consists of a series of \textbf{invited talks} given by prominent
academic professionals and researchers. \textbf{Contributed talks} and
\textbf{posters} of participants are also included in the program of
SOFSEM. The working language is English. Invited talks and contributed
in Computer Science} and distributed at the seminar. SOFSEM is intended
to foster cooperation among people working in various areas of computer
science. Its scientific program offers a unique opportunity to gain a
relatively quick and representative overview about the selected parts of
computer science, presented by top researchers.
\begin{description}
\setlength {\itemsep}{-0.5ex}
\setlength {\topsep}{-0.5ex}
\item[Topics:] Fundamentals, Parallel and Distributed Computing, AI and
Control Systems, Databases and Electronic Documents, Programming and
SE, Scientific Computing and Visualization
\item[Advisory Board:] D. Bj{\o}rner, P. van Emde Boas, M. Broy, M.
Chytil, G. Gottlob, K. G. Jeffery, \\ \mbox{M.~Zemankova}
\item[Program Committee:]\textbf{\emph{K. G. Jeffery, Chair, J. Kral,
Vice-Chair}}, P. Asirelli, P. Hajek, V. Hlavac, J.~Grimson, P.
Jancar, M. Kersten, J. Kohoutkova, M. Kretinsky, L. Matyska, A.
Micovsky, H.~M\"{o}ssenb\"{o}ck, L. Motyckova, M. Neilsen, N. Paton,
J. Pavelka, F. Plasil, I. Privara, J. Pokorny, S.~Robinson, B.
Rovan, H. Siegelmann, S. Shrivastava, A. Solvberg, J. Staudek, G.
Tel, J.~Valenta, J.~Wiedermann P. Zemcik, J. Zlatuska
\item[Submissions / Contributed Talks:] Papers of original research on
current topics in Computer Science are solicited. A postscript files of
8-page draft in English are expected. Presentation time for
contributed talks is 25 minutes.\\[0.5ex] Each submission should start
with the title of the paper, author(s)' name(s) and affiliation e-mail
address, a short abstract and specification of one of the authors as
the contact person. Paper submissions are also possible: Please send
five printed copies for each submission.\\[0.2ex] Unprintable
postcript files and late submissions will be rejected.
\begin{center}
\begin{boxit}
\begin{description}
\setlength {\itemsep}{-0.5ex}
\setlength {\topsep}{-0.5ex}
\item Submission of the contributed talk/poster: \hfill \textbf{May
15, 1996},
\item Notification of acceptance/rejection: \hfill \textbf{July 30,
1996},
\item Camera-ready copy of the contributed talk: \hfill \textbf{Sept.
1, 1996}.
\end{description}
\end{boxit}
\end{center}\ \\[-4ex]
\item[Contact Address:] Lenka Motyckova, Faculty of Informatics,
Masaryk University, \\
\hspace*{24mm}Botanicka 68a, 602 00 Brno, Czech Republic,\\
\hspace*{24mm}e-mail: \texttt{lenka@informatics.muni.cz}
\texttt{sofsem@ics.muni.cz}
\item[Sofsem www-page:]
\texttt{http://www.ics.muni.cz/sofsem/sofsem.html}
\item[Conference Chair:] J. Staudek (\texttt{staudek@fi.muni.cz})
\end{description}

\noindent
\begin{center}