Theory of Networks Systems: Fall 2014 Paper Presentations Presentations will begin on Monday, 10/20/2014. The papers are listed in the order to be presented. Each paper will be assigned to two people, and you will present the paper together. To sign up for a paper, each pair should send me a single email with your names and the paper you want to present. It is probably a good idea to list two or three paper choices in order of preference. I will assign papers on a first come, first served basis, with one caveat: I will not acknowledge paper request emails that are sent during scheduled class time. A paper presentation should last 45 minutes to 1 hour. It is your job to teach us about the paper in this talk. You do not need to present every detail of the paper, but you should cover the important results and the techniques used to obtain them (you should be able to follow the proof steps in the paper). You (as a pair) must make your own slides for the paper. You may use figures from other sources provided you include citations. Everyone has to read every paper on this list, not just the paper you are presenting. This will take a while, so start reading now. You will all be expected to contribute to the discussion about each paper. One goal of our paper discussions will be to generate new research ideas related to these papers. This link provides some useful tips on paper reading. http://motion.me.ucsb.edu/ME225FB-­‐Winter2014/handouts/TiaNewhall-­‐on-­‐reading-­‐a-­‐paper.html If you would like to present a paper that is not on this list, please discuss it with me. 1. Craig W. Reynolds. 1987. Flocks, herds and schools: A distributed behavioral model. SIGGRAPH Comput. Graph. 21, 4 (August 1987), 25-­‐34. URL: http://doi.acm.org/10.1145/37402.37406 Brayden Hollis and Micah Corah 2. Martinez, S.; Cortes, J.; Bullo, F., "Motion Coordination with Distributed Information," IEEE Control Systems, vol.27, no.4, pp.75,88, Aug. 2007, URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4272330&isnumber=4272237 Mark Plagge and Neil McGlohon 3. Dimakis, AD.G.; Sarwate, AD.; Wainwright, M.J., "Geographic Gossip: Efficient Averaging for Sensor Networks," , IEEE Transactions on Signal Processing, vol.56, no.3, pp.1205,1216, March 2008 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4451282&isnumber=4451275 Emily Heath and James Van Bebber 4. Kempe, D.; Dobra, A; Gehrke, J., "Gossip-­‐based computation of aggregate information`, Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp.482-­‐
491, Oct. 2003 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1238221&isnumber=27770 Daniel Campos and Zoe Konrad 5. Lin Xiao, Stephen Boyd, and Sanjay Lall, A space-­‐time diffusion scheme for peer-­‐to-­‐peer least-­‐
squares estimation. In Proceedings of the 5th international conference on Information processing in sensor networks (IPSN '06), pp. 168-­‐176, 2006 URL: http://doi.acm.org/10.1145/1127777.1127806 Chukwogozirim Ehrim and Jie You 6. Eyal, I., Keidar, I., Ram, R., “LiMoSense: live monitoring in dynamic sensor networks,” Distributed Computing, Apr. 2014 URL: http://link.springer.com/article/10.1007%2Fs00446-­‐014-­‐0213-­‐8 Hao Zhong and Zachary Jablons 7. Barooah, P.; Hespanha, J.P., "Estimation on graphs from relative measurements," IEEE Control Systems, vol.27, no.4, pp.57,74, Aug. 2007 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4272329&isnumber=4272237 Huy Nguyen and Orkun Baycik 8. J.W. Durham, R. Carli, P. Frasca, F. Bullo, “Discrete Partitioning and Coverage Control for Gossiping Robots”, IEEE Transactions on Robotics, Volume 28, Issue 2, April 2012. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6060922 Dan Kruse and Matt Minakais 9. P. Yang, R.A. Freeman, G.J. Gordon, K.M. Lynch, S.S. Srinivasa, R. Sukthankar, Decentralized estimation and control of graph connectivity for mobile sensor networks, Automatica, Volume 46, Issue 2, February 2010, Pages 390-­‐396 URL: http://www.sciencedirect.com/science/article/pii/S0005109809005366 Lily Briggs and Felipe Wilches 10. Ishii, H.; Tempo, R., "Distributed Randomized Algorithms for the PageRank Computation," IEEE Transactions on Automatic Control, vol.55, no.9, pp.1987,2002, Sept. 2010 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5411738&isnumber=5565431 Kevin O’Connor and Viktor Rumanuk 11. Hegselmann, R., Krause, U., “Opinion Dynamics and Bounded Confidence Modes, Analysis, and Simulation,” Journal of Artificial Societies and Social Simulation vol. 5, no. 3, 2002 URL: http://jasss.soc.surrey.ac.uk/5/3/2.html Dwight Naylor and Shi Gan 12. Karsai, M., Perra, N., Vespignani, A., “Time varying networks and the weakness of strong ties,” Nature Sci. Rep., 4:4001, 2014 URL: http://www.nature.com/srep/2014/140210/srep04001/full/srep04001.html Nidhi Rastogi and Bolong Liang