Thesis (M.S.)--University of Alabama at Birmingham, 2009. / Title from PDF title page (viewed Jan. 21, 2010). Additional advisors: Yulia Karpeshina, Ian Knowles, Rudi Weikard. Includes bibliographical references (p. 19).

Thesis (Ph. D.)--Aerospace Engineering, Georgia Institute of Technology, 2007. / Danielle Soban, Committee Member ; Dimitri Mavris, Committee Chair ; Alan Porter, Committee Member ; Gary Seng, Committee Member ; Daniel Schrage, Committee Member.

Orientador: Rafael Santos Mendes / Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecânica / Made available in DSpace on 2018-08-18T03:24:20Z (GMT). No. of bitstreams: 1 Prado_Daniel_M.pdf: 1023728 bytes, checksum: 9342e53e6ff7f169478722c6bcd70fc0 (MD5) Previous issue date: 2011 / Resumo: Este projeto tem por objetivo estudar um problema de projeto para realizar o handoff vertical entre canais de comunicação GPRS e Satélite em um cenário que otimize o tempo e o custo através de equações probabilísticas. Através de um modelo de estados que descreve as diferentes possibilidades de comunicação entre sistemas GPRS e Satélite, o objetivo é determinar os tempos dos eventos controláveis que fazem a mudança entre os estados de modo a otimizar o tempo de comunicação num cenário probabilístico de handoff vertical entre canais de comunicação. Os resultados das simulações realizadas nesta dissertação em diferentes situações de qualidade dos sinais de transmissão GPRS e Satélite, mostram que através dos algoritmos de handoff desenvolvidos, a probabilidade estacionária de permanência nos estados de transmissão é aumentada / Abstract: This project aims to study a design problem to carry-out the handoff vertical of communication between communication channels GPRS and Satellite in a scenario that optimizes time and cost by probabilistic equations. Through a state model that describes the different possibilities of communication between GPRS and satellite systems, the goal is to set the times of the controllable events that do the changes between states in order to optimize the communication time in a probabilistic scenario of handoff vertical for communication channels. The results of the simulations in this work in different situations, quality of transmission signals GPRS and Satellite, show that through the handoff algorithms developed, the stationary probability of staying in the states of transmission is increased / Mestrado / Eletrônica / Mestre em Engenharia Automobilistica

This thesis is primarily focused on problems in extremal combinatorics, although we will also consider some questions of analytic and algorithmic nature. The d-dimensional hypercube is the graph with vertex set {0,1}^d where two vertices are adjacent if they differ in exactly one coordinate. In Chapter 2 we obtain an upper bound on the 'saturation number' of Q_m in Q_d. Specifically, we show that for m ≥ 2 fixed and d large there exists a subgraph G of Q_d of bounded average degree such that G does not contain a copy of Q_m but, for every G' such that G ⊊ G' ⊆ Q_d, the graph G' contains a copy of Q_m. This result answers a question of Johnson and Pinto and is best possible up to a factor of O(m). In Chapter 3, we show that there exists ε > 0 such that for all k and for n sufficiently large there is a collection of at most 2^{(1-ε)k} subsets of [n] which does not contain a chain of length k+1 under inclusion and is maximal subject to this property. This disproves a conjecture of Gerbner, Keszegh, Lemons, Palmer, Pálvölgyi and Patkós. We also prove that there exists a constant c ∈ (0,1) such that the smallest such collection is of cardinality 2^{(1+o(1))^ck} for all k. In Chapter 4, we obtain an exact expression for the 'weak saturation number' of Q_m in Q_d. That is, we determine the minimum number of edges in a spanning subgraph G of Q_d such that the edges of E(Q_d)\E(G) can be added to G, one edge at a time, such that each new edge completes a copy of Q_m. This answers another question of Johnson and Pinto. We also obtain a more general result for the weak saturation of 'axis aligned' copies of a multidimensional grid in a larger grid. In the r-neighbour bootstrap process, one begins with a set A₀ of 'infected' vertices in a graph G and, at each step, a 'healthy' vertex becomes infected if it has at least r infected neighbours. If every vertex of G is eventually infected, then we say that A₀ percolates. In Chapter 5, we apply ideas from weak saturation to prove that, for fixed r ≥ 2, every percolating set in Q_d has cardinality at least (1+o(1))(d choose r-1)/r. This confirms a conjecture of Balogh and Bollobás and is asymptotically best possible. In addition, we determine the minimum cardinality exactly in the case r=3 (the minimum cardinality in the case r=2 was already known). In Chapter 6, we provide a framework for proving lower bounds on the number of comparable pairs in a subset S of a partially ordered set (poset) of prescribed size. We apply this framework to obtain an explicit bound of this type for the poset 𝒱(q,n) consisting of all subspaces of 𝔽_qⁿordered by inclusion which is best possible when S is not too large. In Chapter 7, we apply the result from Chapter 6 along with the recently developed 'container method,' to obtain an upper bound on the number of antichains in 𝒱(q,n) and a bound on the size of the largest antichain in a p-random subset of 𝒱(q,n) which holds with high probability for p in a certain range. In Chapter 8, we construct a 'finitely forcible graphon' W for which there exists a sequence (ε_i)^∞_i=1 tending to zero such that, for all i ≥ 1, every weak ε_i-regular partition of W has at least exp(ε_i^-2/2^{5log∗ε_i^-2}) parts. This result shows that the structure of a finitely forcible graphon can be much more complex than was anticipated in a paper of Lovász and Szegedy. For positive integers p,q with p/q ❘≥ 2, a circular (p,q)-colouring of a graph G is a mapping V(G) → ℤ_p such that any two adjacent vertices are mapped to elements of ℤ_p at distance at least q from one another. The reconfiguration problem for circular colourings asks, given two (p,q)-colourings f and g of G, is it possible to transform f into g by recolouring one vertex at a time so that every intermediate mapping is a p,q-colouring? In Chapter 9, we show that this question can be answered in polynomial time for 2 ≤ p/q < 4 and is PSPACE-complete for p/q ≥ 4.