Filtry
wszystkich: 273
-
Katalog
Wyniki wyszukiwania dla: TREE
-
Why are trees still such a major hazard to drivers in Poland?
PublikacjaRoadside trees are one of Poland's most serious road safety issues. Since 2009 more than 2800 people have been killed as a result of tree collisions; this represents about 15% of all of Poland's accident fatalities between 2009 and 2013. In some of the country's regions striking a tree caused more than 30% of all road accident fatalities. With no proper regulations, guidelines or examples of good practice, roadside environments...
-
Time versus space trade-offs for randezvous in trees
PublikacjaTwo identical (anonymous) mobile agents start from arbitrary nodes of an unknown tree and have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. We consider deterministic algorithms for this rendezvous task. The main result of this paper is a tight trade-off between the optimal time of completing rendezvous and the size of memory...
-
Ranking ecosystem services delivered by trees in urban and rural areas
PublikacjaPolicies and strategies for tree management and protection on a national, regional, and local level have not sufficiently considered differences between rural and urban areas. We used expert knowledge to compare rural and urban areas in a case study evaluating the relative importance of ecosystem services (ES) in policy development. The Analytic Hierarchy Process (AHP) and focus group discussions were used to rank 17 ES, representing...
-
Edge-chromatic sum of trees and bounded cyclicity graphs
Publikacja -
Matching Split Distance for Unrooted Binary Phylogenetic Trees
Publikacja -
A linear time algorithm for edge coloring of binomial trees
Publikacja -
Matching Split Distance for Unrooted Binary Phylogenetic Trees
PublikacjaRekonstrukcja drzew ewolucji jest jednym z głównych celów w bioinformatyce. Drzewa filogenetyczne reprezentuje historię ewolucji i związki pokrewieństwa między różnymi gatunkami. W pracy proponujemy nową ogólną metodę określania odległości między nieukorzenionymi drzewami filogenetycznymi, szczególnie użyteczną dla dużych zbiorów gatunków. Następnie podajemy szczegółowe własności jednej metryki określonej przy użyciu tej metody...
-
Lossless Compression of Binary Trees with Correlated Vertex Names
PublikacjaCompression schemes for advanced data structures have become the challenge of today. Information theory has traditionally dealt with conventional data such as text, image, or video. In contrast, most data available today is multitype and context-dependent. To meet this challenge, we have recently initiated a systematic study of advanced data structures such as unlabeled graphs [1]. In this paper, we continue this program by considering...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Comparing phylogenetic trees using a minimum weight perfect matching
PublikacjaA phylogenetic tree represents historical evolutionary relationshipbetween different species or organisms. There are various methods for reconstructing phylogenetic trees.Applying those techniques usually results in different treesfor the same input data. An important problem is to determinehow distant two trees reconstructed in such a wayare from each other. Comparing phylogenetic trees is alsouseful in mining phylogenetic information...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
A proposition for integrating elements of game universe by means of behavioral trees
PublikacjaModern computer games often involve autonomous beings collaborating and competing with each other to reach their objectives in the game universe. It seems only natural to use agent-oriented approach in such cases. This article identifies the rules of building a game universe as an environment for executing agents. The paper also covers a method for decomposing compound behaviors into behavioral trees. Dividing complex behaviors...
-
Trees with equal restrained domination and total restrained domination numbers
PublikacjaW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
-
Ensemble-Based Logistic Model Trees for Website Phishing Detection
Publikacja -
Ranking ecosystem services delivered by trees in urban and rural areas
Publikacja -
Enumerations of Plane Trees with Multiple Edges and Raney Lattice Paths
Publikacja -
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...
-
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...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor 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 in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
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...
-
MLPG Method using kd-trees and its application to Flamant Problem
PublikacjaW pracy przedstawiono rozwiązanie problemu Flamanta z zastosowaniem metody bezsiatkowej MLPG. Oryginalnym pomysłem była aplikacja algorytmu kd-drzew do poszukiwania najbliższych punktów interpolacji dla funkcji radialnych.
-
Adjusting Game Difficulty by Recreating Behavioral Trees of Human Player Actions
PublikacjaThis paper presents a proposition of a method for adjusting game difficulty to the current level of player's skills in one-on-one games. The method is based on recognition of human player's actions and recording of those actions in the form of behavioral trees. Such trees are later used to drive behaviors of computer-controlled opponents so that human player has beat hit own strategy and improve on it, to win subsequent games....
-
Influence of an Interview Location on Opinions about the Ecosystem Services Provided by Trees
PublikacjaCollecting opinions regarding environmental management is essential, particularly in urban areas where space is limited, and interests often collide. However, the impact of the conditions in which the research is conducted on opinions and preferences elicited via surveys and interviews about the environment is usually taken for granted. The recent development of computer-aided survey methods allows a simulation of an environment,...
-
Capturing semantics of semi-structured data using partial-order trees
PublikacjaW artykule zaprezentowano nowe podejście do problemu klasyfikacji danych semistrukturalnych. Kryteria klasyfikacji bazują na strukturze danych (zwanej typem danych) oraz na ich usytuowaniu w grafir danych (zwanym rolą danych). Zastosowano model OEM (Object Exchange Model) do reprezentacji nazy danych semistrukturalnych. Bazując na tej reprezentacji, definiuje się typy i role obiektów semistrukturalnych i organizuje się je w struktury...
-
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...
-
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...
-
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 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...
-
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,...
-
EIGHT OLD CULTIVARS OF APPLE TREES – AN EVALUATION OF THEIR POTENTIAL FOR USE BY THE PROCESSING INDUSTRY
Publikacja -
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...
-
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...
-
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,...
-
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 -
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 -
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...
-
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...
-
Assessing the damage importance rank in acoustic diagnostics of technical conditions of the internal combustion engine with multi-valued logical decision trees
Publikacja -
Phylogenetic trees of genus Oncidium Sw. based on analysis of DNA sequences
Dane BadawczeGenus Oncidium Sw. is widely regarded as a polyphiletic, and the taxonomic boundaries between him and such genera as Odontoglossum Kunth. or Miltonia Lindley remain blurred. The goal of the study was to determine the phylogenetic relationships within the genus Oncidium s.lato based on the DNA sequences analysis. The correlation between molecular data...
-
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 effect of interview location on the perception of Ecosystem Services provided by trees. A Polish case study.
Dane BadawczeSeveral survey research methods are available to study attitudes towards the environment, including: CAWI (computer-assisted Internet interview), CATI (computer-assisted telephone interview), CAPI (computer-assisted personal interview), and PAPI (paper-pencil interview). An increasingly popular CAWI approach is the geo-questionnaire – an internet survey...
-
Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities
Konferencje -
Hanna Obracht-Prondzyńska dr inż. arch.
OsobyDr inż. arch. Hanna Obracht-Prondzyńska Adiunktka na Uniwersytecie Gdańskim w Zakładzie Gospodarki Przestrzennej, nauczycielka akademicka ucząca projektowania urbanistycznego i analizy danych. Architektka i urbanistka zajmującą się projektowaniem w oparciu o dane. Tytuł doktora nauk inżynieryjno-technicznych w dyscyplinie architektura i urbanistyka obroniła z wyróżnieniem w 2020 r. na Wydziale Architektury Politechniki Gdańskiej,...
-
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.