Spelling suggestions: "subject:"[een] THEORY OF COMPUTATION"" "subject:"[enn] THEORY OF COMPUTATION""
1 |
Analysis of machine learning algorithms on bioinformatics data of varying qualityUnknown Date (has links)
One of the main applications of machine learning in bioinformatics is the construction of classification models which can accurately classify new instances using information gained from previous instances. With the help of machine learning algorithms (such as supervised classification and gene selection) new meaningful knowledge can be extracted from bioinformatics datasets that can help in disease diagnosis and prognosis as well as in prescribing the right treatment for a disease. One particular challenge encountered when analyzing bioinformatics datasets is data noise, which refers to incorrect or missing values in datasets. Noise can be introduced as a result of experimental errors (e.g. faulty microarray chips, insufficient resolution, image corruption, and incorrect laboratory procedures), as well as other errors (errors
during data processing, transfer, and/or mining). A special type of data noise
called class noise, which occurs when an instance/example is mislabeled. Previous
research showed that class noise has a detrimental impact on machine learning algorithms (e.g. worsened classification performance and unstable feature selection). In
addition to data noise, gene expression datasets can suffer from the problems of high
dimensionality (a very large feature space) and class imbalance (unequal distribution
of instances between classes). As a result of these inherent problems, constructing accurate classification models becomes more challenging. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2015. / FAU Electronic Theses and Dissertations Collection
|
2 |
Machine learning techniques for alleviating inherent difficulties in bioinformatics dataUnknown Date (has links)
In response to the massive amounts of data that make up a large number of bioinformatics datasets, it has become increasingly necessary for researchers to use computers to aid them in their endeavors. With difficulties such as high dimensionality, class imbalance, noisy data, and difficult to learn class boundaries, being present within the data, bioinformatics datasets are a challenge to work with. One potential source of assistance is the domain of data mining and machine learning, a field which focuses on working with these large amounts of data and develops techniques to discover new trends and patterns that are hidden within the data and to increases the capability of researchers and practitioners to work with this data. Within this domain there are techniques designed to eliminate irrelevant or redundant features, balance the membership of the classes, handle errors found in the data, and build predictive models for future data. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2015. / FAU Electronic Theses and Dissertations Collection
|
3 |
Robust non-linear control through neuroevolutionGomez, Faustino John, January 2003 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2003. / Vita. Includes bibliographical references. Available also from UMI Company.
|
4 |
Bounds on computation from physical principlesLee, Ciaran M. January 2017 (has links)
The advent of quantum computing has challenged classical conceptions of which problems are efficiently solvable in our physical world. This raises the general question of what broad relationships exist between physical principles and computation. The current thesis explores this question within the operationally-defined framework of generalised probabilistic theories. In particular, we investigate the limits on computational power imposed by simple physical principles. At present, the best known upper bound on the power of quantum computers is that <b>BQP</b> is contained in <b>AWPP</b>, where <b>AWPP</b> is a classical complexity class contained in PP. We define a circuit-based model of computation in the above mentioned operational framework and show that in theories where local measurements suffice for tomography, efficient computations are also contained in <b>AWPP</b>. Moreover, we explicitly construct a theory in which the class of efficiently solvable problems exactly equals <b>AWPP</b>, showing this containment to be tight. We also investigate how simple physical principles bound the power of computational paradigms which combine computation and communication in a non-trivial fashion, such as interactive proof systems. Additionally, we show how some of the essential components of computational algorithms arise from certain natural physical principles. We use these results to investigate the relationship between interference behaviour and computational power, demonstrating that non-trivial interference behaviour is a general resource for post-classical computation. We then investigate whether post-quantum interference is a resource for post-quantum computation. Sorkin has defined a hierarchy of possible post-quantum interference behaviours where, informally, the order in the hierarchy corresponds to the number of paths that have an irreducible interaction in a multi-slit experiment. In quantum theory, at most pairs of paths can ever interact in a fundamental way. We consider how Grover's speed-up depends on the order of interference in a theory, and show that, surprisingly, the quadratic lower bound holds regardless of the order of interference.
|
5 |
Entanglement Transformations And Quantum Error CorrectionGul, Yusuf 01 July 2008 (has links) (PDF)
The main subject of this thesis is the investigation of the transformations of pure
multipartite entangled states having Schmidt rank 2 by using only local operations
assisted with classical communications (LOCC). A new parameterization is used for
describing the entangled state of p particles distributed to p distant, spatially separated
persons. Product, bipartite and truly multipartite states are identified in this new
parametrization. Moreover, alternative parameterizations of local operations carried
out by each party are provided. For the case of a deterministic transformation to
a truly multipartite final state, one can find an analytic expression that determines
whether such a transformation is possible. In this case, a chain of measurements by
each party for carrying out the transformation is found. It can also be seen that,
under deterministic LOCC transformations, there are some quantities that remain
invariant. For the purpose of applying the results of this thesis in the context of the
quantum information and computation, brief reviews of the entanglement purification,
measurement based quantum computation and quantum codes are given.
|
6 |
Algoritmos para o problema de particionamento / Algorithms for partitioning problemFaleiros, Thiago de Paulo 17 August 2018 (has links)
Orientador: Eduardo Candido Xavier / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-17T07:52:55Z (GMT). No. of bitstreams: 1
Faleiros_ThiagodePaulo_M.pdf: 2870028 bytes, checksum: fc82c1cba0951230720985bb3a712fd0 (MD5)
Previous issue date: 2010 / Resumo: Investigamos Problemas de Particionamento de objetos que têm relações de similaridade entre si. Instâncias desses problemas podem ser representados por grafos, em que objetos são vértices e a similaridade entre dois objetos é representada por um valor associado à aresta que liga os objetos. O objetivo do problema é particionar os objetos de tal forma que objetos similares pertençam a um mesmo subconjunto de objetos. Nosso foco é o estudo de algoritmos para clusterização em grafos, onde deve-se determinar clusteres tal que arestas ligando vértices de clusteres diferentes tenham peso baixo e ao mesmo tempo as arestas entre vértices de um mesmo cluster tenha peso alto. Problemas de particionamento e clusterização possuem aplicações em diversas áreas, como mineração de dados, recuperação de informação, biologia computacional, entre outros. No caso geral estes problemas são NP-Difíceis. Nosso interesse é investigar algoritmos eficientes (com complexidade de tempo polinomial) e que gerem boas soluções, como Heurísticas, Metaheurísticas e Algoritmos de Aproximação. Dentre os algoritmos estudados, implementamos os mais promissores e fazemos uma comparação de seus resultados utilizando instâncias geradas computacionalmente. Por fim, propomos um algoritmo que utiliza a metaheurística GRASP para o problema considerado e mostramos que, para as instâncias de testes geradas, nosso algoritmo obtém melhores resultados / Abstract: In this work we investigate Partitioning Problems of objects for which a similarity relations is defined. Instance to these problems can be represented by graphs where vertices are objects, and the similarity between two objects is represented by a value associated with an edge that connects objects. The problem objective is to partition the objects such that similar objects belong to the same subset of objects. We study clustering algorithms for graphs, where clusters must be determined such that edges connecting vertices of different clusters have low weight while the edges between vertices of a same cluster have high weight. Partitioning and clustering problems have applications in many areas, such as data mining, information retrieval, computational biology, and others. Many versions of these problems are NP-Hard. Our interest is to study eficient algorithms (with polynomial time complexity) that generate good solutions, such as Heuristics, Approximation Algorithms and Metaheuristics. We implemented the most promising algorithms and compared their results using instances generated computationally. Finally, we propose a GRASP based algorithm for the partition and clustering problem and show that, for the generated test instances, our algorithm achieves better results / Mestrado / Mestre em Ciência da Computação
|
7 |
Grafos pfaffianos e problemas relacionados / Pfaffian graphs and related problemsMiranda, Alberto Alexandre Assis 15 August 2018 (has links)
Orientador: Claudio Leonardo Lucchesi / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-15T06:54:51Z (GMT). No. of bitstreams: 1
Miranda_AlbertoAlexandreAssis_D.pdf: 571362 bytes, checksum: bd3600cbf8fe0c2875d8e5c60b6abfd3 (MD5)
Previous issue date: 2009 / Resumo: A área de grafos Pfaffianos apresenta muitos problemas em aberto. Nesta tese resolvemos dois problemas sobre grafos Pfaffianos. O primeiro problema resolvido é a obtenção de um algoritmo polinomial para reconhecimento de grafos quase-bipartidos Pfaffianos. Além disso, estendemos tanto o algoritmo como a caracterização de grafos quase-bipartidos Pfaffianos para a classe dos grafos meio-bipartidos. O segundo resultado é a obtencão de vários resultados estruturais básicos sobre grafos k-Pfaffianos. Utilizando esses resultados, obtivemos um contra-exemplo para a conjectura de Norine, que afirma que o número Pfaffiano de todo grafo é uma potência de quatro: apresentamos um grafo cujo numero Pfaffiano é 6 / Abstract: The area of Pfaffian graphs contains many open problems. In this thesis, we solve two problems related to Pfaffian graphs. The first result is a polynomial time algorithm to recognize near-bipartite Pfaffian graphs. Moreover, we extend this algorithm and the characterization of near-bipartite Pfaffian graphs to the class of half-bipartite graphs. The second result is obtaining several basic structural results concerning k-Pfaffian graphs. Using these results, we obtained a counter-example to Norine's conjecture, which states that the Pfaffian number of a graph is always a power of four: we present a graph whose Pfaffian number is 6 / Doutorado / Matematica Discreta e Combinatoria / Doutor em Ciência da Computação
|
8 |
Algoritmos aproximados para cobertura de objetos geométricos por discos / Approximation algorithms for coverage of geometric objects by disksSasaki, Anderson Toshiyuki, 1988- 25 August 2018 (has links)
Orientadores: Pedro Jussieu de Rezende, Flávio Keidi Miyazawa / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-25T08:56:08Z (GMT). No. of bitstreams: 1
Sasaki_AndersonToshiyuki_M.pdf: 1449279 bytes, checksum: 851c64c64afd4605cbfb4946ed5f97a4 (MD5)
Previous issue date: 2014 / Resumo: No problema de cobertura mínima por conjuntos (MSC - Minimum Set Cover), são dados um conjunto L de objetos e uma coleção R de conjuntos e deseja-se encontrar uma sub-coleção S de R que seja uma cobertura de L de custo mínimo, ou seja, L está contido na união de todo os conjuntos R de S com a soma dos custos dos conjuntos R de S sendo mínima. Entre as variantes desse problema, existem aquelas advindas de configurações geométricas, em que tanto os elementos de L quanto os conjuntos contidos em R são objetos geométricos. Como tais problemas são, em geral, NP-difíceis, se P ? NP, não é possível encontrar algoritmos exatos de tempo polinomial para os mesmos. Assim, torna-se interessante a busca por algoritmos aproximados eficientes para obtenção de soluções com garantia de qualidade. Nesta dissertação, estudamos diferentes versões do problema de cobertura mínima por discos (MDC ¿ Minimum Disk Cover), em que o conjunto R é um conjunto de discos, e o objetivo é projetar algoritmos aproximados. Tais versões do problema estão relacionadas com a solução de problemas práticos, como o posicionamento de estações-base em projeto de redes sem fio ou de dispositivos em redes de sensores. Para o caso em que o conjunto de objetos geométricos L é constituído de um único segmento de reta no plano, apresentamos um FPTAS. Para outra versão mais geral, na qual o conjunto de objetos geométricos é dado por um sistema de inequações polinomiais algébricas, propomos um algoritmo aproximado, o qual demonstramos ser um PTAS / Abstract: The Minimum Set Cover problem (MSC) can be described as: given a set L of elements and a collection of sets R, find a subcollection S of R that is a minimum-cost covering for L, i.e., L is contained in the union of the sets R in S, and the sum of the costs of the sets R in S is minimum. Among the variants of this problem, there are those that arise from a geometric configuration in which both the elements of L and the sets contained in R are geometric objects. As such problems are, in general, NP-hard, if P ? NP, it is impossible to find polynomial-time exact algorithms for them. Thus, the use of efficient approximation algorithms to find high quality solutions becomes a good approach. In this dissertation, we study different versions of the Minimum Disk Cover problem (MDC), in which the sets in R are disks, and we seek to develop approximation algorithms. These versions are related to practical problems, such as base station positioning problem for wireless network design and placement of devices in a sensor network. For the case in which the set of geometric objects to be covered is given by a single line segment, we present an FPTAS. For a more general case, where the set of geometric objects is given by a system of algebraic polynomial inequalities, we propose an approximation algorithm which we prove to be a PTAS / Mestrado / Ciência da Computação / Mestre em Ciência da Computação
|
9 |
Dos fundamentos da matemática ao surgimento da teoria da computação por Alan TuringBispo, Danilo Gustavo 15 April 2013 (has links)
Made available in DSpace on 2016-04-28T14:16:18Z (GMT). No. of bitstreams: 1
Danilo Gustavo Bispo.pdf: 2512902 bytes, checksum: 2261f415993066c8892733480af9c1c9 (MD5)
Previous issue date: 2013-04-15 / In this paper I present initially in order to contextualize the influences involved in the emergence of
the theory of Alan Turing computability on a history of some issues that mobilized mathematicians
in the early twentieth century. In chapter 1, an overview will be exposed to the emergence of
ideology Formalist designed by mathematician David Hilbert in the early twentieth century. The
aim was to base the formalism elementary mathematics from the method and axiomatic theories
eliminating contradictions and paradoxes. Although Hilbert has not obtained full success in your
program, it will be demonstrated how their ideas influenced the development of the theory of
computation Turing. The theory proposes that Turing is a decision procedure, a method that
analyzes any arbitrary formula of logic and determines whether it is likely or not. Turing proves that
there can be no general decision. For that will be used as a primary source document On
Computable Numbers, with an application to the Entscheidungsproblem. In Chapter 2, you will see
the main sections of the document Turing exploring some of its concepts. The project will be
completed with a critique of this classic text in the history of mathematics based on
historiographical proposals presented in the first chapter / Neste texto apresento inicialmente com o intuito de contextualizar as influências envolvidas no
surgimento da teoria de Alan Turing sobre computabilidade um histórico de algum problemas que
mobilizaram os matemáticos no início do século XX. No capítulo 1, será exposto um panorama do
surgimento da ideologia formalista concebida pelo matemático David Hilbert no início do século
XX. O objetivo do formalismo era de fundamentar a matemática elementar a partir do método e
axiomático, eliminando das teorias suas contradições e paradoxos. Embora Hilbert não tenha obtido
pleno êxito em seu programa, será demonstrado como suas concepções influenciaram o
desenvolvimento da teoria da computação de Turing. A teoria que Turing propõe é um
procedimento de decisão, um método que analisa qualquer fórmula arbitrária da lógica e determina
se ela é provável ou não. Turing prova que nenhuma decisão geral pode existir. Para tanto será
utilizado como fonte primária o documento On computable numbers, with an application to the
Entscheidungsproblem. No capítulo 2, será apresentado as principais seções do documento de
Turing explorando alguns de seus conceitos. O projeto será finalizado com uma crítica a este texto
clássico da história da matemática com base nas propostas historiográficas apresentadas no primeiro
capítulo
|
10 |
Problems Related to Shortest Strings in Formal LanguagesAng, Thomas January 2010 (has links)
In formal language theory, studying shortest strings in languages, and variations thereof, can be useful since these strings can serve as small witnesses for properties of the languages, and can also provide bounds for other problems involving languages. For example, the length of the shortest string accepted by a regular language provides a lower bound on the state complexity of the language.
In Chapter 1, we introduce some relevant concepts and notation used in automata and language theory, and we show some basic results concerning the connection between the length of the shortest string and the nondeterministic state complexity of a regular language. Chapter 2 examines the effect of the intersection operation on the length of the shortest string in regular languages. A tight worst-case bound is given for the length of the shortest string in the intersection of two regular languages, and loose bounds are given for two variations on the problem. Chapter 3 discusses languages that are defined over a free group instead of a free monoid. We study the length of the shortest string in a regular language that becomes the empty string in the free group, and a variety of bounds are given for different cases. Chapter 4 mentions open problems and some interesting observations that were made while studying two of the problems: finding good bounds on the length of the shortest squarefree string accepted by a deterministic finite automaton, and finding an efficient way to check if a finite set of finite words generates the free monoid.
Some of the results in this thesis have appeared in work that the author has participated in \cite{AngPigRamSha,AngShallit}.
|
Page generated in 0.0568 seconds