DSpace Coleção:http://repositorio.uem.br:8080/jspui/handle/1/10642024-03-29T06:23:52Z2024-03-29T06:23:52ZWatershed com marcadores propagados por casamento de padrões de pontos via correspondência de grafosOrtoncelli, André Robertohttp://repositorio.uem.br:8080/jspui/handle/1/24932018-10-18T19:11:14Z2013-01-01T00:00:00ZTítulo: Watershed com marcadores propagados por casamento de padrões de pontos via correspondência de grafos
Autor(es): Ortoncelli, André Roberto
Abstract: Watershed from propagated markers is a generic method to interactive segmentation of objects in image sequences, through the combination of classical watershed from markers technique to motion estimation. This dissertation introduces two variations of the watershed from propagated markers, supported by graph matching methods. Basically, both variations consists in: (i) the markers are propagated by a graph matching method that computes, by minimizing a cost function, the matching between each edge of a graph (that represents markers created around the segmentation mask of the current frame) with one edge of another graph that denotes the hierarchical segmentation of the next frame of the sequence. Each edge resulting from this matching is used as a pair of markers applied to the segmentation of the next frame; and (ii) first, a pre-segmentation mask is computed for the next frame of the sequence, this mask is computed by a graph matching method for image segmentation that computes the matching between two graphs: one which represents the model of the object to be segmented and other which represents the result of the hierarchical image segmentation. Final markers are created around the pre-segmentation mask. Both methods were submitted to the application of a benchmark that quantitatively assesses assisted object segmentation methods in image sequences. Such benchmark was applied to as a comparison tool among the results of the two proposals and other segmentation methods, such as other watershed from propagated markers variations and semi-automatic segmentation methods found in literature as well. Experimental results shows that both proposals in this dissertation are promising ones since they are robust and provides a substantial gain in the segmentation error reduction.2013-01-01T00:00:00ZVNS_BLS, um algoritmo com busca locais simultâneas para a resolução do problema de escalonamento de motorista de transporte públicoMedeiros, Mariane Affonsohttp://repositorio.uem.br:8080/jspui/handle/1/54262019-08-27T13:44:28Z2018-01-01T00:00:00ZTítulo: VNS_BLS, um algoritmo com busca locais simultâneas para a resolução do problema de escalonamento de motorista de transporte público
Autor(es): Medeiros, Mariane Affonso
Abstract: Resumo: O Problema de Escalonamento de Motoristas de Transporte Público consiste em construir escalas de trabalho para motoristas de uma empresa de transporte público, de forma que as escalas geradas respeitem restrições impostas e minimizem custos operacionais. Este trabalho aborda instâncias de dados de grande escala oriundas de casos reais de empresa de transporte público. A utilização de meta-heurísticas para resolução deste problema é bastante explorada, uma vez que são capazes de encontrar boas soluções em um tempo computacional razoável. No entanto, dependendo da dimensão das instâncias do problema o tempo computacional consumido para estes casos pode ser elevado mesmo utilizando técnicas heurísticas. Por outro lado, com o crescente desenvolvimento de novos hardwares, há cada vez mais computadores com multinúcleos, o que segure o desenvolvimento e estudo de novas técnicas heurísticas que explore estes recursos de processamento. Sendo assim, este trabalho propõe o VNS_BLS, uma meta-heurística baseada em VNS que utiliza 36 buscas locais diferentes executadas de forma simultânea. O VNS_BLS possui quatro versões que se diferem em questão de comunicação com memória compartilhada e ociosidade. O algoritmo foi testado com instâncias de dados reais com 412 até 3478 tarefas. Os resultados obtidos pelas versões foram comparados entre elas e com outras abordagens da literatura. Com base nos experimentos realizados foi possível perceber que nem todas as 36 buscas locais do algoritmo são de fato efetivas na melhoria da solução. Notou-se, também, que comparado com outras propostas o VNS_BLS se mostra competitivo, pois alcança bons resultados em menor tempo computacional; Abstract: The Bus Driver Scheduling Problem consists of construct work schedules for drivers of a public transport company, that the scales generated respect imposed constraints and minimize operation costs. This paper addresses large-scale data instances from real cases of a public transport company. The use of metaheuristics to solve this problem is well explored, since metaheuristics are able to find good solutions in a reasonable computational time. However depending on the size of instances of the problem the computational time consumed for these cases can be high, even using heuristic techniques. However, with the increasing development of new hardware, there are more computers with multi-cores. This increase the need to development and study of new heuristic techniques that exploits these processing resources. Thus, this work proposes VNS_BLS, a VNS-based metaheuristic that uses 36 different local searches performed simultaneously. VNS_BLS has four versions that differ in terms of communication with shared memory and idleness. The algorithm was tested with real data instances with 412 to 3478 tasks. The results obtained by the versions were compared between them and with other approaches in the literature. Based on the experiments was possible to realize that not all 36 local searches of algorithm are effective in improving the solution. It was also noticed that, compared to other proposals, the VNS_BLS is competitive because achieves good results in less computational time
Descrição: Orientador: Prof. Dr. Ademir Aparecido Constantino; Dissertação (mestrado em Ciência da Computação)--Universidade Estadual de Maringá, Centro de Tecnologia, Departamento de Informatica, 20182018-01-01T00:00:00ZVMTools-RA : uma arquitetura de referência para ferramentas de variabilidade de softwareAllian, Ana Paulahttp://repositorio.uem.br:8080/jspui/handle/1/56202019-11-05T21:05:45Z2016-01-01T00:00:00ZTítulo: VMTools-RA : uma arquitetura de referência para ferramentas de variabilidade de software
Autor(es): Allian, Ana Paula
Abstract: Resumo: Gerenciamento de variabilidade (GV) possibilita adaptação de sistemas de software para contextos específicos de uma forma pré-planejada, lidando com semelhanças e variabilidade desses sistemas. GV tem sido considerada em vários tópicos de pesquisa e foi consolidada principalmente na área de Linha de Produto de Software (LPS). Várias ferramentas de variabilidade de software têm sido propostas com o objetivo de apoiar empresas na customização de novos produtos de software. Nota-se que a indústria tem adotado diferentes estratégias para gerenciar variabilidades, inclusive produzir suas próprias soluções resultando em sobreposição parcial de funcionalidades dessas ferramentas; além de subutilização das capacidades de tais ferramentas. Por exemplo, as atividades de modelar variabilidades são executadas em ferramentas de variabilidade de software e em editores de texto, tornando o GV inconsistente. Além disso, as soluções proprietárias mais conhecidas alavancam os custos de uso e adoção dessas ferramentas. A padronização de ferramentas de variabilidade de software é necessária, pois permite que empresas desenvolvam suas próprias ferramentas por meio de técnicas documentadas e testadas. Além disso, permite manter a consistência na terminologia usada com base no padrão proposto, aumentando a reusabilidade e convergindo para um conhecimento sólido sobre GV. Iniciativas para padronizar o GV em LPS foram estabelecidas como as normas ISO/IEC 26550 e ISO/IEC 26555, que fornecem modelos de referência e processos que envolvem LPS e GV. No entanto, modelos de referência são altamente abstratos e geralmente não estão diretamente ligado às práticas de implementação. Em outra perspectiva, arquitetura de referência é um tipo especial de arquitetura de software e reúne conhecimento de domínios específicos, facilitando o desenvolvimento, padronização e evolução de sistemas de software. Para mitigar a necessidade de um padrão para ferramentas de variabilidade de software pode-se adotar tal conceito. Portanto, o objetivo deste trabalho é especificar uma arquitetura de referência para ferramentas de variabilidade de software. Assim, o principal resultado é o estabelecimento da VMTools-RA, uma arquitetura de referência que reúne o conhecimento e a experiência de GV fornecendo mais confiança na tecnologia, evolução e reuso. Para tanto, foi utilizado o processo ProSA-RA, que sistematiza o projeto, representação e avaliação de arquiteturas de referência. Tal proposta foi avaliada por meio de um estudo qualitativo utilizando um checklist, e por um exemplo de aplicação com a instanciação arquitetural de uma ferramenta de variabilidade de software baseada na VMTools-RA. Os resultados empíricos preliminares fornecem indícios de que a VMTools-RA é uma arquitetura de referência viável para o desenvolvimento de novas ferramentas de variabilidade de software; Abstract: Variability Management (VM) makes it possible to easily adapt software systems for specific contexts in a preplanned manner, dealing with commonalities and variabilities of these systems. VM has been considered in several research topics and was mainly consolidated by the Software Product Line (SPL) area. A diversity of software variability tools has been proposed to support companies in the customization of new software products. It is observed industry has adopted different strategies to manage variabilities, including produce its own solutions resulting in partially overlapped of functionality of such tools; as well as underutilization of such solutions without using all of the tools capacities. For example, the variability model activities are performed in software variability tools and text editors, resulting in inconsistencies in the VM activity. Furthermore, the most known proprietary solutions leverage the costs to use and adopt such VM tools. The standardization of software variability tools is necessary, because it allows companies to develop their own tools through documented and tested techniques. Besides, it allows to maintain consistency in the terminology used based on the proposed standard, increasing the reuse, and converging to a solid knowledge about VM. Standardization efforts for VM in the SPL context have been established, such as ISO / IEC 26550 and ISO / IEC 26555 standards, which provide reference models and processes involving SPL and VM. However, reference models are highly abstract and they are not usually directly connected to implementation practices. In another perspective, reference architecture is a special type of software architecture and gathers knowledge from specific domains, facilitating the development, standardization, and evolution of software systems. To mitigate the standard necessity for software variability tools the concept of reference architecture can be adopted. Therefore, the purpose of this work is to specify a reference architecture to software variability tools. Hence, the main result is the establishment of VMTools-RA, a reference architecture that combines knowledge and experience in VM providing more confidence in the technology, evolution, and reuse. Therefore, we used the ProSA-RA process, which systematizes the project, representation, and evaluation of reference architectures. Such proposal was evaluated by a qualitative study using a checklist, and with a sample application by instantiating a software variability tool based on the VMTools-RA. The preliminary empirical results provide evidences that VMTools-RA is a viable reference architecture for developing new software variability tools
Descrição: Orientador: Prof. Dr. Edson Alves de Oliveira Junior; Dissertação (mestrado em Ciência da Computação)--Universidade Estadual de Maringá, 20162016-01-01T00:00:00ZViabilidade do processo de tratamento anaeróbio do resíduo da industrialização da mandioca em sistema de duas fasesSampaio, Brasília Maria Lofiegohttp://repositorio.uem.br:8080/jspui/handle/1/38522024-03-25T20:53:53Z1996-01-01T00:00:00ZTítulo: Viabilidade do processo de tratamento anaeróbio do resíduo da industrialização da mandioca em sistema de duas fases
Autor(es): Sampaio, Brasília Maria Lofiego
Abstract: The propose of this work was to analyse the feasibility of the anaerobic process performance to treat the manioc industry wastewater, "manipueira", under ambient temperature. This anaerobic process consisted of the separation of the acidogenic stage from the methanogenic stage, operating in series continuously. The wastewater used (manipueira) was obtained from the maniocflour industrial process of the INDEMIL, industry which is located in Formosa, district of Paranavaí, Northwest of Paraná. The system was essentially constituted by two reactors connected in series. In the first reactor the acid stage took place and in the second the methane phase occurred. The acid reactor start occurred after its inoculation with anaerobic sludge from Maringá's Sewer Treatment Station. The acid reactor with perfect mixture characteristics was made from acrylic material and had a volume of 5 litres. This reactor was operated under ambient temperature and pH between 5.0 and 5.5. Its hydraulic retention time was 1 day. Three affluent streams, "manipueira" having COD concentration of 3,000, 4,000 and 6,000 mg/L, were tested in this reactor. The reactor homogenised by a magnetic agitation. In the methane reactor the inoculation occurred with the same sludge used in the acid reactor. This methanogenic reactor had a hybrid characteristic between a CSTR and fixed bed reactor. The total reactor volume was 20 litres and its fixed bed portion consisted of 50 % of this volume, which was filled with rigid dried bamboo packing (2 cm x 2 cm size) This hybrid reactor was continuously fed with the acid reactor effluent and was operated under ambient temperature and pH varying from 7.0 to 7.5. During the experiment, at the inlets and outlets of both reactors, the following parameters were accompanied and controlled: pH, COD, alkalinity, volatile acid, free cyanide, volume and composition of produced gases. The acid reactor operated during a period of 255 days, the methane reactor for 110 days and the complete system of anaerobic treatment for 110-day period. The acid reactor allowed an average percentage of COD reduction of 31.7%. with a medium increase of the volatile acidity of 42,4%. The free cyanide concentration suffered a reduction at about 90.3%. The alkalinity in the acid reactor was enough to enable the tamponment near to that required in the methanogenesis. A good level of stability was observed in the methane reactor. This was evidenced by the regularity of the reduction percentage of COD, free cyanide, volatile acid and methane percentage produced in the gases mixture. In this reactor the COD, volatile acid and free cyanide average of removal were 89%, 92,6% and 61,2%, respectively. The gas volume produced by the reactor was 0.5L per gram of removal COD, with a methane average percentage at about 64%. The results obtained for the process as a whole, under ambient temperature, are similar to those obtained in systems with controlled temperature. The COD, volatile acid and free cyanide average percentages of reduction were 94%, 87% and 96.7%, respectively. This results allow to consider as feasible the process of anaerobic treatment in two stages , which may have a great potential of application in the treatment of other organic effluents.1996-01-01T00:00:00Z