Dissertationen zum Thema „Arbre Trie“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Arbre Trie" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Li, Dun. „Optimized blockchain deployment and application for trusted industrial internet of things“. Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAS016.
Der volle Inhalt der QuelleThe continued advancement of the Industrial Internet of Things (IIoT) presents promising prospects and numerous opportunities for improving the operational frameworks of industrial systems. However, IIoT architectures face significant challenges, including centralized control, vulnerability to cyber attacks, privacy violations, and data accuracy issues.These challenges create significant obstacles in securing data, which is crucial for the growth of this technology. To address these issues, many researchers suggest integrating blockchain technology as a stable means to safeguard data within IIoT systems.Blockchain's features of distributed storage, decentralization, and immutability offer distinct advantages in data secure storage, identity verification, and access control. Despite these benefits, as IIoT applications diversify and data scales expand, the high resource demand of blockchain systems clashes with the limited resources of IIoT devices, leading to unresolved contradictions and persistent issues within this solution. Existing blockchain architectures still lack anonymous and efficient IIoT identity authentication, with complex encryption and decryption processes inducing excessive system overhead. To address these issues, the thesis builds on prior research to optimize blockchain performance, aiming to resolve the shortcomings and bottlenecks in current blockchain-based IIoT architectures regarding data security protection. Firstly, this thesis introduces a lightweight blockchain-enabled protocol designed for secure data storage in the dynamic IIoT environment. It incorporates bilinear mapping for system initialization, entity registration, and authentication technology to authenticate IIoT entities efficiently and securely, along with an off-chain data storage approach to ensure data integrity with reduced resource consumption.Furthermore, the thesis addresses the limitations of Hyperledger fabric systems in high availability scenarios by proposing Trie-Fabric, which enhances transaction processing through a Directed Acyclic Graph (DAG) based transaction sorting algorithm. This approach significantly reduces terminated transactions, optimizes conflict handling, and increases efficiency by more than 60% in its best case, according to comparative experimental results.To manage the increasingly sophisticated industrial processes and privacy-sensitive data generated by IIoT devices, the thesis proposes a smart contract-assisted access control scheme utilizing the Attribute-Based Access Control (ABAC) model.This scheme, supported by bloom filter components, demonstrates controlled contract execution times, stable system throughput, and a rapid consensus process in real-world simulations, making it highly capable of handling high-throughput and effective consensus even under large-scale request scenarios.Lastly, the thesis introduces the Zero-Knowledge Proof (ZKP) algorithm, which integrates a non-interactive zero-knowledge proof protocol with Ciphertext-Policy Attribute-Based Encryption (CP-ABE) to enhance security and efficiency in IIoT content distribution. Combined with the Distributed Publish-Subscribe IIoT (DPS-IIoT) system using Hyperledger fabric, it significantly improves bandwidth efficiency and overall throughput in IIoT environments.Through comprehensive security performance evaluations and experimental results, this research confirms the protocols' effectiveness in minimizing system overhead, improving storage reliability, and enhancing overall IIoT data management and application security. This thesis provides an in-depth examination of advanced data management protocols and systems for the IIoT, which are crucial for advancing the manufacturing sector. Consequently, this work makes a significant contribution to the field of IIoT data security, offering scalable and robust solutions for current and future industrial systems
Lin, Shen. „Marche aléatoire indexée par un arbre et marche aléatoire sur un arbre“. Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112379/document.
Der volle Inhalt der QuelleThe aim of this Ph. D. thesis is to study several probabilistic models linking the random walks and the random trees arising from critical branching processes.In the first part, we consider the model of random walk taking values in a Euclidean lattice and indexed by a critical Galton–Watson tree conditioned by the total progeny. Under some assumptions on the critical offspring distribution and the centered jump distribution, we obtain, in all dimensions, the asymptotic growth rate of the range of this random walk, when the size of the tree tends to infinity. These results also allow us to describe the asymptotic behavior of the range of a branching random walk, when the size of the initial population goes to infinity. In parallel, we treat likewise some cases where the random walk has a non-zero constant drift.In the second part, we focus on the fractal properties of the harmonic measure on large critical Galton–Watson trees. By harmonic measure, we mean the exit distribution from a ball centered at the root of the tree by simple random walk on this tree. If the critical offspring distribution is in the domain of attraction of a stable distribution, we prove that the mass of the harmonic measure is asymptotically concentrated on a boundary subset of negligible size with respect to that of the boundary. Assuming that the critical offspring distribution has a finite variance, we are able to calculate the mass of the harmonic measure carried by a random vertex uniformly chosen from the boundary
Mohamed, Hanène. „Etude probabiliste d'algorithmes en arbre“. Paris 6, 2007. https://tel.archives-ouvertes.fr/tel-00270742.
Der volle Inhalt der QuelleIn this thesis a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily. This approach gives a unified probabilistic treatment of these questions. It simplifies and extends some of the results known in this domain
Mohamed, Hanene. „Étude Probabiliste d'Algorithmes en Arbre“. Phd thesis, Université Pierre et Marie Curie - Paris VI, 2007. http://tel.archives-ouvertes.fr/tel-00270742.
Der volle Inhalt der QuelleSaurat, Jessica. „L'arbre et le droit“. Thesis, Montpellier, 2017. http://www.theses.fr/2017MONTD038/document.
Der volle Inhalt der QuelleThe tree is a special legal object because of its importance to the environment, the economy and the quality of life. It is therefore at the crossroads of various rights : environmental, forestry, rural, town planning, civil, tax, european and international laws. Thus, it is apprehended according to its place of situation but also the quality of its owner (private person or public person).While it is recognized as belonging to the common heritage of the nation, the possibilities of protection offered by the rights which are applicable in France generally lack efficiency and realism. To overcome this situation, it is envisaged to link the belonging of the tree to the common heritage of the Nation with binding legal consequences and thus confer on it a status that transcends property rights and the different areas of law
Emprin, Gustave. „Une topologie pour les arbres labellés, application aux arbres aléatoires s-compacts“. Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC1032.
Der volle Inhalt der QuelleIn this thesis, we develop a new space for the study of measured labelled metric spaces, ultimately designed to represent genealogical trees with a root at generation minus infinity. The time in the genealogical tree is represented by a 1-Lipschitz label function. We define the notion of S-compact measured labelled metric space, that is a metric space E equipped with a measure nu and a 1-Lipschitz label function from E to R, with the additional condition that each slice (the set of points with labels in a compact of R) must be compact and have finite measure. On the space XS of measured labelled metric spaces (up to isometry), we define a distance dLGHP by comparing the slices and study the resulting metric space, which we find to be Polish.We proceed with the study of the set T of all elements of XS that are real tree in which the label function decreases at rate 1 when we go toward the root" (which can be infinitely far). Each possible value of the label function corresponds to a generation in the genealogical tree. We prove that (T, dLGHP) is Polish as well. We define a number of measurable operation on T, including a way to randomly graft a forest on a tree. We use this operation to build a particular random tree generalizing Aldous' Brownian motion conditioned on its local time
Carlinet, Edwin. „Un arbre des formes pour les images multivariées“. Thesis, Paris Est, 2015. http://www.theses.fr/2015PESC1118/document.
Der volle Inhalt der QuelleNowadays, the demand for multi-scale and region-based analysis in many computer vision and pattern recognition applications is obvious. No one would consider a pixel-based approach as a good candidate to solve such problems. To meet this need, the Mathematical Morphology (MM) framework has supplied region-based hierarchical representations of images such as the Tree of Shapes (ToS). The ToS represents the image in terms of a tree of the inclusion of its level-lines. The ToS is thus self-dual and contrast-change invariant which make it well-adapted for high-level image processing. Yet, it is only defined on grayscale images and most attempts to extend it on multivariate images - e.g. by imposing an “arbitrary” total ordering - are not satisfactory. In this dissertation, we present the Multivariate Tree of Shapes (MToS) as a novel approach to extend the grayscale ToS on multivariate images. This representation is a mix of the ToS's computed marginally on each channel of the image; it aims at merging the marginal shapes in a “sensible” way by preserving the maximum number of inclusion. The method proposed has theoretical foundations expressing the ToS in terms of a topographic map of the curvilinear total variation computed from the image border; which has allowed its extension on multivariate data. In addition, the MToS features similar properties as the grayscale ToS, the most important one being its invariance to any marginal change of contrast and any marginal inversion of contrast (a somewhat “self-duality” in the multidimensional case). As the need for efficient image processing techniques is obvious regarding the larger and larger amount of data to process, we propose an efficient algorithm that can be build the MToS in quasi-linear time w.r.t. the number of pixels and quadraticw.r.t. the number of channels. We also propose tree-based processing algorithms to demonstrate in practice, that the MToS is a versatile, easy-to-use, and efficient structure. Eventually, to validate the soundness of our approach, we propose some experiments testing the robustness of the structure to non-relevant components (e.g. with noise or with low dynamics) and we show that such defaults do not affect the overall structure of the MToS. In addition, we propose many real-case applications using the MToS. Many of them are just a slight modification of methods employing the “regular” ToS and adapted to our new structure. For example, we successfully use the MToS for image filtering, image simplification, image segmentation, image classification and object detection. From these applications, we show that the MToS generally outperforms its ToS-based counterpart, demonstrating the potential of our approach
Dieuleveut, Daphné. „Coupe et reconstruction d'arbres et de cartes aléatoires“. Thesis, Université Paris-Saclay (ComUE), 2015. http://www.theses.fr/2015SACLS217/document.
Der volle Inhalt der QuelleThis PhD thesis is divided into two parts. First, we study some fragmentations of random trees and the associated cut-trees. The discrete models we are interested in are Galton-Watson trees, which are cut down by recursively removing random edges. We also consider their continuous counterparts, the Brownian and stable trees, which are fragmented by deleting the atoms of Poisson point processes. For these discrete and continuous models, the associated cut-tree describes the genealogy of the connected components which appear during the cutting procedure. We show that for a ''vertex-fragmentation'', in which the nodes having a large degree are more susceptible to be deleted, the continuous cut-tree is the scaling limit of the corresponding discrete cut-trees. In the Brownian and stable cases, we also give a transformation which rebuilds the initial tree from its cut-tree and a well chosen labeling of its branchpoints. The second part relates to random maps, and more precisely the uniform infinite quadrangulation of the plane (UIPQ). Recent results show that in the UIPQ, all infinite geodesic rays originating from the root are essentially similar. We identify the limit quadrangulation obtained by rerooting the UIPQ at a point ''at infinity'' on one of these geodesics. To do this, we split the UIPQ along this geodesic ray. Using a correspondence with discrete trees, we study the two sides, and obtain the desired limit by gluing them back together
Voisin, Guillaume. „Elagage d'un arbre de Lévy - Diffusion aléatoire en milieu Lévy“. Phd thesis, Université d'Orléans, 2009. http://tel.archives-ouvertes.fr/tel-00444554.
Der volle Inhalt der QuelleSciauveau, Marion. „Asymptotiques de fonctionnelles d'arbres aléatoires et de graphes denses aléatoires“. Thesis, Paris Est, 2018. http://www.theses.fr/2018PESC1127/document.
Der volle Inhalt der QuelleThe aim of this thesis is the study of approximations and rates of convergence for functionals of large dicsrete graphs towards their limits. We contemplate two cases of discrete graphs: trees (i.e. connected graphs without cycles) and dense simple finite graphs. In the first case, we consider additive functionals for two models of random trees: the Catalan model for binary trees (where a tree is chosen uniformly at random from the set of full binary trees with a given number of nodes) and the simply generated trees (and more particulary the Galton-Watson trees conditioned by their number of nodes).Asymptotic results are based on scaling limits of conditioned Galton-Watson trees. Indeed, when the offspring distribution is critical and with finite variance (that is the case of Catalan binary trees), the Galton-Watson trees conditioned to have a large number of nodes converge towards the Brownian continuum tree which is a real tree coded which can be coded by the normalized Brownian excursion. Furthermore, binary trees under the Catalan model can be built as sub-trees of the Brownian continuum tree. This embedding makes it possible to obtain almost sure convergences of functionals. More generally, when the offspring distribution is critical and belongs to the domain of attraction of a stable distribution, the Galton-Watson trees conditioned to have a large number of nodes converge to stable Levy trees giving the asymptotic behaviour of additive functionals for some simply generated trees. In the second case, we are interested in the convergence of the empirical cumulative distribution of degrees and the homomorphism densities of sequences of dense simple finite graphs. A sequence of dense simple finite graphs converges if the real sequence of associated homomorphism densities converges for all simple finite graph. The limit of such a sequence of dense graphs can be described as a symmetric measurable function called graphon.Given a graphon, we can construct by sampling, a sequence of graphs which converges towards this graphon. We have studied the asymptotic behaviour of the empirical cumulative distribution of degrees and random measures built from homomorphism densities associated to this special sequence of dense graphs
Gillet, Florent. „Etude d'algorithmes stochastiques et arbres“. Nancy 1, 2003. http://www.theses.fr/2003NAN10191.
Der volle Inhalt der QuelleThis thesis deals with the probabilistic analysis of some problems comming from computer science and combinatoric. In a first part, we study the effects of errors of comparison when we sort an input list with the sorting algorithm Quicksort. When a comparison can err with probability p, we show that the number of inversions in the output list of Quicksort has the order of magnitude n2p. In the second part, we prove the convergence of a process known as watermelon to a process defined by stochastic differential equations. We also give some properties of this limit process: the law of his norm, some moments, a link with the eigen values of random matrices,. . . The last part deals with the study of the asymptotic behaviour of the local laws of simple trees. We show that the law of simple trees with n vertices converges to a probablity measure we describe
De, Raphélis-Soissan Loïc. „Étude de marches aléatoires sur un arbre de Galton-Watson“. Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066056.
Der volle Inhalt der QuelleThis work is devoted to the study of scaling limits of different functionals of random walks on a Galton-Watson tree, potentially in random environment. The randow walk we consider is a null recurrent nearest-neigbout random walk, the probability transition of which depend on the environment. More precisely, we study the trace of the walk, that is the sub-tree made up of the vertices visited by the walk. We first consider the case where in a certain sense the environment has finite variance, and we show that when well-renormalised, the trace converges towards the Brownian forest. We then consider hypotheses of regular variation on the environement, and we show that the height function of the walk (that is the sequence of heights in the tree of the walk) converges towards the continuous time height process of a spectrally positive strictly stable Lévy process, and that the trace of the walk converges towards the real tree coded by this very process. The strategy used to prove these two results is based on the study of a certain kind of trees that we introduce in this thesis: they are Galton-Watson trees with two types, one of which being sterile, and with edge lengths. Our main result about these trees states that their height functions satisfies an invariance principle, similar to that verified by simple Galton-Watson trees. These trees also find a direct application in multitype Galton-Watson trees with infinitely many types, as an explicit link between these two kind of trees allow us to show that they satisfy also the same invariance principle
Giraudo, Samuele. „Combinatoire algébrique des arbres“. Phd thesis, Université Paris-Est, 2011. http://pastel.archives-ouvertes.fr/pastel-00674619.
Der volle Inhalt der QuelleGandrillon, Catherine. „"Albion's vital tree" : arbre, société et identité dans la peinture du portrait britannique de 1709 à 1792“. Paris 7, 2003. http://www.theses.fr/2003PA070039.
Der volle Inhalt der QuelleTrees often appear in the backgrounds of British portraits from 1709 to 1792. At the same time, they come under unprecedented scrutiny in economic, social, patriotic, political, artistic and scientific discourse. This research explores the specificity of the representation of trees in British portraits of the eighteenth century by establishing a link between the texts and the images of the period. Trees are undeniably considered as key elements in a representational process that aims primarily at staging cultural, social and economic identity by stressing values shared by many members of the 'polite classes'. Moreover, trees are at the heart of several myths that contribute to a new definition of national and political identity and this too impacts on portraits. Ultimately, however, the representation and physical aspect of trees also depend on individual interest in the scientific, philosophical or artistic theories of the time, and on the way the artist or the sitter understands the depiction of identity through art and the very nature of a work of art
Chatel, Grégory. „Combinatoire algébrique liée aux ordres sur les arbres“. Thesis, Paris Est, 2015. http://www.theses.fr/2015PESC1136/document.
Der volle Inhalt der QuelleThis thesis comes within the scope of algebraic combinatorics and studies of order structures on multiple tree families. We first look at the Tamari lattice on binary trees. This structure is obtained as a quotient of the weak order on permutations : we associate with each tree the interval of the weak order composed of its linear extensions. Note that there exists a bijection between intervals of the Tamari lattice and a family of poset that we callinterval-posets. The set of linear extensions of these posets is the union of the sets of linear extensions of the trees of the corresponding interval. We give a characterization of the posets satisfying this property and then we use this new family of objet on a large variety of applications. We first build another proof of the fact that the generating function of the intervals of the Tamari lattice satisfies a functional equation described by F. Chapoton. Wethen give a formula to count the number of trees smaller than or equal to a given tree in the Tamari order and in the $m$-Tamari order. We then build a bijection between interval-posets and flows that are combinatorial objects that F. Chapoton introduced to study the Pre-Lieoperad. To conclude, we prove combinatorially symmetry in the two parameters generating function of the intervals of the Tamari lattice. In the next part, we give a Cambrian generalization of the classical Hopf algebra of Loday-Ronco on trees and we explain their connection with Cambrian lattices. We first introduce our generalization of the planar binary tree Hopf algebra in the Cambrian world. We call this new structure the Cambrian algebra. We build this algebra as a Hopf sub algebra of a permutation algebra. We then study multiple properties of this objet such as its dual, its multiplicative basis and its freeness. We then generalize the Baxter algebra of S. Giraudo to the Cambrian world. We call this structure the Baxter-Cambrian Hopf algebra. The Baxter numbers being well-studied, we then explored their Cambrian counter parts, the Baxter-Cambrian numbers. To conclude this part, we give a generalization of the Cambrian algebra using a packed word algebra instead of a permutation algebra as a base for our construction. We call this new structure the Schröder-Cambrian algebra
Bigot, Thomas. „Recherche automatisée de motifs dans les arbres phylogénétiques“. Phd thesis, Université Claude Bernard - Lyon I, 2013. http://tel.archives-ouvertes.fr/tel-01044878.
Der volle Inhalt der QuelleSpadotti, Régis. „Une théorie mécanisée des arbres réguliers en théorie des types dépendants“. Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30178/document.
Der volle Inhalt der QuelleWe propose two characterizations of regular trees. The first one is semantic and is based on coinductive types. The second one is syntactic and represents regular trees by means of cyclic terms. We prove that both of these characterizations are isomorphic. Then, we study the problem of defining tree morphisms preserving the regularity property. We show, by using the formalism of tree transducers, the existence of syntactic criterion ensuring that this property is preserved. Finally, we consider applications of the theory of regular trees such as the definition of the parallel composition operator of a process algebra or, the decidability problems on regular trees through a mechanization of a model-checker for a coalgebraic mu-calculus. All the results were mechanized and proved correct in the Coq proof assistant
Delsouiller, Marlene. „L'iconographie de l'Arbre sec au Moyen Age“. Thesis, Lille 3, 2012. http://www.theses.fr/2012LIL30045.
Der volle Inhalt der QuelleThe iconography of the Dry Tree or leafless tree is present through out the Middle Ages, but paradoxally, its study has only attracted few historians of art of the XXth and XXIst centuries. To compensate for this, we choose to devote our thesis to an extensive study of this tree. We examine the formal aspect given to the Dry Tree depicted in the images, the evolution of its physical form through the centuries, the period when it first appears and when it disappears, as well as the symbolism it carries, a powerful signification related to the quest for Salvation. The core of our research is the images that depict a crucial episod in the Legend of the wood of the Cross — Seth’s vision of the leafless tree of the Earthly Paradise. Other images of the Dry Tree, which we call « variations », are also examined : the theme of the Dry Tree taken from the Legend is transposed in extra-legendary contexts such as in the romances of Alexander the Great and the Lancelot-Graal, the Divine Comedy, the Million by Marco Polo and the Voyages by Jean de Mandeville, as well as the Pilgrimage of the soul by Guillaume de Digulleville. The Dry Tree is also depicted in Our Lady of the Dry Tree by Petrus Christus. The images show the Dry Tree in Paradise or in a place which symbolises Paradise, with Christ in the Dry tree, or figures or animals as symbols of Christ. The powerful and multiple symbolism is present : the Dry Tree is a reference to the tree of the knowledge, to the tree of the Cross and to the tree of life. Therefore, it is no surprise that the images show man in his quest for the Dry Tree, ie in the quest for God
Paillet, Yoan. „Les microhabitats des arbres : facteurs d'influence, lien avec la biodiversité et potentiel indicateur“. Thesis, Paris, Muséum national d'histoire naturelle, 2018. http://www.theses.fr/2018MNHN0028/document.
Der volle Inhalt der QuelleAn indicator is a tool to measure metrics or phenomenons too complex or costly to measure directly. In the case of biodiversity, indicators are essential regarding the complexity to assess species state and dynamics. In forest, tree microhabitats (e.g.cavities, cracks in the wood, conks of lignicolous fungi) have been recently considered as a potential biodiversity indicator, with a more specific focus than other structures like deadwood volume. However, scientific references linking tree microhabitat metrics and biodiversity measures are still rare, and limited to a few taxonomic groups. More generally, like other indicators, the validation process of microhabitats as biodiversity indicators is not standardized. This ph-d thesis contributes to this validation and adresses three aspects included in an indicator validation process. The main aims were to: (i) Quantify and reduce incertitudes on tree microhabitat inventories. We thus proposed a first reference typology to standardize and homogenize microhabitats inventories. This typology has a hierarchical and evolutive structure, which allows its use in different contexts and for different purposes. We also quantified the potential bias linked to observer effects, in order to better take it into account in future inventories ; (ii) Better understand the influence of different factors on tree microhabitats at two different scales. At the tree scale, through the analysis of a national database, we generalized the relationships between tree characteristics (species, diameter, vitality) and number and occurrence of tree microhabitats. At the stand scale, we analysed the densities and types of microhabitat-bearing trees on an enlarged forest management gradient, comparing strict reserves and managed forests. These two studies evidenced the crucial role of large trees and snags in the provision of tree microhabitats ; (iii) Link tree microhabitats with the biodiversity of three taxonomic groups through the framework of structural equation models. We showed that microhabitats mediate the effects of management abandonment and old-growth forest features (large living and dead trees) on the biodiversity of birds and bats, and to a lesser extent on saproxylic beetles. In the end, tree microhabitat are not a universal biodiversity indicator but have a complementary role compared to other forest structures traditionally used to assess biodiversity. This ph-d thesis specifies the role of tree microhabitats as biodiversity indicators and proposes further research to continue validating them as such
Schwaller, Loïc. „Exact Bayesian Inference in Graphical Models : Tree-structured Network Inference and Segmentation“. Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS210/document.
Der volle Inhalt der QuelleIn this dissertation we investigate the problem of network inference. The statistical frame- work tailored to this task is that of graphical models, in which the (in)dependence relation- ships satis ed by a multivariate distribution are represented through a graph. We consider the problem from a Bayesian perspective and focus on a subset of graphs making structure inference possible in an exact and e cient manner, namely spanning trees. Indeed, the integration of a function de ned on spanning trees can be performed with cubic complexity with respect to number of variables under some factorisation assumption on the edges, in spite of the super-exponential cardinality of this set. A careful choice of prior distributions on both graphs and distribution parameters allows to use this result for network inference in tree-structured graphical models, for which we provide a complete and formal framework.We also consider the situation in which observations are organised in a multivariate time- series. We assume that the underlying graph describing the dependence structure of the distribution is a ected by an unknown number of abrupt changes throughout time. Our goal is then to retrieve the number and locations of these change-points, therefore dealing with a segmentation problem. Using spanning trees and assuming that segments are inde- pendent from one another, we show that this can be achieved with polynomial complexity with respect to both the number of variables and the length of the series
Cordero, Christophe. „Explorations combinatoires des structures arborescentes et libres“. Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC2046.
Der volle Inhalt der QuelleWe study three domains of algebraic and enumerative combinatorics. Firstly, we are looking for a counter-example to the commutatively equivalence conjecture. Stated in the Sixties, it conjectures that a not commutatively prefix code is not included in a finite maximal code. First, we find some not commutatively prefix codes and then we search for some finite maximal codes that might contain them. Thanks to a refinement of Kraft's inequality that we have proven, we found mostly by computer exploration 70 not commutatively prefix codes. Some of them improve a lower bound from Shor or embedded in some factorizations of cyclic groups. Thanks to classical studies on factorizations of cyclic groups, we compute some lower bounds for the size of finites maximals codes that might contains them. We introduce the notion of "complete modular bayonet code", in order to compute the first examples of not commutatively prefix codes that are not included in a finite maximal code. Secondly, we present and prove a new construction of prographs. We deduce from it a bijection between prographs and some families of three-dimensional colouredlattice paths. By a classical study of these lattice paths, we obtain recurrence relations satisfied by the prographs and a functional equation satisfied by the generating series of prographs. Finally, we compute some closed formulas for prographs made of only one type of generators. Finally, we conclude this thesis by a study of magmatic quotient. Driven by computer experimentations, we study the 10 quotients of the magmatic operad by one cubic relation by expressing their Hilbert series and providing combinatorial realizations. Moreover, we found all morphisms between comb operads and we exhibit a lattice structure over them
Odeh, Khaled. „Nouveaux algorithmes pour le traitement probabiliste et logique des arbres de défaillance“. Compiègne, 1995. http://www.theses.fr/1995COMPD846.
Der volle Inhalt der QuelleValero, Valbuena Silvia. „Arbre de partition binaire : un nouvel outil pour la représentation hiérarchique et l’analyse des images hyperspectrales“. Thesis, Grenoble, 2011. http://www.theses.fr/2011GRENT123/document.
Der volle Inhalt der QuelleThe optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. Therefore, under the title Hyperspectral image representation and Processing with Binary Partition Trees, this PhD thesis proposes the construction and the processing of a new region-based hierarchical hyperspectral image representation:the Binary Partition Tree (BPT). This hierarchical region-based representation can be interpretedas a set of hierarchical regions stored in a tree structure. Hence, the Binary Partition Tree succeedsin presenting: (i) the decomposition of the image in terms of coherent regions and (ii) the inclusionrelations of the regions in the scene. Based on region-merging techniques, the construction of BPTis investigated in this work by studying hyperspectral region models and the associated similaritymetrics. As a matter of fact, the very high dimensionality and the complexity of the data require the definition of specific region models and similarity measures. Once the BPT is constructed, the fixed tree structure allows implementing efficient and advanced application-dependent techniqueson it. The application-dependent processing of BPT is generally implemented through aspecific pruning of the tree. Accordingly, some pruning techniques are proposed and discussed according to different applications. This Ph.D is focused in particular on segmentation, object detectionand classification of hyperspectral imagery. Experimental results on various hyperspectraldata sets demonstrate the interest and the good performances of the BPT representation
Aubrun, Nathalie. „Dynamique symbolique des systèmes 2D et des arbres infinis“. Phd thesis, Université Paris-Est, 2011. http://pastel.archives-ouvertes.fr/pastel-00664331.
Der volle Inhalt der QuelleBresson, Caroline. „Variations altitudinales de traits fonctionnels foliaires chez les arbres : déterminismes environnemental et génétique“. Thesis, Bordeaux 1, 2011. http://www.theses.fr/2011BOR14220/document.
Der volle Inhalt der QuelleThe rapid climate change, which we are currently witnessing, is already modifying the physiology and distribution of species. Predictions of changes in species distributions do not take evolutionary mechanisms and biotic interactions into account. Our main objective was to assess the inherent adaptive capacities of tree populations by i) quantifying the phenotypic variations of functional traits with altitude and ii) studying the extent to which these variations are environmentally driven (phenotypic plasticity) and/or genetically fixed (adaptation). The study took place in the French Pyrenees along an altitudinal gradient range of 1500 m corresponding on average to 8°C of thermal amplitude. We focused on two broadleaved species with a wide European distribution (sessile oak and common beech). This gradient was repeated in two parallel valleys, distant from 30 km. Altitudinal trends were investigated for several morphological, physiological and phenological traits in natural conditions (in situ), in a common garden experiment and in reciprocal transplant experiments (RTEs). The phenotypic variability observed in situ showed significant altitudinal trends for all the studied traits and followed similar patterns for both species. We established that together with temperature, it was also necessary to integrate the variations of atmospheric gas partial pressure along the altitudinal gradient. In the common garden experiment, our results showed that the altitudinal gradient induced genetic differentiations for growth, leaf phenology and several morphological and physiological traits. This experiment made it possible to demonstrate, for both species, a weaker effect of genetic variations than in situ observed variations, suggesting a strong effect of the environment on leaf functional traits. A higher intrapopulation than interpopulation genetic variability was also observed for all traits. Finally, the reciprocal transplant experiments highlighted a high magnitude of phenotypic plasticity whatever the trait and the species
Vitasse, Yann. „Déterminismes environnemental et génétique de la phénologie des arbres de climat tempéré : suivi des dates de débourrement et de sénescence le long d'un gradient altitudinal et en tests de provenances“. Thesis, Bordeaux 1, 2009. http://www.theses.fr/2009BOR13788/document.
Der volle Inhalt der QuelleTo assess the response of forests to climate change, the phenology of six tree species was monitored from 2005 to 2007 both along an altitudinal gradient (providing a thermal gradient of about 7 ° C), and in provenance trials at various altitudes. The aim was (i) to characterize phenological patterns of leaf unfolding and leaf senescence timings in situ, (ii) to determine climatic variables responsible for these patterns, in particular using phenological models, and (iii) to assess the genetic variability and phenotypic plasticity of these phenological events. Our results showed that spring temperature differentially affected the leaf unfolding dates of the six species, with significant disparity in responses among species (from -1.9 days / ° C to -6.5 days / ° C for beech and oak, respectively) but not between the populations of a given species. Regarding the dates of senescence, we highlighted that temperature induced a strong shift of this event for oak and beech (> 5 days / ° C), while no cline was detected for sycamore and ash. The lengthening the growing season in response to an increase in temperature is thus mainly the result of an advance in flushing dates for all species except beech, whose growing season length changes were greatly resulting from shifts in senescence. Phenological models stressed the importance of forcing temperatures (effective during bud quiescence period), while the chilling temperatures (effective during dormancy) did not appear to significantly influence the occurrence of leaf unfolding. Concerning senescence variations , the models highlighted the role of temperature for sessile oak and beech, while the photoperiod and other factors could be involved in the ash and maple. Thus, for oak, the models predicted that the length of growing season will extend faster than the one for beech in the coming decades, and that the phenological competitive balance between these two species will likely to evolve towards higher altitudes. Finally, we showed that the sampled populations showed strong adaptations in phenology and growth in spite of their geographical proximity. Moreover, the reaction norms indicated, first, the existence of a strong phenological plasticity of species, and second, that this plasticity seemed to be an intrinsic characteristic of the species. These results underline that trees have consequent inherent adaptive capacities in phenological traits which may enable them to cope with global warming. However, the differences in phenological sensitivities among species suggest that global warming will significantly affect the competitive balance of species
Coronica, Piero. „Semistable vector bundles on bubble tree surfaces“. Thesis, Lille 1, 2015. http://www.theses.fr/2015LIL10064/document.
Der volle Inhalt der QuelleThe (semi)stability, introduced by Mumford in 1963, was used for construction of moduli spaces of vector bundles by methods of GIT. In the boundary of the compactified moduli space appear non locally free sheaves. The thesis aims to propose a new stock of more manageable boundary objects, in the case of dimension 2 and rank 2, which are bundles on bubble trees A having S as root. Motivation comes from gauge theory and the study of bundles on reducible curves by Nagaraj-Seshadri and Teixidor i Bigas.The semistability on A depends on polarization, that is, on an ample line bundle. The domain of parameters of polarization is much smaller, and semistable bundles are more scarce in dimension 2 than in the case of curves. For certain polarizations, semistability criteria for bundles on A are given in terms of their restrictions to the components of A. Although the sheaves studied on A are bundles, their potentially destabilizing subsheaves can be just reflexive. Thence the classification of reflexive sheaves on bubble trees is undertaken, basing upon the work of Burban-Drozd. Next the deformations of tree-like bundles are studied. The main result is that a stable bundle on A, for certain polarizations, is always the limit of stable bundles on S. Finally, a comparison is made between the stock of stable tree-like bundles which are limits of instantons of charge 2 on the projective plane, and the one of Markushevich-Tikhomirov-Trautmann, obtained by a completely different approach
Lemaire, Christophe. „Triangulation de Delaunay et arbres multidimensionnels“. Phd thesis, Ecole Nationale Supérieure des Mines de Saint-Etienne, 1997. http://tel.archives-ouvertes.fr/tel-00850521.
Der volle Inhalt der QuelleMballo, Souleymane. „Quantification et modélisation des services climatiques rendus par les arbres dans une rue canyon“. Thesis, Rennes, Agrocampus Ouest, 2022. http://www.theses.fr/2022NSARD097.
Der volle Inhalt der QuelleGlobal climate change and the extreme events it induces have become one of the major issues of this century. Understanding the microclimate in urban areas has received increasing attention from researchers in recent years, due to the overheating phenomena observed in cities and the population density that makes them a sensitive environment for heat waves. Several studies have shown that vegetation can reduce air temperature in cities, but these benefits depend on the built environment, and on many variables often not controlled in cities, such as water availability for plants. In this context, this thesis aims to analyze and quantify the climatic services provided in a canyon street by well-watered trees. It is based on a double approach combining experimentation and modeling. Field campaigns were carried out on a tree model at scale (1/5) installed in an outdoor environment on the site of the Institut Agro, in Angers, France. On the numerical approach, 2D simulations of the distributed climate in unsteady regime were performed using a CFD approach. Among other results, the work of this thesis showed that the canyon street creates overheating of up to 2.8 °C during the night, and up to 2.4 °C during the day, and that trees can reduce the air temperature in the street by 2.7 °C during the day, and improve human thermal comfort by reducing mid-day UTCI values by up to 8 °C. This work provides quantification elements that can help decision makers in their planning policies
Laforêt, Alice. „Connaissances de l'arbre au Moyen Âge.Savoirs et discours botaniques dans les encyclopédies, les herbiers et les textes agronomiques (XIIe-XVe siècle)“. Electronic Thesis or Diss., Université Grenoble Alpes, 2023. http://www.theses.fr/2023GRALL025.
Der volle Inhalt der QuelleThe Middle Ages did not consider botany to be a specific discipline. Yet the period was prolific in scholarly works on the world of plants. The encyclopaedias, herbals and agronomic texts that were produced and distributed from the twelfth to the end of the fifteenth century focused on plants and their uses. These works have comparable textual structures, making it possible to bring them together in a coherent corpus. While practical uses (therapeutic, dietetical or agronomical) do indeed occupy a central place, these works do not confine themselves to a purely practical understanding of plants, but do show an interest in the plants themselves. Both botanical texts and iconography were part of the construction of a scientific discourse specific to the period. This study focuses on one of the categories of plants, the tree. Medieval naturalists considered this category in terms of the multiplicity of different species that it contains, all of which needed to be named, described and ordered. Defining the tree was also an issue for authors of the period, revealing the working methods of the naturalists and the specific characteristics of medieval botany
Mendy, Gervais. „Chaînes alternées dans les graphes arête-coloriés : k-linkage et arbres couvrants“. Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00769929.
Der volle Inhalt der QuelleZhao, Jinhua. „Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra“. Thesis, Université Clermont Auvergne (2017-2020), 2017. http://www.theses.fr/2017CLFAC044/document.
Der volle Inhalt der QuelleGiven a simple undirected graph G = (V, E) with a so-called root node r in V, a rooted tree, or an r-tree, of G is either the empty graph, or a tree containing r. If a node-capacity vector c is given, then a subgraph of G is said to be bounded if the degree of each node in the subgraph does not exceed its capacity. Let w be an edge-weight vector and p a node-price vector. The Maximum Bounded r-Tree (MBrT) problem consists of finding a bounded r-tree T = (U, F) of G such that its weight is maximized. If the capacity constraint from the MBrT problem is relaxed, we then obtain the Maximum r-Tree (MrT) problem. This dissertation contributes to the study of the MBrT problem and the MrT problem.First we introduce the problems with their definitions and complexities. We define the associated polytopes along with a formulation for each of them. We present several polynomial-time combinatorial algorithms for both the MBrT problem (and thus the MrT problem) on trees, cycles and cactus graphs. Particularly, a dynamic-programming-based algorithm is used to solve the MBrT problem on trees, whereas on cycles we reduce it to some polynomially solvable problems in three different cases. For cactus graphs, we first show that the MBrT problem can be solved in polynomial time on a so-called cactus basis, then break down the problem on any cactus graph into a series of subproblems on trees and on cactus basis.The second part of this work investigates the polyhedral structure of three polytopes associated with the MBrT problem and the MrT problem, namely Bxy(G, r, c), Bx(G, r, c) and Rx(G, r). Bxy(G, r, c) and Bx(G, r, c) are polytopes associated with the MBrT problem, where Bxy(G, r, c) considers both edge- and node-indexed variables and Bx(G, r, c) considers only edge-indexed variables. Rx(G, r) is the polytope associated with the MrT problem that only considers edge-indexed variables. For each of the three polytopes, we study their dimensions, facets as well as possible ways of decomposition. We introduce some newly discovered constraints for each polytope, and show that these new constraints allow us to characterize them on several graph classes. Specifically, we provide characterization for Bxy (G, r, c) on cactus graphs with the help of a decomposition through 1-sum. On the other hand, a TDI-system that characterizes Bx(G,r,c) is given in each case of trees and cycles. The characterization of Rx(G,r) on trees and cycles then follows as an immediate result.Finally, we discuss the separation problems for all the inequalities we have found so far, and present algorithms or cut-generation heuristics accordingly. A couple of branch-and-cut frameworks are implemented to solve the MBrT problem together with a greedy-based matheuristic. We compare the performances of the enhanced formulations with the original formulations through intensive computational test, where the results demonstrate convincingly the strength of the enhanced formulations
Bonnesoeur, Vivien. „Acclimatation des arbres forestiers au vent : de la perception du vent à ses conséquences sur la croissance et le dimensionnement des tiges“. Thesis, Paris, AgroParisTech, 2016. http://www.theses.fr/2016AGPT0023.
Der volle Inhalt der QuelleStorms are by far the major hazard damaging the trees. However, trees do not just behave passively in the wind. They sense their own strains under the influence of an external force such as wind andrespond by modifying their growth and the mechanical properties of their tissues. But this process, called thigmomorphogenesis, has mainly been studied in very young trees in controlled conditions. This thesis aims to expand for the first time such studies at the scale of a forest stand in order to understand how adult trees acclimate to the wind in natural conditions by adapting their growth. It relies on an experimental set up in a regular stand of beech (Fagus sylvatica) which have never be thinned. The wind speed, the longitudinal strains and the radial growth of fifteen pairs of trees with contrasted sizes and wind exposures (split into two social status, dominant and suppressed trees) were monitored for one year. By controlling the strain intensity experienced by the trees, either by guying or by additional bendings, we show that the trees respond only to mechanical stimulation caused by rather strong winds with a return period higher than a week. This response leads however to a very strong increase in radial growth. And it follows a law of mecano-sensing uniform among the trees, regardless of their sizes. We then studied the effects of the strain regulation on the mechanical design of the trees and the potential risk of stem breakage. Despite the contrasted sizes and wind exposures, the strain regime remained uniform within the beech stand, in agreement with the hypothesis of an optimal mechanical design often inferred but never validated in its mechanism. Finally, the constitutive equations of a possible growth model dependent on wind are proposed and discussed
Laborde-Zubieta, Patxi. „Combinatoire de l’ASEP, arbres non-ambigus et polyominos parallélogrammes périodiques“. Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0709/document.
Der volle Inhalt der QuelleThis thesis deals with a combinatorial interpretation of the stationnarydistribution of the ASEP given by staircase tableaux and studiestwo combinatorial objects : non-ambiguous trees and periodic parallelogrampolyominoes.In the first part, we study the matrix ansatz introduced by Derrida, Evans,Hakim and Pasquier. Any solution of this equation system can be used tocompute the stationnary probabilities of the ASEP. Our work defines newrecurrences equivalent to the matrix ansatz. By defining an insertion algorithmfor staircase tableaux, we prove combinatorially and easily that they satisfyour new recurrences. We do the same for the ASEP with two types of particles.Finally, we enumerate the corners of the tableaux related to the ASEP, whichgives the average number of transitions from a state of the ASEP.In the second part, we compute nice formulas for the generating functionsof non-ambiguous trees, from which we deduce enumeration formulas. Then, wegive a combinatorial interpretation of some of our results. Lastly, we generalisenon-ambiguous trees to every finite dimension.In the last part, we define a tree structure in periodic parallelogram polyominoes,motivated by the work of Boussicault, Rinaldi and Socci. It allowsus to compute easily the generating function with respect to the height andthe width as well as two new statistics : the intrinsic width and the intrinsicgluing height. Finally, we investigate the ultimate periodicity of the generatingfunction with respect to the area
Rimmel, Arpad. „Improvements and Evaluation of the Monte Carlo Tree Search Algorithm“. Paris 11, 2009. http://www.theses.fr/2009PA112223.
Der volle Inhalt der QuelleMy thesis deals with planification in a discrete environment with finite horizon and with a number of states too large to be explored entirely. The goal is to maximize a reward function that associates a value to final states. This thesis focuses on particular on improving and evaluating a new algorithm: bandit-based Monte Carlo tree search. After presenting the state of the art (Minimax and Alphabeta for the two-players case; nested Monte Carlo and Dynamic Programing for the one-player case), I describe the principle of the algorithm. Then, I propose an efficient parallelization method for the case of separated memories. This method can be combined with classical parallelization methods for shared memories. I propose also a way of constructing an opening book and show its efficiency in the concrete case of the game of Go. I introduce also several ways of using expert knowledge, in the part concerning bandits as well as in the Monte Carlo part. Finally, I show that this algorithm that gives very good results in the context of two-players applications is also efficient in a one-player context. I propose an adaptation of the algorithm in order to handle graphs and use a different bandit formula in order to solve the problem of the automatic generation of linear transforms libraries. I obtain results much better than by using a classical dynamic programming algorithm
Bennour, Myriam. „La patrimonialisation des arbres urbains : le cas de Tunis“. Thesis, Paris, AgroParisTech, 2014. http://www.theses.fr/2014AGPT0079.
Der volle Inhalt der QuelleThis thesis is part of a geographical and anthropological field. It analyzes historic and contemporary relationships between Tunisians and trees in the city. Taking as a case study the city of Tunis, it aims to show that there is, from the beginning of colonization, among Tunisians a complex process of appropriation but also rejection of trees depending on their public or private location, and their personal history.Multiple values are indeed associated with trees. Analysis of the interviews shows that these values are based primarily on individual memory, family practices and social memory. Before colonization, the Medina had few trees in public space because the spatial organization drew its roots from the traditional settlement pattern, which did little or no appeal to trees in private patios. In addition, the traditional urban law did not use trees in public space. Upon initiation of the French Protectorate, the capital has been extended beyond the walls with the city called European. Large avenues and streets were lined up with rows of trees. New species were then widely introduced and disseminated, modeled on the French cities of that time.After independence, the capital swelled by the spread of rural migration, wealthy Tunisians lived in new neighborhoods that combined European style and Tunisian traditions (especially in the north). Rural Tunisians in search of a better life have occupied smaller areas (west and south). The capital has become a socially heterogeneous space marked by abundance and different types of trees in public and private spaces of the various neighborhoods.This thesis is a first step in the interpretation of urban living from recent history, marked by the functional, symbolic and aesthetic uses of trees. It shows that today the trees in Tunis are or become social, individual and collective markers that define different types of heritage; private, collective and public. This heritage process is not necessarily tied to an institutional setting
Thierry, Julien. „Impact des arbres d’alignement sur le microclimat et le stress thermique humain en ville : effet des vagues de chaleur et des sécheresses“. Electronic Thesis or Diss., Rennes, Agrocampus Ouest, 2024. http://www.theses.fr/2024NSARD108.
Der volle Inhalt der QuelleCities are characterized by an urban overheating which, combined to more frequent and intense heatwaves caused by climate change, expose the city dwellers to an increasing human thermal stress. Street trees may partially mitigate overheating by means of cast shadows and transpiration, two processes which may depend on their morphological and physiological characteristics. At the same time, periods of severe water shortage are multiplying and the ability of street trees to thrive and maintain significant cooling benefits under heat and drought conditions is crucial. In order to improve the understanding of the factors influencing tree climatic benefits, a methodology based on the monitoring of the interactions along the soil-tree atmospherecontinuum in two complementary experimental facilities was developed. On the one hand, a 1/5 scale canyon street, partially planted with young potted drip-irrigated ornamental apple trees (Malus Coccinella® ‘Courtarou’) located in Angers, France was monitored to quantify the effect of street trees experiencing different water supplies on the microclimate. On the other hand, an in-situ monitoring of the microclimate inside and outside the canopy for 36 mature street trees from 9 different tree species located in 5 sites in Paris, France, was performed. On the basis of a detailed cross-analysis of these two experimental facilities, an integrated assessment of the street trees climatic benefits was proposed to explore the sources of variability of the climatic benefits provided by trees and help stakeholders understand the relationship between drought resistance and human thermal stress mitigation for different tree species
Aval, Josselin. „Automatic mapping of urban tree species based on multi-source remotely sensed data“. Thesis, Toulouse, ISAE, 2018. http://www.theses.fr/2018ESAE0021/document.
Der volle Inhalt der QuelleWith the expansion of urban areas, air pollution and heat island effect are increasing, leading to state of health issues for the inhabitants and global climate changes. In this context, urban trees are a valuable resource for both improving air quality and promoting freshness islands. On the other hand, canopies are subject to specific conditions in the urban environment, causing the spread of diseases and life expectancy decreases among the trees. This thesis explores the potential of remote sensing for the automatic urban tree mapping, from the detection of the individual tree crowns to their species estimation, an essential preliminary task for designing the future green cities, and for an effective vegetation monitoring. Based on airborne hyperspectral, panchromatic and Digital Surface Model data, the first objective of this thesis consists in taking advantage of several data sources for improving the existing urban tree maps, by testing different fusion strategies (feature and decision level fusion). The nature of the results led us to optimize the complementarity of the sources. In particular, the second objective is to investigate deeply the richness of the hyperspectral data, by developing an ensemble classifiers approach based on vegetation indices, where the classifiers are species specific. Finally, the first part highlighted to interest of discriminating the street trees from the other structures of urban trees. In a Marked Point Process framework, the third objective is to detect trees in urban alignment. Through the first objective, this thesis demonstrates that the hyperspectral data are the main driver of the species prediction accuracy. The decision level fusion strategy is the most appropriate one for improving the performance in comparison the hyperspectral data alone, but slight improvements are obtained (a few percent) due to the low complementarity of textural and structural features in addition to the spectral ones. The ensemble classifiers approach developed in the second part allows the tree species to be classified from ground-based references, with significant improvements in comparison to a standard feature level classification approach. Each extracted species classifier reflects the discriminative spectral attributes of the species and can be related to the expertise of botanists. Finally, the street trees can be mapped thanks to the proposed MPP interaction term which models their contextual features (alignment and similar heights). Many improvements have to be explored such as the more accurate tree crown delineation, and several perspectives are conceivable after this thesis, among which the state of health monitoring of the urban trees
Place, Thomas. „Decidable characterizations for tree logics“. Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2010. http://tel.archives-ouvertes.fr/tel-00744954.
Der volle Inhalt der QuelleUrli, Morgane. „Réponse des rabres forestiers aux changements globaux : approches biogéographique et écophysiologique“. Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00821979.
Der volle Inhalt der QuelleAlsayed, Mahmoud. „Commerce et transformation des produits d’arbres et d’arbustes (bois, fruits frais et secs, racines, rameaux, feuilles, fleurs, graines, farine, poudre, parfum, encens, vin et huile) pour l’architecture, l’économie, la médecine, le culte et la magie à Ougarit et dans les royaumes et les empires environnants et au Bronze récent, d’après les données des sciences naturelles, des sources archéologiques et épigraphiques“. Thesis, Paris 4, 2011. http://www.theses.fr/2011PA040285.
Der volle Inhalt der QuelleThe subject of our dissertation is the trade and use of various products derived from trees and shrubs in the Kingdom of Ugarit, located on the coast of Syria and whose written documentation informs us about the Late Bronze Age, mainly fourteenth and thirteenth centuries BC. The kingdom is well known thanks to the thousands of tablets found in the last 82 years on the site of Ras Shamra and more recently that of Ras Ibn Hani. These tablets are written overwhelmingly in two languages and two systems of cuneiform writing: first, the local language, called “Ugaritic”, noted in an alphabetic system, on the other hand, the Babylonian Akkadian, noted by a logo-syllabic script. Situated between the coast and mountains, this kingdom was located between two major regions suppliers of timber in the most remote antiquity, as evidenced by Egyptian and Mesopotamian literature and the Bible, the Lebanese mountains and the Amanus mountain. The place is thus particularly important for this topic. Following an overview of geographical, demographic, linguistic, historical and economic on the kingdom of Ugarit, we studied successively ebony, pine and fir, cedar, juniper, cypress, boxwood, ¶Rgz, palm-tree, olive-tree, ñlmg-wood and vineyard, the vine and its products .We started each chapter with a botanical and linguistical identification. We tried to locate what were the areas that were the main sources of these natural resources. Then, we established a historical overview on the trade in products from trees and transportation. We tried to clarify their nature, quantity, quality, weight and price in Ugarit and outside. Finally, we examined the various uses and their role in craft, medicine, religion and magic. In doing so, we could also approach the symbolic value of these trees and woods
Sanchez, Inès. „Etude de la variabilite enzymatique de terminalia superba engler et diels : arbre forestier d'afrique tropicale“. Paris 7, 1988. http://www.theses.fr/1988PA077148.
Der volle Inhalt der QuelleZoumboulaki, Sophia. „L' Arbre de Jessé et la représentation des philosophes grecs et autres sages païens dans la peinture murale byzantine et post-byzantine“. Thesis, Paris 1, 2015. http://www.theses.fr/2015PA010516.
Der volle Inhalt der QuelleThe Tree of Jesse is a particularly complicated pictorial theme, which can be found in many different versions. The complex christological type is a purely Byzantine creation. Towards the end of 13th and early 14th century, figures of sages and philosophers of the Greek antiquity are added to this type, which already contains many iconographic elements such as prophetic and evangelical scene and independent figures of prophets and ancestors of Christ. In this study we examine the compositions and the texts of the inscriptions written on the pagan's scrolls this iconographic combination in order to trace its key evolutional stages in Byzantine and post-Byzantine mural painting
Qureshi, Taimur. „Contributions to decision tree based learning“. Thesis, Lyon 2, 2010. http://www.theses.fr/2010LYO20051/document.
Der volle Inhalt der QuelleLa recherche avancée dans les méthodes d'acquisition de données ainsi que les méthodes de stockage et les technologies d'apprentissage, s'attaquent défi d'automatiser de manière systématique les techniques d'apprentissage de données en vue d'extraire des connaissances valides et utilisables.La procédure de découverte de connaissances s'effectue selon les étapes suivants: la sélection des données, la préparation de ces données, leurs transformation, le fouille de données et finalement l'interprétation et validation des résultats trouvés. Dans ce travail de thèse, nous avons développé des techniques qui contribuent à la préparation et la transformation des données ainsi qu'a des méthodes de fouille des données pour extraire les connaissances. A travers ces travaux, on a essayé d'améliorer l'exactitude de la prédiction durant tout le processus d'apprentissage. Les travaux de cette thèse se basent sur les arbres de décision. On a alors introduit plusieurs approches de prétraitement et des techniques de transformation; comme le discrétisation, le partitionnement flou et la réduction des dimensions afin d'améliorer les performances des arbres de décision. Cependant, ces techniques peuvent être utilisées dans d'autres méthodes d'apprentissage comme la discrétisation qui peut être utilisées pour la classification bayesienne.Dans le processus de fouille de données, la phase de préparation de données occupe généralement 80 percent du temps. En autre, elle est critique pour la qualité de la modélisation. La discrétisation des attributs continus demeure ainsi un problème très important qui affecte la précision, la complexité, la variance et la compréhension des modèles d'induction. Dans cette thèse, nous avons proposes et développé des techniques qui ce basent sur le ré-échantillonnage. Nous avons également étudié d'autres alternatives comme le partitionnement flou pour une induction floue des arbres de décision. Ainsi la logique floue est incorporée dans le processus d'induction pour augmenter la précision des modèles et réduire la variance, en maintenant l'interprétabilité.Finalement, nous adoptons un schéma d'apprentissage topologique qui vise à effectuer une réduction de dimensions non-linéaire. Nous modifions une technique d'apprentissage à base de variété topologiques `manifolds' pour savoir si on peut augmenter la précision et l'interprétabilité de la classification
Pakovitch, Fedor. „Combinatoire des arbres planaires et arithmétiques des courbes hyperelliptiques“. Université Joseph Fourier (Grenoble ; 1971-2015), 1997. http://www.theses.fr/1997GRE10073.
Der volle Inhalt der QuelleTopart, Hélène. „Etude d’une nouvelle classe de graphes : les graphes hypotriangulés“. Thesis, Paris, CNAM, 2011. http://www.theses.fr/2011CNAM0776/document.
Der volle Inhalt der QuelleIn 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
Lamarre, Greg. „Rôle des insectes phytophages dans la diversité des arbres des forêts tropicales humides“. Thesis, Antilles-Guyane, 2013. http://www.theses.fr/2013AGUY0582/document.
Der volle Inhalt der QuelleThe mechanisms underlying the maintenance of local diversity of trees in tropical rainforests remain under debate. This dissertation aims to study and understand some biotic and abiotic factors that may influence both tree and insect community assembly in lowland tropical forests of Amazonia. I used an empirical approach to study communities of trees and insects in tropical forests of French Guiana and Peru, to address the extent to which insect herbivores contribute to the turnover of tree species across strong environmental gradients. In Chapter 1, I studied how herbivorous insect communities can influence the composition of tree communities along an environmental gradient by reinforcing tradeoffs between defense and growth that promote habitat specialization (Chapter 1, Appendix 3). The complicated variation in the patterns of growth and defense from this study led me to pursue further observations of an alternative plant defense strategy of time-avoidance of herbivores, which I examined in detail in Chapter 2. I found evidence for coordinated leaf production in some tree species that was consistent with the satiation of herbivores, suggesting that multiple interactions between plants and their herbivores may be responsible for patterns of habitat specialization in trees. In the second part of the dissertation, I examined insect herbivore communities in detail to test for turnover in species composition across geographic and environmental gradients. In Chapter 3, I present evidence for substantial beta-diversity in arthropod communities throughout lowland Amazonian forests. In the discussion I propose research perspectives to complete this research, including the extension of observations to compare tropical and temperate regions and the integration of molecular phylogenetics information to study coevolution of plant lineages and their insect herbivores. I conclude with suggestions for the integration of the results of this thesis in local and regional strategies for the preservation and conservation of tropical forests in the Amazon basin
Matas, Petr. „Connected component tree construction for embedded systems“. Thesis, Paris Est, 2014. http://www.theses.fr/2014PEST1116/document.
Der volle Inhalt der QuelleThe aim of this work is to enable construction of embedded digital image processing systems, which are both flexible and powerful. The thesis proposal explores the possibility of using an image representation called connected component tree (CCT) as the basis for implementation of the entire image processing chain. This is possible, because the CCT is both simple and general, as CCT-based implementations of operators spanning from filtering to segmentation and recognition exist. A typical CCT-based image processing chain consists of CCT construction from an input image, a cascade of CCT transformations, which implement the individual operators, and image restitution, which generates the output image from the modified CCT. The most time-demanding step is the CCT construction and this work focuses on it. It introduces the CCT and its possible representations in computer memory, shows some of its applications and analyzes existing CCT construction algorithms. A new parallel CCT construction algorithm producing the parent point tree representation of the CCT is proposed. The algorithm is suitable for an embedded system implementation due to its low memory requirements. The algorithm consists of many building and merging tasks. A building task constructs the CCT of a single image line, which is treated as a one-dimensional signal. Merging tasks fuse the CCTs together. Three different task scheduling strategies are developed and evaluated. Performance of the algorithm is evaluated on multiple parallel computers. A throughput 83 Mpx/s at speedup 13.3 is achieved on a 16-core machine with Opteron 885 CPUs. Next, the new algorithm is further adapted for hardware implementation and implemented as a new parallel hardware architecture. The architecture contains 16 basic blocks, each dedicated to processing of an image partition and consisting of execution units and memory. A special interconnection switch is designed to allow some executions units to access memory in other basic blocks. The algorithm requires this for the final merging of the CCTs constructed by different basic blocks together. The architecture is implemented in VHDL and its functional simulation shows performance 145 Mpx/s at clock frequency 120 MHz
Nielsen, Kirsten. „For et trae er der håb : om traeet som metafor i Jes. 1-39 /“. København : Gad, 1985. http://catalogue.bnf.fr/ark:/12148/cb348821837.
Der volle Inhalt der QuelleAbedini, Raoufeh. „Formation du bois de tension de peuplier (populus Spp.) à l'échelle pariétale“. Thesis, Montpellier 2, 2014. http://www.theses.fr/2014MON20142/document.
Der volle Inhalt der QuelleTrees can control their shape and resist gravity thanks to their ability to produce wood under tensile stress at their periphery. This prestress is known to be produced during the maturation of wood fibres but its generation mechanism remains unclear. This study focuses on the wood formation process at two levels: i) at the tissue level, the process and timing of tension wood, opposite wood and normal wood formation were investigated on field grown poplar trees and ii) at the cell wall level, the formation of the secondary wall in tension wood was studied in artificially tilted poplar saplings. Results showed that the number of cambial cells at early growing season, and thus the total number of cells produced in the end, on the tension wood side of bent trees increased compared to opposite and normal wood. The total number of opposite wood cells produced obviously decreased as a result of a lower cambial activity on this side. Consequently, one can observe pith eccentricity in the bent trees. The lignification phase starts latter in opposite wood than in tension and normal wood, however no obvious differences were observed between tension and normal wood. The so-called G-layer (gelatinous layer) formed soon after the start of the lignification in tension wood. Although the total number of cells produced on tension wood side was more important than the averaged one produced in upright trees, the total number of cells produced in the whole growth ring of bent trees was similar to the one produced in upright trees. This was the result of a huge reduction in the number of cells produced on the opposite wood side of bent trees. Tilting also had obvious effect on the wall thickening of young poplar. The thickness of the secondary wall layer and G-layer were measured, from cambium to mature wood, in several trees sampled at different times after tilting. Measurements on wood fibres produced before tilting show the usual progressive increase of secondary wall thickness during the growing season. After the tilting date, the secondary layer thickness decreased markedly from normal wood to tension wood while the total thickness increased, compared to normal wood, with the development of a thick G-layer. However, even after the G-layer formation, the secondary layer thickness continues to increase during the growing season. G-layer thickening was observed to be faster than secondary layer thickening. The development of the unlignified GL is proposed to be a low cost but efficient strategy for a fast generation of high tensile stress in hardwood trees