Thèses sur le sujet « Cycle cover »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 29 meilleures thèses pour votre recherche sur le sujet « Cycle cover ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Coop, Lisa Jane. « The diurnal cycle of cloud cover over southern and central Africa ». Master's thesis, University of Cape Town, 2008. http://hdl.handle.net/11427/4838.
Texte intégralIncludes bibliographical references (leaves 113-119).
The current understanding of the temporal and spatial distribution of clouds over southern and central Africa is poor and the regional processes governing cloud occurrence is only weakly understood. This study seeks to improve the current understanding of cloud diurnal variability over this region by providing a base-line diurnal climatology of lowlevel, mid-level and high-level cloud cover. Diurnal variations of cloudiness are examined using ten years of cloud data from latest version of the International Satellite Cloud Climatology Project (ISCCP-D1). The broad seasonal average diurnal variability is explored across the region. Thereafter a more detailed analysis of regionally specific variability is made using a Self-Organising Map. The findings of this study are in broad agreement with previous work. Cloud over the southern and central African region shows clear spatial organisation, most significantly associated with the location of the Intertropical Convergence Zone. The diurnal variation of high-level cloud is large, closely correlated to its mean and is enhanced by orographic features. Minimum high-level cloud occurs at 1100 LST and maximum extent is reached during the evening around 1800 LST, except in locations experiencing deep convection which displayed a redevelopment of cloud in the early morning (0300 LST). This redevelopment of HLCA is hypothesised to be due to the destabilization of the upper troposphere through nighttime cloud radiative cooling. Mid-level cloud exhibits smaller diurnal variations, reaching maximum coverage at approximately 0300 LST. Clouds at this level are severely obscured by higher clouds and therefore the detected diurnal variation is due to both real and artificial signals and care needs to be taken in interpreting the results. Low-level cloud shows strong diurnal variations when not obscured by higher clouds, reaching a maximum just after midday. The results of this study are interpreted in terms of the life-cycle of deep convective cloudiness. A number of mechanisms are suggested to explain the regional differences in diurnal variations with land surface heating being the primary mechanism.
Couedel, Antoine. « Analysis of performances of crucifers-legumes cover crop mixtures to provide multiple-ecosystem services ». Thesis, Toulouse, INPT, 2018. http://www.theses.fr/2018INPT0097/document.
Texte intégralMulti-services cover crops (MSCC) grown during fallow period between two cash crops provide various ecosystem services. Among species used as MSCC, crucifers can efficiently prevent nitrate and sulphate leaching by catching residual soil mineral nitrogen (N) and sulphur (S) afterthe preceding cash crop (N and S catch crop services). Crucifers also have a unique capacity to suppress pathogens due to the biocidal hydrolysis products of endogenous secondary metabolites called glucosinolates (GSL). The aim of our study was to assess the provision of various ecosystem services linked to N, S cycles and biocontrol potential for a wide range of bispecific crucifer-legume mixtures in comparison to sole cover crops of legume and crucifer. We carried out experiments in 2 contrasted sites (Toulouse and Orléans regions, France) during 2 years in order to assess these services and the compatibility of various bi-specific crucifer-legume mixtures. We tested a great diversity of species, such as i) crucifers : rape, white mustard, Indian mustard, Ethiopian mustard, turnip, turnip rape, radish and rocket, and ii) legumes: Egyptian clover, crimson clover, common vetch, purple vetch, hairy vetch, pea, soya bean, faba bean, and white lupin. Our study demonstrated that crucifer-legume mixtures can provide and mutualize various ecosystem services by reaching from 2 thirds (GSL production, S and N green manure) to the same level ofservice (N and S catch crop) than the best sole family of species. GSL profile and concentration did not change in mixtures meaning that crucifer-pests interactions were identical. Through a literature review we also illustrated that biocontrol services of crucifers could be largely maintained in crucifer-legume mixtures for a wide range of pathogens and weeds while reducing potential disservices on beneficials and increasing N related service
Hägglund, Jonas. « Snarks : Generation, coverings and colourings ». Doctoral thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-53337.
Texte intégralGermer, Sonja. « Near-surface hydrology and hydrochemistry under contrasting land-cover ». Phd thesis, Universität Potsdam, 2008. http://opus.kobv.de/ubp/volltexte/2008/1904/.
Texte intégralDie Zerstörung von natürlicher Vegetation kann weit reichende Folgen auf den Wasser- und Nährstoffhaushalt von Ökosystemen haben. Der Landnutzungswandel vom Wald zur Weide ist heute in den Tropen ein wichtiges Thema. Eine nachhaltige Nutzung abgeholzter Gebiete setzt ein fundiertes Wissen des Wasser- und Nährstoffhaushaltes voraus. Darauf aufbauend wurden in dieser Studie das Abflussverhalten und die Nährstoffbilanzen von einem tropischem Regenwald und einer Weide verglichen. Außerdem wurde untersucht inwieweit die Nährstoffbilanzen vom Abflussverhalten abhängen. Die Untersuchungsgebiete liegen im südwestlichen brasilianischen Amazonasgebiet. Ein umfangreiches System zur Aufnahme von hydrologischen Daten und zum Sammeln von Wasserproben wurde aufgebaut. Die Ergebnisse haben gezeigt, dass sich das Abflussverhalten durch die Landnutzung geändert hat. Die wichtigste Änderung vom Wald zur Weide war der gesteigerte Anteil des schnellen Wasserabflusses auf der Geländeoberfläche. Hieraus resultierten gesteigerte Nährstoffausträge aus der Weide gegenüber dem Wald. Ein weiterer Grund für die gesteigerten Nährstoffausträge sind die hohen Konzentrationen dieser Stoffe im Oberflächenabfluss der Weide, die vermutlich mit den Ausscheidungen des Viehs zusammenhängen. Es hat sich also gezeigt, dass der quasi-geschlossene Nährstoffkreislauf nach der Landnutzungsänderung nicht aufrecht erhalten werden konnte. Diese Arbeit liefert den ersten Versuch diese Nährstoffverluste zur quantifizieren.
Valayamkunnath, Prasanth. « Understanding the Role of Vegetation Dynamics and Anthropogenic induced Changes on the Terrestrial Water Cycle ». Diss., Virginia Tech, 2019. http://hdl.handle.net/10919/105061.
Texte intégralDoctor of Philosophy
Lytle, William. « Coupled Evaluation of Below- and Above-Ground Energy and Water Cycle Variables from Reanalysis Products Over Five Flux Tower Sites in the U.S ». Thesis, The University of Arizona, 2015. http://hdl.handle.net/10150/595636.
Texte intégralSilvestri, Selene. « Models and Algorithms for Some Covering Problems on Graphs ». Thesis, Universita degli studi di Salerno, 2016. http://hdl.handle.net/10556/2303.
Texte intégralSeveral real-life problems as well as problems of theoretical importance within the field of Operations Research are combinatorial in nature. Combinatorial Optimization deals with decision-making problems defined on a discrete space. Out of a finite or countably infinite set of feasible solutions, one has to choose the best one according to an objective function. Many of these problems can be modeled on undirected or directed graphs. Some of the most important problems studied in this area include the Minimum Spanning Tree Problem, the Traveling Salesman Problem, the Vehicle Routing Problem, the Matching Problem, the Maximum Flow Problem. Some combinatorial optimization problems have been modeled on colored (labeled) graphs. The colors can be associated to the vertices as well as to the edges of the graph, depending on the problem. The Minimum Labeling Spanning Tree Problem and the Minimum Labeling Hamiltonian Cycle Problem are two examples of problems defined on edge-colored graphs. Combinatorial optimization problems can be divided into two groups, according to their complexity. The problems that are easy to solve, i.e. problems polynomially solvable, and those that are hard, i.e. for which no polynomial time algorithm exists. Many of the well-known combinatorial optimization problems defined on graphs are hard problems in general. However, if we know more about the structure of the graph, the problems can become more tractable. In some cases, they can even be shown to be polynomial-time solvable. This particularly holds for trees...[edited by Author]
XIV n.s.
Loucaides, Socratis. « Human impact on the silica cycle : reduction of dissolved silica inputs into the ocean as a result of the increasing impervious cover / ». Electronic version (PDF), 2003. http://dl.uncw.edu/etd/2003/loucaidess/socratisloucaides.pdf.
Texte intégralSummers, Percy M. « The Post-frontier : Land use and social change in the Brazilian Amazon (1992 - 2002) ». Diss., Virginia Tech, 2008. http://hdl.handle.net/10919/27903.
Texte intégralPh. D.
Klec, Martin. « Analýza nákladů inženýrských staveb ». Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2017. http://www.nusl.cz/ntk/nusl-295665.
Texte intégralFish, Jocelyn M. « Small cycle double covers and line graphs ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ38584.pdf.
Texte intégralSchmidt, Anja. « Time series analysis of ground frost conditionsat Abisko, sub-Arctic Sweden, 1985-2010 ». Thesis, Uppsala universitet, Institutionen för geovetenskaper, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-301910.
Texte intégralperioden 1985-2010 ökade både lufttemperatur och nederbörd i Abiskoområdet. Denstörsta ökningen av lufttemperatur skedde under vinterhalvåret medan nederbörden ökademest under sommarhalvåret. En signifikant förkortning i längden av vintersnötäckets existensunder året observerades under studieperioden. Reduceringen av vintesnötäcket skedde genomatt den första snön kom senare och bortsmältningen på våren skedde tidigare. Snötäcketstjocklek minskade också under studieperioden. Marktemperaturmätningarna visar frysgraderpå 5 och 20 cm djup fem månader och fyra respektive två månader på 50 och 100cm djup.Den årliga medeltemperaturen i marken ökade under perioden med 0.31 °C, 0.64 °C, 0.82 °Coch 0.94 °C vid 5, 20, 50 och 100 cm djup. Den årliga längden och intensiteten avfrysförhållandena i marken minskade vilket förmodligen är en konsekvens av de ökandemarktemperaturerna. Ingen trend i förekomsten av kortare svängningar i frysförhållandenakunde observeras. Förändringarna i årsmedetemperaturen i marken är signifikant korrelerademed förändringen i den årliga medeltemperaturen och vintertemperaturen i luften, men ingenkorrelation mellan marktemperaturen och förändringar i snötäckets tjocklek och längdobserverades. Studien avslöjade också att temperaturen i marken ökade under vinternhalvåretmedan den sjönk under sommaren. Avkylningen av marken under sommaren kan förklaras avökad nederbörd under sommaren som ger högre markfuktighet som ger en kylande effektgenom den så kallade jord-fuktighets återkopplingsmekanismen (soil-moisture feedback).Från detta kan vi dra slutsatsen att förändringar i enbart lufttemperatur inte kan förklara denhela observerade variansen av marktemperatur men att lufttemperaturen har en domineranderoll. Resultaten från denna studie indikerar således att förändringar lufttemperatur kananvändas som en indikator på marktemperaturförändringar i Abisko området.
Perron, Mary Ann. « The Value of Urban Ponds for Odonata and Plant Biodiversity ». Thesis, Université d'Ottawa / University of Ottawa, 2020. http://hdl.handle.net/10393/40522.
Texte intégralStreib, Noah Sametz. « Planar and hamiltonian cover graphs ». Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/43744.
Texte intégralManthey, Bodo. « Approximability of cycle covers and smoothed analysis of binary search trees ». [S.l.] : [s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=978602366.
Texte intégralTarasca, Nicola. « Geometric cycles on moduli spaces of curves ». Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2012. http://dx.doi.org/10.18452/16518.
Texte intégralThe aim of this thesis is the explicit computation of certain geometric cycles in moduli spaces of curves. In recent years, divisors of $\Mbar_{g,n}$ have been extensively studied. Computing classes in codimension one has yielded important results on the birational geometry of the spaces $\Mbar_{g,n}$. We give an overview of the subject in Chapter 1. On the contrary, classes in codimension two are basically unexplored. In Chapter 2 we consider the locus in the moduli space of curves of genus 2k defined by curves with a pencil of degree k. Since the Brill-Noether number is equal to -2, such a locus has codimension two. Using the method of test surfaces, we compute the class of its closure in the moduli space of stable curves. The aim of Chapter 3 is to compute the class of the closure of the effective divisor in $\M_{6,1}$ given by pointed curves [C,p] with a sextic plane model mapping p to a double point. Such a divisor generates an extremal ray in the pseudoeffective cone of $\Mbar_{6,1}$ as shown by Jensen. A general result on some families of linear series with adjusted Brill-Noether number 0 or -1 is introduced to complete the computation.
Gordon, Line. « Land Use, Freshwater Flows and Ecosystem Services in an Era of Global Change ». Doctoral thesis, Stockholm : Univ, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-16.
Texte intégralLiao, Julia Den-Yue. « Woodland development and soil carbon and nitrogen dynamics and storage in a subtropical savanna ecosystem ». Texas A&M University, 2004. http://hdl.handle.net/1969.1/1560.
Texte intégral連敏筠. « Cycle Cover of Graphs ». Thesis, 2008. http://ndltd.ncl.edu.tw/handle/7za764.
Texte intégral國立交通大學
應用數學系所
96
A cycle cover of a graph G is a collection of cycles of G which covers all edges of G. The size of a cycle cover is the sum of the lengths of the cycles in the cover. A flow in G under orientation D is an integer-valued function on E(G) such that the output value is equal to the input value for each v in V(G). The support of ph(i) is defined by S(ph(i)) = {e in E(G) : phi(e) not equalto 0}. For a positive integer k, if −k < (e) < k for every e in E(G), then is called a k-flow, and furthermore, if S(phi) = E(G), then is called a nowhere-zero k-flow. In this thesis we prove: (1) if Tutte’s 3-Flow Conjecture is true, then every (k − 1)-edge-connected graph G with minimum degree = k has a nowhere-zero 6-flow such that when k is odd |Eodd(phi)| not less than (k-1)\k |E(G)| and when k is even |Eodd(phi)| not less than (k-2)\(k-1) |E(G)| ; (2) If a (k−1)-edge-connected graph G with minimum degree = k has a nowhere-zero 6-flow such that when k is odd |Eodd(phi)| not less than (k-1)\k |E(G)|, then G has a cycle cover in which the size of the cycle cover is at most (13k+5)\9k |E(G)| and when k is even |Eodd(phi)| not less than (k-2)\(k-1) |E(G)|, then G has a cycle cover in which the size of the cycle cover is at most (13k−8)\9(k−1) |E(G)|, where Eodd(phi)={e in E(G) : phi(e) is odd }.
Lin, Chia-Hui, et 林家暉. « Three Types of Two-disjoint-cycle-cover Pancyclicity And Their Applications to Cycle Embedding in Locally Twisted Cubes ». Thesis, 2016. http://ndltd.ncl.edu.tw/handle/47777454426457619950.
Texte intégral靜宜大學
資訊工程學系
104
A graph G = (V, E) is two-disjoint-cycle-cover [r1, r2]-pancyclic if for any integer l satisfying r1 ≤ l ≤ r2, there exist two vertex-disjoint cycles C1 and C2 in G such that the lengths of C1 and C2 are l and |V|− l, respectively, where |V| denotes the total number of vertices in G. On the basis of this definition, we further propose Ore-type conditions for graphs to be two-disjoint-cycle-cover vertex/edge [r1, r2]-pancyclic. In addition, we study cycle embedding in the n-dimensional locally twisted cube LTQn under the consideration of two-disjoint-cycle-cover vertex/edge pancyclicity.
Fei-Hung, Lin. « A Cost-effective Minimum Cycle Cover (MCC) Algorithm in WDM Networks with Automatic Protection Switching ». 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0009-2501200721295700.
Texte intégralLin, Fei-Hung, et 林飛宏. « A Cost-effective Minimum Cycle Cover (MCC) Algorithm in WDM Networks with Automatic Protection Switching ». Thesis, 2007. http://ndltd.ncl.edu.tw/handle/77943824012377364343.
Texte intégral元智大學
資訊工程學系
95
In networks with planar topologies, this paper proposes a heuristic method based on routing which is the Minimum Cycle Cover (MCC) algorithm for performing Automatic Protection Switching (APS) in optical networks. The algorithm provide for restoration inherit many advantages of Double Cycle Cover (DCC). The protection process proposed is fast, full restoration, distributed, and autonomous. It restores the network in real time, without relying on a central manager or a centralized database, but the drawback of this DCC scheme needs constructing of fault tolerant environment cost is not accord with the economic benefits. Therefore, the MCC can establish an efficient construction of many decomposition cycles from the architecture of DCC. That can really protect single failure and multiple failures. The MCC algorithm of performance with single and two link faults are similar to DCC. Comparisons are made by introduction of metrics that measure a protection scheme’s effectiveness in handling link failures. The cost-effective of link fault obtained using MCC is higher than using DCC and the protection probability value is approximation between the two algorithms.
Briber, Brittain. « Urbanization, the carbon cycle, and ecosystems : an exploration of coupled dynamics and feedbacks ». Thesis, 2015. https://hdl.handle.net/2144/14023.
Texte intégralMatthews, H. Damon. « Land cover change, vegetation dynamics and the global carbon cycle : experiments with the UVic earth system climate model ». 2004. http://hdl.handle.net/1828/484.
Texte intégralThapa, Chandra. « Graphical approaches to single-sender and two-sender index coding ». Thesis, 2018. http://hdl.handle.net/1959.13/1388175.
Texte intégralIn index coding, a sender broadcasts messages through a noiseless broadcast channel to multiple receivers, each possessing a subset of the messages a priori, known as side-information. The sender knows the side-information available at each receiver, and uses that information to broadcasts coded messages, called an index code, such that all receivers can decode their requested messages using their side-information and the received index code. The aim is to find an index code with the minimum information bits per received message bits, called the optimal broadcast rate. The index-coding problem is applicable in many real-world contexts such as content-distribution networks (e.g., a network providing video-on-demand services), satellite communications, and distributed storage (e.g., data centers). In this dissertation, we investigate unicast-index-coding (UIC) problems, where each message is requested by only one receiver, each receiver requests only one message and each receiver has a subset of messages except its requested messages in side-information. These problems can be modeled by directed graphs. We apply graph-based approaches to the two types of the UIC problems based on the number of senders, namely single-sender unicast-index-coding (SSUIC) and two-sender unicast-index-coding (TSUIC) problems. In SSUIC, we propose a new scheme, called interlinked-cycle-cover (ICC) scheme, that exploits interlinked-cycle (IC) structures (a form of overlapping cycles that generalizes cliques and cycles) in directed graphs. This scheme provides an upper bound on the optimal broadcast rate for any SSUIC instance, and construct a linear index code. We prove that the ICC scheme is optimal over all linear and non-linear index codes for a class of infinitely many digraphs. We show that the ICC scheme can outperform existing schemes for some SSUIC instances with six receivers. Further, we extend the IC structures and the scheme. We find that the ICC scheme (including the extended scheme) provides the optimal broadcast rates for all message alphabet sizes for all SSUIC instances up to five receivers except eight problems. In TSUIC, firstly, we extend the existing SSUIC graph-based schemes, namely clique-cover, cycle-cover, and local-chromatic-number schemes to TSUIC. Then we investigate the TSUIC problems by its structural characterization. By considering three sub-problems of a TSUIC problem based on whether the receivers' requests are available at only one sender or both senders, we formulate its optimal broadcast rate as a function of the optimal broadcast rates of its three sub-problems. Furthermore, for this formulation, we extend the notion of confusion graphs and graph coloring to TSUIC. We characterize a class of infinitely many TSUIC instances where a certain type of side-information can be removed without affecting their optimal broadcast rates.
Wang, Pei-Ling. « Modeling global human-induced soil degradation and its impacts on water balance ». Thesis, 2021. http://hdl.handle.net/1828/13361.
Texte intégralGraduate
2022-08-09
Wang, Chun-Kai, et 王俊凱. « Two Edge-Disjoint Hamiltonian Cycles and One Isometric Path Cover in Augmented Cubes ». Thesis, 2012. http://ndltd.ncl.edu.tw/handle/10688943365551438099.
Texte intégral朝陽科技大學
資訊工程系碩士班
100
The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The n-dimensional augmented cube AQn, an important variation of the hypercube, possesses several embedding properties that hypercubes and other variations do not possess. The advantages of AQn are that the diameter is only about half of the diameter of Qn and it is node-symmetric. Recently, some interesting properties of AQn have been investigated in the literature. The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the interconnection network. A network G contains one isometric path cover and is called isometric path coverable if for any two distinct pairs of nodes us, ut and vs, vt of G, there exist two node-disjoint paths P and Q satisfying that (1) P joins us and ut , and Q joins vs and vt , (2) |P| = |Q|, and (3) every node of G appears in P and Q exactly once. In this thesis, we first prove that the augmented cube AQn contains two edge-disjoint Hamiltonian cycles for n is equal or greater than 3. We then prove that AQn, with n is equal or greater than 2, is isometric path coverable. Based on the proofs of existences, we further present linear time algorithms to construct two edge-disjoint Hamiltonian cycles and one isometric path cover in an n-dimensional augmented cube AQn.
Manthey, Bodo [Verfasser]. « Approximability of cycle covers and smoothed analysis of binary search trees / Bodo Manthey ». 2005. http://d-nb.info/978602366/34.
Texte intégralHosney, Mohamed. « PERFORMANCE OF GEOSYNTHETIC CLAY LINERS IN COVER, SUBSURFACE BARRIER, AND BASAL LINER APPLICATIONS ». Thesis, 2014. http://hdl.handle.net/1974/8641.
Texte intégralThesis (Ph.D, Civil Engineering) -- Queen's University, 2014-02-28 08:53:29.171