arma-thesis

git clone https://git.igankevich.com/arma-thesis.git
Log | Files | Refs | LICENSE

commit a43f8ba96497ffa0468c8ee8b9493ea726f66921
parent cf40ca271660966560e98639deaa35cca5a269a7
Author: Ivan Gankevich <igankevich@ya.ru>
Date:   Mon,  6 Feb 2017 17:33:04 +0300

Add graphs.

Diffstat:
phd-diss-ru.org | 6+-----
phd-diss.org | 8++------
2 files changed, 3 insertions(+), 11 deletions(-)

diff --git a/phd-diss-ru.org b/phd-diss-ru.org @@ -2582,12 +2582,8 @@ cite:lantz2010network,handigol2012reproducible,heller2013reproducible, где при запуске на 11 узлах представлен на [[fig:tree-hierarchy-11]]. #+name: fig:bootstrap-local -#+begin_src R -# TODO -#+end_src - #+caption: Зависимость времени объединения узлов в кластер от их количества. -#+RESULTS: fig:bootstrap-local +[[file:graphics/discovery.eps]] #+name: fig:tree-hierarchy-11 #+begin_src dot :exports results :file build/tree-hierarchy-11-ru.pdf diff --git a/phd-diss.org b/phd-diss.org @@ -2402,12 +2402,8 @@ principal only, and inefficient scan of all network by each node does not occur. **** Evaluation results. #+name: fig:bootstrap-local -#+begin_src R -# TODO -#+end_src - -#+caption: Зависимость времени объединения узлов в кластер от их количества. -#+RESULTS: fig:bootstrap-local +#+caption: Time to discover all nodes of the cluster in depending on number of nodes. +[[file:graphics/discovery.eps]] #+name: fig:tree-hierarchy-11 #+begin_src dot :exports results :file build/tree-hierarchy-11.pdf