Jornada de Atualização em Informática 2015
Sinopse
O XXXIV Jornada de Atualização em Informática (JAI 2015) traz 6 minicursos apresentados durante o XXXV Congresso da Sociedade Brasileira de Computação (CSBC 2015). Os Capítulos 1 e 3 introduzem e trazem avanços nos fundamentos teóricos da ciência da computação, tais como classes de problemas, computabilidade e lógica computacional, além de técnicas de resolução de problemas difíceis (em otimização combinatória), apresentando conceitos, além de novos e velhos desafios que tem intrigado pesquisadores da área desde sempre. Por outro lado, o Capítulo 5 introduz conceitos para refinamentos na classificação de problemas difíceis, completando destarte juntamente com os Capítulos 1 e 3, um panorama extenso da diversidade do que se entende ser a área de teoria da computação, marcando a criação da comissão especial desta área na Sociedade Brasileira da Computação em 2014. Em contraste com os capítulos anteriormente citados, que tem ênfase em seus aspectos teóricos, nos Capítulos 2 e 6 a ciência da computação se apresenta em algumas de suas vertentes mais arrojadas, pelas áreas de computação urbana e robótica móvel, onde o primeiro capítulo, além de introduzir o
conceito de computação urbana, discorre sobre as técnicas de sensoriamento das redes urbanas; e o segundo apresenta os principais conceitos de robótica móvel e de robôs articulados. O Capitulo 6, por sua vez, tem foco em aspectos práticos de engenharia de software, introduzindo uma linguagem de especificação para projeto de interface de sistemas de informação e exemplificando o uso da mesma.
Capítulos:
Downloads
Referências
A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph Classes: A survey. SIAM Monographs on Discrete Mathematics and Applications, 1999.
A. G. Chetwynd, and A. J. W. Hilton, Star multigraphs with three vertices of maximum degree, Math. Proc. Cambridge Philos. Soc. 100 (1986) 303–317.
A. Gyárfás, Problems from the world surrounding perfect graphs, Zastos. Mat. 19 (1987) 413–441.
A. Pnueli. The temporal logic of programs. In Proceedings of 18th IEEE Annual Symposium on Foundations of Computer Science, pages 46–57, 1977.
A.S. d’Avila Garcez and L.C. Lamb. A connectionist computational model for epistemic and temporal reasoning. Neural Computation, 18(7):1711–1738, 2006.
A.S. d’Avila Garcez, L.C Lamb, and D.M. Gabbay. Neural-Symbolic Cognitive Reasoning. Cognitive Technologies. Springer, 2009.
A.S. d’Avila Garcez, L.C. Lamb, and D.M. Gabbay. Connectionist computations of intuitionistic reasoning. Theoretical Computer Science, 358(1):34–55, 2006.
A.S. d’Avila Garcez, L.C. Lamb, and D.M. Gabbay. Connectionist modal logic: Representing modalities in neural networks. Theoretical Computer Science, 371(1-2):34–53, 2007.
ABB (2015a). Robô irb 140. Acessado: 19.03.2015.
ABB (2015b). Robô irb 360. Acessado: 19.03.2015.
Adept MobileRobots, I. (2015). Robô pioneer p3dx. Acessado: 19.03.2015.
Adomavicius, G. and Tuzhilin, A. (2005). Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. Knowledge and Data Engineering, IEEE Transactions on, 17(6):734–749.
Ahuja, R. K., Magnanti, T. L. e Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River, NJ, USA.
Alan M. Turing. Computing machinery and intelligence. Mind, 59:433–460, 1950.
Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42(2), 1936.
Aldebaran Robotics, I. (2015). Robô humanóide nao. Acessado: 19.03.2015.
Alfred North Whitehead and Bertrand Russell. Principia Mathematica, volume I,II, III. Cambridge University Press, Cambridge, 1910, 1912, 1913.
Alonzo Church. An unsolvable problem of elementary number theory. American Journal of Mathematics, 58(2):345–363, April 1936.
Alstott, J., Bullmore, E., and Plenz, D. (2014). powerlaw: A python package for analysis of heavy-tailed distributions. PLoS ONE, 9(1):e85777.
Applegate, D. L., Bixby, R. E., Chvatal, V. e Cook, W. J. (2007). The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton, NJ, USA.
Arkin, R. C. (1989). Towards the unification of navigational planning and reactive control. In In AAAI Spring Symposium on Robot Navigation, pages 1–5.
Arkin, R. C. and Balch, T. (1997). Aura: Principles and practice in review. Journal of Experimental and Theoretical Artificial Intelligence, 9:175–189.
Artur d’Avila Garcez, Marco Gori, Pascal Hitzler, and Luís C. Lamb. NeuralSymbolic Learning and Reasoning (Dagstuhl Seminar 14381). Dagstuhl Reports, 4(9):50–84, 2015.
B. L. Chen, H.-L. Fu, and M. T. Ko, Total chromatic number and chromatic index of split graphs, J. Combin. Math. Combin. Comput. 17 (1995) 137–146.
B. Randerath, and I. Schiermeyer. Vertex colouring and forbidden subgraphs—a survey, Graphs Combin. 20 (2004) 1–40.
Balcan, D., Colizza, V., Gonçalves, B., Hu, H., Ramasco, J. J., and Vespignani, A. (2009). Multiscale mobility networks and the spatial spreading of infectious diseases. Proceedings of the National Academy of Sciences, 106(51):21484–21489.
Barbosa, L., Pham, K., Silva, C., Vieira, M. R., and Freire, J. (2014). Structured open urban data: understanding the landscape. Big data, 2(3):144–154.
Barth, F. (1969). Ethnic groups and boundaries: the social organization of culture difference. Scandinavian university books. Little, Brown.
Bazaraa, M. S., Jarvis, J. J. e Sherali, H. D. (2009). Linear Programming and Network Flows. Wiley-Interscience. 4th edition.
Benevenuto, F., Almeida, J. M., and Silva, A. S. (2011). Explorando redes sociais online: Da coleta e análise de grandes bases de dados às aplicações. Proc. of SBRC’11, pages 63–94.
Bernhard Schoelkopf. Articial intelligence: Learning to see and act. Nature, 518:486–487, 2015.
Blei, D. M., Ng, A. Y., and Jordan, M. I. (2003). Latent dirichlet allocation. the Journal of machine Learning research, 3:993–1022.
Bollen, J., Mao, H., and Zeng, X. (2011). Twitter mood predicts the stock market. Journal of Computational Science, 2(1):1–8.
Bondy, J. e Murty, U. (2008). Graph Theory, volume 244 of Graduate Texts in Mathematics. Springer-Verlag. 654 pgs.
Bradski, G. and Kaehler, A. (2008). Learning OpenCV: Computer Vision with the OpenCV Library. O’Reilly Media, Inc.
Brambilla, M., Fraternali, P. (2014). Interaction Flow Modeling Language: ModelDriven UI Engineering of Web and Mobile Apps with IFML. Morgan Kaufman.
Brassard, G. e Bratley, P. (1988). Algorithmics: Theory and Practice. Prentice-Hall.
Brenner, J. and Smith, A. (2013). 72% of online adults are social networking site users. http://goo.gl/HTgNy3.
Brockmann, D., Hufnagel, L., and Geisel, T. (2006). The scaling laws of human travel. Nature, 439(7075):462–465.
Brush, A. B., Krumm, J., and Scott, J. (2010). Exploring end user preferences for location obfuscation, location-based services, and the value of location. In Proc. of Ubicomp ’10, pages 95–104, Copenhagen, Denmark. ACM.
Burke, J., Estrin, D., Hansen, M., Parker, A., Ramanathan, N., Reddy, S., and Srivastava, M. B. (2006). Participatory sensing. In Proc. of Workshop on World-Sensor-Web (WSW’06), pages 117–134, Boulder, USA.
Burt, R. S. (1992). Structural Holes: The Social Structure of Competition. Harvard University Press.
C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
C. Bazgan. Schémas d’approximation et complexité paramétrée. Technical report, Université Paris Sud, 1995.
C. Berge, and V. Chvátal, Topics on Perfect Graphs, North-Holland Mathematics Studies, 88. Annals of Discrete Mathematics, 21. North-Holland Publishing Co., Amsterdam, 1984.
C. Howson. Probability and logic. J. Applied Logic 1(3-4), 151-165, 2003.
C. Lewis. A Survey of Symbolic Logic. University of California Press, Berkeley, 1918.
C. M. H. de Figueiredo, and J. L. Szwarcter, Emparelhamentos em Grafos: Algoritmos e Complexidade, XIX Congresso da Sociedade Brasileira de Computação. (Org.). XVIII Jornada de Atualização em Informática. 1999, pp. 127–161.
C. M. H. de Figueiredo, J. Meidanis, and C. P. de Mello, Local conditions for edge-coloring, J. Combin. Math. Combin. Comput. 32 (2000) 79–91.
C. M. H. de Figueiredo, J. Meidanis, and C. P. de Mello, On edge-colouring indierence graphs, Theoret. Comput. Sci. 181 (1997) 91–106.
C. M. H. de Figueiredo, J. Meidanis, and C. P. Mello, Coloração em Grafos, XVII Congresso da Sociedade Brasileira de Computação. (Org.). XVI Jornada de Atualização em Informática 1997, pp. 01–45.
C. M. H. de Figueiredo, Resolver ou Vericar? Uma pergunta que vale um milhão de dólares. Ciência Hoje, Rio de Janeiro pp. 42–46, novembro 2011.
C. M. H. de Figueiredo, S. Klein, Y. Kohayakawa, and B.A. Reed, Finding skew partitions eciently, J. Algorithms 37 (2000) 505–521.
C. M. H. de Figueiredo, The P vs. NP-complete dichotomy of some challenging problems in graph theory, Discrete Appl. Math. 160 (2012) 2681-2693.
C. Ortiz Z., N. Maculan, and J. L. Szwarcter, Characterizing and edge-colouring split-indierence graphs, Discrete Appl. Math. 82 (1998) 209–217.
C. Simone, and A. Galluccio, Edge-colouring of regular graphs of large degree, Theoret. Comput. Sci. 389 (2007) 91–99.
C. Simone, and C. P. de Mello, Edge-colouring of join graphs, Theoret. Comput.Sci. 355 (2006) 364–370.
CENS/UCLA. Participatory Sensing / Urban Sensing Projects. http://research.cens.ucla.edu/.
Ceri, S., Fraternali, P., Bongio, A., Brambilla, M., Comai, S., & Matera, M. (2003). Designing Data Intensive Web Applications. Morgan Kaufmann.
Cha, M., Haddadi, H., Benevenuto, F., and Gummadi, K. (2010). Measuring user inuence in twitter: The million follower fallacy. In Proc. of ICWSM’10, Washington, USA.
Chatterjee, S. and Hadi, A. S. (2015). Regression analysis by example. John Wiley & Sons.
Chee-Keng Yap, Some Consequences of Non-Uniform Conditions on Uniform Classes, Theoretical Computer Science, v. 26, p. 287-300, 1983.
Chen, Peter (1976). The Entity-Relationship Model-Toward a Unified View of Data. ACM Transactions on Database Systems 1(1): 9–36.
Cheng, Z., Caverlee, J., Lee, K., and Sui, D. Z. (2011). Exploring Millions of Footprints in Location Sharing Services. In Proc. of ICWSM’11, Barcelona, Spain.
Cho, E., Myers, S. A., and Leskovec, J. (2011). Friendship and mobility: user movement in location-based social networks. In Proc. KDD ’11, pages 1082–1090, San Diego, USA. ACM.
Clauset, A., Shalizi, C. R., and Newman, M. E. J. (2009). Power-law distributions in empirical data. SIAM Rev., 51(4):661–703.
Cockburn, A. (2001). Writing Effective Use Cases. AddisonWesley.
Coen-Porisini, A. and Sicari, S. (2012). Improving data quality using a cross layer protocol in wireless sensor networks. Comput. Netw., 56(17):3655–3665.
Cook, D., Vardy, A., and Lewis, R. (2014). A survey of auv and robot simulators for multi-vehicle operations. In Autonomous Underwater Vehicles (AUV), 2014 IEEE/OES, pages 1–8.
Coppelia Robotics, G. (2015). Virtual robot experimentation platform - user manual. http://www.coppeliarobotics.com/helpFiles/. Acessado em: 19.03.2015.
Corke, P. I. (2011). Robotics, Vision & Control: Fundamental Algorithms in Matlab. Springer.
Cormen, T. H., Leiserson, C. E., Rivest, R. L. e Stein, C. (2009). Introduction to Algorithms (3. ed.). MIT Press.
Correa, D. S. O. (2013). Navegação autônoma de robôs móveis e detecção de intrusos em ambientes internos utilizando sensores 2D e 3D. USP ICMC - Dissertação de Mestrado, Sao Carlos, SP, Brasil.
Craighead, J., Gutierrez, R., Burke, J., and Murphy, R. (2008). Validating the search and rescue game environment as a robot simulator by performing a simulated anomaly detection task. In Intelligent Robots and Systems, 2008. IROS 2008. IEEE/RSJ International Conference on, pages 2289–2295.
Crandall, D. J., Backstrom, L., Huttenlocher, D., and Kleinberg, J. (2009). Mapping the world’s photos. In Proc. of WWW ’09, pages 761–770, Madrid, Spain. ACM.
Cranshaw, J., Schwartz, R., Hong, J. I., and Sadeh, N. (2012). The Livehoods Project: Utilizing Social Media to Understand the Dynamics of a City. In Proc. of ICWSM’12, Dublin, Ireland.
Cytron Technologies, I. (2015). Sonar hc-sr04. http://cytron.com.my/p-sn-hc-sr04. Acessado em: 19.03.2015.
D. B. West, Introduction to Graph Theory. Second edition. Prentice Hall, 2001.
D. G. Homan, and C. A. Rodger, The chromatic index of complete multipartite graphs, J. Graph Theory 16 (1992) 159–163.
D. Gabbay, A. Kurucz, F.Wolter, and M. Zakharyaschev. Many-dimensional modal logics: theory and applications, volume 148 of Studies in Logic and the Foundations of Mathematics. Elsevier Science, 2003.
D. M. Gabbay. Elementary Logics: a Procedural Perspective. Prentice Hall, London, 1998.
D. S. Johnson, Graph restrictions and their eect, J. Algorithms 6 (1985) 434–451.
D. S. Johnson, NP-Completeness Columns, available at http://www2.research.att.com/dsj/columns/
D’Hondt, E., Stevens, M., and Jacobs, A. (2013). Participatory noise mapping works! an evaluation of participatory sensing as an alternative to standard techniques for environmental monitoring. Pervasive and Mobile Computing, 9(5):681–694.
Dasgupta, S., Papadimitriou, C. H. e Vazirani, U. V. (2008). Algorithms. McGraw-Hill.
Denis Shasha and Cathy Lazere. Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists. Copernicus, 1995.
Department, I. S. (2014). World robotics 2014 - industrial robots and service robots (executive summary wr-2014). http://www.worldrobotics.org/uploads/media/Executive_Summary_WR_2014_02.pdf. Acessado em: 08.05.2015.
Dey, A. K. and Abowd, G. D. (2000). Towards a Better Understanding of Context and Context-Awareness. In Proc. of CHI 2000 Workshops, The Hague, The Netherlands.
Dirk Baltzly. Stoicism. In Edward N. Zalta, editor, The Stanford Encyclopedia of Philosophy. Spring 2014 edition, 2014.
Dirk Van Dalen. Intuitionistic logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 166 of Synthese Library, pages 225– 339. Springer Netherlands, 1986.
Dov M. Gabbay and F. Guenthner, editors. Handbook of Philosophical Logic, volume I-XVIII. Springer, 2008-2015.
Dov M. Gabbay and John Woods, editors. Handbook of The History of Logic, volume I-XI. Elsevier, 2008-2015.
Dov M. Gabbay, Amir Pnueli, Saharon Shelah, and Jonathan Stavi. On the temporal basis of fairness. In Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada, USA, January 1980, pages 163–173, 1980.
Dudek, G. and Jenkin, M. (2000). Computational Principles of Mobile Robotics. Cambridge University Press, Cambridge, UK.
Duggan, M. and Smith, A. (2014). Social media update 2013. http://goo.gl/JhuiOG.
E. Mendelson. Introduction to mathematical logic. Van Nostrand Reinhold, New York, 1964.
E. Prisner, Graph Dynamics, Pitman Research Notes in Mathematics 338, Longman, 1995.
E. Rohmer, S. P. N. Singh, M. F. (2013). V-rep: a versatile and scalable robot simulation framework. In Proc. of The International Conference on Intelligent Robots and Systems (IROS).
E. Steen, Classications and characterizations of snarks, Discrete Math. 188 (1998) 183–203.
Easley, D. and Kleinberg, J. (2010). Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press.
Echeverria, G., Lassabe, N., Degroote, A., and Lemaignan, S. (2011). Modular open robots simulation engine: Morse. In Robotics and Automation (ICRA), 2011 IEEE International Conference on, pages 46–51.
Eckerson, W. W. (1995). Three Tier Client/Server Architecture: Achieving Scalability, Performance, and Efficiency in Client Server Applications. Open Information Systems 10, January.
Eric Paulos, K. A. and Townsend, A. (2004). Ubicomp in the urban frontier. In Workshop at Ubicomp’04, Nottingham, UK.
Erickson, J. (Acessado em Maio de 2015). Algorithms and models of computation. http://www.cs.illinois.edu/~jeffe/teaching/algorithms.
Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. of KDD-96, Portland, USA.
Evollve, I. (2015). Ozobot. http://www.ozobot.com/. Acessado em: 19.03.2015.
F. Roberts, and J. Spencer, A characterization of clique graphs, J. Combin. Theory Ser. B 10 (1971) 102–108.
Feofiloff, P., Kohayakawa, Y. eWakabayashi, Y. (2004). Uma introdução sucinta à teoria dos grafos. http://www.ime.usp.br/~pf/teoriadosgrafos/. Texto da II Bienal da SBM.
Fernandes, L. C., Souza, J. R., Pessin, G., Shinzato, P. Y., Sales, D., Mendes, C., Prado, M., Klaser, R., Magalhães, A. C., Hata, A., et al. (2014). Carina intelligent robotic car: Architectural design and applications. Journal of Systems Architecture, 60(4):372–392.
Ferreira, C. E. e Wakabayashi, Y. (1996). Combinatória Poliédrica e Planos-de-Corte Faciais. 10a Escola de Computação, Campinas.
Flavio Corrêa da Silva, Marcelo Finger, and Ana C. V. de Melo. Lógica para Computação. Thomson, São Paulo, 2006.
Fowler, M. (2003). Patterns of Enterprise Application Architecture. AddisonWesley.
Frederic B. Fitch. Symbolic Logic. The Ronald Press Company, New York, 1952.
Freedman, D. A. (2009). Statistical models: theory and practice. cambridge university press.
Freescale Semiconductor, I. (2015). Acelerômetro mma7361l. http://www.freescale.com/webapp/sps/site/prod_summary.jsp?code=MMA7361LC&tid=vanRED. Acessado em: 19.03.2015.
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation, Springer-Verlag, Berlin, 1999.
G. Gentzen. Unstersuchungen über das logische Schliessen. Mathematische Zeitschrift, 39:176–210, 1934.
Gamma, E., Helm, R., Johnson, R., & Vlissides, J. (1995). Design Patterns: Elements of reusable object-oriented software. Addison-Wesley.
Ganti, R., Ye, F., and Lei, H. (2011). Mobile crowdsensing: current state and future challenges. Communications Magazine, IEEE, 49(11):32 –39.
Gao, H., Liu, C., Wang, W., Zhao, J., Song, Z., Su, X., Crowcroft, J., and Leung, K. (2015). A survey of incentive mechanisms for participatory sensing. Communications Surveys Tutorials, IEEE, PP(99):1–1.
Gao, H., Tang, J., Hu, X., and Liu, H. (2013). Exploring temporal effects for location recommendation on location-based social networks. In Proc. of RecSys ’13, pages 93–100, Hong Kong, China.
Garey, M. R. e Johnson, D. S. (1979). Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York.
Gates, B. (2007). A robot in every home. Scientific American, 296(1):58–65.
Gerkey, B., Vaughan, R. T., and Howard, A. (2003). The player/stage project: Tools for multi-robot and distributed sensor systems. In Proceedings of the 11th international conference on advanced robotics, volume 1, pages 317–323.
Giannotti, F., Pedreschi, D., Pentland, A., Lukowicz, P., Kossmann, D., Crowley, J., and Helbing, D. (2012). A planetary nervous system for social mining and collective awareness. The Eur. Phy. Jour. Special Topics, 214(1):49–75.
Gomide, J., Veloso, A., Jr., W. M., Almeida, V., Benevenuto, F., Ferraz, F., and Teixeira, M. (2011). Dengue surveillance based on a computational model of spatio-temporal locality of twitter. In Proc. of WebSci’11, Evanston, USA.
Gonçalves, P., Araújo, M., Benevenuto, F., and Cha, M. (2013). Comparing and combining sentiment analysis methods. In Proceedings of the 1st ACM Conference on Online Social Networks (COSN’13), Boston, USA.
Gonzalez, M. C., Hidalgo, C. A., and Barabasi, A.-L. (2008). Understanding individual human mobility patterns. Nature, 453(7196):779–782.
Grassi Jr., V. and Okamoto Jr., J. (2014). Arquiteturas de controle: tipos e conceitos. In Romero, R. A. F., Prestes, E., Osório, F., and Wolf, D., editors, Robótica Móvel, chapter 4, pages 47–60. Editora LTC, Rio de Janeiro.
Guizzo, E. (2012). Amazon acquires kiva systems for $775 million. http://spectrum.ieee.org/automaton/robotics/industrial-robots/amazon-acquires-kiva-systems-for-775-million. Acessado em: 19.03.2015.
H. L. Bodlaender, C. M. H. de Figueiredo, M. Gutierrez, T. Kloks, and R. Niedermeier, Simple max-cut for split-indierence graphs and graphs with few P4’s, Proc. of Third International Workshop on Experimental and Ecient Algorithms (WEA 2004). Lecture Notes in Comput. Sci. 3059 (2004), 87–99.
H. T. Wareham. Systematic parameterized complexity analysis in computational phonology, PhD thesis, University of Victoria, 1999.
H. W. Lenstra Jr. Integer programming with a xed number of variables. Mathematics of operations research 8(4), 538?548 (1983).
Hans L. Boadlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin, On problems without polynomial kernels, Journal of Computer and System Sciences, v. 75, p. 423-434, 2009.
Hans L. Boadlaender, Stéphan Thomassé, Anders Yeo, Kernel bounds for disjoint cycles and disjoint paths, Theoretical Computer Science, v. 412, p. 4570-4578, 2011.
Hans L. Bodlaender, Bart M.P. Jansen, Stefan Kratsch, Kernel bounds for path and cycle problems, Theoretical Computer Science, doi:10.1016/j.tcs.2012.09.006, 2012.
Harrell, F. E. (2013). Regression modeling strategies: with applications to linear models, logistic regression, and survival analysis. Springer Science & Business Media.
Harris, A. and Conrad, J. M. (2011). Survey of popular robotics simulators, frameworks, and toolkits. In Southeastcon, 2011 Proceedings of IEEE, pages 243–249.
Hartigan, J. A. and Wong, M. A. (1979). Algorithm as 136: A k-means clustering algorithm. Applied statistics, pages 100–108.
HiBot (2015). Robô serpente acm-r5. Acessado: 19.03.2015.
Hochman, N. and Schwartz, R. (2012). Visualizing instagram: Tracing cultural visual rhythms. In Proc. of ICWSM’12, pages 6–9, Dublin, Ireland. AAAI.
Hokuyo Automatic, C. (2015). Urg-04lx-ug01. https://www.hokuyo-aut.jp/02sensor/07scanner/urg_04lx_ug01.html. Acessado em: 19.03.2015.
Hsieh, H.-P., Li, C.-T., and Lin, S.-D. (2012). Exploiting large-scale check-in data to recommend time-sensitive routes. In Proc. of UrbComp ’12, pages 55–62, Beijing, China. ACM.
I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718–720.
Instagram (2014). Instagram today: 200 million strong. http://blog.instagram.com/post/80721172292/200m.
InvenSense, I. (2015). Imu mma7361l. http://www.invensense.com/mems/gyro/mpu6050.html. Acessado em: 19.03.2015.
Ireland, C., Keynes, M. Bowers, D., Newton, M., Waugh, K. (2009). A Classification of Object-Relational Impedance Mismatch. Advances in Databases, Knowledge, and Data Applications, DBKDA ‘09. p. 3643. Gosier.
iRobot (2015). Roomba. http://www.irobot.com/For-the-Home/. Acessado em: 19.03.2015.
Iyengar, S. S. and Elfes, A. (1991). Autonomous Mobile Robots: Perception, mapping, and navigation. Autonomous Mobile Robots. IEEE Computer Society Press.
J. Hintikka. Knowledge and Belief. Cornell University Press, 1962.
J. L. Ramirez Alfonsin, and B. A. Reed, Perfect graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, 2001.
J. L. Szwarcter, A Survey on Clique Graphs, In Recent Advances in Algorithms and Combinatorics, C. Linhares-Sales and B. Reed, eds., CMS Books Math./Ouvrages Math. SMC, 11, Springer, New York, 2003, pp. 109–136.
J. L. Szwarcter, Recognizing clique-Helly graphs, Ars Combin. 25 (1997) 29–32.
J. P. Spinrad, Ecient graph representations, Fields Institute Monographs, 19. AMS, 2003.
J.Y. Halpern, R. Harper, N. Immerman, P.G. Kolaitis, M.Y. Vardi, and V. Vianu. On the unusual eectiveness of logic in computer science. Bulletin of Symbolic Logic, 7(2):213–236, 2001.
J.Y. Halpern. Reasoning about Uncertainty, MIT Press, 2003.
Joan Moschovakis. Intuitionistic logic. In Edward N. Zalta, editor, The Stanford Encyclopedia of Philosophy. Spring 2015 edition, 2015.
Jolliffe, I. T. (2002). Principal Component Analysis. Springer, second edition.
Jörg Flum; Martin Grohe. Parameterized complexity theory, Springer, 2006.
Joseph, K., Tan, C. H., and Carley, K. M. (2012). Beyond local, categories and friends: clustering foursquare users with latent topics. In Proceedings of the 2012 ACM Conference on Ubiquitous Computing, pages 919–926, Pittsburgh, USA. ACM.
Jung, C. R., Osorio, F. S., Kelber, C., and Heinen, F. (2005). Computação embarcada: Projeto e implementação de veículos autônomos inteligente. In Anais do CSBC’05 XXIV Jornada de Atualização em Informática (JAI), chapter 4, pages 1358–1406. SBC, São Leopoldo, RS.
K. Broda, D.M. Gabbay, L.C. Lamb, and A. Russo. Compiled Labelled Deductive Systems: A Uniform Presentation of Non-classical Logics. Studies in Logic and Computation. Research Studies Press/Institute of Physics Publishing, Baldock, UK, Philadelphia, PA, 2004.
K. Broda, S. Eisenbach, H. Khoshnevisan, and S. Vickers. Reasoned Programming. Prentice Hall, 1994.
K. Cameron, Polyhedral and Algorithmic Ramications of Antichains, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, 1982.
Karamshuk, D., Noulas, A., Scellato, S., Nicosia, V., and Mascolo, C. (2013). Geospotting: Mining online location-based services for optimal retail store placement. In Proc. of KDD ’13, pages 793–801, Chicago, Illinois, USA. ACM.
Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373–395.
Kaufman, L. and Rousseeuw, P. J. (2009). Finding groups in data: an introduction to cluster analysis, volume 344. John Wiley & Sons.
Khachiyan, L. G. (1979). A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR, 244:1093–1096.
Kindberg, T., Chalmers, M., and Paulos, E. (2007). Guest editors’ introduction: Urban computing. IEEE Pervasive Computing, 6(3):18–20.
Kisilevich, S., Krstajic, M., Keim, D., Andrienko, N., and Andrienko, G. (2010). Event-based analysis of people’s activities and behavior using ickr and panoramio geotagged photo collections. In Proc. of Conf. on Inf. Vis., pages 289–296, London, UK. IEEE.
Kiva Systems, L. (2015). Automated guided vehicles. http://www.kivasystems.com/. Acessado em: 19.03.2015.
Kloks, T. (2012). Advanced Graph Algorithms.
Koenig, N. and Howard, A. (2004). Design and use paradigms for gazebo, an open-source multi-robot simulator. In Intelligent Robots and Systems, 2004. (IROS 2004). Proceedings. 2004 IEEE/RSJ International Conference on, volume 3, pages 2149–2154.
Kostakos, V. (2009). Temporal graphs. Physica A: Statistical Mechanics and its Applications, 388(6):1007–1023.
Kostakos, V. and O’Neill, E. (2008). {City ware: Urban Computing to Bridge Online}. Handbook of Research on Urban Informatics: The Practice and Promise of the Real-Time City.
Krings, G., Calabrese, F., Ratti, C., and Blondel, V. D. (2009). Urban gravity: a model for inter-city telecommunication ows. Journal of Statistical Mechanics: Theory and Experiment, 2009(07):L07003.
L. Alcón, and M. Gutierrez, Cliques and extended triangles. A necessary condition for planar clique graphs, Discrete Appl. Math. 141 (2004) 3–17.
L. Alcon, L. Faria, C. M. H. de Figueiredo, and M. Gutierrez, Split clique graph complexity, Theoret. Comput. Sci. 506 (2013) 29–42.
L. Alcon, L. Faria, C. M. H. de Figueiredo, and M. Gutierrez, The complexity of clique graph recognition, Theoret. Comput. Sci. 410 (2009) 2072–2083.
L. Fortnow, R. Santhanam, Infeasibility of instance compression and succinct PCPs for NP, Journal of Computer and System Sciences, v.77, p. 91-106, 2011.
L. Fortnow, The status of the P versus NP problem, Communications of the ACM 52 (2009) 78–86.
L. G. Valiant. Three problems in computer science. Journal of ACM, 50(1):96–99, 2003.
Landroid (2015). Wg794e. http://www.worxlandroid.com/. Acessado em: 19.03.2015.
Lane, N. D., Eisenman, S. B., Musolesi, M., Miluzzo, E., and Campbell, A. T. (2008). Urban sensing systems: Opportunistic or participatory? In Proc. of HotMobile ’08, pages 11–16, Napa Valley, California. ACM.
Lane, N., Miluzzo, E., Lu, H., Peebles, D., Choudhury, T., and Campbell, A. (2010). A survey of mobile phone sensing. Comm. Mag., IEEE, 48(9):140 –150.
Lee, J.-S. and Hoh, B. (2010). Dynamic pricing incentive for participatory sensing. Pervasive and Mobile Computing, 6(6):693–708.
Leo de Penning, Artur S. d’Avila Garcez, Luís C. Lamb, and John-Jules Ch. Meyer. A neural-symbolic cognitive agent for online learning and reasoning. In Toby Walsh, editor, IJCAI-11, pages 1653–1658. IJCAI/AAAI, 2011.
Leonardo M. de Moura and Nikolaj Bjørner. Satisability modulo theories: introduction and applications. Commun. ACM, 54(9):69-77, 2011.
Loureiro, A. A. F., Nogueira, J. M. S., Ruiz, L. B., Mini, R. A., Nakamura, E. F., and Figueiredo, C. M. S. (2003). Redes de sensores sem o. Proc. of SBRC’03, pages 179–226.
Ludwig Wittgenstein. Tractatus Logico-Philosophicus. Kegan Paul, Trench, Tubner & Co, London, 1922.
Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4):395– 416.
M. Cesati, L. Trevisan. On the efciency of polynomial time approximation schemes. Inform. Process. Lett., v. 64(4), p. 165-171, 1997.
M. Chudnovsky, G. Cornuéjols, X. Liu, P. Seymour, and K. Vuškovi´c, Recognizing Berge graphs, Combinatorica 25 (2005) 143–186.
M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Ann. of Math. 164 (2006) 51–229.
M. Fitting. Proof methods for modal and intuitionistic logics. D. Reidel Publishing Company, Dordrecht, 1983.
M. Grötschel, L. Lovász, and A. Schrijver, Polynomial Algorithms for Perfect Graphs, In Topics on Perfect Graphs, C. Berge and V. Chvátal, eds., North-Holland Mathematics Studies 88, Annals of Discrete Mathematics 21, North-Holland Publishing Co., Amsterdam, 1984, pp. 325–356.
M. Huth and M. Ryan. Logic in Computer Science: modelling and reasoning about systems. Cambridge University Press, 2000.
M. M. Barbosa, C. P. de Mello, and J. Meidanis, Local conditions for edgecolouring of cographs, Congr. Numer. 133 (1998) 45–55.
M. Plantholt, The chromatic index of graphs with a spanning star, J. Graph Theory 5 (1981) 45–53.
M. R. Garey, and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness. WH Freeman, New York, 1979.
M.Y. Vardi. Why is modal logic so robustly decidable? In N. Immerman and P. Kolaitis, editors, Descriptive Complexity and Finite Models, volume 31 of Discrete Mathematics and Theoretical Computer Science, pages 149–184. DIMACS, 1997.
MacKerron, G. and Mourato, S. (2013). Happiness is greater in natural environments. Global Environmental Change, 23(5):992–1000.
Maisonneuve, N., Stevens, M., Niessen, M. E., and Steels, L. (2009). Noisetube: Measuring and mapping noise pollution with mobile phones. In Information Technologies in Environmental Engineering, pages 215–228. Springer.
Manber, U. (1989). Introduction to algorithms - a creative approach. Addison-Wesley.
Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk and Saket Saurabh. Parameterized Algorithms. A ser publicado, Springer, 2015+.
Martine, G., Marshall, A., et al. (2007). State of world population 2007: unleashing the potential of urban growth. In State of world population 2007: unleashing the potential of urban growth. UNFPA.
Mashhadi, A. J. and Capra, L. (2011). Quality Control for Real-time Ubiquitous Crowdsourcing. In Proc. of UbiCrowd’11, pages 5–8, Beijing, China.
Mataric, M. (1992). Behavior-based control: Main properties and implications. In In Proceedings, IEEE International Conference on Robotics and Automation, Workshop on Architectures for Intelligent Control Systems, pages 46–54.
Mataric, M. (2014). Introdução a Robótica. Blucher/UNESP Editora, São Paulo, SP, Brasil, 1ed(traduzido) edition.
Metta, G., Fitzpatrick, P., and Natale, L. (2006). Yarp: yet another robot platform. International Journal on Advanced Robotics Systems, 3(1):43–48.
Michael R. Garey, David S. Johnson. Computer and intractability. A Guide to the NP-Completeness. Ney York, NY: WH Freeman and Company, 1979.
Miles, R., & Hamilton, K. (2006). Learning UML 2.0. O’Reilly.
Moshe Y. Vardi. Is information technology destroying the middle class? Commun. ACM, 58(2):5, 2015.
Murphy, R. R. (2000). Introduction to AI Robotics. MIT Press, Cambridge, MA, USA, 1st edition.
N. Trotignon, and K. Vuškovíc, A structure theorem for graphs with no cycle with a unique chord and its consequences, J. Graph Theory 63 (2010) 31–67.
NASA (2015). Robonaut r2. http://robonaut.jsc.nasa.gov/. Acessado em: 19.03.2015.
Nazir, A., Raza, S., and Chuah, C.-N. (2008). Unveiling facebook: A measurement study of social network based applications. In Proc. of IMC ’08, pages 43–56, Vouliagmeni, Greece.
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Lower Bounds on Kernelization, Discrete Optimization, v. 8, p. 110-128, 2011.
Nemhauser, G. L. eWolsey, L. A. (1988). Integer and combinatorial optimization. Wiley interscience series in discrete mathematics and optimization. Wiley.
Newman, M. (2010). Networks: an introduction. Oxford University Press, Inc.
Newman, M. E. J. (2003). The Structure and Function of Complex Networks. SIAM Review, 45(2):167–256.
Ng, A. Y., Jordan, M. I., Weiss, Y., et al. (2002). On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems, 2:849–856.
Nguyen, T. and Szymanski, B. K. (2012). Using location-based social networks to validate human mobility and relationships models. arXiv preprint arXiv:1208.3653.
Nicosia, V., Tang, J., Mascolo, C., Musolesi, M., Russo, G., and Latora, V. (2013). Graph metrics for temporal networks. In Temporal Networks, pages 15–40. Springer.
Noga Alon, Raphael Yuster, Uri Zwick, Color-coding, J.ACM, v. 42(4), 844-856, 1995.
Noulas, A., Scellato, S., Mascolo, C., and Pontil, M. (2011a). An Empirical Study of Geographic User Activity Patterns in Foursquare. In Proc. of ICWSM’11, Barcelona, Spain.
Noulas, A., Scellato, S., Mascolo, C., and Pontil, M. (2011b). Exploiting Semantic Annotations for Clustering Geographic Areas and Users in Location-based Social Networks. In Proc. of the Fifth Int’l Conf. on Weblogs and Social Media (ICWSM’11), Barcelona, Spain. AAAI.
Object Management Group (2010). OCL 2.3.1 Specification. OMG.
Object Management Group (2015). Interaction Flow Modeling Language – Version 1.0. OMG. Disponível em: http://www.omg.org/spec/IFML/1.0/.
>
Oxford Mobile Robotics, G. (2015). Moos. http://www.robots.ox.ac.uk/~mobile/MOOS/wiki/pmwiki.php/Main/HomePage. Acessado em: 28.04.2015.
Papadimitriou, C. H. e Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. Prentice-Hall, Inc., Upper Saddle River, NJ, USA.
Paulos, E. and Goodman, E. (2004). The familiar stranger: anxiety, comfort, and play in public places. In Proc. of CHI’04, pages 223–230, Vienna, Austria. ACM.
Poblete, B., Garcia, R., Mendoza, M., and Jaimes, A. (2011). Do all birds tweet the same?: characterizing twitter around the world. In Proc. of CIKM, pages 1025–1030, Glasgow, UK. ACM.
Pocolibs (2015). https://www.openrobots.org/wiki/pocolibs/. Acessado em: 28.04.2015.
Point Grey Research, I. (2015). Point grey chameleon. http://www.ptgrey.com/. Acessado em: 19.03.2015.
Pontes, T., Magno, G., Vasconcelos, M., Gupta, A., Almeida, J., Kumaraguru, P., and Almeida, V. (2012). Beware of what you share: Inferring home location in social networks. In Proc. of ICDMW, pages 571–578, Brussels, Belgium.
PUC-Rio, G. (2015). The programming language lua. http://www.lua.org/. Acessado em: 19.03.2015.
Quercia, D., Capra, L., and Crowcroft, J. (2012). The social world of twitter: Topics, geography, and emotions. In Proc. of ICWSM’12, Dublin, Ireland.
Quercia, D., Schifanella, R., Aiello, L. M., and McLean, K. (2015). Smelly maps: The digital life of urban smellscapes. In Proc. of ICWSM’15, Oxford, UK.
Quercia, D., Schifanella, R., and Aiello, L. M. (2014). The shortest path to happiness: Recommending beautiful, quiet, and happy routes in the city. In Proceedings of the 25th ACM Conference on Hypertext and Social Media, HT ’14, pages 116–125, New York, NY, USA. ACM.
Quigley, M., Conley, K., Gerkey, B., Faust, J., Foote, T., Leibs, J., Wheeler, R., and Ng, A. Y. (2009). Ros: an open-source robot operating system. In ICRA workshop on open source software, volume 3, page 5.
R. C. S. Machado, and C. M. H. de Figueiredo, Complexity separating classes for edge-colouring and total-colouring, J. Braz. Comput. Soc. 17 (2011) 281–285.
R. C. S. Machado, C. M. H. de Figueiredo, and K. Vuškovi´c, Chromatic index of graphs with no cycle with a unique chord, Theoret. Comput. Sci. 411 (2010) 1221–1234.
R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning about Knowledge. MIT Press, 1995.
R. Khardon and D. Roth. Learning to reason. Journal of the ACM, 44(5):697–725, 1997.
R. M. Smullyan. First-Order Logic. Dover Publications, New York, revised edition, 1995.
Rafael V. Borges, Artur d’Avila Garcez, and Luís C. Lamb. Learning and representing temporal knowledge in recurrent networks. IEEE Transactions on Neural Networks, 22(12):2409–2421, 2011.
Ralph Schoenman, editor. Bertrand Russell: Philosopher of the Century. Allen and Unwin, London, 1967.
Reddy, S., Estrin, D., Hansen, M., and Srivastava, M. (2010). Examining micro-payments for participatory sensing data collections. In Proc. of Ubicomp ’10, pages 33–36, Copenhagen, Denmark. ACM.
Reis, J., Benevenuto, F., Vaz de Melo, P., Prates, R., Kwak, H., and An, J. (2015). Breaking the news: First impressions matter on online news. In Proceedings of the 9th International AAAI Conference on Web-Blogs and Social Media, Oxford, UK.
Richard M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, 1972.
Robert A. Kowalski. Computational Logic and Human Thinking: How to be Articially Intelligent. Cambridge University Press, 2011.
Robert A. Kowalski. Logic for Problem Solving, Revisited. Herstellung und Verlag: Books on Demand, 2014.
Robin Milner. Communication and concurrency. PHI Series in computer science. Prentice Hall, 1989.
Rodney G. Downey, Michael R. Fellows. Fixed-parameter tractability and completeness I: Basic results. Siam Journal on Computing, v. 24, n. 4, p. 873-921, ago. 1995.
Rodney G. Downey, Michael R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science, v. 141, p. 109131, abr. 1995.
Rodney G. Downey, Michael R. Fellows. Fundamentals of Parameterized Complexity, Springer, 2013.
Rodney G. Downey, Michael R. Fellows. Parameterized complexity, Monographs in Computer Science, Springer, 1999.
Rolf Niedermeier. Invitation to xed-parameter algorithms, Oxford Lecture Series in Mathematics and Its Applications, Oxford University Press, 2006.
Romero, R. A. F., Prestes, E., Osório, F., and Wolf, D. (2014a). Introdução à Robótica Móvel. In Robótica Móvel, chapter 1, pages 1–12. Editora LTC, Rio de Janeiro.
Romero, R. A. F., Prestes, E., Osório, F., and Wolf, D. (2014b). Sensores e Atuadores. In Robótica Móvel, chapter 2, pages 13–25. Editora LTC, Rio de Janeiro.
Rosen, K. H. (2012). Discrete Mathematics and Its Applications: And Its Applications. McGraw-Hill Higher Education, sétima edição.
S. Kripke. A completeness theorem in modal logic. Journal of Symbolic Logic, 24:1–4, 1959.
S. Kripke. Semantic analysis of modal logics I, normal propositional calculi. Zeitschrift für mathematische Logik und Glundlagen der Mathematik, 9:67–96, 1963.
S.J. Russell. Unifying Logic and Probability: A New Dawn for AI? In Information Processing and Management of Uncertainty in Knowledge-Based Systems 15th International Conference, IPMU 2014, pages 10–14, 2014.
Sakaki, T., Okazaki, M., and Matsuo, Y. (2010a). Earthquake shakes twitter users: realtime event detection by social sensors. In Proc. of WWW’10, pages 851–860, Raleigh, USA.
Sakaki, T., Okazaki, M., and Matsuo, Y. (2010b). Earthquake shakes twitter users: realtime event detection by social sensors. In Proc. of WWW’10, pages 851–860, Raleigh, USA. IW3C2.
Schrijver, A. (1986). Theory of Linear and Integer Programming. Wiley- Interscience Series in Discrete Mathematics. John Wiley, Chichester.
Seffah, A. (2015). Patterns of HCI Design and HCI Design of Patterns: Bridging HCI Design and Model-Driven Software Engineering. Springer-Verlag.
Shannon, C. E. (1948). A mathematical theory of communication. Bell system tech. jour., 27.
SICK, A. (2015). Lms 200. http://www.sick.com/. Acessado em: 19.03.2015.
Siegwart, R., Nourbakhsh, I. R., and Scaramuzza, D. (2011). Introduction to Autonomous Mobile Robots. The MIT Press, 2nd edition.
Silva, T. H., Vaz de Melo, P. O. S., Almeida, J. M., and Loureiro, A. A. F. (2012). Visualizing the invisible image of cities. In Proc. IEEE CPScom’12, pages 382–389, Besancon, France.
Silva, T. H., Vaz de Melo, P. O. S., Almeida, J. M., and Loureiro, A. A. F. (2013a). Challenges and opportunities on the large scale study of city dynamics using participatory sensing. In Proc. of IEEE ISCC’13, pages 528–534, Split, Croatia.
Silva, T. H., Vaz de Melo, P. O. S., Almeida, J. M., and Loureiro, A. A. F. (2013b). Uma Fotograa do Instagram: Caracterização e Aplicação. In Proc. of SBRC’13, Brasília, Brazil.
Silva, T. H., Vaz de Melo, P. O. S., Almeida, J. M., Musolesi, M., and Loureiro, A. A. F. (2014c). You are What you Eat (and Drink): Identifying Cultural Boundaries by Analyzing Food & Drink Habits in Foursquare. In Proc. of ICWSM’14, Ann Arbor, USA.
Silva, T. H., Vaz de Melo, P. O. S., Almeida, J. M., Salles, J., and Loureiro, A. A. F. (2013c). A picture of Instagram is worth more than a thousand words: Workload characterization and application. In Proc. of DCOSS’13, pages 123–132, Cambridge, USA.
Silva, T. H., Vaz de Melo, P. O. S., Almeida, J. M., Salles, J., and Loureiro, A. A. F. (2013d). A comparison of foursquare and instagram to the study of city dynamics and urban social behavior. In Proc. of UrbComp’13, pages 1–8, Chicago, USA.
Silva, T. H., Vaz de Melo, P. O. S., Almeida, J. M., Salles, J., and Loureiro, A. A. F. (2014d). Revealing the city that we cannot see. ACM Trans. Internet Technol., 14(4):26:1–26:23.
Silva, T. H., Vaz de Melo, P. O. S., Viana, A., Almeida, J. M., Salles, J., and Loureiro, A. A. F. (2013e). Trafc Condition is more than Colored Lines on a Map: Characterization of Waze Alerts. In Proc. of SocInfo’13, pages 309–318, Kyoto, Japan.
Silva, T. H., Vaz de Melo, P., Almeida, J., Viana, A., Salles, J., and Loureiro, A. (2014b). Participatory Sensor Networks as Sensing Layers. In Proc. of SocialCom’14, Sydney, Australia.
Silva, T., Vaz De Melo, P., Almeida, J., and Loureiro, A. (2014a). Large-scale study of city dynamics and urban social behavior using participatory sensing. Wireless Communications, IEEE, 21(1):42–51.
Sinnott, R. W. (1984). Virtues of the Haversine. Sky and Telescope, 68(2):159+.
Sørensen, T. (1948). A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons. Biologiske Skrifter, 5(4).
Srivastava, M., Abdelzaher, T., and Szymanski, B. (2012). Human-centric sensing. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 370(1958):176–197.
Staranowicz, A. and Mariottini, G. L. (2011). A survey and comparison of commercial and open-source robotic simulator software. In Proceedings of the 4th International Conference on PErvasive Technologies Related to Assistive Environments, PETRA ’11, pages 56:1–56:8, New York, NY, USA. ACM.
Stephen A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3-5, 1971, Shaker Heights, Ohio, USA, pages 151–158, 1971.
Szwarcfiter, J. (1988). Grafos e Algoritmos Computacionais. Editora Campus Ltda, second edição.
T. A. McKee, and F. R. McMorris, Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications, 1999.
T. Feder, P. Hell, S. Klein, and R. Motwani, List partitions, SIAM J. Discrete Math. 16 (2003) 449–478.
T. Niessen, How to nd overfull subgraphs in graphs with large maximum degree, Electron. J. Combin. 8 (2001) R7.
Thelwall, M., Buckley, K., Paltoglou, G., Cai, D., and Kappas, A. (2010). Sentiment in short strength detection informal text. J. Am. Soc. Inf. Sci. Technol., 61(12):2544–2558.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction to Algorithms. MIT Press, Terceira edição, 2009.
Tidwell, J. (2005). Designing Interfaces: Patterns for effective interaction design. O’Reilly Media.
Toch, E., Cranshaw, J., Drielsma, P. H., Tsai, J. Y., Kelley, P. G., Springeld, J., Cranor, L., Hong, J., and Sadeh, N. (2010). Empirical models of privacy in location sharing. In Proc. of Ubicomp’10, pages 129–138, Copenhagen, Denmark. ACM.
Tostes, A. I. J., Duarte-FIgueiredo, F., Assunção, R., Salles, J., and Loureiro, A. A. F. (2013). From data to knowledge: City-wide trafc ows analysis and prediction using bing maps. In Proc. of ACM UrbComp’13, Chicago, USA.
Tostes, A. I. J., Silva, T. H., Duarte-FIgueiredo, F., and Loureiro, A. A. F. (2014). Studying trafc conditions by analyzing foursquare and instagram data. In Proc. of ACM PE-WASUN’14, Montreal, Canada.
V. Chvátal, Star-cutsets and perfect graphs, J. Combin. Theory Ser. B 39 (1985) 189–199.
Vaughan, R. T., Gerkey, B. P., and Howard, A. (2003). On device abstractions for portable, reusable robot code. In Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings. 2003 IEEE/RSJ International Conference on, volume 3, pages 2421–2427.
Velodyne LiDAR, I. (2015). Velodyne hdl-32e. http://velodynelidar.com/. Acessado em: 19.03.2015.
Vieira, R. d. S. and Roqueiro, N. (2014). Cinemática e dinâmica de robôs móveis. In Romero, R. A. F., Prestes, E., Osório, F., and Wolf, D., editors, Robótica Móvel, chapter 3, pages 26–46. Editora LTC, Rio de Janeiro.
Wazlawick, R. S. (2015). Análise e Design Orientados a Objetos para Sistemas de Informação: Modelagem com UML, OCL e IFML. 3ª edição. Elsevier. (1ª edição em 2004 com o título “Análise e Projeto de Sistemas de Informação Orientados a Objetos”).
Wolf, D., Simoes, E., Osorio, F., and Trindade Junior, O. (2009). Robótica inteligente: Da simulação as aplicações no mundo real. In Anais do CSBC’09 XXIV Jornada de Atualização em Informática (JAI), chapter 6, pages 279–330. SBC, Bento Gonçalves, RS.
Wolsey, L. A. (1998). Integer programming. Wiley-Interscience, New York, NY, USA.
Yan, X. (2009). Linear regression analysis: theory and computing. World Scientic.
Youyou, W., Kosinski, M., and Stillwell, D. (2015). Computer-based personality judgments are more accurate than those made by humans. Nat. Acad. of Sci., 112(4):1036–1040.
Yuan, Q., Cong, G., Ma, Z., Sun, A., and Thalmann, N. M. (2013). Time-aware point-ofinterest recommendation. In Proc. of SIGIR ’13, pages 363–372, Dublin, Ireland. ACM.
Z. Manna and R. Waldinger. The logical basis for computer programming. Volume 1: deductive reasoning. Addison-Wesley, Boston, 1985.
Zaki, M. J. and Meira Jr, W. (2014). Data mining and analysis: fundamental concepts and algorithms. Cambridge University Press.
Zhang, K., Jin, Q., Pelechrinis, K., and Lappas, T. (2013). On the importance of temporal dynamics in modeling urban activity. In Proc. of UrbComp’13, pages 7:1–7:8, Chicago, Illinois.
Zheng, Y.-T., Zha, Z.-J., and Chua, T.-S. (2012). Mining travel patterns from geotagged photos. ACM Trans. Intell. Syst. Technol., 3(3):56:1–56:18.
Zheng, Y., Capra, L., Wolfson, O., and Yang, H. (2014a). Urban computing: concepts, methodologies, and applications. ACM Transactions on Intelligent Systems and Technology (TIST), 5(3):38.
Zheng, Y., Liu, T., Wang, Y., Zhu, Y., Liu, Y., and Chang, E. (2014b). Diagnosing new york city’s noises with ubiquitous data. In Proc. of UbiComp’14, pages 715–725, Seattle, Washington. ACM.
Zheng, Y., Zhang, L., Xie, X., and Ma, W.-Y. (2009). Mining interesting locations and travel sequences from gps trajectories. In Proc. of WWW’09, pages 791–800, Madrid, Spain. ACM.
Zipf, G. K. (1946). The p1 p2/d hypothesis: On the intercity movement of persons. American sociological review, pages 677–686.
Ziviani, N. (2011). Projetos de Algoritmos com implementações em Pascal e C. Cengage Learning.
Detalhes sobre o formato disponível para publicação: Volume Completo
© O(s) autor(es), 2015.

Esse trabalho foi publicado de acordo com os termos da licença Creative Commons Attribution 4.0 International License
.