• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 193
  • 174
  • 43
  • 33
  • 14
  • 3
  • 3
  • 2
  • 2
  • Tagged with
  • 464
  • 246
  • 74
  • 56
  • 53
  • 50
  • 44
  • 40
  • 38
  • 37
  • 36
  • 32
  • 32
  • 31
  • 31
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Topologically-aware Construction of Unstructured Overlays over Ad Hoc Networks/Construction topologiquement avertie d'overlays sans structure sur des réseaux ad hocs

Calomme, Sandrine 12 January 2009 (has links)
The number of electronic devices, equipped with a wireless interface has exploded over the last decades. Unfortunately, their usage is often restricted to the connection to a wired infrastructure, even for local communications. That is quite surprising as the research area of infrastructureless, or ad hoc, networks has flourished for years. The literature on ad hoc networks is very rich, but their usage almost inexistent. Potential users have plenty of solutions at hand, but do not exploit them. Even if ad hoc networks allow us to get rid of the infrastructure, they still require an implicit agreement on the solution to use. Nevertheless, it is very dicult to pick in the rich panel of protocols the best one, that would fit any ad hoc user in any ad hoc network. As an example, it has been demonstrated, for the routing, that each protocol has definite advantages and disadvantages, in every different scenario, and is well suited for certain situations. Yet, a salient feature of ad hoc networks is precisely that the panel of situations is very large. The ad hoc network conditions are influenced by the number of ad hoc users, their relative positions, their capabilities, their mobility pattern, the applications they use, the traffic load and type, and so forth. Moreover, the users may themselves be heterogeneous, with different hardware and software capabilities, mobile behaviour and communication needs. Hence, there is a particular need in ad hoc networking for flexible techniques. We contribute to this problem by studying the feasibility of overlay routing and giving some hints in that direction. We explain how the overlay members can avoid the expensive process of building an overlay topology, before using their customised routing application. The rationale exploits the broadcast nature of ad hoc networks, and is qualified as a Reactive Overlay Approach. We also detail an elementary reactive overlay routing application and test it, by simulations, in a variety of conditions, including the network and overlay densities. This performance study shows the feasibility and the efficiency of overlay routing applications developed according to the Reactive Overlay Approach. It also evidences the impact of using an appropriate value for the neighbourhood range, defined as the maximum number of hops between two overlay neighbours. Hence, we detail the critical neighbourhood range (CNR) problem, which, in short, consists in determining the minimum neighbourhood range value that generates a connected overlay. We solve it in the asymptotic case, i.e. when the number of nodes in the underlay or the size of the field tends to infinity. The mathematical results are interesting in the sense that they can be useful for a better understanding of the interaction between various typical characteristics of a connected overlay topology on an ad hoc network. However, the theoretical, asymptotic, CNR is not adequate in practice. We thus also explore heuristics for estimating the CNR. We present a simple protocol which estimates an appropriate neighbourhood range for overlay routing applications. For the purpose of its evaluation, we define general performance criteria based on overlay flooding. Namely, these are the delivery percentage, bandwidth consumption and time duration of flooding on the overlay. The main drawback of the Reactive Overlay Approach is the amount of bandwidth consumed during the flooding of overlay route requests. Hence, we also consider the Proactive Overlay Approach, which consists in building the overlay topology before the emission of any overlay broadcast message, and maintaining it. We compare the quality of various overlay topologies in the static case. We finally describe and evaluate the Overlay Topology Control (OTC) protocol, that maintains, in a mobile context, the overlay topology as close as possible to the overlay topology evaluated as the best. The main objection that would arise against overlay routing on ad hoc networks is that the ad hoc nodes do generally own poor resources and that overlay routing consumes them even more than native routing. The feasibility study we conducted with the reactive approach and the evaluation of OTC, designed in the context of the proactive overlay approach, confirm that the consumption of resources must be handled carefully. Nevertheless, they show that this problem is not insurmountable.

Navigation visuelle d'un robot mobile dans un environnement d'extérieur semi-structuré

Aviña Cervantes, Juan Gabriel. Devy, Michel January 2005 (has links)
Reproduction de : Thèse de doctorat : Signal, image et acoustique : Toulouse, INPT : 2005. / Titre provenant de l'écran-titre. Bibliogr. 229 réf. Index.

Détection et localisation de particules de très hautes énergies en acoustique sous-marine

Juennard, Nicolas Jauffret, Claude Xerri, Bernard January 2007 (has links)
Reproduction de : Thèse de doctorat : Sciences : Traitement du signal : Toulon : 2007. / Titre provenant du cadre-titre. Bibliographie p.211-212.

On Khovanov-Rozansky homology of graphs and links

Wagner, Emmanuel Touraev, Vladimir G. January 2008 (has links)
Thèse doctorat : Mathématiques : Strasbourg 1 : 2007. / Titre provenant de l'écran-titre. Bibliogr. 3 p.

De multiples applications de l'homologie à l'imagerie numérique

Ethier, Marc January 2013 (has links)
L'explosion de la quantité de données numériques à traiter dans les sciences a poussé les chercheurs à développer des méthodes algorithmiques pour automatiser cette tâche. Parmi ces méthodes, on reconnaît les méthodes topologiques, qui utilisent des concepts issus de la topologie algébrique pour étudier les données. Cette thèse vise à décrire diverses méthodes topologiques qui sont utilisées dans les domaines de l'imagerie et de la comparaison de formes et à démontrer mathématiquement que les résultats numériques ainsi obtenus sont corrects. Elle est aussi accompagnée de tests qui servent à illustrer ces résultats.

Anwendung von Strukturoptimierungsmethoden auf den Entwurf mehrfeldriger Schrägseilbrücken und Extradosed Bridges

Meiss, Kathy Ursula, January 2007 (has links)
Zugl.: Stuttgart, Univ., Diss., 2007. / Druckausg. beim Verl. Grauer, Beuren; Stuttgart erschienen.

The spatio-temporal topological operator dimension, a hyperstructure for multidimentsional spatio-temporal exploration and analysis /

Marchand, Pierre. January 2004 (has links)
Thèse (Ph. D.)--Université Laval, 2004. / Bibliogr.: f. 97-108. Publié aussi en version électronique.

Cohomology rings of subspace arrangements and the topology of stable Kneser graphs

Longueville, Mark de. Unknown Date (has links)
Techn. University, Diss., 2000--Berlin.

Relative homotopy invariants of the type of the Lusternik-Schnirelmann category

Fassò Velenik, Agnese. Unknown Date (has links)
Freie Universiẗat, Diss., 2003--Berlin. / Dateiformat: zip, Dateien im PDF-Format.

Constructions of cubical polytopes

Schwartz, Alexander. Unknown Date (has links) (PDF)
Techn. University, Diss., 2004--Berlin.

Page generated in 0.0585 seconds