Log in

Relevant bibliographies by topics / Quasi-tree / Journal articles

To see the other types of publications on this topic, follow the link: Quasi-tree.

Journal articles on the topic 'Quasi-tree'

Author: Grafiati

Published: 7 June 2025

Last updated: 16 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Quasi-tree.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Olela Otafudu, Olivier. "Quasi-metric tree inT0-quasi-metric spaces." Topology and its Applications 160, no. 13 (2013): 1794–801. http://dx.doi.org/10.1016/j.topol.2013.07.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

MALETTI, ANDREAS, and CĂTĂLIN IONUŢ TÎRNĂUCĂ. "PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS." International Journal of Foundations of Computer Science 21, no. 03 (2010): 257–76. http://dx.doi.org/10.1142/s0129054110007234.

Full text

Abstract:

The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is defined by a tree bimorphism (φ, L, ψ), where φ and ψ are quasi-relabeling tree homomorphisms and L is a regular tree language. Such relations admit a canonical representation, which immediately also yields that QUASI is closed under finite union. However, QUASI is not closed under intersection and complement. In addition, many standard relations on trees (e.g., branches, subtrees, v-product, v-quotient, and f-top-catenation) are not quasi-relabeling relations. If quasi-relabeling relations are considered as string relations (by taking the yields of the trees), then every Cartesian product of two context-free string languages is a quasi-relabeling relation. Finally, the connections between quasi-relabeling relations, alphabetic relations, and classes of tree relations defined by several types of top-down tree transducers are presented. These connections yield that quasi-relabeling relations preserve the regular and algebraic tree languages.

APA, Harvard, Vancouver, ISO, and other styles

3

Hamann, Matthias. "Tree amalgamations and quasi-isometries." Journal of Combinatorial Theory, Series B 173 (July 2025): 83–101. https://doi.org/10.1016/j.jctb.2025.02.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Gécseg, Ferenc. "On Quasi-Products of Tree Automata." JUCS - Journal of Universal Computer Science 8, no. (2) (2002): 184–92. https://doi.org/10.3217/jucs-008-02-0184.

Full text

Abstract:

In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in which permutation and unification of variables are allowed. It is shown that in sets of tree automata which are homomorphically complete with respect to the quasi-product the essentially unary operations play the basic role among all operations with nonzero ranks. Furthermore, we give a characterization of homomorphically complete sets which is similar to the classical one. 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen.

APA, Harvard, Vancouver, ISO, and other styles

5

Sun, Xiaoling, and Jianwei Du. "On Variable Sum Exdeg Indices of Quasi-Tree Graphs and Unicyclic Graphs." Discrete Dynamics in Nature and Society 2020 (August 26, 2020): 1–7. http://dx.doi.org/10.1155/2020/1317295.

Full text

Abstract:

In this work, by using the properties of the variable sum exdeg indices and analyzing the structure of the quasi-tree graphs and unicyclic graphs, the minimum and maximum variable sum exdeg indices of quasi-tree graphs and quasi-tree graphs with perfect matchings were presented; the minimum and maximum variable sum exdeg indices of unicyclic graphs with given pendant vertices and cycle length were determined.

APA, Harvard, Vancouver, ISO, and other styles

6

Gimpel, Kevin, and Noah A. Smith. "Phrase Dependency Machine Translation with Quasi-Synchronous Tree-to-Tree Features." Computational Linguistics 40, no. 2 (2014): 349–401. http://dx.doi.org/10.1162/coli_a_00175.

Full text

Abstract:

Recent research has shown clear improvement in translation quality by exploiting linguistic syntax for either the source or target language. However, when using syntax for both languages (“tree-to-tree” translation), there is evidence that syntactic divergence can hamper the extraction of useful rules (Ding and Palmer 2005 ). Smith and Eisner ( 2006 ) introduced quasi-synchronous grammar, a formalism that treats non-isomorphic structure softly using features rather than hard constraints. Although a natural fit for translation modeling, its flexibility has proved challenging for building real-world systems. In this article, we present a tree-to-tree machine translation system inspired by quasi-synchronous grammar. The core of our approach is a new model that combines phrases and dependency syntax, integrating the advantages of phrase-based and syntax-based translation. We report statistically significant improvements over a phrase-based baseline on five of seven test sets across four language pairs. We also present encouraging preliminary results on the use of unsupervised dependency parsing for syntax-based machine translation.

APA, Harvard, Vancouver, ISO, and other styles

7

Denisov, E. S., I. D. Shafigullin, and Yu K. Evdokimov. "Quasi-Distributed Resistive Sensor with Tree Structure." Optoelectronics, Instrumentation and Data Processing 57, no. 2 (2021): 216–19. http://dx.doi.org/10.3103/s8756699021020059.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Xu, Kexiang, Hongshuang Liu, and Kinkar Ch Das. "The Kirchhoff Index of Quasi-Tree Graphs." Zeitschrift für Naturforschung A 70, no. 3 (2015): 135–39. http://dx.doi.org/10.1515/zna-2014-0230.

Full text

Abstract:

AbstractResistance distance was introduced by Klein and Randić as a generalisation of the classical distance. The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all unordered pairs of vertices. In this article we characterise the extremal graphs with the maximal Kirchhoff index among all non-trivial quasi-tree graphs of order n. Moreover, we obtain a lower bound on the Kirchhoff index for all non-trivial quasi-tree graphs of order n.

APA, Harvard, Vancouver, ISO, and other styles

9

Xu, Ying, and Jixiang Meng. "The Laplacian spread of quasi-tree graphs." Linear Algebra and its Applications 435, no. 1 (2011): 60–66. http://dx.doi.org/10.1016/j.laa.2010.04.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Altassan, Alaa, and Muhammad Imran. "Generalized Quasi Trees with Respect to Degree Based Topological Indices and Their Applications to COVID-19 Drugs." Mathematics 11, no. 3 (2023): 647. http://dx.doi.org/10.3390/math11030647.

Full text

Abstract:

The l-generalized quasi tree is a graph G for which we can find W⊂V(G) with |W|=l such that G−W is a tree but for an arbitrary Y⊂V(G) with |Y|<l, G−Y is not a tree. In this paper, inequalities with respect to zeroth-order Randić and hyper-Zagreb indices are studied in the class of l-generalized quasi trees. The corresponding extremal graphs corresponding to these indices in the class of l-generalized quasi trees are also obtained. In addition, we carry QSPR analysis of COVID-19 drugs with zeroth-order Randić and hyper-Zagreb indices (energy).

APA, Harvard, Vancouver, ISO, and other styles

11

Kumar, P. Ramana Vijaya, and Dr Bhuvana Vijaya. "Applications of Hamiltonian Cycle from Quasi Spanning Tree of Faces based Bipartite Graph." Journal of Advanced Research in Dynamical and Control Systems 11, no. 12-SPECIAL ISSUE (2019): 505–12. http://dx.doi.org/10.5373/jardcs/v11sp12/20193245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Chen, Xing. "A Novel Broadband Quasi-fractal Binary Tree Dipole." PIERS Online 3, no. 1 (2007): 21–24. http://dx.doi.org/10.2529/piers060904094821.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Denisov, E. S., I. D. Shafigullin, and Yu K. Evdokimov. "QUASI-DISTRIBUTED RESISTIVE SENSOR WITH A TREE STRUCTURE." Автометрия 57, no. 2 (2021): 117–21. http://dx.doi.org/10.15372/aut20210213.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Liu, Huiqing, and Mei Lu. "On the spectral radius of quasi-tree graphs." Linear Algebra and its Applications 428, no. 11-12 (2008): 2708–14. http://dx.doi.org/10.1016/j.laa.2007.12.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Lu, Mei, and Jinwu Gao. "On the Randić Index of Quasi-tree Graphs." Journal of Mathematical Chemistry 42, no. 3 (2006): 297–310. http://dx.doi.org/10.1007/s10910-006-9089-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Najman, L., and M. Couprie. "Building the Component Tree in Quasi-Linear Time." IEEE Transactions on Image Processing 15, no. 11 (2006): 3531–39. http://dx.doi.org/10.1109/tip.2006.877518.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

García Barroso, Evelia R., and Janusz Gwoździewicz. "Quasi-Ordinary Singularities: Tree Model, Discriminant, and Irreducibility." International Mathematics Research Notices 2015, no. 14 (2014): 5783–805. http://dx.doi.org/10.1093/imrn/rnu106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Butler, Clark. "A quasi-tree expansion of the Krushkal polynomial." Advances in Applied Mathematics 94 (March 2018): 3–22. http://dx.doi.org/10.1016/j.aam.2016.06.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Dehghan-Zadeh, T., and A. R. Ashrafi. "Atom–bond connectivity index of quasi-tree graphs." Rendiconti del Circolo Matematico di Palermo (1952 -) 63, no. 3 (2014): 347–54. http://dx.doi.org/10.1007/s12215-014-0164-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Lin, Zhen, Shu-Guang Guo, and Ke Luo. "The Quasi-tree Graph with Maximum Laplacian Spread." Bulletin of the Malaysian Mathematical Sciences Society 42, no. 4 (2017): 1699–708. http://dx.doi.org/10.1007/s40840-017-0572-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Schindler, Dirk, and Sven Kolbe. "Assessment of the Response of a Scots Pine Tree to Effective Wind Loading." Forests 11, no. 2 (2020): 145. http://dx.doi.org/10.3390/f11020145.

Full text

Abstract:

The parameterization of hybrid-mechanistic storm damage models is largely based on the results of tree pulling tests. The tree pulling tests are used for imitating the quasi-static wind load associated with the mean wind speed. The combined effect of dynamic and quasi-static wind loads associated with wind load maxima is considered by either linearly increasing the quasi-static wind load by a gust factor or by using a turning moment coefficient determined from the relationship between maxima of wind-induced tree response and wind speed. To improve the joint use of information on dynamic and quasi-static wind loading, we present a new method that uses the coupled components of momentum flux time series and time series of stem orientation of a plantation-grown Scots pine tree. First, non-oscillatory tree motion components, which respond to wind excitation, are isolated from oscillatory components that are not coupled to the wind. The non-oscillatory components are detected by applying a sequence of time series decomposition methods including bi-orthogonal decomposition and singular spectrum analysis. Then, the wind-excited tree response components are subjected to dynamic time warping, which maximizes the coincidence between the processed data. The strong coincidence of the time-warped data allows for the estimation of the wind-induced tree response as a function of the effective wind load using simple linear regression. The slope of the regression line represents the rate of change in the tree response as the effective wind load changes. Because of the strength of the relationship, we argue that the method described is an improvement for the analysis of storm damage in forests and to individual trees.

APA, Harvard, Vancouver, ISO, and other styles

22

Lin, Jenq-Jong, and Min-Jen Jou. "The Number of Maximal Independent Sets in Quasi-Tree Graphs and Quasi-Forest Graphs." Open Journal of Discrete Mathematics 07, no. 03 (2017): 134–47. http://dx.doi.org/10.4236/ojdm.2017.73013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Tukhtabaev. "TRANSLATION-INVARIANT P-ADIC QUASI GIBBS MEASURES FOR THE ISING MODEL ON THE CAYLEY TREE OF ORDER FOUR." UZBEK MATHEMATICAL JOURNAL 68, no. 1 (2024): 135–43. http://dx.doi.org/10.29229/uzmj.2024-1-17.

Full text

Abstract:

In this paper we consider a p-adic Ising model. We give the fully description the set of all translation-invariant p-adic quasi Gibbs measures (TIpQGMs) for this model on a Cayley tree order four. Moreover, we show the existence of a phase transition for p-adic Ising model on a Cayley tree when p ≡ 1(mod 8).

APA, Harvard, Vancouver, ISO, and other styles

24

Abdolghafourian, A., and Mohammad A. Iranmanesh. "On Harmonic Index and Diameter of Quasi-Tree Graphs." Journal of Mathematics 2021 (February 16, 2021): 1–9. http://dx.doi.org/10.1155/2021/6650407.

Full text

Abstract:

The harmonic index of a graph G ( H G ) is defined as the sum of the weights 2 / d u + d v for all edges u v of G , where d u is the degree of a vertex u in G . In this paper, we show that H G ≥ D G + 5 / 3 − n / 2 and H G ≥ 1 / 2 + 2 / 3 n − 2 D G , where G is a quasi-tree graph of order n and diameter D G . Indeed, we show that both lower bounds are tight and identify all quasi-tree graphs reaching these two lower bounds.

APA, Harvard, Vancouver, ISO, and other styles

25

Du, Jianwei, and Xiaoling Sun. "Quasi-Tree Graphs With Extremal General Multiplicative Zagreb Indices." IEEE Access 8 (2020): 194676–84. http://dx.doi.org/10.1109/access.2020.3033929.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Champanerkar, Abhijit, Ilya Kofman, and Neal Stoltzfus. "Quasi-tree expansion for the Bollobás-Riordan-Tutte polynomial." Bulletin of the London Mathematical Society 43, no. 5 (2011): 972–84. http://dx.doi.org/10.1112/blms/bdr034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Robertson, Neil, and Paul Seymour. "Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering." Journal of Combinatorial Theory, Series B 89, no. 1 (2003): 77–108. http://dx.doi.org/10.1016/s0095-8956(03)00067-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Wu, Tingzeng, and Huazhong Lü. "The Extremal Permanental Sum for a Quasi-Tree Graph." Complexity 2019 (May 20, 2019): 1–4. http://dx.doi.org/10.1155/2019/4387650.

Full text

Abstract:

Let G be a graph and A(G) the adjacency matrix of G. The permanent of matrix (xI-A(G)) is called the permanental polynomial of G. The permanental sum of G is the sum of the absolute values of the coefficients of permanental polynomial of G. Computing the permanental sum is #p-complete. In this note, we prove the maximum value and the minimum value of permanental sum of quasi-tree graphs. And the corresponding extremal graphs are also determined. Furthermore,we also determine the graphs with the minimum permanental sum among quasi-tree graphs of order n and size m, where n-1≤m≤2n-3.

APA, Harvard, Vancouver, ISO, and other styles

29

Brešar, Boštjan, Sandi Klavžar, and Riste Škrekovski. "Quasi-median graphs, their generalizations, and tree-like equalities." European Journal of Combinatorics 24, no. 5 (2003): 557–72. http://dx.doi.org/10.1016/s0195-6698(03)00045-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Robertson, Neil, and P. D. Seymour. "Graph minors. IV. Tree-width and well-quasi-ordering." Journal of Combinatorial Theory, Series B 48, no. 2 (1990): 227–54. http://dx.doi.org/10.1016/0095-8956(90)90120-o.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Fuqin, Zhan. "Further Results on the Augmented Zagreb Index." International Journal of Mathematics and Physical Sciences Research 12, no. 2 (2024): 18–24. https://doi.org/10.5281/zenodo.14053939.

Full text

Abstract:

<strong>Abstract:</strong> The augmented Zagreb index of a simple connected graph  is defined as , where  is the degree of vertex  in . A connected graph  is called a quasi-tree graph if there exists a vertex  such that  is a tree. A connected graph  is a cactus if any two of its cycles have at most one common vertex. In this paper, we determine the smallest and the second-smallest <em>AZI</em> indices of quasi-tree graphs and the minimal <em>AZI</em> index in the class of all cacti graphs with  vertices and  cycles. <strong>Keywords:</strong> Augmented Zagreb index, Quasi-tree, Cactus, Extremal graph. <strong>Title:</strong> Further Results on the Augmented Zagreb Index <strong>Author:</strong> Fuqin Zhan <strong>International Journal of Mathematics and Physical Sciences Research   </strong> <strong>ISSN 2348-5736 (Online)</strong> <strong>Vol. 12, Issue 2, October 2024 - March 2025</strong> <strong>Page No: 18-24</strong> <strong>Research Publish Journals</strong> <strong>Website: www.researchpublish.com</strong> <strong>Published Date: 08-November-2024</strong> <strong>DOI: https://doi.org/10.5281/zenodo.14053939</strong> <strong>Paper Download Link (Source)</strong> <strong>https://www.researchpublish.com/papers/further-results-on-the-augmented-zagreb-index</strong>

APA, Harvard, Vancouver, ISO, and other styles

32

ZENG, KEHAN, ZHEN TAN, and MINGCHUI DONG. "USING SHORT-TIME FOURIER TRANSFORM AND WAVELET PACKET TRANSFORM TO ATTENUATE NOISE FROM HEART SOUND SIGNAL FOR WEARABLE E-HEALTHCARE DEVICE." Journal of Mechanics in Medicine and Biology 15, no. 01 (2015): 1550009. http://dx.doi.org/10.1142/s0219519415500098.

Full text

Abstract:

A soft-computing method attenuating noise from heart sound (HS) signal for wearable e-healthcare device is proposed. The HS signal is decomposed by third-level wavelet packet transform (WPT). An automatic HS cycle detection algorithm is applied to find HS cycles in the (3, 0) leaf signal of WPT tree. Based on the quasi-cyclic feature of HS, short-time Fourier transform is implemented for cycles of each WPT tree leaf signal to decompose each cycle into time-frequency fragments which are called particles. Furthermore, the novel cuboid method is proposed to identify constituents of HS and noise from such generated particles. The particles representing HS are then retained and merged into noise-quasi-free WPT tree leaf signals. Eventually the inverse WPT (IWPT) is employed to build the noise-quasi-free HS signal. The method is assessed using mean square error (MSE) and compared with wavelet multi-threshold method (WMTM) and Tang's method. The experimental results show that the proposed method not only filters HS signal effectively but also well retains its pathological information.

APA, Harvard, Vancouver, ISO, and other styles

33

KURATA, Hisayasu. "Quasi-Symmetricity for the Nonlinear Green Function on a Tree." Interdisciplinary Information Sciences 14, no. 1 (2008): 103–16. http://dx.doi.org/10.4036/iis.2008.103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Lu, Peng-li, Xiao-dong Zhang, and Yuan-ping Zhang. "Determination of double quasi-star tree from its Laplacian spectrum." Journal of Shanghai University (English Edition) 14, no. 3 (2010): 163–66. http://dx.doi.org/10.1007/s11741-010-0622-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

ng Sun, Xiaol, Yu in Gao, and Jian ei Du. "The harmonic index of two-trees and quasi-tree graphs." Journal of Mathematical Inequalities, no. 2 (2019): 479–93. http://dx.doi.org/10.7153/jmi-2019-13-32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Xu, Kexiang, Jinlan Wang, and Hongshuang Liu. "The Harary index of ordinary and generalized quasi-tree graphs." Journal of Applied Mathematics and Computing 45, no. 1-2 (2013): 365–74. http://dx.doi.org/10.1007/s12190-013-0727-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Anuradha, T., T. Lakshmi Surekha, Praveena Nuthakki, Bullarao Domathoti, Ganesh Ghorai, and Faria Ahmed Shami. "Graph Theory Algorithms of Hamiltonian Cycle from Quasi-Spanning Tree and Domination Based on Vizing Conjecture." Journal of Mathematics 2022 (August 25, 2022): 1–7. http://dx.doi.org/10.1155/2022/1618498.

Full text

Abstract:

In this study, from a tree with a quasi-spanning face, the algorithm will route Hamiltonian cycles. Goodey pioneered the idea of holding facing 4 to 6 sides of a graph concurrently. Similarly, in the three connected cubic planar graphs with two-colored faces, the vertex is incident to one blue and two red faces. As a result, all red-colored faces must gain 4 to 6 sides, while all obscure-colored faces must consume 3 to 5 sides. The proposed routing approach reduces the constriction of all vertex colors and the suitable quasi-spanning tree of faces. The presented algorithm demonstrates that the spanning tree parity will determine the arbitrary face based on an even degree. As a result, when the Lemmas 1 and 2 theorems are compared, the greedy routing method of Hamiltonian cycle faces generates valuable output from a quasi-spanning tree. In graph idea, a dominating set for a graph S = V , E is a subset D of V . The range of vertices in the smallest dominating set for S is the domination number ( S ). Vizing’s conjecture from 1968 proves that the Cartesian fabricated from graphs domination variety is at least as big as their domination numbers production. Proceeding this work, the Vizing’s conjecture states that for each pair of graphs S , L .

APA, Harvard, Vancouver, ISO, and other styles

38

Novak, Thomas P. "Log-Linear Trees: Models of Market Structure in Brand Switching Data." Journal of Marketing Research 30, no. 3 (1993): 267–87. http://dx.doi.org/10.1177/002224379303000301.

Full text

Abstract:

Log-linear trees restrict the log-linear model of quasi-symmetry so that parameters are interpretable as arc lengths in an additive tree. The tree representation can be interpreted further in terms of consumer heterogeneity, affording a dual interpretation in terms of both market structure and opportunities for market segmentation.

APA, Harvard, Vancouver, ISO, and other styles

39

Souissi, Abdessatar. "A Class of Quantum Markov Fields on Tree-like Graphs: Ising-type Model on a Husimi Tree." Open Systems & Information Dynamics 28, no. 01 (2021): 2150004. http://dx.doi.org/10.1142/s1230161221500049.

Full text

Abstract:

A new class of forward quantum Markov fields (FQMFs) is introduced. The structure of these quantum Markov fields is investigated in the finer structure of a quasi-local algebra of observable over a tree-like graph. We provide an effective construction of a class of FQMCs. Moreover, we show the existence of three FMRFs associated with an Ising type model on a Husimi tree.

APA, Harvard, Vancouver, ISO, and other styles

40

Feistl, T., P. Bebi, M. Christen, S. Margreth, L. Diefenbach, and P. Bartelt. "Forest damage and snow avalanche flow regime." Natural Hazards and Earth System Sciences Discussions 3, no. 1 (2015): 535–74. http://dx.doi.org/10.5194/nhessd-3-535-2015.

Full text

Abstract:

Abstract. Snow avalanches break, uproot and overturn trees causing damage to forests. The extent of forest damage provides useful information on avalanche frequency and intensity. However, impact forces depend on avalanche flow regime. In this paper, we define avalanche loading cases representing four different avalanche flow regimes: powder, intermittent, dry and wet. In the powder regime, the blast of the cloud can produce large bending moments in the tree stem because of the impact area extending over the entire tree crown. We demonstrate that intermittent granular loadings are equivalent to low-density uniform dry snow loadings under the assumption of homogeneous particle distributions. In the wet snow case, avalanche pressure is calculated using a quasi-static model accounting for the motion of plug-like wet snow flows. Wet snow pressure depends both on avalanche volume and terrain features upstream of the tree. Using a numerical model that simulates both powder and wet snow avalanches, we study documented events with forest damage. We find (1) powder clouds with velocities over 20 m s−1 can break tree stems, (2) the intermittent regime seldom controls tree breakage and (3) quasi-static pressures of wet snow avalanches can be much higher than pressures calculated using dynamic pressure formulas.

APA, Harvard, Vancouver, ISO, and other styles

41

Nucinkis, Brita E. A., and Simon St. John-Green. "Quasi-automorphisms of the infinite rooted 2-edge-coloured binary tree." Groups, Geometry, and Dynamics 12, no. 2 (2018): 529–70. http://dx.doi.org/10.4171/ggd/448.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Yeung, Raymond W., and Attahiru Sule Alfa. "The quasi-birth-death type markov chain with a tree structure." Communications in Statistics. Stochastic Models 15, no. 4 (1999): 639–59. http://dx.doi.org/10.1080/15326349908807556.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

McMorris, F. R., and R. C. Powers. "Consensus functions on tree quasi-orders that satisfy an independence condition." Mathematical Social Sciences 48, no. 2 (2004): 183–92. http://dx.doi.org/10.1016/j.mathsocsci.2004.01.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Aouat, Saliha, and Slimane Larabi. "Object Retrieval Using the Quad-Tree Decomposition." Journal of Intelligent Systems 23, no. 1 (2014): 33–47. http://dx.doi.org/10.1515/jisys-2013-0014.

Full text

Abstract:

AbstractWe propose in this article an indexing and retrieval approach applied on outline shapes. Models of objects are stored in a database using the textual descriptors of their silhouettes. We extract from the textual description a set of efficient similarity measures to index the silhouettes. The extracted features are the geometric quasi-invariants that vary slightly with the small change in the viewpoint. We use a textual description and quasi-invariant features to minimize the storage space and to achieve an efficient indexing process. We also use the quad-tree structure to improve processing time during indexing. Using both geometric features and quad-tree decomposition facilitates recognition and retrieval processes. Our approach is applied on the outline shapes of three-dimensional objects. Experiments conducted on two well-known databases show the efficiency of our method in real-world applications, especially for image indexing and retrieval.

APA, Harvard, Vancouver, ISO, and other styles

45

Fujita, Takaaki. "Quasi-ultrafilters and Weak-ultrafilters: Their Properties and Maximality." Asian Research Journal of Mathematics 21, no. 3 (2025): 49–62. https://doi.org/10.9734/arjom/2025/v21i3899.

Full text

Abstract:

The concept of a Quasi-Ultrafilter provides an axiomatic analysis of incomplete social judgments. The weak filter (or weak ultrafilter) was introduced by K. Schlechta in the 1990s as a relaxed version of an ultrafilter. A pair (X, f) of a finite set X and a symmetric submodular function f is called a connectivity system. This concept is commonly used in discussions of graph width parameters, such as branch-width and tree-width, to analyze graph structures. In this paper, we discussed Quasi-Ultrafilter and Maximal Quasi-filter on Connectivity System.

APA, Harvard, Vancouver, ISO, and other styles

46

Kologani, Mona Aaly, Rajab Ali Borzooei, and Hee Sik Kim. "Graphs Based on Hoop Algebras." Mathematics 7, no. 4 (2019): 362. http://dx.doi.org/10.3390/math7040362.

Full text

Abstract:

In this paper, we investigate the graph structures on hoop algebras. First, by using the quasi-filters and r-prime (one-prime) filters, we construct an implicative graph and show that it is connected and under which conditions it is a star or tree. By using zero divisor elements, we construct a productive graph and prove that it is connected and both complete and a tree under some conditions.

APA, Harvard, Vancouver, ISO, and other styles

47

Krishna, Sujatha, and Udayarani Vinayaka Murthy. "Evolutionary tree-based quasi identifier and federated gradient privacy preservations over big healthcare data." International Journal of Electrical and Computer Engineering (IJECE) 12, no. 1 (2022): 903. http://dx.doi.org/10.11591/ijece.v12i1.pp903-913.

Full text

Abstract:

<span>Big data has remodeled the way organizations supervise, examine and leverage data in any industry. To safeguard sensitive data from public contraventions, several countries investigated this issue and carried out privacy protection mechanism. With the aid of quasi-identifiers privacy is not said to be preserved to a greater extent. This paper proposes a method called evolutionary tree-based quasi-identifier and federated gradient (ETQI-FD) for privacy preservations over big healthcare data. The first step involved in the ETQI-FD is learning quasi-identifiers. Learning quasi-identifiers by employing information loss function separately for categorical and numerical attributes accomplishes both the largest dissimilarities and partition without a comprehensive exploration between tuples of features or attributes. Next with the learnt quasi-identifiers, privacy preservation of data item is made by applying federated gradient arbitrary privacy preservation learning model. This model attains optimal balance between privacy and accuracy. In the federated gradient privacy preservation learning model, we evaluate the determinant of each attribute to the outputs. Then injecting Adaptive Lorentz noise to data attributes our ETQI-FD significantly minimizes the influence of noise on the final results and therefore contributing to privacy and accuracy. An experimental evaluation of ETQI-FD method achieves better accuracy and privacy than the existing methods.</span>

APA, Harvard, Vancouver, ISO, and other styles

48

Jacoby, Gordon, Rosanne D' Arrigo, Neil Pederson, Brendan Buckley, Chultamiin Dugarjav, and R. Mijiddorj. "Temperature and Precipitation in Mongolla Based on Dendroclimatic Investigations." IAWA Journal 20, no. 3 (1999): 339–54. http://dx.doi.org/10.1163/22941932-90000696.

Full text

Abstract:

Recent tree-ring studies in Mongolia provide evidence of unusual warming that is in agreement with large-scale reconstructed and recorded temperatures for the Northem Hemisphere and the Arctic. The Mongolian proxy record for temperature extends back over 450 years and is an important addition to the global tree-ring database. Precipitation reconstructions based on tree rings reflect recent increases but show that the increases are within the long-term range of variations. There is evidence for quasi-solar periodicity in long-term reconstructed precipitation variation, also shown by previous studies. Mongolia has excellent sampling resources for future studies.

APA, Harvard, Vancouver, ISO, and other styles

49

Woo, Hyeyoung, Bianca N. I. Eskelson, and Vicente J. Monleon. "Tree Height Increment Models for National Forest Inventory Data in the Pacific Northwest, USA." Forests 11, no. 1 (2019): 2. http://dx.doi.org/10.3390/f11010002.

Full text

Abstract:

The United States national inventory program measures a subset of tree heights in each plot in the Pacific Northwest. Unmeasured tree heights are predicted by adding the difference between modeled tree heights at two measurements to the height observed at the first measurement. This study compared different approaches for directly modeling 10-year height increment of red alder (RA) and ponderosa pine (PP) in Washington and Oregon using national inventory data from 2001–2015. In addition to the current approach, five models were implemented: nonlinear exponential, log-transformed linear, gamma, quasi-Poisson, and zero-inflated Poisson models using both tree-level (e.g., height, diameter at breast height, and compacted crown ratio) and plot-level (e.g., basal area, elevation, and slope) measurements as predictor variables. To account for negative height increment observations in the modeling process, a constant was added to shift all response values to greater than zero (log-transformed linear and gamma models), the negative increment was set to zero (quasi-Poisson and zero-inflated Poisson models), or a nonlinear model, which allows negative observations, was used. Random plot effects were included to account for the hierarchical data structure of the inventory data. Predictive model performance was examined through cross-validation. Among the implemented models, the gamma model performed best for both species, showing the smallest root mean square error (RSME) of 2.61 and 1.33 m for RA and PP, respectively (current method: RA—3.33 m, PP—1.40 m). Among the models that did not add the constant to the response, the quasi-Poisson model exhibited the smallest RMSE of 2.74 and 1.38 m for RA and PP, respectively. Our study showed that the prediction of tree height increment in Oregon and Washington can be improved by accounting for the negative and zero height increment values that are present in inventory data, and by including random plot effects in the models.

APA, Harvard, Vancouver, ISO, and other styles

50

IRANMANESH, MOHAMMAD A., and RAZIYEH NEJATI. "On the Estrada Index of Point Attaching Strict k-Quasi Tree Graphs." Kragujevac Journal of Mathematics 44, no. 2 (2020): 165–79. http://dx.doi.org/10.46793/kgjmat2002.165i.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!