Search results for: TREE REMOVAL PERMITS - Bridge of Knowledge

Search

Search results for: TREE REMOVAL PERMITS

Search results for: TREE REMOVAL PERMITS

  • Attitudes to tree removal on private properties in two Polish cities.

    Open Research Data
    version 1.1 open access
    • A. Inglot
    • P. Przewoźna
    • M. Mielewczyk
    • K. Mączka
    • P. Matczak
    - series: Public Participation GIS study on Ecosystem Services provided by trees in Polish case studies.

    Large 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

    Publication

    - Remote Sensing - Year 2021

    Trees 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,...

    Full text available to download

  • Attitudes to tree removal on private property in rural and urban Polish municipalities.

    Open Research Data
    version 1.1 open access
    • A. Inglot
    • P. Przewoźna
    • M. Mielewczyk
    • K. Mączka
    • P. Matczak
    • P. Wężyk
    - series: Public Participation GIS study on Ecosystem Services provided by trees in Polish case studies.

    The 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)...

  • The energy consumption during the birch tree sap concentration process using the reverse osmosis system

    Birch 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.

    Full text to download in external service

  • Incremental construction of Minimal Tree Automata [online]

    Publication

    - ALGORITHMICA - Year 2009

    We 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...

    Full text to download in external service

  • Psychological and physical components in forming preferences on urban greenery management – The case of trees

    Publication

    - ENVIRONMENTAL SCIENCE & POLICY - Year 2023

    Public 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...

    Full text to download in external service

  • Comparative Evaluation of Selected Biological Methods for the Removal of Hydrophilic and Hydrophobic Odorous VOCs from Air

    Due to increasingly stringent legal regulations as well as increasing social awareness, the removal of odorous volatile organic compounds (VOCs) from air is gaining importance. This paper presents the strategy to compare selected biological methods intended for the removal of different air pollutants, especially of odorous character. Biofiltration, biotrickling filtration and bioscrubbing technologies are evaluated in terms of...

    Full text available to download

  • Improving methods to calculate the loss of ecosystem services provided by urban trees using LiDAR and aerial orthophotos

    Publication

    - URBAN FORESTRY & URBAN GREENING - Year 2021

    In 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,...

    Full text to download in external service

  • Adsorptive Removal of Aqueous Phase Crystal Violet Dye by Low-Cost Activated Carbon Obtained from Date Palm (L.) Dead Leaflets

    Publication

    Up to now, water pollution is still one of the important issues and challenges worldwide, due to its environmental, economic and human life impacts. It is also remains a challenge to environment scientists and technologists. Nowadays, the textile dyeing industry is considered one of the largest water consuming industries and produces large volumes of colored wastewater in its dyeing and finishing process. In this study, date palm...

    Full text available to download

  • Geo-Questionnaire for Environmental Planning: The Case of Ecosystem Services Delivered by Trees in Poland

    Publication

    - Data - Year 2021

    Studies 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....

    Full text available to download

  • SORPTION OF SELECTED CHLORINATED SOLVENTS ON PLANT DEBRIS COLLECTED IN A CITY PARK

    Debris from deciduous trees in the form of park green waste was investigated as a potential biosorbent for the removal of chlorinated solvents from water. The sorption properties of beech leaves and cupules, oak leaves and acorns, birch leaves and lime leaves (all tree species common for a moderate climate) in a non-modified form were investigated with regard to the removal of perchloroethylene, 1,1,2-trichloroethane and 1,1,1,2-tetrachlorothane....

    Full text available to download

  • Nutrient removal in municipal wastewater treatment

    e-Learning Courses
    • E. Zaborowska

    This series of lectures and interactive teaching sessions will cover all the important aspects of nutrient removal in municipal wastewater treatment. There will be five sessions. The topics of the sessions are: 1) Nutrient removal – why, how and what has been achieved?; 2) Biological treatment processes and conventional nitrogen removal; 3) Shortcut nitrogen removal processes and climate implication of nitrogen removal; 4) Biological...

  • The complexity of bicriteria tree-depth

    Publication

    The 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...

    Full text to download in external service

  • Proportion of work permits issued to citizens of Ukraine, Nepal and Belarus in total permits issued in 2008-2018

    Open Research Data
    open access

    The number of work permits issued increased from 18,000 in 2008 to nearly 329 thousand in 2018, i.e. by 18 times. The largest increases in nominal terms occurred in 2015-2018, noting a change from 66 thousand in 2015, up to 127 thousand in 2016, 236,000 in 2017 and 329 thousand in 2018. So far the most work permits were received by Ukrainian citizens....

  • On extremal sizes of locally k-tree graphs

    Publication

    - CZECHOSLOVAK MATHEMATICAL JOURNAL - Year 2010

    A 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...

    Full text to download in external service

  • Evaluation of the content of inorganic anions in tree saps

    Publication
    • M. Bilek
    • K. Stawarczyk
    • P. Kuniar
    • M. Olszewski
    • K. Kędziora
    • E. Cielik

    - Journal of Elementology - Year 2016

    Tree 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...

    Full text available to download

  • The reliability of tree and star networks

    This paper investigated the reliability of tree and star networks. Following measures of network reliability are assumed: the expected number of nodes, that can communicate with the central node; the expected number of node pairs, that are connected by a path through the central node; the expected number of node pairs communicating.

    Full text to download in external service

  • Number of seasonal work permits issued in 2018

    Open Research Data
    open access

    In 2018, a total of 121,436 seasonal work permits were issued, the vast majority of which were granted to Ukrainian citizens. The following dataset shows the countries from which citizens have been issued the most permits.

  • The reliability of tree and star networks.

    Publication

    - Year 2008

    One of the important parameters characterizing the quality of computer networks is the network's reliability with respect to failures of the communication links and nodes. This chapter investigated the reliability of tree and star networks. The tree and star topology is used in centralized computer networks. In centralized computer networks all communication must take place through some central computer. Following measures of network...

  • Average Size of a Suffix Tree for Markov Sources

    Publication

    - Year 2016

    We study a suffix tree built from a sequence generated by a Markovian source. Such sources are more realistic probabilistic models for text generation, data compression, molecular applications, and so forth. We prove that the average size of such a suffix tree is asymptotically equivalent to the average size of a trie built over n independentsequences from the same Markovian source. This equivalenceis only known for memoryless...

    Full text to download in external service

  • Perfect hashing tree automata

    Publication

    - Year 2008

    We 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...

    Full text to download in external service

  • An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree

    We 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.

    Full text available to download

  • An algorithm for listing all minimal double dominating sets of a tree

    Publication

    We 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.

    Full text to download in external service

  • MINERAL CONTENT OF TREE SAP FROM THE SUBCARPATHIAN REGION

    Publication
    • M. Bilek
    • K. Stawarczyk
    • M. Gostkowski
    • M. Olszewski
    • K. Kędziora
    • E. Cieślik

    - Journal of Elementology - Year 2016

    but also as medicinal substance in folk medicine. Traditionally, it was used to treat various conditions, mostly anaemia and chronic fatigue. This study has been designed to establish the content of metallic elements (sodium, potassium, calcium, magnesium, zinc and copper) in sap collected from eight different species (silver birch, downy birch, hornbeam, Norway maple, boxelder maple, black walnut, black alder and white willow)...

    Full text available to download

  • Bounds on the vertex-edge domination number of a tree

    Publication

    - COMPTES RENDUS MATHEMATIQUE - Year 2014

    A vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...

    Full text available to download

  • TREE PHYSIOLOGY

    Journals

    ISSN: 0829-318X , eISSN: 1758-4469

  • Empirical analysis of tree-based classification models for customer churn prediction

    Publication
    • F. E. Usman-Hamza
    • A. O. Balogun
    • S. K. Nasiru
    • L. F. Capretz
    • H. A. Mojeed
    • S. A. Salihu
    • A. G. Akintola
    • M. A. Mabayoje
    • J. B. Awotunde

    - Scientific African - Year 2023

    Customer 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...

    Full text available to download

  • Atmospheric deposition in coniferous and deciduous tree stands in Poland

    Publication

    - ATMOSPHERIC ENVIRONMENT - Year 2016

    The objective of this study was to assess the transformation of precipitation in terms of quantity and chemical composition following contact with the crown layer in tree stands with varied species composition, to investigate the effect of four predominant forest-forming species (pine, spruce, beech, and oak) on the amount and composition of precipitation reaching forest soils, and to determine the sources of pollution in atmospheric...

    Full text to download in external service

  • Number of work permits issued in 2008-2018 by migrant's country of origin

    Open Research Data
    open access

    The scale of the influx of economic migrants to Poland can be proved by data referring to documents enabling legal work, including work permits. In 2018, the most frequently applied for work permit for citizens of eight countries presented in the dataset. The table contains data on the number of permits issued in the years 2008-2018. 

  • Gossiping by energy-constrained mobile agents in tree networks

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2021

    Every 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...

    Full text to download in external service

  • Perfect hashing with pseudo-minimal bottom-up deterministic tree automata

    Publication

    - Year 2008

    We describe a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to techniques implemented with minimal tree automata, our procedure builds a pseudo-minimal DTA. Pseudo-minimal automata are larger than the minimal ones but in turn the mapping can be arbitrary, so it can be determined prior to the automaton construction. We also provide procedures to build incrementally...

  • A lower bound on the total outer-independent domination number of a tree

    Publication

    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 total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...

    Full text to download in external service

  • An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree

    A 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...

    Full text to download in external service

  • An upper bound on the 2-outer-independent domination number of a tree

    Publication

    A 2-outer-independent 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, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...

    Full text to download in external service

  • The number of work permits issued (in thousands) and the dynamics of changes (%, year on year) in 2008-2018

    Open Research Data
    open access

    The number of work permits issued increased from 18,000 in 2008 to nearly 329 thousand in 2018, i.e. by 18 times. The largest increases in nominal terms occurred in 2015-2018, noting a change from 66 thousand in 2015, up to 127 thousand in 2016, 236,000 in 2017 and 329 thousand in 2018. The number of permits issued (in thousands) and the dynamics of...

  • An upper bound on the total outer-independent domination number of a tree

    Publication

    A total outer-independent dominating set of a graph G=(V(G),E(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 total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...

    Full text available to download

  • An upper bound for the double outer-independent domination number of a tree

    Publication

    A 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 γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...

    Full text available to download

  • A lower bound on the double outer-independent domination number of a tree

    Publication

    A 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...

    Full text available to download

  • Membranes for toxic- and heavy-metal removal

    Publication

    - Year 2020

    Since time ago, membranes have greatly attracted the attention of researchers for different types of water-treatment applications, such as wastewater treatment, water purification, removal of microorganisms, chemical compounds, and heavy metals. Nowadays, one of the current challenges of research community definitely deals with the removal of toxic and heavy metals from water. In this regard, the current chapter provides enough...

    Full text to download in external service

  • A note on mixed tree coloring

    Publication

    - INFORMATION PROCESSING LETTERS - Year 2008

    Zaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].

    Full text to download in external service

  • Tree rings as an indicator of atmospheric pollutant deposition to subalpine spruce forests in the Sudetes (Southern Poland)

    Publication

    - ATMOSPHERIC RESEARCH - Year 2015

    In spite of their moderate altitude (1000–1600m a.s.l.), the Western SudetyMountains belong to areas with the most efficient fog precipitation in Europe. Intense industrial activity in the area of windward western foothills caused an exceptional intensification of atmospheric pollutant deposition via precipitation and fog to take place since the 1950s. In the second half of the 1970s a massive spruce forest dieback began affecting...

    Full text to download in external service

  • Tree-Ring Research

    Journals

    ISSN: 1536-1098 , eISSN: 2162-4585

  • Tree Genetics & Genomes

    Journals

    ISSN: 1614-2942 , eISSN: 1614-2950

  • Kinetics of nitrogen removal processes in constructed wetlands

    Publication

    - Year 2018

    The aim of this paper is to present a state-of-the-art review of the kinetics of nitrogen removal in constructed wetlands. Biological processes of nitrogen removal from wastewater can be described using equations and kinetic models. Hence, these kinetic models which have been developed and evaluated allow for predicting the removal of nitrogen in treatment wetlands. One of the most important, first order removal model, which is...

    Full text available to download

  • Pathways of Nitrogen Removal in Hybrid Treatment Wetlands

    Hybrid Treatment Wetlands (HTWs) are composed of two or more filters with different modes of flow, allowing the benefits of both types of bed to be combined, resulting in better effluent quality (nitrogen and organic compounds removal). Such a heterogeneous environment creates possibilities for different mechanisms of nitrogen removal. The objective of the present study was to investigate the removal of nitrogen versus a range...

    Full text available to download

  • Minimum vertex ranking spanning tree problem for chordal and proper interval graphs

    W 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....

    Full text available to download

  • Electrical Tree Growth Behavior Under AC and DC High Voltage in Power Cables

    Publication
    • M. A. Saleh
    • S. S. Refaat
    • M. Olesz
    • H. Abu-Rub

    - Year 2021

    This work investigates the impact of an applied AC and DC high voltage on the electrical tree behavior in extruded cross-linked polyethylene (XLPE) insulation based on simulation and experimental validation. Extensive partial discharge (PD) testing methods are being implemented for high voltage cables under AC voltage for monitoring their condition. However, these PD testing methods cannot be utilized for power cables under DC...

    Full text to download in external service

  • Lower bound on the domination number of a tree.

    Publication

    - Year 2004

    W pracy przedstawiono dolne ograniczenie na liczbę dominowania w drzewach oraz przedstawiono pełną charakterystykę grafów ekstremalnych.

  • An implementation of deterministic tree automata minimization

    Publication

    - Year 2007

    Wstępujący, deterministyczny, skończony automat drzewiasty (DTA) może być używany jako struktura danych do przechowywania zbiorów nieuporządkowanych drzew bez narzuconej liczby poddrzew. Takie automaty są zwykle rzadsze niż automaty działające na napisach i dlatego należy zwrócić szczególną uwagę na ich wydajną minimalizację. W dostępnej literaturze jest jednak ciężko znaleźć proste i szczegółowe opisy procedury minimalizacji....

  • A mechanistic model for fate and removal of estrogens in biological nutrient removal activated sludge systems

    Publication

    - WATER SCIENCE AND TECHNOLOGY - Year 2012

    Two estrogen fate and transformation models were integrated with a comprehensive activated sludge model (ASM) to predict estrogen removal based on biomass and solids production. Model predictions were evaluated against published full-scale plant data as well as results from a laboratory-scale sequencing batch reactor (SBR) fed synthetic wastewater. The estrogen fate model relating the rate of total estrogen degradation to soluble...

    Full text to download in external service