Program kolokvií s abstrakty pro semestr Podzim 2002

1. 10. 2002: Dr. Michal Kozubek, PhD, FI MU Brno; Automated image acquisition and analysis; Abstract: In the research of the spatial organization of the cell nucleus various methods of cytometry are used. Cytometry means performing measurements on cells (from Greek kytos=cell and metrum=measure). Not only cells themselves 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 measured components. Therefore, cytometry plays a key role in cell research. Mostly the word "cytometry" is used when large quantities of cells are processed.
This talk will show that it is possible to increase the speed and the number of processed cells in image cytometry using a suitable combination of state-of-the-art tools provided by molecular biology, optical microscopy and computer science. Both review information and own ideas or results extracted from a number of publications will be presented. The final part of the talk will be devoted to the high-resolution cytometry network project that tries to combine the resources available at different image cytometry laboratories into one big network with unified image acquisition and processing approaches. This should enable an easy data exchange and effective collaboration between entities distributed around the world.
8. 10. 2002: Prof. Ryszard Horodecki, University of Gdansk; Information as a resource in distributed quantum systems.; Abstract: We adopt the idea that information is fundamental non-free resource. Basing on Landauer's principle we introduce the so called work deficite within the dystant labs paradigm as a difference between work extractable globally and the work extractable locally. We show, that for pure states the work deficit is equal to the entanglement. It provides a basic connection between entanglement and thermodynamical work (energy). We also consider the work deficite for mixed states in context of bound entanglement. We also discuss a new kind of complementarity between local information and number of qubits transmitted.
15. 10. 2002: Doc. Mojmir Kretinsky, CSc, FI MU Brno; Concurrent constraint processes; Abstract: We briefly present concurrent constraint programming (CCP) paradigm as a simple but powerful computational framework based on ideas of concurrency, communication, coordination, and localisation. CCP is classically based on asynchronous communication via a shared store. We introduce new versions of CCP atomic (ask and tell) primitives which features synchronicity. 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 applications we show 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 Lubos Brim (Masaryk U.), David Gilbert (City U., London), and Jean-Marie Jacquet (Namur U.)
22. 10. 2002: Dr. Martin Rajman, Swiss Federal Institute of Technology, Laussane; Probabilistic models for the syntactic analysis of natural language; Abstract: The goal of the presentation is to provide an introduction to the use of probabilisitic models in the domain of natural language parsing. The rationale underlying the use of probabilities for syntax will first be presented. The standard approaches, such as n-gram models, Hidden Markov Models (HMMs) and Stochastic Context-Free-Grammars (SCFGs) will then be introduced, both from a formal and an implementational point of view. Their main limitations will be analyzed. Finaly, a novel extension of the SCFG model: the polynomial Stochastic Tree Substitution Grammars (pSTSGs) will be presented and we will show how this extend model can overcome some of the limitations previously encountered.
29. 10. 2002: Prof. Gernot Salzer, Technical university, Vienna; Excursions of a computer scientist into the realm of logic; Abstract: Computer science gives new answers to old problems in mathematical logic, and poses also new questions. In our talk we will discuss a few of these questions and answers that are related to our group's work in Vienna. In particular we will touch topics like resolution decision procedures, unification theory, and many-valued logics. The talk will conclude with the presentation of MUltlog, a system that is able to generate automatically scientific papers about arbitrary finitely-valued logics.
5. 11. 2002: Sebastian Rahtz, Oxford; The role of the text editing initiative (TEI) in the authoring and interchange of XML documents; Abstract: Computer science gives new answers to old problems in mathematical logic, and poses also new questions. In our talk we will discuss a few of these questions and answers that are related to our group's work in Vienna. In particular we will touch topics like resolution decision procedures, unification theory, and many-valued logics. The talk will conclude with the presentation of MUltlog, a system that is able to generate automatically scientific papers about arbitrary finitely-valued logics.
12. 11. 2002: RNDr. Jiri Janacek CSc, Fyziologicky ustav AV CR, Praha; Digital geometry of biological objects; Abstract: The aim of the talk are binary images and triangulated surface models resulting from segmentation of 3D images and various methods and aspects of automated counting and mesurements. Original interactive methods of measurements will be also mentioned. The methods were applied on biological objects captured by confocal laser scanning microscopy or magnetic resonance imaging.
19. 11. 2002: Prof. Dr. Szirmay-Kalos Laszlo, Technical University of Budapest; Implementing 3D Games in OpenGL (Case study: Space shooting game); Abstract: During this talk I would explain how a 3D space shooting game can be developed. The talk addresses some intutitive aspects of OpenGL, the graphics pipeline, texture mapping and animation, discusses how the scene can be stored and what kind of object oriented design can support games. Further issues are subdivision surfaces for spaceships, simple AI for enemies and special effects such as billboarding (photon rocket) and particle systems (explosion). This talk gives an example that can highlight many aspects of graphics and can prove that game development is not complicated.
26. 11. 2002: Doc. Ludek Matyska, CSc, FI MUNI Brno; Aktualni problemy Gridu; Abstract: Přednáąka bude věnována aktuálním výzkumným problémům, které jsou součástí aktivit směřujících k vytvoření Gridů, tedy rozsáhlých distribuovaných systémů tvořených počítači, datovými sklady, informačními servery a daląími součástmi. Přednáąka se bude konkrétně zabývat bezpečností, zejména v kontextu vyuľití PKI pro účely Gridů a zmíněna bude i problematika firewallů a jejich vlivu. Daląí oblastí je správa zdrojů, tedy otázky alokace výpočetní, přenosové i ukládací kapacity poskytované Gridy. Speciální pozornost bude věnována otázce sledování Gridu, a to jak z pohledu konkrétních uľivatelských úloh (sledování vlastní úlohy, práce s metadaty o úloze, chování úlohy, ...), tak i z pohledu celého Gridu (které komponenty a sluľby jsou dostupné a komu). Závěr přednáąky bude věnován Open Grid Software Architecture (OGSA), jejímľ cílem je propojení jednotlivých komponent do společného jednotícího rámce. Přednáąka se bude opírat předevąím o výsledky, dosaľené v rámci řeąení mezinárodních projektů EU DataGrid a GridLab.
3. 12. 2002: Doc. Pavel Zemcik, CSc, FIT Brno; Akcelerace rastrovych obrazovych algoritmu pomoci FPGA a DSP; Abstract: - Introduction, classification of graphics/imaging algorithms,
- oerview of FPGA hardware architecture, advantages and drawbacks,
- suitability of graphics algorithms for acceleration in FPGA,
- overview of DSP specialised processors, advantages and drawbacks,
- DSP/FPGA combination for efficient algorithm implementation,
- example of accelerated raster algorithm,
- article system rendering acceleration,
- volume rendering/ray tracing acceleration,
- conclusions, results.
10. 12. 2002: RNDr. Julius Stuller, UI CAV, Praha; Semantic WEB; Abstract: The lecture will introduce the basic ideas behind the notion of the Semantic Web (e. i. the demand for universal access to information in the ever-increasing need for semantics-based access to services), the various directions (i. e. the definition of infrastructure, standards and policies facilitating an explicit description of meaning of Web resources so they can be processed by both humans and automated tools) which have given rise to a large number of research problems that relate to models, architectures, applications and services for the Semantic Web.
There exists a great number of challenges and opportunities in this area: the classical data management practices are branching out of traditional frameworks, facing a previously unseen demand for openness, distribution, scalability, interoperability, expressiveness, representativity, flexibility, www-database integration and www-data mining.
A possible vision of the Semantic Web as a series of layers (URI & Unicode, data representation, knowledge representation, ontology, rules, logic, and culminating in trust and other applications managed by agents) will be illustrated by the undertaken works in one of the many planned 6 FP EU projects in the Semantic Web area
17. 12. 2002: Doc. Karel Pala CSc, FI MUNI, CZ; TBA