Performing the analysis of BC scores across snapshots.- Plots the percentage overlap for 2 different snapshots- Plots the percentage overlap for t consecutive snapshots- Plots the inter-change histogram- Plots the cumulative distribution for inter-change.

[working] Generate graphs showing the percentage of overlapping for top-k nodes.

Plot the graph to compare different snapshot with Spearman correlation coefficient

[milestone][HBC] Making HBC work with subtracting bc_inter as described in Puzis 2012 paper.

[Experiment] Input graphs in a zipped file. There are 300 graphs for each graph types Community Network | Power Law | Erdos.

[Experiment] All the input graphs

[Thesis] Final LaTeX version

The experiment result output: all the graphs (running time comparison betweenn HBC, BBC; the speed-up ratio), and the data after processing.

All the data of the experiments for Heuristic Betweenness Centrality and Brandes BC.

[Milestone] Analysis - automatically generate all the graph for all *.out1 input. Those graphs are:- Line chart of running time for BC and HBC with the increasing number of nodes for each graph type [CN | PL | ER] on [router | server] > 4 charts- Bar chart for running time of BC, HBC on [router | server] for Real Community Networks Ninux, FFG, FFW > 2 charts...

- Read the input with both csv and space-separated file.- Output values are separated by comma.

[note]

[thesis - latex] All the writing of the thesis up to now

Plot the running time of BC and HBC for 3 types of graphs: Erdos, Community Network and Power Lab

Analyze the experiment result.Input: *.out1Output: *.out2, *.out3

.out2 the average running time for each graphs, from 10 repetitions..out3 the average running time for each [graph type (Community Network, Erdos), and number of nodes (from 100 - 1000)]...

Simulation with output both the clock_begin, clock_end

Analyze the bi-connected components for CN and PL graphs

Code to run experiments

Makefile for different targets: arm, mips

[b] HBC doesn't work in QEMU since I miss the "return" statement.

[OpenWrt] Script to move source code, and compile toolchain

[OpenWrt] Script to move graph-parser and compile toolchain into OpenWrt Image with the graph-parse inside.

Making the parser receiving the input from commandline

[HBC - Python] Backup code

[report] Backup all the report

[HBCW] Heuristic Betweenness Centrality for weighted graph

[HBC]It's now working with- jsoninfo_topo.json- graph where there are edges that are not included in Bi-Connected Components (for example, in jsoninfo_topo.json

Check whether graph is connected

[milestone] HBC - working for unweighted graph. The script.sh generates the output and the score for BC and HBC.

[f] Count how many times a certain value (not key) appearing in a Map.

[f] Skeleton for HBC calculation. For each sub-component, now we are using the standard function boost::brandes_betweenness_centrality() to get their BC scores.

[HBC] BC score for Sub-Component.

[f] Adding test

[R] Working: Refactor Heuristic BCC version. Now all the Link Weight and Traffic Matrix for each Sub-Component are correct. Also, we have the Graph object for each Sub-Component.

[cpp, r] Done with creating subgraph for each sub component

[cpp] Heuristic - Jan 14 - output graph

[misc] Test set used to find bug in HBC

[latex] Update note

[latex] Report Dec 20

[f] WBBC = HBC :)

Heuristic BC for different graphs

Compute Component Tree Weights - Bugs fixed- Component-vertex pair (B, v): minus 1 unit more- Vertex-component pair (v, B): initialize size = 0

Results: Correct even for Sample 4. Still not correct for Ninux Graph.

More examples to debug the Computing Component Tree Weights - I found problems for the simple4.edges

Debugging the Algorithm 1: Compute Component Tree Weights [Puzis 2012]

[r] Use reference-to-const for function arguments.

[r] Split into modules

[r] Modularized into parser, utility for code to calculate betweennes

[r] Modularize code

Done with creating the communication importance matrix (or Traffic Matrix). This is necessary in calculating betweenness centrality later

Heuristic Betweenness for Structurally Equivalence Class

[r] Heuristic Betweenness for bi-connected components

Heuristic betweenness centrality - block cut tree

[note] - Update note for week 10

Add label to x and y-axis in graph

Script to plot comparison graph between networkx and Boost Graph Library

Comparision between networkx and Boost Graph Library

Those python packages that are not necessary for the thesis anymore

Useful script to move things around/compile firmware image/running image

Update image for Thesis Note

Fiddling around with C++ - pointer and template function

Parse simple graph + JSON graph + calling betweenness centrality

Modify gitignore for C++ project

Package to test the boots/graph library

Package to test the boots/lambda library

Report

Note for week 3

Compile OpenWrt toolchain, and compile package with OpenWrt SDK

Adding note

Add .gitignore

Fiddling around with networkx library

First commit - testing

(1-70/70) Per page: 25, 50, 100

Also available in: Atom