Phil 12.7.17

ASRC MKT 7:00 – 4:30

  • Association of moral values with vaccine hesitancy
  • Online extremism and the communities that sustain it: Detecting the ISIS supporting community on Twitter
  • Continuing Schooling as a strategy for taxis in a noisy environment here
  • Consensus and Cooperation in Networked Multi-Agent Systems
    • This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems in networked dynamic systems and diverse applications including synchronization of coupled oscillators, flocking, formation control, fast consensus in smallworld networks, Markov processes and gossip-based algorithms, load balancing in networks, rendezvous in space, distributed sensor fusion in sensor networks, and belief propagation. We establish direct connections between spectral and structural properties of complex networks and the speed of information diffusion of consensus algorithms. A brief introduction is provided on networked systems with nonlocal information flow that are considerably faster than distributed systems with lattice-type nearest neighbor interactions. Simulation results are presented that demonstrate the role of smallworld effects on the speed of consensus algorithms and cooperative control of multivehicle formations.
  • Found this in the citations of the above paper with terms “belief space flocking“: Spatial Coordination Games for Large-Scale Visualization
    • Dimensionality reduction (’visualization’) is a central problem in statistics. Several of the most popular solutions grew out of interaction metaphors (springs, boids, neurons, etc.) We show that the problem can be framed as a game of coordination and solved with standard game-theoretic concepts. Nodes that are close in a (high-dimensional) graph must coordinate in a (low-dimensional) screen position. We derive a game solution, a GPU-parallel implementation and report visualization experiments in several datasets. The solution is a very practical application of game-theory in an important problem, with fast and low-stress embeddings.
  • Lots of progress on the White Paper. Aaron wants to split out the WordRank work and the mapping work as two separate epochs. He thinks they may be easier to pitch than the phased approach
  • Some discussion on how explore/exploit is a bad metaphor due to the bad associations with exploit
  • Added a SIGINT use case
  • Discussed the ‘map weaving from trajectories’ concept

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.