Relevant bibliographies by topics / Segment trees

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Segment trees'

Author: Grafiati
Published: 4 June 2021
Last updated: 5 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Segment trees.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Segment trees"

1

Blankenagel, G., and R. H. G�ting. "External segment trees." Algorithmica 12, no. 6 (December 1994): 498–532. http://dx.doi.org/10.1007/bf01188717.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Easwarakumar, K. S., and T. Hema. "BITS-Tree -- An Efficient Data Structure for Segment Storage and Query Processing." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 11, no. 10 (December 5, 2013): 3108–16. http://dx.doi.org/10.24297/ijct.v11i10.2980.

Full text
Abstract:
In this paper, a new and novel data structure is proposed to dynamically insert and delete segments. Unlike the standard segment trees, the proposed data structure permits insertion of a segment with interval range beyond the interval range of the existing tree, which is the interval between minimum and maximum values of the end points of all the segments. Moreover, the number of nodes in the proposed tree is lesser as compared to the dynamic version of the standard segment trees, and is able to answer both stabbing and range queries practically much faster compared to the standard segment trees.
APA, Harvard, Vancouver, ISO, and other styles
3

Butterfield, R. P., R. P. Crook, R. Adams, and R. Morris. "Radial Variation in Wood Specific Gravity, Fibre Length and Vessel Area for Two Central American Hardwoods: Hyeronima Alchorneoides and Vochysia Guatemalensis: Natural and Plantation-Grown Trees." IAWA Journal 14, no. 2 (1993): 153–61. http://dx.doi.org/10.1163/22941932-90001310.

Full text
Abstract:
Natural-grown and young (5.5 year old) plantation-grown trees were sampled for two Central American hardwood species: Hyeronima alchorneoides and Vochysia guatemalensis in the Atlantic lowlands of Costa Rica. Increment cores extracted at a height of 1.3 m from trees were divided into 1cm segments from pith to bark. Basic specific gravity was calculated for each segment. Using the same cores, fibre length was measured from macerations for five natural and plantation-grown trees of each species. Number of vessels/mm2 and vessel tangential diameter were measured from segment cross sections for five natural-grown trees of each species.
APA, Harvard, Vancouver, ISO, and other styles
4

Chang, Yeim-Kuan, and Yung-Chieh Lin. "Dynamic Segment Trees for Ranges and Prefixes." IEEE Transactions on Computers 56, no. 6 (June 2007): 769–84. http://dx.doi.org/10.1109/tc.2007.1037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

van Kreveld, Marc J., and Mark H. Overmars. "Union-copy structures and dynamic segment trees." Journal of the ACM 40, no. 3 (July 1993): 635–52. http://dx.doi.org/10.1145/174130.174140.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Noest, A. J. "Conservative trees have universal segment measure distributions." Mathematical Biosciences 80, no. 2 (August 1986): 173–86. http://dx.doi.org/10.1016/0025-5564(86)90043-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Andriantiana, Eric Ould Dadah, Stephan Wagner, and Hua Wang. "Extremal problems for trees with given segment sequence." Discrete Applied Mathematics 220 (March 2017): 20–34. http://dx.doi.org/10.1016/j.dam.2016.12.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gerbessiotis, Alexandros V. "An architecture independent study of parallel segment trees." Journal of Discrete Algorithms 4, no. 1 (March 2006): 1–24. http://dx.doi.org/10.1016/j.jda.2005.01.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jiao, Jichao, and Zhongliang Deng. "Individual Building Rooftop and Tree Crown Segmentation from High-Resolution Urban Aerial Optical Images." Journal of Sensors 2016 (2016): 1–13. http://dx.doi.org/10.1155/2016/1795205.

Full text
Abstract:
We segment buildings and trees from aerial photographs by using superpixels, and we estimate the tree’s parameters by using a cost function proposed in this paper. A method based on image complexity is proposed to refine superpixels boundaries. In order to classify buildings from ground and classify trees from grass, the salient feature vectors that include colors, Features from Accelerated Segment Test (FAST) corners, and Gabor edges are extracted from refined superpixels. The vectors are used to train the classifier based on Naive Bayes classifier. The trained classifier is used to classify refined superpixels as object or nonobject. The properties of a tree, including its locations and radius, are estimated by minimizing the cost function. The shadow is used to calculate the tree height using sun angle and the time when the image was taken. Our segmentation algorithm is compared with other two state-of-the-art segmentation algorithms, and the tree parameters obtained in this paper are compared to the ground truth data. Experiments show that the proposed method can segment trees and buildings appropriately, yielding higher precision and better recall rates, and the tree parameters are in good agreement with the ground truth data.
APA, Harvard, Vancouver, ISO, and other styles
10

Bloom, J. Z. "The use of neural networks and rule induction for customer segmentation and target market profiling." South African Journal of Economic and Management Sciences 5, no. 1 (March 31, 2002): 233–57. http://dx.doi.org/10.4102/sajems.v5i1.2673.

Full text
Abstract:
Inadequate market segmentation and clustering problems could cause an enterprise to either miss a strategic marketing opportunity or not cash in on a tactical campaign. The need for in-depth knowledge of customer segments and to overcome the limitations of non-linear problems require a different approach. The objectives of the research are (1) to consider the use of self-organising feature (SOM) neural networks for segmenting tourist markets and (2) to assess the use of inducing decision trees to obtain rules for profiling existing and classifying new respondents. The findings of the SOM neural network modelling indicate three definitive natural clusters. The induction of rules from decision trees were used to obtain a broad indication of a segment profile on the basis of a rule set and also enables the segment classification of customers from follow-up surveys.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Segment trees"

1

Franco, Alvaro Junio Pereira. "Consultas de segmentos em janelas: algoritmos e estruturas de dados." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-09122009-145514/.

Full text
Abstract:
Neste trabalho estudamos problemas relacionados com a busca de pontos e segmentos em janelas retangulares com os lados paralelos aos eixos. É dado um conjunto de segmentos (ou pontos) no plano. Em uma primeira fase estes segmentos são organizados em estruturas de dados de tal forma a tornar buscas por aqueles que estão contidos em janelas retangulares mais eficiente. Na segunda fase são dadas as janelas de maneira online. Várias destas estruturas de dados são baseadas em árvores balanceadas, tais como, árvore limite, árvore de busca com prioridade, árvore de intervalos e árvore de segmentos. Na dissertação mostramos detalhadamente estas estruturas de dados e os algoritmos para resolver este problema para conjuntos de pontos (versão unidimensional do problema) e para segmentos no plano, tanto horizontais e verticais como com qualquer orientação (sem cruzamentos). Os algoritmos são analisados de forma rigorosa quanto ao seu uso de espaço e de tempo. Implementamos também os vários algoritmos estudados, construindo uma biblioteca destas estruturas de dados. Apresentamos, finalmente os resultados de experimentos computacionais com instâncias do problema.
In this work we study problems about point and segment query in rectangular windows whose edges are parallel to the axis. Given a set of segments (or points) in the plane. In a first phase these segments are organized in data structures such that queries for segments in windows are done more efficiently. In the second phase windows are given online. The data structures are balanced trees as range tree, priority search tree, interval tree and segment tree. In this master\'s thesis we show in details data structures and algorithms for solving windowing queries to sets of points (unidimensional version of the problem) and of segments in the plane, as horizontal and vertical as any orientation (without crossings). The algorithms are analysed rigorously regarding their space and time used. We implement the algorithms studied, building a library of these data structures. Finally, we present, the results of computational experiments with instances of the problem.
APA, Harvard, Vancouver, ISO, and other styles
2

Sosna, Dieter. "Document Version Management Using an Adapted Segment Tree." Universität Leipzig, 1997. https://ul.qucosa.de/id/qucosa%3A34515.

Full text
Abstract:
We describe a data structure and algorithms based on segment trees. They are used to manage different versions of a document and to reconstruct the version which was valid at a given time in the past or to get the most recent version. Difficulties arise because it is not known when a version will be replaced by a newer one. Thus unbounded time intervals are to be handled. The data structure also supports the retrieval of the history of a document.
APA, Harvard, Vancouver, ISO, and other styles
3

Qureshi, Touseef Ahmad. "Extraction of arterial and venous trees from disconnected vessel segments in fundus images." Thesis, University of Lincoln, 2016. http://eprints.lincoln.ac.uk/23687/.

Full text
Abstract:
The accurate automated extraction of arterial and venous (AV) trees in fundus images subserves investigation into the correlation of global features of the retinal vasculature with retinal abnormalities. The accurate extraction of AV trees also provides the opportunity to analyse the physiology and hemodynamic of blood flow in retinal vessel trees. A number of common diseases, including Diabetic Retinopathy, Cardiovascular and Cerebrovascular diseases, directly affect the morphology of the retinal vasculature. Early detection of these pathologies may prevent vision loss and reduce the risk of other life-threatening diseases. Automated extraction of AV trees requires complete segmentation and accurate classification of retinal vessels. Unfortunately, the available segmentation techniques are susceptible to a number of complications including vessel contrast, fuzzy edges, variable image quality, media opacities, and vessel overlaps. Due to these sources of errors, the available segmentation techniques produce partially segmented vascular networks. Thus, extracting AV trees by accurately connecting and classifying the disconnected segments is extremely complex. This thesis provides a novel graph-based technique for accurate extraction of AV trees from a network of disconnected and unclassified vessel segments in fundus viii images. The proposed technique performs three major tasks: junction identification, local configuration, and global configuration. A probabilistic approach is adopted that rigorously identifies junctions by examining the mutual associations of segment ends. These associations are determined by dynamically specifying regions at both ends of all segments. A supervised Naïve Bayes inference model is developed that estimates the probability of each possible configuration at a junction. The system enumerates all possible configurations and estimates posterior probability of each configuration. The likelihood function estimates the conditional probability of the configuration using the statistical parameters of distribution of colour and geometrical features of joints. The parameters of feature distributions and priors of configuration are obtained through supervised learning phases. A second Naïve Bayes classifier estimates class probabilities of each vessel segment utilizing colour and spatial properties of segments. The global configuration works by translating the segment network into an STgraph (a specialized form of dependency graph) representing the segments and their possible connective associations. The unary and pairwise potentials for ST-graph are estimated using the class and configuration probabilities obtained earlier. This translates the classification and configuration problems into a general binary labelling graph problem. The ST-graph is interpreted as a flow network for energy minimization a minimum ST-graph cut is obtained using the Ford-Fulkerson algorithm, from which the estimated AV trees are extracted. The performance is evaluated by implementing the system on test images of DRIVE dataset and comparing the obtained results with the ground truth data. The ground truth data is obtained by establishing a new dataset for DRIVE images with manually classified vessels. The system outperformed benchmark methods and produced excellent results.
APA, Harvard, Vancouver, ISO, and other styles
4

Sheppard, Paul R., Richard L. Holmes, and Lisa J. Graumlich. "The "Many Fragments Curse:" A Special Case of the Segment Length Curse." Tree-Ring Society, 1997. http://hdl.handle.net/10150/262370.

Full text
Abstract:
The "many fragments curse," a special case of the segment length curse, occurs in den- drochronology when time series are broken into fragments, either because of missing part of a sample (e.g., a rot pocket) or when a section of ring growth cannot be crossdated (e.g., a section with extremely suppressed growth and/or many rings absent). We exorcise this curse by inserting values to connect fragments of measurements. This technique permits fitting a single detrending curve to the connected series and thus preserves the low-frequency variance contained in the entire series. Inserted values are discarded after detrending and do not otherwise affect calculations of final corn- posite chronologies. As an example from junipers sampled at a site in Qinghai Province, China, 66 of 117 increment cores have nondatable sections of wood and one core has a gap of rotten wood between dated fragments. After connecting fragments by inserting values and then detrending, the chronology constructed from connected fragments has stronger century to multicentury scale variation than the chronology constructed from separate fragments. This approach is adapted to the library of computer programs developed for dendrochronological research under the auspices of the International Tree-Ring Data Bank.
APA, Harvard, Vancouver, ISO, and other styles
5

Sarigul, Erol. "Interactive Machine Learning for Refinement and Analysis of Segmented CT/MRI Images." Diss., Virginia Tech, 2004. http://hdl.handle.net/10919/25954.

Full text
Abstract:
This dissertation concerns the development of an interactive machine learning method for refinement and analysis of segmented computed tomography (CT) images. This method uses higher-level domain-dependent knowledge to improve initial image segmentation results. A knowledge-based refinement and analysis system requires the formulation of domain knowledge. A serious problem faced by knowledge-based system designers is the knowledge acquisition bottleneck. Knowledge acquisition is very challenging and an active research topic in the field of machine learning and artificial intelligence. Commonly, a knowledge engineer needs to have a domain expert to formulate acquired knowledge for use in an expert system. That process is rather tedious and error-prone. The domain expert's verbal description can be inaccurate or incomplete, and the knowledge engineer may not correctly interpret the expert's intent. In many cases, the domain experts prefer to do actions instead of explaining their expertise. These problems motivate us to find another solution to make the knowledge acquisition process less challenging. Instead of trying to acquire expertise from a domain expert verbally, we can ask him/her to show expertise through actions that can be observed by the system. If the system can learn from those actions, this approach is called learning by demonstration. We have developed a system that can learn region refinement rules automatically. The system observes the steps taken as a human user interactively edits a processed image, and then infers rules from those actions. During the system's learn mode, the user views labeled images and makes refinements through the use of a keyboard and mouse. As the user manipulates the images, the system stores information related to those manual operations, and develops internal rules that can be used later for automatic postprocessing of other images. After one or more training sessions, the user places the system into its run mode. The system then accepts new images, and uses its rule set to apply postprocessing operations automatically in a manner that is modeled after those learned from the human user. At any time, the user can return to learn mode to introduce new training information, and this will be used by the system to updates its internal rule set. The system does not simply memorize a particular sequence of postprocessing steps during a training session, but instead generalizes from the image data and from the actions of the human user so that new CT images can be refined appropriately. Experimental results have shown that IntelliPost improves the segmentation accuracy of the overall system by applying postprocessing rules. In tests two different CT datasets of hardwood logs, the use of IntelliPost resulted in improvements of 1.92% and 9.45%, respectively. For two different medical datasets, the use of IntelliPost resulted in improvements of 4.22% and 0.33%, respectively.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
6

Fujii, Sena. "The bronchial tree of the human embryo: an analysis of variations in the bronchial segments." Kyoto University, 2020. http://hdl.handle.net/2433/259733.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ounekham, Khamsene. "Developing volume and taper equations for Styrax tonkinensis in Laos." Thesis, University of Canterbury. School of Forestry, 2009. http://hdl.handle.net/10092/3450.

Full text
Abstract:
A volume equation for predicting individual tree volume, and a taper function for describing a stem profile were developed for a little known species, Styrax tonkinensis (Siam benzoin) in northern Laos. The species has high potential commercial value and can make an important contribution to the local economy. It can provide two different types of products, a non-wood product (benzoin resin) and timber. In Laos, the most important product is currently resin, and the use of timber for commercial purposes is rare. One reason is that information about the timber is not available. In Vietnam, on the other hand, the species is an import pulpwood species. Data used in this study came from 73 trees. Trees were purposely selected to ensure coverage of a full range of tree sizes. Measurement was undertaken only on over-bark diameters due to some constraints, limitations and problems during the field data collection. However, due to the importance of under-bark volume for this species, a small available dataset was used to build a bark model as an interim guide to the errors associated with using over-bark models for estimating under-bark volumes. From this bark model, errors in estimating under-bark volumes of trees with diameters at breast height between 10cm and 17 cm were approximately 18%. Nineteen individual volume models, and 7 individual taper functions were compared for bias and precision. Collective names for the volume equations tested include single-entry, double-entry, logarithmic, combined variables. Most volume models had similar bias but a few were clearly biased. The models with similar bias were further evaluated by four common statistics including bias, standard error of estimates, standard deviation of residuals and mean absolute deviation. The results showed that a five parameter model was ranked first, and was the most precise model. However, the magnitudes of difference in prediction errors between this model and other models, particularly the three parameter model were not significant. For practical purposes, the simpler model was preferred. Seven taper functions tested here belong to three different groups including single taper equations, compatible taper equations and segmented taper equations. Evaluation of taper equations used the same residual analysis procedures and criteria as those applied with volume equations. Graphical residual analysis showed that most taper models had similar precision with their errors in diameter predictions being similar in range. However, some models showed obvious bias. The most highly ranked taper model was a compatible taper model of polynomial form. It was the least biased model. The second ranked model was a single, simple model. This latter model is relatively simple to apply, but it is not compatible with the volume model, yielding slightly different estimates of volume if it is integrated and rotated around the longitudinal axis of a tree. However, if the sole purpose is to describe tree taper, it is the best model to use.
APA, Harvard, Vancouver, ISO, and other styles
8

Said, Mouhammad. "Géométrie multi-résolution des objets discrets bruités." Grenoble, 2010. http://www.theses.fr/2010GRENM084.

Full text
Abstract:
Les courbes frontières définissent les régions ou les formes du plan de manière compacte et descriptive. Il est bien connu que les formes doivent être étudiées à différentes échelles. Ceci a conduit au développement des pyramides régulières et irrégulières pour l'analyse des formes et la compréhension des scènes. Cependant, il n'existe pas une description analytique de la multi-résolution d'une forme numérique, contrairement au célèbre espace-échelle (scale-space) dans le monde continu. En outre, les primitives géométriques telles que les lignes, les cercles ou les polynômes ont une grande importance dans le contexte de la géométrie numérique. Les morceaux des droites numériques sont un bon moyen pour estimer les tangentes et les arcs discrets approchent la courbure. Il est donc nécessaire de les garder dans l'analyse multi-échelle des frontières numériques. Un des objectifs de cette thèse est de donner des nouveaux résultats analytiques sur la multi-résolution des droites 4-connexes et des segments de droites 4-connexes. Figueiredo est le premier qui a étudié le comportement des droites 8-connexes lors du changement de la résolution de la grille. Dans le présent travail, nous considérons une droite 4-connexe pour laquelle une description analytique est fournie lorsque la résolution de la grille est modifiée par un facteur arbitraire. En plus, nous montrons que leurs couvertures sont des droites 4-connexes. Comme les formules analytiques des segments de droite sont un problème beaucoup plus difficile, nous proposons un parcours indirect pour la multi-résolution d'un DSS en utilisant le fait qu'un segment est un morceau fin d'une droite discrète. Etant donné un DSS, nous construisons deux droites dont l'intersection le contient et dont la partie connexe principale a les mêmes caractéristiques arithmétiques, ainsi que le même nombre de motifs. Notons que nous proposons de nouveaux résultats combinatoires des intersections de droites. Nous déterminons la multi-résolution du segment en examinant la multi-résolution de l'intersection de ces deux droites. Nous donnons une nouvelle description analytique de cet ensemble avec des inégalités arithmétiques. Nous abordons également le problème du calcul des caractéristiques exactes d'un sous-segment d'une droite 4-connexe qui a des caractéristiques connues. Nous présentons deux nouveaux algorithmes SmartDSS et ReversedSmartDSS qui résolvent ce problème. Leur principe est de se déplacer dans l'arbre de Stern-Brocot de la fraction soit de manière haut-bas ou bas-haut. Dans le pire cas, leur complexité est meilleure que l'algorithme de reconnaissance DSS classique. Les deux algorithmes peuvent dès lors servir à calculer efficacement la multi-résolution d'un segment. Les bruits tout au long des contours numériques ne sont pas vraiment détectés, mais plutôt annulés par l'épaississement des segments de droites 4-connexes. De plus, l'épaisseur est réglée par un utilisateur et aussi définie globalement pour le contour. Pour surmonter ce problème, nous proposons une stratégie originale pour détecter localement à la fois la quantité de bruit et les épaisseurs significatives de chaque point de contour. Ce travail se base sur les propriétés asymptotiques de segments flous d'épaisseurs différentes, et forme une alternative à l'approche multi-résolution de la détection du bruit
Boundary curves are compact and descriptive means for defining regions or shapes in the plane. It is well known that shapes should be studied at different scales. This has led to the development of regular and irregular pyramids for shape analysis and scene understanding. However there exists no analytical description of the multiresolution of a digital shape, contrary to the famous scale-space analysis in the continuous world. Moreover, in the context of digital geometry, geometric primitives such as lines, circles or polynomials are of a great importance. For instance, pieces of digital lines are excellent tangent estimators, circular arcs estimate curvature. It is thus fundamental to keep them in the multiscale analysis of digital boundaries. One of the contribution of this thesis is to give new analytical results on the multiresolution of Digital Straight Line (DSL) and Digital Straight Segment (DSS). Figueiredo is the first one who studied the behavior of 8-connected lines when changing the resolution of the grid [41]. In this work, we consider a standard digital line. The objective is to provide an analytic description of digital straight line DSL when the resolution of the grid is changed by an arbitrary factor. We also prove that their subsampling is a standard digital line. As analytical formulae for DSS appear to be a much harder problem and DSS are finite parts of DSL, we propose an indirect path to DSS multiresolution. Given a DSS, we build two DSL whose intersection contains it and whose main connected part has the same arithmetic characteristics as well as the same number of patterns. We note here that we propose new results about the combinatorics of such digital line intersections. We determine the multiresolution of DSS by examining the multiresolution of the intersection of these two DSL. We give a new analytical description of this set with arithmetic inequalities. We also address the problem of computing the exact characteristics of any subsegment of digital straight line with known characteristics. We present two new algorithms SmartDSS and ReversedSmartDSS that solve this problem. Their principle is to climb the Stern-Brocot tree of fraction either in a top-down or bottom-up way. Their worst-time complexity are better than the classical DSS recognition algorithm. Both algorithms are useful to compute efficiently the multiresolution of a DSS. The noise along digital contours is not really detected but is rather canceled out by thickening digital straight segments. The thickness is tuned by a user and set globally for the contour. To overcome this issue, we propose an original strategy to detect locally both the amount of noise and the meaningful thickness of each point of a digital contour. This work is based on the asymptotic properties of blurred segments with different thicknesses and forms an alternative to the multiscale approach to noise detection
APA, Harvard, Vancouver, ISO, and other styles
9

García, Martin Silvana María. "Propuesta de mejora en la segmentación comercial de clientes del segmento grandes empresas de tres de los principales bancos del Perú." Bachelor's thesis, Universidad del Pacífico, 2019. http://hdl.handle.net/11354/2624.

Full text
Abstract:
El presente trabajo de suficiencia profesional se enfoca en el establecimiento de una propuesta de mejora en la segmentación comercial de clientes del segmento Grandes Empresas de tres de los principales bancos del Perú y para desarrollarla se realizó una investigación cualitativa exhaustiva en base a fuentes primarias y secundarias (principalmente entrevistas a gerentes expertos en la materia). Mediante el presente trabajo se concluye que muchos productos o servicios ofrecidos por tres de los principales bancos del Perú no tienen el impacto deseado en los clientes, pese a que dichos bancos utilizan tecnología de vanguardia en su desarrollo e implementación. Ello debido a que la segmentación comercial actual realizada por dichos bancos no necesariamente es la correcta, pues solo considera variables demográficas en el proceso. Por ello, se propone realizar una segmentación demográfica a priori y una segmentación psicográfica post – hoc que se enfoque en el íntegro de los clientes.
APA, Harvard, Vancouver, ISO, and other styles
10

Sturla, Rojas Giovanna Paulina. "Resistencia adhesiva a dentina radicular de dos tipos de cementos de resina compuesta en tres segmentos de la raíz." Tesis, Universidad de Chile, 2011. http://repositorio.uchile.cl/handle/2250/133379.

Full text
Abstract:
Trabajo de Investigación Requisito para optar al Título de Cirujano Dentista
Autor no autoriza el acceso a texto completo de su documento
Los cementos de resina compuesta autoadhesivos se desarrollaron con el fin de simplificar la técnica de aplicación manteniendo la misma eficacia de los cementos que requieren de acondicionamiento previo. Si bien algunos estudios demuestran un mejor comportamiento en cuanto a la fuerza adhesiva en dentina coronaria lograda con los cementos tradicionales como RelyX ARC con su sistema adhesivo, respecto al cemento RelyX U100 autoadhesivo, no existen estudios similares que demuestren este comportamiento en dentina radicular. Objetivo: Establecer las diferencias en el grado de resistencia adhesiva lograda en el segmento cervical, medio y apical de dentina radicular que presentan dos sistemas de cemento de resina compuesta diferentes. Material y Método: 30 piezas dentarias humanas unirradiculadas sanas, recientemente extraídas, fueron seccionadas a nivel del límite amelocementario. La raíz fue dividida en dos hemirraíces, las que a su vez, fueron seccionadas en tres segmentos: cervical, medio y apical. Se obtuvieron 180 muestras de dentina radicular separadas en 6 grupos de 30 muestras cada uno, a las que se les adhirió un cilindro de resina compuesta de 2 mm de diámetro con el cemento y sistema adhesivo correspondiente: Grupo A1: Segmento cervical/ RelyX U100; A2: Segmento medio/ RelyX U100; A3: Segmento apical/ RelyX U100; B1: Segmento cervical/ RelyX ARC+ SingleBond2; B2: Segmento medio/ RelyX ARC+ SingleBond2; B3: Segmento apical/ RelyX ARC+ SingleBond2. Los cuerpos de prueba fueron testeados en la máquina de ensayos universales Instron, que aplicó fuerzas de cizallamiento a una velocidad de 2 mm/min. Se realizó análisis estadístico descriptivo e inferencial, con un nivel de significancia de 0,05. Resultados: Los promedios de resistencia adhesiva expresados en megapascales fueron: A1=26,24; A2=24,61; A3=22,50; B1=30,07; B2=25,98; B3=22,17. 5 Conclusión: RelyX ARC+ SingleBond2, presentó mayores valores de adhesión que RelyX U100 en el segmento cervical y medio, no así en el segmento apical. Estas diferencias no fueron estadísticamente significativas (p>0,05). En ambos sistemas adhesivos, el mayor grado de resistencia adhesiva se presentó en el segmento cervical, seguido del segmento medio y apical, encontrándose sólo diferencias significativas en el sistema RelyX ARC+ SingleBond2 entre el segmento cervical y apical (p=0,014) a través del test de Tukey.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Segment trees"

1

Taylor, Wesley P. An application of existing code for a generalized suffix tree to the identification of rRNA segments exclusive to taxonomic groups: A case study. 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dewhurst, Alexander Timothy, and Brigitta Brandner. Intensive care management after vascular surgery. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780199600830.003.0370.

Full text
Abstract:
Vascular patients require admission to an intensive care unit at a number of stages during their hospital stay. They often have multiple co-morbidities and are at risk of major complications. Their management strategy requires a multidisciplinary approach with locally agreed pathways taking national frameworks into account. Vascular emergencies require immediate resuscitation and transfer to a tertiary cardiovascular centre. Vascular disease occurs throughout the arterial vascular tree, affecting both large and small vessels. The major cause is atherosclerosis. The management of vascular conditions is complex, and includes both medical and surgical interventions. Disease can be classified as non-occlusive where there is restricted blood flow or occlusive where the vessels are completely obstructed. Aneurysmal disease occurs when vessels walls weaken. The surgical treatment of these lesions is to either replace the diseased segment of artery with a vascular graft or to exclude it with an endovascular stent. Occlusive vascular disease can occur because of atherosclerotic emboli or thrombosis, and can be treated by embolectomy, bypass, or endovascular procedures. Medical therapy with β‎-blockade, lipid-lowering agents, anti-hypertensives agents, and control of diabetes reduces cardiovascular risk. Recent advances in medical technology have shifted treatment options from open surgical to endovascular procedures. The long-term outcome and cost benefit of endovascular procedures is yet to be established.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Segment trees"

1

van Kreveld, Marc J., and Mark H. Overmars. "Concatenable segment trees." In STACS 89, 493–504. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0029010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mitchell, William J., and John R. Steel. "Closure Under Initial Segment." In Fine Structure and Iteration Trees, 96–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-662-21903-4_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Niquefa, Rafael, Juan Mendivelso, Germán Hernández, and Yoan Pinzón. "Segment and Fenwick Trees for Approximate Order Preserving Matching." In Communications in Computer and Information Science, 131–43. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66963-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bala, Kavita, Julie Dorsey, and Seth Teller. "Interactive Ray-Traced Scene Editing Using Ray Segment Trees." In Eurographics, 31–44. Vienna: Springer Vienna, 1999. http://dx.doi.org/10.1007/978-3-7091-6809-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Racherla, Gopal, Sridhar Radhakrishnan, and B. John Oommen. "A New Geometric Tool for Pattern Recognition - An Algorithm for Real Time Insertion of Layered Segment Trees." In Lecture Notes in Computer Science, 214–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44732-6_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dey, Sanjana, Ramesh K. Jallu, and Subhas C. Nandy. "Minimum Spanning Tree of Line Segments." In Lecture Notes in Computer Science, 529–41. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94776-1_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Inbok, Jeong-Shik Mun, and Sung-Ryul Kim. "IP Address Lookup with the Visualizable Biased Segment Tree." In Fuzzy Systems and Knowledge Discovery, 1137–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11539506_142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kan, Tomohiro, Shoichi Higuchi, and Kouichi Hirata. "Segmental Mapping and Distance for Rooted Labeled Ordered Trees." In Algorithms and Computation, 485–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35261-4_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cousot, Patrick, Radhia Cousot, and Laurent Mauborgne. "A Scalable Segmented Decision Tree Abstract Domain." In Time for Verification, 72–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13754-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bose, Prosenjit, Michael E. Houle, and Godfried Toussaint. "Every set of disjoint line segments admits a binary tree." In Algorithms and Computation, 20–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58325-4_162.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Segment trees"

1

Chang, Yeim-Kuan, Yung-Chieh Lin, and Chen-Yu Lin. "Grid of Segment Trees for Packet Classification." In 2010 24th IEEE International Conference on Advanced Information Networking and Applications. IEEE, 2010. http://dx.doi.org/10.1109/aina.2010.38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chang, Yeim-Kuan, and Hsin-Mao Chen. "Set Pruning Segment Trees for Packet Classification." In 2011 IEEE 25th International Conference on Advanced Information Networking and Applications (AINA). IEEE, 2011. http://dx.doi.org/10.1109/aina.2011.69.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gawarkiewicz, Michał, Piotr Wiśniewski, and Krzysztof Stencel. "Enhanced segment trees in object-relational mapping." In the 6th Balkan Conference in Informatics. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2490257.2490291.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Stan, Ioan, Dan Toderici, and Rodica Potolea. "Segment Trees based Traffic Congestion Avoidance in Connected Cars Context." In 2018 IEEE 14th International Conference on Intelligent Computer Communication and Processing (ICCP). IEEE, 2018. http://dx.doi.org/10.1109/iccp.2018.8516609.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Chih-Hang, Sheng-Hao Chiang, Shan-Hsiang Shen, De-Nian Yang, and Wen-Tsuen Chen. "Multicast Traffic Engineering with Segment Trees in Software-Defined Networks." In IEEE INFOCOM 2020 - IEEE Conference on Computer Communications. IEEE, 2020. http://dx.doi.org/10.1109/infocom41043.2020.9155264.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hampe, Nils, Jelmer M. Wolterink, Carlos Collet, R. Nils Planken, and Ivana Išgum. "Graph attention networks for segment labeling in coronary artery trees." In Image Processing, edited by Bennett A. Landman and Ivana Išgum. SPIE, 2021. http://dx.doi.org/10.1117/12.2581219.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Xinuo, and Stephen A. Jarvis. "Distributed Arbitrary Segment Trees: Providing Efficient Range Query Support over Public DHT Services." In 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications. IEEE, 2007. http://dx.doi.org/10.1109/pimrc.2007.4394158.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Balasa, Florin, Sarat C. Maruvada, and Karthik Krishnamoorthy. "Efficient solution space exploration based on segment trees in analog placement with symmetry constraints." In the 2002 IEEE/ACM international conference. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/774572.774645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Adamo, Francesco, Filippo Attivissimo, Attilio Di Nisio, Mattia Alessandro Ragolia, and Marco Scarpetta. "A New Processing Method to Segment Olive Trees and Detect Xylella Fastidiosa in UAVs Multispectral Images." In 2021 IEEE International Instrumentation and Measurement Technology Conference (I2MTC). IEEE, 2021. http://dx.doi.org/10.1109/i2mtc50364.2021.9459835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lim, Andrew, and Sartaj Sahni. "Segmented winner trees." In the 30th annual Southeast regional conference. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/503720.503783.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Segment trees"

1

Qi, Yan, Ryan Fries, Shambhu Saran Baral, and Pranesh Biswas. Evaluating the Costs and Benefits of Snow Fences in Illinois: Phase 2. Illinois Center for Transportation, November 2020. http://dx.doi.org/10.36501/0197-9191/20-020.

Full text
Abstract:
Serving as a windbreak, properly sited and designed snow fences have been proven effective in mitigating the negative impacts of blowing snow. To achieve the best snow-control effects, the ideal locations for snow fences are usually outside the roadway right-of-way. Few efforts have been made to examine the economic efficiency of snow fences and explore ways to reward private landowners. The objective of this project was to develop methodologies for evaluation of the costs and benefits of snow fences in Illinois and identify ways to encourage private landowners’ participation in the snow fence program while keeping it cost-effective. The researchers conducted a literature review as well as agency and landowner surveys. They also acquired crash data, snow fence and blowing snow segment inventory data, and blowing snow removal expenditure data as well as performed benefit-cost analyses of three types of snow fences following Federal Highway Administration guides. The survey results suggested that standing corn rows (SCRs) and structural snow fences (SSFs) were the least intrusive options for landowners and living snow fences (LSFs) with trees were the most intrusive. Some concerns related to LSFs could be reduced by allowing landowners to play a role in the design and plant-selection process. The crash data indicated that no fatal and severe crashes occurred at snow fence segments, while several fatal and severe crashes occurred at blowing snow segments during 2012–2016. The results of the benefit-cost analyses showed that the benefit-cost ratios for LSFs and SSFs are comparable. However, LSFs are favorable over SSFs because little maintenance is needed after the plants are mature. Although SCRs have the highest benefit-cost ratio, the need to renew the agency-landowner agreement annually and the alternating of crops planted may limit their snow-control effectiveness and large-scale implementation. A tool was developed using MS Excel to facilitate the benefit-cost analysis of snow fences.
APA, Harvard, Vancouver, ISO, and other styles
2

Perkins, Dustin. Invasive exotic plant monitoring at Colorado National Monument: 2019 field season. Edited by Alice Wondrak Biel. National Park Service, July 2021. http://dx.doi.org/10.36967/nrr-2286650.

Full text
Abstract:
Invasive exotic plant (IEP) species are a significant threat to natural ecosystem integrity and biodiversity, and controlling them is a high priority for the National Park Service. The North-ern Colorado Plateau Network (NCPN) selected the early detection of IEPs as one of 11 monitoring protocols to be implemented as part of its long-term monitoring program. This report represents work completed at Colorado National Monument during 2019. During monitoring conducted June 12–19, a total of 20 IEP species were detected on monitoring routes and transects. Of these, 12 were priority species that accounted for 791 separate IEP patches. IEPs were most prevalent along riparian areas. Yellow sweetclover (Melilotis officinale) and yellow salsify (Tragopogon dubius) were the most commonly detected priority IEPs along monitoring routes, representing 73% of all priority patches. Patches of less than 40 m2 were typical of nearly all priority IEP species except yellow sweetclover. A patch management index (PMI) was created by combining patch size class and percent cover for each patch. In 2019, a large majority of priority IEP patches were assigned a PMI score of low (46%) or very low (50%), indicating small and/or sparse patches where control is generally still feasible. This is similar to the numbers for 2017, when 99% of patches scored low or very low in PMI. Seventy-eight percent of tree patches were classified as seedlings or saplings, which require less effort to control than mature trees. Cheatgrass (Anisantha tectorum) was the most common IEP recorded in transects, found in 30–77% of transects across the different routes. It was the only species found in transects on all monitoring routes. When treated and untreated extra areas near the West Entrance were compared, the treated area had comparable or higher lev-els of IEPs than the untreated area. When segments of monitoring routes conducted between 2003 and 2019 were compared, results were mixed, due to the different species monitored in different time periods. But in general, the number of IEPs per 100 meters is increasing or remaining constant over time. There were notable increases in IEP patches per 100 meters on several routes in 2019: field bindweed (Convolvulus arvensis) along East Glade Park Road; Siberian elm (Ulmus pumila) in Red Canyon; yellow salsify along East Glade Park Road, No Thoroughfare Canyon, No Thoroughfare Trail, and Red Canyon; and yellow sweetclover in No Thoroughfare Canyon and Red Canyon. Network staff will return to re-sample monitoring routes in 2021.
APA, Harvard, Vancouver, ISO, and other styles
3

Bastante, Marcelo. Estudio Fintech 2020: Ecosistema Argentino. Inter-American Development Bank, July 2020. http://dx.doi.org/10.18235/0002892.

Full text
Abstract:
El estudio representa una actualización del primer informe sobre el ecosistema Fintech en Argentina llevado a cabo en el año 2018. Describe la evolución y los avances ocurridos con respecto a la medición y el análisis realizado anteriormente, además de examinar nuevas dimensiones relevantes en el sector. La primera sección brinda una descripción general del ecosistema actual, en donde se refleja su crecimiento desde el año 2018, el panorama de la industria, su distribución y alcance en el país, y sus principales indicadores (financiamiento, clientes, usuarios y empresas). El estudio cuenta con la particularidad de haberse realizado en pleno proceso de la crisis sanitaria generada por la pandemia COVID-19, por lo que parte del estudio aborda las áreas de impacto de la crisis en las Fintech, según la visión de los integrantes del ecosistema. La segunda sección aborda un análisis por vertical Fintech, es decir por nueve segmentos de actividad dentro del ecosistema: Préstamos, Pagos digitales, Blockchain & Criptoactivos, Insurtech, Inversiones, Servicios B2B, Financiamiento colectivo, Seguridad informática y Proveedor tecnológico. La tercera sección se centra en el estudio de cuatro temas transversales que atañen a todos los segmentos o sectores. Estos temas transversales se denominan horizontales: Inclusión y Educación Financiera, Género, Marco Regulatorio y Ambiente. Si bien estos horizontales se encuentran interrelacionados, se analizan individualmente. En la última sección se presentan tres casos de estudio - Ualá, Mercado Fondos y Afluenta - centrados en el rol de las Fintech en la promoción de una inclusión financiera. El estudio cuenta con la colaboración de la Cámara Argentina de Fintech, el BID Lab, Afluenta y la participación de los protagonistas de la industria que fueron encuestados para el desarrollo del informe, y entrevistados para los casos de estudio.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Segment trees' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography