International world wide web conference

P
 
|
 
39
  
»
 Moussa Lo, Gaoussou Camara, Al Hassim Diallo, Jacques-Noël Tendeng and Seynabou Lo :  
   
  Towards a National 
 
  
»
 Medical Information System for Senegal (SIMENS)
  
»
 Pasteur Poda : Situation-aware e-Steering Design for African Parliaments
3:30 pm
 
–
 
4:00 pm
 BREAK
4:00 pm – 6:00 pm
 
PUBLIC PANEL ON WEB TECHNOLOGY IN AFRICA
8:00 pm – 11:00 pm
 
SOCIAL EVENT

---

---

P
 
|
 
41
TUT
ORIALS
TUTORIALS
MONDAY
 APRIL 11
COMPUTATIONAL SOCIAL SCIENCE FOR THE WORLD WIDE WEB  
|
  ROOM 519A
9:00 am – 12:30 pm & 2:00 pm – 5:30 pm
PRESENTERS 
MARKUS STROHMAIER, UNIVERSITY OF KOBLENZ-LANDAU
CLAUDIA WAGNER, LEIBNIZ INSTITUTE FOR THE SOCIAL SCIENCES
LUCA AIELLO, UNIVERSITY OF TORINO
INGMAR WEBER, QATAR COMPUTING RESEARCH INSTITUTE
ABSTRACT
Due to the increasing availability of large-scale data on human behavior collected on the social web, as well 
as advances in analyzing larger and larger data sets, interest in applying computer science methods to address 
research questions in the social sciences continues to grow. “Big Data” researchers and “Data Scientists” entering 
the interdisciplinary field of Computational Social Science (CSS) often lack background in theories and methods 
in sociology, whereas sociologists are often not aware of cutting edge advances in computational methods. This 
tutorial helps to bridge this gap by providing an introduction to statistical and computational methods that are 
useful for addressing typical social science research questions with observational data (that can e.g. be found on 
the Web) and to social theories and models that help to understand the process that generated the data. The goal 
of this tutorial is to give participants a rich repertoire of methods that help to answer not only interesting “how” 
questions but also more fundamental “why” questions.
The tutorial will run as a full-day event that is divided into two main parts: first we will focus on challenges for em-
pirical computational social scientist and will present state of the art methods that help to address problems such 
as self-selection bias and non-representativeness. We will also discuss how construct validity can be ensured when 
working with low-level signals such as clickstreams or tweets. In the second part we will focus on social theories 
and models that can be used to complement and enrich data-driven research. The goal is to give participants an 
overview about different theories and models that are relevant in this field and show them how to incorporate 
theoretical assumptions about the data generation process into a model that can be validated against data.

---

W W W 2 0 1 6
 
|
  2 5
T H
  I N T E R N AT I O N A L   W O R L D   W I D E   W E B   C O N F E R E N C E
CENTRALITY MEASURES ON BIG GRAPHS: EXACT, APPROXIMATED, AND DISTRIBUTED 
ALGORITHMS  
|
  ROOM 519B
9:00 am  –  12:30 pm
PRESENTERS
FRANCESCO BONCHI, ISI FOUNDATION
GIANMARCO DE FRANCISCI MORALES, QATAR COMPUTING RESEARCH INSTITUTE
MATTEO RIONDATO, TWO SIGMA INVESTMENTS
ABSTRACT
Centrality measures allow to measure the relative importance of a node or an edge in a graph w.r.t. other nodes 
or edges. In this tutorial, we survey the different definitions of centrality measures and the algorithms to compute 
them. We start from the most common measures (e.g., closeness centrality, betweenness centrality) and move to 
more complex ones, like spanning-edge centrality. In our presentation, we begin from exact algorithms and then 
move to approximation algorithms, including sampling-based ones, and to highly-scalable MapReduce algo-
rithms for huge graphs, both for exact computation and for keeping the measures up-to-date on dynamic graphs 
where edges are inserted or deleted over time. Our goal is to show how advanced algorithmic techniques and 
scalable systems can be used to obtain efficient algorithms for important graph mining tasks, and to encourage 
research in the area by highlighting open problems and possible directions.
A mini-website for the tutorial is available at 
http://matteo.rionda.to/centrtutorial/
.
CRYPTOGRAPHIC CURRENCIES CRASH COURSE  
|
  ROOM 519B
2:00 pm  –  5:30 pm
PRESENTERS
ALJISHA JUDMAYER, SBA RESEARCH
EDGAR WEIPPL, SBA RESEARCH
ABSTRACT
This tutorial aims to further close the gap between IT security research and the area of cryptographic currencies 
and block chains. We will describe and refer to Bitcoin as an ex- ample throughout the tutorial, as it is the most 
prominent representative of a such a system. It also is a good reference to discuss the underlying block chain 
mechanics which are the foundation of various altcoins (e.g. Namecoin) and other derived systems. In this tutorial, 
the topic of cryptographic currencies is solely addressed from a technical IT security point-of-view. Therefore we 
do not cover any legal, sociological, financial and economical aspects. The tutorial is designed for participants 
with a solid IT security background but will not assume any prior knowledge on cryptographic currencies. Thus, 
we will quickly advance our discussion into core aspects of this field.

---