{"title":"Use of text mining techniques for unsupervised organization of digital procedural acts","authors":"Alfredo Silveira Araújo Neto, Marcos Negreiros","doi":"10.22456/2175-2745.83581","DOIUrl":"https://doi.org/10.22456/2175-2745.83581","url":null,"abstract":"The rapid advances in technologies related to the capture and storage of data in digital format have allowed to organizations the accumulation of a volume of information extremely high, constituted a higher proportion of data in unstructured format, represented by texts. However, it is noted that the retrieval of useful information from these large repositories has been a very challenging activity. In this context, data mining is presented as a self-discovery process that acts on large databases and enables the knowledge extraction from raw text documents. Among the many sources of textual documents are electronic diaries of justice, which are intended to make public officially all the acts of the Judiciary. Despite the publication in digital form has provided improvements represented by the removal of imperfections related to divulgation at printed format, it is observed that the application of data mining methods could render more rapid analysis of its contents. In this sense, this article establishes a tool capable of automatically grouping and categorizing digital procedural acts, based on the evaluation of text mining techniques applied to groups determination activity. In addition, the strategy of defining the descriptors of the groups, that is usually conducted based on the most frequent words in the documents, was evaluated and remodeled in order to use, instead of words, the most regularly identified concepts in the texts.","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"423 1","pages":"74-102"},"PeriodicalIF":0.0,"publicationDate":"2018-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79539276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Investigation of Archiving Techniques for Evolutionary Multi-objective Optimizers","authors":"H. Medeiros, E. Goldbarg, M. Goldbarg","doi":"10.22456/2175-2745.80478","DOIUrl":"https://doi.org/10.22456/2175-2745.80478","url":null,"abstract":"Abstract: The optimization of multi-objective problems from the Pareto dominance viewpoint can lead to huge sets of incomparable solutions. Many heuristic techniques proposed to these problems have to deal with approximation sets that can be limited or not. Usually, a new solution generated by a heuristic is compared with other archived non-dominated solutions generated previously. Many techniques deal with limited size archives, since comparisons within unlimited archives may require significant computational effort. To maintain limited archives, solutions need to be discarded. Several techniques were proposed to deal with the problem of deciding which solutions remain in the archive and which are discarded. Previous investigations showed that those techniques might not prevent deterioration of the archives. In this study, we propose to store discarded solutions in a secondary archive and, periodically, recycle them, bringing them back to the optimization process. Three recycling techniques were investigated for three known methods. The datasets for the experiments consisted of 91 instances of discrete and continuous problems with 2, 3 and 4 objectives. The results showed that the recycling method can benefit the tested optimizers on many problem classes.","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"6 1","pages":"11-27"},"PeriodicalIF":0.0,"publicationDate":"2018-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80157485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. T. Garrocho, Jessé Pires Barbosa Rocha, José Eduardo de Souza
{"title":"CoWPar: A D2D Communication Approach Without Pairing for Mobile Social Network in Proximity","authors":"C. T. Garrocho, Jessé Pires Barbosa Rocha, José Eduardo de Souza","doi":"10.22456/2175-2745.79152","DOIUrl":"https://doi.org/10.22456/2175-2745.79152","url":null,"abstract":"Mobile devices and the cellular network have been popularized and evolving in recent years. The increase of these devices may promote Device-to-Device (D2D) communications. However, current D2D communication technologies such as Wi-Fi Direct, Wi-Fi Ad Hoc, and Bluetooth are not available on devices or require human interaction in the pairing process. In addition, the cellular network is not available in many places and has partial or total communication infrastructure failures. To overcome this failure and lack of connectivity, and to allow D2D communication between devices in disturbing scenarios, we presented CoWPar. Based on the Wi-Fi infrastructure mode, CoWPar establishes the connection and performs data exchange without human interaction between the devices. Results of experiments performed in a proof of concept showed in practice that CoWPar allowed D2D communications with no pairing and also without the need to change the operating system (OS) of the devices, surpassing all the works available so far and thus contributing to the process of viabilization the paradigm of Pervasive Computing.","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"25 1","pages":"11-22"},"PeriodicalIF":0.0,"publicationDate":"2018-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79141863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
L. Carvalho, S. L. M. Neto, E. Comunello, A. Sobieranski, A. V. Wangenheim
{"title":"Can the Use of nonlinear Color Metrics systematically improve Segmentation?","authors":"L. Carvalho, S. L. M. Neto, E. Comunello, A. Sobieranski, A. V. Wangenheim","doi":"10.22456/2175-2745.79885","DOIUrl":"https://doi.org/10.22456/2175-2745.79885","url":null,"abstract":"Image segmentation is a procedure where an image is split into its constituent parts, according to some criterion. In the literature, there are different well-known approaches for segmentation, such as clustering, thresholding, graph theory and region growing. Such approaches, additionally, can be combined with color distance metrics, playing an important role for color similarity computation. Aiming to investigate general approaches able to enhance the performance of segmentation methods, this work presents an empirical study of the effect of a nonlinear color metric on segmentation procedures. For this purpose, three algorithms were chosen: Mumford-Shah, Color Structure Code and Felzenszwalb and Huttenlocher Segmentation. The color similarity metric employed by these algorithms (L2-norm) was replaced by the Polynomial Mahalanobis Distance. This metric is an extension of the statistical Mahalanobis Distance used to measure the distance between coordinates and distribution centers. An evaluation based upon automated comparison of segmentation results against ground truths from the Berkeley Dataset was performed. All three segmentation approaches were compared to their traditional implementations, against each other and also to a large set of other segmentation methods. The statistical analysis performed has indicated a systematic improvement of segmentation results for all three segmentation approaches when the nonlinear metric was employed.","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"25 1","pages":"23-38"},"PeriodicalIF":0.0,"publicationDate":"2018-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73322605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Um modelo computacional para a simulação de sistemas de transporte urbano","authors":"D. G. Morais, L. Digiampietri","doi":"10.22456/2175-2745.80557","DOIUrl":"https://doi.org/10.22456/2175-2745.80557","url":null,"abstract":"Atualmente, as dificuldades enfrentadas no deslocamento urbano sao consideradas um problema extremamente importante, especialmente nas grandes cidades. O planejamento adequado do sistema de transporte urbano e essencial para minimizar o tempo e os custos de viagem, melhorar a qualidade de vida e melhorar o ambiente urbano. Esta trabalho parte da premissa de que os sistemas de simulacao podem ser utilizados para estudar diferentes alternativas para melhorar o sistema de transporte, de modo que a tomada de decisao pode ser melhor justificada, podendo otimizar o deslocamento urbano. Portanto, este trabalho apresenta a proposta e o desenvolvimento de um modelo computacional para simulacao de sistemas de transporte urbano. O modelo proposto visa a simular modelos mesoscopicos e microscopicos, incluindo os comportamentos dos usuarios no planejamento de rotas. Uma estrutura para o desenvolvimento de aplicacoes de simulacao e descrita, com uma implementacao usando como cenario o Metropolitano de Sao Paulo (Metro), considerando os dados da pesquisa Origem-Destino para teste e validacao do modelo aqui proposto.","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"385 1","pages":"39-61"},"PeriodicalIF":0.0,"publicationDate":"2018-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79966972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Arthur Giesel Vedana, Rodrigo Machado, Álvaro Freitas Moreira
{"title":"V: a language with extensible record accessors and a trait-based type system","authors":"Arthur Giesel Vedana, Rodrigo Machado, Álvaro Freitas Moreira","doi":"10.22456/2175-2745.82772","DOIUrl":"https://doi.org/10.22456/2175-2745.82772","url":null,"abstract":"This article introduces the V language, a purely functional programming language with a novel approach to records.Based on a system of type traits, V attempts to solve issues commonly found when manipulating records in purely functional programming languages.","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"1 1","pages":"89-101"},"PeriodicalIF":0.0,"publicationDate":"2018-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89170313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Samuel da Silva Feitosa, R. Ribeiro, A. R. D. Bois
{"title":"Formal Semantics for Java-like Languages and Research Opportunities","authors":"Samuel da Silva Feitosa, R. Ribeiro, A. R. D. Bois","doi":"10.22456/2175-2745.80912","DOIUrl":"https://doi.org/10.22456/2175-2745.80912","url":null,"abstract":"The objective of this paper is twofold: first, we discuss the state of art on Java-like semantics, focusing on those that provide formal specification using operational semantics (big-step or small-step), studying in detail the most cited projects and presenting some derivative works that extend the originals aggregating useful features. Also, we filter our research for those that provide some insights in type-safety proofs. Furthermore, we provide a comparison between the most used projects in order to show which functionalities are covered in such projects. Second, our effort is focused towards the research opportunities in this area, showing some important works that can be applied to the previously presented projects to study features of object-oriented languages, and pointing for some possibilities to explore in future researches.","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"14 1","pages":"62-74"},"PeriodicalIF":0.0,"publicationDate":"2018-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91223726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Haskell Type System Analysis","authors":"R. C. Silva, K. Roggia, Cristiano D. Vasconcellos","doi":"10.22456/2175-2745.82395","DOIUrl":"https://doi.org/10.22456/2175-2745.82395","url":null,"abstract":"Types systems of programming languages are becoming more and more sophisticated and, in some cases, they are based on concepts from Logic, Type Theory and Category Theory. Haskell is a language with a modern type system and it is often singled out as an example using such theories. This work presents a small formalization of the Haskell type system and an analysis based on the mentioned theories, including its relation with the Intuitionist Propositional Second Order Logic and its logical characteristics, if there is a category in its type system and how monads are just monoids in the category of Haskell's endofunctors.","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"72 1","pages":"75-88"},"PeriodicalIF":0.0,"publicationDate":"2018-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85934693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Matheus D'Eça Torquato de Melo, L. Torquato, P. Maciel
{"title":"Modelos para avaliação de disponibilidade orientada a capacidade de uma nuvem privada","authors":"Matheus D'Eça Torquato de Melo, L. Torquato, P. Maciel","doi":"10.22456/2175-2745.79158","DOIUrl":"https://doi.org/10.22456/2175-2745.79158","url":null,"abstract":"Alta disponibilidade e um dos principais requisitos das aplicacoes que utilizam computacao em nuvem. E possivel aplicar redundâncias em hardware e software para alcancar melhores niveis de disponibilidade do sistema. Porem, alem da preocupacao com a disponibilidade do servico, e necessario mensurar a capacidade do sistema em lidar com a carga de trabalho apresentada. Uma metrica que pode ser utilizada para mensurar essa capacidade e a disponibilidade orientada a capacidade. A partir dessa metrica, e possivel obter estimativas dos recursos computacionais disponiveis para utilizacao quando o sistema esta em funcionamento. Esse trabalho apresenta um conjunto de modelos analiticos para avaliacao de disponibilidade orientada a capacidade considerando ambientes de nuvem privada. Para verificar diferentes situacoes, esse trabalho apresenta seis diferentes arquiteturas de nuvem privada. Os componentes fundamentais de cada arquitetura sao Front-End, PM e VMs. O conjunto de resultados apresentados compreende a avaliacao de disponibilidade, avaliacao de disponibilidade orientada a capacidade e analise de sensibilidade dos dos parâmetros utilizados nos modelos. A partir dos resultados e possivel inferir quais componentes sao mais importantes para cada uma das metricas estudadas.","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"52 1","pages":"73-84"},"PeriodicalIF":0.0,"publicationDate":"2018-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76205715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. A. P. Pinto, Henrique Jorge A. Holanda, G. Barroso, Carla Katarina M. Marques
{"title":"Algoritmos de Escalonamento Gangue com Estratégias de Migracão em um Ambiente MCMCA","authors":"F. A. P. Pinto, Henrique Jorge A. Holanda, G. Barroso, Carla Katarina M. Marques","doi":"10.22456/2175-2745.79994","DOIUrl":"https://doi.org/10.22456/2175-2745.79994","url":null,"abstract":"Ao longo da ultima decada, o rapido avanco das tecnologias de rede, hardware e middleware, bem como a sofisticacao dos recursos de software contribuiram para o surgimento de novos modelos computacionais. Consequentemente, houve uma capacidade crescente para o uso eficiente e efetivo de recursos distribuidos visando integra-los, de modo a fornecer um ambiente amplamente distribuido, cuja capacidade computacional podendo ser utilizada para resolver problemas complexos. Os dois aspectos mais desafiadores dos sistemas distribuidos, sao o gerenciamento de recursos e o escalonamento de tarefas. Este trabalho contribui para minimizar tais problematicas: (i) atraves do uso de tecnicas de migracao; (ii) a implementacao de um ambiente de simulacao multicore multicluster com mecanismo de balanceamento de carga, a fim de analisar o sistema em diversos contextos; (iii) implementacao e analise dos escalonadores de gangues atraves de metricas com intuito de medir o desempenho em diferentes situacoes. Assim, os resultados mostraram um melhor uso dos recursos, implicando na reducao de custos operacionais","PeriodicalId":82472,"journal":{"name":"Research initiative, treatment action : RITA","volume":"28 2","pages":"56-72"},"PeriodicalIF":0.0,"publicationDate":"2018-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72568997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}