MM-INTEREST Archives

ACM SIGMM Interest List

MM-INTEREST@LISTSERV.ACM.ORG

Options: Use Forum View

Use Proportional Font
Show HTML Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sender:
ACM SIGMM Interest List <[log in to unmask]>
Date:
Wed, 20 Feb 2013 16:46:30 +0100
Reply-To:
Stefano Ferretti <[log in to unmask]>
Message-ID:
Subject:
MIME-Version:
1.0
Content-Transfer-Encoding:
7bit
In-Reply-To:
Content-Type:
text/plain; charset=ISO-8859-1; format=flowed
From:
Stefano Ferretti <[log in to unmask]>
Parts/Attachments:
text/plain (123 lines)
The deadline of SIMPLEX 2013 is approaching; February 22nd, 2013

SIMPLEX 2013 -- CALL FOR PAPERS

5th Annual Workshop on Simplifying Complex Networks for Practitioners

In conjunction with the 22nd International World Wide Web Conference (WWW)
May 13-17, 2013, Rio de Janeiro, Brazil.
URL: http://www.simplexconf.net/

Network science, sometimes also called "complex networks science", has
recently attracted much attention from the scientific community,
mainly due to the almost ubiquitous presence of complex networks in
real-world systems. Examples of complex networks are found in living
organisms, in engineering systems, as well as in social networks. Most
of the real-world systems have the required degree of complexity to be
called "complex systems". Complexity may have to do with the intricate
dynamics of the interacting components, with the non-trivial
properties of the underlying network topology, or with the sheer size
of the system itself.

Despite the numerous workshops and conferences related to network
science, it is still a set of loosely interacting communities. Those
communities would benefit from better interactions.

Simplex aims at triggering different computer science communities
(e.g. communication networks, distributed systems) to propose research
areas and topics that should be tackled from the network science
perspective. We also seek contributions from network science that are
relevant to solve practical computer science problems. Two types of
contributions are foreseen from prospective authors. The first type
would consist of use-cases of theoretical tools and methods to solve
practical problems. Such contributions should be as usable as possible
by practitioners in the related field. The second type of
contributions would come from practitioners that have identified a
problem that may be solved by tools from network sciences. The point
of such contributions is to make the network sciences community aware
of the importance of a high-impact problem, and to suggest means by
which the problem may be solved by the network sciences
community. Both contributions should stimulate interaction between
theoreticians and practitioners, and also have high potential impact
in either field.

Topics for the workshop include, but are not limited to:
   * Application of complex network theory to the design of web
applications;
   * Data mining of large scale networks;
   * Analysis of dynamic and time-varying networks;
   * Network robustness to failures and attacks;
   * Machine learning and network science;
   * Complex network theory applied to forwarding/routing problems;
   * Application of social network analysis to communication and computing
system design;
   * Mobility and connectivity modelling;
   * Network science and data and information retrieval;
   * Complex network theory and security applications;

Submission Guidelines

All submitted papers will be carefully evaluated based on their
originality, significance, technical soundness, and clarity of
expression. All papers will be reviewed by at least three members of
the technical program committee.

The proceedings of the workshop will be published by the ACM
International Conference Proceeding Series (ICPS), and will be a part
of the companion volume of the WWW 2013 proceedings. Paper submissions
should not exceed 6 pages in the ACM SIGS Proceedings Template
(http://www.acm.org/sigs/publications/proceedings-templates; MS-WORD
template is here: http://www.acm.org/sigs/publications/pubform.doc).

Submissions are now accepted at easychair
(https://www.easychair.org/conferences/?conf=simplex2013)

Important Dates
   * Submission deadline: February 22th 2013 (midnight, Pacific Standard
Time)
   * Authors notification: March 13th 2013
   * Camera-ready: March 28th, 2013
   * Workshop date: May 13, 2013

Submission site: https://www.easychair.org/conferences/?conf=simplex2013

Organizers

General Chairs
   * Pan Hui, HKUST/T-Labs, HK
   * Nishanth Sastry, Kings College London, UK

Technical Program Committee Chairs
   * Fabricio Benevenuto, Federal University of Minas Gerais, Brazil
   * Stefano Ferretti, Universita di Bologna, Italy
   * Abedelaziz Mohaisen, VeriSign Labs, USA

Technical Program Committee
   * Young-Yeol Ahn, Indiana University, USA
   * Azer Bestavros, Boston University, USA
   * Ozalp Babaoglu, University of Bologna, Italy
   * Yang Chen, Duke University, USA
   * Daniel Figueiredo, Federal University of Rio de Janeiro, Brazil
   * Amir Houmansadr, The University of Texas Austin, USA
   * Matthieu Latapy, LIP6, France
   * Matteo Magnani, Aarhus University, Denmark
   * Cecilia Mascolo,  University of Cambridge, UK
   * Raul Mondragon, Queen Mary University of London, UK
   * Mirella Moro, Federal University of Minas Gerais, Brazil
   * Mirco Musolesi, School of Computer Science, University of Birmingham, UK
   * Jonice Oliveira, Federal University of Rio de Janeiro, Brazil
   * Eric Osterweil, VeriSign Labs, USA
   * Bruno Ribeiro, University of Massachusetts Amherst, USA
   * Salvatore Scellato, Google, UK
   * Duc A. Tran, University of Massachusetts Boston, USA
   * Udi Weinsberg, Technicolor, USA
   * Artur Ziviani, National Laboratory for Scientific Computing (LNCC),
Brazil

############################

To unsubscribe from the MM-INTEREST list:
write to: mailto:[log in to unmask]
or click the following link:
http://listserv.acm.org/scripts/wa-ACMLPX.exe?SUBED1=MM-INTEREST&A=1

ATOM RSS1 RSS2