Search
Search results for: K-TREE
-
On extremal sizes of locally k-tree graphs
PublicationA 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...
-
Lower bound on the distance k-domination number of a tree
PublicationW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Empirical analysis of tree-based classification models for customer churn prediction
PublicationCustomer churn is a vital and reoccurring problem facing most business industries, particularly the telecommunications industry. Considering the fierce competition among telecommunications firms and the high expenses of attracting and gaining new subscribers, keeping existing loyal subscribers becomes crucial. Early prediction of disgruntled subscribers can assist telecommunications firms in identifying the reasons for churn and...
-
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublicationW pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
The Snow Team Problem
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
The complexity of zero-visibility cops and robber
PublicationWe 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...
-
Clearing directed subgraphs by mobile agents
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
Komputerowo wspomagana klasyfikacja wybranych sygnałów elektromiografii powierzchniowej
PublicationWykorzystywanie sygnałów elektromiografii powierzchniowej (ang. Surface Electromyography, SEMG) w procesach sterowania systemami rehabilitacyjnymi stanowi obecnie standardową procedurę. Popularność SEMG wynika z nieinwazyjności metody oraz możliwości szybkiej i precyzyjnej identyfikacji funkcji mięśniowej. W przypadku osób małoletnich proces klasyfikacji sygnałów jest utrudniony ze względu na mniejsze rozmiary i wyższą dynamikę...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Vehicle classification based on soft computing algorithms
PublicationExperiments and results regarding vehicle type classification are presented. Three classes of vehicles are recognized: sedans, vans and trucks. The system uses a non-calibrated traffic camera, therefore no direct vehicle dimensions are used. Various vehicle descriptors are tested, including those based on vehicle mask only and those based on vehicle images. The latter ones employ Speeded Up Robust Features (SURF) and gradient images...
-
Estimation of the Ultimate Strength of FRP Strips-to-Masonry Substrates Bond
PublicationFiber-Reinforced Polymers (FRP) were developed as a new method over the past decades due to their many beneficial mechanical properties, and they are commonly applied to strengthen masonry structures. In this paper, the Artificial Neural Network (ANN), K-fold Cross-Validation (KFCV) technique, Multivariate Adaptive Regression Spline (MARS) method, and M5 Model Tree (M5MT) method were utilized to predict the ultimate strength of...
-
The impact of training and neurotrophins on functional recovery after spinal cord transection: cellular and molecular mechanisms contributing to motor improvement
PublicationBeneficial effects of locomotor training on the functional recovery after complete transection of the spinal cord indicate that in chronic spinal animals spontaneous recovery processes are enhanced and shaped by the training. The mechanisms of that use-dependent improvement are still not fully understood. This review tackles three aspects of this issue: (1) neurochemical attributes of functional improvement...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
The partial-order tree: a new structure for indexing on complex attributes in object-oriented databases
Publication -
Spatial variability of throughfall in a stand of Scots pine (Pinus sylvestris L.) with deciduous admixture as influenced by canopy cover and stem distance
PublicationVegetation cover affects the amount of precipitation, its chemical composition and its spatial distribution, and this may have implications for the distribution of water, nutrients and contaminants in the subsurface soil layer. The aim of this study was a detailed diagnosis of the spatio-temporal variability in the amount of throughfall (TF) and its chemical components in a 72-year-old pine stand with an admixture of oak and birch....
-
Machine learning-based seismic fragility and seismic vulnerability assessment of reinforced concrete structures
PublicationMany studies have been performed to put quantifying uncertainties into the seismic risk assessment of reinforced concrete (RC) buildings. This paper provides a risk-assessment support tool for purpose of retrofitting and potential design strategies of RC buildings. Machine Learning (ML) algorithms were developed in Python software by innovative methods of hyperparameter optimization, such as halving search, grid search, random...
-
News that Moves the Market: DSEX-News Dataset for Forecasting DSE Using BERT
PublicationStock market is a complex and dynamic industry that has always presented challenges for stakeholders and investors due to its unpredictable nature. This unpredictability motivates the need for more accurate prediction models. Traditional prediction models have limitations in handling the dynamic nature of the stock market. Additionally, previous methods have used less relevant data, leading to suboptimal performance. This study...
-
Area covered by dominant tree species in the State Forests divided into stand age classes over the years 2014-2018
Open Research DataThe dataset contains data illustrating changes in distribution of dominant tree species in the State Forests divided into stand age classes over the years 2014-2018. Information about covered area is provided in ha and percentage of whole analyzed area. Dominant speciescan be defined as the species in the stand with the largest share in terms of area,...
-
Area covered by dominant tree species in the State Forests divided into stand age classes over the years 2019-2023
Open Research DataThe dataset contains data illustrating changes in distribution of dominant tree species in the State Forests divided into stand age classes over the years 2019-2023. Information about covered area is provided in ha and percentage of whole analyzed area. Dominant speciescan be defined as the species in the stand with the largest share in terms of area,...
-
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
PublicationWe study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...
-
Evaluation of the content of inorganic anions in tree saps
PublicationTree saps were once commonly used in the countries of Northern, Central and Eastern Europe. Although once almost forgotten, their popularity has been growing recently as part of an interest in organic food and traditional medicine. Tree saps, tapped mainly from birch and maple trees, are drunk both fresh and fermented or are used as raw material for the production of food products, e.g. syrups. The aim of this study was to determine...
-
Stand thickness of dominant tree species in the State Forests divided into stand age classes over the years 2009-2013
Open Research DataThe dataset contains data illustrating changes in the distribution of dominant tree species in the State Forests divided into stand age classes over the years 2009-2013. Dominant species can be defined as the species in the stand with the largest share in terms of area, thickness or number. Stand thickness means the gross thickness of the timber, i.e....
-
Stand thickness of dominant tree species in the State Forests divided into stand age classes over the years 2014-2018
Open Research DataThe dataset contains data illustrating changes in the distribution of dominant tree species in the State Forests divided into stand age classes over the years 2014-2018. Dominant species can be defined as the species in the stand with the largest share in terms of area, thickness or number. Stand thickness means the gross thickness of the timber, i.e....
-
Stand thickness of dominant tree species in the State Forests divided into stand age classes over the years 2019-2023
Open Research DataThe dataset contains data illustrating changes in the distribution of dominant tree species in the State Forests divided into stand age classes over the years 2019-2023. Dominant species can be defined as the species in the stand with the largest share in terms of area, thickness or number. Stand thickness means the gross thickness of the timber, i.e....
-
Improving methods to calculate the loss of ecosystem services provided by urban trees using LiDAR and aerial orthophotos
PublicationIn 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,...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Attitudes to tree removal on private properties in two Polish cities.
Open Research DataLarge cities are increasingly faced with declining urban tree cover and related problems, such as increased urban heat islands and flash floods. Reducing these phenomena increasingly has to rely on trees located on private property. However, to effectively engage private landowners on these issues, more attention must be paid to understanding their...
-
Use of Bi-Temporal ALS Point Clouds for Tree Removal Detection on Private Property in Racibórz, Poland
PublicationTrees 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,...
-
Trees having many minimal dominating sets
PublicationWe provide an algorithm for listing all minimal dominating sets of a tree of order n in time O(1.4656^n). This leads to that every tree has at most 1.4656^n minimal dominating sets. We also give an infinite family of trees of odd and even order for which the number of minimal dominating sets exceeds 1.4167^n, thus exceeding 2^{n/2}. This establishes a lower bound on the running time of an algorithm for listing all minimal dominating...
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.
-
Psychological and physical components in forming preferences on urban greenery management – The case of trees
PublicationPublic 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...
-
Minimal 2-dominating sets in Trees
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.
-
Minimal double dominating sets in trees
PublicationWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
An algorithm for listing all minimal double dominating sets of a tree
PublicationWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
Incremental construction of Minimal Tree Automata [online]
PublicationWe 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...
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublicationIn 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...
-
The energy consumption during the birch tree sap concentration process using the reverse osmosis system
PublicationBirch tree sap was concentrated by mens of the reversed osmosis technique. The energy consumption in a small-scale pilot apparatus was estimated. The threshold value for the water removal above which the specific energy consumption significantly increased was identified. Below the threshold value the reversed osmosis had low energy demand and could be an attractive method for the production of birch tree sap-based beverages.
-
The usefulness of birch saps from the area of Podkarpacie to produce birch syrup
PublicationIn northern European countries, as well as in North America tree saps of maples and birches are used for the production of syrups. Birch syrups are characterized by a specific aromatic taste and can be used as an addition to sweets, desserts, salads and meats. Attention is paid to the health benefits of birch syrups, mainly for high mineral content. The aim of this study was to evaluate the usefulness of birch saps obtained from...
-
Metabolic activity of tree saps of different origin towards cultured human cells in the light of grade correspondence analysis and multiple regression modeling
PublicationTree saps are nourishing biological media commonly used for beverage and syrup production. Although the nutritional aspect of tree saps is widely acknowledged, the exact relationship between the sap composition, origin, and effect on the metabolic rate of human cells is still elusive. Thus, we collected saps from seven different tree species and conducted composition-activity analysis. Saps from trees of Betulaceae, but not from...
-
Modeling and Evaluation of Electric Treeing Phenomena in Polymeric Cable Insulation
PublicationThis paper investigates the treeing phenomenon in polymeric materials such as crosslinked polyethylene (XLPE) that is widely used in medium and high voltage power cables as primary insulation. The modeling of electrical tree growth in the insulation from its initiation to breakdown is significant research work that illustrates the discharge dynamics and its impact on aging process in polymeric insulation. This study utilizes pulse...
-
Monitoring Trends of Land Use and Land Cover Changes in Rajang River Basin
PublicationIn this study, the spatiotemporal changes in land use and land cover (LULC) were evaluated from 1992 to 2015 for the Rajang River Basin (RRB) located in the Sarawak State of Malaysia. The changes in water bodies cropped lands, and forests were assessed based on the available remotely sensed satellite data. Supervised classification with the Maximum-Likelihood-Algorithm technique was adopted for monitoring the LULC changes using...
-
Narratives on cutting down trees on private land. A comparison of urban and rural municipalities in Poland using the Q-deliberation method
PublicationIncreased 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...
-
Attitudes to tree removal on private property in rural and urban Polish municipalities.
Open Research DataThe urban-rural divide is an important factor known to affect public opinion on issues related to environmental protection and management. The present data set allows for a deeper understanding of this issue with respect to policies dealing with tree removal on private property in two municipalities located in southern Poland: Racibórz (an urban municipality)...
-
Brief Announcement: Energy Constrained Depth First Search
PublicationDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...
-
Analyzing sets of phylogenetic trees obtained from bayesian MCMC process using topology metrics
PublicationThe 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....
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublicationWe consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...
-
Verification of a Novel Method of Detecting Faults in Medium-Voltage Systems with Covered Conductors
PublicationThis paper describes the use of new methods of detecting faults in medium-voltage overhead lines built of covered conductors. The methods mainly address such faults as falling of a conductor, contacting a conductor with a tree branch, or falling a tree branch across three phases of a medium-voltage conductor. These faults cannot be detected by current digital relay protection systems. Therefore, a new system that can detect the...