Programme of colloquia with abstracts for the Autumn 2002 term

1 October 2002

Dr Michal Kozubek, PhD, Faculty of Informatics, Masaryk University, Brno

Automated image acquisition and analysis

Abstract: Various methods of cytometry are used in research into the spatial organisation of the cell nucleus. Cytometry refers to the measurement of cells (from the Greek kytos = cell and metrum = measure). It is not only the cells themselves that are measured, but also their components, such as cell nuclei, proteins, ions, selected DNA or RNA sequences, etc. Such measurements can provide both quantitative and qualitative information on the components being measured. Consequently, cytometry plays a key role in cell research. The term ‘cytometry’ is most commonly used when large numbers of cells are being analysed.
This talk will demonstrate that it is possible to increase the speed and the number of cells processed in image cytometry by using a suitable combination of state-of-the-art tools from molecular biology, optical microscopy and computer science. Both review information and the speaker’s own ideas or findings, drawn from a number of publications, will be presented. The final part of the talk will be devoted to the high-resolution cytometry network project, which aims to combine the resources available at different image cytometry laboratories into a single large network with standardised image acquisition and processing approaches. This should facilitate easy data exchange and effective collaboration between organisations around the world.

8 October 2002

Prof. Ryszard Horodecki, University of Gdańsk

Information as a resource in distributed quantum systems.

Abstract: We adopt the view that information is a fundamental non-free resource. Based on Landauer’s principle, we introduce the so-called ‘work deficit’ within the ‘distant labs’ paradigm as the difference between the work extractable globally and the work extractable locally. We show that, for pure states, the work deficit is equal to the entanglement. This establishes a fundamental link between entanglement and thermodynamic work (energy). We also examine the work deficit for mixed states in the context of bound entanglement. Furthermore, we discuss a new form of complementarity between local information and the number of qubits transmitted.

15 October 2002

Doc. Mojmir Kretinsky, CSc, Faculty of Informatics, Masaryk University, Brno

Concurrent constraint processes

Abstract: We briefly present the concurrent constraint programming (CCP) paradigm as a simple yet powerful computational framework based on the concepts of concurrency, communication, coordination and localisation. CCP is traditionally based on asynchronous communication via a shared store. We introduce new versions of CCP atomic (‘ask and tell’) primitives that incorporate synchronisation. We also mention some semantic results concerning our proposal (called Scc), namely compositionality, full abstractness and axiomatisation (of a relevant subset of Scc). As an application, we demonstrate how Scc can be used to specify the direct exchange and/or the global sharing of information in multi-agent systems. To justify our proposal, we briefly compare Scc to a recently proposed language for the exchange of information in multi-agent systems. This is a joint work with Luboš Brim (Masaryk University), David Gilbert (City University of London) and Jean-Marie Jacquet (University of Namur)

22 October 2002

Dr Martin Rajman, Swiss Federal Institute of Technology, Lausanne

Probabilistic models for the syntactic analysis of natural language

Abstract: The aim of this presentation is to provide an introduction to the use of probabilistic models in the field of natural language parsing. The rationale behind the use of probabilities in syntax will first be outlined. Standard approaches, such as n-gram models, Hidden Markov Models (HMMs) and Stochastic Context-Free Grammars (SCFGs), will then be introduced, from both a formal and an implementational perspective. Their main limitations will be analysed. Finally, a novel extension of the SCFG model – the polynomial Stochastic Tree Substitution Grammars (pSTSGs) – will be presented, and we will demonstrate how this extended model can overcome some of the limitations previously encountered.

29 October 2002

Prof. Gernot Salzer, Vienna University of Technology

A computer scientist’s foray into the realm of logic

Abstract: Computer science provides new answers to old problems in mathematical logic, whilst also raising new questions. In our talk, we will discuss a few of these questions and answers that relate to our group’s work in Vienna. In particular, we will touch upon topics such as resolution decision procedures, unification theory, and many-valued logics. The talk will conclude with a presentation of MUltlog, a system capable of automatically generating scientific papers on arbitrary finitely-valued logics.

5 November 2002

Sebastian Rahtz, Oxford

The role of the Text Editing Initiative (TEI) in the authoring and interchange of XML documents

Abstract: Computer science provides new solutions to long-standing problems in mathematical logic, whilst also raising new questions. In our talk, we will discuss some of these questions and answers relating to our group’s work in Vienna. In particular, we will touch upon topics such as resolution decision procedures, unification theory and many-valued logics. The talk will conclude with a presentation of MUltlog, a system capable of automatically generating scientific papers on arbitrary finitely-valued logics.

12 November 2002

RNDr. Jiri Janacek CSc, Institute of Physiology, Czech Academy of Sciences, Prague

Digital geometry of biological objects

Abstract: The talk will focus on binary images and triangulated surface models resulting from the segmentation of 3D images, as well as various methods and aspects of automated counting and measurement. Original interactive measurement methods will also be discussed. These methods were applied to biological objects imaged using confocal laser scanning microscopy or magnetic resonance imaging.

19 November 2002

Prof. Dr. László Szirmay-Kalos, Budapest University of Technology and Economics

Implementing 3D Games in OpenGL (Case study: Space shooting game)

Abstract: During this talk, I will explain how a 3D space shooting game can be developed. The talk addresses some intuitive aspects of OpenGL, the graphics pipeline, texture mapping and animation, and discusses how the scene can be stored and what kind of object-oriented design can support games. Further topics include subdivision surfaces for spaceships, simple AI for enemies, and special effects such as billboarding (photon rocket) and particle systems (explosion). This talk provides an example that highlights many aspects of graphics and demonstrates that game development is not complicated.

26 November 2002

Doc. Ludek Matyska, CSc, Faculty of Informatics, Masaryk University, Brno

Current Issues in the Grid

Abstract: The lecture will focus on current research issues that form part of activities aimed at creating Grids, i.e. large-scale distributed systems comprising computers, data warehouses, information servers and other components. Specifically, the lecture will address security, particularly in the context of using PKI for Grid purposes, and will also touch upon the issue of firewalls and their impact. Another area is resource management, namely issues relating to the allocation of computing, transmission and storage capacity provided by Grids. Special attention will be paid to the issue of Grid monitoring, both from the perspective of specific user jobs (monitoring one’s own job, working with job metadata, job behaviour, etc.) and from the perspective of the Grid as a whole (which components and services are available and to whom). The conclusion of the lecture will be devoted to the Open Grid Software Architecture (OGSA), the aim of which is to interconnect individual components within a common, unifying framework. The lecture will draw primarily on the results achieved within the framework of the international EU DataGrid and GridLab projects.

3 December 2002

Doc. Pavel Zemcik, CSc, FIT Brno

Acceleration of raster image processing algorithms using FPGAs and DSPs

Abstract: - Introduction, classification of graphics/imaging algorithms,
- overview of FPGA hardware architecture, advantages and drawbacks,
- suitability of graphics algorithms for acceleration in FPGAs,
- overview of specialised DSP processors, advantages and drawbacks,
- Combining DSP and FPGA for efficient algorithm implementation,
- example of an accelerated raster algorithm,
- article on system rendering acceleration,
- volume rendering and ray tracing acceleration,
- conclusions and results.

10 December 2002

RNDr. Julius Stuller, UI CAV, Prague

Semantic Web

Abstract: The lecture will introduce the basic ideas behind the concept of the Semantic Web (i.e. the demand for universal access to information and the ever-increasing need for semantics-based access to services), the various avenues (i.e. the definition of infrastructure, standards and policies facilitating an explicit description of the meaning of Web resources so that they can be processed by both humans and automated tools) which have given rise to a large number of research problems relating to models, architectures, applications and services for the Semantic Web.
There are a great many challenges and opportunities in this area: traditional data management practices are moving beyond conventional frameworks, facing an unprecedented demand for openness, distribution, scalability, interoperability, expressiveness, representativeness, flexibility, integration of the World Wide Web with databases, and web data mining.
A possible vision of the Semantic Web as a series of layers (URI & Unicode, data representation, knowledge representation, ontology, rules, logic, culminating in trust and other applications managed by agents) will be illustrated by the work undertaken in one of the many planned EU 6th Framework Programme projects in the Semantic Web area

17 December 2002

Doc. Karel Pala CSc, Faculty of Informatics, Masaryk University, Czech Republic

TBA