To see the other types of publications on this topic, follow the link: Disjointed.
Dissertations / Theses on the topic 'Disjointed'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Disjointed.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Flinn, Stephen Wayne. "Disjointed Cosmopolitanism: Climate Change and Lived Experience in Portland, Oregon." PDXScholar, 2013. https://pdxscholar.library.pdx.edu/open_access_etds/1435.
Full textAbstract:
Climate change has emerged as one of the most significant issues facing the world. This research endeavored to uncover and describe the lived experience of Portland, Oregon residents in relation to the substantive issue of climate change. The specific purpose of this research was to gain a better understanding of the ways that Portland residents conceive of and communicate about climate change. Utilizing semi-structured phenomenological interviews, particular attention was paid to the culture of Portland residents, their lived experience and how the issue of climate change manifests itself in their everyday experiences. In addition, this particular phenomenological inquiry incorporated elements of auto ethnography by positioning the researcher`s experiences, imagination and intellect at the center of the research endeavor. Multiple themes emerged from the in-depth, descriptive interviews that helped to reveal the structure or essence of the participant`s experience(s). A single meta-theme was identified and informed by contemporary theories such as Cosmopolitanism and the Environmental Justice Paradigm.
2
Molander, Bengt-Olov. "Joint discourses or disjointed courses : A study on learning in upper secondary school." Doctoral thesis, Stockholms universitet, Lärarhögskolan i Stockholm (LHS), 1997. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-35488.
Full textAbstract:
The main purpose of the present study is to investigate whether learning and ways of understanding subject content and structure differ between successful and less successful students—i.e. in terms of their grade point average—in upper secondary school. A second issue is whether different subjects and disciplines—i.e. science on the one hand and humanities/social sciences on the other—make different demands on students. Data were gathered through interviews with a total of 36 students in two classes at two periods of their schooling. Additional data were gathered from interviews with teachers in the two classes and a sample of the tests given to the classes. Both classes receive instruction in science as well as humanities/social sciences but in one class (N) the emphasis is on science whereas in the other (S) the emphasis is on humanities/social sciences. A common characteristic of successful students is that they adjust to the teacher’s way of structuring the subject by means of a deep approach and a pronounced cue-seeking. They also play a dominant role in classroom communication. Less successful students more frequently use a surface or procedural approach to learning, are less sensitive for cues, do not adjust to the structure of subjects as presented by the teachers and do not participate to the same extent in classroom communication. The characteristics for successful students are very stable over time. As for the less successful students, there is a difference between N- and S-students. A majority of the S-students who use a surface approach in the first year change towards a deep approach later in their schooling, whereas the procedural approach of N-students is stable. It is concluded that the stability shown by the successful students can be explained in that their deep approach reflects their understanding that subject structure may vary and cue-seeking for these students signifies an awareness of and subsequent adjustment to the particular structure presented by the teachers. By understanding the structure according to teachers’ intentions, successful students are able to participate in classroom communication, eventually establishing a joint discourse. The differences between a change of learning for S- and N-students could be interpreted in light of differences in subject structure and instruction between subjects. In humanities/social sciences, classroom communication and the presentation of alternative interpretations of subject matter play a prominent role in instruction, and students who initially use a surface approach might get guidance to alternative ways of understanding the subject matter and subject structure. In the science subjects in the N-programme, the presentation of alternative interpretations is not as common. These subjects also have a hierarchical structure, and understanding the basic fundamentals is a prerequisite for understanding later topics. For the students who initially use a surface approach in these hierarchically ordered subjects, learning becomes a matter of memorising more and more disconnected facts in what might seem to be disjointed courses.
3
Jelnikar, Ana. "Towards universalism : Rabindranath Tagore and Srecko Kosovel : a joint perspective in a disjointed world." Thesis, SOAS, University of London, 2009. http://eprints.soas.ac.uk/29544/.
Full textAbstract:
This thesis is the first in-depth exploration of the connection between the Indian poet Rabindranath Tagore (1861-1941) and the Slovene poet Srecko Kosovel (1904- 1926). It proceeds from a key observation that, in spite of their differences, they share a worldview that derives from a structurally similar positioning within their respective historical situations. Both wrote from the awareness of their region's subjugated status and endorsed an anti-imperialist stance that rejected nationalism as a viable means of liberation, embracing instead a creative universalist ideal. While seeking to establish the reasons, relevance, and manner in which Tagore inspired Kosovel, the thesis also traces broader parallels and shared concerns between the two poets, situating their "universalisms" in their respective culture-historical contexts. The introduction and chapter one lay out the comparative and theoretical framework, exploring "universalism" in its embattled relationship with "nationalism" in the context of anti-imperialist/colonial struggles to arrive at a workable definition with which to approach the two poets. Part II looks at the personal and historical factors shaping Tagore's theory and practice of liberation, as he came to reject nationalism and deconstruct the binary logic of colonial modernity so as to reposition India and the individual in a global framework. The importance of his post-Nobel Prize travels for his world vision is explored in conjunction with Tagore's reputation in the West, particularly in Europe's Central and Eastern peripheries, such as Slovenia. Part III introduces Kosovel and establishes the framework conjoining the two poets across the vastly different culturo-geographic space. Kosovel's reading of Tagore is framed through the paradigms of (cross-colonial) situational identifications and global modernity. It proposes a new reading of Kosovel's poetry, analyzing Kosovel's shift from a romantic to modernist sensibility in the light of his endorsement of Tagore's universalist idea(l)s.
4
Moschel, Amanda. "Narrative Structures: The Creation of Meaning Through Reference and Collage in Architecture." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337263822.
Full text
5
Hickson, David J., and D. S. Pugh. "Great writers on organizations." Ashgate Publishing, 2009. http://hdl.handle.net/10454/2791.
Full textAbstract:
No<br>Great Writers on Organizations presents succinctly each of the contributions made by 80 of the most prominent management thinkers to the understanding of organizational behaviour and managerial thinking. Among those included are early theorists such as Henri Fayol, Frederick W. Taylor and Max Weber, classical writers such as Alfred D. Chandler, Peter Drucker and Frederick Herzberg, through to modern thinkers such as Oliver Williamson, Rosabeth Moss Kanter, and Charles Handy. New writers included in the Third Omnibus Edition are: Lex Donaldson, Stewart Clegg, Richard Whitley, Michel Foucault and Kathleen Eisenhardt. The volume is an indispensable resource for academics, students and managers on what the great writers have to say about the key managerial tasks of how to organize and motivate.
6
Vincent, Charles. "Vices et vertus de l’interprétation, Diderot en quête d’éthique (1773-1784)." Thesis, Paris 4, 2012. http://www.theses.fr/2012PA040270.
Full textAbstract:
Notre thèse vise à interpréter le décousu du discours moral de Diderot depuis son voyage à Saint-Pétersbourg jusqu’à sa mort (1773-1784), à l’aide de quatre disciplines : analyse de controverses, logique, épistémologie et herméneutique. Le philosophe vieillissant a fait l’objet d’une triple critique : incohérence philosophique, hypocrisie morale et décousu stylistique. Cette image d’une girouette un peu sénile et un peu lâche est pour partie le résultat d’une lecture simplificatrice, initiée par les Antiphilosophes dès l’époque des Lumières, et pour partie le résultat d’une écriture et d’une pensée plurielle, dont la complexité échappe. Le philosophe vieillissant étudie la morale de différents points de vue complémentaires ou antagonistes, oscillant entre la recherche d’une norme universelle du bien et l’étude des circonstances qui font varier les comportements. Nous proposons de lire son œuvre ultime à l’aune de l’encyclopédisme comme une anamorphose jouant de plusieurs thèmes, savoirs et écritures. La cohérence de sa morale dépend alors du point de vue que le lecteur ou le critique adopte. Diderot, conscient que la multiplicité des regards et des styles qu’il propose sur la morale risque d’en troubler la cohérence, réfléchit, dans l’Essai sur les règnes de Claude et de Néron, à une éthique de l’interprétation. Il propose un mode lecture de l’œuvre et la vie de Sénèque qui vaut aussi pour son époque et pour lui-même. Loin de dissoudre l’exigence d’une morale universelle dans l’infinie variation des cultures, des circonstances et des langues, l’interprétation bienveillante rapproche les cultures autant que les différentes conceptions du bien<br>This thesis attempts to interpret Diderot’s disjointed style in ethics, from his trip to Saint-Petersburg until his death (1773-1784), with the help of four disciplines: analysis of the controversies, logic, epistemology and hermeneutic. In the late period, Diderot was criticised for incoherence, moral hypocrisy and ragged writing. On one hand, this image was the result of simplistic reading, initiated by the Counter-Enlightenment. On the other, it comes from a plural way of writing and thinking. The aging philosopher studied ethics from different points of view, oscillating between the search for universal rules and the study of varying circumstances. Considering Diderot’s encyclopedism, this thesis proposes reading the late work as an anamorphosis playing on several themes, knowledge and writings. The consistency of his ethics will therefore rely on the reader’s perspective. Diderot was well aware of the plural reading of his complex work. To counter misinterpretations, he reflected on a moral way to interpret Seneca in his Essai sur les règnes de Claude et de Néron. This practice of interpretation applied as much for Diderot himself as it did for his period. Far from dissolving the need for a universal moral truth in an infinite variation of cultures, circumstances and languages, the philosopher instead tried to bring together these cultures as well as different conceptions of good and evil
7
Topart, Hélène. "Etude d’une nouvelle classe de graphes : les graphes hypotriangulés." Thesis, Paris, CNAM, 2011. http://www.theses.fr/2011CNAM0776/document.
Full textAbstract:
Dans cette thèse, nous définissons une nouvelle classe de graphes : les graphes hypotriangulés. Les graphes hypotriangulés vérifient que pour tout chemin de longueur deux, il existe une arête ou un autre chemin de longueur deux entre ses extrémités. Cette classe permet par exemple de modéliser des réseaux robustes. En effet, nous montrons que dans de tels graphes, la suppression d'une arête ou d'un sommet ne modifie pas la distance initiale entre toutes paires de sommets non adjacents. Ensuite, nous étudions et démontrons plusieurs propriétés pour cette classe de graphes. En particulier, après avoir introduit une famille de partitions spécifiques, nous montrons les relations entre certains éléments de cette famille et leur caractère hypotriangulé. De plus, grâce à ces partitions, nous caractérisons les graphes hypotriangulés minimum, qui, parmi les graphes hypotriangulés connexes, minimisent le nombre d'arêtes pour un nombre de sommets fixés.Dans une deuxième partie, nous étudions la complexité, pour la classe des graphes hypotriangulés, de problèmes difficiles dans le cas général. Nous montrons d'abord que les problèmes classiques de cycle hamiltonien, coloration, clique maximum et stable maximum restent NP-difficiles pour cette classe de graphes. Ensuite, nous nous intéressons à des problèmes de modification de graphes, pour lesquels il s'agit de déterminer le nombre minimal d'arêtes à ajouter ou supprimer à un graphe pour obtenir un graphe hypotriangulé : nous montrons la complexité de ces problèmes pour plusieurs classes de graphes<br>In this thesis, we define a new class of graphs : the hypochordal graphs. These graphs satisfy that for any path of length two, there exists a chord or another path of length two between its two endpoints. This class can represent robust networks. Indeed, we show that in such graphs, in the case of an edge or a vertex deletion, the distance beween any pair of nonadjacent vertices remains unchanged. Then, we study several properties for this class of graphs. Especially, after introducing a family of specific partitions, we show the relations between some of these partitions and hypochordality. Moreover, thanks to these partitions, we characterise minimum hypochordal graph, that are, among connected hypochordal graphs, those that minimise the number of edges for a given number of vertices. In a second part, we study the complexity, for hypochordal graphs, of problems that are NP-hard in the general case. We first show that the classical problems of hamiltonian cycle, colouring, maximum clique and maximum stable set remain NP-hard for this class of graphs. Then, we analyse graph modification problems : deciding the minimal number of edges to add or delete from a graph, in order to obtain an hypochordal graph. We study the complexity of these problems for sevaral classes of graphs
8
Sheppardson, Laura. "Disjoint paths in planar graphs." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/29862.
Full text
9
Bhadoria, Divya. "Learning from spatially disjoint data." [Tampa, Fla.] : University of South Florida, 2004. http://purl.fcla.edu/fcla/etd/SFE0000344.
Full text
10
Rodrigues, Vinicius de Oliveira. "Almost disjoint families em topologia." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-17122018-161936/.
Full textAbstract:
Uma almost disjoint family é uma coleção infinita de subconjuntos infinitos de números naturais tal que a interseção de quaisquer dois de seus elementos distintos é finita. Almost disjoint families podem ser utilizadas para construir um espaço topológico associado chamado de Psi-espaços, também conhecido como espaços de Mrówka. As propriedades topológicas deste espaço topológico dependem das propriedades combinatórias da família que o deu origem, e estes espaços podem ser utilizados para responder perguntas sobre topologia geral, muitas vezes não inicialmente relacionadas com almost disjoint families ou seus respectivos espaços de Mrówka. Neste documento, exploramos diversas construções envolvendo estes objetos utilizando combinatória infinita e princípios combinatórios como diamante, Axioma de Martin e técnicas como Forcing e tratamos de problemas envolvendo compactificações de Stone-Cech, espaços sequenciais, a propriedade de Lindelöf em espaços de funções, hiperespaços de Vietoris, dentre outros. O primeiro capítulo contém diversos pré-requisitos necessários para a leitura desta dissertação a fim de torná-la o mais autocontida possível. O segundo capítulo introduz as almost disjoint families e seus Psi-espaços associados, provando diversas propriedades importantes. Os demais capítulos são independentes entre si e tratam de problemas de Topologia Geral que podem ser solucionados com estes conceitos, ou de problemas que derivam destes conceitos.<br>An almost disjoint family is an infinite collection of infinite subsets of natural numbers such that the intersection of any two of its elements is finite. Almost disjoint families may be used to construct an associated topological space called psi space, also know as Mrówka space. The topological properties of this topological space depends on the combinatorical properties of the family that originated it, and these spaces may be used to answer questions in general topology, many times initially unrelated to almost disjoint families or to their Mrówka spaces. In this document, we explore several constructions involving these objects by using infinitary combinatorics and combinatorical principles like diamond, Martin\'s Axiom, forcing techniques and we treat abour problems regardins Stone-Cech compactifications, sequencial spaces, the property of Lindelöf on spaces of functions, hyperspaces of Vietoris, among others. The first chapter contains several pre requirements that are neccessary to read this dissertation in order to make it as self contained as possible. The second chapter introduces almost disjoint families and their associated Psi spaces, proving several important properties. The following chapters are independent from each other and treat about problems on General Topology that may be solved by using these concepts, or about problems that arises from these concepts.
11
Sadli, Mohammad. "Généralisations de matroïdes et chemins disjoints." Grenoble INPG, 2000. http://www.theses.fr/2000INPG0047.
Full textAbstract:
Le developpement de la theorie des matroides a donne lieu a plusieurs structures qui generalisent ce concept. Dans ce travail nous etudions un probleme de multiflot ou ces structures peuvent etre appliquees. Nous etudions egalement un probleme concernant les multimatroides, ou c'est le lien avec les matroides qui est etudie explicitement. Le premier probleme traite est le probleme de la demande sur les nuds, note ndp. Nous etudions la complexite du probleme et nous formulons les conditions de faisabilite pour les cas ou le probleme est traitable. Nous examinons ensuite le lien entre le ndp et les structures qui generalisent les matroides. Nous etablissons alors plusieurs resultats qui montrent le rapport entre le ndp et les notions de systeme de sauts et de bi-sous-modularite. Le second probleme etudie est le probleme d'extension des 2-matroides, dont nous formulons deux versions possibles : l'extension du rang et l'extension des bases. Nous donnons une solution pour la premiere version probleme, dans le cas general. Pour la deuxieme version nous etablissons une solution pour une classe particuliere de 2-matroides.
12
Bergaoui, Selma. "Surveillance comportementale de systèmes et logiciels embarqués par signature disjointe." Phd thesis, Université de Grenoble, 2013. http://tel.archives-ouvertes.fr/tel-00877476.
Full textAbstract:
Les systèmes critiques, parmi lesquels les systèmes embarqués construits autour d'un microprocesseur mono-cœur exécutant un logiciel d'application, ne sont pas à l'abri d'interférences naturelles ou malveillantes qui peuvent provoquer des fautes transitoires. Cette thèse porte sur des protections qui peuvent être implantées pour détecter les effets de telles fautes transitoires sans faire d'hypothèses sur la multiplicité des erreurs générées. De plus, ces erreurs peuvent être soit des erreurs de flot de contrôle soit des erreurs sur les données. Une nouvelle méthode de vérification de flot de contrôle est tout d'abord proposée. Elle permet de vérifier, sans modifier le système initial, que les instructions du programme d'application sont lues sans erreur et dans le bon ordre. Les erreurs sur les données sont également prises en compte par une extension de la vérification de flot de contrôle. La méthode proposée offre un bon compromis entre les différents surcoûts, le temps de latence de détection et la couverture des erreurs. Les surcoûts peuvent aussi être ajustés aux besoins de l'application. La méthode est mise en œuvre sur un prototype, construit autour d'un microprocesseur Sparc v8. Les fonctions d'analyse de criticité développées dans le cadre de la méthodologie proposée sont également utilisées pour évaluer l'impact des options de compilation sur la robustesse intrinsèque du logiciel d'application.
13
Eikrem, Kjersti Solberg. "Product of Hyperfunctions with Disjoint Support." Thesis, Norwegian University of Science and Technology, Department of Mathematical Sciences, 2008. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9790.
Full textAbstract:
<p>We prove that if two hyperfunctions on the unit circle have disjoint support, then the convolution of their Fourier coefficients multiplied with a weight is zero when the weight goes to 1. We prove this by using the Fourier-Borel transform and the G-transform of analytic functionals. The proof is inspired by an article by Yngve Domar. In the end of his article he proves the existence of a translation-invariant subspace of a certain weighted l^p-space. This proof has similarities to our proof, so we compare them. We also look at other topics related to Domar's article, for example the existence of entire functions of order less than or equal to 1 under certain restrictions on the axes. We will see how the Beurling-Malliavin theorem gives some answers to this question. Finally, we prove that if two hyperfunctions on the real line have compact and disjoint support, then the convolution of their Fourier transforms multiplied with a weight is zero when the weight goes to 1.</p>
14
Kleinberg, Jon M. "Approximation algorithms for disjoint paths problems." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/11013.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.<br>Includes bibliographical references (p. 179-188).<br>by Jon Michael Kleinberg.<br>Ph.D.
15
Martin, Ozgur. "Disjoint Hypercyclic and Supercyclic Composition Operators." Bowling Green State University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1276525949.
Full text
16
Hamdoun, Omar. "Détection et ré-identification de piétons par points d'intérêt entre caméras disjointes." Phd thesis, École Nationale Supérieure des Mines de Paris, 2010. http://pastel.archives-ouvertes.fr/pastel-00566417.
Full textAbstract:
Avec le développement de la vidéo-protection, le nombre de caméras déployées augmente rapidement. Pour exploiter efficacement ces vidéos, il est indispensable de concevoir des outils d'aide à la surveillance qui automatisent au moins partiellement leur analyse. Un des problèmes difficiles est le suivi de personnes dans un grand espace (métro, centre commercial, aéroport, etc.) couvert par un réseau de caméras sans recouvrement. Dans cette thèse nous proposons et expérimentons une nouvelle méthode pour la ré-identification de piétons entre caméras disjointes. Notre technique est fondée sur la détection et l'accumulation de points d'intérêt caractérisés par un descripteur local. D'abord, on propose puis évalue une méthode utilisant les points d'intérêts pour la modélisation de scène, puis la détection d'objets mobiles. Ensuite, la ré-identification des personnes se fait en collectant un ensemble de points d'intérêt durant une fenêtre temporelle, puis en cherchant pour chacun d'eux leur correspondant le plus similaire parmi tous les descripteurs enregistrés précédemment, et stockés dans un KD-tree. Enfin, nous proposons et testons des pistes d'amélioration, en particulier pour la sélection automatique des instants ou des points d'intérêt, afin d'obtenir pour chaque individu un ensemble de points qui soient à la fois les plus variés possibles, et les plus discriminants par rapport aux autres personnes. Les performances de ré-identification de notre algorithme, environ 95% d'identification correcte au premier rang parmi 40 personnes, dépassent l'état de l'art, ainsi que celles obtenues dans nos comparaisons avec d'autres descripteurs (histogramme de couleur, HOG, SIFT).
17
Beyersdorff, Olaf. "Disjoint NP-pairs and propositional proof systems." Doctoral thesis, [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=981087590.
Full text
18
Srinivasan, Sangeetha Rodger C. A. "Disjoint Intersection problem For Steiner triple systems." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Fall%20Theses/Srinivasan_Sangeetha_36.pdf.
Full text
19
Wisiol, Nils. "Disjoint NP-Pairs and Propositional Proof Systems." Thesis, State University of New York at Buffalo, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=1567056.
Full textAbstract:
<p> This thesis on propositional proof systems and disjoint NP-pairs gives a survey of these fields. We present history and motivation of both theories by giving examples for their use. The reader is then introduced into the formal notions of the fields. Dedicated chapters present important and outstanding results from the theories. Some results are proven, some results are given without a proof. It follows a chapter that presents the relation of both fields with a result due to Razborov. As for none of the assertions in this thesis the absolute truth value is known, we also survey some oracles relative to which we know the truth value of important statements. We finally look into open questions and suggest future work on both fields.</p>
20
Kettle, Nathan. "Vertex disjoint subgraphs and non-repetitive sequences." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.707981.
Full text
21
Walker, Tara. ""Each half a nothing, so disjoined" : Mary Shelley's vindication of relational identity." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=21276.
Full textAbstract:
The notion, which has persisted over many years, of Mary Shelley as the conservative daughter of a radical, proto-feminist mother can be traced to the views of Edward Trelawney, a contemporary and fair-weather friend of Shelley. This study, by exploring female identity, largely in terms of modern feminist psychoanalytic theory, in several of Shelley's lesser-known novels, attempts to contribute to the efforts of those who have challenged such notions and who have strived to render a more accurate portrait of Mary Shelley.<br>Anne Mellor's discussion of female identity in Shelley's sentimental novels, Mathilda, Lodore and Falkner, (in her book Mary Shelley: Her Life, Her Fiction, Her Monsters) does much to dispel the notion of Shelley's apathy with regard to gender politics. Mellor convincingly argues that these novels celebrate what she terms the "relational" identity of their heroines, and thus "support a feminist position which argues that female culture is morally superior to male culture." She further maintains, however, that these novels simultaneously reveal the damage that such an identity can do to a woman's personal development.<br>My paper challenges Mellor's assertion that Lodore and Falkner Shelley's last novels, portray relational identity with ambivalence. (Abstract shortened by UMI.)
22
Walker, Tara. "Each half a nothing, so disjoined, Mary Shelley's vindication of relational identity." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0023/MQ50584.pdf.
Full text
23
陳宏達 and Wun-tat Chan. "Efficient algorithms for disjoint paths problems in grids." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B30106497.
Full text
24
Chan, Wun-tat. "Efficient algorithms for disjoint paths problems in grids /." Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B21629845.
Full text
25
Vaz, Sarah L. "Disjoint and Distortion: An Essay in Manifesting Contradiction." University of Cincinnati / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1397467660.
Full text
26
Derakhshan, Parisa. "Automorphisms generating disjoint Hamilton cycles in star graphs." Thesis, Loughborough University, 2015. https://dspace.lboro.ac.uk/2134/16779.
Full textAbstract:
In the first part of the thesis we define an automorphism φn for each star graph Stn of degree n-1, which yields permutations of labels for the edges of Stn taken from the set of integers {1,..., [n/2c]}. By decomposing these permutations into permutation cycles, we are able to identify edge-disjoint Hamilton cycles that are automorphic images of a known two-labelled Hamilton cycle H1 2(n) in Stn. The search for edge-disjoint Hamilton cycles in star graphs is important for the design of interconnection network topologies in computer science. All our results improve on the known bounds for numbers of any kind of edge-disjoint Hamilton cycles in star graphs.
27
Sumi, Gregory. "On the visibility graph of disjoint and congruent discs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ37984.pdf.
Full text
28
Liu, Luo. "QoS in node-disjoint routing for ad hoc networks." Thesis, Queen Mary, University of London, 2009. http://qmro.qmul.ac.uk/xmlui/handle/123456789/1536.
Full textAbstract:
A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate with each other without using any fixed infrastructure. It is necessary for MANETs to have efficient routing protocol and quality of service (QoS) mechanism to support multimedia applications such as video and voice. Node-Disjoint Multipath Routing Protocol (NDMR) is a practical protocol in MANETs: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. Because QoS support in MANETs is important as best-effort routing is not efficient for supporting multimedia applications, this thesis presents a novel approach to provide that support. In this thesis NDMR is enhanced to provide a QoS enabled NDMR that decreases the transmission delay between source and destination nodes. A multi-rate mechanism is also implemented in the new protocol so that the NDMR QoS can minimise the overall delays. It is shown that these approaches lead to significant performance gains. A modification to NDMR is also proposed to overcome some of the limitations of the original.
29
Vaessen, Nik. "Training Multi-Task Deep Neural Networks with Disjoint Datasets." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-283652.
Full textAbstract:
This work examines training neural networks which are capable of learning multiple tasks. We propose an architecture trained on KITTI and Cityscapes, which respectively include only the annotations for 2D object detection and semantic segmentation. We propose 4 methods for training with disjoint datasets, and show the difference in performance with hyperparameters taken from literature as well as a hyperparameter search. We show the feasibility of training with disjoint datasets. We observe that the best strategy for training is using multiple forward passes and summing the gradients. By using multi-task learning we note an increase in mean average precision for the 2D object detection task but a decrease in mean intersection over union for the semantic segmentation task.<br>Detta arbete undersöker träning av neurala nätverk som kan lära sig att utföra flera uppgifter samtidigt. Vi föreslår en arkitektur tränad på KITTI- och Cityscapes-data, där respektive dataset endast innehåller annoteringar för objektdetektering i 2D samt för semantisk segmentering. Vi föreslår fyra metoder för träning med de disjunkta dataseten och visar skillnaden i prestanda med hyperparametrar tagna från litteraturen samt med hyperparametersökning. Vi påvisar möjligheten att träna med disjunkta dataset och observerar även att den bästa strategin för träning är att använda sig av flertalet framåtpasseringar och summera gradienterna. Genom att använda denna strategi under fleruppgiftsträning, noterar vi en ökning i medelvärdet av precisionen för objektdetektering i 2D, men en minskning i medelvärdet av snittet genom unionen för semantisk segmentering.
30
Yeh, Jieh-Shan George. "Large sets of disjoint t-(v,k,[lambda]) designs /." The Ohio State University, 1999. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488193272069635.
Full text
31
Daouda, Ahmat mahamat. "Définition d'une infrastructure de sécurité et de mobilité pour les réseaux pair-à-pair recouvrants." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0186/document.
Full textAbstract:
La sécurisation inhérente aux échanges dans les environnements dynamiques et distribués, dépourvus d’une coordination centrale et dont la topologie change perpétuellement, est un défi majeur. Dans le cadre de cette thèse, on se propose en effet de définir une infrastructure de sécurité adaptée aux contraintes des systèmes P2P actuels. Le premier volet de nos travaux consiste à proposer un intergiciel, appelé SEMOS, qui gère des sessions sécurisées et mobiles. SEMOS permet en effet de maintenir les sessions sécurisées actives et ce, même lorsque la configuration réseau change ou un dysfonctionnement se produit. Cette faculté d’itinérance est rendue possible par la définition d’un nouveau mécanisme de découplage afin de cloisonner l’espace d’adressage de l’espace de nommage ; le nouvel espace de nommage repose alors sur les tables de hachage distribuées (DHT). Le deuxième volet définit un mécanisme distribué et générique d’échange de clés adapté à l’architecture P2P. Basé sur les chemins disjoints et l’échange de bout en bout, le procédé de gestion des clés proposé est constitué d’une combinaison du protocole Diffie-Hellman et du schéma à seuil(k, n) de Shamir. D’une part, l’utilisation des chemins disjoints dans le routage des sous-clés compense l’absence de l’authentification certifiée, par une tierce partie, consubstantielle au protocole Diffie-Hellman et réduit, dans la foulée, sa vulnérabilité aux attaques par interception. D’autre part, l’extension de l’algorithme Diffie-Hellman par ajout du schéma à seuil (k, n) renforce substantiellement sa robustesse notamment dans la segmentation des clés et/ou en cas de défaillances accidentelles ou délibérées dans le routage des sous-clés. Enfin, les sessions sécurisées mobiles sont évaluées dans un réseau virtuel et mobile et la gestion des clés est simulée dans un environnement générant des topologies P2P aléatoires<br>Securing communications in distributed dynamic environments, that lack a central coordination point and whose topology changes constantly, is a major challenge.We tackle this challenge of today’s P2P systems. In this thesis, we propose to define a security infrastructure that is suitable to the constraints and issues of P2P systems. The first part of this document presents the design of SEMOS, our middleware solution for managing and securing mobile sessions. SEMOS ensures that communication sessions are secure and remain active despite the possible disconnections that can occur when network configurations change or a malfunction arises. This roaming capability is implemented via the definition of a new addressing space in order to split up addresses for network entities with their names ; the new naming space is then based on distributed hash tables(DHT). The second part of the document presents a generic and distributed mechanism for a key exchange method befitting to P2P architectures. Building on disjoint paths andend-to-end exchange, the proposed key management protocol consists of a combination of the Diffie-Hellman algorithm and the Shamir’s (k, n) threshold scheme. On the onehand, the use of disjoint paths to route subkeys offsets the absence of the third party’s certified consubstantial to Diffie-Hellman and reduces, at the same time, its vulnerability to interception attacks. On the other hand, the extension of the Diffie-Hellman algorithm by adding the threshold (k, n) scheme substantially increases its robustness, in particular in key splitting and / or in the case of accidental or intentional subkeys routing failures. Finally, we rely on a virtual mobile network to assess the setup of secure mobile sessions.The key management mechanism is then evaluated in an environment with randomly generated P2P topologies
32
Sasi, Kumar Sarath K. "A multi-exchange heuristic for formation of balanced disjoint rings." Texas A&M University, 2005. http://hdl.handle.net/1969.1/4428.
Full textAbstract:
Telecommunication networks form an integral part of life. Avoiding failures on
these networks is always not possible. Designing network structures that survive these
failures have become important in ensuring the reliability of these network structures.
With the introduction of SONET (Synchronous Optical Network) technology, rings
have become the preferred survivable network structure. This network configuration
has a set of disjoint rings (each node being a part of single ring), and these disjoint
rings are connected via another main ring. In this research, we present a mathematical
model for the design of such disjoint rings with node number balance criterion
among the rings. When, given a set of nodes and distances between them, the Balanced
Disjoint Rings (BDR) problem is the minimum total link length clustering of
nodes into a given number of disjoint rings in such a way that there is almost the
same number of nodes in each ring. The BDR problem is a class of the standard
Traveling Salesman Problem (TSP). It is clear from this observation that the BDR
problem becomes a TSP when the number of rings required is set to one. Hence
BDR is NP-Hard, and we do not expect to obtain a polynomial time algorithm for
its solution. To overcome this problem, we developed a set of construction heuristics
(Break-MST, Distance Method, Hybrid Method, GRASP-Based Distance Method)
and improvement heuristics (Multi-Exchange, Single Move). Different combinations of construction and improvement heuristics were implemented and the quality of solution
thus obtained was compared to the standard Branch and Cut Technique. It was
found that the algorithm with GRASP-Based Distance Method as the construction
heuristic and multi-exchange - single-move combination as the improvement heuristic
performed better than other combinations. All combinations performed better in
general than the standard Branch and Cut technique in terms of solution time.
33
Bueno, Hedo Javier. "Run-time support for multi-level disjoint memory address spaces." Doctoral thesis, Universitat Politècnica de Catalunya, 2015. http://hdl.handle.net/10803/323374.
Full textAbstract:
High Performance Computing (HPC) systems have become widely used tools in many industry areas and research fields. Research to produce more powerful and efficient systems has grown in par with their popularity. As a consequence, the complexity of modern HPC architectures has increased in order to provide systems with the highest levels of performance. This increased complexity has also affected the way HPC systems are programmed. HPC users have to deal with new devices, languages and tools, and this is can be a significant access barrier to people that do not have a deep knowledge in computer science.
On par with the evolution of HPC systems, programming models have also evolved to ease the task of developing applications for these machines. Two well-known examples are OpenMP and MPI. The former can be used in shared memory systems and is praised for offering an easy methodology of software development. The latter is more popular because it targets distributed environments but it is considered burdensome to use. Besides these two, many programming models have emerged to propose new methodologies or to handle new hardware devices. One of these models is OmpSs.
OmpSs is a programming model for modern HPC systems that is based on OpenMP and StarSs. Developed by the Programming Models group at the Barcelona Supercomputing Center, it targets the latest generation of HPC systems while benefiting from the ease of use of OpenMP. OmpSs offers asynchronous parallelism with the concept of tasks with data dependencies. These tasks allow the specification of sections of code that can be executed in parallel while the dependencies specify the restrictions about the order in which the tasks can be executed. With this, OmpSs programs can adapt to a many different system configurations while fundamentally still being sequential programs with annotations.
This thesis explores the benefits of providing OmpSs the capability to target architectures with complex memory hierarchies. An example of such systems can be the new generation of clusters that use accelerators to power their computing capabilities. The memory hierarchy of these machines is composed of a first level of distributed memory formed by the memory of each individual node, and a second level formed by the private memory of each accelerator devices.
Our first contribution shows the implementation of the support of cluster of multi-cores for the OmpSs programming model. We also present two optimizations to boost the performance of applications running on top of cluster systems: a specific task scheduling policy and the addition of slave-to-slave transfers. We evaluate our implementation using a set of benchmarks coded in OmpSs and we also compare them against the same applications implemented using MPI, the most widely used programming model for these systems.
We extend our initial implementation in our second contribution, which provides OmpSs with support for clusters of GPUs. We show that OmpSs programs targeting these complex systems are capable of achieving a good performance when compared against MPI+CUDA implementations.
The third contribution of this thesis presents an implementation and evaluation of the performance and programmability impact of supporting non-contiguous memory regions. Offering this feature allows applications with complex data accesses to be easily annotated with OmpSs. This is important to widen the spectrum of applications that can be handled by the programming model.<br>Els sistemes de computació d'altes prestacions (CAP) han esdevingut eines importants en diferents sectors industrials i camps de recerca. La recerca per produir sistemes més potents i eficients ha crescut proporcionalment a aquesta popularitat. Com a conseqüència, la complexitat d'aquest tipus de sistemes s'ha incrementat per tal de dotar-los d'altes prestacions. Aquest increment en la complexitat també ha afectat la manera de programar aquest tipus de sistemes. Els usuaris de sistemes CAP han de treballar amb nous dispositius, llenguatges i eines, i això pot convertir-se en una barrera d'entrada significativa per aquelles persones que no tinguin uns alts coneixements informàtics. Seguin l'evolució dels sistemes CAP, els models de programació també han evolucionat per tal de facilitar la tasca de desenvolupar aplicacions per aquests sistemes. Dos exemples ben coneguts son OpenMP i MPI. El primer es pot utilitzar en sistemes de memòria compartida i es reconegut per oferir una metodologia de desenvolupament senzilla. El segon és més popular perquè està dissenyat per sistemes distribuïts, però està considerat difícil d'utilitzar. A part d'aquests dos, altres models de programació han sorgit per proposar noves metodologies o per suportar nous components hardware. Un d'aquests nous models és OmpSs. OmpSs és un model de programació per sistemes CAP moderns que està basat en OpenMP i StarSs. Desenvolupat pel grup de Models de Programació del Barcelona Supercomputing Center, està dissenyat per suportar la darrera generació de sistemes CAP i alhora oferir la facilitat d'us d'OpenMP. OmpSs ofereix paral·lelisme asíncron mitjançant el concepte de tasques amb dependències de dades. Aquestes tasques permeten especificar regions de codi que poden ser executades en paral·lel, mentre que les dependències especifiquen les restriccions sobre l'ordre en que aquestes tasques poden ser executades. Amb això, els programes fets amb OmpSs poden adaptar-se a sistemes amb diferents configuracions tot i ser fonamentalment programes seqüencials amb anotacions. Aquesta tesi explora els beneficis de proveir a OmpSs amb la capacitat de funcionar sobre arquitectures amb jerarquies de memòria complexes. Un exemple d'un sistema així pot ser un dels clústers de nova generació que utilitzen acceleradors per tal d'oferir més capacitat de càlcul. La jerarquia de memòria en aquestes màquines està composada per un primer nivell de memòria distribuïda formada per la memòria de cada node individual, i el segon nivell està format per la memòria privada de cada accelerador. La primera contribució d'aquesta tesi mostra la implementació del suport de clústers de multi-cores pel model de programació OmpSs. També presentem dos optimitzacions per millorar el rendiment de les aplicacions quan s'executen en sistemes clúster: una política de planificació de tasques específica i la incorporació dels missatges entre nodes esclaus. Avaluem la nostra implementació usant un conjunt d'aplicacions programades en OmpSs i també les comparem amb les mateixes aplicacions implementades usant MPI, el model de programació més estès per aquest tipus de sistemes. En la segona contribució estenem la nostra implementació inicial per tal de dotar OmpSs de suport per clústers de GPUs. Mostrem que els programes OmpSs son capaços d'obtenir un bon rendiment sobre aquests tipus de sistemes, fins i tot quan els comparem amb versions implementades usant MPI+CUDA. La tercera contribució descriu la implementació i avaluació del rendiment i de l'impacte de suportar regions de memòria no contigües. Oferir aquesta funcionalitat permet implementar fàcilment amb OmpSs aplicacions amb accessos complexes a memòria, cosa que és important de cara a ampliar l'espectre d'aplicacions que poden ser tractades pel model de programació.
34
Özçam, Burcu. "Genetic Algorithms for Solving Disjoint PathProblem with Proportional Path-Costs." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20010629-132423.
Full textAbstract:
<p>This study was conducted to develop solution algorithms for the edge-disjoint path problem with proportional path-costs in an undirected network with single source-destination pair. Edge-disjoint path problem arises in connectivity analysis, network flow problems, VLSI-design and variety of applications. The complexity of all the variants of the disjoint path problemsis NP-hard. We proposed two genetic algorithms which differ in solution representation.The performance of both algorithms tested on small, medium and large size complete graphs using different cost structures. As a result, genetic algorithm with priority-based encoding is shown to beinefficient, whereas genetic algorithm with variable-length path encoding is shown to be satisfactoryfor finding the edge-disjoint paths with proportional path-costs.<P>
35
Jeong, Kideog. "OBJECT MATCHING IN DISJOINT CAMERAS USING A COLOR TRANSFER APPROACH." UKnowledge, 2007. http://uknowledge.uky.edu/gradschool_theses/434.
Full textAbstract:
Object appearance models are a consequence of illumination, viewing direction, camera intrinsics, and other conditions that are specific to a particular camera. As a result, a model acquired in one view is often inappropriate for use in other viewpoints. In this work we treat this appearance model distortion between two non-overlapping cameras as one in which some unknown color transfer function warps a known appearance model from one view to another. We demonstrate how to recover this function in the case where the distortion function is approximated as general affine and object appearance is represented as a mixture of Gaussians. Appearance models are brought into correspondence by searching for a bijection function that best minimizes an entropic metric for model dissimilarity. These correspondences lead to a solution for the transfer function that brings the parameters of the models into alignment in the UV chromaticity plane. Finally, a set of these transfer functions acquired from a collection of object pairs are generalized to a single camera-pair-specific transfer function via robust fitting. We demonstrate the method in the context of a video surveillance network and show that recognition of subjects in disjoint views can be significantly improved using the new color transfer approach.
36
Palmer, Joseph McRae. "Real-time carrier frequency estimation using disjoint pilot symbol blocks /." Diss., CLICK HERE for online access, 2009. http://contentdm.lib.byu.edu/ETD/image/etd2786.pdf.
Full text
37
Palmer, Joseph M. "Real-Time Carrier Frequency Estimation Using Disjoint Pilot Symbol Blocks." BYU ScholarsArchive, 2009. https://scholarsarchive.byu.edu/etd/1780.
Full textAbstract:
Three new and efficient carrier frequency offset estimators are created for the case of disjoint pilot symbol blocks. The estimators are efficient in both a statistical sense and a computational sense. They are formulated to reduce computational cost for use in real-time applications, such as FPGA (field programmable gate array) devices. A reduced cost maximum likelihood (ML) frequency estimator is described. It is a generalization of the approximate ML estimator for a single block of pilot symbols. A number of recent ML estimation techniques are integrated with the purpose of reducing the computational cost while preserving estimation performance. The estimator incorporates multirate signal processing methods, FFT periodogram searches, and directed periodogram searches. The subsequent relationships between FFT lengths, resampling rates, and search iterations is established. The proposed estimator exhibits very good accuracy, operating range, and a low SNR threshold, and has low cost. A data-aided frequency estimator based on the measurement of phase increments, is also derived. It has extremely low cost, but a high SNR threshold. However, its formulation is such that a careful analysis of the range error problem may be performed. From this analysis certain conclusions are made about proper pilot symbol organization, and these conclusions are applicable to other frequency estimators. The third estimator is a generalization of the autocorrelation frequency estimation technique. The generalizations are needed to account for the spacings between the pilot blocks. A novel iterative approach, incorporating a Kalman filter, is used to improve operating range. It is shown that the autocorrelation frequency estimator exhibits good accuracy while maintaining a useful operating range. Real-time architectures are described for the ML and autocorrelation frequency estimators using disjoint pilot blocks. The computational cost and estimation performance of the proposed estimators are analyzed and it is shown that they give estimation performance near to theoretical limits, while preserving wide operating range. We see that the autocorrelation estimator is appropriate for small numbers of pilot symbols, while the ML estimator is appropriate for large numbers of pilot symbols. The new frequency estimators are the first to be derived (for the case of disjoint blocks of pilot symbols) such that computational cost is kept low, while still achieving high accuracy, a wide operating range, and low SNR thresholds.
38
Meden, Boris. "Ré-identification de personnes : Application aux réseaux de caméras à champs disjoints." Phd thesis, Université Paul Sabatier - Toulouse III, 2013. http://tel.archives-ouvertes.fr/tel-00822779.
Full textAbstract:
Cette thèse s'inscrit dans le contexte de la vidéosurveillance "intelligente", et s'intéresse à la supervision de réseaux de caméras à champs disjoints, contrainte classique lorsque l'on souhaite limiter l'instrumentation du bâtiment. Il s'agit là de l'un des cas d'application du problème de la ré-identification de personnes. À ce titre, la thèse propose une approche se démarquant de l'état de l'art qui traite classiquement le problème sous l'aspect description, via la mise en correspondance de signatures image à image. Nous l'abordons ici sous l'aspect filtrage : comment intégrer la ré-identification de personne dans un processus de suivi multi-pistes, de manière à maintenir des identités de pistes cohérentes, malgré des discontinuités dans l'observation. Nous considérons ainsi une approche suivi et mises en correspondance, au niveau caméra et utilisons ce module pour ensuite raisonner au niveau du réseau. Nous décrivons dans un premier temps les approches classiques de ré-identification, abordées sous l'aspect description. Nous proposons ensuite un formalisme de filtrage particulaire à états continus et discret pour estimer conjointement position et identité de la cible au cours du temps, dans chacune des caméras. Un second étage de traitement permet d'intégrer la topologie du réseau et les temps d'apparition pour optimiser la ré-identification au sein du réseau. Nous démontrons la faisabilité de l'approche en grande partie sur des données issues de réseaux de caméras déployés au sein du laboratoire, étant donné le manque de données publiques concernant ce domaine. Nous prévoyons de mettre en accès public ces banques de données.
39
Lee, Sang Myung (Chris). "Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem." Thesis, University of Canterbury. Computer Science and Software Engineering, 2011. http://hdl.handle.net/10092/6494.
Full textAbstract:
The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. This problem was first introduced by Grenander and brought to computer science by Bentley in 1984. This problem has been branched out into other problems based on their characteristics. k-overlapping maximum subarray problem where the overlapping solutions are allowed, and k-disjoint maximum subarray problem where all the solutions are disjoint from each other are those. For k-overlapping maximum subarray problems, significant improvement have been made since the problem was first introduced.
For k-disjoint maximum subarrsy, Ruzzo and Tompa gave an O(n) time solution for one-dimension. This solution is, however, difficult to extend to two-dimensions. While a trivial solution of O(kn^3) time is easily obtainable for two-dimensions, little study has been undertaken to better this. This paper introduces a faster algorithm for the k-disjoint maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication. Also, DMM reuse technique is introduced for the maximum subarray problem based on recursion for space optimization.
40
Biyanov, Andrey Y. Luxemburg W. A. J. Luxemburg W. A. J. "Evolution equations and semigroups of operators with the disjoint support property /." Diss., Pasadena, Calif. : California Institute of Technology, 1995. http://resolver.caltech.edu/CaltechETD:etd-09052007-110700.
Full text
41
Obenofunde, Simon. "Topology Management in wireless sensor networks." Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCK025.
Full textAbstract:
La mise en réseau de capteurs sans fil s'intègre dans presque tous les domaines des activités humaines. Les moteurs de cette technologie comprennent ses domaines d'application et les améliorations des techniques de fabrication microélectroniques. Le réseau est constitué de plusieurs nœuds de capteurs de petite taille déployés dans la zone à détecter. Les nœuds ont des capacités de traitement, de communication et de détection qui leur permettent d'exécuter leur fonction de manière collaborative. Ils détectent les événements et transmettent les informations à un puits directement ou via des nœuds intermédiaires servant de relais.Des progrès considérables ont été réalisés sur cette technologie au cours des dernières années, cependant la gestion de l’énergie n’a pas connu la même évolution. Ceci est principalement dû au fait que la batterie est la principale source d'énergie. De plus, l’environnement du réseau peut empêcher les batteries d'être rechargées ou changées après le déploiement.Une solution classique à ce problème d'efficacité énergétique réside dans la gestion des cycles d’activation. Il s'agit d’alterner, de façon périodique ou non, les états actif et inactif des nœuds. Cela introduit des problèmes de performances réseaux en termes de disponibilité, de latence et de taux d’acheminement des paquets, car les nœuds inactifs ne participent pas aux communications. Il est donc important de trouver des solutions permettant d’utiliser les cycles d’activation tout en garantissant la disponibilité et en réduisant la latence et le taux de perte de paquets.Dans cette thèse, nous utilisons le cycle d’activation en combinaison avec la gestion de la topologie pour prolonger la durée de vie du réseau. Nous proposons cinq algorithmes pour construire différentes topologies que nous divisons en deux classes. La première classe organise les nœuds en ensembles de manière répétitive et entrelacée. C'est-à-dire que les nœuds appartenant à différents ensembles sont intercalés de manière à assurer la continuité des communications. La seconde classe d'algorithmes organise les nœuds en ensembles successifs en couronne. Nous avons montré expérimentalement la construction des différents ensembles.En utilisant la construction successive d’ensembles, nous proposons deux algorithmes qui construisent des réseaux dorsaux (backbones) virtuels disjoints pouvant être activés alternativement. Une évaluation des algorithmes fait ressortir leur efficacité, avec notamment un facteur d’approximation faible (de l’ordre de 3.5) en comparaison avec ceux des travaux de la littérature.Nous proposons ensuite un protocole basé sur les mécanismes de sommeil et relais sur ces topologies. Les périodes d’activité/inactivité sont définies par ensemble. Les résultats expérimentaux montrent que ce protocole permet une économie d’énergie sans dégrader les critères de performance tels que la latence et le taux d’acheminement des paquets<br>Wireless sensor networking is ingratiating itself into almost every area of human endeavors. Its drivers include its usages, improvements in microelectronics and manufacturing techniques. The network is made up of multiple tiny sensor nodes deployed in the area to be sensed, with nodes having processing, communicating, and sensing capabilities that enable them to perform their function collaboratively. Nodes sense events and transmit their data to the sink directly or through intermediate nodes acting as relay.Despite all the tremendous advances that have been made on this technology over the past few years, energy has not kept pace. This is based mostly on the fact that battery is its main source of energy. Furthermore, some applications of the network may preclude batteries from either being recharged or changed after deployment.A renowned solution to energy efficiency is duty cycling. This is the periodic or aperiodic placing of a node in an active and an inactive state. This introduces network performance issues of availability, latency, and packet delivery ratio, all linked to the fact that once a node is inactive or off, it is unavailable to communicate. It is therefore important to look for means of still applying duty cycling yet not losing out in availability, latency, and packet delivery ratio.In this dissertation we employ duty cycle on topology management to extend the network lifetime. We propose five algorithms to build various topologies that we divide into two classes. The first class enables nodes to arrange themselves into repetitive and interleaving sets. That is, nodes in the same set repeat themselves on the ground such that a set spans the entire area to be sensed. The second class of algorithms arranges nodes in continuous successive sets with members of a set covering a transmission range. We demonstrate the set formation experimentally.Building on the continuous set formation we propose two algorithms that build disjoint virtual backbone networks, with the disjointedness used for activity scheduling. We then measure the performances of the algorithms notably the approximation ratio and find it quite low (in the order of 3.5) compared to what is obtained in the literature.Finally, we propose a sleep and relay protocol that works on these topologies. Nodes sleep in sets and the activeness is relayed between sets. We evaluate the performance of this protocol and confirm that it actually leads to increase energy savings while not deteriorating other network performance metrics, like latency and packet delivery ratio
42
Supreeth, Koushik Sheshadri. "Multi-constrained node-disjoint multipath QoS routing algorithms for status dissemination networks." Online access for everyone, 2004. http://www.dissertations.wsu.edu/Thesis/Spring2004/S%5FSheshadri%5F050304.pdf.
Full text
43
Senel, Fatih. "Detecting and connecting disjoint sub-networks in Wireless Sensor and Actor Networks /." Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1559859561&sid=4&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Full text
44
Lébraly, Pierre. "Etalonnage de caméras à champs disjoints et reconstruction 3D : Application à un robot mobile." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2012. http://tel.archives-ouvertes.fr/tel-00795259.
Full textAbstract:
Ces travaux s'inscrivent dans le cadre du projet VIPA " Véhicule Individuel Public Autonome ", au cours duquel le LASMEA et ses partenaires ont mis au point des véhicules capables de naviguer automatiquement, sans aucune infrastructure extérieure dédiée, dans des zones urbaines (parkings, zones piétonnes, aéroports). Il est doté de deux caméras, l'une à l'avant, et l'autre à l'arrière. Avant son déploiement, le véhicule doit tout d'abord être étalonné et conduit manuellement afin de reconstruire la carte d'amers visuels dans laquelle il naviguera ensuite automatiquement. Les travaux de cette thèse ont pour but de développer et de mettre en oeuvre des méthodes souples permettant d'étalonner cet ensemble de caméras dont les champs de vue sont totalement disjoints. Après une étape préalable d'étalonnage intrinsèque et un état de l'art sur les systèmes multi-caméra, nous développons et mettons en oeuvre différentes méthodes d'étalonnage extrinsèque (déterminant les poses relatives des caméras à champs de vue disjoints). La première méthode présentée utilise un miroir plan pour créer un champ de vision commun aux différentes caméras. La seconde approche consiste à manoeuvrer le véhicule pendant que chaque caméra observe une scène statique composée de cibles (dont la détection est sous-pixellique). Dans la troisième approche, nous montrons que l'étalonnage extrinsèque peut être obtenu simultanément à la reconstruction 3D (par exemple lors de la phase d'apprentissage), en utilisant des points d'intérêt comme amers visuels. Pour cela un algorithme d'ajustement de faisceaux multi-caméra a été développé avec une implémentation creuse. Enfin, nous terminons par un étalonnage déterminant l'orientation du système multi-caméra par rapport au véhicule.
45
Narayanan, T. S. "Query processing in distributed database with non-disjointed data fragmentation." Thesis, 1985. http://spectrum.library.concordia.ca/4057/1/ML30629.pdf.
Full text
46
Tomasovic, Brian Scott. "Disjointed connections : the presidential permitting of tar sands oil pipelines at the U.S.-Canadian border." Thesis, 2010. http://hdl.handle.net/2152/ETD-UT-2010-12-2536.
Full textAbstract:
The fuel for dynamic change in the United State’s energy relationship with Canada lies in immense deposits of tar sands beneath the boreal forests of Alberta province. Unconventional production of oil from this resource has accelerated in recent years and remains poised for continued expansion, facilitated, in part, by plans to import tar sands crude through new pipelines to refineries in the United States. However, the development of this resource carries uniquely heavy environmental burdens, and U.S. environmental groups have challenged the process by which the United States authorizes cross-border oil pipelines. This thesis analyzes the presidential permitting process and concludes that executive or legislative action is necessary to eliminate legal uncertainties and improve the transparency and public acceptability of determinations that new cross-border pipelines are warranted.<br>text
47
Plaskocinska, Patrycja. "Between hair and the Johannesburg art gallery: a hair museum mediating the disjointed context by inspiring public ownership through the celebration of an African Art Form." Thesis, 2015. http://hdl.handle.net/10539/17581.
Full textAbstract:
Master of Architecture [Professional] at the University of the Witwatersrand, Johannesburg, South Africa, in the year 2014.<br>In the case of Johannesburg, unlike cities
around the world that experienced inner city
decline, its city centre was never entirely
abandoned. It experienced rapid social
change. As Johannesburg was beginning to
change, the Johannesburg Art Gallery (JAG)
was experiencing a declining number of
visitors. Unable to engage with the changing
social structure, a fence was built around it
and JAG turned itself inwards. This thesis
explores the intention to take advantage of
the rich and dynamic informal industry of hair
that has emerged around JAG. Hair is loaded
with social, sexual and political undercurrents.
In an African city that has been colonized
and becoming increasingly globalised, hair’s
relevance in terms of politics must be brought
to the forefront. By acknowledging the thriving
inner workings and its contributors and by
engaging in a critical discussion that people
can relate to, JAG will be embraced by the
community again.
An intervention of mediation through
architecture is proposed. A Hair Museum
perched on the opposite side of the railway
that weaves JAG closer into its current context
by opening and improving dialogue between
the disjointed surroundings. A new museum as a mediator explores the idea of museum-asurban
system. The question is asked whether
a public institution is capable of assisting a
society through a museum by looking at the
concept of the Greek ideal of kalokagathia,
which means the perfection of the body and
city based on balance, justice and proportion.
This thesis essentially explores Julian
Carman’s idea of a museum1; that the key
to JAG’s survival and upliftment lies only if it
inspires public ownership.
This thesis will explore the significance of
celebrating hair in an African city with visible
impacts of an imperialist past. By celebrating
hair, thereby beginning the discourse of it’s
connotations, will allow for a transgression
into where society and its’ perception of itself
stands in a globalizating world. Museum’s
play a key role in society to not only preserve
memories but also re-ordering them and
making sense of them for later generations
(Watson, 2007: 4). The proposed Hair
Museum as mediator is not so much about
saving a contested and feared city- as much
as it is about embracing the new spirit of the
city and encouraging the potential held within.
1 Julian Carman, Author of ‘Uplifting
The Colonial Philistine: Florence Phillips And The
Making Of The Johannesburg Art Gallery’. See References.
48
Zhang, Liyu. "Disjoint NP-pairs." 2007. http://proquest.umi.com/pqdweb?did=1397920771&sid=2&Fmt=2&clientId=39334&RQT=309&VName=PQD.
Full textAbstract:
Thesis (Ph.D.)--State University of New York at Buffalo, 2007.<br>Title from PDF title page (viewed on Mar. 04, 2008) Available through UMI ProQuest Digital Dissertations. Thesis adviser: Selman, Alan L. Includes bibliographical references.
49
Chen, Demeng. "Large sets of disjoint packings and large sets of disjoint GDDs." 1994. http://hdl.handle.net/1993/17885.
Full text
50
Klimošová, Tereza. "Immersions and edge-disjoint linkages." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-313889.
Full textAbstract:
Graph immersions are a natural counterpart to the widely studied concepts of graph minors and topological graph minors, and yet their theory is much less developed. In the present work we search for sufficient conditions for the existence of the immersions and the properties of the graphs avoiding an immersion of a fixed graph. We prove that large tree-with of 4-edge-connected graph implies the existence of immersion of any 4-regular graph on small number of vertices and that large maximum degree of 3-edge-connected graph implies existence of immersion of any 3-regular graph on small number of vertices.