Thesis (M.S.)--Rochester Institute of Technology, 2006. / Typescript. Includes bibliographical references (leaves 38-39).

Banca examinadora: Profª. Drª. Isabela Cardoso de Matos Pinto (orientadora); Profª. Drª. Ana Angélica Ribeiro de Meneses e Rocha – (ISC/UFBA); Profª. Drª. Lenir Santos - (UNICAMP/IDISA). Data de defesa 04 de abril de 2012. / Submitted by Maria Creuza Silva (mariakreuza@yahoo.com.br) on 2012-09-24T14:04:13Z No. of bitstreams: 1 Diss MP. Maria Cecília Mendonça 2012.pdf: 2646781 bytes, checksum: 9bda3dd84d2e18bab479fd747fc09950 (MD5) / Approved for entry into archive by Maria Creuza Silva(mariakreuza@yahoo.com.br) on 2012-09-24T14:06:53Z (GMT) No. of bitstreams: 1 Diss MP. Maria Cecília Mendonça 2012.pdf: 2646781 bytes, checksum: 9bda3dd84d2e18bab479fd747fc09950 (MD5) / Made available in DSpace on 2012-09-24T14:06:53Z (GMT). No. of bitstreams: 1 Diss MP. Maria Cecília Mendonça 2012.pdf: 2646781 bytes, checksum: 9bda3dd84d2e18bab479fd747fc09950 (MD5) Previous issue date: 2012 / As Comissões Intergestores são instâncias de negociação entre os gestores de diferentes esferas de governo. No Estado de Sergipe, no ano de 2008, foi aprovado na Assembleia Legislativa um conjunto de Leis que deram início à Reforma Sanitária e Gerencial do SUS. Este novo ciclo da saúde coletiva trouxe entre outras mudanças, a transformação da Comissão Intergestores Bipartite em Colegiado Interfederativo Estadual (CIE). O objetivo geral deste estudo foi analisar a formação, a estrutura, os tipos de relações estabelecidas e a percepção dos gestores acerca do Colegiado Interfederativo Estadual. Esta pesquisa caracteriza-se como um estudo de caso descritivo exploratório. Para a busca de informações foi utilizado fontes primárias: entrevistas com gestores da saúde, técnicos da SES e das regiões de saúde, secretário executivo do COSEMS e CIE e fontes secundárias através da análise de documentos. Os resultados apontam algumas mudanças, no entanto na percepção dos gestores muitas práticas permanecem as mesmas. Na análise das atas, o consenso através da relação de cooperação foi a estratégia política utilizada nos processos de negociação e pactuação e não foram identificadas relação de conflito. A Câmara Técnica filtra as pautas direcionadas à plenária do CIE e sua composição deve ser revista, pois para alguns gestores e técnicos a presença de ao menos um secretário municipal de saúde legitimaria essa estrutura. O estudo documental somado aos relatos dos sujeitos da pesquisa demonstra que, entre os avanços alcançados, a criação do CIR é um importante aspecto a ser considerado, pois, se constitui num fórum de gestão que favorecem a busca de soluções para as dificuldades encontradas, além de possibilitar a ampliação das representações municiais, estimulando o aumento do caráter participativo. As conclusões desta pesquisa lançam novas luzes sobre a problemática das instâncias gestoras. Do mesmo modo, agregam elementos que podem vir a ser considerados nos futuros projetos de pesquisa. / Salvador

The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by the size of a maximal bipartite minor. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

We have proposed a method by which the topology of a network might be discovered through an algorithm like the distributed Bellman-Ford algorithm. We have explored the inner workings of two methods to automate power distribution network reconfiguration, the ILP Solver and the Heuristic Solver. We have seen how networks of different shapes can be translated into a flattened topology, which is necessary preprocessing to find a power assignment solution for a network. We have also seen some experimental results comparing the performance of the ILP Solver and the Heuristic Solver. The Heuristic Solver is a very fast, efficient algorithm to reconfigure power distribution, which is important in the case of an emergency. It performs consistently with near perfect results at a speed that is orders of magnitude quicker than the ILP Solver in almost all cases. In an application where a network is small and time is not an important constraint, the ILP Solver could possibly be preferable, but in any context where time is sensitive and near-perfect results are as acceptable as perfect results, the Heuristic Solver is much preferable. There is always room for improvement. Future tests should perhaps allow for non-integer capacity units, or loads that require other values than unit capacity. Optimizing each algorithm by rewriting them in C could give more optimized tests, though this may not be necessary to make judgments about implementing one or the other. There may be some ways to improve the Heuristic Solver, such as arranging the ordered_links in some way that could be more optimal. The algorithm could also be improved by taking advantage of the fact that once there are no more sources with capacity to provide any loads, the process of trying to assign loads to them for power supply can cease. Perhaps this method could be combined with other methods that do not presently account for load priorities or place as much value on fast execution.

Quantum state discrimination is a fundamental problem in quantum information science. We investigate the optimal distinguishability of orthogonal two-qubit (bipartite) quantum states. The scenario consists of three parties: Alice, Bob, and Charlie. Charlie prepares one of two orthogonal states and sends one qubit to Alice and the other to Bob. Their goal is to correctly identify which state Charlie sent. In most state discrimination scenarios, it is assumed that Alice and Bob can freely communicate with one another so as to collectively agree on the best guess. In this research, we consider a more restricted setting where only one-way classical communication is possible from Alice to Bob. Under this setting, we study two figures of merit (i) Alice's optimal probability, $P$, of identifying the state , and (ii) Alice's optimal probability, $P^\perp$, of identifying the state along with helping Bob identify the state perfectly. We show that in general $P\neq P^\perp$ and we prove a theorem for when $P=P^\perp$. We also found that the maximum of $P-P^\perp$ can arbitrarily approach $1/2$.

Muitos problemas de otimização em grafos, em especial problemas métricos, são mais fáceis de resolver em árvores. Portanto, uma estratégia para obter um bom algoritmo para certos problemas é obter uma árvore que aproxime o grafo, e utilizar uma solução do problema nessa árvore como uma solução aproximada para o problema no grafo original. Neste trabalho é estudada a técnica de Fakcharoenphol, Rao e Talwar, que mostraram como aproximar uma métrica finita arbitrária com n pontos por uma métrica numa árvore com distorção esperada O(lg n) -- o ótimo assintótico. Essa estratégia resulta em algoritmos de aproximação com boas razões de aproximação, e em algoritmos com bom fator de competitividade para diversos problemas de otimização online e distribuídos. É apresentada especificamente a aplicação da técnica ao problema do emparelhamento mínimo bipartido online, que ilustra como a aproximação de métricas auxilia na resolução de um problema e os cuidados que devem ser tomados nessa aplicação. / Many optimization problems on graphs, especially metric problems, are easier to solve on trees. Therefore, a strategy for obtaining a good algorithm for certain problems is to obtain a tree that approximates the graph, and use a solution of the problem on the tree as an approximate solution for the problem on the original graph. We study the work of Fakcharoenphol, Rao e Talwar, who showed how to approximate an arbitrary finite metric on n points by a tree metric with expected distortion O(lg n), which is asymptotically optimum. This strategy leads to algorithms with good approximation factors, and to competitive algorithms for various optimization problems, some of them online and distributed. Here, we present the application of that technique to the problem of finding a minimum online matching on a bipartite metric graph. This problem illustrates how metric approximation aids in solving a problem, and the care that must be taken when doing such an application.

Approximation algorithms are widely used for problems related to computational geometry, complex optimization problems, discrete min-max problems and NP-hard and space hard problems. Due to the complex nature of such problems, imperative languages are perhaps not the best-suited solution when it comes to their actual implementation. Functional languages like Haskell could be a good candidate for the aforementioned mentioned issues. Haskell is used in industries as well as in commercial applications, e.g., concurrent applications, statistics, symbolic math and financial analysis. Several approximation algorithms have been proposed for different problems that naturally arise in the DNA clone classifications. In this thesis, we have performed an initial and explorative study on applying functional languages for approximation algorithms. Specifically, we have implemented a well known approximate clustering algorithm both in Haskell and in Java and we discuss the suitability of applying functional languages for the implementation of approximation algorithms, in particular for graph theoretical approximate clustering problems with applications in DNA clone classification. We also further explore the characteristics of Haskell that makes it suitable for solving certain classes of problems that are hard to implement using imperative languages. / Muhammad Imran Shafi: 29A Sodergatan 19547 Marsta, 0737171514, Muhammad Akram C/O Saad Bin Azhar Folkparksvagen 20/10 Ronneby, 0762899111

This study investigates the lithological characteristics, and lateral and vertical facies trends of poorly understood, deep-marine matrix-rich sedimentary rocks. Two laterally extensive, well-exposed outcrops of slope and proximal basin floor deposits were investigated from the Neoproterozoic Windermere Supergroup. Significantly, matrix-rich beds have been found to undergo the same lateral trends (over ~200-650 m) in both outcrops. Initially, thicker, clayey sandstone transitions laterally to a bipartite bed with the development of an upper, planar-based, more matrix-rich unit. Further laterally, the basal unit progressively thins until it pinches out, and all that remains is the upper, more matrix-rich unit – a sandy claystone. It too thins and then pinches out. Draping the entire transect is a thin, matrix-poor structured unit overlain by a mudstone or claystone cap. These trends are interpreted to reflect a progressive but rapid lateral evolution of flow structure controlled primarily by particle settling, namely sand, from mud-rich avulsion-related flows.

A graph is an ordered pair composed by a set of vertices and a set of edges, the latter consisting of unordered pairs of vertices. Two vertices in such a pair are each others neighbors. Two edges are adjacent if they share a common vertex. Denote the amount of edges that share a specific vertex as the degree of the vertex. A proper edge-coloring of a graph is an assignment of colors from some finite set, to the edges of a graph where no two adjacent edges have the same color. A bipartition (X,Y) of a set of vertices V is an ordered pair of two disjoint sets of vertices such that V is the union of X and Y, where all the vertices in X only have neighbors in Y and vice versa. A bipartite graph is a graph whose vertices admit a bipartition (X,Y). Let G be one such graph. An X-interval coloring of G is a proper edge coloring where the colors of the edges incident to each vertex in X form an interval of integers. Denote by χ'int(G,X) the least number of colors needed for an X-interval coloring of G. In this paper we prove that if G is a bipartite graph with maximum degree 3n (n is a natural number), where all the vertices in X have degree 3, then <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cmathit%7B%5Cchi'_%7Bint%7D%5Cleft(G,X%5Cright)%5Cleq%7D%0A%5C%5C%0A%5Cmathit%7B%5Cleft(n-1%5Cright)%5Cleft(3n+5%5Cright)/2+3%7D%0A%5C%5C%0A%5Cmathit%7Bif%20n%20is%20odd,%7D%0A%5C%5C%0A%5Cmathit%7Bor%7D%0A%5C%5C%0A%5Cmathbf%7B3n%5E%7B2%7D/2+1%7D%0A%5C%5C%0A%5Cmathit%7Bif%20n%20is%20even%7D.%0A" />

The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by the size of a maximal bipartite minor.