|
|
Modular system for managing web contents
Kulman, Igor ; Chrpa, Lukáš (advisor) ; Lokoč, Jakub (referee)
Modular web content management system (thereinafter ModularCMS) offers the users an easy and simple way to create an manage their own website, from a simple personal presentation to complex and extensive company web. ModularCMS puts the main afford on the simplicity of user and programming interface, separating itself from other existing CMSs. The simplicity of user inteface maens, taht if an end user orderes an web presentation based on this CMS, atfer its deployment, he will be able to manage the content and do all the other actions he may need very easy and quickly. The architecture of MudularCMS is modular, it could be extended with other functions a project may need by programming new moduls.
|
|
|
Self-organizing linear lists
Kulman, Igor ; Koubková, Alena (advisor) ; Babka, Martin (referee)
Self-organizing linear lists are data structures for fast search, provided that certain elements stored in them are searched more frequently than others, while the probability of access to individual elements is generally not known in advance. Efficient search is achieved using different permutation rules that keep changing the list structure so that the more frequently searched elements are closer to the beginning. This thesis gives an overview of known algorithms for solving this problem (with the theoretical results about their complexity, if they are known), and experimental study of their behavior (using its own or freely available implementations and software for generating input data, testing algorithms and processing the results of experiments). Powered by TCPDF (www.tcpdf.org)
|
|
|
Self-organizing linear lists
Kulman, Igor ; Koubková, Alena (advisor) ; Babka, Martin (referee)
Self-organizing linear lists Self-organizing linear lists are data structures for fast search, provided that certain elements stored in them are searched more frequently than others, while the probability of access to individual elements is generally not known in advance. Efficient search is achieved using different permutation rules that keep changing the list structure so that the more frequently searched elements are closer to the beginning. This thesis gives an overview of known algorithms for solving this problem (with the theoretical results about their complexity, if they are known), and experimental study of their behavior (using its own or freely available implementations and software for generating input data, testing algorithms and processing the results of experiments).
|
|
|
Modular system for managing web contents
Kulman, Igor ; Lokoč, Jakub (referee) ; Chrpa, Lukáš (advisor)
Modular web content management system (thereinafter ModularCMS) offers the users an easy and simple way to create an manage their own website, from a simple personal presentation to complex and extensive company web. ModularCMS puts the main afford on the simplicity of user and programming interface, separating itself from other existing CMSs. The simplicity of user inteface maens, taht if an end user orderes an web presentation based on this CMS, atfer its deployment, he will be able to manage the content and do all the other actions he may need very easy and quickly. The architecture of MudularCMS is modular, it could be extended with other functions a project may need by programming new moduls.
|
guest ::
