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
-
INDIVIDUAL TREE DETECTION FROM UAV LIDAR DATA IN A MIXED SPECIES WOODLAND
Publication -
Fault Tree Analysis and Failure Diagnosis of Marine Diesel Engine Turbocharger System
Publication -
Economics and Law
Journals -
Prussian Star Forts in the 18th Century
PublicationTekst omawia grupę tzw. ''fortów gwiaździstych'', charakterystycznych budowli obronnych, budowanych w pruskich twierdzach w XVIII w.
-
The Impact of Adjacent Road on Vascular Plant Species Composition in Herbaceous Layers of Peucedano-Pinetum and Tilio-Carpinetum Urban Forests in the City of Warsaw (Poland)
Publication -
Connected searching of weighted trees
PublicationW pracy pokazano, że problem spójnego przeszukiwania drzew ważonych jest silnie NP-zupełny. Problem pozostaje trudnym dla drzew z jednym wierzchołkiem o stopniu większym niż 2. Ponadto, przedstawiony został wielomianowy optymalny algorytm dla klasy drzew z ograniczonym stopniem.
-
Connected searching of weighted trees
PublicationW artykule rozważamy problem spójnego przeszukiwania drzew obciążonych. Autorzy w [L. Barriere i inni, Capture of an intruder by mobile agents, SPAA'02 (2002) 200-209] twierdzą, że istnieje wielomianowy algorytm dla problemu obliczania optymalnej strategii przeszukiwania obciążonego drzewa. W niniejszej pracy pokazano, że problem ten jest obliczeniowo trudny nawet dla wierzchołkowo-obciążonych drzew (wagi krawędzi równe 1) oraz...
-
The complexity of list ranking of trees
PublicationUporządkowane kolorowanie grafu polega na takim etykietowaniu jego wierzchołków, aby każda ścieżka łącząca dwa wierzchołki o tym samym kolorze zawierała wierzchołek o kolorze wyższym. Jeśli każdy wierzchołek posiada dodatkowo listę dozwolonych dla niego etykiet, to mówimy wówczas o uporządkowanym listowym kolorowaniu wierzchołków. W pracy wskazano szereg klas grafów, dla których problem jest trudny: pełne drzewa binarne, drzewa...
-
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
Collision-free network exploration
PublicationMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
Total chromatic sum for trees
PublicationThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
Three-fast-searchable graphs
PublicationIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Distribution of red wood ants (Hymenoptera: Formicidae) in the clear-cut areas of a managed forest in Western Poland
Publication -
Free Amino Acids and Biogenic Amines Content during Ageing of Dry-cured Pork Loins Inoculated with <i>Lactobacillus casei</i> ŁOCK 0900 Probiotic Strain
Publication -
Three positive solutions to second-order three-point impulsive differential equations with deviating arguments
PublicationStosując tw. Leggetta-Williamsa, pokazano że rozpatrywany trzypunktowy problem brzegowy z impulsami ma dodatnie rozwiązania (trzy). Otrzymane twierdzenia dotyczą przypadku opóźnionego oraz wyprzedzonego. W pracy podano przykład i pokazano, że przyjęte założenia są spełnione.
-
Design of three-phase three-level CIC T-source inverter with maximum boost control
Publication -
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...
-
Small-Scale Forestry
Journals -
Journal of Sustainable Forestry
Journals -
Floresta e Ambiente
Journals -
JOURNAL OF FORESTRY RESEARCH
Journals -
Current Forestry Reports
Journals -
Arboriculture and Urban Forestry
Journals -
INTERNATIONAL FORESTRY REVIEW
Journals -
Journal of Forestry Engineering
Journals -
The partial-order tree: a new structure for indexing on complex attributes in object-oriented databases
Publication -
Adaptive neuro fuzzy and fuzzy decision tree classifiers as applied to sea floor characterization.
PublicationPrzedstawiono wyniki badań wpływu różnych parametrów echa odbitego od dna morskiego na dokładność klasyfikacji typu dna przy pomocy sieci neuronowej z logiką rozmytą i przy pomocy drzew decyzyjnych. W szczególności uwzględniono takie parametry echa jak: energia, amplituda i nachylenie opadającego zbocza, wzbogacone o współczynniki falkowe otrzymane z dyskretnej transformacji falkowej (DWT).
-
Electrical Tree Growth Behavior Under AC and DC High Voltage in Power Cables
PublicationThis 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...
-
Radiation dose distributions in three dimensions from tomographic optical density scanning of polymer gels: I. Development of an optical scanner
Publication -
<title>Cavity simulator and controller for VUV free electron laser SIMCON 2.1, part I: algorithms and SIMCON system</title>
Publication -
International Review of Electrical Engineering-IREE
Journals -
Stress or help, how does the grey heron Ardea cinerea L. modify the vegetation structure of the forest floor?
Publication -
Early post-fire bird community in European boreal forest: Comparing salvage-logged with non-intervention areas
Publication -
The effects of frost conditions on forest management based on the example of the July 1996 period at Hala Izerska in the Izera Mountains
Publication -
Assessment of tensile forces in Sopot Forest Opera membrane by in situ measurements and iterative numerical strategy for inverse problem
PublicationAssessment of tensile forces in newly build Sopot Forest Opera roofing membrane is presented. The procedure is based on in situ measurements and solution of the inverse problem by an iterative procedure. The goal of the analysis is to determine whether the stress state of the membrane is consistent with the design assumptions. The paper contains the description of measurements, used instruments, applied loadings, numerical investiga-tions...
-
POLFEL - Free Electron Laser in Poland
Publication -
Survivability analysis of scale-free networks
PublicationPraca dotyczy aspektów złośliwej kompromitacji stacji sieciowych poprzez epidemie wirusów komputerowych oraz ataki hackerskie. Opisano nowy autorski model analizy przeżywalności atakowanych sieci bezskalowych i ocenę metod zabezpieczeń. Pokazano wyniki modelowania efektywności środków powstrzymujących epidemie wirusów, polityk filtracji w ścianach ogniowych, efektywności blokowania adresów. Wszystkie wyniki są oryginalne i publikowane...
-
Construction of phylogenetic trees with topological constraints
PublicationThis paper proposes a method of reconstruction of phylogenetic trees based on heuristic search with topological constraints. Using topological constraints it is possible to reduce the set of solutions as well as to enforce that the result is consistent with a given hypothesis about the evolution process within some group of species. Along with this work a number of algorithms used for phylogenetic analysis were implemented. Those...
-
Total outer-connected domination in trees
PublicationW pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.
-
Free vibration of truncated-cone columns
Publication -
Total restrained domination numbers of trees
PublicationOpisane są wszystkie drzewa, w których liczby dominowania totalnego i totalno - powściągniętego są sobie równe, a także podano dolne ograniczenie na liczbę dominowania totalno - powściągniętego w drzewach.
-
Superconductivity in three-layer Na0.3CoO2·1.3H2O
Publication -
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.
-
Covariance approach to the free photon field
PublicationWprowadziliśmy teorię fotonu poprzez tą samą zasadę, co dla pojedynczej czą-stki w kwantowej mechanice używając C*-algebraicznego podejścia kowariantychukładów.
-
Superconductivity in three-layer Na0.3CoO2*1.3H2O
PublicationOdkryto nadprzewodnictwo w trójwarstwowym związku uwodnionego sodowo -kobaltowego tlenku Na0.3CoO2 * 1.3H2O. Opisany został sposób syntezy, badania strukturalne (XRD i TGA) a także badania podatności magnetycznej.
-
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.
-
Properties of the triset metric for phylogenetic trees
Publicationthe following paper presents a new polynomial time metric for unrootedphylogenetic trees (based on weighted bipartite graphs and the method ofdetermining a minimum perfect matching) and its properties. also many its properties are presented.
-
TreeCmp: Comparison of Trees in Polynomial Time
PublicationMetryki filogenetyczne umożliwiają ocenę jakości wyników analizy filogenetycznej oraz wiarygodności algorytmów przeprowadzających taką analizę. Aplikacja TreeCmp oferuje efektywne, wielomianowe implementacje ośmiu takich metryk (dla drzew nieukorzenionych i zawierających korzeń) zdefiniowanych dla dowolnych filogenez (nie koniecznie binarnych). Program ten jako pierwszy umożliwia wyznaczanie nowych metryk, definiowanych w oparciu...
-
Approximate search strategies for weighted trees
PublicationW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
Dynamic F-free Coloring of Graphs
PublicationA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...