var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fraw.githubusercontent.com%2Fivatoufg%2Fivatoufg.github.io%2Fmain%2Fpublicacoes_ivato.bib&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fraw.githubusercontent.com%2Fivatoufg%2Fivatoufg.github.io%2Fmain%2Fpublicacoes_ivato.bib&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fraw.githubusercontent.com%2Fivatoufg%2Fivatoufg.github.io%2Fmain%2Fpublicacoes_ivato.bib&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2021\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Evaluating Splitting Approaches in the Context of Student Dropout Prediction.\n \n \n \n \n\n\n \n de Barros, B. M.; do Nascimento, H. A. D.; Guedes, R.; and Monsueto, S. E.\n\n\n \n\n\n\n In The 17th International Conference on Frontiers in Education: Computer Science & Computer Engineering (FECS'21) - to appear, Las Vegas, USA, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"EvaluatingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{bngm-esacsdp-2021,\n  author    = {Bruno M. de Barros and Hugo A. D. do Nascimento and Raphael Guedes and Sandro E. Monsueto},\n  title     = {Evaluating Splitting Approaches in the Context of Student Dropout Prediction},\n  booktitle = {The 17th International Conference on Frontiers in Education: Computer Science \\& Computer Engineering (FECS'21) - to appear},\n  year      = {2021},\n  address   = {Las Vegas, USA},\n  keywords  = {student dropout, higher education, educational data mining, train/test split},\n  url       = {https://www.american-cse.org/static/2021-CSCE-BOOKLET-with-cover.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Um estudo das tecnologias de acessibilidade voltadas para deficientes visuais em museus.\n \n \n \n \n\n\n \n de Carvalho, L. E. S.; and do Nascimento, H. A. D.\n\n\n \n\n\n\n In Humanidades digitais: performatividades na cultura digital, Cap. 05, pages 37–49. Cegraf UFG, Goiânia, GO, June 2021.\n Lançado durante PANORAMAS 2021 e VIII SIIMI, em 15-18/jun/2021\n\n\n\n
\n\n\n\n \n \n \"UmPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InCollection{uetavpdvem-2021,\n  author    = {Leonardo Eloi Soares de Carvalho and Hugo Alexandre Dantas do Nascimento},\n  title     = {Um estudo das tecnologias de acessibilidade voltadas para deficientes visuais em museus},\n  booktitle = {Humanidades digitais: performatividades na cultura digital},\n  publisher = {Cegraf UFG},\n  year      = {2021},\n  chapter   = {Cap. 05},\n  pages     = {37--49},\n  address   = {Goiânia, GO},\n  month     = jun,\n  isbn      = {978-65-89504-60-3},\n  note      = {Lançado durante PANORAMAS 2021 e VIII SIIMI, em 15-18/jun/2021},\n  url       = {https://publica.ciar.ufg.br/ebooks/invencoes/livros/9/capitulos/c05.html},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Análise Automática da Marcha para Diagnóstico e Classificação de Severidade da Doença de Parkinson.\n \n \n \n \n\n\n \n Felix, J. P.; da Fonseca, A. U.; do Nascimento, H. A. D.; and Guimarães, N. N.\n\n\n \n\n\n\n In 18o Congresso de Pesquisa, Ensino e Extensão (CONPEEX 2021), Goiânia, Goiás, Outubro, 04–08, 2021, pages 1–1, 2021. UFG\n \n\n\n\n
\n\n\n\n \n \n \"AnálisePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{felix2021b,\n  author    = {Juliana Paula Felix and Afonso Ueslei da Fonseca and Hugo Alexandre Dantas do Nascimento and Nilza Nascimento Guimar\\~{a}es},\n  title     = {Análise Automática da Marcha para Diagnóstico e Classificação de Severidade da Doença de Parkinson},\n  booktitle = {18o Congresso de Pesquisa, Ensino e Extensão (CONPEEX 2021), Goiânia, Goiás, Outubro, 04--08, 2021},\n  year      = {2021},\n  pages     = {1--1},\n  publisher = {{UFG}},\n  url       = {https://eventos.ufg.br/conpeex2021},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Automatic Classification of Amyotrophic Lateral Sclerosis through Gait Dynamics.\n \n \n \n\n\n \n Felix, J. P.; Do Nascimento, H. A. D.; Guimarães, N. N.; Pires, E. D. O.; Da Fonseca, A. U.; and Vieira, G. D. S.\n\n\n \n\n\n\n In 2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC), pages 1942-1947, Madrid, Spain, July 2021. IEEE\n July 12 2021 to July 16 2021\n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{felix2021a,\n  author       = {Felix, Juliana Paula and Do Nascimento, Hugo Alexandre Dantas and Guimarães, Nilza Nascimento and Pires, Eduardo Di Oliveira and Da Fonseca, Afonso Ueslei and Vieira, Gabriel Da Silva},\n  title        = {Automatic Classification of Amyotrophic Lateral Sclerosis through Gait Dynamics},\n  booktitle    = {2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC)},\n  year         = {2021},\n  pages        = {1942-1947},\n  address      = {Madrid, Spain},\n  month        = {July},\n  organization = {IEEE},\n  note         = {July 12 2021 to July 16 2021},\n  doi          = {10.1109/COMPSAC51774.2021.00295},\n  keywords     = {Amyotrophic lateral sclerosis, machine learning, gait, diagnosis},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n String-Recommender: Combining temporal information with Collaborative Filtering using string-comparison measures.\n \n \n \n \n\n\n \n Pascoal, L. M. L.\n\n\n \n\n\n\n Ph.D. Thesis, Universidade Federal de Goiás, Goiânia, Goiás, 09 2021.\n \n\n\n\n
\n\n\n\n \n \n \"String-Recommender:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@PhdThesis{pascoal-sr-2021,\n  author   = {Luiz Mario Lustosa Pascoal},\n  title    = {String-Recommender: Combining temporal information with Collaborative Filtering using string-comparison measures},\n  school   = {Universidade Federal de Goiás},\n  year     = {2021},\n  address  = {Goiânia, Goiás},\n  month    = {09},\n  abstract = {Recommender Systems are information filtering systems that use the user's interests in order to recommend different products. The main technique employed in this type of system is the Collaborative Filtering (CF) which recommends products to a target-user based on known past evaluations of products made by other users who have similar preferences. However, the traditional CF approaches neglect the fact that the user taste may change over time and do not consider the rich temporal information that is contained in sequentially-ordered user interactions with products. Therefore, in this Doctoral Thesis, we have studied and researched on the current state of these systems, paying special attention to CF based on neighborhood, in order to propose the String-Recommender, which is a framework that combines several proposed variants of string-comparison measures used as similarity functions between users to seven proposed CF-based recommendation strategies. All the adopted string-comparison measures take into consideration time-ordered data, so our framework introduces a general and transparent modeling to adapt timestamped user's interaction to sequences. In addition to the definition of the new recommenders, this study is complemented with experimental results using two proposed temporal-based evaluation protocols in five well-known datasets in the area. As a summary, during the conducted experiments, the results show that our methods lead to more effective recommendations considering ranking measures on different recommendation list sizes, even in scenarios in which the rate of evaluated items per user is very low. Finally, the results lead us to also proposed a very robust and significant Validation Process that verifies the the effectiveness of a list of recommendation methods in future scenarios.},\n  keywords = {Recommender Systems, Collaborative Filtering, Temporal dynamics, String-comparison measures, Similarity Functions},\n  url      = {https://repositorio.bc.ufg.br/tede/},\n}\n\n\n
\n
\n\n\n
\n Recommender Systems are information filtering systems that use the user's interests in order to recommend different products. The main technique employed in this type of system is the Collaborative Filtering (CF) which recommends products to a target-user based on known past evaluations of products made by other users who have similar preferences. However, the traditional CF approaches neglect the fact that the user taste may change over time and do not consider the rich temporal information that is contained in sequentially-ordered user interactions with products. Therefore, in this Doctoral Thesis, we have studied and researched on the current state of these systems, paying special attention to CF based on neighborhood, in order to propose the String-Recommender, which is a framework that combines several proposed variants of string-comparison measures used as similarity functions between users to seven proposed CF-based recommendation strategies. All the adopted string-comparison measures take into consideration time-ordered data, so our framework introduces a general and transparent modeling to adapt timestamped user's interaction to sequences. In addition to the definition of the new recommenders, this study is complemented with experimental results using two proposed temporal-based evaluation protocols in five well-known datasets in the area. As a summary, during the conducted experiments, the results show that our methods lead to more effective recommendations considering ranking measures on different recommendation list sizes, even in scenarios in which the rate of evaluated items per user is very low. Finally, the results lead us to also proposed a very robust and significant Validation Process that verifies the the effectiveness of a list of recommendation methods in future scenarios.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Segmentation of Words Written in the Latin Alphabet: A Systematic Review.\n \n \n \n \n\n\n \n Inuzuka, M. A.; Rocha, A. S.; and Nascimento, H. A. D.\n\n\n \n\n\n\n In Quaresma, P.; Vieira, R.; Aluísio, S. M.; Moniz, H.; Batista, F.; and Gonçalves, T., editor(s), Computational Processing of the Portuguese Language - 14th International Conference, PROPOR 2020, Evora, Portugal, March 2-4, 2020, Proceedings, volume 12037, of Lecture Notes in Computer Science, pages 291–302, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"SegmentationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{quaresma_segmentation_2020,\n  author    = {Marcelo A. Inuzuka and\n               Acquila S. Rocha and\n               Hugo A. D. Nascimento},\n  editor    = {Paulo Quaresma and\n               Renata Vieira and\n               Sandra M. Alu{\\'{\\i}}sio and\n               Helena Moniz and\n               Fernando Batista and\n               Teresa Gon{\\c{c}}alves},\n  title     = {Segmentation of Words Written in the Latin Alphabet: {A} Systematic\n               Review},\n  booktitle = {Computational Processing of the Portuguese Language - 14th International\n               Conference, {PROPOR} 2020, Evora, Portugal, March 2-4, 2020, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {12037},\n  pages     = {291--302},\n  publisher = {Springer},\n  abstract   = {In this systematic literature review (SLR) we summarize studies that address the word segmentation problem (WSP) for Latin-based languages. We adopted the protocol of Kitchenham et al. for the review. The search in academic repositories found 771 works, from which 89 were selected. After a quality assessment step, 69 papers were chosen for data extraction. The results point to a divergence in terminology of this problem, two of which are more relevant, having specific techniques, corpus and application context: compound splitting and identifier splitting. We analyze the state of the art of each context, pointing out differences and similarities in approaches. We hope that these results can serve as a guide for future investigations and advancement of WSP.},\n  year      = {2020},\n  url       = {https://doi.org/10.1007/978-3-030-41505-1\\_28},\n  doi       = {10.1007/978-3-030-41505-1\\_28},\n  timestamp = {Tue, 03 Mar 2020 09:40:18 +0100},\n  biburl    = {https://dblp.org/rec/conf/propor/InuzukaRN20.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n
\n In this systematic literature review (SLR) we summarize studies that address the word segmentation problem (WSP) for Latin-based languages. We adopted the protocol of Kitchenham et al. for the review. The search in academic repositories found 771 works, from which 89 were selected. After a quality assessment step, 69 papers were chosen for data extraction. The results point to a divergence in terminology of this problem, two of which are more relevant, having specific techniques, corpus and application context: compound splitting and identifier splitting. We analyze the state of the art of each context, pointing out differences and similarities in approaches. We hope that these results can serve as a guide for future investigations and advancement of WSP.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A GPU-Based Parallel Reduction Implementation.\n \n \n \n \n\n\n \n Jradi, W. A. R.; do Nascimento, H. A. D.; and Martins, W. S.\n\n\n \n\n\n\n In Bianchini, C.; Osthoff, C.; Souza, P.; and Ferreira, R., editor(s), High Performance Computing Systems. WSCAD 2018. Communications in Computer and Information Science, volume 1171, pages 168–182, Cham, Feb/14/2020 2020. Springer International Publishing\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{10.1007/978-3-030-41050-6_11,\n  author    = {Jradi, Walid Abdala Rfaei and do Nascimento, Hugo Alexandre Dantas and Martins, Wellington Santos},\n  title     = {A GPU-Based Parallel Reduction Implementation},\n  booktitle = {High Performance Computing Systems. WSCAD 2018. Communications in Computer and Information Science},\n  year      = {2020},\n  editor    = {Bianchini, Calebe and Osthoff, Carla and Souza, Paulo and Ferreira, Renato},\n  volume    = {1171},\n  pages     = {168--182},\n  address   = {Cham},\n  month     = {Feb/14/2020},\n  publisher = {Springer International Publishing},\n  abstract  = {Reduction operations aggregate a finite set of numeric elements into a single value. They are extensively employed in many computational tasks and can be performed in parallel when multiple processing units are available. This work presents a GPU-based approach for parallel reduction, which employs techniques like loop unrolling, persistent threads and algebraic expressions. It avoids thread divergence and it is able to surpass the methods currently in use. Experiments conducted to evaluate the approach show that the strategy performs efficiently on both AMD and NVidia's hardware platforms, as well as using OpenCL and CUDA, making it portable.},\n  doi       = {10.1007/978-3-030-41050-6_11},\n  isbn      = {978-3-030-41050-6},\n  url       = {https://doi.org/10.1007/978-3-030-41050-6_11},\n}\n\n
\n
\n\n\n
\n Reduction operations aggregate a finite set of numeric elements into a single value. They are extensively employed in many computational tasks and can be performed in parallel when multiple processing units are available. This work presents a GPU-based approach for parallel reduction, which employs techniques like loop unrolling, persistent threads and algebraic expressions. It avoids thread divergence and it is able to surpass the methods currently in use. Experiments conducted to evaluate the approach show that the strategy performs efficiently on both AMD and NVidia's hardware platforms, as well as using OpenCL and CUDA, making it portable.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using String-Comparison Measures to Improve and Evaluate Collaborative Filtering Recommender Systems.\n \n \n \n \n\n\n \n Lustosa Pascoal, L. M.; Dantas do Nascimento, H. A.; Couto Rosa, T.; Queiroz da Silva, E.; and Lima Aleixo, E.\n\n\n \n\n\n\n In Boratto, L.; Faralli, S.; Marras, M.; and Stilo, G., editor(s), Bias and Social Aspects in Search and Recommendation (BIAS 2020). Communications in Computer and Information Science, volume 1245, pages 181–194, Lisbon, Portugal, April 2020. Springer International Publishing\n April, 14, 2020. Sem Qualis\n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{10.1007/978-3-030-52485-2_16,\n  author    = {Lustosa Pascoal, Luiz Mario and Dantas do Nascimento, Hugo Alexandre and Couto Rosa, Thierson and Queiroz da Silva, Edjalma and Lima Aleixo, Everton},\n  title     = {Using String-Comparison Measures to Improve and Evaluate Collaborative Filtering Recommender Systems},\n  booktitle = {Bias and Social Aspects in Search and Recommendation ({BIAS 2020}). Communications in Computer and Information Science},\n  year      = {2020},\n  editor    = {Boratto, Ludovico and Faralli, Stefano and Marras, Mirko and Stilo, Giovanni},\n  volume    = {1245},\n  pages     = {181--194},\n  address   = {Lisbon, Portugal},\n  month     = {April},\n  publisher = {Springer International Publishing},\n  note      = {April, 14, 2020. Sem Qualis},\n  abstract  = {Recommender Systems are expert systems that utilize the user's interests in order to recommend different products. One of the main techniques employed in this type of system is the Collaborative Filtering which recommends products to users based on their interactions and on what items similar users have liked in the past. However, many traditional methods for determining similarity do not consider temporal information neither the rich information that is contained in sequentially-ordered user interactions. Therefore, the present work proposes the usage of traditional string comparison approaches for defining new similarity measures between pairs of users that take into consideration time-ordered data. The general idea is to model the similarity computation between users as an approximate string matching problem and to employ classical algorithms that solve it. Experiments conducted in different application domains demonstrate that the measures based on a string-comparison approach can improve accuracy. Furthermore, they represent a new way of evaluating the performance of sequence-based recommendation.},\n  doi       = {10.1007/978-3-030-52485-2_16},\n  isbn      = {978-3-030-52485-2},\n  keywords  = {String-comparison, Recommender Systems, Measures},\n  url       = {https://doi.org/10.1007/978-3-030-52485-2_16},\n}\n\n
\n
\n\n\n
\n Recommender Systems are expert systems that utilize the user's interests in order to recommend different products. One of the main techniques employed in this type of system is the Collaborative Filtering which recommends products to users based on their interactions and on what items similar users have liked in the past. However, many traditional methods for determining similarity do not consider temporal information neither the rich information that is contained in sequentially-ordered user interactions. Therefore, the present work proposes the usage of traditional string comparison approaches for defining new similarity measures between pairs of users that take into consideration time-ordered data. The general idea is to model the similarity computation between users as an approximate string matching problem and to employ classical algorithms that solve it. Experiments conducted in different application domains demonstrate that the measures based on a string-comparison approach can improve accuracy. Furthermore, they represent a new way of evaluating the performance of sequence-based recommendation.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Domain Adaptation of Transformers for English Word Segmentation.\n \n \n \n \n\n\n \n Rodrigues, R. C.; Rocha, A. S.; Inuzuka, M. A.; and do Nascimento, H. A. D.\n\n\n \n\n\n\n In Cerri, R.; and Prati, R. C., editor(s), Intelligent Systems - 9th Brazilian Conference, BRACIS 2020, Rio Grande, Brazil, October 20-23, 2020, Proceedings, Part I, volume 12319, of Lecture Notes in Computer Science, pages 483–496, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"DomainPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/bracis/RodriguesRIN20,\n  author    = {Ruan Chaves Rodrigues and\n               Acquila Santos Rocha and\n               Marcelo Akira Inuzuka and\n               Hugo Alexandre Dantas do Nascimento},\n  editor    = {Ricardo Cerri and\n               Ronaldo C. Prati},\n  title     = {Domain Adaptation of Transformers for English Word Segmentation},\n  booktitle = {Intelligent Systems - 9th Brazilian Conference, {BRACIS} 2020, Rio\n               Grande, Brazil, October 20-23, 2020, Proceedings, Part {I}},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {12319},\n  pages     = {483--496},\n  publisher = {Springer},\n  year      = {2020},\n  abstract     = {Word segmentation can contribute to improve the results of natural language processing tasks on several problem domains, including social media sentiment analysis, source code summarization and neural machine translation. Taking the English language as a case study, we fine-tune a Transformer architecture which has been trained through the Pre-trained Distillation (PD) algorithm, while comparing it to previous experiments with recurrent neural networks. We organize datasets and resources from multiple application domains under a unified format, and demonstrate that our proposed architecture has competitive performance and superior cross-domain generalization in comparison with previous approaches for word segmentation in Western languages.},\n  url       = {https://doi.org/10.1007/978-3-030-61377-8\\_33},\n  doi       = {10.1007/978-3-030-61377-8\\_33},\n  timestamp = {Wed, 21 Oct 2020 16:49:39 +0200},\n  biburl    = {https://dblp.org/rec/conf/bracis/RodriguesRIN20.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n
\n\n\n
\n Word segmentation can contribute to improve the results of natural language processing tasks on several problem domains, including social media sentiment analysis, source code summarization and neural machine translation. Taking the English language as a case study, we fine-tune a Transformer architecture which has been trained through the Pre-trained Distillation (PD) algorithm, while comparing it to previous experiments with recurrent neural networks. We organize datasets and resources from multiple application domains under a unified format, and demonstrate that our proposed architecture has competitive performance and superior cross-domain generalization in comparison with previous approaches for word segmentation in Western languages.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computational Mining on IBICT BDTD’s Thesis and Dissertation Metadata for Supporting Social Science Research.\n \n \n \n \n\n\n \n Filho, R. R.; Oliveira, E.; Nunes, J.; Inuzuka, M.; and do Nascimento, H.\n\n\n \n\n\n\n In Anais do XVII Encontro Nacional de Inteligência Artificial e Computacional, pages 603–614, Porto Alegre, RS, Brasil. Online, October 2020. Universidade Federal do Rio Grande (FURG), SBC\n October, 20-23, 2020 Site: http://www2.sbc.org.br/bracis2020/eniac.html Qualis B4 (2016)\n\n\n\n
\n\n\n\n \n \n \"ComputationalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{eniac,\n  author       = {Rodrigo R. Filho and Elismênnia Oliveira and Jordão Nunes and Marcelo Inuzuka and Hugo do Nascimento},\n  title        = {Computational Mining on IBICT BDTD’s Thesis and Dissertation Metadata for Supporting Social Science Research},\n  booktitle    = {Anais do XVII Encontro Nacional de Inteligência Artificial e Computacional},\n  year         = {2020},\n  pages        = {603--614},\n  address      = {Porto Alegre, RS, Brasil. Online},\n  month        = {October},\n  organization = {Universidade Federal do Rio Grande (FURG)},\n  publisher    = {SBC},\n  note         = {October, 20-23, 2020 Site: http://www2.sbc.org.br/bracis2020/eniac.html Qualis B4 (2016)},\n  abstract     = {The Brazilian Digital Library of Thesis and Dissertations (BDTD) provides essential data to support many social sciences investigations. Nevertheless, there is still a lack of computation tools tailored for helping extract and analyze the necessary information from the BDTD library. In this paper, we discuss the development of computational solutions to answer questions from a particular social sciences research using metadata from BDTD. The solutions involve the integration of data processing and presentation techniques, such as string-processing algorithms, knowledge graphs and information visualizations. All programming codes implemented at the scope of the project are available for helping other researchers. The paper also highlights the importance of having researchers from Social Science and Computer Science working together, what motivates future collaborations in these areas.},\n  doi          = {10.5753/eniac.2020.12163},\n  issn         = {0000-0000},\n  keywords     = {Social Science, text analysis, knowledge graphs, information visualization},\n  location     = {Evento Online},\n  url          = {https://sol.sbc.org.br/index.php/eniac/article/view/12163},\n}\n\n
\n
\n\n\n
\n The Brazilian Digital Library of Thesis and Dissertations (BDTD) provides essential data to support many social sciences investigations. Nevertheless, there is still a lack of computation tools tailored for helping extract and analyze the necessary information from the BDTD library. In this paper, we discuss the development of computational solutions to answer questions from a particular social sciences research using metadata from BDTD. The solutions involve the integration of data processing and presentation techniques, such as string-processing algorithms, knowledge graphs and information visualizations. All programming codes implemented at the scope of the project are available for helping other researchers. The paper also highlights the importance of having researchers from Social Science and Computer Science working together, what motivates future collaborations in these areas.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An effective and automatic method to aid the diagnosis of Amyotrophic Lateral Sclerosis using one minute of gait signal.\n \n \n \n \n\n\n \n Felix, J. P.; do Nascimento, H. A. D.; Guimarães, N. N.; Pires, E. D. O.; da Silva Vieira, G.; and de Souza Alencar, W.\n\n\n \n\n\n\n In 2020 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2020, Seoul, S. Korea, December 16-19, 2020, pages 1–8, 2020. IEEE\n Qualis B1 (2016)\n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{felix2020b,\n  author    = {Juliana Paula Felix and Hugo Alexandre Dantas do Nascimento and Nilza Nascimento Guimar\\~{a}es and Eduardo Di Oliveira Pires and Gabriel da Silva Vieira and Wanderley de Souza Alencar},\n  title     = {An effective and automatic method to aid the diagnosis of Amyotrophic Lateral Sclerosis using one minute of gait signal},\n  booktitle = {2020 {IEEE} International Conference on Bioinformatics and Biomedicine, {BIBM} 2020, Seoul, S. Korea, December 16-19, 2020},\n  year      = {2020},\n  pages     = {1--8},\n  publisher = {{IEEE}},\n  note      = {Qualis B1 (2016)},\n  url       = {http://ieeebibm.org/BIBM2020/index.html},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Doclass: open-source software to support document labeling and classification.\n \n \n \n \n\n\n \n Inuzuka, M.; do Nascimento, H.; Almeida, F.; Barros, B.; and Jradi, W.\n\n\n \n\n\n\n In Anais do VIII Symposium on Knowledge Discovery, Mining and Learning (KDMiLe 2020), pages 105–112, Porto Alegre, RS, Brasil, 2020. SBC\n Qualis B5 (2016)\n\n\n\n
\n\n\n\n \n \n \"Doclass:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{kdmile,\n  author    = {Marcelo Inuzuka and Hugo do Nascimento and Fernando Almeida and Bruno Barros and Walid Jradi},\n  title     = {Doclass: open-source software to support document labeling and classification},\n  booktitle = {Anais do VIII Symposium on Knowledge Discovery, Mining and Learning ({KDMiLe 2020})},\n  year      = {2020},\n  pages     = {105--112},\n  address   = {Porto Alegre, RS, Brasil},\n  publisher = {SBC},\n  note      = {Qualis B5 (2016)},\n  abstract  = {This article introduces Doclass, a free and open-source software for the Web that aims to assist in labeling and classifying large sets of documents. The research involved a design science research methodology, guided by the real demands of a legal text processing company. The architecture, several design decisions and the current development stage of the software are presented. Preliminary user experiments for evaluating interactive document labeling are described. As a result, the first version of a system with an architecture composed of a mobile frontend that communicates with a backend through a REST API was published, with satisfactory performance evaluation by the applicant. Other results involve the use of active learning techniques to reduce human effort when performing the classification of documents, as well as the Uncertainty strategy to choose the document to be labeled. The effectiveness of the stop criterion for the active learning technique based on confidence level was tested and proved unsatisfactory, remaining as a future work.},\n  doi       = {10.5753/kdmile.2020.11965},\n  issn      = {0000-0000},\n  keywords  = {document classification, active learning, annotation tool, document labeling, legal text},\n  location  = {Evento Online},\n  url       = {https://sol.sbc.org.br/index.php/kdmile/article/view/11965},\n}\n\n
\n
\n\n\n
\n This article introduces Doclass, a free and open-source software for the Web that aims to assist in labeling and classifying large sets of documents. The research involved a design science research methodology, guided by the real demands of a legal text processing company. The architecture, several design decisions and the current development stage of the software are presented. Preliminary user experiments for evaluating interactive document labeling are described. As a result, the first version of a system with an architecture composed of a mobile frontend that communicates with a backend through a REST API was published, with satisfactory performance evaluation by the applicant. Other results involve the use of active learning techniques to reduce human effort when performing the classification of documents, as well as the Uncertainty strategy to choose the document to be labeled. The effectiveness of the stop criterion for the active learning technique based on confidence level was tested and proved unsatisfactory, remaining as a future work.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Braille text entry on smartwatches: an evaluation of methods for composing the Braille cell.\n \n \n \n \n\n\n \n Luna, M. M.; de Melo Nunes Soares, F. A. A.; Nascimento, H. A. D.; and Quigley, A.\n\n\n \n\n\n\n In Proceedings of the ACM SIGCHI Symposium on Engineering Interactive Computing Systems, EICS 2019, Valencia, Spain, June 18-21, 2019, pages 19:1–19:6, New York, NY, USA, 2019. ACM\n \n\n\n\n
\n\n\n\n \n \n \"BraillePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/eics/LunaSNQ19,\n  author    = {Mateus Machado Luna and Fabr{\\'{\\i}}zzio Alphonsus Alves de Melo Nunes Soares and Hugo A. D. Nascimento and Aaron Quigley},\n  title     = {Braille text entry on smartwatches: an evaluation of methods for composing the Braille cell},\n  booktitle = {Proceedings of the {ACM} {SIGCHI} Symposium on Engineering Interactive Computing Systems, {EICS} 2019, Valencia, Spain, June 18-21, 2019},\n  year      = {2019},\n  pages     = {19:1--19:6},\n  address   = {New York, NY, USA},\n  publisher = {ACM},\n  abstract  = {Smartwatches are gaining popularity on market with a set of features comparable to smartphones in a wearable device. This novice technology brings new interaction paradigms and challenges for blind users, who have difficulties dealing with touchscreens. Among a variety of tasks that must be studied, text entry is analyzed, considering that current existing solutions may be unsatisfactory (as voice input) or even unfeasible (as working with tiny QWERTY keyboards) for a blind user. More specifically, this paper presents a study on possible solutions for composing a Braille cell on smart-watches. Five prototypes were developed and different feedback features were proposed. These are confronted with seven specialists on an evaluation study that results in a qualitative analysis of which strategies can be more useful for blind users in a Braille text entry.},\n  acmid     = {3328233},\n  articleno = {19},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  biburl    = {https://dblp.org/rec/bib/conf/eics/LunaSNQ19},\n  crossref  = {DBLP:conf/eics/2019},\n  doi       = {10.1145/3319499.3328233},\n  isbn      = {978-1-4503-6745-5},\n  keywords  = {Braille, blind people, smartwatches, text entry, text input},\n  location  = {Valencia, Spain},\n  numpages  = {6},\n  timestamp = {Fri, 31 May 2019 08:40:31 +0200},\n  url       = {https://doi.org/10.1145/3319499.3328233},\n}\n\n
\n
\n\n\n
\n Smartwatches are gaining popularity on market with a set of features comparable to smartphones in a wearable device. This novice technology brings new interaction paradigms and challenges for blind users, who have difficulties dealing with touchscreens. Among a variety of tasks that must be studied, text entry is analyzed, considering that current existing solutions may be unsatisfactory (as voice input) or even unfeasible (as working with tiny QWERTY keyboards) for a blind user. More specifically, this paper presents a study on possible solutions for composing a Braille cell on smart-watches. Five prototypes were developed and different feedback features were proposed. These are confronted with seven specialists on an evaluation study that results in a qualitative analysis of which strategies can be more useful for blind users in a Braille text entry.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Information Visualization for Highlighting Conflicts in Educational Timetabling Problems.\n \n \n \n \n\n\n \n de Souza Alencar, W.; do Nascimento, H. A. D.; Jradi, W. A. R.; Soares, F. A. A. M. N.; and Felix, J. P.\n\n\n \n\n\n\n In Bebis, G.; Boyle, R.; Parvin, B.; Koracin, D.; Ushizima, D.; Chai, S.; Sueda, S.; Lin, X.; Lu, A.; Thalmann, D.; Wang, C.; and Xu, P., editor(s), Advances in Visual Computing. ISVC 2019. Lecture Notes in Computer Science, vol 11844, volume 11844, pages 275–288, Cham, 2019. Springer International Publishing\n \n\n\n\n
\n\n\n\n \n \n \"InformationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{deSouzaAlencar2019,\n  author    = {Wanderley de Souza Alencar and Hugo Alexandre Dantas do Nascimento and Walid Abdala Rfaei Jradi and Fabrizzio Alphonsus A. M. N. Soares and Juliana Paula Felix},\n  title     = {Information Visualization for Highlighting Conflicts in Educational Timetabling Problems},\n  booktitle = {Advances in Visual Computing. ISVC 2019. Lecture Notes in Computer Science, vol 11844},\n  year      = {2019},\n  editor    = {Bebis, George and Boyle, Richard and Parvin, Bahram and Koracin, Darko and Ushizima, Daniela and Chai, Sek and Sueda, Shinjiro and Lin, Xin and Lu, Aidong and Thalmann, Daniel and Wang, Chaoli and Xu, Panpan},\n  volume    = {11844},\n  pages     = {275--288},\n  address   = {Cham},\n  publisher = {Springer International Publishing},\n  abstract  = {Scheduling is a very important problem in many organizations, such as hospitals, transportation companies, sports confederations and educational institutions. Obtaining a good schedule results in the maximization of some desired benefit. In particular, in educational institutions (from elementary school to universities) this problem is periodically experienced, either during the preparation of class-teacher or examination timetabling. When a solution proposal is being elaborated (manual, semi-automatic or automatic processes), it is common the occurrence of the phenomenon called conflict, clash or collision. It is characterized by the simultaneous use of a resource (human or material) that can not be shared and, therefore, its occurrence makes that proposal impracticable for adoption. In semi-automatic systems, it is common the identification of such problems and, through user interaction, its resolution. Automatic systems, on the other hand, try to identify/solve conflicts without user intervention. Despite this, conflicts are not easy to resolve. This article proposes the use of information visualization techniques as an approach to highlight the occurrence of conflicts and, using user hints, contribute to its resolution, aiming at obtaining better quality timetables for practical adoption. The proposed visualizations were evaluated in order to determine its expressiveness and effectiveness, considering four aspects: coverage of the research questions, efficiency of the adopted visual mapping, supported level of human interaction and scalability. A conceptual qualitative study showed that the use of these techniques can aim users, mainly non-specialized, to identify conflicts and improve the desired educational timetables.},\n  doi       = {10.1007/978-3-030-33720-9_21},\n  isbn      = {978-3-030-33720-9},\n  keywords  = {Timetabling Problem,Scheduling Problem, Educational, Conflict, Clash, Collision, Violation, Information Visualization, User Hints, User-driven, Interactive application},\n  url       = {https://doi.org/10.1007/978-3-030-33720-9_21},\n}\n\n
\n
\n\n\n
\n Scheduling is a very important problem in many organizations, such as hospitals, transportation companies, sports confederations and educational institutions. Obtaining a good schedule results in the maximization of some desired benefit. In particular, in educational institutions (from elementary school to universities) this problem is periodically experienced, either during the preparation of class-teacher or examination timetabling. When a solution proposal is being elaborated (manual, semi-automatic or automatic processes), it is common the occurrence of the phenomenon called conflict, clash or collision. It is characterized by the simultaneous use of a resource (human or material) that can not be shared and, therefore, its occurrence makes that proposal impracticable for adoption. In semi-automatic systems, it is common the identification of such problems and, through user interaction, its resolution. Automatic systems, on the other hand, try to identify/solve conflicts without user intervention. Despite this, conflicts are not easy to resolve. This article proposes the use of information visualization techniques as an approach to highlight the occurrence of conflicts and, using user hints, contribute to its resolution, aiming at obtaining better quality timetables for practical adoption. The proposed visualizations were evaluated in order to determine its expressiveness and effectiveness, considering four aspects: coverage of the research questions, efficiency of the adopted visual mapping, supported level of human interaction and scalability. A conceptual qualitative study showed that the use of these techniques can aim users, mainly non-specialized, to identify conflicts and improve the desired educational timetables.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Visualization Methods for Educational Timetabling Problems: A Systematic Review of Literature.\n \n \n \n \n\n\n \n Alencar, W. S.; do Nascimento, H. D.; de M. Nunes Soares., F. A. A.; and Longo., H. J.\n\n\n \n\n\n\n February 2019.\n Prague, Czech Republic, February 25-27\n\n\n\n
\n\n\n\n \n \n \"VisualizationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Conference{ivapp19,\n  author       = {Alencar, Wanderley S. and do Nascimento, Hugo D. and Fabrizzio Alphonsus A. de M. Nunes Soares. and Humberto J. Longo.},\n  title        = {Visualization Methods for Educational Timetabling Problems: A Systematic Review of Literature},\n  booktitle    = {Proceedings of the 14th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, {VISIGRAPP}, Volume 3: IVAPP},\n  year         = {2019},\n  pages        = {275-281},\n  month        = {February},\n  organization = {INSTICC},\n  publisher    = {SciTePress},\n  note         = {Prague, Czech Republic, February 25-27},\n  abstract     = {This paper investigates, through a Systematic Review of the Literature (SRL), the application of advanced Information Visualization (IV) methods to the Educational Timetabling Problem (Ed-TTP). The aim is to show how IV can facilitate the human perception of the several elements embedded in a school or university timetable scheduling. We also investigates how interactive IVs have been proposed to help creating/improving timetabling solutions, particularly when time conflict is a major challenging to be solved. In this SRL we considered publications from the last twenty years (1998–2018) indexed by seven solid scientific databases. The review clearly identified that there is a small amount of studies devoted to the intersection between IV and Ed-TTP in that period. Ideas for future research in this intersection field are discussed.},\n  doi          = {10.5220/0007375802750281},\n  isbn         = {978-989-758-354-4},\n  keywords     = {Timetabling, Visualization, Educational, Systematic Review of the Literature, Scheduling, Interactive, NP-hard problem},\n  url          = {https://www.scitepress.org/PublicationsDetail.aspx?ID=V55NHFMFre8%3d&t=1},\n}\n\n
\n
\n\n\n
\n This paper investigates, through a Systematic Review of the Literature (SRL), the application of advanced Information Visualization (IV) methods to the Educational Timetabling Problem (Ed-TTP). The aim is to show how IV can facilitate the human perception of the several elements embedded in a school or university timetable scheduling. We also investigates how interactive IVs have been proposed to help creating/improving timetabling solutions, particularly when time conflict is a major challenging to be solved. In this SRL we considered publications from the last twenty years (1998–2018) indexed by seven solid scientific databases. The review clearly identified that there is a small amount of studies devoted to the intersection between IV and Ed-TTP in that period. Ideas for future research in this intersection field are discussed.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Uma Revisão dos Estudos de Detecção e Reconhecimento de Sinais Cerebrais para Interação Humano-Computador com Equipamentos de Baixo Custo.\n \n \n \n \n\n\n \n Alves, J. B. F.; do Nascimento, H. A. D.; and Silva, M. B.\n\n\n \n\n\n\n In Anais do VI Simpósio Internacional de Inovação em Mídias Interativas, pages 369–381, Buenos Aires, Argentina, Maio 2019. UBA \\and UFG\n 7-9/05/2019\n\n\n\n
\n\n\n\n \n \n \"UmaPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{abs-bci-2019,\n  author       = {João Bosco Ferreira Alves and Hugo A. D. do Nascimento and Murilo Borges Silva},\n  title        = {Uma Revisão dos Estudos de Detecção e Reconhecimento de Sinais Cerebrais para Interação Humano-Computador com Equipamentos de Baixo Custo},\n  booktitle    = {Anais do VI Simpósio Internacional de Inovação em Mídias Interativas},\n  year         = {2019},\n  pages        = {369--381},\n  address      = {Buenos Aires, Argentina},\n  month        = {Maio},\n  organization = {UBA \\and UFG},\n  note         = {7-9/05/2019},\n  abstract     = {Equipamentos detectores de atividades elétricas cerebrais de custo relativamente baixo e voltados para a implementação de novas interfaces homem-máquina têm se popularizado nos últimos dez anos. Entre eles, destacam-se alguns dispositivos proprietários como o Epoc da marca Emotiv e o Muse, além de plataformas abertas como o OpenBCI. O presente trabalho faz uma revisão da literatura sobre o emprego desses equipamentos. São apresentados o estado da arte da pesquisa científica envolvendo tais sensores, ferramentas computacionais para coletar e analisar dados advindos de ondas cerebrais e aplicações que utilizam esses dados em sistemas interativos com o usuário. O objetivo do artigo é reunir um corpo de informações e de orientações que facilite o desenvolvimento de novos projetos de arte tecnológica interativa baseados nessa tecnologia.},\n  issn         = {2358-0488},\n  keywords     = {eletroencefalograma, interação humano-computador, revisão da literatura},\n  owner        = {hugo},\n  timestamp    = {2019.06.23},\n  url          = {https://siimi.medialab.ufg.br/p/29801-anais-2019},\n}\n\n
\n
\n\n\n
\n Equipamentos detectores de atividades elétricas cerebrais de custo relativamente baixo e voltados para a implementação de novas interfaces homem-máquina têm se popularizado nos últimos dez anos. Entre eles, destacam-se alguns dispositivos proprietários como o Epoc da marca Emotiv e o Muse, além de plataformas abertas como o OpenBCI. O presente trabalho faz uma revisão da literatura sobre o emprego desses equipamentos. São apresentados o estado da arte da pesquisa científica envolvendo tais sensores, ferramentas computacionais para coletar e analisar dados advindos de ondas cerebrais e aplicações que utilizam esses dados em sistemas interativos com o usuário. O objetivo do artigo é reunir um corpo de informações e de orientações que facilite o desenvolvimento de novos projetos de arte tecnológica interativa baseados nessa tecnologia.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Estudo da Entrada e da Visualização de Dados em Sistemas de Modelagem e Simulação do Tráfego Urbano.\n \n \n \n \n\n\n \n Corrêa, A. P.; and do Nascimento, H. A. D.\n\n\n \n\n\n\n In (org), C. M., editor(s), Caderno de Resumo Mobilidade Urbana e Trânsito MUT / Cidades para pessoas, Seminário de Saúde Pública e Trânsito, volume Vol. 3, pages 97, Campus Anápolis: UEG, Goiás, September 2019. Universidade Estadual de Goiás (UEG)\n Evento realizado em Goiânia, GO, em 19/09/2019. ISSN: 2594-6226\n\n\n\n
\n\n\n\n \n \n \"EstudoPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{cn-trafficgui-19,\n  author    = {Andr\\'{e} Pires Corr\\^{e}a and Hugo Alexandre Dantas do Nascimento},\n  title     = {Estudo da Entrada e da Visualização de Dados em Sistemas de Modelagem e Simulação do Tráfego Urbano},\n  booktitle = {Caderno de Resumo Mobilidade Urbana e Tr\\^{a}nsito {MUT} / Cidades para pessoas, Semin\\'{a}rio de Sa\\'{u}de P\\'{u}blica e Tr\\^{a}nsito},\n  year      = {2019},\n  editor    = {Camila Mota (org)},\n  volume    = {Vol. 3},\n  pages     = {97},\n  address   = {Campus An\\'{a}polis: UEG, Goiás},\n  month     = sep,\n  publisher = {Universidade Estadual de Goiás (UEG)},\n  note      = {Evento realizado em Goiânia, GO, em 19/09/2019. ISSN: 2594-6226},\n  abstract  = {O estudo dos problemas do tráfego urbano depende essencialmente do apoio de ferramentas computacionais, dada a elevada quantidade de dados e a complexidade em se realizar modelagem e simulação de deslocamento de veículos e de pessoas considerando malhas viárias reais. Entre as ferramentas que têm sido propostas para esse fim, destacam-se alguns sistemas computacionais que foram melhorados significativamente nos últimos anos e que são hoje de uso frequente em empresas de engenharia de transportes e em setores públicos responsáveis pelo gerenciamento do trânsito nas cidades, como o TransCAD, o VISUM/VISSIM e o SUMO. Cada um desses sistemas, no entanto, adota suas próprias formas de entrada de dados e de apresentação das informações relacionadas à malha viária e à simulação do tráfego. O presente trabalho tem por objetivo avaliar os mecanismos interativos de modelagem e de simulação do tráfego urbano presentes nos sistemas computacionais de modelagem e simulação do trânsito mais populares, como aqueles supracitados, no intuito de identificar formas de interação e de visualização que sejam eficazes e eficientes e ajudar no desenvolvimento de novos sistemas nessa área. A metodologia utilizada na pesquisa consiste na análise e na comparação das interfaces gráficas de tais sistemas, focando em algumas atividades interativas como cadastrar e editar malhas viárias, conversões permitidas/proibidas, tempos de semáforo e matrizes OD, e apresentar e permitir explorar dados de fluxos de veículo simulados. Os mecanismos interativos adotados pelas interfaces estão sendo comparados quanto ao esforço físico demandado para utilizá-los (como, por exemplo, a quantidade exigida de clicks e de movimentos de mouse), o esforço cognitivo necessário para o aprendizado de uso das interfaces e o nível de preservação do mapa mental do usuário durante a execução das operações interativas. Um quadro comparativo das diversas formas de interação e de visualização adotadas pelos principais sistemas será apresentado. Espera-se também, como base nas limitações percebidas nos sistemas atuais, identificar possibilidades de construção de novas propostas de interação humano-computador para os elementos estudados.},\n  issn      = {2594-6226},\n  keywords  = {Tráfego Urbano, Modelagem, Sistemas Computacionais, Interfaces Gráficas, Estudo Comparativo},\n  url       = {https://doity.com.br/v-forum-goiano-de-mobilidade-urbana-e-transito-20190408151511/},\n}\n\n
\n
\n\n\n
\n O estudo dos problemas do tráfego urbano depende essencialmente do apoio de ferramentas computacionais, dada a elevada quantidade de dados e a complexidade em se realizar modelagem e simulação de deslocamento de veículos e de pessoas considerando malhas viárias reais. Entre as ferramentas que têm sido propostas para esse fim, destacam-se alguns sistemas computacionais que foram melhorados significativamente nos últimos anos e que são hoje de uso frequente em empresas de engenharia de transportes e em setores públicos responsáveis pelo gerenciamento do trânsito nas cidades, como o TransCAD, o VISUM/VISSIM e o SUMO. Cada um desses sistemas, no entanto, adota suas próprias formas de entrada de dados e de apresentação das informações relacionadas à malha viária e à simulação do tráfego. O presente trabalho tem por objetivo avaliar os mecanismos interativos de modelagem e de simulação do tráfego urbano presentes nos sistemas computacionais de modelagem e simulação do trânsito mais populares, como aqueles supracitados, no intuito de identificar formas de interação e de visualização que sejam eficazes e eficientes e ajudar no desenvolvimento de novos sistemas nessa área. A metodologia utilizada na pesquisa consiste na análise e na comparação das interfaces gráficas de tais sistemas, focando em algumas atividades interativas como cadastrar e editar malhas viárias, conversões permitidas/proibidas, tempos de semáforo e matrizes OD, e apresentar e permitir explorar dados de fluxos de veículo simulados. Os mecanismos interativos adotados pelas interfaces estão sendo comparados quanto ao esforço físico demandado para utilizá-los (como, por exemplo, a quantidade exigida de clicks e de movimentos de mouse), o esforço cognitivo necessário para o aprendizado de uso das interfaces e o nível de preservação do mapa mental do usuário durante a execução das operações interativas. Um quadro comparativo das diversas formas de interação e de visualização adotadas pelos principais sistemas será apresentado. Espera-se também, como base nas limitações percebidas nos sistemas atuais, identificar possibilidades de construção de novas propostas de interação humano-computador para os elementos estudados.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Otimização interativa de problemas de quadro de horário escolar sujeito a restrições.\n \n \n \n \n\n\n \n de Oliveira, F. S.\n\n\n \n\n\n\n Master's thesis, Instituto de Informática, Universidade Federal de Goiás, December 2019.\n \n\n\n\n
\n\n\n\n \n \n \"OtimizaçãoPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@MastersThesis{fso-qhorario-2019,\n  author    = {Fabio Santana de Oliveira},\n  title     = {Otimização interativa de problemas de quadro de horário escolar sujeito a restrições},\n  school    = {Instituto de Informática, Universidade Federal de Goiás},\n  year      = {2019},\n  type      = {mathesis},\n  month     = dec,\n  abstract  = {A definição de um quadro de horário de aulas é uma tarefa frequente e árdua nas instituições de ensino, como em universidade e em escolas, mas que pode ser apoiada por processos interativos. Entretanto, há uma carência de métodos altamente interativos que ajudem na especificação das características desse tipo de problema e na busca por uma solução de qualidade. No presente trabalho, apresentamos uma abordagem de otimização interativa  baseada  em dicas  do  usuário (no framework  User  Hints)  para  facilitar a construção de quadros de horário nas escolas. Uma avaliação envolvendo escolas públicas de ensino fundamental e médio demonstra que a abordagem interativa contribui de forma eficaz para encontrar uma solução que seja adequada às necessidades da instituição.},\n  comment   = {88 páginas},\n  keywords  = {Problema de definição de quadro de horário de aulas interativo, dicas do usuário},\n  owner     = {hugo},\n  timestamp = {2020.01.10},\n  url       = {https://repositorio.bc.ufg.br/tede/handle/tede/10309},\n}\n\n
\n
\n\n\n
\n A definição de um quadro de horário de aulas é uma tarefa frequente e árdua nas instituições de ensino, como em universidade e em escolas, mas que pode ser apoiada por processos interativos. Entretanto, há uma carência de métodos altamente interativos que ajudem na especificação das características desse tipo de problema e na busca por uma solução de qualidade. No presente trabalho, apresentamos uma abordagem de otimização interativa baseada em dicas do usuário (no framework User Hints) para facilitar a construção de quadros de horário nas escolas. Uma avaliação envolvendo escolas públicas de ensino fundamental e médio demonstra que a abordagem interativa contribui de forma eficaz para encontrar uma solução que seja adequada às necessidades da instituição.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Using Social Information to Compose a Similarity Function Based on Friends Attendance at Events.\n \n \n \n \n\n\n \n Pascoal, L. M. L.; do Nascimento, H. A. D.; Junior, C. G. C.; Silva, E. Q. D.; Aleixo, E. L.; and Rosa, T. C.\n\n\n \n\n\n\n In 2018 IEEE Congress on Evolutionary Computation (CEC), pages 1-8, Rio de Janeiro, RJ, Brasil, July 2018. IEEE\n July 8-13, 2018\n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{8477864,\n  author    = {Luiz Mario Lustosa Pascoal and Hugo Alexandre Dantas do Nascimento and Celso G. Camilo Junior and Edialma Queiroz Da Silva and Everton Lima Aleixo and Thierson Couto Rosa},\n  title     = {Using Social Information to Compose a Similarity Function Based on Friends Attendance at Events},\n  booktitle = {2018 IEEE Congress on Evolutionary Computation (CEC)},\n  year      = {2018},\n  pages     = {1-8},\n  address   = {Rio de Janeiro, RJ, Brasil},\n  month     = {July},\n  publisher = {{IEEE}},\n  note      = {July 8-13, 2018},\n  abstract  = {The analysis of affinity or similarity between people is an important task in the study of social dynamics. Traditional methods for determining similarity depends on considerable amount of data regarding people's preferences and features. Those methods present limitations when the data is scarce and/or changes constantly. This paper introduces a new method for determining people similarity that does not suffer from the same problems. The method can learn a customized similarity function based on social variables of friends that attend the same events (concerts, parties, conferences etc), collected from social networks. Two types of optimization algorithms for learning a similarity function are presented: The universal function approximator modelling, which relays on the relationship of social attributes and a friends' importance ranking; and the populational evolutionary modelling, which linearly combines social variables. Both models were tested in a generalist and in a specialist approach. The results show that the specialist approach exceeded in almost 38 % the generalist approach using populational evolutionary methods and in almost 69 % when using the universal function approximator methods. Among the implemented optimization algorithms employed inside the methods for learning similarity, Genetic Algorithm and Particle Swarm Optimization presented better performance for the populational evolutionary methods and the Artificial Neural Network presented the best performance overall using the universal function approximator modelling.},\n  doi       = {10.1109/CEC.2018.8477864},\n  keywords  = {function approximation;genetic algorithms;learning (artificial intelligence);neural nets;particle swarm optimisation;social networking (online);social networks;universal function approximator modelling;social attributes;populational evolutionary modelling;social variables;universal function approximator methods;social information;social dynamics;people similarity;customized similarity function;evolutionary methods;optimization algorithms;friends attendance;particle swarm optimization;Genetic Algorithm;similarity function learning;artificial neural network;Optimization;Facebook;Approximation algorithms;Heuristic algorithms;Genetic algorithms;Scholarships;Social Dynamics;Similarity Function;Optimization Algorithms;Social Events},\n  url       = {https://doi.org/10.1109/cec.2018.8477864},\n}\n\n\n
\n
\n\n\n
\n The analysis of affinity or similarity between people is an important task in the study of social dynamics. Traditional methods for determining similarity depends on considerable amount of data regarding people's preferences and features. Those methods present limitations when the data is scarce and/or changes constantly. This paper introduces a new method for determining people similarity that does not suffer from the same problems. The method can learn a customized similarity function based on social variables of friends that attend the same events (concerts, parties, conferences etc), collected from social networks. Two types of optimization algorithms for learning a similarity function are presented: The universal function approximator modelling, which relays on the relationship of social attributes and a friends' importance ranking; and the populational evolutionary modelling, which linearly combines social variables. Both models were tested in a generalist and in a specialist approach. The results show that the specialist approach exceeded in almost 38 % the generalist approach using populational evolutionary methods and in almost 69 % when using the universal function approximator methods. Among the implemented optimization algorithms employed inside the methods for learning similarity, Genetic Algorithm and Particle Swarm Optimization presented better performance for the populational evolutionary methods and the Artificial Neural Network presented the best performance overall using the universal function approximator modelling.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Fast and Generic GPU-Based Parallel Reduction Implementation.\n \n \n \n\n\n \n Jradi, W. A. R.; Nascimento, H.; and Martins, W. S.\n\n\n \n\n\n\n In 2018 Symposium on High Performance Computing Systems (WSCAD), pages 16-22, Oct 2018. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{8748915,\n  author    = {W. A. R. {Jradi} and H. {Nascimento} and W. S. {Martins}},\n  title     = {A Fast and Generic GPU-Based Parallel Reduction Implementation},\n  booktitle = {2018 Symposium on High Performance Computing Systems (WSCAD)},\n  year      = {2018},\n  pages     = {16-22},\n  month     = {Oct},\n  doi       = {10.1109/WSCAD.2018.00013},\n  keywords  = {graphics processing units;multiprocessing systems;parallel architectures;parallel processing;persistent threads;reduction operations;parallel reduction;GPU-based parallel approach;AMD hardware platform;NVidia hardware platform;OpenCL;CUDA;Graphics processing units;Indexes;Synchronization;Hardware;Bandwidth;Proposals;Instruction sets;GPU, Parallel Reduction, Fast, Generic},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Evolutionary Algorithm for an Optimization Model of Edge Bundling.\n \n \n \n \n\n\n \n de M. Ferreira, J.; do Nascimento, H. A. D.; and Foulds, L.\n\n\n \n\n\n\n In Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: the 9th International Conference on Information Visualization Theory and Applications (IVAPP), pages 132-143, Funchal, Madeira, Portugal, January 2018. INSTICC, SCITEPRESS Digital Library\n 27 - 29, Jan, 2018\n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{fnf-aeafomeb-18,\n  author       = {Joelma de M. Ferreira and Hugo A. D. do Nascimento and Les Foulds},\n  title        = {An Evolutionary Algorithm for an Optimization Model of Edge Bundling},\n  booktitle    = {Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: the 9th International Conference on Information Visualization Theory and Applications (IVAPP)},\n  year         = {2018},\n  pages        = {132-143},\n  address      = {Funchal, Madeira, Portugal},\n  month        = jan,\n  organization = {INSTICC},\n  publisher    = {SCITEPRESS Digital Library},\n  note         = {27 - 29, Jan, 2018},\n  abstract     = {This paper presents two edge bundling optimization problems that address minimizing the total number of bundles, in conjunction with other aspects, as the main goal. A novel evolutionary edge bundling algorithm for these problems is described. The algorithm was successfully tested by solving two related problems applied to real-world instances in reasonable computational time. The development and analysis of optimization models have received little attention in the area of edge bundling. However, the reported experimental results demonstrate the effectiveness and the applicability of the proposed evolutionary algorithm to help resolve edge bundling problems formally defined as optimization models.},\n  doi          = {10.5220/0006626901320143},\n  isbn         = {978-989-758-289-9},\n  keywords     = {Edge Bundling, Optimization, Evolutionary, Approximate, Algorithm},\n  owner        = {hugo},\n  timestamp    = {2017.12.05},\n  url          = {http://www.scitepress.org/PublicationsDetail.aspx?ID=skM/hZCzoWQ=&t=1},\n}\n\n
\n
\n\n\n
\n This paper presents two edge bundling optimization problems that address minimizing the total number of bundles, in conjunction with other aspects, as the main goal. A novel evolutionary edge bundling algorithm for these problems is described. The algorithm was successfully tested by solving two related problems applied to real-world instances in reasonable computational time. The development and analysis of optimization models have received little attention in the area of edge bundling. However, the reported experimental results demonstrate the effectiveness and the applicability of the proposed evolutionary algorithm to help resolve edge bundling problems formally defined as optimization models.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Evolutionary Algorithm for an Optimization Model of Edge Bundling.\n \n \n \n \n\n\n \n Ferreira, J. d. M.; do Nascimento, H. A. D.; and Foulds, L. R.\n\n\n \n\n\n\n Information, 9(7). 2018.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{info9070154,\n  author        = {Ferreira, Joelma de M. and do Nascimento, Hugo A. D. and Foulds, Les R.},\n  title         = {An Evolutionary Algorithm for an Optimization Model of Edge Bundling},\n  journal       = {Information},\n  year          = {2018},\n  volume        = {9},\n  number        = {7},\n  issn          = {2078-2489},\n  abstract      = {This paper discusses three edge bundling optimization problems that aim to minimize the total number of bundles of a graph drawing, in conjunction with other aspects, as the main goal. A novel evolutionary algorithm for edge bundling for these problems is described. The algorithm was successfully tested by solving the related problems applied to real-world instances in reasonable computational time. The development and analysis of optimization models have received little attention in the area of edge bundling. However, the reported experimental results demonstrate the effectiveness and the applicability of the proposed evolutionary algorithm to help resolve edge bundling problems by formally defining them as optimization models.},\n  articlenumber = {154},\n  doi           = {10.3390/info9070154},\n  url           = {http://www.mdpi.com/2078-2489/9/7/154},\n}\n\n
\n
\n\n\n
\n This paper discusses three edge bundling optimization problems that aim to minimize the total number of bundles of a graph drawing, in conjunction with other aspects, as the main goal. A novel evolutionary algorithm for edge bundling for these problems is described. The algorithm was successfully tested by solving the related problems applied to real-world instances in reasonable computational time. The development and analysis of optimization models have received little attention in the area of edge bundling. However, the reported experimental results demonstrate the effectiveness and the applicability of the proposed evolutionary algorithm to help resolve edge bundling problems by formally defining them as optimization models.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Utilização de Metaheurísticas na Resolução do Problema de Agendamento de Horários de Aulas numa Escola de Ensino Fundamental.\n \n \n \n \n\n\n \n de Oliveira, F. S.; de Souza Alencar, W.; and do Nascimento, H. A. D.\n\n\n \n\n\n\n In Anais da VI Escola Regional de Informática de Goiás, pages 131–144, Goiânia, GO, Brasil, September 2018. \n ISSN 2359-0386, 14 e 15 de Setembro de 2018\n\n\n\n
\n\n\n\n \n \n \"UtilizaçãoPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{umrpahaeef-2018,\n  author    = {Fábio Santanta de Oliveira and Wanderley de Souza Alencar and Hugo Alexandre Dantas do Nascimento},\n  title     = {Utiliza\\c{c}\\~{a}o de Metaheur\\'{i}sticas na Resolu\\c{c}\\~{a}o do Problema de Agendamento de Hor\\'{a}rios de Aulas numa Escola de Ensino Fundamental},\n  booktitle = {Anais da {VI} Escola Regional de Inform\\'{a}tica de Goi\\'{a}s},\n  year      = {2018},\n  pages     = {131--144},\n  address   = {Goi\\^{a}nia, GO, Brasil},\n  month     = sep,\n  note      = {ISSN 2359-0386, 14 e 15 de Setembro de 2018},\n  abstract  = {This article reports the use of metaheuristic techniques for the resolution of the so-called Teacher-Classroom Timetabling Problem, one of subcategories of the Educational Timetabling Problem. The three metaheuristic techniques employed are: In Vitro Fertilization Genetic Algorithm, Tabu Search and Greedy Ramdomized Adaptive Search Procedure. The experimentation was carried out with one real instance of the problem coming from a Brazilian school dedicated to elementary education and, in addition, with instances from widely known datasets. It turns out that the methods are able to produce solutions suitable for practical use in their contexts, being that method In Vitro has overcome the others for the established optimization goal.},\n  issn      = {2359-0386},\n  owner     = {hugo},\n  timestamp = {2018.11.05},\n  url       = {http://erigo.sbc.org.br/up/4/o/anais-v-erigo-2018.pdf},\n}\n\n
\n
\n\n\n
\n This article reports the use of metaheuristic techniques for the resolution of the so-called Teacher-Classroom Timetabling Problem, one of subcategories of the Educational Timetabling Problem. The three metaheuristic techniques employed are: In Vitro Fertilization Genetic Algorithm, Tabu Search and Greedy Ramdomized Adaptive Search Procedure. The experimentation was carried out with one real instance of the problem coming from a Brazilian school dedicated to elementary education and, in addition, with instances from widely known datasets. It turns out that the methods are able to produce solutions suitable for practical use in their contexts, being that method In Vitro has overcome the others for the established optimization goal.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n PetGyn – Sistema de Planejamento de Tráfego Urbano.\n \n \n \n \n\n\n \n de Souza Alencar, W.; do Nascimento, H. A. D.; and Hall, B. R.\n\n\n \n\n\n\n In Carderno de Resumos do 5o Fórum Goiano de Mobilidade Urbana e Trânsito, pages 88, Goiânia, Goiás, September 2018. Universidade Estadual de Goiás (UEG)\n 13/09/2018\n\n\n\n
\n\n\n\n \n \n \"PetGynPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{an-petgyn-18,\n  author    = {Wanderley de Souza Alencar and Hugo Alexandre Dantas do Nascimento and Bryon Richard Hall},\n  title     = {PetGyn -- Sistema de Planejamento de Tráfego Urbano},\n  booktitle = {Carderno de Resumos do 5o F\\'{o}rum Goiano de Mobilidade Urbana e Tr\\^{a}nsito},\n  year      = {2018},\n  pages     = {88},\n  address   = {Goiânia, Goiás},\n  month     = sep,\n  publisher = {Universidade Estadual de Goiás (UEG)},\n  note      = {13/09/2018},\n  keywords  = {Tráfego Urbano, Simulação, Web Services},\n  owner     = {hugo},\n  timestamp = {2018.11.05},\n  url       = {https://doity.com.br/v-forum-goiano-de-mobilidade-urbana-e-transito},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Visualização de Informações no cenário do tráfego urbano.\n \n \n \n\n\n \n Gondim, H. W. A. S.; and do Nascimento, H. A. D.\n\n\n \n\n\n\n In Caderno de Resumos do 5o Fórum Goiano de Mobilidade Urbana e Trânsito, pages 86, Goiânia, Goiás, September 2018. Universidade Estadual de Goiás (UEG)\n Evento realizado no SEST em 13/09/2018, ISSN 2594-6226\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{gn-victu-2018,\n  author    = {Halley Wesley Alexandre S. Gondim and Hugo Alexandre Dantas do Nascimento},\n  title     = {Visualiza\\c{c}\\~{a}o de Informa\\c{c}\\~{o}es no cen\\'{a}rio do tr\\'{a}fego urbano},\n  booktitle = {Caderno de Resumos do 5o F\\'{o}rum Goiano de Mobilidade Urbana e Tr\\^{a}nsito},\n  year      = {2018},\n  pages     = {86},\n  address   = {Goiânia, Goiás},\n  month     = sep,\n  publisher = {Universidade Estadual de Goiás (UEG)},\n  note      = {Evento realizado no SEST em 13/09/2018, ISSN 2594-6226},\n  issn      = {2594-6226},\n  keywords  = {Visualização, Informações, Matriz Origem-Destino, Tráfego},\n  owner     = {hugo},\n  timestamp = {2018.11.05},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Interações virtuais e reais para a criação de códigos de programação para o projeto Cubos $C^{3}$.\n \n \n \n \n\n\n \n do Nascimento, H. A. D.; de Oliveira, V. M.; Iglesias, L. G. P. F.; and Soares, F. A. A. M. N.\n\n\n \n\n\n\n In Anais do V Simpósio Internacional de Inovação em Mídias Interativas, pages 283–293, 2018. ROCHA, Cleomar (Org)\n ISSN 2358-0488, 09 a 11 de maio de 2018\n\n\n\n
\n\n\n\n \n \n \"InteraçõesPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{nois-ivrccppcc3-2018,\n  author       = {Hugo A. D. do Nascimento and Victor Martin de Oliveira and Luca G. P. Flores Iglesias and Fabrízzio A. A. M. Nunes Soares},\n  title        = {Intera\\c{c}\\~{o}es virtuais e reais para a cria\\c{c}\\~{a}o de c\\'{o}digos de programa\\c{c}\\~{a}o para o projeto Cubos $C^{3}$},\n  booktitle    = {Anais do V Simpósio Internacional de Inovação em Mídias Interativas},\n  year         = {2018},\n  pages        = {283--293},\n  organization = {ROCHA, Cleomar (Org)},\n  note         = {ISSN 2358-0488, 09 a 11 de maio de 2018},\n  abstract     = {A possibilidade de integrar ações e objetos virtuais na Internet com interações e objetos similares no mundo físico pode levar artistas a criar formas mais dinâmicas e envolventes de arte tecnológica. No presente artigo, explorarmos este conceito com a finalidade de usar e ampliar um projeto artístico baseado em cubos interativos desenvolvido pelo Media Lab / UFG, chamado de Cubos C³. Este novo trabalho consiste de dois ambientes conectados para gerar e experimentar novos códigos de programação para os cubos. O primeiro é um sistema de realidade virtual na Web, em que o participantes podem experimentar e avaliar versões virtuais dos cubos, com códigos que mudam por meio de um processo de computação evolucionária. O segundo ambiente consiste de uma instalação física na qual pessoas podem experimentar os cubos reais, atualizados automaticamente com os melhores códigos gerados previamente pelo sistema na Web. Os usuários não escrevem códigos para os cubos, de forma explícita, os códigos são modificados pelo processo de computação evolucionária usando os resultados das avaliações humanas. Este trabalho apresenta uma exploração do potencial de guiar um sistema evolutivo interativo para a criação de novos comportamentos para objetos reais, ao mesmo tempo em que procura estabelecer uma relação mais imediata entre o que é produzido em um ambiente virtual e o que pode ser experimentando em um espaço físico real.},\n  issn         = {2358-0488},\n  keywords     = {Cubos interativos, computação evolucionária, ambiente virtual, instalação física},\n  owner        = {hugo},\n  timestamp    = {2018.11.05},\n  url          = {https://siimi.medialab.ufg.br/p/25047-anais-2018},\n}\n\n
\n
\n\n\n
\n A possibilidade de integrar ações e objetos virtuais na Internet com interações e objetos similares no mundo físico pode levar artistas a criar formas mais dinâmicas e envolventes de arte tecnológica. No presente artigo, explorarmos este conceito com a finalidade de usar e ampliar um projeto artístico baseado em cubos interativos desenvolvido pelo Media Lab / UFG, chamado de Cubos C³. Este novo trabalho consiste de dois ambientes conectados para gerar e experimentar novos códigos de programação para os cubos. O primeiro é um sistema de realidade virtual na Web, em que o participantes podem experimentar e avaliar versões virtuais dos cubos, com códigos que mudam por meio de um processo de computação evolucionária. O segundo ambiente consiste de uma instalação física na qual pessoas podem experimentar os cubos reais, atualizados automaticamente com os melhores códigos gerados previamente pelo sistema na Web. Os usuários não escrevem códigos para os cubos, de forma explícita, os códigos são modificados pelo processo de computação evolucionária usando os resultados das avaliações humanas. Este trabalho apresenta uma exploração do potencial de guiar um sistema evolutivo interativo para a criação de novos comportamentos para objetos reais, ao mesmo tempo em que procura estabelecer uma relação mais imediata entre o que é produzido em um ambiente virtual e o que pode ser experimentando em um espaço físico real.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Fast and Generic GPU-Based Parallel Reduction Implementation.\n \n \n \n \n\n\n \n Jradi, W. A. R.; do Nascimento, H. A. D.; and Martins, W. S.\n\n\n \n\n\n\n In XIX Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD 2018), pages 51–62, São Paulo, SP, Brasil, October 2018. Calebe de Paula Bianchini, Paulo Sérgio Lopes de Souza, Carla Osthoff Ferreira de Barros, Renato Antônio Celso Ferreira, SBC\n ISSN 2358-6613, de 01 a 03 de outubro de 2018\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{jnm-fggpri-2018,\n  author       = {Walid A. R. Jradi and Hugo A. D. do Nascimento and Wellington S. Martins},\n  title        = {A Fast and Generic {GPU}-Based Parallel Reduction Implementation},\n  booktitle    = {XIX Simp\\'{o}sio em Sistemas Computacionais de Alto Desempenho (WSCAD 2018)},\n  year         = {2018},\n  pages        = {51--62},\n  address      = {S\\~{a}o Paulo, SP, Brasil},\n  month        = oct,\n  organization = {Calebe de Paula Bianchini, Paulo Sérgio Lopes de Souza, Carla Osthoff Ferreira de Barros, Renato Antônio Celso Ferreira},\n  publisher    = {SBC},\n  note         = {ISSN 2358-6613, de 01 a 03 de outubro de 2018},\n  abstract     = {Reduction operations are extensively employed in many computational problems, where a finite set of numeric elements are combined into a single value, using for this a combining function. A parallel reduction, in turn, is the operation concurrently performed when multiple execution units are available. The present work depicts a GPU-based parallel approach for it, which employs techniques like loop unrolling, persistent threads and algebraic expressions to avoid thread divergence, and was able to outperform the methods currently in use. Experiments conducted to evaluate the approach show that the strategy performs efficiently on both AMD and NVidia’s hardwares, as well as using OpenCL and CUDA, making it portable.},\n  issn         = {2358-6613},\n  keywords     = {GPU, Parallel reduction},\n  owner        = {hugo},\n  timestamp    = {2018.11.05},\n  url          = {https://portaldeconteudo.sbc.org.br/index.php/wscad/issue/view/259/WSCAD2018},\n}\n\n
\n
\n\n\n
\n Reduction operations are extensively employed in many computational problems, where a finite set of numeric elements are combined into a single value, using for this a combining function. A parallel reduction, in turn, is the operation concurrently performed when multiple execution units are available. The present work depicts a GPU-based parallel approach for it, which employs techniques like loop unrolling, persistent threads and algebraic expressions to avoid thread divergence, and was able to outperform the methods currently in use. Experiments conducted to evaluate the approach show that the strategy performs efficiently on both AMD and NVidia’s hardwares, as well as using OpenCL and CUDA, making it portable.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Evolving Behaviors for an Interactive Cube-based Artifact.\n \n \n \n \n\n\n \n Oliveira, V. M.; do Nascimento, H. A. D.; Soares, F. A. A. M. N.; and Rocha, C. S.\n\n\n \n\n\n\n In Proceedings of The 14th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE'18), pages 81–87, Edmonton, AB, Canada, November 2018. Association for the Advancement of Artificial Intelligence (AAAI)\n Nov/13-17, 2018\n\n\n\n
\n\n\n\n \n \n \"EvolvingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{onsr-ebica-2018,\n  author       = {Victor M. Oliveira and Hugo A. D. do Nascimento and Fabrizzio A. A. M. N. Soares and Cleomar S. Rocha},\n  title        = {Evolving Behaviors for an Interactive Cube-based Artifact},\n  booktitle    = {Proceedings of The 14th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment ({AIIDE'18})},\n  year         = {2018},\n  pages        = {81--87},\n  address      = {Edmonton, AB, Canada},\n  month        = {November},\n  organization = {Association for the Advancement of Artificial Intelligence (AAAI)},\n  note         = {Nov/13-17, 2018},\n  abstract     = {In the present paper we explore the idea of combining computation power and the availability of ordinary art spectators in order to produce new interactive art works. This is investigated for a particular application, which consists of producing new behaviors for a programmable art apparatus named \\emph{$C^3$ Cubes}. Given the nature of the problem and some difficult challenges to be dealt with, an Interactive Evolutionary Computation (IEC) approach was devised. Furthermore, it was necessary to adopt a surrogate function method for approximating the user's preferences and to implement a Web-based virtual simulation environment for speeding up the generation and the evaluation of \\emph{$C^3$ Cubes} projects. The integration of all these elements is crucial for producing new user-guided cube projects with interesting behaviors. The main approaches experimented in this research and the proposed design solutions are useful to solving similar problems in other domain areas, for example, in the context of game design.},\n  keywords     = {Interactive Evolutionary Computation; Interactive Cubes; Surrogate; Evolutionary Algorithm; Tangible Interface},\n  owner        = {hugo},\n  timestamp    = {2018.11.17},\n  url          = {#https://aaai.org/ocs/index.php/AIIDE/AIIDE18/paper/view/18097#},\n}\n\n
\n
\n\n\n
\n In the present paper we explore the idea of combining computation power and the availability of ordinary art spectators in order to produce new interactive art works. This is investigated for a particular application, which consists of producing new behaviors for a programmable art apparatus named \\emph$C^3$ Cubes. Given the nature of the problem and some difficult challenges to be dealt with, an Interactive Evolutionary Computation (IEC) approach was devised. Furthermore, it was necessary to adopt a surrogate function method for approximating the user's preferences and to implement a Web-based virtual simulation environment for speeding up the generation and the evaluation of \\emph$C^3$ Cubes projects. The integration of all these elements is crucial for producing new user-guided cube projects with interesting behaviors. The main approaches experimented in this research and the proposed design solutions are useful to solving similar problems in other domain areas, for example, in the context of game design.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n PetGyn 2.0: A Brazilian Urban Traffic Planning System.\n \n \n \n\n\n \n de Souza Alencar, W.; Jradi, W. A. R.; do Nascimento , H. A. D.; Hall, B. R.; and Longo, H. J.\n\n\n \n\n\n\n In Rossetti, R.; Betis, G.; Cacho, N.; Batista, T.; and Cavalcante, E., editor(s), 2017 IEEE First Summer School on Smart Cities (S3C), pages 7-12, Natal, RN, Brazil, Aug 2017. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{Alencar2017a,\n  author    = {Wanderley de Souza {Alencar} and Walid Abdala R. {Jradi} and Hugo Alexandre D. {do Nascimento} and Bryon Richard {Hall} and Humberto José {Longo}},\n  title     = {PetGyn 2.0: A Brazilian Urban Traffic Planning System},\n  booktitle = {2017 IEEE First Summer School on Smart Cities (S3C)},\n  year      = {2017},\n  editor    = {Rossetti, Rosaldo and Betis, Gilles and Cacho, N{\\'e}lio and Batista, Thais and Cavalcante, Everton},\n  pages     = {7-12},\n  address   = {Natal, RN, Brazil},\n  month     = {Aug},\n  publisher = {IEEE},\n  abstract  = {Urban traffic simulators are valuable tools for prior and low-cost evaluation of modification proposals for road networks, aimed at improving vehicular mobility. The system covered in this article, called PetGyn, falls into this category. It is powerful enough to represent scenarios of changes in the structure of road networks and/or in the behavior of their elements (pathways, traffic lights, possible conversions, etc.) and for predicting road usage levels (volume and traffic speed). In addition, PetGyn's flexibility allows the employment of different traffic allocation models (system optimization, user equilibrium, etc.), various types of cost functions (from the classic BPR - Bureau of Public Roads - arc cost functions to non-separable and asymmetric functions) and the simulation of different behaviors for the road network components (blocking routes according to schedules/days, reversing the direction of traffic flows, allowing/forbidden parking along the lanes, among others). Since its conception, it was built in a modular way so that it can be easily adapted to the urban traffic particularities of any country. Unlike commercial systems in this area, PetGyn was developed under a free software philosophy and as a web-based system in order to favor collaborative work. Its usage allows the study of intervention projects for medium-sized metropolitan regions, contributing to identify possible improvements in urban mobility.},\n  doi       = {10.1109/S3C.2017.8501405},\n  isbn      = {978-1-5386-1063-3},\n  issn      = {null},\n  keywords  = {groupware;Internet;public domain software;road traffic;roads;town and country planning;traffic engineering computing;Brazilian urban traffic planning system;urban traffic simulators;road networks;vehicular mobility;road usage levels;traffic flows;urban mobility;Public Roads;urban traffic;Web-based system;traffic allocation models;PetGyn 2.0;free software;collaborative work;Roads;Urban areas;Mathematical model;Vehicles;Cost function;Proposals;Resource management;Traffic control;modeling;computer simulation;web services;open source software.},\n}\n\n\n
\n
\n\n\n
\n Urban traffic simulators are valuable tools for prior and low-cost evaluation of modification proposals for road networks, aimed at improving vehicular mobility. The system covered in this article, called PetGyn, falls into this category. It is powerful enough to represent scenarios of changes in the structure of road networks and/or in the behavior of their elements (pathways, traffic lights, possible conversions, etc.) and for predicting road usage levels (volume and traffic speed). In addition, PetGyn's flexibility allows the employment of different traffic allocation models (system optimization, user equilibrium, etc.), various types of cost functions (from the classic BPR - Bureau of Public Roads - arc cost functions to non-separable and asymmetric functions) and the simulation of different behaviors for the road network components (blocking routes according to schedules/days, reversing the direction of traffic flows, allowing/forbidden parking along the lanes, among others). Since its conception, it was built in a modular way so that it can be easily adapted to the urban traffic particularities of any country. Unlike commercial systems in this area, PetGyn was developed under a free software philosophy and as a web-based system in order to favor collaborative work. Its usage allows the study of intervention projects for medium-sized metropolitan regions, contributing to identify possible improvements in urban mobility.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computational Complexity of Edge Bundling Problems.\n \n \n \n \n\n\n \n Ferreira, J. M.; Nascimento, H. A. D.; Quigley, A. J.; and Foulds, L. R.\n\n\n \n\n\n\n Technical Report RT-INF_001-17, Instituto de Informática, Universidade Federal de Goiás, 2017.\n Technical report, Federal University of Goiás\n\n\n\n
\n\n\n\n \n \n \"ComputationalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Ferreira:2017,\n  Title                    = {Computational Complexity of Edge Bundling Problems},\n  Author                   = {J. M. Ferreira and H. A. D. Nascimento and A. J. Quigley and L. R. Foulds},\n  Institution              = {Instituto de Inform\\'{a}tica, Universidade Federal de Goi\\'{a}s},\n  Year                     = {2017},\n  Note                     = {Technical report, Federal University of Goi\\'{a}s},\n  Number                   = {RT-INF_001-17},\n\n  HowPublished             = {\\url{http://inf.ufg.br/biblioteca-digital}},\n  Url                      = {http://www.inf.ufg.br/sites/default/files/uploads/relatorios-tecnicos/RT-INF_001-17.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Fast and Generic GPU-Based Parallel Reduction Implementation.\n \n \n \n \n\n\n \n Jradi, W.; Nascimento, H. d.; and Martins, W.\n\n\n \n\n\n\n arXiv. oct 2017.\n arXiv:1710.07358\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{jradi2017fast,\n  Title                    = {A Fast and Generic GPU-Based Parallel Reduction Implementation},\n  Author                   = {Jradi, Walid and Nascimento, Hugo do and Martins, Wellington},\n  Journal                  = {arXiv},\n  Year                     = {2017},\n\n  Month                    = {oct},\n  Note                     = {arXiv:1710.07358},\n\n  Archiveprefix            = {"arXiv"},\n  Primaryclass             = {cs.DC},\n  Url                      = {https://arxiv.org/abs/1710.07358}\n}\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Programação Visual para os Cubos Interativos $C^3$.\n \n \n \n \n\n\n \n Guimarães, G. A.; Pereira, Y. M. D.; do Nascimento, H. A. D.; and de Sousa Rocha, C.\n\n\n \n\n\n\n In Anais do IV Simpósio Internacional de Inovação em Mídias Interativas, pages 572–583, Goiânia, GO, Brazil, Maio 2016. ROCHA, Cleomar, Media Lab / UFG\n \n\n\n\n
\n\n\n\n \n \n \"ProgramaçãoPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{siimi-pvcc3-16,\n  author       = {Gabriela Aim{\\'e} Guimar{\\~a}es and Yuri Matheus Dias Pereira and Hugo A. Dantas do Nascimento and Cleomar de Sousa Rocha},\n  title        = {Programa\\c{c}\\~{a}o Visual para os Cubos Interativos $C^3$},\n  booktitle    = {Anais do IV Simp\\'{o}sio Internacional de Inova\\c{c}\\~{a}o em M\\'{i}dias Interativas},\n  year         = {2016},\n  pages        = {572--583},\n  address      = {Goi{\\^a}nia, GO, Brazil},\n  month        = {Maio},\n  organization = {ROCHA, Cleomar, Media Lab / UFG},\n  abstract     = {$C^3$ \\'{e} uma plataforma de arte interativa desenvolvida pela equipe do Media Lab / {UFG}. Ela consiste de um conjunto de cubos dotados de comportamentos expressos por luz e som, que variam segundo sua posi\\c{c}\\~{a}o no espa\\c{c}o tridimensional, sua proximidade de outros cubos e dos movimentos executados neles por interatores humanos. Convencionalmente, a programa\\c{c}\\~{a}o dos cubos se d\\'{a} utilizando uma linguagem baseada em {C} para dispositivos Arduino, o que, embora comum em v\\'{a}rios projetos de arte interativa, n\\~{a}o \\'{e} dominada por todos aqueles que atuam nessa \\'{a}rea. O presente artigo descreve o $C^3$ {GUI}, um ambiente de programa\\c{c}\\~{a}o visual que possibilita que artistas e designers, mesmo que inexperientes em programa\\c{c}\\~{a}o, possam criar projetos interativos para o $C^3$. Experi\\^{e}ncias com o $C^3$ {GUI} demonstram os benef\\'{i}cios em utilizar uma linguagem de programa\\c{c}\\~{a}o visual, bem como, os problemas e as limita\\c{c}\\~{o}es que ainda precisam ser resolvidos nessa ferramenta.},\n  comment      = {4 a 6 de maio de 2016. ISSN 2358-0488, ISBN 978-85-495-0020-5},\n  issn         = {2358-0488},\n  keywords     = {cubos interativos, programação visual, interface gráfica, máquina de estados},\n  owner        = {hugo},\n  timestamp    = {2016.12.08},\n  url          = {https://siimi.medialab.ufg.br/p/16333-anais-2016},\n}\n\n
\n
\n\n\n
\n $C^3$ é uma plataforma de arte interativa desenvolvida pela equipe do Media Lab / UFG. Ela consiste de um conjunto de cubos dotados de comportamentos expressos por luz e som, que variam segundo sua posição no espaço tridimensional, sua proximidade de outros cubos e dos movimentos executados neles por interatores humanos. Convencionalmente, a programação dos cubos se dá utilizando uma linguagem baseada em C para dispositivos Arduino, o que, embora comum em vários projetos de arte interativa, não é dominada por todos aqueles que atuam nessa área. O presente artigo descreve o $C^3$ GUI, um ambiente de programação visual que possibilita que artistas e designers, mesmo que inexperientes em programação, possam criar projetos interativos para o $C^3$. Experiências com o $C^3$ GUI demonstram os benefícios em utilizar uma linguagem de programação visual, bem como, os problemas e as limitações que ainda precisam ser resolvidos nessa ferramenta.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Parallel Floyd-Warshall Algorithm on GPU.\n \n \n \n \n\n\n \n Gaioso, R.; Martins, W. S.; Cáceres, E.; Jradi, W.; and Nascimento, H. A. D.\n\n\n \n\n\n\n In GPU Technology Conference, pages 1, San Jose, California (US), April 2016. NVIDIA Corporation\n Poster GTC 2016 - ID P6272\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{gtc-pfwgpu-16,\n  author    = {R. Gaioso and Wellington Santos Martins and Edson Cáceres and Walid Jradi and H. A. D. Nascimento},\n  title     = {A Parallel Floyd-Warshall Algorithm on GPU},\n  booktitle = {GPU Technology Conference},\n  year      = {2016},\n  pages     = {1},\n  address   = {San Jose, California (US)},\n  month     = {April},\n  publisher = {NVIDIA Corporation},\n  note      = {Poster GTC 2016 - ID P6272},\n  abstract  = {We propose a new parallel algorithm for solving the APSP problem. The algorithm is based on Floyd-Warshall and, therefore, borrows some of its advantages as having a predictable performance regardless of the underlying graph structure. It was efficiently implemented on a machine with a many-core GPU, which is less expensive than a cluster of computers. The tests were performed on a Tesla C2075 graphics card. The implementation was able to identify the shortest paths among all pairs of vertices of randomly generated graphs (all containing a maximum of 8192 vertices) in less than 15 seconds, which represents a speedup of 150x over the sequential Floyd-Warshall algorithm.},\n  comment   = {Apr 5-7, 2016. http://on-demand-gtc.gputechconf.com/gtc-quicklink/gL5SW},\n  keywords  = {Algorithms, Performance Optimization},\n  owner     = {hugo},\n  timestamp = {2018.06.16},\n  url       = {http://on-demand.gputechconf.com/gtc/2016/posters/GTC_2016_Algorithms_AL_02_P6272_WEB.pdf},\n}\n\n
\n
\n\n\n
\n We propose a new parallel algorithm for solving the APSP problem. The algorithm is based on Floyd-Warshall and, therefore, borrows some of its advantages as having a predictable performance regardless of the underlying graph structure. It was efficiently implemented on a machine with a many-core GPU, which is less expensive than a cluster of computers. The tests were performed on a Tesla C2075 graphics card. The implementation was able to identify the shortest paths among all pairs of vertices of randomly generated graphs (all containing a maximum of 8192 vertices) in less than 15 seconds, which represents a speedup of 150x over the sequential Floyd-Warshall algorithm.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Capacitações em Tecnologias Abertas pela Universidade Federal de Goiás.\n \n \n \n \n\n\n \n do Nascimento, H. A. D.; Inuzuka, M. A.; Borges, T. A. A.; Borges, R. H. D.; Costa, C. C.; and Leonardo, K. S.\n\n\n \n\n\n\n LibreOffice Magazine, 4(25). Dezembro 2016.\n \n\n\n\n
\n\n\n\n \n \n \"CapacitaçõesPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{lom-ctaufg-16,\n  author    = {Hugo A. D. do Nascimento and Marcelo A. Inuzuka and Tadeu A. A. Borges and Ricardo H. D. Borges and Cristine C. Costa and K{\\'e}lvin S. Leonardo},\n  title     = {Capacita\\c{c}\\~{o}es em Tecnologias Abertas pela Universidade Federal de Goi\\'{a}s},\n  journal   = {LibreOffice Magazine},\n  year      = {2016},\n  volume    = {4},\n  number    = {25},\n  month     = {Dezembro},\n  keywords  = {Treinamentos, software livre, extensão universitária},\n  owner     = {hugo},\n  timestamp = {2018.06.16},\n  url       = {https://pt-br.libreoffice.org/projetos/revista/},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Criação automática de interações para o projeto C3.\n \n \n \n \n\n\n \n Victor M. de Oliveira, H. A. D. d. N.\n\n\n \n\n\n\n In Anais do 13\\bo CONPEEX - Congresso de Pesquisa, Ensino e Extensão da Universidade Federal de Goiás, XIII Seminário de Pós-Graduação – Mestrado, pages 2629–2633, Goiânia, GO, 2016. \n ISSN 2447-8695\n\n\n\n
\n\n\n\n \n \n \"CriaçãoPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{vo-caipc3-2016,\n  author    = {Victor M. de Oliveira, Hugo A. D. do Nascimento},\n  title     = {Cria\\c{c}\\~{a}o autom{\\'a}tica de intera\\c{c}\\~{o}es para o projeto {C3}},\n  booktitle = {Anais do 13{\\b{o}} {CONPEEX} - Congresso de Pesquisa, Ensino e Extens{\\~a}o da Universidade Federal de Goi{\\'a}s, XIII Semin\\'{a}rio de P\\'{o}s-Gradua\\c{c}\\~{a}o -- Mestrado},\n  year      = {2016},\n  pages     = {2629--2633},\n  address   = {Goi{\\^a}nia, GO},\n  note      = {ISSN 2447-8695},\n  comment   = {17 a 19 de outubro de 2016},\n  issn      = {2447-8695},\n  keywords  = {Computação Evolutiva Interativa, Cubos Interativos, Interação Humano Computador, Arte Interativa},\n  owner     = {hugo},\n  timestamp = {2018.06.16},\n  url       = {https://conpeex.ufg.br/},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n OD Flows - A Visual Representation of Origin-Destination Matrices in Urban Traffic Scenarios.\n \n \n \n \n\n\n \n Gondim, H. W. A. S.; Nascimento, H. A. D. d.; and Reilly, D.\n\n\n \n\n\n\n In Comba, J. L. D.; and Nonao, L. G., editor(s), Proceedings of the Workshop on Visual Analytics, Information Visualization and Scientific Visualization, pages 1–5, Porto Alegre, 2015. Workshop on Visual Analytics, Information Visualization and Scientific Visualization, 6. (WVIS), Sociedade Brasileira de Computação\n \n\n\n\n
\n\n\n\n \n \n \"ODPaper\n  \n \n \n \"ODAccessdate\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{GondimNascReil:2015:ViReOr,\n  author              = {Gondim, H. W. A. S. and Nascimento, H. A. D. do and Reilly, D.},\n  title               = {OD Flows - A Visual Representation of Origin-Destination Matrices in Urban Traffic Scenarios},\n  booktitle           = {Proceedings of the Workshop on Visual Analytics, Information Visualization and Scientific Visualization},\n  year                = {2015},\n  editor              = {Comba, Jo{\\~a}o Luiz Dihl and Nonao, Luis Gustavo},\n  pages               = {1--5},\n  address             = {Porto Alegre},\n  organization        = {Workshop on Visual Analytics, Information Visualization and Scientific Visualization, 6. (WVIS)},\n  publisher           = {Sociedade Brasileira de Computa{\\c{c}}{\\~a}o},\n  abstract            = {Urban mobility has become one of the main problems faced by large cities. The increasing amount of vehicles combined with limited road infrastructure result in traffic congestion and in several other traffic-related issues such as fuel wastage, time losses, health problems and environmental pollution. As an attempt to mitigate these problems, much research has been done and tools developed for the study and improvement of urban traffic conditions. However, visualizing Origin-Destination (OD) matrices, an important element of urban traffic studies, is still a challenge. In general, showing OD matrices in an effective way involves considering georeferenced temporal aspects, traffic multimodality and large volumes of data; factors that have not been fully addressed by the existing approaches. This paper proposes a new visual representation for OD matrices that deals with these factors, filling a gap in this area.},\n  affiliation         = {Instituto de Inform{\\'a}tica - Universidade Federal de Goi{\\'a}s, Campus II, Goi{\\^a}nia - Goi{\\'a}s, Brasil and Instituto de Inform{\\'a}tica - Universidade Federal de Goi{\\'a}s, Campus II, Goi{\\^a}nia - Goi{\\'a}s, Brasil and Faculty of Computer Science Dalhousie University, Halifax - Nova Scotia, Canada},\n  conference-location = {Salvador-BA},\n  conference-year     = {Aug. 26-29, 2015},\n  keywords            = {Urban traffic, congestion of vehicles, information visualization, Origin-Destination matrices.},\n  language            = {en},\n  targetfile          = {SibiGrapi2015WvisHalleyGondim.pdf},\n  url                 = {http://urlib.net/sid.inpe.br/sibgrapi/2015/08.20.23.43},\n  urlaccessdate       = {2015, Nov. 16},\n}\n\n
\n
\n\n\n
\n Urban mobility has become one of the main problems faced by large cities. The increasing amount of vehicles combined with limited road infrastructure result in traffic congestion and in several other traffic-related issues such as fuel wastage, time losses, health problems and environmental pollution. As an attempt to mitigate these problems, much research has been done and tools developed for the study and improvement of urban traffic conditions. However, visualizing Origin-Destination (OD) matrices, an important element of urban traffic studies, is still a challenge. In general, showing OD matrices in an effective way involves considering georeferenced temporal aspects, traffic multimodality and large volumes of data; factors that have not been fully addressed by the existing approaches. This paper proposes a new visual representation for OD matrices that deals with these factors, filling a gap in this area.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n PETGYN – Uma Ferramenta para Apoio à Modelagem e Simulação do Tráfego Urbano.\n \n \n \n\n\n \n Jradi, W. A. R.; do Nascimento, H. A. D.; and Hall, B. R.\n\n\n \n\n\n\n In Anais do XII Seminário de Pós-graduação, No XXII Congresso de Pesquisa, Ensino e Extensão da UFG (CONPEEX 2015), pages 1–5, 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{petgyn-conpeex-2015,\n  Title                    = {PETGYN -- Uma Ferramenta para Apoio \\`{a} Modelagem e Simula\\c{c}\\~{a}o do Tr\\'{a}fego Urbano},\n  Author                   = {Walid Abdala Rfaei Jradi and Hugo Alexandre Dantas do Nascimento and Bryon Richard Hall},\n  Booktitle                = {Anais do XII Semin\\'{a}rio de P\\'{o}s-gradua\\c{c}\\~{a}o, No XXII Congresso de Pesquisa, Ensino e Extens\\~{a}o da UFG (CONPEEX 2015)},\n  Year                     = {2015},\n  Pages                    = {1--5},\n\n  Keywords                 = {Tr\\'{a}fego urbano, software, modelagem, simula\\c{c}\\~{a}o},\n  Owner                    = {hugo},\n  Timestamp                = {2015.11.15}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Application of Machine Learning to Problems in Graph Drawing – A Literature Review.\n \n \n \n \n\n\n \n dos Santos Vieira, R.; do Nascimento, H. A. D.; and da Silva, W. B.\n\n\n \n\n\n\n In Proc. of The Seventh International Conference on Information, Process, and Knowledge Management (eKNOW 2015), of eKNOW 2015, pages 112–118, 2015. IARIA\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{vns-mlgd-2015,\n  Title                    = {The Application of Machine Learning to Problems in Graph Drawing -- A Literature Review},\n  Author                   = {Raissa dos Santos Vieira and Hugo Alexandre Dantas do Nascimento and Wanderson Barcelos da Silva},\n  Booktitle                = {Proc. of The Seventh International Conference on Information, Process, and Knowledge Management (eKNOW 2015)},\n  Year                     = {2015},\n  Pages                    = {112--118},\n  Publisher                = {IARIA},\n  Series                   = {eKNOW 2015},\n\n  Abstract                 = {Graph drawing, as a research field, is concerned with the visualization of information modeled in the form of graphs. The present paper is a literature review that identifies the state- of-the-art in applying machine learning techniques to problems in graph drawing. We focused on machine learning strategies that build up and represent knowledge about how to draw a graph. Surprisingly, only a few pieces of research can be found about this subject. We classified them in two main groups: the ones that extract knowledge from the user by human-computer interaction and those that are not based on data directly gathered from users. The study of these methods shows that there is still much to research and to develop regarding the application of machine learning to graph drawing. We suggest directions for future research on this area.},\n  Keywords                 = {Graph Drawing, Human-Computer Interaction, Machine Learning},\n  Owner                    = {hugo},\n  Qualis                   = {B4},\n  Timestamp                = {2015.11.15},\n  Url                      = {http://www.thinkmind.org/index.php?view=instance&instance=eKNOW+2015\nhttp://www.thinkmind.org/index.php?view=article&articleid=eknow_2015_5_30_60124}\n}\n\n\n
\n
\n\n\n
\n Graph drawing, as a research field, is concerned with the visualization of information modeled in the form of graphs. The present paper is a literature review that identifies the state- of-the-art in applying machine learning techniques to problems in graph drawing. We focused on machine learning strategies that build up and represent knowledge about how to draw a graph. Surprisingly, only a few pieces of research can be found about this subject. We classified them in two main groups: the ones that extract knowledge from the user by human-computer interaction and those that are not based on data directly gathered from users. The study of these methods shows that there is still much to research and to develop regarding the application of machine learning to graph drawing. We suggest directions for future research on this area.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Metodologia de Implantação de Plataformas para MOOCs.\n \n \n \n \n\n\n \n Tadeu A. A. Borges, R. H. D. B.; and Hugo A. D. do Nascimento, M. A. I.\n\n\n \n\n\n\n In Anais da III Escola Regional de Informática ($ERI$), 2015. \n \n\n\n\n
\n\n\n\n \n \n \"MetodologiaPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{mipmoocs-eri-2015,\n  Title                    = {Metodologia de Implanta\\c{c}\\~{a}o de Plataformas para MOOCs},\n  Author                   = {Tadeu A. A. Borges, Ricardo H. D. Borges, Hugo A. D. do Nascimento, Marcelo A. Inuzuka},\n  Booktitle                = {Anais da III Escola Regional de Inform\\'{a}tica ($ERI$)},\n  Year                     = {2015},\n\n  Abstract                 = {This paper proposes a platform implementation methodology for mas- sive open online courses (MOOCs). To study the effectiveness of this methodo- logy, it is made its application in a training course through the project \\”Capacity building in Open Technologies\\”, which aims to spread the use of free software through massive courses, in order to form groups or communities that give con- tinuity to the work. In the end, the analysis of the results and the lessons learned by applying this methodology are presented.},\n  Owner                    = {hugo},\n  Timestamp                = {2015.12.02},\n  Url                      = {http://erigo.net.br}\n}\n\n
\n
\n\n\n
\n This paper proposes a platform implementation methodology for mas- sive open online courses (MOOCs). To study the effectiveness of this methodo- logy, it is made its application in a training course through the project \\”Capacity building in Open Technologies\\”, which aims to spread the use of free software through massive courses, in order to form groups or communities that give con- tinuity to the work. In the end, the analysis of the results and the lessons learned by applying this methodology are presented.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Fazendo as melhores escolhas - um estudo sobre aprendizado de máquina e a utilização de foco de algoritmos em desenho de grafos.\n \n \n \n\n\n \n Vieira, R. d. S.; and Nascimento, H. A. D. d.\n\n\n \n\n\n\n Master's Thesis, Institute of Informatics, Federal University of Goias, Goiania, Brazil, 2015.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@MastersThesis{raissa,\n  Title                    = {Fazendo as melhores escolhas - um estudo sobre aprendizado de máquina e a utilização de foco de algoritmos em desenho de grafos},\n  Author                   = {Vieira, Raissa dos Santos and Nascimento, Hugo Alexandre Dantas do},\n  School                   = {Institute of Informatics, Federal University of Goias, Goiania, Brazil},\n  Year                     = {2015},\n  Type                     = {Master's Thesis},\n\n  Owner                    = {hugo},\n  Timestamp                = {2017.09.01}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n $C^3$ – Cubos interativos.\n \n \n \n \n\n\n \n do Nascimento, H. A. D.; de Sousa Rocha, C.; de Oliveira, L. W.; Tannús, H. C.; and Hoelzel, C. G. M.\n\n\n \n\n\n\n In XIX Congresso da Sociedade Ibero-Americana de Gráfica Digital (SIGraDi 2015), of 3, pages 300-305, Florianópolis, SC., Nov 2015. Sociedade Ibero-americana de Gráfica Digital\n \n\n\n\n
\n\n\n\n \n \n \"$C^3$Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{c3-sigradi,\n  author    = {Hugo A. D. do Nascimento and Cleomar de Sousa Rocha and Luma Wanderley de Oliveira and Hugo Cabral Tann\\'{u}s and Carlos G. M. Hoelzel},\n  title     = {$C^3$ -- Cubos interativos},\n  booktitle = {XIX Congresso da Sociedade Ibero-Americana de Gr\\'{a}fica Digital (SIGraDi 2015)},\n  year      = {2015},\n  number    = {2},\n  series    = {3},\n  pages     = {300-305},\n  address   = {Florian\\'{o}polis, SC.},\n  month     = {Nov},\n  publisher = {Sociedade Ibero-americana de Gr\\'{a}fica Digital},\n  abstract  = {$C^3$ is a set of three interactive cubes that accommodates complex computational models of behavior, considering the relationship between them and interaction with humans. Its development mobilized a multidisciplinary team that had to deal with topics such as autopoiesis, tangible interfaces, combinations of behavioral states, interactivity and technological art. The team worked on requirement identification, design of physical structures, design of hardware and software, and assembly and test of the final solution. The cubes were shown in an international exhibition, during which a preliminary evaluation was done. The experience in having a multidisciplinary and collaborative project is commented.},\n  doi       = {10.5151/despro-sigradi2015-70382},\n  keywords  = {Interactive Cubes, Behavioral States, Sound and Luminous Feedback},\n  owner     = {hugo},\n  timestamp = {2018.06.16},\n  url       = {http://sigradi2015.sites.ufsc.br/, http://www.proceedings.blucher.com.br/article-details/c-cubos-interativos-22332},\n}\n\n
\n
\n\n\n
\n $C^3$ is a set of three interactive cubes that accommodates complex computational models of behavior, considering the relationship between them and interaction with humans. Its development mobilized a multidisciplinary team that had to deal with topics such as autopoiesis, tangible interfaces, combinations of behavioral states, interactivity and technological art. The team worked on requirement identification, design of physical structures, design of hardware and software, and assembly and test of the final solution. The cubes were shown in an international exhibition, during which a preliminary evaluation was done. The experience in having a multidisciplinary and collaborative project is commented.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n $C^3$.\n \n \n \n\n\n \n do Nascimento, H.; de Oliveira, L.; and Rocha, C.\n\n\n \n\n\n\n Computer art exhibition in the Understanting Visual Music. Brasília, Brazil, Jun 2015.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{c3-expo-2015,\n  author       = {Hugo do Nascimento and Luma de Oliveira and Cleomar Rocha},\n  title        = {$C^3$},\n  howpublished = {Computer art exhibition in the Understanting Visual Music. Bras\\'{i}lia, Brazil},\n  month        = {Jun},\n  year         = {2015},\n  abstract     = {$C^3$ (pronounced C-cubic) is a tangible interface under development by researchers at Media Lab -- UFG, for multi-user interaction. The interface consists of three large, but light cubes that can be lifted, rotated and moved in a room by a group of people. Each cube detects its orientation (which side is positioned on the top) and the proximity to the other cubes. For simplicity, proximity between any pair of cubes was defined only as near (up to 2 meters) and far (above 2 meters). This set of three cubes allows $6^3$ combinations of upside positioning. Considering only proximity, 5 different setups are possible (no cube near the others, all three cubes nearby, and three pairwise proximity combinations). In total, the setup offers $6^3$ x 5 = 1,080 combinations. Each one of them can be assigned to a different output involving blinking of lights and sound feedback. The sides of the cubes can be painted with pictures. The interface was thought as a way of transmitting new concepts to the users, for instance, in an educational environment. Motivational activities and pure entertainment are also possible applications for $C^3$. These goals can be reached by assigning the above mentioned combinations to specific feedbacks. The intensity of the feedbacks can be designed to guide the users to one or more targeting configurations, in which the images of the three cubes, when visualized together, compose a new concept. For the current exhibition, $C^3$ is programmed to highlight a poetic perspective in a ludic way. The ludic aspect acts as a motivational element and the poetic perspective is defined by the combinatorial setups of the cubes. High peaks in the behavior of the system, triggered by the user by a series of actions, are composed of sounds and kaleidoscopic lights for some preconfigured combinations.},\n  owner        = {hugo},\n  timestamp    = {2018.06.16},\n}\n\n
\n
\n\n\n
\n $C^3$ (pronounced C-cubic) is a tangible interface under development by researchers at Media Lab – UFG, for multi-user interaction. The interface consists of three large, but light cubes that can be lifted, rotated and moved in a room by a group of people. Each cube detects its orientation (which side is positioned on the top) and the proximity to the other cubes. For simplicity, proximity between any pair of cubes was defined only as near (up to 2 meters) and far (above 2 meters). This set of three cubes allows $6^3$ combinations of upside positioning. Considering only proximity, 5 different setups are possible (no cube near the others, all three cubes nearby, and three pairwise proximity combinations). In total, the setup offers $6^3$ x 5 = 1,080 combinations. Each one of them can be assigned to a different output involving blinking of lights and sound feedback. The sides of the cubes can be painted with pictures. The interface was thought as a way of transmitting new concepts to the users, for instance, in an educational environment. Motivational activities and pure entertainment are also possible applications for $C^3$. These goals can be reached by assigning the above mentioned combinations to specific feedbacks. The intensity of the feedbacks can be designed to guide the users to one or more targeting configurations, in which the images of the three cubes, when visualized together, compose a new concept. For the current exhibition, $C^3$ is programmed to highlight a poetic perspective in a ludic way. The ludic aspect acts as a motivational element and the poetic perspective is defined by the combinatorial setups of the cubes. High peaks in the behavior of the system, triggered by the user by a series of actions, are composed of sounds and kaleidoscopic lights for some preconfigured combinations.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Capacitações em Tecnologias Abertas.\n \n \n \n\n\n \n Borges, R. H. D.; Borges, T. A. A.; do Nascimento, H. A. D.; and Inuzuka, M. A.\n\n\n \n\n\n\n In UFG, editor(s), Anais do XII CONPEEX - Congresso de Pesquisa, Ensino e Extensão - Modalidade PROBEC, pages 3061–3065, Goiânia, GO, Outubro 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{cta-conpeex-2015,\n  author    = {Ricardo Henricki Dias Borges and Tadeu Augusto Ara\\'{u}o Borges and Hugo Alexandre Dantas do Nascimento and Marcelo Akira Inuzuka},\n  title     = {Capacita\\c{c}\\~{o}es em Tecnologias Abertas},\n  booktitle = {Anais do XII CONPEEX - Congresso de Pesquisa, Ensino e Extens\\~{a}o - Modalidade PROBEC},\n  year      = {2015},\n  editor    = {UFG},\n  pages     = {3061--3065},\n  address   = {Goi\\^{a}nia, GO},\n  month     = {Outubro},\n  keywords  = {MOOC, Ensino a Dist\\^{a}ncia, Ambiente Virtual de Aprendizagem, Sistema de Gest\\~{a}o de Aprendizagem},\n  owner     = {hugo},\n  timestamp = {2018.06.16},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Visualizing Large Scale Vehicle Traffic Network Data - A Survey of the State-of-the-art.\n \n \n \n \n\n\n \n Gondim, H. W. A. S.; do Nascimento, H. A. D.; and Reilly, D.\n\n\n \n\n\n\n In Proceedings of the 5th International Conference on Information Visualization Theory and Applications, IVAPP 2014, Lisbon, Portugal, 5-8 January, 2014., pages 337–346, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"VisualizingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{DBLP:conf/grapp/GondimNR14,\n  Title                    = {Visualizing Large Scale Vehicle Traffic Network Data - {A} Survey of the State-of-the-art},\n  Author                   = {H. W. A. S. Gondim and H. A. D. do Nascimento and D. Reilly},\n  Booktitle                = {Proceedings of the 5th International Conference on Information Visualization Theory and Applications, {IVAPP} 2014, Lisbon, Portugal, 5-8 January, 2014.},\n  Year                     = {2014},\n  Pages                    = {337--346},\n\n  Abstract                 = {Analyzing and improving large urban traffic networks is a difficult process due to complex interrelationships between the many variables that impact vehicle traffic behavior. Information visualization techniques can facilitate the tasks of analyzing large amounts of data and of exploring potential solutions to practical traffic problems. Surprisingly, there is a relative lack of investigation focused on how information visualization techniques should be applied and adapted to the field of Traffic Engineering. This paper presents an overview of what has been done on this topic by reviewing the use of information visualization in traffic systems over the years, and highlighting the current state-of-the-art by focusing on several innovative pieces of research. We provide a classification of the reviewed work and identify areas that have been understudied.},\n  Bibsource                = {dblp computer science bibliography, http://dblp.org},\n  Biburl                   = {http://dblp.uni-trier.de/rec/bib/conf/grapp/GondimNR14},\n  Crossref                 = {DBLP:conf/grapp/2014ivapp},\n  Doi                      = {10.5220/0004686603370346},\n  ISBN                     = {978-989-758-005-5},\n  Timestamp                = {Sun, 29 Jun 2014 14:09:53 +0200},\n  Url                      = {http://www.scitepress.org/portal/PublicationsDetail.aspx?ID=G589hFXArTE=&t=1}\n}\n\n
\n
\n\n\n
\n Analyzing and improving large urban traffic networks is a difficult process due to complex interrelationships between the many variables that impact vehicle traffic behavior. Information visualization techniques can facilitate the tasks of analyzing large amounts of data and of exploring potential solutions to practical traffic problems. Surprisingly, there is a relative lack of investigation focused on how information visualization techniques should be applied and adapted to the field of Traffic Engineering. This paper presents an overview of what has been done on this topic by reviewing the use of information visualization in traffic systems over the years, and highlighting the current state-of-the-art by focusing on several innovative pieces of research. We provide a classification of the reviewed work and identify areas that have been understudied.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Turning Restriction Design in Traffic Networks with a Budget Constraint.\n \n \n \n \n\n\n \n Foulds, L. R.; Duarte, D. C.; Nascimento, H. A.; Longo, H. J.; and Hall, B. R.\n\n\n \n\n\n\n Journal of Global Optimization (Dordrecht. Online), 60(2): 351–371. October 2014.\n \n\n\n\n
\n\n\n\n \n \n \"TurningPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Foulds:2014:TRD:2669436.2669453,\n  author     = {Foulds, Les R. and Duarte, Daniel C. and Nascimento, Hugo A. and Longo, Humberto J. and Hall, Bryon R.},\n  title      = {Turning Restriction Design in Traffic Networks with a Budget Constraint},\n  journal    = {Journal of Global Optimization (Dordrecht. Online)},\n  year       = {2014},\n  volume     = {60},\n  number     = {2},\n  pages      = {351--371},\n  month      = oct,\n  issn       = {0925-5001},\n  acmid      = {2669453},\n  address    = {Hingham, MA, USA},\n  comment    = {Springer},\n  doi        = {10.1007/s10898-013-0127-1},\n  issue_date = {October 2014},\n  keywords   = {Multi-start, Successive linear approximation, Turning restriction design, Urban network design problem},\n  numpages   = {21},\n  publisher  = {Kluwer Academic Publishers},\n  url        = {http://dx.doi.org/10.1007/s10898-013-0127-1},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Visualizações de Matrizes Origem-Destino no Cenário do Tráfego Urbano.\n \n \n \n \n\n\n \n H. W. A. S. Gondim, undefined; H. A. D. do Nascimento, undefined; and Reilly, D.\n\n\n \n\n\n\n In Workshop of Work in Progress (WIP) in SIBGRAPI 2014 (XXVII Conference on Graphics, Patterns and Images), pages 32–35, august 2014. SBC, EMAp/FGV\n \n\n\n\n
\n\n\n\n \n \n \"VisualizaçõesPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{gnr-vmodctu-2014,\n  Title                    = {Visualiza\\c{c}\\~{o}es de Matrizes Origem-Destino no Cen\\'{a}rio do Tr\\'{a}fego Urbano},\n  Author                   = {H. W. A. S. Gondim, and H. A. D. do Nascimento, and D. Reilly},\n  Booktitle                = {Workshop of Work in Progress (WIP) in SIBGRAPI 2014 (XXVII Conference on Graphics, Patterns and Images)},\n  Year                     = {2014},\n  Month                    = {august},\n  Organization             = {SBC},\n  Pages                    = {32--35},\n  Publisher                = {EMAp/FGV},\n\n  Abstract                 = {Traffic problems are frequent in most large cities, and actions to minimize them have become ever more necessary. This paper discusses and proposes information visualizations for the representation of origin-destination matrices. Despite the importance of such matrices for the study of urban traffic, this is an aspect still little explored by the information visualization area and for which significant contributions can be made.},\n  Keywords                 = {urban traffic, traffic congestion, information visualization, O-D matrix},\n  Owner                    = {hadn},\n  Timestamp                = {2014.08.29},\n  Url                      = {http://bibliotecadigital.fgv.br/dspace/bitstream/handle/10438/11955/WIP-SIBGRAPI-2014.pdf, http://bibliotecadigital.fgv.br/dspace/handle/10438/11955}\n}\n\n
\n
\n\n\n
\n Traffic problems are frequent in most large cities, and actions to minimize them have become ever more necessary. This paper discusses and proposes information visualizations for the representation of origin-destination matrices. Despite the importance of such matrices for the study of urban traffic, this is an aspect still little explored by the information visualization area and for which significant contributions can be made.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Extracting New Metrics from Version Control System for the Comparison of Software Developers.\n \n \n \n \n\n\n \n de Moura, M.; do Nascimento, H.; and Rosa, T.\n\n\n \n\n\n\n In Software Engineering (SBES), 2014 Brazilian Symposium on, pages 41-50, Sept 2014. \n \n\n\n\n
\n\n\n\n \n \n \"ExtractingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{mnr-metrics-2014,\n  Title                    = {Extracting New Metrics from Version Control System for the Comparison of Software Developers},\n  Author                   = {de Moura, M.H.D. and do Nascimento, H.A.D. and Rosa, T.C.},\n  Booktitle                = {Software Engineering (SBES), 2014 Brazilian Symposium on},\n  Year                     = {2014},\n  Month                    = {Sept},\n  Pages                    = {41-50},\n\n  Abstract                 = {Previous studies have evaluated the work done by software developers using data extracted from version control systems (VCS). However, they have focused mostly on counting the amount of written lines of code and the number of commits, which are general information that can be obtained from these software repositories. In the present article, we innovate by considering fine-grain operations at line and file levels stored in the VCS, like additions, deletions and modifications, which allow to derive a much more detailed and rich information about the work done by developers. We also define a new set of metrics to measure such fine-grain information and present two simple approaches for comparing developers based on the proposed metrics. This helps to improve our understanding of how important and alike the developers were. A case study using data from a real software development project is described. The study showed that the metrics and the comparative approaches resulted in information that is consistent with the perception of the project manager. Furthermore, our investigation points to a great potential for future work by expanding the set of metrics and exploring new comparative approaches.},\n  Comment                  = {ISBN 9781479942237},\n  Doi                      = {10.1109/SBES.2014.25},\n  Keywords                 = {configuration management;software metrics;VCS;data extraction;file levels;fine-grain operations;line levels;project manager perception;real software development project;software repositories;version control system;Control systems;Data mining;Data structures;History;Measurement;Software;Teamwork;comparison of software developers;metrics;version control systems},\n  Url                      = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6943481}\n}\n\n
\n
\n\n\n
\n Previous studies have evaluated the work done by software developers using data extracted from version control systems (VCS). However, they have focused mostly on counting the amount of written lines of code and the number of commits, which are general information that can be obtained from these software repositories. In the present article, we innovate by considering fine-grain operations at line and file levels stored in the VCS, like additions, deletions and modifications, which allow to derive a much more detailed and rich information about the work done by developers. We also define a new set of metrics to measure such fine-grain information and present two simple approaches for comparing developers based on the proposed metrics. This helps to improve our understanding of how important and alike the developers were. A case study using data from a real software development project is described. The study showed that the metrics and the comparative approaches resulted in information that is consistent with the perception of the project manager. Furthermore, our investigation points to a great potential for future work by expanding the set of metrics and exploring new comparative approaches.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Uma aproximação linear da demanda elástica de viagens em redes congestionadas de tráfego urbano com custos assimétricos e dados imprecisos.\n \n \n \n \n\n\n \n de Souza Alencar, W.; Foulds, L. R.; do Nascimento, H. A. D.; Hall, B. R.; and Longo, H.\n\n\n \n\n\n\n In Anais do XVLI Simpósio Brasileiro de Pesquisa Operacional (SBPO 2014), pages 1800–1811, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"UmaPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{wlhbh-ualdeevrctucadi-14,\n  author              = {Wanderley de Souza Alencar and Leslie Richard Foulds and Hugo Alexandre D. do Nascimento and Bryon R. Hall and Humberto Longo},\n  title               = {Uma aproximação linear da demanda elástica de viagens em redes congestionadas de tráfego urbano com custos assimétricos e dados imprecisos},\n  booktitle           = {Anais do XVLI Simpósio Brasileiro de Pesquisa Operacional (SBPO 2014)},\n  year                = {2014},\n  pages               = {1800--1811},\n  conference-location = {Salvador--BA},\n  keywords            = {Redes urbanas de tráfego, demanda elástica de viagens, matriz OD, custos assimétricos, dados imprecisos, aproximação linear},\n  owner               = {hugo},\n  timestamp           = {2017.02.07},\n  url                 = {http://www.din.uem.br/sbpo/sbpo2014/pdf/arq0291.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data.\n \n \n \n \n\n\n \n Foulds, L. R.; do Nascimento, H. A.; Calixto, I. C.; Hall, B. R.; and Longo, H.\n\n\n \n\n\n\n European Journal of Operational Research, 231(1): 190–201. nov 2013.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Foulds2013,\n  Title                    = {A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data},\n  Author                   = {Les R. Foulds and Hugo A.D. do Nascimento and Iacer C.A.C. Calixto and Bryon R. Hall and Humberto Longo},\n  Journal                  = {European Journal of Operational Research},\n  Year                     = {2013},\n\n  Month                    = {nov},\n  Number                   = {1},\n  Pages                    = {190--201},\n  Volume                   = {231},\n\n  Doi                      = {10.1016/j.ejor.2013.05.012},\n  Publisher                = {Elsevier {BV}},\n  Url                      = {https://doi.org/10.1016%2Fj.ejor.2013.05.012}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Uma Análise Restrospectiva das Ações em Prol do Uso de Software Livre na UFG.\n \n \n \n \n\n\n \n do Nascimento; Alexandre Ferreira de Melo, H. A. D.\n\n\n \n\n\n\n In Anais do VII Workshop de TIC das IFES, CGTIC/ANDIFES, pages 7, João Pessoa-PB, Maio 2013. CGTIC/ANDIFES\n \n\n\n\n
\n\n\n\n \n \n \"UmaPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{nm-uarapuslufg-2013,\n  Title                    = {Uma Análise Restrospectiva das Ações em Prol do Uso de Software Livre\n na UFG},\n  Author                   = {Hugo Alexandre Dantas do Nascimento; Alexandre Ferreira de Melo},\n  Booktitle                = {Anais do VII Workshop de TIC das IFES, CGTIC/ANDIFES},\n  Year                     = {2013},\n\n  Address                  = {João Pessoa-PB},\n  Month                    = {Maio},\n  Organization             = {CGTIC/ANDIFES},\n  Pages                    = {7},\n\n  Abstract                 = {Este artigo apresenta uma análise retrospectiva das ações de um projeto\n da UFG para estudar e normatizar o uso de software nos desktops na\n instituição com foco na adoção de software livre. As dificuldades\n encontradas e as lições aprendidas a cada passo são relatadas. A\n análise serve de apoio a novas ações em prol do uso de software livre.},\n  Owner                    = {hadn},\n  Timestamp                = {2013.05.29},\n  Url                      = {http://www.viiwticifes.ufba.br/}\n}\n\n\n\n
\n
\n\n\n
\n Este artigo apresenta uma análise retrospectiva das ações de um projeto da UFG para estudar e normatizar o uso de software nos desktops na instituição com foco na adoção de software livre. As dificuldades encontradas e as lições aprendidas a cada passo são relatadas. A análise serve de apoio a novas ações em prol do uso de software livre.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Simulation and analysis of urban traffic the architecture of a web-based interactive decision support system.\n \n \n \n\n\n \n Jradi, W. A. R.; d. Nasciment, H. A. D.; Longo, H.; and Hall, B. R.\n\n\n \n\n\n\n In Proc.of the 12th International IEEE Conference on Intelligent Transportation Systems, pages 1-6, Oct 2009. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{5309686,\n  Title                    = {Simulation and analysis of urban traffic the architecture of a web-based interactive decision support system},\n  Author                   = {W. A. R. Jradi and H. A. D. d. Nasciment and H. Longo and B. R. Hall},\n  Booktitle                = {Proc.of the 12th International IEEE Conference on Intelligent Transportation Systems},\n  Year                     = {2009},\n  Month                    = {Oct},\n  Pages                    = {1-6},\n\n  Doi                      = {10.1109/ITSC.2009.5309686},\n  ISSN                     = {2153-0009},\n  Keywords                 = {Internet;decision support systems;digital simulation;road traffic;Brazilian traffic reality;Web-based interactive decision support system;interactive graphical tool;mathematical model;urban traffic analysis;urban traffic simulation;Analytical models;Decision support systems;Intelligent transportation systems;Traffic control;USA Councils;Urban Traffic;decision support system}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Interactive Optimization in Cooperative Environments.\n \n \n \n \n\n\n \n Ferreira, J. d. M.; do Nascimento, H. A. D.; and de Albuquerque, E. S.\n\n\n \n\n\n\n In Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60, of APVis '06, pages 117–120, Darlinghurst, Australia, Australia, 2006. Australian Computer Society, Inc.\n \n\n\n\n
\n\n\n\n \n \n \"InteractivePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Ferreira2006,\n  Title                    = {Interactive Optimization in Cooperative Environments},\n  Author                   = {Ferreira, Joelma de Moura and do Nascimento, Hugo A. Dantas and de Albuquerque, Eduardo Sim\\~{o}es},\n  Booktitle                = {Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60},\n  Year                     = {2006},\n\n  Address                  = {Darlinghurst, Australia, Australia},\n  Pages                    = {117--120},\n  Publisher                = {Australian Computer Society, Inc.},\n  Series                   = {APVis '06},\n\n  Acmid                    = {1151921},\n  ISBN                     = {1-920682-41-4},\n  Keywords                 = {graph visualization, interactive optimization, multi-user framework, user hints},\n  Location                 = {Tokyo, Japan},\n  Numpages                 = {4},\n  Owner                    = {hugo},\n  Timestamp                = {2017.09.01},\n  Url                      = {http://dl.acm.org/citation.cfm?id=1151903.1151921}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n User hints: a framework for interactive optimization .\n \n \n \n \n\n\n \n do Nascimento, H. A.; and Eades, P.\n\n\n \n\n\n\n Future Generation Computer Systems , 21(7): 1177 - 1191. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"UserPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{doNascimento2005,\n  Title                    = {User hints: a framework for interactive optimization },\n  Author                   = {do Nascimento, Hugo A.D. and Eades, Peter},\n  Journal                  = {Future Generation Computer Systems },\n  Year                     = {2005},\n  Number                   = {7},\n  Pages                    = {1177 - 1191},\n  Volume                   = {21},\n\n  Doi                      = {http://dx.doi.org/10.1016/j.future.2004.04.005},\n  ISSN                     = {0167-739X},\n  Keywords                 = {Interactive optimisation},\n  Owner                    = {hugo},\n  Timestamp                = {2017.09.01},\n  Url                      = {http://www.sciencedirect.com/science/article/pii/S0167739X04000494}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Visualiza ̧cão de Informa ̧cões - uma abordagem prática.\n \n \n \n\n\n \n do Nascimento, H. A.; and Ferreira, C. B.\n\n\n \n\n\n\n In XXV Congresso da Sociedade Brasileira de Computa ̧cão, XXIV JAI. UNISINOS, S. Leopoldo–RS, 2005. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{do2005visualizaccao,\n  Title                    = {Visualiza\\c c\\~ao de Informa\\c c\\~oes - uma abordagem pr\\'atica},\n  Author                   = {do Nascimento, Hugo A.D. and Ferreira, Cristiane B.R.},\n  Booktitle                = {XXV Congresso da Sociedade Brasileira de Computa\\c c\\~ao, XXIV JAI. UNISINOS, S. Leopoldo--RS},\n  Year                     = {2005},\n\n  Owner                    = {hugo},\n  Timestamp                = {2017.09.01}\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);