BISS 2006: Bertinoro International Spring School for Graduate Studies in Computer Science 6-17 March 2006 University of Bologna Residential Center Bertinoro (Forlì), Italy

[ Courses and Lecturers
| Important Dates
| Location
| How to Reach Bertinoro
| Registration
| List of Participants
| Financial Sponsorship
| Organization
| LocalWeather Forecast ]

The school will offer 4 courses each consisting of 15 hours of lectures:

• Access Control Systems for Database Systems, Prof. Elisa Bertino (Purdue University)
• Calculi and Languages for Distributed Mobile Computation, Prof. Rocco De Nicola (Università di Firenze)
• Implicit Computational Complexity, Prof. Simone Martini (Università di Bologna)
• Data Mining, Prof. Rosa Meo (Università di Torino)

The registration fee for the School is 750,00 Euro and includes all local expenses from the evening of 5 March to mid-day on 17 March including all meals and on-site lodging in double-occupancy rooms. Attendance is limited to 50 students and will be allocated on a first-come-first-served basis. All applicants must complete a Registration Form by 20 February 2006.

Courses and Lecturers

Summary:

The first part of the course will review basic notions of access control and will present the most significant models (DAC, MAC, Chinese Wall, RBAC).

The second part will focus on access control for relational database systems. The access control of System R will be presented together with relevant extensions, such as positive/negative authorizations and non-cascading revoke operations.

The third part will focus on access control for advanced data management systems, like complex object data management systems and XML data. The Author-X model will be discussed in details, including an encryption-based access control model used for push-based information dissemination and an architecture for secure-third party publishing of XML data.

The fourth part will focus on privacy issues in database systems and will discuss access control models specifically tailored to privacy.

Slides of Lectures

Summary:

In the first part, we shall gently introduce the basic theories of process algebras and shall discuss their use as tool for systems specification and verification. We will dedicate specific attention to behavioural equivalences and modal logics, and will present CCS, pi-calculus and the distributed pi-calculus.

In the second part, we will describe motivations and background behind the design of Klaim, a process description language that has proved useful for describing a wide range of applications with agents and code mobility. We shall discuss two lines of research that have lead on one hand to the evolution of Klaim into X-Klaim, a full-fledged programming language and on the other hand to the distillation of Klaim into number of simpler and simpler calculi that have been the basis for defining new semantic theories for network aware programming.

Summary:

The course will present some of the logic-based approaches to the characterization of complexity classes, especially polynomial-time. The main feature of these approaches is that complexity classes are described as certain sets of functions, expressed in a framework where there is not an explicit notion of elementary, constant-time, computation step. Of the many ways this could be done, the course will present two main approaches.

The first one, that could be traced back to Cobham and, later, Bellantoni and Cook, is based on restrictions of the primitive recursion schema. The second one (Leivant, Girard, ...) gives restrictions to logical systems (like System F, or Linear logic), for instance limiting the logical rules responsible for duplication.

The course will start with a full review of the logical prerequisites: lambda-calculus, Curry-Howard isomorphism, linear logic, system F. Then we will proceed to a review of the two approaches.

Prerequisites: Basic notions of complexity theory (time and space complexity classes) and of computability theory (primitive recursion, general recursion, Turing machines); working knowledge of a first-order logical system, especially natural deduction and/or sequent calculus.

Summary:

The first part will discuss the support provided by a Database Management System to data analysis, such as Data Warehousing and On-Line Analytical Processing.

The second part will provide an introduction to the foundations of classification and clustering provided for exploratory and predictive modeling by research in Machine Learning. We will present and compare the different methodologies and algorithmic strategies and a set of evaluation metrics.

The third part will present a popular and emerging topic in Data Mining, frequent itemset mining. For each topic we will present some well-known applications in business, WEB and bioinformatics.

Prerequisites: Basic knowledge of probability, statistics, algorithm theory, computational complexity.

Lecture Schedule

Important Dates

Location

Bertinoro itself is picturesque, with many narrow streets and walkways winding around the central peak.  Meetings are held in an archiepiscopal fortress that has been converted by the University of Bologna into a modern conference center with computing facilities and Internet access.  From the fortress you can enjoy a beautiful vista that stretches from the Tuscan Apennines to the Adriatic coast and the Alps over the Po Valley.

How to Reach Bertinoro

List of Participants

Financial Sponsorship

Organization

Last updated: 8 February 2006