Add sections layout

l4proj.bib

@@ -1,10 +1,16 @@
-@misc{Lichman:2013 ,
+@misc{UCL_Data,
 author = "M. Lichman",
 year = "2013",
 title = "{UCI} Machine Learning Repository",
 url = "http://archive.ics.uci.edu/ml",
 institution = "University of California, Irvine, School of Information and Computer Sciences" }
 
+@phdthesis{Antartica_Data,
+title={An Algorithmic Framework for Visualising and Exploring Multidimensional Data},
+author={Ross, Greg},
+year={2005}}
+
+%========================================================================================
 % From example
 @Misc{JChoco,
 title = {{CHOCO Solver}},
@@ -65,8 +71,8 @@ title = {{New Methods to Color the Vertices of a Graph}},
 journal = "Communications of the ACM",
 volume = 22,
 number = 4,
-pages = {251-256}, 
+pages = {251-256},
-year = 1979} 
+year = 1979}
 
 @article{welshPowell,
 author = "D.J.A. Welsh and M.B. Powell",
@@ -74,8 +80,8 @@ title = {{An upper bound for the chromatic number of a graph and its application
 journal = "The Computer Journal",
 volume = 10,
 number = 1,
-pages = {85-86}, 
+pages = {85-86},
-year = 1967} 
+year = 1967}
 
 @article{matulaBeck,
 author = "David W. Matula and Lelan L. Beck",
@@ -83,8 +89,8 @@ title = {{Smallest-Last Ordering and Clustering and Graph Coloring Algorithms}},
 journal ="Journal of the Association for Computing Machinery",
 volume = 30,
 number = 3,
-pages = {417-427}, 
+pages = {417-427},
-year = 1983} 
+year = 1983}
 
 @article{freuder,
 author = "Eugene C. Freuder",
@@ -92,32 +98,32 @@ title = {{A Sufficient Condition for Backtrack-Free Search}},
 journal ="Journal of the Association for Computing Machinery",
 volume = 29,
 number = 1,
-pages = {24-32}, 
+pages = {24-32},
-year = 1982} 
+year = 1982}
 
 @article{wood97,
 author = "David R. Wood",
 title = {{An algorithm for finding a maximum clique in a graph}},
 journal = "Operations Research Letters",
 volume = 21,
-pages = {211-217}, 
+pages = {211-217},
-year = 1997} 
+year = 1997}
 
 @article{carraghanPardalos90,
 author = "Randy Carraghan and Panos M. Pardalos",
 title = {{An exact algorithm for the maximum clique problem}},
 journal = "Operations Research Letters",
 volume = 9,
-pages = {375-382}, 
+pages = {375-382},
-year = 1990} 
+year = 1990}
 
 @article{pardalosRodgers92,
 author = "Panos M. Pardalos and Gregory P. Rodgers",
 title = {{A Branch and Bound Algorithm for the Maximum Clique Problem}},
 journal = "Computers and Operations Research",
 volume = 19,
-pages = {363-375}, 
+pages = {363-375},
-year = 1992} 
+year = 1992}
 
 @inproceedings{geelen,
     author = {P. A. Geelen},
@@ -138,16 +144,16 @@ title = {Principles of Artificial Intelligence},
 publisher = {Springer-Verlag},
 year = 1982}
 
-@inproceedings{ckt, 
+@inproceedings{ckt,
-  author = {Peter Cheeseman and Bob Kanefsky and William M. Taylor},  
+  author = {Peter Cheeseman and Bob Kanefsky and William M. Taylor},
   year = 1991,
   title = {{Where the really hard problems are}},
   pages = "331-337",
   booktitle = {Proceedings {IJCAI'91}}
 }
 
-@inproceedings{kappa, 
+@inproceedings{kappa,
-  author = {Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Toby Walsh},  
+  author = {Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Toby Walsh},
   year = 1996,
   title = {{The constrainednss of search}},
   pages = "246-252",
@@ -160,7 +166,7 @@ author = "Brian Hayes",
 title = "Can't get no satisfaction",
 journal = "American Scientist",
 volume = 85,
-pages = "108-112", 
+pages = "108-112",
 year = 1997}
 
 @article{vardi,
@@ -219,8 +225,8 @@ year = "2009",
    year      = {2008}
 }
 
-@inproceedings{cp10wshop, 
+@inproceedings{cp10wshop,
-  author = {Patrick Prosser},  
+  author = {Patrick Prosser},
   year = 2010,
   title = {{Triangle Packing with Constraint Programming}},
   pages = "1-15",
@@ -243,8 +249,8 @@ year = "2009",
    year      = {2011}
 }
 
-@inproceedings{cp96, 
+@inproceedings{cp96,
-  author = {Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Barbara M. Smith and Toby Walsh},  
+  author = {Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Barbara M. Smith and Toby Walsh},
   year = 1996,
   title = {{An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint satisfaction Problem}},
   pages = "179-193",
@@ -268,7 +274,7 @@ title = {Algorithm 457: Finding All Cliques of an Undirected Graph [H]},
 journal = "Communications of the ACM",
 volume = 16,
 number = 9,
-pages = "575-579", 
+pages = "575-579",
 year = 1973}
 
 @article{prjo2002,
@@ -276,14 +282,14 @@ author = {Patric R. J. \"{O}sterg\aa{}rd},
 title = {A fast algorithm for the maximum clique problem},
 journal = "Discrete Applied Mathematics",
 volume = 120,
-pages = "197-207", 
+pages = "197-207",
 year = 2002}
 
 @inproceedings{tomita2010,
 author = {E. Tomita and Y. Sutani and T. Higashi and S. Takahashi and M. Wakatsuki},
 title = {A Simple and Faster Branch-and-Bound Algorithm for Finding Maximum Clique},
 booktitle = {WALCOM 2010, LNCS 5942},
-pages = "191-203", 
+pages = "191-203",
 year = 2010}
 
 @article{tomita2007,
@@ -332,11 +338,11 @@ year = 2006}
 }
 
 @article{Konc_Janezic_2007,
-title={An improved branch and bound algorithm for the maximum clique problem}, 
+title={An improved branch and bound algorithm for the maximum clique problem},
-volume={58}, 
+volume={58},
-journal={MATCH Communications in Mathematical and Computer Chemistry}, 
+journal={MATCH Communications in Mathematical and Computer Chemistry},
-author={Janez Konc and Du\u{s}anka Jane\u{z}i\u{c}}, 
+author={Janez Konc and Du\u{s}anka Jane\u{z}i\u{c}},
-year={2007}, 
+year={2007},
 pages={569--590}}
 
 @INPROCEEDINGS{aaai2010,
@@ -357,22 +363,22 @@ YEAR = {2010}  }
 author = {E. Tomita and Y. Sutani and T. Higashi and S. Takahashi and M. Wakatsuki},
 title = {An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique},
 booktitle = {DMTC 2003, LNCS 2731},
-pages = "278-289", 
+pages = "278-289",
 year = 2003}
 
 @inproceedings{eppstein2011,
 author = {David Eppstein and Darren Strash},
 title = {Listing All Maximal Cliques in Large Sparse Real-World Graphs},
 booktitle = {Experimental Algorithms, LNCS 6630},
-pages = "364-375", 
+pages = "364-375",
 year = 2011}
 
 @article{maffray1999,
-title={{Sequential colorings and perfect graphs}}, 
+title={{Sequential colorings and perfect graphs}},
-volume={94}, 
+volume={94},
-journal={Discrete Applied Mathematics}, 
+journal={Discrete Applied Mathematics},
 author={Fr\'{e}d\'{e}ric Maffray and Myriam Preissmann},
-year={1998}, 
+year={1998},
 pages={287--296}}
 
 @book{cadenhead,
@@ -384,7 +390,7 @@ year = 2011}
 @article{qsort,
 author = {Jon L. Bentley and M. Douglas McIlroy},
 title = {{Engineering a Sort Function}},
-journal = {Software-Practice and Experience}, 
+journal = {Software-Practice and Experience},
 volume = 23,
 number = 11,
 pages = {1249-1265},

l4proj.tex

@@ -6,12 +6,13 @@
 
 
 \begin{document}
-\title{How to Produce a Level 4 Project Report}
+\title{Faster force-directed layout algorithms for the D3 visualisation toolkit}
 \author{Pitchaya Boonsarngsuk}
-\date{February 29, 2013}
+\date{March 21, 2018}
 \maketitle
 
 \begin{abstract}
+% TODOO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO
 We show how to produce a level 4 project report using latex and pdflatex using the
 style file l4proj.cls\cite{Lichman:2013}
 \end{abstract}
@@ -23,100 +24,154 @@ style file l4proj.cls\cite{Lichman:2013}
 %
 \tableofcontents
 %==============================================================================
+%%%%%%%%%%%%%%%%
+%              %
+% Introduction %
+%              %
+%%%%%%%%%%%%%%%%
 \chapter{Introduction}
-\label{intro}
+\label{ch:intro}
-\pagenumbering{arabic}
+\pagenumbering{arabic} % ONLY DO THIS AT THE FIRST CHAPTER
-The first page, abstract and table of contents are numbered using Roman numerals. From now on pages are numbered
-using Arabic numerals. Therefore, immediately after the first call to $\backslash$chapter we need the call
-$\backslash$pagenumbering$\{$arabic$\}$ and this should be called once only in the document.
 
-The first Chapter should then be on page 1. You are allowed 50 pages for a 30 credit project and 35 pages for a
+\section{Motivation}
-20 credit report. This includes everything up to but excluding the appendices and bibliograph, i.e. this is a limit on
-the body of the report.
 
-You are not allowed to alter text size (it is currently 11pt) neither are you allowed to alter the margins.
+\section{Project Description}
-
-Note that in this example, and some of the others, you need to execute the following commands the first time you process the files.
-Multiple calls to pdflatex are required to resolve references to labels and citations. The file bib.bib is the bibliography file.
-
-\begin{verbatim}
-
-            > pdflatex example0
-            > bibtex example0
-            > pdflatex example0
-            > pdflatex example0
-
-\end{verbatim}
 
 
-\section{First Section in Chapter}
+%==============================================================================
-The quick brown fox jumped over the lazy dog.
-The quick brown fox jumped over the lazy dog \cite{DIMACS}.
-
-\subsection{A subsection}
-The quick brown fox jumped over the lazy dog.
-
-The quick brown fox jumped over the lazy dog.
-The quick brown fox \cite{fahle} jumped over the lazy dog.
-
-\chapter{The Fox and Dog}
-The quick brown fox jumped over the lazy dog.
-
-\section{The Fox Jumps Over}
-The quick brown fox jumped over Uroborus (Figure \ref{uroborus}).
-The quick brown fox jumped over the lazy dog.
-
-The quick brown fox jumped over the lazy dog.
-The quick brown fox jumped over the lazy dog.
-
-%\vspace{-7mm}
-\begin{figure}
-\centering
-%\includegraphics[height=9.2cm,width=13.2cm]{uroboros.pdf}
-\vspace{-30mm}
-\caption{An alternative hierarchy of the algorithms.}
-\label{uroborus}
-\end{figure}
-
-The quick brown fox jumped over the lazy dog.
-The quick brown fox jumped over \cite{ckt} the lazy dog.
-
-\section{The Lazy Dog}
-The quick brown fox jumped over the lazy dog.
-
-The quick brown fox jumped over the lazy dog.
-The quick brown fox \cite{am97} jumped over the lazy dog.
-
 %%%%%%%%%%%%%%%%
 %              %
-%  EVALUATION  %
+%  Background  %
 %              %
 %%%%%%%%%%%%%%%%
+\chapter{Background}
+\label{ch:bg}
+Something
 
+\section{Link force}
+
+\section{Chalmers' 1996 algorithm}
+
+\section{Hybrid Layout for Multidimensional Scaling}
+
+\section{Hybrid MDS with Pivot-Based Searching algorithm}
+
+
+%==============================================================================
+%%%%%%%%%%%%%%%%
+%              %
+%    Design    %
+%              %
+%%%%%%%%%%%%%%%%
+\chapter{Design}
+\label{ch:design}
+something
+
+
+\section{Technologies}
+\subsection{HTML, CSS, and SVG}
+%============================
+\subsection{Javascript}
+%============================
+\subsection{Data Driven Document}
+%============================
+\subsection{Bartasius' D3 Neighbour Sampling plug-in}
+%============================
+
+\section{Input Data and Parameters}
+
+\section{Graphical User Interface for Evaluation}
+
+
+%==============================================================================
+%%%%%%%%%%%%%%%%
+%              %
+%   Implement  %
+%              %
+%%%%%%%%%%%%%%%%
+\chapter{Implementation}
+\label{ch:imp}
+
+\section{Outline}
+
+\section{Algorithms}
+\subsection{Link force}
+%============================
+\subsection{Chalmers' 1996}
+%============================
+\subsection{Hybrid Layout}
+%============================
+\subsection{Hybrid Layout with Pivot}
+%============================
+
+\section{Integration with D3}
+
+\section{Performance-improving Decisions}
+\subsection{Different types of loops}
+%============================
+\subsection{Caching distances for Chalmers' 1996 algorithm}
+%============================
+\subsection{Multi-threading with HTML5 Web Workers}
+%============================
+
+%==============================================================================
+%%%%%%%%%%%%%%%%
+%              %
+%     EVAL     %
+%              %
+%%%%%%%%%%%%%%%%
 \chapter{Evaluation}
-The quick brown fox jumped over the lazy dog.
+\label{ch:eval}
-The quick brown fox jumped over the lazy dog.
-The quick brown fox jumped over the lazy dog.
-The quick brown fox jumped over the lazy dog.
-The quick brown fox jumped over the lazy dog \cite{DIMACS}.
-The quick brown fox jumped over the lazy dog.
-The quick brown fox jumped over the lazy dog.
-The quick brown fox jumped over the lazy dog.
-The quick brown fox jumped over the lazy dog.
 
-\section{Data set}
+\section{Data Sets}
 \label{sec:EvalDataSet}
-The data sets utilized during the developments are the Iris and Poker Hands data sets.
+The data sets utilized during the developments are the Iris, Poker Hands\cite{UCL_Data}, and Antarctic data set\cite{Antartica_Data}.
 Explain each!!!!
 
-\section{Experimental setup}
+\section{Experimental Setup}
-All tests are performed on the same data set, using metrics described in section XXX and \ref{sec:EvalDataSet}.
+% TODOO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO TODO
-The hardware and browser are also controlled.
+All experiments are performed using the same data set and the same code. However, The hardware and browser can greatly impact the JavaScript performance and have to be controlled as well.
-The computers used are HP BLA BLA with BLA, running CentOS BLA x64 with linux kernel BLA.
+The computers used are all the same model of a Dell All-in-One desktop computer with Intel\textregistered{} Core\texttrademark{} i5-3470S and 8GB of DDR3 memory, running CentOS 7 with Linux 3.10-x86-64.
-Google Chrome vBLA with its performance profiling tool is used to run the program and analyse CPU and memory usage.
+As for web browser, the official 64-bit build of Google Chrome 61.0.3163.79 is used to both run and analyse CPU and memory usage with its performance profiling tool.
 
-\subsection{Selecting parameters}
+In order to keep the results as fair as possible, the parameters were controlled as much as we could. The starting position of all nodes are locked at $(0,0)$. The web page is also refreshed after every run to make everything have been properly reset.
+
+\subsection{Stopping Condition}
+%============================
+
+\subsection{Selecting Parameters}
 To be able to compare different algorithms fairly,
+%============================
+
+\subsection{Performance metrics}
+%============================
+
+\section{Results}
+
+
+%==============================================================================
+%%%%%%%%%%%%%%%%
+%              %
+%  Conclusion  %
+%              %
+%%%%%%%%%%%%%%%%
+\chapter{Conclusion}
+\label{ch:conc}
+
+\section{Summary}
+
+\section{Learning Experience}
+
+\section{Future Work}
+\begin{itemize}
+	\item \textbf{Incorporating Chalmers' 1996 algorithm into D3 framework}
+	\item \textbf{Data Exploration}
+	\item \textbf{Data Sets}
+	\item \textbf{Optimal parameters generalisation}
+	\item \textbf{GPU rendering}
+	\item \textbf{asm.js and WebAssembly}
+	\item \textbf{Locality-Sensitive Hashing}
+\end{itemize}
 
 %%%%%%%%%%%%%%%%
 %              %
@@ -151,3 +206,30 @@ a clq file
 \bibliography{l4proj}
 
 \end{document}
+
+#if 0
+
+\chapter{Introduction}
+\label{intro} then \ref{intro}
+\section{First Section in Chapter}
+\subsection{A subsection}
+
+\vspace{-7mm}
+\begin{figure}
+\centering
+\includegraphics[height=9.2cm,width=13.2cm]{uroboros.pdf}
+\vspace{-30mm}
+\caption{An alternative hierarchy of the algorithms.}
+\label{uroborus}
+\end{figure}
+
+\begin{verbatim}
+
+            > pdflatex example0
+            > bibtex example0
+            > pdflatex example0
+            > pdflatex example0
+
+\end{verbatim}
+
+#endif