Filtry
wszystkich: 55820
-
Katalog
- Publikacje 27980 wyników po odfiltrowaniu
- Czasopisma 800 wyników po odfiltrowaniu
- Konferencje 1 wyników po odfiltrowaniu
- Wydawnictwa 88 wyników po odfiltrowaniu
- Osoby 2177 wyników po odfiltrowaniu
- Wynalazki 241 wyników po odfiltrowaniu
- Projekty 550 wyników po odfiltrowaniu
- Laboratoria 38 wyników po odfiltrowaniu
- Zespoły Badawcze 107 wyników po odfiltrowaniu
- Aparatura Badawcza 28 wyników po odfiltrowaniu
- Kursy Online 7272 wyników po odfiltrowaniu
- Wydarzenia 597 wyników po odfiltrowaniu
- Oferty 1 wyników po odfiltrowaniu
- Dane Badawcze 15940 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: I-TREE ECOLIDARPREDICTIVE MODELSURBAN FORESTS
-
FORESTRY CHRONICLE
Czasopisma -
Colombia Forestal
Czasopisma -
Malaysian Forester
Czasopisma -
Forestry Journal
Czasopisma -
Forestry Studies
Czasopisma -
Forestry Ideas
Czasopisma -
JOURNAL OF FORESTRY
Czasopisma -
Agriculture and Forestry
Czasopisma -
Hunting for the Magnesium(I) Species: Formation, Structure, andReactivity of some Donor-Free Grignard Compounds
PublikacjaMagnesium 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 algorithm for listing all minimal double dominating sets of a tree
PublikacjaWe 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 2-Dominating Sets of a Tree
PublikacjaWe 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.
-
An upper bound for 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 γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA 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
PublikacjaA 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
PublikacjaA 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
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...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 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...
-
Hybridized PWM Strategy for Three- and Multiphase Three-Level NPC Inverters
PublikacjaA 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...
-
Three Seas Economic Journal
Czasopisma -
Soil chemical properties affect the reaction of forest soil bacteria to drought and rewetting stress
Publikacja -
Endophytic microbiota and ectomycorrhizal structure of Alnus glutinosa Gaertn. at saline and nonsaline forest sites
Publikacja -
Empirical Analysis of Forest Penalizing Attribute and Its Enhanced Variations for Android Malware Detection
Publikacja -
The Use of Wood Chips for Revitalization of Degraded Forest Soil on Young Scots Pine Plantation
Publikacja -
Empirical Analysis of Forest Penalizing Attribute and Its Enhanced Variations for Android Malware Detection
PublikacjaAs 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
PublikacjaThis 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
PublikacjaW 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.
-
Isocyanate-Free Polyurethanes
PublikacjaIsocyanate-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...
-
On the partition dimension of trees
PublikacjaGiven 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
PublikacjaWe 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.
-
Perfect hashing with pseudo-minimal bottom-up deterministic tree automata
PublikacjaWe 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
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...
-
A city is not a tree: a multi-city study on street network and urban life
PublikacjaChristopher 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
PublikacjaCustomer 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...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublikacjaW 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.
-
Methods of estimating the elements of water balance in a forested catchment basin
Publikacja -
Prediction of consumer electricity needs based on Internet weather forecasts
PublikacjaElectrical 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
Czasopisma -
EKONOMIA I PRAWO
Czasopisma -
Croatian Journal of Forest Engineering
Czasopisma -
Austrian Journal of Forest Science
Czasopisma -
Taiwan Journal of Forest Science
Czasopisma -
International Journal of Forest Engineering
Czasopisma -
Russian Journal of Forest Science
Czasopisma -
Thai Forest Bulletin (Botany)
Czasopisma -
European Journal of Forest Engineering
Czasopisma -
JOURNAL OF TROPICAL FOREST SCIENCE
Czasopisma -
SCANDINAVIAN JOURNAL OF FOREST RESEARCH
Czasopisma -
Multidimensional Feature Selection and Interaction Mining with Decision Tree Based Ensemble Methods
Publikacja -
INDIVIDUAL TREE DETECTION FROM UAV LIDAR DATA IN A MIXED SPECIES WOODLAND
Publikacja -
Fault Tree Analysis and Failure Diagnosis of Marine Diesel Engine Turbocharger System
Publikacja