|
|
Speech therapy and intervention of pupils with a diagnosis of elective mutism
Jedličková, Nikola ; Korandová, Zuzana (advisor) ; Horynová, Jana (referee)
The topic of the diploma thesis is speech therapy and intervention of pupils with elective mutism. The thesis is structured into four chapters. The theoretical framework is presented in three chapters, the fourth one is an empirical part of the thesis. The first theoretical chapter describes the concept of communication and the definitions of basic terms, such as speech communication, speech, language, language levels of speech, socialization and social interaction. There are also listed terminological definition of elective mutism, etiology, classification and symptomatology. The second theoretical chapter is based on the issues of speech therapy and intervention and its system in the Czech Republic in terms of diagnostics, differential diagnostics, the process of therapy, prevention and prognosis. The third chapter describes the multidisciplinary approaches and support of the pupils with elective mutism in terms of family and school education. The role of the teacher is also described and at the end of the chapter indicated the help to the pupil in basic education. The fourth empirical chapter deals with qualitative research, realized by case studies, which were supplemented by other research techniques. The main objective of the research was to analyze speech therapy and intervention in pupils...
|
|
|
Algorithmic aspects of intersection-defined graph classes
Jedličková, Nikola ; Kratochvíl, Jan (advisor) ; Fiala, Jiří (referee)
Geometrically representable graphs are extensively studied area of research in contempo- rary literature due to their structural characterizations and efficient algorithms. The most frequently studied class of such graphs is the class of interval graphs. In this thesis we focus on two problems, generalizing the problem of recognition, for classes related to interval graphs. In the first part, we are concerned with adjusted interval graphs. This class has been studied as the right digraph analogue of interval graphs. For interval graphs, there are polynomial algorithms to extend a partial representation by given intervals into a full interval representation. We will introduce a similar problem - the partial ordering extension - and we will provide a polynomial algorithm to extend a partial ordering of adjusted interval digraphs. In the second part, we show two NP-completeness results regarding the simultaneous representation problem, introduced by Lubiw and Jampani. The simultaneous representation problem for a given class of intersection graphs asks if some k graphs can be represented so that every vertex is represented by the same object in each representation. We prove that it is NP-complete to decide this for the class of interval and circular-arc graphs in the case when k is a part of the input and graphs...
|
|
|
Plays for a social skills development for preschool children
JEDLIČKOVÁ, Nikola
The bachelor thesis deals with the importance of developing the social skills of preschool children through games. Games focus on cooperation among children, good behavior towards other people and communication ability. The theoretical part contains mainly knowledge about basic concepts on the given topic, characteristics of developmental specifics of preschool child, game as a means of education and evaluation of educational programs in kindergarten. The practical part includes a program of games for the development of social skills, a description of the implementation of the games and their evaluation. In the results there are given methodological recommendations for the implementation of games with children in kindergarten.
|
|
| |
|
|
Game variants of graph labeling
Jedličková, Nikola ; Šámal, Robert (advisor) ; Fiala, Jiří (referee)
A graph labeling on a graph G is a mapping from the vertex set or the edge set to a set of labels L ⊆ N ∪ {0}. We will survey the existing results on graph labeling games. We also introduce a new type of labeling - ESD labeling and its game variant which was inspired by Tuza. An ESD labeling on a graph G is an injective mapping φ : V (G) → {1, . . . , n} such that for every two edges, the sum of the the labels on their endpoints is different. Apart from the question of existence of such labeling, we will examine game variant in which two players gradually build an ESD labeling. 1
|
|
|
Technologie výroby nízkostupňových piv
Jedličková, Nikola
The theme of this thesis is "Production technology of low beers." In the introduction to the theoretical part defines the notion of low-alcohol and non-alcoholic beer. Furthermore, the introduction of work focuses on the technology of classic beer. Then describes the variol possibilities for the preparation of low beers, which can be divided into three groups -- to limit the formation of alkohol in beer production, the use of special yeast species and microorganism and elimination of alkohol from the finished beer. The practical part contains the production of low burs with different kinds of the hops. Subsequently were performedanalytical measurements and sensory with evaluation results of the analysis.
|
|
| |
guest ::
RSS feed.