Proefschrift Universiteit van Amsterdam. / Met lit. opg., reg. - Met samenvatting in het Engels.

Ulm, Univ., Diss., 2000.

Proefschrift Universiteit Maastricht. / Met bibliogr., lit. opg. - Met samenvatting in het Engels.

Η παρούσα διπλωματική εργασία ασχολείται με τις δορυφορικές επικοινωνίες και, πιο συγκεκριμένα, με τις δορυφορικές κινητές επικοινωνίες. Στόχος της είναι η μελέτη και ανάλυση όλων των φαινομένων που λαμβάνουν χώρα κατά τη διαδρομή ενός σήματος σε ένα δορυφορικό σύστημα, έτσι ώστε να είναι εφικτή η υλοποίηση ενός δορυφορικού συστήματος με τη βοήθεια ενός προγράμματος προσομοίωσης. / This project refers to satellite communications and specifically to satellite mobile communications. The aim of this project is to analyse all the effects that take place during the signal transmission in order to achieve the modelization of an Rf satellite link with the Simulink programm.

A partir de um grupo H e um elemento h em H, nós definimos uma representação : \'B IND. n\' Aut(\'H POT. n\' ), onde \'B IND. n\' denota o grupo de trança de n cordas, e \'H POT. n\' denota o produto livre de n cópias de H. Chamamos a a representação de tipo Artin associada ao par (H, h). Nós também estudamos varios aspectos de tal representação. Primeiramente, associamos a cada trança um grupo \' IND. (H,h)\' () e provamos que o operador \' IND. (H,h)\' determina um grupo invariante de enlaçamentos orientados. Então damos uma construção topológica da representação de tipo Artin e do invariante de enlaçamentos \' IND.(H,h)\' , e provamos que a representação é fiel se, e somente se, h é não trivial / From a group H and a element h H, we define a representation : \' B IND. n\' Aut(\'H POT. n\'), where \'B IND. n\' denotes the braid group on n strands, and \'H POT. n\' denotes the free product of n copies of H. We call the Artin type representation associated to the pair (H, h). Here we study various aspects of such representations. Firstly, we associate to each braid a group \' IND. (H,h)\' () and prove that the operator \' IND. (H,h)\' determines a group invariant of oriented links. We then give a topological construction of the Artin type representations and of the link invariant \' iND. (H,h)\' , and we prove that the Artin type representations are faithful if and only if h is nontrivial

A predição de links em redes é uma tarefa com aplicações em diversos cenários. Com a automatização de processos, as redes sociais, redes tecnológicas e outras cresceram muito em número de vértices e arestas. Portanto, a utilização de preditores de links em redes com alta complexidade estrutural não é trivial, mesmo considerando algoritmos de baixa complexidade computacional. A grande quantidade de operações necessárias para que os preditores possam escolher quais arestas são promissoras torna o processo de considerar a rede toda inviável na maioria dos casos. As abordagens existentes enfrentam essa característica de diversas formas, sendo que as mais populares são as que limitam o conjunto de pares de vértices que serão considerados para existência de arestas promissoras. Este projeto aborda a criação de uma estratégia que utiliza otimização multinível para contrair as redes, executar os algoritmos de predição de links nas redes contraídas e projetar os resultados de predição para a rede original, para reduzir o número de operações necessárias à predição de links. Os resultados mostram que a abordagem consegue reduzir o tempo necessário para predição, apesar de perdas esperadas na qualidade na predição. / Link prediction in networks is a task with applications in several scenarios. With the automation of processes, social networks, technological networks, and others have grown considerably in the number of vertices and edges. Therefore, the creation of systems for link prediction in networks of high structural complexity is not a trivial process, even considering low-complexity algorithms. The large number of operations required for predicting which edges are promising makes the considering of the whole network impracticable in many cases. The existing approaches face this characteristic in several ways, and the most popular are those that limit the set of vertex pairs that will be considered for the existence of promising edges. This project addresses a strategy that uses multilevel optimization to coarse networks, execute prediction algorithms on coarsened networks and project the results back to the original network, in order to reduce the number of operations for link prediction. The experiments show that the approach can reduce the time despite some expected losses of accuracy.

Muitos links entre páginas na Web podem ser vistos como indicadores de qualidade e importância para as páginas que eles apontam. A partir desta ideia, vários estudos propuseram métricas baseadas na estrutura de links para inferir qualidade de conteúdo em páginas da web. Contudo, até onde sabemos, o único trabalho que examinou a correlação entre tais métricas e qualidade de conteúdo consistiu de um estudo limitado que deixou várias questões em aberto. Embora tais métricas sejam muito bem sucedidas na tarefa de ranquear páginas que foram fornecidas como respostas para consultas submetidas para máquinas de busca, não é possível determinar a contribuição específica de fatores como qualidade, popularidade e importância para os resultados. Esta dificuldade se deve em parte ao fato de que a informação sobre qualidade, popularidade e importância é difícil de obter para páginas da web em geral. Ao contrário de páginas da web, estas informações podem ser obtidas para artigos da Wikipédia, uma vez que qualidade e importância são avaliadas por especialistas humanos, enquanto a popularidade pode ser estimada com base nas visualizações dos artigos. Isso torna possível a verificação da relação existente entre estes fatores e métricas de análise de links, nosso objetivo neste trabalho. Para fazer isto, nós implementamos vários algoritmos de análise de links e comparamos os rankings obtidos com eles com os obtidos considerando a avaliação humana feita na Wikipédia com relação aos fatores qualidade, popularidade e importância. Nós observamos que métricas de análise de links são mais relacionadas com qualidade e popularidade que com importância e a correlação é moderada / Many links between Web pages can be viewed as indicative of the quality and importance of the pages pointed to. Accordingly, several studies have proposed metrics based on links to infer web page content quality. However, as far as we know, the only work that has examined the correlation between such metrics and content quality consisted of a limited study that left many open questions. In spite of these metrics having been shown successful in the task of ranking pages which were provided as answers to queries submitted to search machines, it is not possible to determine the specific contribution of factors such as quality, popularity, and importance to the results. This difficulty is partially due to the fact that such information is hard to obtain for Web pages in general. Unlike ordinary Web pages, the content quality of Wikipedia articles is evaluated by human experts, which makes it feasible to verify the relation between such link analysis metrics and the quality of Wikipedia articles, our goal in this work. To accomplish that, we implemented several link analysis algorithms and compared their resulting rankings with the ones created by human evaluators regarding factors such as quality, popularity and importance. We found that the metrics are more correlated to quality and popularity than to importance, and the correlation is moderate

How can we add new life to engineering structures like bridges and communicational links in the important nodes of a city? This project works with strategies of dealing with that kind of situations on an example of Skanstullsbron connecting Södermalm and southern parts of Stockholm.

Thesis advisor: Tao Li / This dissertation explores a relationship between fibered knots and Heegaard splittings in closed, connected, orientable three-manifolds. We show that a fibered knot, which has a sufficiently complicated monodromy, induces a minimal genus Heegaard splitting that is unique up to isotopy. Moreover, we show that fibered knots in the three-sphere has complexity at most 3. / Thesis (PhD) — Boston College, 2020. / Submitted to: Boston College. Graduate School of Arts and Sciences. / Discipline: Mathematics.

Thesis advisor: Julia Elisenda Grigsby / In 1999, Khovanov constructed a combinatorial categorification of the Jones polynomial. Since then there has been a question of to what extent the topology of a link is reflected in his homology theory and how Khovanov homology can be used for topological applications. This dissertation compiles some of the authors contributions to these avenues of mathematical inquiry. In the first chapter, we prove that for a fixed braid index there are only finitely many possible shapes of the annular Rasmussen $d_t$ invariant of braid closures. Focusing on the case of 3-braids, we compute the Rasmussen $s$-invariant and the annular Rasmussen $d_t$ invariant of all 3-braid closures. As a corollary, we show that the vanishing/non-vanishing of the $\psi$ invariant is entirely determined by the $s$-invariant and the self-linking number for 3-braid closures. In the second chapter, we show if $L$ is any link in $S^3$ whose Khovanov homology is isomorphic to the Khovanov homology of $T(2,6)$ then $L$ is isotopic to $T(2,6)$. We show this for unreduced Khovanov homology with $\mathbb{Z}$ coefficients. Finally in the third chapter, we exhibit infinite families of annular links for which the maximum non-zero annular Khovanov grading grows infinitely large but the maximum non-zero annular Floer-theoretic gradings are bounded. We also show this phenomenon exists at the decategorified level for some of the infinite families. Our computations provide further evidence for the wrapping conjecture of Hoste-Przytycki and its categorified analogue. Additionally, we show that certain satellite operations cannot be used to construct counterexamples to the categorified wrapping conjecture. / Thesis (PhD) — Boston College, 2022. / Submitted to: Boston College. Graduate School of Arts and Sciences. / Discipline: Mathematics.