Nesta tese estudamos dois problemas em digrafos: um problema de empacotamento e um problema de contagem. Estudamos o problema de empacotamento máximo de arborescências no digrafo aleatório D(n,p), onde cada possvel arco é inserido aleatoriamente ao acaso com probabilidade p = p(n). Denote por (D(n,p)) o maior inteiro possvel 0 tal que, para todo 0 l , temos ^(l-1)_i=0 (l-i)|{v in d^in(v) = i}| Provamos que a quantidade máxima de arborescências em D(n,p) é (D(n,p)) assintoticamente quase certamente. Nós também mostramos estimativas justas para (D(n, p)) para todo p [0, 1]. As principais ferramentas que utilizamos são relacionadas a propriedades de expansão do D(n, p), o comportamento do grau de entrada do digrafo aleatório e um resultado clássico de Frank que serve como ligação entre subpartições em digrafos e a quantidade de arborescências. Para o problema de contagem, estudamos a densidade de subtorneios fortemente conexos com 5 vértices em torneios grandes. Determinamos a densidade assintótica máxima para 5 torneios bem como as famlias assintóticas extremais de cada torneios. Como subproduto deste trabalho caracterizamos torneios que são blow-ups recursivos de um circuito orientado com 3 vértices como torneios que probem torneios especficos de tamanho 5. Como principal ferramenta para esse problema utilizados a teoria de álgebra de flags e configurações combinatórias obtidas através do método semidefinido. / In this thesis we study two problems dealing with digraphs: a packing problem and a counting problem. We study the problem of packing the maximum number of arborescences in the random digraph D(n,p), where each possible arc is included uniformly at random with probability p = p(n). Let (D(n,p)) denote the largest integer 0 such that, for all 0 l , we have ^(l-1)_i=0 (l-i)|{v in d^in(v) = i}|. We show that the maximum number of arc-disjoint arborescences in D(n, p) is (D(n, p)) asymptotically almost surely. We also give tight estimates for (D(n, p)) for every p [0, 1]. The main tools that we used were expansion properties of random digraphs, the behavior of in-degree of random digraphs and a classic result by Frank relating subpartitions and number of arborescences. For the counting problem, we study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for five tournaments as well as unique extremal sequences for each tournament. As a byproduct of this study we also characterize tournaments that are recursive blow-ups of a 3-cycle as tournaments that avoid three specific tournaments of size 5. We use the theory of flag algebras as a main tool for this problem and combinatorial settings obtained from semidefinite method.

Under international law, every state has the sovereign right to establish the conditions under which it will grant its nationality to a vessel. By consequence, different schemes for ship registration have been developed, traditionally the nationalist and open system. While the nationalist system imposes strict requirements regarding national ownership and manning, along with burdensome fiscal regimes for the shipping industry, the open system offered flexible requirements and a friendly taxation environment, that help shipowners to minimize their operation costs. / Open registries have been criticized for not complying with international accepted shipping standards in safety, environmental, and labour aspects. However, some of them have made great efforts to raise these standards, mainly obliged by the new demands of the shipping industry. Nonetheless, the shift to a new culture of quality shipping is not only a responsibility of flag states, but of all the actors of a maritime scenario.

Thesis (Ph.D.)--University of Wollongong, 2007. / Typescript. Includes bibliographical references: leaf 317-342.

Background: In the recent years, the focus of research has shifted to Quality of Experience(QoE) to maintain the user satisfaction levels and fulfill their expectations of the serviceoffered. Numerous work has been established in finding the relationship between the networklayer and QoE. But, it is fact that the transport layer is much closer to the end-user than thenetwork layer in the TCP/IP communication protocol suite. Thus, any changes in the degreeof satisfaction or degree of annoyance are directly reflected onto transport layer than on thenetwork layer. So, it becomes more significant to study the behavior of user satisfaction inrelation to transport layer than the network layer. Objectives: This research is to relate the behavior of TCP to QoE. The main considerations tobridge the gap between them are: (a) Analyzing the effects of using different versions of TCPon server and client side, (b) Monitoring and analyzing the intensity of TCP traffic in thereverse direction and (c) Investigating TCP control flags from client to server. Methods: QoE related parameters used in this research are: (a) Quality of video i.e., MOS, (b)Degree of disturbance caused by initial delay, (c) Degree of disturbance caused by jerkinessand (d) Degree of disturbance caused by freezes. Effects of network impairments like delay,jitter and packet loss are considered in this research. NetEm is used as the traffic emulationsoftware to shape the traffic. The packet capture analysis of traffic exchange is implementedusing tcpdump. Results and Conclusions: The aim of this research is to provide a passive-estimation methodto assess the user perceived performance. The results of this research provide valuablecontribution to service providers/operators to note the early warning signals from TCP reversetraffic to evaluate the decrease of user satisfaction level and try to cope or/and recover fromimpairments in the network. This research also provides a scope for future researchers toinvestigate other protocols both in transport and application layers.

Made available in DSpace on 2014-06-11T19:27:51Z (GMT). No. of bitstreams: 0 Previous issue date: 2009-11-12Bitstream added on 2014-06-13T20:17:20Z : No. of bitstreams: 1 berg_tj_me_rcla.pdf: 9754495 bytes, checksum: 2a29ac3a460560573eb2a4a4d17e94a8 (MD5) / Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) / Bandeiras e estandartes, escudos e brasões, hinos e canções não são simples composições artísticas e musicais idealizadas ao sabor dos caprichos e fantasias de poderosos reis, mandatários, governantes, países e regiões ao longo dos tempos. Ao contrário, esses símbolos refletem uma realidade histórica e, ao mesmo tempo, portam-se como uma crônica viva de um povo e de uma nação, sendo que nela também está embutido o espaço geográfico, suas influências e suas relações. Foi somente com a Constituição Republicana de 1891, que as províncias foram transformadas em Estados Federados e poderiam adotar de forma oficial, hinos, bandeiras e brasões, desde que não omitissem nesta hierarquia os símbolos nacionais; entretanto, o uso destes símbolos no Brasil já se fazia presente desde os primeiros séculos de colonização portuguesa. Ao se analisarem os símbolos estaduais brasileiros, encontram-se em suas estruturas semânticas e sintáticas fortes relações que envolvem representação da natureza, paisagem, lugar, economia, território e região. As conclusões deste trabalho apontam para o fato de que os hinos, as bandeiras e os brasões dos Estados brasileiros demonstram amplas possibilidades de pesquisa dentro da ciência geográfica, pois estes documentos simbólicos portam-se como “testemunhos” no espaçotempo, cujo caráter gráfico e narrativo revelou em suas múltiplas conexões com o geográfico uma nova perspectiva e possibilidade no que se refere à análise e desvendamento das formas culturais de representação espacial. / Flags and banners, shields and coats of arms, anthems and songs are not simply artistic and musical compositions which were created due to the vanity or fantasies of powerful kings, dukes, rulers, governors, countries and regions throughout time. Instead, those symbols reflect a historical reality and not only they stand as an alive chronicle of a people and a nation, but also they represent the geographical space, its influences and its relationships. It was only after the Republican Constitution of 1891 that the provinces were transformed into Federated States and they could officially adopt anthems, flags and coats of arms, as long as they didn't omit, in this hierarchy, the national symbols. However, these symbols had been already used in Brazil since the first centuries of Portuguese colonization. This analysis of the Brazilian States symbols, as well as their semantic and syntactic structures, aimed to demonstrate the strong connections involving the representation of the nature, landscape, places, economy, territory and regions. The conclusion of this dissertation shows that anthems, flags and the coats of arms of Brazilian States demonstrate wide research possibilities in the geographical science because these symbolic documents stand as “testimonies” in space and time, whose graphic and narrative character has revealed in its multiple connections with the geographical; a new perspective and possibility regarding the analysis and unveiling of the cultural forms of spatial representation.

Pas de résumé / Doctorat en droit / info:eu-repo/semantics/nonPublished

Nesta tese estudamos dois problemas em digrafos: um problema de empacotamento e um problema de contagem. Estudamos o problema de empacotamento máximo de arborescências no digrafo aleatório D(n,p), onde cada possvel arco é inserido aleatoriamente ao acaso com probabilidade p = p(n). Denote por (D(n,p)) o maior inteiro possvel 0 tal que, para todo 0 l , temos ^(l-1)_i=0 (l-i)|{v in d^in(v) = i}| Provamos que a quantidade máxima de arborescências em D(n,p) é (D(n,p)) assintoticamente quase certamente. Nós também mostramos estimativas justas para (D(n, p)) para todo p [0, 1]. As principais ferramentas que utilizamos são relacionadas a propriedades de expansão do D(n, p), o comportamento do grau de entrada do digrafo aleatório e um resultado clássico de Frank que serve como ligação entre subpartições em digrafos e a quantidade de arborescências. Para o problema de contagem, estudamos a densidade de subtorneios fortemente conexos com 5 vértices em torneios grandes. Determinamos a densidade assintótica máxima para 5 torneios bem como as famlias assintóticas extremais de cada torneios. Como subproduto deste trabalho caracterizamos torneios que são blow-ups recursivos de um circuito orientado com 3 vértices como torneios que probem torneios especficos de tamanho 5. Como principal ferramenta para esse problema utilizados a teoria de álgebra de flags e configurações combinatórias obtidas através do método semidefinido. / In this thesis we study two problems dealing with digraphs: a packing problem and a counting problem. We study the problem of packing the maximum number of arborescences in the random digraph D(n,p), where each possible arc is included uniformly at random with probability p = p(n). Let (D(n,p)) denote the largest integer 0 such that, for all 0 l , we have ^(l-1)_i=0 (l-i)|{v in d^in(v) = i}|. We show that the maximum number of arc-disjoint arborescences in D(n, p) is (D(n, p)) asymptotically almost surely. We also give tight estimates for (D(n, p)) for every p [0, 1]. The main tools that we used were expansion properties of random digraphs, the behavior of in-degree of random digraphs and a classic result by Frank relating subpartitions and number of arborescences. For the counting problem, we study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for five tournaments as well as unique extremal sequences for each tournament. As a byproduct of this study we also characterize tournaments that are recursive blow-ups of a 3-cycle as tournaments that avoid three specific tournaments of size 5. We use the theory of flag algebras as a main tool for this problem and combinatorial settings obtained from semidefinite method.

No description available.

Die vorliegende Studie untersucht das Wissen und die Beratungskompetenzen bezüglich Fieber im Kindesalter bei Pharmazie- und Medizinstudierenden im letzten Studienjahr. Da alle Absolventen des Medizin- und Pharmaziestudiums mit fiebernden Kindern konfrontiert werden können, sollten sie mit der Thematik vertraut sein und eine mögliche Gefährdung des fiebernden Kindes („red flags“) erkennen sowie die Eltern kompetent beraten können. Die Studie deckte große Defizite in Wissen und Beratungskompetenzen von Pharmazie- und Medizinstudierenden auf, die sich im letzten Jahr ihrer universitären Ausbildung befanden. Aus den Ergebnissen der vorliegenden Studie lassen sich somit Erkenntnisse zur Qualitätssicherung und -verbesserung in der Lehre ableiten. Zukünftige Universitätskurse sollten die Studierenden besser auf die 'Situationen im wirklichen Leben' vorbereiten und den Schwerpunkt stärker auf wesentliche Kenntnisse und Fähigkeiten legen. Dabei hat die Studie aufgezeigt, dass insbesondere die Vermittlung von theoretischem Wissen über „red flags“, das praktische Erkennen von akut gefährdenden Umständen bei kindlichem Fieber, sowie die Beratung der Eltern in den Fokus gerückt werden sollte. Fieber

Yes / The project was designed as a retrospective service evaluation using audit to assess the identification and documentation of red flags in initial assessment of patients with low back pain. Firstly, the documentation of 11 predetermined red flags was assessed. Secondly, the documentation of relevant additional information was assessed and finally, compliance with local policy to highlight positive red flag findings in the designated area on the paperwork was examined. The documentation for the majority of red flags was high, however, clear gaps were identified. Additionally, there was no evidence of further clinical consideration of positive red flags during the diagnostic process. Possible factors influencing red flag documentation are discussed and suggestions are provided to improve recording and response to clinical indicators of malignancy.