|
|
School Readiness: Beliefs about Preparing Children for Transition from Pre-primary to Primary Education in China
Cui, Shujing ; Greger, David (advisor) ; Straková, Jana (referee) ; Tesar, Marek (referee)
A smooth transition to primary school is positively related to children's later school experience. Continuity among family, Early Childhood Education and Care, and primary school is conducive to successful transition to school. Certain parental school- readiness beliefs and parenting styles, among other factors, contribute to the smoothness of this transition. Therefore, this study compared the school readiness beliefs among Chinese parents, kindergarten teachers and first grade teachers, based on samples drawn from Chongqing, China. 1204 Chinese parents, 245 kindergarten teachers and 133 primary school teachers participated in the current study. Using multi- group confirmatory factor analysis for checking the measurement invariance, this study revealed that kindergarten teachers valued social-emotional competence more than parents. And kindergarten teachers rated items about social-emotional competence significantly higher than primary school teachers did. Besides, this study adopted latent profile analysis to examine the patterns of Chinese parents' school-readiness beliefs. Three profiles were identified: (1) very strong overall emphasis and slightly less academic-oriented; (2) moderate overall emphasis and less academic-oriented; (3) no emphasis and more academic-oriented. Higher socioeconomic...
|
|
|
Zhodnocení současného stavu rozvoje elektromobility osobních vozidel
Tesař, Marek
The present bachelor thesis focuses on electric vehicles, which are increasingly used as a mode of ground transportation. In the first part of the thesis, the data on the growth of the number of registrations of electric vehicles in the Czech Republic, Europe and the world is pointed out. Furthermore, issues about the used method of propulsion, charging method, battery production are presented and expert research in the field of recycling is followed. The contribution of this work is a comprehensive overview of electromobility today, which is still in its early stages and its biggest weakness is batteries. Elec-tricity from renewable sources is also needed for a sustainable model.
|
|
|
Combinatorial applications of linear algebra
Tesař, Marek ; Kratochvíl, Jan (advisor) ; Fiala, Jiří (referee)
A covering projection from graph G onto graph H is "local isomorphism": a mapping from the vertex set of G onto the vertex set of H such that, for every v V (G), the neighborhood of v is mapped bijectively onto the neighborhood (in H) of the image of v. We study the computational complexity of the H-cover (deciding if a given graph G covers H), where G is a regular graph with 8 vertices and edges of two colors, where edges of one color create two disjoint 4-cycles. We present full characterization of H-cover problem for such 3-regular graphs. We solve polynomial cases by reduction to system of linear equations and we show some graphs for which this method doesn't work (even though H-cover is polynomial).
|
|
|
Phylogenetic trees
Nohejl, David ; Pangrác, Ondřej (advisor) ; Tesař, Marek (referee)
Phylogenetic trees are graphs representing relations between entities. In this work, we present our program WPF Trees. This program works with medium sized trees (up to 500 nodes), and implements most common visualization styles and editing tools. We are also describing how to apply simulated annealing method to minimize overlapping of tree node labels.
|
|
|
Combinatorial applications of linear algebra
Tesař, Marek
A covering projection from graph G onto graph H is "local isomorphism": a mapping from the vertex set of G onto the vertex set of H such that, for every v V (G), the neighborhood of v is mapped bijectively onto the neighborhood (in H) of the image of v. We study the computational complexity of the H-cover (deciding if a given graph G covers H), where G is a regular graph with 8 vertices and edges of two colors, where edges of one color create two disjoint 4-cycles. We present full characterization of H-cover problem for such 3-regular graphs. We solve polynomial cases by reduction to system of linear equations and we show some graphs for which this method doesn't work (even though H-cover is polynomial).
|
|
|
Phylogenetic trees
Nohejl, David ; Pangrác, Ondřej (advisor) ; Tesař, Marek (referee)
Phylogenetic trees are graphs representing relations between entities. In this work, we present our program WPF Trees. This program works with medium sized trees (up to 500 nodes), and implements most common visualization styles and editing tools. We are also describing how to apply simulated annealing method to minimize overlapping of tree node labels.
|
|
|
Combinatorial applications of linear algebra
Tesař, Marek ; Fiala, Jiří (referee) ; Kratochvíl, Jan (advisor)
A covering projection from graph G onto graph H is "local isomorphism": a mapping from the vertex set of G onto the vertex set of H such that, for every v V (G), the neighborhood of v is mapped bijectively onto the neighborhood (in H) of the image of v. We study the computational complexity of the H-cover (deciding if a given graph G covers H), where G is a regular graph with 8 vertices and edges of two colors, where edges of one color create two disjoint 4-cycles. We present full characterization of H-cover problem for such 3-regular graphs. We solve polynomial cases by reduction to system of linear equations and we show some graphs for which this method doesn't work (even though H-cover is polynomial).
|
|
|
Combinatorial applications of linear algebra
Tesař, Marek
A covering projection from graph G onto graph H is "local isomorphism": a mapping from the vertex set of G onto the vertex set of H such that, for every v V (G), the neighborhood of v is mapped bijectively onto the neighborhood (in H) of the image of v. We study the computational complexity of the H-cover (deciding if a given graph G covers H), where G is a regular graph with 8 vertices and edges of two colors, where edges of one color create two disjoint 4-cycles. We present full characterization of H-cover problem for such 3-regular graphs. We solve polynomial cases by reduction to system of linear equations and we show some graphs for which this method doesn't work (even though H-cover is polynomial).
|
|
| |
guest ::
RSS feed.