LISTSERV mailing list manager LISTSERV 16.0

Help for SOCNET Archives


SOCNET Archives

SOCNET Archives


SOCNET@LISTS.UFL.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

SOCNET Home

SOCNET Home

SOCNET  May 2011

SOCNET May 2011

Subject:

SIMPLEX 2011: 3rd Annual Workshop on Simplifying Complex Networks for Practitioners - Call for Participation

From:

Mirco Musolesi <[log in to unmask]>

Reply-To:

Mirco Musolesi <[log in to unmask]>

Date:

Thu, 19 May 2011 10:52:17 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (200 lines)

*****  To join INSNA, visit http://www.insna.org  *****

Our apologies if you receive multiple copies of this message.

-----------------------------------------------------------------------

Call for Participation

SIMPLEX 2011: 3rd Annual Workshop on Simplifying Complex Networks for
Practitioners

24th June 2011, Minneapolis, USA
http://www.simplexconf.net
Co-located with IEEE ICDCS 2011

-----------------------------------------------------------------------

*Scope of the workshop*

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 science 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 distributed
and mobile systems;
- 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&information retrieval;
- Complex network theory and security applications.


*Organization*

General Chairs

Pan Hui, Deutsche Telekom Laboratories/ TU Berlin, Germany
Steve Uhlig, Deutsche Telekom Laboratories/ TU Berlin, Germany

PC Chairs

Mirco Musolesi University of St Andrews, UK
My Thai University of Florida, USA

Web Chair

Fehmi Ben Abdesslem University of St Andrews, UK

Steering Committee

Jon Crowcroft University of Cambridge, UK
Steve Uhlig Deutsche Telekom Laboratories/ TU Berlin, Germany
Pan Hui Deutsche Telekom Laboratories/ TU Berlin, Germany
Walter Willinger AT&T Research, USA

Technical Program Committee

Frédéric Amblard University of Toulouse, France
Vincent Blondel Université Catholique de Louvain, Belgium
Ulrik Brandes, University of Konstanz, Germany
Dirk Brockmann Northwestern University, USA
Meeyoung Cha KAIST, Korea
Richard Clegg University College London, UK
Shlomi Dolev Ben-Gurion University of the Negev, Israel
Moez Draief Imperial College London, UK
Jesus Gomez-Gardenes  University Rey Juan Carlos, Spain
Alexander-Sasha Gutfraind Cornell University, USA
Renaud Lambiotte Imperial College London, UK
Thomas Karagiannis Microsoft Research Cambridge
Vassilis Kostakos University of Madeira, Portugal and CMU, USA
Massimo Marchiori University of Padova, Italy
Cecilia Mascolo University of Cambridge, UK
Alan Mislove Northeastern University, USA
Raul Mondragon Queen Mary, University of London, UK
Maziar Nekovee University College London, UK
Arun Sen Arizona State University, USA
Duc Tran University of Massachusetts Boston, USA	
Jie Wang University of Massachusetts Lowell, USA	
Dapeng Oliver Wu University of Florida USA
Lei Ying Iowa State University, USA	
Zhi-Li Zhang University of Minnesota, USA
Ben Zhao University of California at Santa Barbara, USA	


*Registration*

The ICDCS’11 conference registration includes the SIMPLEX’11 workshop
registration. There is a single registration for all the ICDCS
activities.

See also:

https://www.icdcs-registration.com/icdcs11/


*Program*

Session 1: Social Networks

9:30 – 10:00
Understanding Graph Sampling Algorithms for Social Network Analysis
Tianyi Wang, Long Jin, Beixing Deng, Xing Li (Tsinghua University,
China), Yang Chen, Tianyin Xu (University of Goettingen, Denmark),
Zengbin Zhang (University of California-Santa Barbara, USA), Pan Hui
(Deutsche Telekom Laboratories, Germany)

10:00 – 10:30
Preserving Social Locality in Data Replication for Online Social Networks
Khanh Nguyen, Cuong Pham, Duc A. Tran (University of Massachusetts,
Boston, USA), Feng Zhang (Distributed System Infrastructure Group, EMC
Corp, USA)

Coffee break 10:30 – 11:00

Session 2: Network Structures

11:00 – 11:30
k-clique Communities in the Internet AS-level Topology Graph
Luciano Lenzini, Enrico Gregori, Chiara Orsini (Università Di Pisa, Italy)

11:30 – 12:00	
Link-level Network Topology Generation
Mehmet Burak Akgun, Mehmet Gunes (University of Nevada, Reno, USA)

Lunch 12:00 – 1:30

Session 3: Robustness and Trustworthy Computing

1:30 – 2:00	
A Geometric Approach to Robustness in Complex Networks
Gyan Ranjan, Zhi-Li Zhang (University of Minnesota, USA)

2:00 – 2:30	Understanding Social Networks Properties for Trustworthy Computing
Abedelaziz Mohaisen, Huy Tran, Nicholas Hopper, Yongdae Kim
(University of Minnesota, USA)

Coffee break 2:30 – 3:00	
		
Session 4: Modelling Network Influence and System Behavior
	
3:00 – 3:30
Approximation and Inapproximation for the Influence Maximization
Problem in Social Networks under Deterministic Linear Threshold Model
Zaixin Lu, Wei Zhang, Weili Wu (University of Texas–Dallas, USA), Bin
Fu (University of Texas-Pan American, USA)
	
3:30 – 4:00
Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior
Ville Satopaa, Jeannie Albrecht (William College, USA), David Irwin
(University of Massachusetts-Amherst, USA), Barath Raghavan
(University of California, Berkeley, USA)

General Discussion 4:00 – 5:00	


-- 
Mirco Musolesi
School of Computer Science, University of St. Andrews
Jack Cole Building, North Haugh, St. Andrews KY16 9SX United Kingdom
Web: http://www.cs.st-andrews.ac.uk/~mirco

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008, Week 62
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001

ATOM RSS1 RSS2



LISTS.UFL.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager