Tuesday, January 22, 2019

[DMANET] [CFP] IEEE INFOCOM CAOS 2019: ** final deadline January 24 **

===============================================================================
===============================================================================

IEEE CAOS 2019

The First IEEE INFOCOM Workshop on the
Communications and Networking Aspects of Online Social Networks

April 29, 2019 - Paris, France


*** FINAL submission deadline: January 24, 2019 ***


+++ Fast-track publication of selected papers in Online Social Networks
and Media Journal (Elsevier)

===============================================================================
===============================================================================

Online Social Networks (OSNs) are a multidisciplinary research
playground. On the one hand, they represent a challenging environment
for researchers working in academia and industry to develop the next
generation of networking platforms and their services. At the same time,
the digital footprints that people leave behind through OSNs provide a
unique source to investigate and understand (by exploiting BigData
analytics) people's behavior, human relationships, and societal
phenomena such as epidemics spreading, terrorist networks, the diffusion
of opinions, the pulse of a city, the evolution of migrations, etc.

IEEE CAOS focuses on (i) understanding the behavior of OSN systems, and
OSN users; (ii) designing OSN mechanisms, services and applications for
the benefit of users, (iii) controlling the use, and possibly, misuse of
OSN services; (iv) predicting the way information spreads in OSN and
users acquire or lose importance and influence in their local and global
communities.

CAOS aims to provide a reference forum targeted not only to the
community of researcher working on networking technologies for OSN, but
it aims at engaging a multidisciplinary community of researchers working
at the intersection between computer networking, complex networks, Big
Data analytics, focusing on network technologies and abstractions for
OSN. Therefore, the workshop also welcomes submissions applying a wide
range of (computer- and network-science) techniques and tools to OSN for
investigating the properties and roles of the network of (online) social
relationships in the various sectors of the society (e.g., politics,
economics, finance, health, entertainment).

Topics include, but are not limited to:

- Communications challenges in OSNs;
- Platforms, protocols, and applications for OSNs;
- Decentralized, mobile, and location-based OSNs;
- Trust, reputation, privacy, and security in OSNs;
- Adversarial-aware analysis of OSN data;
- Dynamics of trends, information and opinion diffusion in OSNs;
- Recommendations and advertising in OSNs;
- Social Search in OSNs;
- Measurement, analysis, and modeling of popular online social networks;
- BigData analysis of OSNs seen as complex networked systems;
- Information extraction and search in OSNs;
- Complex-network analysis of OSNs;
- Measurement, analysis, and modeling of networked users' behavior
through OSNs data;
- Analysis of the use of OSNs in the urban context;
- Network challenges of crowdsourcing in OSNs;
- Network challenges in multidisciplinary applications of OSNs
(economics, medicine, society, politics, homeland security, etc.);
- AI technologies applied to OSNs modeling and analysis.


## PAPER FORMAT AND SUBMISSION INSTRUCTIONS

Papers must be submitted electronically as PDF files, formatted for
8.5x11-inch paper. The length of the paper must be no more than 6 pages
(+2 extra pages with over-length charge of $100/page) in the IEEE
double-column format (10-pt font).

Papers should neither have been published elsewhere nor being currently
under review by another conference or journal. The reviews will be
single blind. At least one of the authors of every accepted paper must
register and present the paper at the workshop. Accepted papers will be
published in the combined INFOCOM 2019 Workshop proceedings and will be
submitted to IEEE Xplore.

EDAS link for paper submission: http://edas.info/N25572


## EDITORIAL FOLLOW-UPS

Extended versions of workshop selected papers will be considered for
possible fast-track publication on the Online Social Networks and Media
Journal (Elsevier).

## IMPORTANT DATES

- Submission Deadline (final): 24 January 2019
- Acceptance Notification: 22 February 2019
- Camera Ready Due: 10 March 2019


## WORKSHOP STEERING COMMITTEE CHAIR

Marco Conti (IIT-CNR, Italy)


## WORKSHOP CHAIRS

Chiara Boldrini (IIT-CNR, Italy)
Fabrizio Silvestri (Facebook, UK)

## PUBLICITY CHAIR

Mustafa Toprak (IIT-CNR, Italy)


## TECHNICAL PROGRAM COMMITTEE

- Tarek Abdelzaher, University of Illinois, Urbana Champaign, USA
- Luca Aiello, Bell Labs, Cambridge, UK
- Nino Antulov-Fantulin, ETH, Switzerland
- Mauro Conti, University of Padua, Italy
- Jon Crowcroft, University of Cambridge, United Kingdom
- Aristides Gionis, Aalto University, Finland
- Adriana Iamnitchi, University of South Florida, USA
- Huan Liu, Arizona State University, USA
- Giovanni Neglia, INRIA, France
- Nishanth R. Sastry, King's College London, UK
- Thorsten Strufe, TU Dresden, Germany
- Ananthram Swami, Army Research Lab., USA
- Gabriele Tolomei, Università degli Studi di Padova, Italy
- Gareth Tyson, Queen Mary University, UK
- Panayiotis Tsaparas, University of Ioannina, Greece
- Onur Varol, Northeastern University, USA
- Wenye Wang, North Carolina State University, USA
- Junshan Zhang, Arizona State University, USA
- Zhi-Li Zhang, University of Minnesota, USA

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************