Improvements of bibliography

912cdaf8 · Tomáš Nováček · 1e7b2658 · 912cdaf8 · 912cdaf8 · 912cdaf8
Commit 912cdaf8 authored 2 months ago by Tomáš Nováček
--- a/README.md
+++ b/README.md
@@ -12,7 +12,7 @@ Recommended template for theses submitted at [Faculty of Information Technology]
  
 Version
 --------
-1.3.8, built 29. 10. 2024. The whole changelog can be found in the [Changelog file](changelog.md).
+1.3.9, built 7. 1. 2025. The whole changelog can be found in the [Changelog file](changelog.md).
  
  
 Bugs and support

--- a/changelog.md
+++ b/changelog.md
@@ -5,6 +5,16 @@ All notable changes to this project will be documented in this file.
 The format is based on [Keep a Changelog](http://keepachangelog.com/)
 and this project adheres to [Semantic Versioning](http://semver.org/).
  
+## [1.3.9] - 7. 1. 2025
+
+Cleaning the bibliography.
+
+### Changed
+- Removed unused bibliography items, only example of different entries remained.
+- Improved bibliography item for website citation.
+- Added non-breaking spaces before citations.
+
+
 ## [1.3.8] - 29. 10. 2024
  
 Gitignore improvement and attachment list improvement.

--- a/ctufit-thesis.tex
+++ b/ctufit-thesis.tex
 %% This is the ctufit-thesis example file. It is used to produce theses
 %% for submission to Czech Technical University, Faculty of Information Technology.
 %%
-%% This is version 1.3.8, built 29. 10. 2024.
+%% This is version 1.3.9, built 7. 1. 2025.
 %% 
 %% Get the newest version from
 %% https://gitlab.fit.cvut.cz/theses-templates/FITthesis-LaTeX

--- a/text/bib-database.bib
+++ b/text/bib-database.bib
 @article{Sestakova2018,
-  author = {Eliška Šestáková and Jan Janoušek},
-  journal = {Information},
-  title = {Automata Approach to XML Data Indexing},
-  year = {2018},
-  volume = {9},
-  number = {1},
-  ISSN = {2078-2489},
-  medium = {online},
-  accessed = {2019-03-26},
-  DOI = {10.3390/info9010012},
-  URL = {http://www.mdpi.com/2078-2489/9/1/12},
+  author        = {Eliška Šestáková and Jan Janoušek},
+  journal       = {Information},
+  title         = {Automata Approach to XML Data Indexing},
+  year          = {2018},
+  volume        = {9},
+  number        = {1},
+  issn          = {2078-2489},
+  medium        = {online},
+  accessed      = {2019-03-26},
+  doi           = {10.3390/info9010012},
+  url           = {http://www.mdpi.com/2078-2489/9/1/12},
 }
  
 @book{Crochemore2002,
-  author = {Maxime Crochemore and Wojciech Rytter},
-  title = {Jewels of stringology},
-  publisher = {World Scientific},
-  address = {River Edge, NJ},
-  year = {2002},
-  ISBN = {978-9810247829},
+  author        = {Maxime Crochemore and Wojciech Rytter},
+  title         = {Jewels of stringology},
+  publisher     = {World Scientific},
+  address       = {River Edge, NJ},
+  year          = {2002},
+  isbn          = {978-9810247829},
 }
  
 @book{Motwani2014,
-  author = {Rajeev Motwani and Jeffrey D. Ullman and John E. Hopcroft},
-  title = {Introduction to automata theory, languages, and computation},
-  publisher = {Pearson},
-  address = {Harlow},
-  year = {2014},
-  edition = {Third},
-  ISBN = {9781292039053},
+  author        = {Rajeev Motwani and Jeffrey D. Ullman and John E. Hopcroft},
+  title         = {Introduction to automata theory, languages, and computation},
+  publisher     = {Pearson},
+  address       = {Harlow},
+  year          = {2014},
+  edition       = {Third},
+  ISBN          = {9781292039053},
 }
  
 @book{Kopka2004,
-  author = {Helmut Kopka and Patrick W. Daly},
-  title = {LATEX},
-  subtitle = {podrobný průvodce},
-  publisher = {Computer Press},
-  address = {Brno},
-  year = {2004},
-  ISBN = {80-7226-973-9},
+  author        = {Helmut Kopka and Patrick W. Daly},
+  title         = {LATEX},
+  subtitle      = {podrobný průvodce},
+  publisher     = {Computer Press},
+  address       = {Brno},
+  year          = {2004},
+  ISBN          = {80-7226-973-9},
 }
  
-
-
-
-
 @inproceedings{exponential:queries,
- author = {Mandhani, Bhushan and Suciu, Dan},
- title = {Query Caching and View Selection for XML Databases},
- booktitle = {Proceedings of the 31st International Conference on Very Large Data Bases},
- series = {VLDB '05},
- year = {2005},
- isbn = {1-59593-154-6},
- location = {Trondheim, Norway},
- pages = {469--480},
- numpages = {12},
- url = {http://dl.acm.org/citation.cfm?id=1083592.1083648},
- acmid = {1083648},
- publisher = {VLDB Endowment}
-}
-
-@inproceedings{dietz1982maintaining,
-  title={Maintaining order in a linked list},
-  author={Dietz, Paul F},
-  booktitle={Proceedings of the fourteenth annual ACM symposium on Theory of computing},
-  pages={122--127},
-  year={1982},
-  organization={ACM}
-}
-
-@MISC{ ebnf,
-  AUTHOR = "{BSI (British Standards Institution)}",
-  TITLE  = {BS 6154:1981 Method of defining -- syntactic metalanguage},
-  YEAR   = {1981},
-  ISBN   = {ISBN 0-580-12530-0},
-}
-
-@BOOK{ xml:technologie,
-  AUTHOR =    {Jaroslav Pokorný},
-  TITLE =     {XML Technologie -- Principy a aplikace v praxi},
-  PUBLISHER = {Grada Publishing, a.s.},
-  ADDRESS =   {Praha},
-  YEAR =      {2008},
-  ISBN =      {978-80-247-2725-7},
+  author        = {Mandhani, Bhushan and Suciu, Dan},
+  title         = {Query Caching and View Selection for XML Databases},
+  booktitle     = {Proceedings of the 31st International Conference on Very Large Data Bases},
+  series        = {VLDB '05},
+  year          = {2005},
+  isbn          = {1-59593-154-6},
+  location      = {Trondheim, Norway},
+  pages         = {469--480},
+  numpages      = {12},
+  url           = {http://dl.acm.org/citation.cfm?id=1083592.1083648},
+  acmid         = {1083648},
+  publisher     = {VLDB Endowment}
 }
  
-
 @inproceedings{def:2,
-	author={Leonid Libkin},
-	year={2005},
-	isbn={978-3-540-27580-0},
-	booktitle={Automata, Languages and Programming},
-	volume={3580},
-	series={Lecture Notes in Computer Science},
-	editor={Caires, Luís and Italiano, Giuseppe and Monteiro, Luís and Palamidessi, Catuscia and Yung, Moti},
-	title={Logics for Unranked Trees: An Overview},
-	publisher={Springer Berlin Heidelberg},
-	pages={35--50},
-}
-
-
-@inproceedings{ def:1,
-	author={Frank Neven},
-	year={2002},
-	isbn={978-3-540-44240-0},
-	booktitle={Computer Science Logic},
-	volume={2471},
-	series={Lecture Notes in Computer Science},
-	editor={Bradfield, Julian},
-	title={Automata, Logic, and XML},
-	publisher={Springer Berlin Heidelberg},
-	pages={2--26},
-}
-
-@MISC{xml:w3c,
-  AUTHOR = {Bray T. Paoli J. Sperberg-McQueen C. et al},
-  TITLE  = {Extensible Markup Language (XML) 1.0},
-  PUBLISHER = { W3C },
-  YEAR   = {Nov 2008},
-  URL    = {http://www.w3.org/XML},
-  URLDATE= {2015-02-05},
-}
-
-@inproceedings{ xml:index:9,
- author = {Chung, Chin-Wan and Min, Jun-Ki and Shim, Kyuseok},
- title = {APEX: An Adaptive Path Index for XML Data},
- booktitle = {Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data},
- series = {SIGMOD '02},
- year = {2002},
- isbn = {1-58113-497-5},
- location = {Madison, Wisconsin},
- pages = {121--132},
- numpages = {12},
- doi = {10.1145/564691.564706},
- acmid = {564706},
- publisher = {ACM},
- address = {New York, NY, USA}
-} 
-
-@inproceedings{ xml:index:8,
-year={2007},
-isbn={978-3-540-71702-7},
-booktitle={Advances in Databases: Concepts, Systems and Applications},
-volume={4443},
-series={Lecture Notes in Computer Science},
-editor={Kotagiri, Ramamohanarao and Krishna, P. Radha and Mohania, Mukesh and Nantajeewarawat, Ekawit},
-title={AB-Index: An Efficient Adaptive Index for Branching XML Queries},
-url={http://dx.doi.org/10.1007/978-3-540-71703-4_90},
-publisher={Springer Berlin Heidelberg},
-author={Zhang, Bo and Wang, Wei and Wang, Xiaoling and Zhou, Aoying},
-pages={988--993},
-}
-
-@inproceedings{ xml:index:10,
- author = {Li, Quanzhong and Moon, Bongki},
- title = {Indexing and Querying XML Data for Regular Path Expressions},
- booktitle = {Proceedings of the 27th International Conference on Very Large Data Bases},
- series = {VLDB '01},
- year = {2001},
- isbn = {1-55860-804-4},
- pages = {361--370},
- numpages = {10},
- url = {http://dl.acm.org/citation.cfm?id=645927.672035},
- acmid = {672035},
- publisher = {Morgan Kaufmann Publishers Inc.},
- address = {San Francisco, CA, USA}
-} 
-
-@inproceedings{ xml:index:7, 
-author={Rao, P. and Moon, B.}, 
-booktitle={Data Engineering, 2004. Proceedings. 20th International Conference on}, 
-title={PRIX: indexing and querying XML using prufer sequences}, 
-year={2004}, 
-month={March}, 
-pages={288--299}, 
-keywords={XML;database indexing;pattern matching;query processing;sequences;tree data structures;trees (mathematics);B-tree;Prufer sequence;XML database;XML document indexing;false alarm;holistic processing;query processing;refinement phase;root-to-leaf path;twig pattern processing;Computer science;Databases;Indexing;Information representation;Internet;Merging;Moon;Pattern matching;Query processing;XML}, 
-doi={10.1109/ICDE.2004.1320005}, 
-ISSN={1063-6382}
-}
-
-@inproceedings{ xml:index:11,
- author = {Wang, Haixun and Park, Sanghyun and Fan, Wei and Yu, Philip S.},
- title = {ViST: A Dynamic Index Method for Querying XML Data by Tree Structures},
- booktitle = {Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data},
- series = {SIGMOD '03},
- year = {2003},
- isbn = {1-58113-634-X},
- location = {San Diego, California},
- pages = {110--121},
- numpages = {12},
- doi = {10.1145/872757.872774},
- acmid = {872774},
- publisher = {ACM},
- address = {New York, NY, USA},
-}
-
-@inproceedings{ xml:index:2,
-author = {Qinghua Zou and Shaorong Liu and Wesley W. Chu},
-title = {Ctree: a compact tree for indexing XML data},
-booktitle = {Web Information and Data Management},
-year = {2004},
-pages = {39--46},
-doi = {10.1145/1031453.1031462},
-masid = {1242245}
-}
-
-@inproceedings{ xml:index:1,
- author = {Pettovello, P. Mark and Fotouhi, Farshad},
- title = {MTree: An XML XPath Graph Index},
- booktitle = {Proceedings of the 2006 ACM Symposium on Applied Computing},
- series = {SAC '06},
- year = {2006},
- isbn = {1-59593-108-2},
- location = {Dijon, France},
- pages = {474--481},
- numpages = {8},
- doi = {10.1145/1141277.1141389},
- acmid = {1141389},
- publisher = {ACM},
- address = {New York, NY, USA},
- keywords = {XML, XPath, graph, index, threaded paths}
-} 
-
-@inproceedings{ xml:index:5,
- author = {Kaushik, Raghav and Bohannon, Philip and Naughton, Jeffrey F and Korth, Henry F},
- title = {Covering Indexes for Branching Path Queries},
- booktitle = {Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data},
- series = {SIGMOD '02},
- year = {2002},
- isbn = {1-58113-497-5},
- location = {Madison, Wisconsin},
- pages = {133--144},
- numpages = {12},
- doi = {10.1145/564691.564707},
- acmid = {564707},
- publisher = {ACM},
- address = {New York, NY, USA}
-} 
-
-@inproceedings{ xml:index:3, 
-author={Nan Tang and Yu, J.X. and Ozsu, M.T. and Kam-Fai Wong}, 
-booktitle={Data Engineering, 2008. On ICDE 2008, IEEE 24th International Conference}, 
-title={Hierarchical Indexing Approach to Support XPath Queries}, 
-year={2008}, 
-month={April}, 
-pages={1510--1512}, 
-keywords={XML;indexing;query processing;XML path indexing;XPath queries;hierarchical indexing approach;Books;Database languages;Indexing;Robustness;XML}, 
-doi={10.1109/ICDE.2008.4497606}
-}
-
-@inproceedings{ xml:index:6,
-year={1999},
-isbn={978-3-540-65452-0},
-booktitle={Database Theory -- ICDT’99},
-volume={1540},
-series={Lecture Notes in Computer Science},
-editor={Beeri, Catriel and Buneman, Peter},
-title={Index Structures for Path Expressions},
-url={http://dx.doi.org/10.1007/3-540-49257-7_18},
-publisher={Springer Berlin Heidelberg},
-author={Milo, Tova and Suciu, Dan},
-pages={277--295},
-}
-
-
-@book{DBLP:books/ox/CrochemoreR94,
-  author    = {Maxime Crochemore and
-               Wojciech Rytter},
-  title     = {Text Algorithms},
-  publisher = {Oxford University Press},
-  year      = {1994},
-  isbn      = {0-19-508609-0},
-  ee        = {http://www-igm.univ-mlv.fr/$\sim$mac/REC/B1.html, http://www.mimuw.edu.pl/$\sim$rytter/BOOKS/text-algorithms.pdf},
-  bibsource = {DBLP, http://dblp.uni-trier.de}
-}
-
-@book{crochemore2007algorithms,
-  title={Algorithms on strings},
-  author={Crochemore, Maxime and Hancart, Christophe and Lecroq, Thierry},
-  year={2007},
-  publisher={Cambridge Univ Pr}
-}
-
-
-@MISC{ xpath:w3c,
-  AUTHOR = {Clark, J. and DeRose, S.},
-  TITLE  = {XML Path Language (XPath) Version 1.0},
-  PUBLISHER = { W3C },
-  YEAR   = {Nov 1999},
-  URL    = {http://www.w3.org/TR/xpath},
-  CITEDATE= {2015-02-03},
-  howpublished = {online}
-}
-
-@MISC{ xpointer:w3c,
-  AUTHOR = {DeRose, S.},
-  TITLE  = {XML Pointer Language (XPointer)},
-  PUBLISHER = { W3C },
-  YEAR   = {2002},
-  URL    = {http://www.w3.org/TR/xptr},
-  CITEDATE= {2015-03-04},
-  howpublished = {online}
-}
-
-@MISC{ xlink:w3c,
-  AUTHOR = {DeRose, S.},
-  TITLE  = {XML Linking Language (XLink) Version 1.0},
-  PUBLISHER = { W3C },
-  YEAR   = {2001},
-  URL    = {http://www.w3.org/TR/xlink},
-  URLDATE= {2015-03-04},
-  CITEDATE= {2015-03-04},
-  howpublished = {online}
-}
-
-@MISC{arbology,
-  AUTHOR = {Bořivoj Melichar and Jan Janoušek and Tomáš Flouri},
-  PUBLISHER = {CTU, Faculty of Information Technology},
-  TITLE  = {Introduction to Arbology},
-  URL= {https://edux.fit.cvut.cz/oppa/PI-ARB/prednasky/arbology.pdf},
-  howpublished = {online},
-  citedate = {2015/05/01},
-}
-
-@inproceedings{papakonstantinou1995object,
-  title={Object exchange across heterogeneous information sources},
-  author={Papakonstantinou, Yannis and Garcia-Molina, Hector and Widom, Jennifer},
-  booktitle={Data Engineering, 1995. Proceedings of the Eleventh International Conference on},
-  pages={251--260},
-  year={1995},
-  organization={IEEE}
-}
-
-@article{mchugh1997lore,
-  title={Lore: A database management system for semistructured data},
-  author={McHugh, Jason and Abiteboul, Serge and Goldman, Roy and Quass, Dallan and Widom, Jennifer},
-  journal={SIGMOD record},
-  volume={26},
-  number={3},
-  pages={54--66},
-  year={1997}
-}
-
-@techreport{goldman1997dataguides,
-  title={Dataguides: Enabling query formulation and optimization in semistructured databases},
-  author={Goldman, Roy and Widom, Jennifer},
-  year={1997},
-  institution={Stanford}
-}
-
-@inproceedings{nestorov1997representative,
-  title={Representative objects: Concise representations of semistructured, hierarchical data},
-  author={Nestorov, Svetlozar and Ullman, Jeffrey and Wiener, Janet and Chawathe, Sudarashan},
-  booktitle={Data Engineering, 1997. Proceedings. 13th International Conference on},
-  pages={79--90},
-  year={1997},
-  organization={IEEE}
-}
-
-@article{goldman1999semistructured,
-  title={From semistructured data to XML: Migrating the Lore data model and query language},
-  author={Goldman, Roy and McHugh, Jason and Widom, Jennifer},
-  year={1999}
-}
-
-@article{dasg:1,
-title = {Searching subsequences},
-journal = {Theoretical Computer Science},
-volume = {78},
-number = {2},
-pages = {363--376},
-year = {1991},
-issn = {0304-3975},
-doi = {http://dx.doi.org/10.1016/0304-3975(91)90358-9},
-url = {http://www.sciencedirect.com/science/article/pii/0304397591903589},
-author = {Ricardo A. Baeza-Yates}
-}
-
-@article{dasg:3,
-title = {Directed acyclic subsequence graph -- Overview},
-journal = {Journal of Discrete Algorithms},
-volume = {1},
-number = {3-4},
-pages = {255--280},
-year = {2003},
-issn = {1570-8667},
-url = {http://www.sciencedirect.com/science/article/pii/S1570866703000297},
-author = {Maxime Crochemore and Bořivoj Melichar and Zdeněk Troníček},
-keywords = "Searching subsequences",
-keywords = "Directed acyclic subsequence graph",
-keywords = "Subsequence automation "
-}
-
-@INPROCEEDINGS{dasg:4, 
-author={Hoshino, H. and Shinohara, A. and Takeda, M. and Arikawa, S.}, 
-booktitle={String Processing and Information Retrieval, 2000. SPIRE 2000. Proceedings. Seventh International Symposium on}, 
-title={Online construction of subsequence automata for multiple texts}, 
-year={2000}, 
-month={}, 
-pages={146--152}, 
-keywords={computational complexity;deterministic automata;finite automata;query processing;set theory;text analysis;alphabet;deterministic finite automaton;minimum automaton;multiple texts;online algorithm;online construction;preprocessing;subsequence automata;subsequence automaton;Automata;Computational complexity;Data structures;Gain measurement;Informatics;Machine learning;Machine learning algorithms;Text recognition;Upper bound}, 
-doi={10.1109/SPIRE.2000.878190},}
-
-@incollection{dasg:5,
-year={2002},
-isbn={978-3-540-44158-8},
-booktitle={String Processing and Information Retrieval},
-volume={2476},
-series={Lecture Notes in Computer Science},
-editor={Laender, AlbertoH.F. and Oliveira, ArlindoL.},
-title={On the Size of DASG for Multiple Texts},
-url={http://dx.doi.org/10.1007/3-540-45735-6_6},
-publisher={Springer Berlin Heidelberg},
-author={Crochemore, Maxime and Troníček, Zdeněk},
-pages={58-64},
-}
-
-@misc{dataset:xmark,
-  title = {XMark -- An XML Benchmark Project},
-  author = {Schimdt{, et al}},
-  url = {http://www.xml-benchmark.org/},
-  howpublished = {online},
-  citedate = {2015/04/27}
-}
-
-@misc{saxon,
-  title = {SAXON -- The XSLT and XQuery Processor},
-  author = {{SAXONICA}},
-  url = {http://saxon.sourceforge.net/},
-  howpublished = {online},
-  citedate = {2015/04/28}
-}
-
-@misc{xmlgen,
-  title = {xmlgen -- faq},
-  author = {Florian Waas},
-  url = {http://www.xml-benchmark.org/faq.txt},
-  howpublished = {online},
-  citedate = {2015/04/27}
-}
-
-@article{rabin1959finite,
-  title="Finite automata and their decision problems",
-  author="Michael O Rabin and Dana Scott",
-  journal={IBM journal of research and development},
-  volume={3},
-  number={2},
-  pages={114--125},
-  year={1959},
-  publisher={IBM}
-}
-
-@misc{test,
-    author = {{Joe Black}},
-    title = {Foobar 1.0},
-    year = {1996},
-    month = {1},
-    url = {http://www.aaa.bb.cccc.dh/uploads/ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd.pdf},
-    urldate = {2011-03-02},
-    sortname = {Sun},
-    keywords = {www}
+	author       = {Leonid Libkin},
+	year         = {2005},
+	isbn         = {978-3-540-27580-0},
+	booktitle    = {Automata, Languages and Programming},
+	volume       = {3580},
+	series       = {Lecture Notes in Computer Science},
+	editor       = {Caires, Luís and Italiano, Giuseppe and Monteiro, Luís and Palamidessi, Catuscia and Yung, Moti},
+	title        = {Logics for Unranked Trees: An Overview},
+	publisher    = {Springer Berlin Heidelberg},
+	pages        = {35--50},
+}
+
+@inproceedings{def:1,
+	author       = {Frank Neven},
+	year         = {2002},
+	isbn         = {978-3-540-44240-0},
+	booktitle    = {Computer Science Logic},
+	volume       = {2471},
+	series       = {Lecture Notes in Computer Science},
+	editor       = {Bradfield, Julian},
+	title        = {Automata, Logic, and XML},
+	publisher    = {Springer Berlin Heidelberg},
+	pages        = {2--26},
+}
+
+@misc{jakZiskatAcko,
+  author        = {Rick Astley},
+  title         = {Never Gonna Give You Up (Official Music Video) -- YouTube},
+  url           = "https://www.youtube.com/watch?v=dQw4w9WgXcQ&ab_channel=RickAstley",
+  month         = {10},
+  year          = {2009},
+  howpublished  = {online},
+  note          = "[Citováno 7. 1. 2025]"
 }
\ No newline at end of file
--- a/text/text.tex
+++ b/text/text.tex
@@ -128,7 +128,7 @@ Curabitur ligula sapien, pulvinar a vestibulum quis, facilisis vel sapien. Duis
 \section{Class aptent taciti}
  
  
-Even though dark mode can be very nice for websites and apps, it does not look good when printed. Consider using white mode when print-screening dark-moded content. The contrast with the white page is too big, as seen in figure~\ref{fig:Darkmode}.
+Even though dark mode can be very nice for websites and apps, it does not look good when printed. Consider using white mode when print-screening dark-moded content. The contrast with the white page is too big, as seen in Figure~\ref{fig:Darkmode}.
  
 \begin{figure}[!htbp]
    \centering
@@ -196,15 +196,15 @@ Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliqu
 % \caption{Zbytečný kód}\label{list:8-6}
 % \end{listing}
 % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-Nullam feugiat, turpis at pulvinar vulputate, erat libero tristique tellus, nec bibendum odio risus sit amet ante. Aenean id metus id velit ullamcorper pulvinar. Fusce wisi. Integer lacinia. Aliquam id dolor. Pellentesque pretium lectus id turpis. Suspendisse sagittis ultrices augue. In laoreet, magna id viverra tincidunt, sem odio bibendum justo, vel imperdiet sapien wisi sed libero. Sed ac dolor sit amet purus malesuada congue. \cite{Crochemore2002}
+Nullam feugiat, turpis at pulvinar vulputate, erat libero tristique tellus, nec bibendum odio risus sit amet ante. Aenean id metus id velit ullamcorper pulvinar. Fusce wisi. Integer lacinia. Aliquam id dolor. Pellentesque pretium lectus id turpis. Suspendisse sagittis ultrices augue. In laoreet, magna id viverra tincidunt, sem odio bibendum justo, vel imperdiet sapien wisi sed libero. Sed ac dolor sit amet purus malesuada congue.~\cite{Crochemore2002}
  
-Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos hymenaeos. Fusce suscipit libero eget elit. Etiam dui sem, fermentum vitae, sagittis id, malesuada in, quam. Aliquam id dolor. Curabitur bibendum justo non orci. Duis viverra diam non justo. Curabitur ligula sapien, pulvinar a vestibulum quis, facilisis vel sapien. Duis condimentum augue id magna semper rutrum. Aliquam ornare wisi eu metus. Fusce aliquam vestibulum ipsum. Vivamus ac leo pretium faucibus. \cite{Motwani2014}
+Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos hymenaeos. Fusce suscipit libero eget elit. Etiam dui sem, fermentum vitae, sagittis id, malesuada in, quam. Aliquam id dolor. Curabitur bibendum justo non orci. Duis viverra diam non justo. Curabitur ligula sapien, pulvinar a vestibulum quis, facilisis vel sapien. Duis condimentum augue id magna semper rutrum. Aliquam ornare wisi eu metus. Fusce aliquam vestibulum ipsum. Vivamus ac leo pretium faucibus.~\cite{Motwani2014}
  
 %---------------------------------------------------------------
 \subsection{Ut enim ad minim veniam, quis nostrud}
 %---------------------------------------------------------------
  
-Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Nulla non arcu lacinia neque faucibus fringilla. Vestibulum erat nulla, ullamcorper nec, rutrum non, nonummy ac, erat. Aliquam erat volutpat. Proin pede metus, vulputate nec, fermentum fringilla, vehicula vitae, justo. Etiam dictum tincidunt diam. In laoreet, magna id viverra tincidunt, sem odio bibendum justo. \cite{Sestakova2018} 
+Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Nulla non arcu lacinia neque faucibus fringilla. Vestibulum erat nulla, ullamcorper nec, rutrum non, nonummy ac, erat. Aliquam erat volutpat. Proin pede metus, vulputate nec, fermentum fringilla, vehicula vitae, justo. Etiam dictum tincidunt diam. In laoreet, magna id viverra tincidunt, sem odio bibendum justo.~\cite{Sestakova2018} 
  
 \begin{table}\centering
 \begin{tabular}{l|l|c|c}
@@ -275,11 +275,11 @@ Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos
 	Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Curabitur sagittis hendrerit ante. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos hymenaeos. Cras pede libero, dapibus nec, pretium sit amet, tempor quis. Sed vel lectus. Donec odio tempus molestie, porttitor ut, iaculis quis, sem. Cras pede libero, dapibus nec, pretium sit amet, tempor quis. Sed vel lectus. 
 \end{chapterabstract}
  
-Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Curabitur sagittis hendrerit ante. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos hymenaeos. Cras pede libero, dapibus nec, pretium sit amet, tempor quis. Sed vel lectus. Donec odio tempus molestie, porttitor ut, iaculis quis, sem. Suspendisse sagittis ultrices augue. Donec ipsum massa, ullamcorper in, auctor et, scelerisque sed, est. In sem justo, commodo ut, suscipit at, pharetra vitae, orci. Pellentesque pretium lectus id turpis. \cite{Kopka2004}
+Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Curabitur sagittis hendrerit ante. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos hymenaeos. Cras pede libero, dapibus nec, pretium sit amet, tempor quis. Sed vel lectus. Donec odio tempus molestie, porttitor ut, iaculis quis, sem. Suspendisse sagittis ultrices augue. Donec ipsum massa, ullamcorper in, auctor et, scelerisque sed, est. In sem justo, commodo ut, suscipit at, pharetra vitae, orci. Pellentesque pretium lectus id turpis.~\cite{Kopka2004}
  
 \section{Donec odio tempus molestie}
  
-\lipsum[2] \cite{def:1, def:2}
+\lipsum[2]~\cite{def:1, def:2}
  
 \subsection{Class aptent taciti}
  
@@ -292,7 +292,7 @@ Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Curabitur sagittis hen
  
 \item[Kapitola 3] Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Curabitur sagittis hendrerit ante. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos hymenaeos. Cras pede libero, dapibus nec, pretium sit amet, tempor quis.
  
-\item[Kapitola 4] Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Curabitur sagittis hendrerit ante. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos hymenaeos. Cras pede libero, dapibus nec, pretium sit amet, tempor quis.
+\item[Kapitola 4] Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Curabitur sagittis hendrerit ante. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos hymenaeos. Cras pede libero, dapibus nec, pretium sit amet, tempor quis.~\cite{jakZiskatAcko}
 \end{description}
  
 \lipsum[2]