Literatura académica sobre el tema "Arbre Trie"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Arbre Trie".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Arbre Trie"
Salifou, Aboudou D., Ghislaine Babatounde y Arcadius Y. J. Akossou. "Effet du mode de semis et de la couleur des accessions d’anacardier (Anacardium occidentale L.) sur le rendement en noix au Nord-Est du Bénin". European Scientific Journal, ESJ 18, n.º 24 (31 de julio de 2022): 149. http://dx.doi.org/10.19044/esj.2022.v18n24p149.
Texto completoCOULIBALY, Yacouba Noël y Gérard ZOMBRE. "Effet du gradient climatique sur la transpiration des arbres dans les parcs agroforestiers au Burkina Faso (Afrique de l’Ouest)". Journal of Applied Biosciences 175 (31 de julio de 2022): 18182–91. http://dx.doi.org/10.35759/jabs.175.6.
Texto completoHamrouni, Ahmed y Marc Bouvier. "TREE-BASED APPROACH TO ESTIMATE WOOD VOLUME FROM LiDAR DATA: A CASE STUDY IN A PINE PLANTATION". Revue Française de Photogrammétrie et de Télédétection 1, n.º 211-212 (6 de diciembre de 2015): 63–70. http://dx.doi.org/10.52638/rfpt.2015.555.
Texto completoMorel, Hélène, Romain Lehnebach, Jérémy Cigna, Julien Ruelle, Eric Nicolini y Jacques Beauchêne. "Basic wood density variations of Parkia velutina Benoist, a long-lived heliophilic Neotropical rainforest tree". BOIS & FORETS DES TROPIQUES 335 (15 de marzo de 2018): 59. http://dx.doi.org/10.19182/bft2018.335.a31518.
Texto completoCisse, Mohamed, Hamidou Bah y Sara Bailo Diallo. "Influence de la densité d’arbres sur le rendement de trois variétés de riz de coteau dans la Commune Rurale de Tindo en République de Guinée". International Journal of Biological and Chemical Sciences 17, n.º 7 (22 de febrero de 2024): 2794–810. http://dx.doi.org/10.4314/ijbcs.v17i7.16.
Texto completoZOHOUN, Prucelle Elisée, Mama DJAOUGA, Soufouyane ZAKARI, David M. BALOUBI y Ibouraïma YABI. "Diversité, structure des arbres et description du boisement dans les concessions de l’espace urbain de Parakou au centre du Bénin". Journal of Applied Biosciences 154 (31 de octubre de 2020): 15842–52. http://dx.doi.org/10.35759/jabs.154.1.
Texto completoWete, E., J. L. Betti, J. R. Ngueguim, Siegfried D. Dibong y N. O. F. Njukouyou. "Analyse comparative de la soutenabilité des méthodes d’exploitation de Prunus africana (Hook. f.) Kalkman en vigueur au Cameroun : incidence biologique et socio-économique". International Journal of Biological and Chemical Sciences 14, n.º 4 (17 de agosto de 2020): 1405–15. http://dx.doi.org/10.4314/ijbcs.v14i4.19.
Texto completoNgotta Biyon, Jacques Bruno, Arriane Barbara Iyodi, Yves Donald Wafo Tchoue, JosephMarie Ondoua y Victor Désiré Taffouo. "Parasitisme des Loranthaceae sur Theobroma cacao L. (Malvaceae) dans l’arrondissement de Tombel (Sud-Ouest Cameroun)". International Journal of Biological and Chemical Sciences 16, n.º 3 (28 de agosto de 2022): 1113–22. http://dx.doi.org/10.4314/ijbcs.v16i3.17.
Texto completoHellström, N. P., G. André y M. Philippe. "Life and works of Augustin Augier de Favas (1758–1825), author of “Arbre botanique” (1801)". Archives of Natural History 44, n.º 1 (abril de 2017): 43–62. http://dx.doi.org/10.3366/anh.2017.0413.
Texto completoTarpaga, Windpouiré Vianney, Larbouga Bourgou, Moussa Guira y Albert Rouamba. "Agro morphological characterization of cashew trees (Anacardium occidental L.), in improvement for the high yield and high quality of raw nuts in Burkina Faso". International Journal of Biological and Chemical Sciences 14, n.º 9 (25 de marzo de 2021): 3188–99. http://dx.doi.org/10.4314/ijbcs.v14i9.17.
Texto completoTesis sobre el tema "Arbre Trie"
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.
Texto completoThe 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.
Texto completoThe 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.
Texto completoIn 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.
Texto completoSaurat, Jessica. "L'arbre et le droit". Thesis, Montpellier, 2017. http://www.theses.fr/2017MONTD038/document.
Texto completoThe 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.
Texto completoIn 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.
Texto completoNowadays, 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.
Texto completoThis 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.
Texto completoSciauveau, Marion. "Asymptotiques de fonctionnelles d'arbres aléatoires et de graphes denses aléatoires". Thesis, Paris Est, 2018. http://www.theses.fr/2018PESC1127/document.
Texto completoThe 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
Libros sobre el tema "Arbre Trie"
Musée Félicien Rops (Namur, Belgium) y Maison de la culture de Namur, eds. Arbre(s) =: Tree(s). Oostkamp: Stichting Kunstboek, 2008.
Buscar texto completoBrosse, Jacques. L' arbre & les naïfs: Arbre symbolique et peinture naïve. Paris: Editions Art et industrie, 1990.
Buscar texto completoNogué, Alex. Dibuixar un arbre = Drawing a tree. Barcelona: comanegra, 2013.
Buscar texto completoHugues, M. K. Climate from tree rings. Cambridge: Cambridge University Press, 2009.
Buscar texto completoJean-Paul, Mourlon, ed. Pour l'amour des arbres. Paris: l'Archipel, 2005.
Buscar texto completoDupriez, Hugues. Arbres et agricultures multiétagées d'Afrique. Ede, Pays-Bas: Centre technique de coopération agricole et rurale, 1993.
Buscar texto completoMichael, Snow. 56 tree poems =: 56 arbre poèmes = 56 Boomgedichten. Gent: Imschoot, uitgevers, 1999.
Buscar texto completoPeulon, Véronique. Le dépérissement des arbres en ville. Paris: Service technique de l'urbanisme, Division des équipements urbains, 1988.
Buscar texto completoPirone, Pascal Pompey. Tree maintenance. 6a ed. New York: Oxford University Press, 1988.
Buscar texto completoBernheim, Raphaël. Deux arbres au milieu du jardin. [France]: R. Bernheim, 1992.
Buscar texto completoCapítulos de libros sobre el tema "Arbre Trie"
Jefferson, Ann. "Minou Drouet". En Genius in France. Princeton University Press, 2014. http://dx.doi.org/10.23943/princeton/9780691160658.003.0016.
Texto completo