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  August 2018

SOCNET August 2018

Subject:

(selected) Latest Complexity Digest Posts (fwd)

From:

Barry Wellman <[log in to unmask]>

Reply-To:

Barry Wellman <[log in to unmask]>

Date:

Mon, 6 Aug 2018 08:52:27 -0400

Content-Type:

MULTIPART/MIXED

Parts/Attachments:

Parts/Attachments

TEXT/PLAIN (120 lines)

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

Looking forward to seeing some/many of you at the ASAs in Philly next 
weekend.
Meanwhile, enjoy Lord Simcoe Day, Ontario's finest hoiday!

   Barry Wellman

   Step by step, link by link, putting it together--Streisand/Sondheim
        The earth to be spannd, connected by network--Walt Whitman
              It's Always Something--Roseanne Roseannadanna
  _______________________________________________________________________
   NetLab Network      			                            FRSC
   Distinguished Visiting Scholar   Social Media Lab   Ryerson University
         Founder, International Network for Social Network Analysis
   NETWORKED: The New Social Operating System  Lee Rainie & Barry Wellman
   https://urldefense.proofpoint.com/v2/url?u=http-3A__www.chass.utoronto.ca_-7Ewellman&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=pqXWYFYS0Vndfqd52QJ3RTZRInja6mUa1F7Vkaj0IQU&e=            https://urldefense.proofpoint.com/v2/url?u=http-3A__amzn.to_zXZg39&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=xq_DCnrifIBA0eIebd34TedThDOWL6rFzoFhDOcLyYU&e=
              https://urldefense.proofpoint.com/v2/url?u=https-3A__en.wikipedia.org_wiki_Barry-5FWellman&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=ak659xlqcIBu8g2xd2Hk912fzqYHf7_RxCMeIvosGFs&e=
   _______________________________________________________________________


---------- Forwarded message ----------
Date: Mon, 6 Aug 2018 11:04:25 +0000
From: "[utf-8] Complexity Digest" <[log in to unmask]>
Reply-To: [log in to unmask]
To: "[utf-8] Barry" <[log in to unmask]>
Subject: [utf-8] Latest Complexity Digest Posts

Learn about the latest and greatest related to complex systems research. More at https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Dcb8d87a401-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=F9D8Ja0xKWSowoFq4gbk3F5RO_j0WB8MPJK5AXU8VCw&e=



Optimized flocking of autonomous drones in confined environments

    https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D43fe6b3359-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=KVhO44FZ_JaLnvxNQG3aCFMTymedXm1BqsajKZ2cKdA&e=

We address a fundamental issue of collective motion of aerial robots: how to ensure that large flocks of autonomous drones seamlessly navigate in confined spaces. The numerous existing flocking models are rarely tested on actual hardware because they typically neglect some crucial aspects of multirobot systems. Constrained motion and communication capabilities, delays, perturbations, or the presence of barriers should be modeled and treated explicitly because they have large effects on collective behavior during the cooperation of real agents. Handling these issues properly results in additional model complexity and a natural increase in the number of tunable parameters, which calls for appropriate optimization methods to be coupled tightly to model development. In this paper, we propose such a flocking model for real drones incorporating an evolutionary optimization framework with carefully chosen order parameters and fitness functions. We numerically demonstrated that the
induced swarm behavior remained stable under realistic conditions for large flock sizes and notably for large velocities. We showed that coherent and realistic collective motion patterns persisted even around perturbing obstacles. Furthermore, we validated our model on real hardware, carrying out field experiments with a self-organized swarm of 30 drones. This is the largest of such aerial outdoor systems without central control reported to date exhibiting flocking with collective collision and object avoidance. The results confirmed the adequacy of our approach. Successfully controlling dozens of quadcopters will enable substantially more efficient task management in various contexts involving drones.


Optimized flocking of autonomous drones in confined environments
Gábor Vásárhelyi, Csaba Virágh, Gerg˙˙ Somorjai, Tamás Nepusz, Agoston E. Eiben and Tamás Vicsek
Science Robotics  18 Jul 2018:
Vol. 3, Issue 20, eaat3536
DOI: 10.1126/scirobotics.aat3536

Source: robotics.sciencemag.org (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D0b7111fa09-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=2K3LBeKy7Mo-HTzTCai2GDGeOEICxC9vu3n4cdr-zZQ&e=)


Evidence for a conserved quantity in human mobility

    https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3De3b9e07d6a-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=XbX3jsMUzmyXz-u1ohRW4mzPOQhK0VRvHHM8ORjtX1I&e=

Recent seminal works on human mobility have shown that individuals constantly exploit a small set of repeatedly visited locations1,2,3. A concurrent study has emphasized the explorative nature of human behaviour, showing that the number of visited places grows steadily over time4,5,6,7. How to reconcile these seemingly contradicting facts remains an open question. Here, we analyse high-resolution multi-year traces of ~40,000 individuals from 4 datasets and show that this tension vanishes when the long-term evolution of mobility patterns is considered. We reveal that mobility patterns evolve significantly yet smoothly, and that the number of familiar locations an individual visits at any point is a conserved quantity with a typical size of ~25. We use this finding to improve state-of-the-art modelling of human mobility4,8. Furthermore, shifting the attention from aggregated quantities to individual behaviour, we show that the size of an individual˙˙s set of preferred locations
correlates with their number of social interactions. This result suggests a connection between the conserved quantity we identify, which as we show cannot be understood purely on the basis of time constraints, and the ˙˙Dunbar number˙˙9,10 describing a cognitive upper limit to an individual˙˙s number of social relations. We anticipate that our work will spark further research linking the study of human mobility and the cognitive and behavioural sciences.


Evidence for a conserved quantity in human mobility
Laura Alessandretti, Piotr Sapiezynski, Vedran Sekara, Sune Lehmann & Andrea Baronchelli
Nature Human Behaviour volume 2, pages 485˙˙491 (2018)

Source: www.nature.com (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D40cc3b6d6a-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=onsGlLmhK-ZTbbKe_FfYsVWjxehWJwsovtZSXvSrBGM&e=)



Does putting your emotions into words make you feel better? Measuring the minute-scale dynamics of emotions from online data

    Studies of affect labeling, i.e. putting your feelings into words, indicate that it can attenuate positive and negative emotions. Here we track the evolution of individual emotions for tens of thousands of Twitter users by analyzing the emotional content of their tweets before and after they explicitly report having a strong emotion. Our results reveal how emotions and their expression evolve at the temporal resolution of one minute. While the expression of positive emotions is preceded by a short but steep increase in positive valence and followed by short decay to normal levels, negative emotions build up more slowly, followed by a sharp reversal to previous levels, matching earlier findings of the attenuating effects of affect labeling. We estimate that positive and negative emotions last approximately 1.25 and 1.5 hours from onset to evanescence. A separate analysis for male and female subjects is suggestive of possible gender-specific differences in emotional dynamics.


Does putting your emotions into words make you feel better? Measuring the minute-scale dynamics of emotions from online data

Rui Fan, Ali Varamesh, Onur Varol, Alexander Barron, Ingrid van de Leemput, Marten Scheffer, Johan Bollen

Source: arxiv.org (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3De6a6d758d1-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=vBj6NQ5R9VXyE4M_jpRYNN5XfOjSqieRU7ZZBAS4BrY&e=)



Boolean Networks and Their Applications in Science and Engineering, Special Issue in Complexity

    https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D1644f945c4-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=FHrdP8CKsaoEf0TM_lVUnIql1J-txN9LHqFBRGYVj_Q&e=

In the last decades, Boolean networks (BNs) have emerged as an effective mathematical tool to model not only computational processes, but also several phenomena from science and engineering. For this reason, the development of the theory of such models has become a compelling need that has attracted the interest of many research groups in applied mathematics in recent years. Dynamics of BNs are traditionally associated with complexity, since they are composed of many identical elemental units whose behavior is relatively simple in comparison with the behavior of the entire system.


Submission Deadline Friday, 28 December 2018

Publication Date May 2019

Source: www.hindawi.com (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D7e7bd8b511-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=idQeAUv6qFMVq-bQJX_Xw-toXt5G5dE4LzgtkmcQU70&e=)



Complexcity@POLITO ˙˙ Turin, Italy, October 29-30 2018

    The workshop is the 13th of a series of tutorial workshops annually organized to explore the emergence of new research fields in which modeling, analysis and control of nonlinear and complex systems play a role of growing importance. These workshops have been traditionally devoted to an interdisciplinary audience with particular attention to PhD students and young researchers. The theme of this year is ˙˙Complexity and The City˙˙ with a unique focus on interactions, mobility, epidemics, information and misinformation spreading, and many other complex phenomena occurring in urban environments.

The workshop will gather scholars, students, and practitioners for two days of presentations and debates around complex systems science and its interplay with urban environments. A series of plenary lectures from renowned scholars is planned, while PhD students and young researchers will have dedicated sessions to present their research activity in an effective and appealing way. Social events will foster interaction and creation of collaboration opportunities.

Source: complexcity.polito.it (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D6e5ea9d8ac-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=ltNK_xQNH6KVzg4341G9ONBtr6q9ZWwuawLNZms9zho&e=)



==============================================
Sponsored by the Complex Systems Society.
Founding Editor: Gottfried Mayer.
Editor-in-Chief: Carlos Gershenson.

You can contribute to Complexity Digest selecting one of our topics (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Dc00255b075-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=CkPcri-Nw4Itk03Yw6wYy1WqnWoowPI7ikA7aJzVJRk&s=UqtD66iItHxL__16nXj7ECfLS2_4Ih4raluCnszZ7wM&e= ) and using the "Suggest" button.
==============================================
==============================================


_____________________________________________________________________
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

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