Program seminářů pro rok 2009/2010
Podzim 2009
- 25. 9. 2009
- Úvodní seminář podzimního semestru
- Program:
Informace o koncepci semináře v podzimním semestru.
Domluva programu semináře.
Diskuse. - 1.10. 2009
- Marek Grác:Building language resources with community
- Abstract:
Complexity of natural languages is still beyond the capacity of computers. Attempts to its formalization led to obtaining language resources in various layers (e.g. word forms or dictionaries). Their coverage and precision is tested on existing text corpora. There are situations when it is suitable to use men power to handle specific cases. These tasks are usually very exhaustive and cross-checking is very important. This presentation will describe our attempt to work with community on building morphological database. Related problems as motivation and targeted selection are covered as well. - 8.10. 2009
- Radek Krejčí: Netopeer - Secure Remote Configuration System
- Abstract:
TBA - 15.10. 2009
- Fedor Tiršel: Assisted photography for the blind
- Abstract:
Presentation briefly introduces a concept of assisted photography for blind and visualy impaired users. We also describe the architecture of GATE (Graphics Accessible To Everyone) and WEBGEN in the combination with PHOTON. Today's smartphones are equipped with the localization service (GPS) and with the digital compass. In conjunction with the phones camera and the internet access, it enables the blind take their own photos. This kind of photos can be afterwards easy annotated, labeled with the tags and presented on the website. As an illustration, we provide an example showing how the blind can investigate (by sound or dialog) the "smart" photos on the web. This approach is not limited to blind only, but enables also the commercial use of whole concept. - 22.10. 2009
- Antonín Pavelka: Predicting effect of substitution on protein function
- Abstract:
A single amino acid substitution can alter the protein structure so dramatically that the protein is not able to perform its function anymore. The ability to predict if this happens is important both for protein engineering and biomedical research. We use receiver operating characteristic and accuracy-coverage curve to show that confidence weighted consensus of current methods leads to increased prediction performance. We also suggest plans for further improvement and deployment in protein engineering. - 29.10. 2009
- Vojtěch Bystrý:Segmentation of protein sequences using hidden Markov models
- Abstract:
TBA - 5.11. 2009
- Vít Baisa: Machine Translation: Methods of Evaluation
- Abstract:
If we want to compare different machine translation systems (tools, programs) we need to have evaluation metrics at our disposal. There are several methods commonly used to meter a quality of translation and they will be presented in the talk. It will be also pointed out to their limitations and shortcomings and several ways of dealing with these limitations will be shown. - 12.11. 2009
- Zdeněk Vašíček: Evolutionary design of image filters and its hardware acceleration
- Abstract:
Although the design of linear filters is a straightforward process, the design of robust nonlinear filters represents a non-trivial task and thus the median filter remains (since its invention) the most used nonlinear filter. We will show that the evolutionary design (evolutionary algorithms) approach can be successfully to solve this task. In this presentation, a method will be introduced to design robust nonlinear image filters by means of evolutionary techniques. It will be shown that our approach produces the solutions that exhibit better quality as well as lower implementation cost in comparison with the human-designed median-based filters. Since the evolutionary design is generally a time-consuming process, an FPGA-based platform has been developed in order to accelerate this task. This platform will be discussed in the second part of the presentation. Since the modern XILINX FPGAs contain embedded PowerPC processors, the search algorithm is implemented by using PowerPC while a candidate solution is evaluated using a deeply pipelined architecture. It will be shown that a significant speedup of evolution is obtained when comparing with a highly optimized software implementation even if the evolutionary platform runs at 100MHz. In the last part, the obtained results will be discussed. - 19.11. 2009
- Jiří Kolář: Self optimizing business processes
- Abstract:
TBA - Petra Budíková: Response quality refinement in content-based information retrieval
- Abstract:
Since traditional databases are not suitable for efficient management of multimedia data, a new content-based approach and similarity searching have been researched intensively in the recent years. However, the concept of similarity is tricky - it will be shown that no universal measure of similarity can be defined. Therefore, the search system has to cooperate with the user. We shall briefly present the concept of relevance feedback (RF) and discuss difficulties that have to be overcome to allow sucessfull utilization of RF in similarity searching. Main attention will be given to the efficiency issues - we will analyze the costs of RF for a real-world search system and propose several methods of reducing the costs. - 26.11. 2009
- Lukáš Holík (FIT VUT): Nondeterministic tree automata for abstract regular model checking
- Abstract:
Abstract regular tree model checking (ARTMC) is a generic framework for verifying infinite state systems with tree-shaped configurations (such as pointer manipulating programs, parametrised protocols, ...). Possibly infinite sets of states are represented as tree automata. Nondeterministic tree automata (NTA) are much more compact then deterministic ones, however, to use NTAs within ARTMC, one has to develop techniques for dealing with NTAs efficiently without determinizing them. Such techniques will be presented, specifically, algorithms for reducing size and for checking language inclusion of NTAs. - 3.12. 2009
- Petr Jarušek: How to predict Difficulty of Sokoban Puzzle?
- Abstract:
Sokoban is a well known Japanese game proven to be a P-SPACE complete problem. Although the game is hard to solve for computers, humans are often able to solve it very guickly. What causes difficulty of Sokoban puzzle for humans? How can we predict difficulty of other puzzles? What is it all good for? We will focus more deeply on our human-like computational model and possible applications of our research. (see also http://en.wikipedia.org/wiki/Sokoban http://organizatori.cz/puzzle/) - 10.12. 2009
- Vojtěch Kovář: Syntactic Analysis as Pattern Matching
- Abstract:
TBA - 17.12. 2009
- Poster Session
- Abstract:
Prezentovány budou postery vytvořrné v podzimínm semestru.
Jaro 2010
- 19. 2. 2010
- Úvodní seminář jarního semestru
- Informace o koncepci semináře v jarním semestru. Domluva programu semináře. Diskuse.
- 4.3. 2010
- Marek Trtík:
- Abstract:
TBA - 11.3. 2010
- Jan Vlach: Quantum marginal problem
- Abstract:
The presentation will concerned with compatibility of quantum state of the composite system and given quantum states of its subsystems. We will show known results for the case of finite-dimensional Hilbert spaces. For continuous quantum variables there is so far not known general solution. However for certain class of states (Gaussian states) this problem can be significantly simplified. - 18.3. 2010
- Zuzana Nevěřilová:
- Abstract:
TBA - 25.3. 2010
- Tomáš Čapek: Construction and Maintenance of Semantic Networks
- Abstract:
A general-purpose semantic network is a language resource for the given language, alternative to traditional dictionaries. It consists of semantic units which are connected by semantic relations, thus creating a graph-like structure or a network. In this presentation we will discuss how are semantic networks constructed and how to maintain their data in semi-automatic way. - 1.4. 2010
- Michael Tsikerdekis: Social networks & online group phenomena
- Abstract:
The presentation is divided into two sections. In the first one I am going to speak about social networks and explain what they are, how they work, and give some examples of different categories. Then I am going to speak about issues concerning the social networks and specifically about design flaws that might lead to economical problems as well as ethical problems and give examples. In the second section i am going to speak about two specific phenomena that occur in online groups and thus in social networks. I am going to point out the causes for this phenomena and discuss that software engineers should use this knowledge in order to avoid design flaws and predict online group behaviour in order to meet the desired end result. - 8.4. 2010
- Jana Tůmová: Optimal Path Planning under Temporal Logic Constraints
- Abstract:
We present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the environment is modeled as a general transition system, enhanced with weighted transitions. The mission is specified by a class of temporal logic formulas. For every environment model, and for every formula in the class, our method computes a robot trajectory which minimizes a certain cost function. The problem is motivated by applications in robotic monitoring and data gathering. - 15.4. 2010
- Rambousek: TBA
- Abstract:
TBA - 22.4. 2010
- Pavel Karas: TBA
- Abstract:
TBA - 29.4. 2010
- Pavel Černohorský: TBA
- Abstract:
TBA - 6.5. 2010
- Ondřej Strnad: TBA
- Abstract:
TBA - 13.5. 2010
- Martin Drašar: TBA
- Abstract:
TBA - Vilém Šustr: Computer Aided Calligraphy in Haptic Virtual Environment
- Abstract:
TBA - 20.5. 2010
- Poster Session
- Abstract:
Prezentovány budou postery vytvořrné v jarním semestru.