Doutorado em Ciência da Computação
URI Permanente para esta coleção
Navegar
Navegando Doutorado em Ciência da Computação por Por tipo de Acesso "Acesso Aberto"
Agora exibindo 1 - 6 de 6
Resultados por página
Opções de Ordenação
Item Uma solução baseada em economia colaborativa para escalar o teste de aplicações Android em dispositivos reais(Universidade Federal de Goiás, 2019-04-02) Faria, Kenyo Abadio Crosara; Vincenzi, Auri Marcelo Rizzo; http://lattes.cnpq.br/0611351138131709; Vincenzi, Auri Marcelo Rizzo; Leitão Júnior, Plínio de Sá; Soares, Fabrízzio Alphonsus Alves de Melo Nunes; Maldonado, José Carlos; Freitas, Eduardo Noronha de AndradeSoftware testing for mobile devices presents additional challenges compared to testing desktop and web applications, especially in fragmented environments such as the Android ecosystem. There are currently over 24 thousands different device models, with different screen sizes and densities, operating system versions, and other configurations that con- tribute to the instability of applications for this ecosystem. Several frameworks and TaaS platforms assist the validation of these type of applications, especially with regard to the construction and execution of UI tests. However, existing architectural limitations result in high-cost and low-diversity real devices to be used during Android apps validation. Inspired in this context and in the Collaborative Economy paradigm, this study proposes a disruptive architecture, which allows the execution of applications tests in an distribu- ted way, using idle devices around the world, reducing the cost of infrastructure with real devices at the same time with potential of generating a new market. Experiments have demonstrated the robustness of the architecture for performing UI tests on geographically distributed devices, and a financial analysis indicates a reduction of 85.67% in the infras- tructure cost of physical devices allocated for testing, while showing the viability of the built platform.Item Técnicas de otimização multiobjetivo e otimização estocástica para o roteamento de fluxos em redes(Universidade Federal de Goiás, 2019-03-22) Fernandes, Kátia Cilene Costa; Cardoso, Kleber Vieira; http://lattes.cnpq.br/0268732896111424; Pinto, Leizer de Lima; http://lattes.cnpq.br/0611031507120144; Pinto, Leizer de Lima; Cardoso, Kleber Vieira; Vieira, Flávio Henrique Teles; Bueno, Elivelton Ferreira; Abelém, Antônio Jorge GomesIn this work we are interested in optimization problems related to network flow routing. Three models and an exact and polynomial algorithm are presented. The first model is a bi-objective integer programming problem in which the objective functions refer to the load balancing of the network and the length of the paths through which the flows are routed. An exact and polynomial algorithm based on the -constraint technique is presented. The second model differs from the first one with respect to the weights of the flows and the qualities of the links. In these parameters can assume different values. The last model is a stochastic single-objective flow routing problem. It aims to minimize the bottleneck of the network, respecting a certain limit on the length of the paths through which flows are routed. In addition, the link qualities are random variables, which can be approximated by a discrete and finite set. Implementations were developed in C++ language using the CPLEX solver for the resolution of instances. Grid topologies and random topologies based on the Barabási-Albert model were used in our computational experiments. The network flow settings defined here are those commonly used in wireless sensor networks and wireless mesh networks. The analysis of computational results provides the decision maker valuable informations about which factors most affect the solutions.Item Estudo, definição e proposta de representação de interface web visando à atividade de teste de software(Universidade Federal de Goiás, 2016-04-01) Jorge, Rodrigo Funabashi; Vincenzi, Auri Marcelo Rizzo; Vincenzi, Auri Marcelo Rizzo; Camilo Júnior, Celso Gonçalves; Leitão Júnior, Plínio de Sá; Oliveira, Celso Socorro; Jubileu, Andrea PadovanThe main purpose of software engineering is to subsidy the software development, from its specification to its implementation and maintenance, by applying methods, processes and tools seeking for a higher quality software product. One of the activities to get the desired quality is software testing. This activity can become very complex, depending on the characteristics and dimensions of the software product under developed and thus, is subjected to various kinds of problems which, eventually, may result on a product with faults, jeopardizing its quality. Despite the complexity and limitations of testing, there are in the literature different techniques that can be used to generate test data to satisfy several testing criteria, aiming at to reduce the cost of testing. However, generation of test data is an undecidable problem due to the complexity, constraints, and size of programs. One of the factors that increase the complexity is the use of user interfaces (UI), present in many applications. This complexity is a result of the high number of available input combinations, making it virtually impossible to hold the UI tests manually. Among the alternatives that enable the automation of the most recognized and advantageous is the UI based testing models. This technique involves the construction of a model to abstract the UI elements, its interactions, and structure to be tested. From this model, the test data can be generated. However, a troublesome factor in this approach lies in building the model. This process can be costly and time consuming. Additionally, even after the effort, the model can be incomplete and may not represent precisely the actual characteristics of the application. When studying the state of the art for testing UI, we noted that there are tools that allow to perform such testing automatically. But they also have some limitations, mainly arising from the representation model adopted. Thus the purpose of this thesis is to propose a UI representation model that brings benefits over existing representations in today literature, evolving the state of art on this area. With the proposal of this model we can represent, with the greatest level of detail, a graphical interface for web software applications. A preliminary study comparing the model with others available in the literature, highlights the benefits achieved.Item Problema de particionamento em subgrafos complementares: complexidade e convexidade(Universidade Federal de Goiás, 2019-11-11) Nascimento, Julliano Rosa; Coelho, Erika Morais Martins; http://lattes.cnpq.br/9389487015938509; Castonguay, Diane; http://lattes.cnpq.br/4005898623592261; Castonguay, Diane; Coelho, Erika Morais Martins; Protti, Fábio; Szwarcfiter, Jayme Luiz; Pinto, Leizer de LimaIn this work, we introduce the PARTITION INTO COMPLEMENTARY SUBGRAPHS (COMP-SUB(Pi)) problem, which receives as input a graph H and an edge set property Pi, and the goal is determining whether is possible to decompose the graph H into complementary subgraphs G and \bar{G} such that the edge set M between G and \bar{G} satisfies property Pi. COMP-SUB(Pi) generalizes the recognition of complementary prisms problem, which is the case when Pi is a perfect matching between corresponding vertices of G and \bar{G}. When Pi is arbitrary, we show results for k-clique or k-independent set free graphs. On property P_\emptyset which considers M =\emptyset, we show that COMP-SUB(P_\emptyset) is GI-complete for chordal graphs, but can be solved efficiently for permutation, comparability, co- comparability and co-interval graphs. Furthermore, we obtain characterizations for some subclasses of chordal graphs. We also obtain results for Pi_{Kn,n} , the case when M has all the possible edges between G and \bar{G} and for Pi_{PERF}, the case which considers M as a perfect matching. In particular, we show that COMP-SUB(Pi_{PERF}) problem is GI-hard, and we obtain characterizations for this problem when the input graph H is a cograph, a chordal or a distance-hereditary graph. On the other hand, we address three parameters of the geodetic convexity for complementary prisms: the hull number, the geodetic number and the convexity number. We obtain results on the hull number for complementary prisms G\bar{G} when both G e \bar{G} are connected. On the second and third parameter, we show that the decision problems related to the geodetic number and convexity number are NP-complete even restricted to complementary prisms. We also establish lower bounds on the geodetic number for G\bar{G} when G or \bar{G} have simplicial vertices and we determine the convexity number for G\bar{G} when G is disconnected, or G is a cograph.Item FTMES@r: um método de localização de defeitos baseado em estratégias de execução de mutantes(Universidade Federal de Goiás, 2018-12-18) Oliveira, André Assis Lôbo de; Camilo Júnior, Celso Gonçalves; http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4736184D1; Camilo Júnior, Celso Gonçalve; Vincenzi, Auri Marcelo Rizzo; Rodrigues, Cássio Leonardo; Freitas, Eduardo Noronha de Andrade Freitas; Leitão, Plínio de SáFault localization has been one of the most manual and costly software debugging activities. The spectrum-based fault localization is the most studied and evaluated fault localization approach. Mutation-based fault localization is a promising approach to the efficacy of localization but with a high computational cost due to the executions between test cases and programs mutants. In this context, this thesis purposes FTMES@r: a fault localization method to reduce the computational MBFL cost while maintaining the efficacy of localization. Differing from all reduction techniques, FTMES@r optimizes two stages: i) the selection of program elements (SFilter@r) and ii) the execution of the mutants (FTMES). The SFilter@r component uses the accuracy of the SBFL approach in forming a smaller ranking by selecting the program elements up to a given position @r of the ranking of all elements. Thus, SFilter@r employs the first level of cost reduction of MBFL because the generation of mutants considers only the program elements of this reduced rank. In the mutants execution stage, the Failed-Test-Oriented Mutant Execution Strategy (FTMES) component applies the second level of cost reduction by running mutants only with the set of failed test cases (Tf) and using the mutants with the set of test cases that pass (Tp). The experimentation comprises a comparison of 10 localization techniques, 221 real defects, and 6 evaluation metrics. The results show that FTMES@r presents the best cost-benefit relationship among the studied techniques.Item Sobre alianças defensivas e ofensivas globais em alguns produtos de grafos e grafos simpliciais(Universidade Federal de Goiás, 2015-10-30) Silva, Leila Roling Scariot da; Dourado, Mitre Costa; http://lattes.cnpq.br/0841425239502177; Barbosa, Rommel Melgaço; http://lattes.cnpq.br/6228227125338610; Barbosa, Rommel Melgaço; Dourado, Mitre Costa; Federson, Fernando Marques; Rosa, Thierson Couto; Santos, José Plínio de OliveiraGiven a graph G, a defensive alliance of a set of vertices A⊆V(G) satisfying the condition that for each v ∈ A, |N[v] ∩ A| ≤ |N[v] − A|. The set S is an offensive alliance if the inaquality holds for every v ∈ N[S]−S. A alliance A is called global if is also a dominant set. In this paper, we establish lower bounds for Simplicial Graphs and further give closed formulas and upper bounds to decide the global, defensive, offensive, alliance numbers for lexicographic product of paths, cycles, stars and complete graphs. We establish a relationship to global defensive alliance numbers and complementary prism product to graphs.