translated by Google

Seminar program for 2010/2011

Autumn 2010

23. 9. 2010
Introductory Seminar Seminar
Information on Seminar Concept in the Autumn Semester.
Agenda of the seminar.
30. 9. 2010
Information on the OPVK doctoral project. Discussion.
7.10. 2010
Tomáš Hnilica: Visualization of large FEM models.
Numerical simulation is an important part of computer aided product development chain and FEM simulations are widely used. The amount of data produced by a finite element of calculation places a particular challenge on scientific visualization. The aim of my work is to visualize large FEM models on commodity hardware. In this presentation, the FEM model and simulation process will be given. The design of the out-of-core visualization system will be presented.
14.10. 2010
Vojtěch Bystřý: Model for non-linear local motifs recognition
Short local motifs are the basis for the protein folding prediction algorithms. These motifs are usually recognized in the protein sequence sequentially, which may not be the best way to do it. Since protein sequences have a very non-linear context characteristic, it is more efficient to split the sequence into different non-linear context groups. The model we propose is trying to do just that with its ability to switch between context groups and remember the point of the switch in these groups.
14.10. 2010
Adam Husar: Application-Specific Instruction Set Processor Design and Programming
Presentation will consist of two parts. The first one will be an introduction to the Application-Specific Instruction Set Processor (ASIP) design and related Electronic System Level Methodologies. As a case study will be presented the design of an H.264 encoder / decoder processor SVENm from Austrian company OnDemand Microelectronics. The second part will focus on ASIP design Architecture Description Language ISAC and on transformation from an ISAC model to a model suitable for compiler generation. Preliminary results for automatically generated C compiler for the MIPS architecture will be shown.
4.11. 2010
Filip Konečný: Relational Analysis of Non-deterministic Integer Programs
Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this talk, we describe an efficient algorithm for computing the transitive closures of differential boundaries, octagonal and finite monoid affine relations. On the theoretical side, this framework provides a common solution to the acceleration problem for all these three classes of relationships. In practice, according to our experiments, the new method performs up to four orders of magnitude better than the previous ones for the first two classes. This algorithm provides the basis for the analysis of non-deterministic integer programs (also known as counter automata or counter systems). We explain how transitive closure computation combines with other methods to provide a framework for the analysis of such systems. These ideas led us to the implementation of the FLATA tool. (Joint work with Marius Bozga, Radu Iosif, and Tomas Vojnar.)
Tomáš Babiak: An improvement of the LTL to Büchi automata
The standard technique for LTL model checking consists of translating the negation of the LTL specification into a Büchi automaton A, and then checking if the product M x A has a empty language. In spite of the main problem of this verification method, the translation of LTL formulas into equivalent Büchi automata itself can take a significant amount of time in the whole process. We present an improvement of an algorithm to translate LTL formulas into Büchi automata via alternating automata. In particular, we are transforming alternating Bui automata into generalized Bui automata, where we temporarily ignore some transitions resulting from alternating automata states corresponding to subformulae that are invariant prefixes. Experimental results show that our improvement can lead to faster translation.
4.11. 2010
Vít Baisa: Natural Language Processing from Scratch
Natural languages ​​are complicated. To be able to even talk about them, we introduce terms as part of speech, case, semantic role, tense, hyperonym, and many others. These terms are based on our observation of language but they always generalize the much more complicated reality. Any generalization inevitably brings errors into our understanding of language. We usually process natural languages ​​with relatively sparse data but with complicated algorithms. My goal is, on the contrary, to build a large data source representing language and to implement very simple algorithms to deal with it. In my presentation I will show a completely new view of language (especially Czech) - extremely simple and as universal as possible. I will also describe how to build the extensive data source and how to solve some tasks of natural language processing with such data source and within the new view. The view of language is very simple and does not require any previous linguistic knowledge. That's why you are sincerely welcome to join subsequent discussion. Since my work has started from scratch and is still under development, I will be grateful for your suggestions and comments.
25.11. 2010
Jan Samek: Modeling Multiple-Context Trust in Multi-Agents Systems
Artificial agents are autonomous entities that should behave rationally by their own control. They should also have some social abilities that enable them to make strategic decisions within a multi-agent community. One of such decisions is to select a proper partner, which believes that its behavior will be reliable and trustworthy. We address the area of ​​trust that may be important for improving agent's reasoning capabilities and by this also the rationality of its behavior within an agent or multi-agent system. Presentation introduces the specification of the model that is used to represent multi-context trust. This model is in fact a part of the agent's belief base and it is used when the decision about some system element of trustworthy takes part in the agent's reasoning process. For these purposes, we develop a Hierarchical Model of Trust in Context, which is represented by a multilevel graph, where each node of the graph represents different aspects of the trustee, and each edge of the graph represents the relationship between different aspects. This is useful for modeling trust in multi-context environment.
2.12. 2010
Michail Tsikirdekis: Aggression in Social Networks
Aggression in social networking websites is one of the behaviors that people exhibit online that could destabilize an otherwise stable community. Research from the fields of psychology and sociology shows that there are some subtle differences between how people express violence online and in real life, usually because of the restrictive nature of computer-mediated communication. The rest of the core elements of violent behavior remain the same and are well known facts. One of the top theories of aggression is the frustration-aggression theory that can easily be observed online every day. Most of the factors that contribute to frustration and in effect aggression are part of the digital environment which is artificially created by software engineers. This environment due to its artificial nature can be manipulated, altered, or changed. Software engineers need to learn how to change the user interface to achieve the desired effects on their social networking software. In-depth analysis and research should be conducted to find how the architectural design of the application affects the interactions of the people who use the software.
2.12. 2010
Vojtěch Zavřel: Similarity-based detection system for videos
With the growing number of videos, the search for an appropriate event in video datasets is becoming more and more complicated. Many of the currently available systems are able to search according to one of the video aspects only, are domain specific, or have problems with performance. Our goal is to build a video event-detection system based on similarity principles that are generalized by the abstraction of metric spaces. This framework will be a domain nonspecific; it will be able to combine several video aspects based on a user-provided aggregation function; it will not require any learning phase; and it will be able to process the volume of data significantly higher than currently available systems.
Jaroslav Bayer: Towards Text Mining in Technology-Enhanced Learning
In the technology-enhanced learning environment, text mining can be useful for clustering course information, classification of student comments, for theses classification and evaluation, and others. We describe a pre-processing step and a method of text classification. The best results have been obtained for classification of theses. We discuss the results obtained for the classification of these three types of texts and explain what additional information is needed to improve classification accuracy.
16.12. 2009
Poster Session
Presentations will be presented in the autumn semester.

Spring 2011

19. 2. 2011
Introductory Seminar of the Spring Semester
Information on the seminar concept in the spring semester. Agenda of the seminar. Discussion.
3. 3. 2011
David Sehnal: Analyzing 3D Structural Motifs in Proteins
Nowadays, a large amount of information about the 3D structure of proteins and other types of molecules is available in databases such as the Protein Data Bank. This allows us to analyze biochemically important motifs in these molecules. We present several methods of analysis including superimposition, EEM charge calculation, and computing tunnels in proteins. Furthermore, the emphasis is on composing these analyzes. This is achieved through software called WebChemistry - a user-friendly web-based interface for manipulation with chemical data.
10. 3. 2011
Sven Dragan: Analysis of biological dynamic reaction systems
At the base of all living organisms are cells. Their behavior is caused by complex systems of reacting molecules such as large proteins, enzymes, signaling molecules and metabolites. Depending on the amount of knowledge and scale of interest, different abstractions are used to express the dynamic behavior of such systems. If the species concentration changes are given in terms of common differential equations and a method for numerical simulation is used to approximate the time evolution of such a system, it is possible to obtain a single trajectory from the initial conditions. Combined with methods from model checking and property can be evaluated to hold or not over a trace taken from a single simulated trajectory. The presented approach will show the possibility of inferring the validity of properties for whole sets of trajectories starting in parts of a given region of initial conditions.
17. 3. 2011
Moslem Amiri: Evaluation of Lifetime Bounds of Wireless Sensor Networks
In this presentation, we estimate the lifetime boundaries of a network of motes that communicate with each other using the IEEE 802.15.4 standard. Different frame structures of IEEE 802.15.4 together with the CSMA / CA medium access mechanism are investigated to detect the overhead of the channel acquisition, header and footer of the data frame, and transfer reliability during packet transmission. This overhead is the fixed component, and the data payload makes the incremental component of a linear equation to estimate the power consumed during each packet transmission. Finally, we introduce this per-packet power consumption in a mathematical model that estimates the lower and upper bounds of routing in the network. We also implemented a series of measurements on the CC2420 radio used in a wide range of sensor motes to find the fixed and incremental components, and finally the lifetime of a network composed of the motes using this radio.
24. 3. 2011
Jaromír Plhák: Processing of Graphics for the Visually Impaired
In this presentation, current approaches to graphics processing for the visually impaired are introduced. It involves a graphic exploration as well as a picture generation by the visually impaired and blind. Our dialog based approach that integrates graphical ontologies, what-where language and recursive navigation grid is described in more detail. Well-known graphic processing applications for users with visual impairment have been demonstrated as well.
31. 3. 2011
Jaroslav Bayer: Retrieval and analysis of reports on fire brigade operations
The presentation deals with the search of texts on the internet based on the information obtained from the firemen database. The goal is to classify texts into several categories. We describe the methods of text collection and text mining. The highest overall classification accuracy - by 86% and 96%. The given database consists of more than 116,000 records. We have tried to search and download texts describing about 4,000 selected events. We have succeeded in more than 2,900 cases.
7. 4. 2011
Šimon Suchomel: Finding plagiarism by searching the Internet
Plagiarism detection has become even more important since a variety of documents are electronically available. In IS MU there is a tool for discovering plagiarism by evaluating document similarities among all documents stored in IS MU and other systems with IS MU interconnected. For a similarity of the newly added document, the system must contain the source or referenced document that was potentially copied. One way is to provide the system with a relevant document or set of documents that can be used as the source of plagiarism. This presentation deals with the design of a system for automated discovery and processing of similar documents in the Internet. It also discusses the benefits of IS MU plagiarism detection system.
14. 4. 2011
Michail Tsikerdekis: Aggression and anonymity
The effects of anonymity on aggression have been discussed by many social scientists in recent years. Anonymity is a factor that could lead to a dis-inhibited behavior that could cause damage to many online communities. This knowledge provides software engineers with a dilemma whether to use anonymity as an option for their users and suffer the increased aggression that their community might exhibit or exclude it all together. Anonymity is a generic term and should be further analyzed into different states such as pseudonymity and complete anonymity. There is no knowledge of the effects of these two different states of anonymity in the interactions of users in relation to aggression. In this paper, an experiment was conducted to determine if there is any effect of the two anonymity states on users interactions and how aggressively they respond to certain situations, and how they differ from each other. The findings show that, in general, there is no difference in how aggressive the user responds between pseudonymity, complete anonymity, or when users answer with their real names. However, users with extremely strong opinions have been found to respond more aggressively to the state of pseudonymity.
21. 4. 2011
Jana Fabriková: A Discrete Abstraction of Biological Systems
Our goal is to find a suitable discrete abstraction of a biological system. By a biological system we mean a finite set of biochemical species together with a set of biochemical reactions transformed into a set of common differential equations in the concentrations of species. By a suitable discrete abstraction we mean an automaton with a finite number of states, each of which can be described by a bounded set of integer numbers. There are several existing approaches to this problem that will be briefly introduced, and our description will be described by our approach (together with its advantages and disadvantages).
28. 4. 2011
Fedor Tiršel: Ontology-based indoor navigation for the visually impaired
Blind and visual impaired face a lot of problems during their daily activities with navigation, especially in environments unknown or not designed with assistive purposes. Many systems try to cover navigation issues of disabled users. The presentation overviews the ontology-based approach of indoor navigation. The developed system consists of RFID tags, a portable reader that can be integrated into the long cane and smart phone. Technologies provided by smart phones have the potential to support future needs of the system.
12. 5. 2011
Lukáš Kalčok: Haptic Rendering and Algorithms
During the last decade of computer graphics there has been a major advancement in the field of haptic rendering. Nowadays haptic rendering is used in many fields such as molecular docking or virtual sculpting. The presentation will include introduction to the field, algorithms used in haptic rendering, used equipment and solutions used in the laboratory of Human Computer Interaction at the Faculty of Informatics at Masaryk University
19.5. 2011
Poster Session
Presentations will be made in the spring semester.