INF - Instituto de Informática

URI Permanente desta comunidade

http://200.137.215.59/tede/handle/tde/145

Navegar

Agora exibindo 1 - 7 de 7

Uso de Seleção de Características da Wikipedia na Classificação Automática de Textos.
(Universidade Federal de Goiás, 2012-09-20) Alvarenga, Leonel Diógenes Carvalhaes; Rosa, Thierson Couto; http://lattes.cnpq.br/4414718560764818
The traditional methods of text classification typically represent documents only as a set of words, also known as "Bag of Words"(BOW). Several studies have shown good results on making use of thesauri and encyclopedias as external information sources, aiming to expand the BOW representation by the identification of synonymy and hyponymy relationships between present terms in a document collection. However, the expansion process may introduce terms that lead to an erroneous classification. In this paper, we propose the use of feature selection measures in order to select features extracted from Wikipedia in order to improve the efectiveness of the expansion process. The study also proposes a feature selection measure called Tendency Factor to One Category (TF1C), so that the experiments showed that this measure proves to be competitive with the other measures Information Gain, Gain Ratio and Chisquared, in the process, delivering the best gains in microF1 and macroF1, in most experiments. The full use of features selected in this process showed to be more stable in assisting the classification, while it showed lower performance on restricting its insertion only to documents of the classes in which these features are well punctuated by the selection measures. When applied in the Reuters-21578, Ohsumed first - 20000 and 20Newsgroups collections, our approach to feature selection allowed the reduction of noise insertion inherent in the expansion process, and improved the results of use hyponyms, and demonstrated that the synonym relationship from Wikipedia can also be used in the document expansion, increasing the efectiveness of the automatic text classification.
Uma estratégia para a avaliação e evolução de teste funcional de software
(Universidade Federal de Goiás, 2012) Arantes, Gilmar Ferreira; Leitão Júnior, Plínio de Sá; http://lattes.cnpq.br/4480334653242457
Software Testing is part of software quality assurance activities. It aims to uncover the presence of defects, that can be inserted in various stages of software develop- ment. Several techniques are used in the testing activity, highlighting the functional ones, which derive test requirements from the software specification. The research faces the problem of how to evolve the functional testing strategies with low costs, relative to the amount of test cases needed, without compromising the number of uncovered defects. A systematic review was planned and executed, based on formu- lated questions so as to answer the research problem. Such review supported the definition of a new criterion for functional testing, the Systematic Functional Test with Decision Table Application (TFS-DT), which is an extension of Systematic Software Testing (TFS) and provides joint application of criteria: Partitioning Equi- valence Classes, Boundary Value Analysis and Decision Table. The TFS-DT defines a strategy based on a set of requirements and has a process in order to apply the strategy in a systematic manner. Three empirical studies were applied with promi- sing results compared to TFS: all of them reduces at least half the adequated set without impact on the number of uncovered defects.
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=K4707515J4
A 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”.
Uma arquitetura de software interativo para apoio à decisão na modelagem e análise do tráfego urbano
(Universidade Federal de Goiás, 2008-09-23) Jradi, Walid Abdala Rfaei; Hall, Bryon Richard; http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4789659E4; Nascimento, Hugo Alexandre Dantas do; http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4798562T1; Aloise, Dario José; http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4798548Y2; Oliveira, Juliano Lopes de; http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4728742P0
The present work proposes an architecture of a Decision Support System for modelling, simulating and visualizing urban traffic, using a mathematical model adjusted to the reality of the Brazilian transit, as well as an appropriate choice of data for this context. To prove the viability of the architecture, an interactive tool, called PET-Gyn, was implemented, with a Web graphical interface. The simulation of the traffic was based on algorithms already existing in the literature, with proven effectiveness, but with adaptations that had been shown necessary. The data applied to the urban traffic is composed of information obtained from GoogleMaps API, data on the road mesh and the collection of the traffic demands measured in a region of the city of Goiânia-GO. The tool allows the visualization of basic information about the traffic in a city and offers forms of interaction to simulate the effect of possible reorganizations of the road net.
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/6228227125338610
Given 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.
Um benchmark para avaliação de técnicas de busca no contexto de análise de Mutantes sql
(Universidade Federal de Goiás, 2013-08-02) Queiroz, Leonardo Teixeira; Camilo Júnior, Celso Gonçalves; http://lattes.cnpq.br/6776569904919279; Rodrigues, Cássio Leonardo; http://lattes.cnpq.br/2590620617848677
One of the concerns in test Applications Database (ADB) is to keep the operating and computational costs low. In the context of the ADB, one way to collaborate with this assumption is ensuring that the Test Databases (TDB) are small, but effective in revealing defects of SQL statements. Such bases can be constructed or obtained by the reduction of Production Databases (PDB). In the reductions case, there are combinatorial aspects involved that require the use of a specific technique for their implementation. In this context, in response to a deficiency identified in the literature, this work aims to build and provide a benchmark to enable performance evaluation, using SQL Mutation Analysis, any search technique that intends to conduct databases reductions. Therefore, to exercise the search techniques, the benchmark was built with two scenarios where each one is composed of a PDB and a set of SQL statements. In addition, as a reference for search techniques, it also contains performance of data database randomly reduced. As a secondary objective of this work, from the experiments conducted in the construction of the benchmark, analyses were made with the results obtained to answer important questions about what factors are involved in the complexity of SQL statements in the context of Test Mutation. A key finding in this regard was on the restrictiveness of SQL commands, and this is the factor that most influences the complexity of statements.
Teste funcional sistemático estendido: uma contribuição na aplicação de critérios de teste caixa-preta
(Universidade Federal de Goiás, 2011-04-19) Vidal, Adriana Rocha; Leitão Júnior, Plinio de Sa; http://lattes.cnpq.br/4480334653242457; Vincenzi, Auri Marcelo Rizzo; http://lattes.cnpq.br/0611351138131709
Building software involves a process composed of activities and methods. Even following these activities and using the proposed methods the resultant product may have some deviation with respect to its functional and nonfunctional requirements, not corresponding to the expected features. To minimize such problems, the test activity aims to ensure both the construction of the correct product and its correct construction. Since testing is considered a costly activity, research are conducted aiming at to make it feasible. This work ts in this context, in order improve the selection of test cases, thus increasing the quality of software products and the performance of testing guideline. It is interesting to note that, testing guideline is a fundamental artifact of the testing process and consists of test cases that, by de nition, execute a particular functionality of the program or check the suitability of the product over its speci ed requirements. Since the quality of the selected test cases have a great impact on the quality of the nal product, this work introduces the Extended Systematic Functional Test (ESFT) as a way to systematize the development and selection of test cases based on functional testing. A web system and a testing guideline used in certi cation were assessed using the ESFT in order to demonstrate the applicability and possible contributions of its use in terms of defect detection. The results are promising since the systematization, increases the number of selected test data, improves the detection of defects, and allow to justify why a particular test data is selected based on functional criteria.

Navegar

Navegando INF - Instituto de Informática por Por tipo de Acesso "Acesso aberto"

Resultados por página

Opções de Ordenação