Filters
total: 55819
-
Catalog
- Publications 27980 available results
- Journals 800 available results
- Conferences 1 available results
- Publishing Houses 88 available results
- People 2176 available results
- Inventions 241 available results
- Projects 550 available results
- Laboratories 38 available results
- Research Teams 107 available results
- Research Equipment 28 available results
- e-Learning Courses 7272 available results
- Events 597 available results
- Offers 1 available results
- Open Research Data 15940 available results
displaying 1000 best results Help
Search results for: I-TREE ECOLIDARPREDICTIVE MODELSURBAN FORESTS
-
JOURNAL OF FORESTRY
Journals -
Agriculture and Forestry
Journals -
Białowieża primeval forest as an example of transfrontier co-operation between Poland and Bielarus
PublicationThe Polish Ministry of Foreign Affairs is completing their work on the agreement on local border traffic (May 2009.) At the final stage of the works, the list of the towns and villages situated within the area covered by the so-called "local traffic" on both the Polish and the Belarusian sides of the border is being verified. The "border belt" area, whose residents will be able to move between the bordering countries under the...
-
Content and mobility of strontium in forest soils according to north-south transect in Poland
Publication -
Forest habitat loss and fragmentation in Central Poland during the last 100 years
Publication -
Forest Inventory Data Reveal Stand History from 115 Years Ago
Publication -
Atmospheric heavy metal deposition accumulated in rural forest soils of southern Scandinavia
PublicationPrzeprowadzono obliczenia zakumulowanej ( w okresie 50 lat) atmosferycznej depozycji metali ciężkich na glebach leśnych na obszarach wiejskich. Podstawę do obliczeń stanowiły:- pomiary zawartości metali ciężkich w opadach atmosferycznych (przeprowadzone przez okres 33 lat) na terenie Danii,- europejska baza danych o emisji zanieczyszczeń.Oznaczano zawartość metali ciężkich (Pb, Cd, Cu, Zn, V, Ni, As) w próbkach opadów atmosferycznych...
-
Problems of Small Recreation Areas Valuation-Forest Refugium in the Silesia Park in Chorzów
Publication -
Hunting for the Magnesium(I) Species: Formation, Structure, andReactivity of some Donor-Free Grignard Compounds
PublicationMagnesium bromide radicals have to be prepared as high-temperature molecules and trapped as a metastable solution because a seemingly simple reduction of donor-free Grignard compounds failed. However, the essential role of magnesium(I) species during the formation of Grignard compounds could be demonstrated experimentally.
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 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...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA 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,...
-
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 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,...
-
An upper bound on the total outer-independent domination number of a tree
PublicationA 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...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA 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...
-
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.
-
An upper bound for the double outer-independent domination number of a tree
PublicationA 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...
-
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.
-
Hybridized PWM Strategy for Three- and Multiphase Three-Level NPC Inverters
PublicationA simple hybridized pulsewidth modulation (PWM) algorithm for three- and multiphase three-level neutral point clamped (NPC) inverters is proposed. The proposed solution is based on classical space vector PWM (SVPWM) algorithms for two-level inverters but can also be based on sinusoidal PWM with min–max injection. An additional level of output voltage is obtained by modifying the resulting switching patterns taking into account...
-
The Use of Wood Chips for Revitalization of Degraded Forest Soil on Young Scots Pine Plantation
Publication -
Empirical Analysis of Forest Penalizing Attribute and Its Enhanced Variations for Android Malware Detection
Publication -
Soil chemical properties affect the reaction of forest soil bacteria to drought and rewetting stress
Publication -
Endophytic microbiota and ectomycorrhizal structure of Alnus glutinosa Gaertn. at saline and nonsaline forest sites
Publication -
Empirical Analysis of Forest Penalizing Attribute and Its Enhanced Variations for Android Malware Detection
PublicationAs a result of the rapid advancement of mobile and internet technology, a plethora of new mobile security risks has recently emerged. Many techniques have been developed to address the risks associated with Android malware. The most extensively used method for identifying Android malware is signature-based detection. The drawback of this method, however, is that it is unable to detect unknown malware. As a consequence of this problem,...
-
Sewage sludge co-pyrolysis with agricultural/forest residues: A comparative life-cycle assessment
PublicationThis study aims to determine the sustainability and energy efficiency of co-pyrolysis scenarios as treatment processes for municipal sewage sludge through a life cycle assessment (LCA). In addition, sensitivity and energy recovery analyses are conducted to determine the possible methods for optimizing the co-pyrolysis process from a circular bioeconomy perspective. Corncob and wood residue have been selected as potential co-feed...
-
Paired bondage in trees
PublicationW pracy zdefiniowano pojęcie liczby zniewolenia parami jako moc najmniejszego zbioru krawędzi, którego usunięcie z grafu spowoduje wzrost liczby dominowania parami. W szczególności scharakteryzowane są wszystkie drzewa, w których liczba zniewolenia wynosi 0, czyli takie, w których usunięcie dowolnego podzbioru krawędzi nie zwiększy liczby dominowania parami.
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Preserving Trees in Automata
PublicationWe present a method to store additional information in a minimal automaton so that it is possible to compute a corresponding tree node number for a state. The number can then be used to retrieve additional information. The method works for minimal (and any other) deterministic acyclic finite state automata (DFAs). We also show how to compute the inverse mapping.
-
Isocyanate-Free Polyurethanes
PublicationIsocyanate-free polyurethanes (also called non-isocyanate polyurethanes, or NIPUs) are alternatives to the conventional (commercially used) polyurethanes synthesized using di- or polyisocyanates, polyols, and chain extenders with low molecular weight. The major routes of NIPUs’ synthesis involve polyaddition of cyclic carbonates and di- or polyamines, polycondensation of carbamates, and diols. The most important intermediates are...
-
Three Seas Economic Journal
Journals -
Perfect hashing with pseudo-minimal bottom-up deterministic tree automata
PublicationWe 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...
-
Critical Case Stochastic Phylogenetic Tree Model via the Laplace Transform
PublicationBirth–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...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublicationW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.
-
A city is not a tree: a multi-city study on street network and urban life
PublicationChristopher Alexander, a British-American scholar, differentiated an old (natural) city from a new (planned) one by structure. The former resembles a “semilattice”, or a complex system encompassing many interconnected sub-systems. The latter is shaped in a graph-theoretical “tree”, which lacks the structural complexity as its sub-systems are compartmentalized into a single hierarchy. This structural distinction explains why, or...
-
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...
-
Methods of estimating the elements of water balance in a forested catchment basin
Publication -
Prediction of consumer electricity needs based on Internet weather forecasts
PublicationElectrical energy is considered both as an important driver for producing and transporting goods in companies, as well as a good in itself which requires planning and management for generating and delivering it to consumers in proper time and amounts. Weather information can be considered to convey part of the data on energy delivery needs of consumers. Free meteorological data sources on the Web do not offer consistent data to...
-
Majallah-i Pizishki-i Danishgah-i ulum-i Pizishki-i Tabriz
Journals -
Croatian Journal of Forest Engineering
Journals -
Austrian Journal of Forest Science
Journals -
Taiwan Journal of Forest Science
Journals -
International Journal of Forest Engineering
Journals -
Russian Journal of Forest Science
Journals -
Thai Forest Bulletin (Botany)
Journals -
European Journal of Forest Engineering
Journals -
JOURNAL OF TROPICAL FOREST SCIENCE
Journals -
SCANDINAVIAN JOURNAL OF FOREST RESEARCH
Journals -
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....
-
Tree-based homogeneous ensemble model with feature selection for diabetic retinopathy prediction
Publication -
Construction of a picewise-linear classifier by applaing discriminant analysis to decision tree induction
PublicationArtykuł prezentuje metodę konstrukcji drzew decyzyjnych. W odróżnieniu od większości popularnych algorytmów, które wybierają pojedyncze cechy do budowy reguł decyzyjnych w węzłach drzewa, ta metoda łączy wszystkie cechy. Używa ona wieloklasowego kryterium Fishera do wydzielenia nowych cech, które są liniowa kombinacją cech pierwotnych. Takie drzewa mogą aproksymować złożone regiony decyzyjne używając mniejszej liczby węzłów w porównaniu...
-
Multidimensional Feature Selection and Interaction Mining with Decision Tree Based Ensemble Methods
Publication