Wyszukiwarka
Filtry
wszystkich: 204
wybranych: 189
Wyniki wyszukiwania dla: TREES.
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublikacjaIn the paper, we describe a method for comparing arbitrary, not necessary fully resolved, unrooted phylogenetic trees. Proposed method is based on finding a minimum weight matching in bipartite graphs and can be regarded as a generalization of well-known Robinson-Foulds distance. We present some properties and advantages of the new distance. We also investigate some properties of presented distance in a common biological problem...
-
Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions
PublikacjaAbility to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in...
-
Inception and Propagation of Electrical Trees in the Presence of Space Charge in HVAC Extruded Cables
PublikacjaThis paper presents the space charge impact on the inception and propagation of electrical trees in cross-linked polyethylene (XLPE) insulation via simulations and experimentation. A 3D finite element analysis (FEA)-based modeling is proposed to simulate electrical trees via a needle embedded on the XLPE insulation. The proposed FEA model demonstrates the influence of the space charge magnitude and polarity on the initiation of...
-
Geo-Questionnaire for Environmental Planning: The Case of Ecosystem Services Delivered by Trees in Poland
PublikacjaStudies on society and the environment interface are often based on simple questionnaires that do not allow for an in-depth analysis. Research conducted with geo-questionnaires is an increasingly common method. However, even if data collected via a geo-questionnaire are available, the shared databases provide limited information due to personal data protection. In the article, we present open databases that overcome those limitations....
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Psychological and physical components in forming preferences on urban greenery management – The case of trees
PublikacjaPublic opinion is increasingly important in managing urban greenery. In this regard, this study demonstrates the importance of sociological (environmental worldviews), psychological (place attachment, perceived benefits of trees), and physical factors (type of building people live in, and urban greenery) in forming residents’ opinions on whether the municipality or landowners should decide about tree removal on private land. Logistic...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
On trees with double domination number equal to total domination number plus one
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
PublikacjaWe describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A pseudo-minimal automaton may be larger than the minimal one accepting the same language but, in turn, it contains proper elements (states or transitions that are unique) for every input...
-
EIGHT OLD CULTIVARS OF APPLE TREES – AN EVALUATION OF THEIR POTENTIAL FOR USE BY THE PROCESSING INDUSTRY
Publikacja -
Analyzing sets of phylogenetic trees obtained from bayesian MCMC process using topology metrics
PublikacjaThe reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationship between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations amongorganisms and geographical areas.In the paper, we describe a general method for comparing hylogenetic trees....
-
Comparison of Absorbed and Intercepted Fractions of PAR for Individual Trees Based on Radiative Transfer Model Simulations
PublikacjaThe fraction of absorbed photosynthetically active radiation (fAPAR) is a key parameter for estimating the gross primary production (GPP) of trees. For continuous, dense forest canopies, fAPAR, is often equated with the intercepted fraction, fIPAR. This assumption is not valid for individual trees in urban environments or parkland settings where the canopy is sparse and there are well-defined tree crown boundaries. Here, the distinction...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Analysis of loading history influence on fatigue and fracture surface parameters using the method of induction trees
Publikacja -
Water Needs of Sweet Cherry Trees in the Light of Predicted Climate Warming in the Bydgoszcz Region, Poland
Publikacja -
The Risk Indicators of Construction Projects’ Cost Overruns Assessed with PCA, Decision Trees, and Pearson’s Correlations
Publikacja -
Improving methods to calculate the loss of ecosystem services provided by urban trees using LiDAR and aerial orthophotos
PublikacjaIn this paper we propose a methodology for combining remotely sensed data with field measurements to assess selected tree parameters (diameter at breast height (DBH) and tree species) required by the i-Tree Eco model to estimate ecosystem services (ES) provided by urban trees. We determined values of ES provided by trees in 2017 in Racibórz (a city in South Poland) and estimated the loss of ES from January 1, 2017 to March 5, 2017,...
-
Trees as a solar control measure for southern-oriented street frontages. Analysis of a selected street model for a humid continental climate
PublikacjaThe present study is aimed at the analysis of possibilities for shading southern frontage of street oriented along the E-W axis by the single row of trees, parallel to the southern elevations. The effectiveness of solar control shading was tested depending on the geometric relationships between trees and buildings. Numerical simulation analyses were conducted in Rhinoceros® program for the street located in humid continental climate...
-
Narratives on cutting down trees on private land. A comparison of urban and rural municipalities in Poland using the Q-deliberation method
PublikacjaIncreased development in rural and urban areas leads to a decrease in tree cover and reduces the ecosystem services that trees provide. Municipal authorities must consider managing trees on private land to ensure that residents have access to trees and green spaces. In doing so, they must frequently confront conflicting stakeholder views, which are driven by diverse public and private interests and impacted by the type of landscape...
-
Assessment of damage to trees in the Herby Forestry District caused by glazed frosts and snow during severe weather in January 2010
Publikacja -
Assessing the damage importance rank in acoustic diagnostics of technical conditions of the internal combustion engine with multi-valued logical decision trees
Publikacja -
Trees as a Shading System for Streets on the East–West Axis: Computer Simulations for the Selected Geometrical Proportions of Building Developments in Humid Continental Climate
PublikacjaThe study is aimed at investigating the possibilities for solar protection provided to the street canyon located on the E–W axis and with the following profiles: shallow (height/width (H/W) = 0.2, 0.6, and 1) and deep (H/W = 2) by two rows of trees located at a distance of 3 m away from southern and northern façades. The research was based on numerical simulation analyses conducted in the Rhinoceros® program, with the application...
-
The Use of Artificial Neural Networks and Decision Trees to Predict the Degree of Odor Nuisance of Post-Digestion Sludge in the Sewage Treatment Plant Process
PublikacjaThis paper presents the application of artificial neural networks and decision trees for the prediction of odor properties of post-fermentation sludge from a biological-mechanical wastewater treatment plant. The input parameters were concentrations of popular compounds present in the sludge, such as toluene, p-xylene, and p-cresol, and process parameters including the concentration of volatile fatty acids, pH, and alkalinity in...
-
Accessibility to urban green spaces: A critical review of WHO recommendations in the light of tree-covered areas assessment
PublikacjaEasy accessibility of Urban Green Spaces (UGSs) is essential to the quality of life in urban areas. The World Health Organization (WHO) recommendations focus on spatial access to UGSs, define as accessible those larger than 0.5 ha situated up to 300 m of residential areas, and disregard the social significance of smaller green spaces. This paper assesses the extent to which the WHO recommendations permit the identification of locations...
-
On domination multisubdivision number of unicyclic graphs
PublikacjaThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
On extremal sizes of locally k-tree graphs
PublikacjaA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
Progress on Roman and Weakly Connected Roman Graphs
PublikacjaA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
The complexity of zero-visibility cops and robber
PublikacjaWe consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...
-
angielski
PublikacjaA subset D of V (G) is a dominating set of a graph G if every vertex of V (G) − D has at least one neighbour in D; let the domination number γ(G) be the minimum cardinality among all dominating sets in G. We say that a graph G is γ-q-critical if subdividing any q edges results in a graph with domination number greater than γ(G) and there exists a set of q − 1 edges such that subdividing these edges results in a graph with domination...
-
Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages
PublikacjaThe ability to quantify a dissimilarity of different phylogenetic trees is required in various types of phylogenetic studies, for example, such metrics are used to assess the quality of phylogeny construction methods and to define optimization criteria in supertree building algorithms. In this article, starting from the already described concept of matching metrics, we define three new metrics for rooted phylogenetic trees. One...
-
Effect of the Road Environment on Road Safety in Poland
PublikacjaRun-off-road accidents tend to be very severe because when a vehicle leaves the road, it will often crash into a solid obstacle (tree, pole, supports, front wall of a culvert, barrier). A statistical analysis of the data shows that Poland's main roadside hazard is trees and the severity of vehicles striking a tree in a run-off-road crash. The risks are particularly high in north-west Poland with many of the roads lined up with...
-
Critical Case Stochastic Phylogenetic Tree Model via the Laplace Transform
PublikacjaBirth–and–death models are now a common mathematical tool to describe branching patterns observed in real–world phylogenetic trees. Liggett and Schinazi (2009) is one such example. The authors propose a simple birth–and–death model that is compatible with phylogenetic trees of both influenza and HIV, depending on the birth rate parameter. An interesting special case of this model is the critical case where the birth rate equals the...
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublikacjaThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
Global edge alliances in graphs
PublikacjaIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
NLP Questions Answering Using DBpedia and YAGO
PublikacjaIn this paper, we present results of employing DBpedia and YAGO as lexical databases for answering questions formulated in the natural language. The proposed solution has been evaluated for answering class 1 and class 2 questions (out of 5 classes defined by Moldovan for TREC conference). Our method uses dependency trees generated from the user query. The trees are browsed for paths leading from the root of the tree to the question...
-
Perfect hashing tree automata
PublikacjaWe present an algorithm that computes a function that assigns consecutive integers to trees recognized by a deterministic, acyclic, finite-state, bottom-up tree automaton. Such function is called minimal perfect hashing. It can be used to identify trees recognized by the automaton. Its value may be seen as an index in some other data structures. We also present an algorithm for inverted hashing.Przedstawiamy algorytm, który oblicza...
-
Searching by heterogeneous agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
Coronas and Domination Subdivision Number of a Graph
PublikacjaIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
Współczesny obraz żuławskiego podcienia
PublikacjaThe Contemporary Image of Żuławy Arcades. The cultural landscape of the Vistula River Delta is created by man in large part. Almost all of its components- buildings, roads, embankments and as natural as trees, water and earth are anthropogenic origin. Arcaded houses are part of this multi-dimensional mosaic for more than four centuries.
-
Interpolation properties of domination parameters of a graph
PublikacjaAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Incremental construction of Minimal Tree Automata [online]
PublikacjaWe describe an algorithm that allows the incremental addition or removal of unranked ordered trees to minimal frontier-to-root deterministic tree automaton (DTA). The algorithm takes a tree t and a minimal DTA A as input; it outputs a minimal DTA A' which accepts the language L(A) accepted by A incremented (or decremented) with the tree t. The algorithm can be used to efficiently maintain dictionaries which store large collections...
-
Searching by Heterogeneous Agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
Use of Bi-Temporal ALS Point Clouds for Tree Removal Detection on Private Property in Racibórz, Poland
PublikacjaTrees growing on private property have become an essential part of urban green policies. In many places, restrictions are imposed on tree removal on private property. However, monitoring compliance of these regulations appears difficult due to a lack of reference data and public administration capacity. We assessed the impact of the temporary suspension of mandatory permits on tree removal, which was in force in 2017 in Poland,...
-
Interval incidence coloring of bipartite graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
The Impact of Thermal Stresses on Volume Resistivity: Performance Comparison between TR-XLPE and XLPE Cables
PublikacjaMost failures in electric power cables are attributed to the development of water trees inside the insulating materials. Thus, the development and utilization of Tree Retardant Cross-Linked Polyethylene (TR-XLPE) based cables have recently been given great attention to overcome the treeing issues. TR-XLPE cables use low-density polyethylene compounds suppressing the formation of water trees while retaining excellent electrical,...
-
Kinematyczne pomiary GNSS na linii kolei wąskotorowej w Koszalinie
PublikacjaW artykule opisano metodę kinematycznych pomiarów geodezyjnych GNSS zastosowaną dla inwentaryzacji trasy kolejowej w terenie silnie zalesionym. W badaniach wskazano możliwości wykorzystania tej metody dla inwentaryzacji układu geometrycznego trasy kolei wąskotorowej w Koszalinie. Opisano najważniejsze różnice pomiędzy koleją o rozstawie szyn 1000 mm a 1435 mm oraz przyszłościowe zagadnienie planowanej rewitalizacji tego odcinka....
-
Influence of accelerometer signal pre-processing and classification method on human activity recognition
PublikacjaA study of data pre-processing influence on accelerometer-based human activity recognition algorithms is presented. The frequency band used to filter-out the accelerometer signals and the number of accelerometers involved were considered in terms of their influence on the recognition accuracy. In the test four methods of classification were used: support vector machine, decision trees, neural network, k-nearest neighbor.