Mestrado em Ciência da Computação (INF)
URI Permanente para esta coleção
Navegar
Navegando Mestrado em Ciência da Computação (INF) por Por Orientador "Barbosa, Rommel Melgaço"
Agora exibindo 1 - 6 de 6
Resultados por página
Opções de Ordenação
Item Planejamentos combinatórios construindo sistemas triplos de steiner(Universidade Federal de Goiás, 2011-08-26) Barbosa, Enio Perez Rodrigues; Barbosa, Rommel Melgaço; http://lattes.cnpq.br/6228227125338610Intuitively, the basic idea of Design Theory consists of a way to select subsets, also called blocks, of a finite set, so that some properties are satisfied. The more general case are the blocks designs. A PBD is an ordered pair (S;B), where S is a finite set of symbols, and B is a collection of subsets of S called blocks, such that each pair of distinct elements of S occur together in exactly one block of B. A Steiner Triple System is a particular case of a PBD, where every block has size only 3, being called triples. The main focus is in building technology systems. By resolvability is discussed as a Steiner Triple Systems is resolvable, and when it is not resolvable. This theory has several applications, eg, embeddings and even problems related to computational complexity.Item Mineração de dados para classificação e caracterização de alguns vinhos Vitis Vinífera da América do Sul(Universidade Federal de Goiás, 2016-12-21) Costa, Nattane Luíza da; Barbosa, Rommel Melgaço; http://lattes.cnpq.br/6228227125338610; Barbosa, Rommel Melgaço; Leitão Júnior, Plínio de Sá; Guimarães, Marco PauloOne concern regarding the production and marketing of wines is to ensure that the product is not adulterated in relation to the origin and type of grape used in its production. This is due to the high cost involved in production and due to interest of consumers in obtaining legitimate products. In this context, the techniques of data mining allow us to verify the relationship between the chemical properties of wines and their label regarding origin or type of grape. This study presents a method for classification and characterization of wines with the application of data mining to the chemical properties that describe the functionality of wines. Five applications were carried out involving Cabernet Sauvignon, Carménère, Syrah, Tannat and Merlot varieties produced in Argentina, Brazil, Chile and Uruguay: the classification of Cabernet Sauvignon according to geographic region of production, Brazil and Chile; the classification of Tannat wines from the southern regions of Uruguay and southern Brazil, regions in close proximity and relevant to the production of Tannat wines; the classification of Syrah wines from Argentina and Chile, which are close regions and have a significant production in the countries covered; the classification of Merlot wines associated with the four countries to draw a profile of the relevant variables for the classification of wines for each set of two countries; and the classification of wines of the Chilean Carménère and Merlot varieties, which aim to investigate a profile of discrimination between varieties. The results obtained in all applications are promising, with a high predictive performance of 88%. The combination of variable selection associated with the classifiers Support Vector Machines and Artificial Neural Networks made it possible to define classification models capable of predicting new samples in addition to identifying groups of variables responsible for the classification.Item Alianças defensivas em grafos(Universidade Federal de Goiás, 2010-03-26) Dias, Elisângela Silva; Barbosa, Rommel Melgaço; http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4786013D6; Martins, Wellington Santos; http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4782112U1; Tronto, Íris Fabiana de Barcelos; http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4707515J4A defensive alliance in graph G = (V;E) is a set of vertices S V satisfying the condition that every vertex v 2 S has at most one more neighbor in V S than S. Due to this type of alliance, the vertices in S together defend themselves to the vertices in V S. This dissertation introduces the basic concepts for the understanding of alliances in graphs, along with a variety of alliances and their numbers and provides some mathematical properties for these alliances, focusing mainly on defensive alliances in graphs. It shows theorems, corollaries, lemmas, propositions and observations with appropriate proofs with respect to the minimum degree of a graph G d(G), the maximum degree D(G), the algebraic connectivity μ, the total dominanting set gt(G), the eccentricity, the edge connectivity l(G), the chromatic number c(G), the (vertex) independence number b0(G), the vertex connectivity k(G), the order of the largest clique w(G) and the domination number g(G). It also shows a generalization of defensive alliances, called defensive kalliance, and the definition and properties of a security set in G. A secure set S V of graph G = (V;E) is a set whose every nonempty subset can be successfully defended of an attack, under appropriate definitions of “attack” and “defence”.Item Alianças defensivas em grafos(Universidade Federal de Goiás, 2010-03-26) Dias, Elisângela Silva; Barbosa, Rommel Melgaço; http://lattes.cnpq.br/6228227125338610; Barbosa, Rommel Melgaço; Martins, Wellington Santos; Tronto, Íris Fabiana de BarcelosA defensive alliance in graph G = (V,E) is a set of vertices S ⊆V satisfying the condition that every vertex v ∈ S has at most one more neighbor in V − S than S. Due to this type of alliance, the vertices in S together defend themselves to the vertices in V − S. This dissertation introduces the basic concepts for the understanding of alliances in graphs, along with a variety of alliances and their numbers and provides some mathematical properties for these alliances, focusing mainly on defensive alliances in graphs. It shows theorems, corollaries, lemmas, propositions and observations with appropriate proofs with respect to the minimum degree of a graph G δ(G), the maximum degree ∆(G), the algebraic connectivity µ, the total dominanting set γt(G), the eccentricity, the edge connectivity λ(G), the chromatic number χ(G), the (vertex) independence number β0(G), the vertex connectivity κ(G), the order of the largest clique ω(G) and the domination number γ(G). It also shows a generalization of defensive alliances, called defensive k alliance, and the definition and properties of a security set in G. A secure set S ⊆ V of graph G = (V,E) is a set whose every nonempty subset can be successfully defended of an attack, under appropriate definitions of “attack” and “defence”.Item Mineração de dados para o reconhecimento da origem e do tipo de alimentos e outras substâncias com base em sua composição química(Universidade Federal de Goiás, 2016-03-29) Maione, Camila; Barbosa, Rommel Melgaço; http://lattes.cnpq.br/6228227125338610; Barbosa, Rommel Melgaço; Noronha, Adriana Backx; Leitão Júnior, Plínio de SáA practical way to characterize consumable substances is through its chemical elements in its composition and theirs concentrations. By using these elements as feature variables, it is possible to arrange these substances samples in a data matrix in which data mining and statistical techniques can be applied for predictive analysis. The classification of consumable substances based on its chemical components is an interesting problem and provides useful information for various purposes, as: recognition of geographical origin of a substance; validation and authenticity; determination of the characteristics of a product which can aid companies in the quality control and preservation; differentiation of categories of a product, and others. This study presents a methodology for predictive analysis of substances and food based on its chemical components, using data mining concepts and techniques allied to ICPMS. Four applications of the proposed methodology are described: recognition of the geographical origin of Brazilian white rice produced in São Paulo and Goiás states; differentiation of organic and conventional Brazilian grape juice; differentiation of organic and conventional Brazilian chocolate, and analysis of its toxic and essential elements; recognition of the source of ecstasy tablets apprehended in two cities from Sao Paulo state, Ribeirão Preto and Campinas. For all applications presented, the classification models obtained showed high predictive performance (over 85%), which attest the efficiency of the proposed methodology, and the variable selection techniques used helped us to identify the chemical elements which are more important to the differentiation of the analyzed samples. For the purpose of distinguishing food samples into organic and conventional, our approach is pioneer and yielded good results.Item Sobre conjuntos dominantes eficientes em grafos(Universidade Federal de Goiás, 2009-03-12) Oliveira, Rommel Teodoro de; Barbosa, Rommel Melgaço; http://lattes.cnpq.br/6228227125338610Given a graph G = (V;E) and a set of vertices D V, a vertice v 2 V is dominated by D if jN[v] \ Dj 1. When jN(v) \ Dj = 1 for all v 2 V, G is efficiently dominable. A generalization of this concept is called efficient multiple domination, which requires all vertices must be dominated by a set D V exactly k times. The aim of this dissertation is to study these topics, describing the theoretical knowledge needed for advanced researches. For this reason, many of the theorems and its proofs are detailed. Furthermore, some results on the efficient multiple domination are presented, including bounds for the size of efficient k-dominating sets, the complement and iterated line graphs of efficiently (r + 1)-dominable r-regular graphs and a N P-completeness proof for the efficient multiple domination problem in arbitrary graphs. It is expected that this work contribute to the development of future researches on the efficient domination and in the resolution of some open problems.