Search
Search results for: TREES
-
Area covered by dominant tree species in the State Forests divided into stand age classes over the years 2009-2013
Open Research DataChanges compared to version 1.0:
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Kinematyczne pomiary GNSS na linii kolei wąskotorowej w Koszalinie
PublicationW artykule opisano metodę kinematycznych pomiarów geodezyjnych GNSS zastosowaną dla inwentaryzacji trasy kolejowej w terenie silnie zalesionym. W badaniach wskazano możliwości wykorzystania tej metody dla inwentaryzacji układu geometrycznego trasy kolei wąskotorowej w Koszalinie. Opisano najważniejsze różnice pomiędzy koleją o rozstawie szyn 1000 mm a 1435 mm oraz przyszłościowe zagadnienie planowanej rewitalizacji tego odcinka....
-
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...
-
Super Dominating Sets in Graphs
PublicationIn 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.
-
Perfect hashing tree automata
PublicationWe 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...
-
Searching by heterogeneous agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
NLP Questions Answering Using DBpedia and YAGO
PublicationIn this paper, we present results of employing DBpedia and YAGO as lexical databases for answering questions formulated in the natural language. The proposed solution has been evaluated for answering class 1 and class 2 questions (out of 5 classes defined by Moldovan for TREC conference). Our method uses dependency trees generated from the user query. The trees are browsed for paths leading from the root of the tree to the question...
-
Coronas and Domination Subdivision Number of a Graph
PublicationIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
Interpolation properties of domination parameters of a graph
PublicationAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Współczesny obraz żuławskiego podcienia
PublicationThe Contemporary Image of Żuławy Arcades. The cultural landscape of the Vistula River Delta is created by man in large part. Almost all of its components- buildings, roads, embankments and as natural as trees, water and earth are anthropogenic origin. Arcaded houses are part of this multi-dimensional mosaic for more than four centuries.
-
Use of Bi-Temporal ALS Point Clouds for Tree Removal Detection on Private Property in Racibórz, Poland
PublicationTrees 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,...
-
Incremental construction of Minimal Tree Automata [online]
PublicationWe 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...
-
Searching by Heterogeneous Agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
The Impact of Thermal Stresses on Volume Resistivity: Performance Comparison between TR-XLPE and XLPE Cables
PublicationMost failures in electric power cables are attributed to the development of water trees inside the insulating materials. Thus, the development and utilization of Tree Retardant Cross-Linked Polyethylene (TR-XLPE) based cables have recently been given great attention to overcome the treeing issues. TR-XLPE cables use low-density polyethylene compounds suppressing the formation of water trees while retaining excellent electrical,...
-
Fuzzy Gaussian Decision Tree
PublicationThe Decision Tree algorithm is one of the first machine learning algorithms developed. It is used both as a standalone model and as an ensemble of many cooperating trees like Random Forest, AdaBoost, Gradient Boosted Trees, or XGBoost. In this work, a new version of the Decision Tree was developed for classifying real-world signals using Gaussian distribution functions and a fuzzy decision process. The research was carried out...
-
Influence of accelerometer signal pre-processing and classification method on human activity recognition
PublicationA study of data pre-processing influence on accelerometer-based human activity recognition algorithms is presented. The frequency band used to filter-out the accelerometer signals and the number of accelerometers involved were considered in terms of their influence on the recognition accuracy. In the test four methods of classification were used: support vector machine, decision trees, neural network, k-nearest neighbor.
-
Soft Sensor Application in Identification of the Activated Sludge Bulking Considering the Technological and Economical Aspects of Smart Systems Functioning
PublicationThe paper presented the methodology for the construction of a soft sensor used for activated sludge bulking identification. Devising such solutions fits within the current trends and development of a smart system and infrastructure within smart cities. In order to optimize the selection of the data-mining method depending on the data collected within a wastewater treatment plant (WWTP), a number of methods were considered, including:...
-
Metabolic activity of tree saps of different origin towards cultured human cells in the light of grade correspondence analysis and multiple regression modeling
PublicationTree saps are nourishing biological media commonly used for beverage and syrup production. Although the nutritional aspect of tree saps is widely acknowledged, the exact relationship between the sap composition, origin, and effect on the metabolic rate of human cells is still elusive. Thus, we collected saps from seven different tree species and conducted composition-activity analysis. Saps from trees of Betulaceae, but not from...
-
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...
-
Some Progress on Total Bondage in Graphs
PublicationThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
Sridhar Gutam PhD
PeopleWorking as Senior Scientist (Plant Physiology) in the Agricultural Research Service of the Indian Council of Agricultural Research (ICAR). Currently posted at ICAR-Indian Institute of Horticultural Research (IIHR), Bengaluru in the division of ICAR-All India Coordinated Research Project on Fruits.. Apart from interests in Plant Physiology and Plant Phenology of fruit trees, I have interests in Open Science and Open Access to public...
-
Selection of Features for Multimodal Vocalic Segments Classification
PublicationEnglish speech recognition experiments are presented employing both: audio signal and Facial Motion Capture (FMC) recordings. The principal aim of the study was to evaluate the influence of feature vector dimension reduction for the accuracy of vocalic segments classification employing neural networks. Several parameter reduction strategies were adopted, namely: Extremely Randomized Trees, Principal Component Analysis and Recursive...
-
MicroGal Gravity Measurements with MGS-6 Micro-g LaCoste Gravimeter
PublicationKnowing the exact number of fruit and trees helps growers to make better decisions about how to manage their production in the orchard and prevent plant diseases. The current practice of yield estimation is to manually count fruit or flowers (before harvesting), which is a very time-consuming and costly process. Moreover it’s not practical for large orchards. It also doesn’t allow to make predictions of plant development in a more...
-
Adaptive Algorithm for Interactive Question-based Search
PublicationPopular web search engines tend to improve the relevanceof their result pages, but the search is still keyword-oriented and far from "understanding" the queries' meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users' intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly on the most critical aspect of this...
-
Strategic balance in graphs
PublicationFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Pyrolysis of Pruning Residues from Various Types of Orchards and Pretreatment for Energetic Use of Biochar
PublicationThe routine pruning and cutting of fruit trees provides a considerable amount of biowaste each year. This lignocellulosic biomass, mainly in the form of branches, trunks, rootstocks, and leaves, is a potential high-quality fuel, yet often is treated as waste. The results of a feasibility study on biochar production by pyrolysis of residues from orchard pruning were presented. Three types of biomass waste were selected as raw materials...
-
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,...
-
Evaluation of the content of inorganic anions in tree saps
PublicationTree 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...
-
Interactive Decision Making, Inżynieria Środowiska, Environmental Engineering, 2023/2024 (summer semester)
e-Learning CoursesThe course is designed for students of MSc Studies in Environmental Engineering (studies in Polish and English) Person responsible for the subject, carrying out lectures and tutorials: mgr inż. Agata.Siemaszko; agata.siemaszko@pg.edu.pl The person conducting the lectures and tutorials: dr inż. Anna Jakubczyk-Gałczyńska; anna.jakubczyk@pg.edu.pl The course is conducted using the Project-Based Learning (PBL) method. It provides...
-
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,...
-
Bounds on the vertex-edge domination number of a tree
PublicationA 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...
-
Detecting Apples in the Wild: Potential for Harvest Quantity Estimation
PublicationKnowing the exact number of fruits and trees helps farmers to make better decisions in their orchard production management. The current practice of crop estimation practice often involves manual counting of fruits (before harvesting), which is an extremely time-consuming and costly process. Additionally, this is not practicable for large orchards. Thanks to the changes that have taken place in recent years in the field of image...
-
Phylogenetic analysis of Oncidieae subtribe - matK plastid region
Open Research DataThe dataset contains alignment and consensus matrix files, and results of phylogenetic analysis of plastid matK region from 186 orchid species considered to belong Oncidieae subtribe. Sequences were assessed from NCBI GeneBank (list of all records with identifiers in the separate file)
-
Phylogenetic analysis of Oncidieae subtribe - ITS1-5,8S-ITS2
Open Research DataThe dataset contains alignment and consensus matrix files, and results of phylogenetic analysis of ITS1- 5,8S-ITS2 region from 186 orchid species considered to belong Oncidieae subtribe. Sequences were assessed from NCBI GeneBank (list of all records with identifiers in the separate file)
-
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...
-
Average Size of a Suffix Tree for Markov Sources
PublicationWe 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...
-
Redukcja czasu analizy MZP przez ograniczenie rozmiaru rozwiązania
PublicationAnaliza drzew niezdatności jest uznaną metodą analizy bezpieczeństwa systemów. Notacja ECSDM pozwala definiować zależności czasowe między zdarzeniami drzewa oraz przeanalizować je w celu określenia zależności pomiędzy zdarzeniami z Minimalnych Zbiorów Przyczyn (MZP). Dzięki wprowadzeniu klasyfikacji zdarzeń z MZP można wyodrębnić zależności czasowe istotne dla zapobiegania wywoływania hazardu przez konkretny MZP. Pozostałe zależności...
-
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...
-
On-line P-coloring of graphs
PublicationFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Adding Interpretability to Neural Knowledge DNA
PublicationThis paper proposes a novel approach that adds the interpretability to Neural Knowledge DNA (NK-DNA) via generating a decision tree. The NK-DNA is a promising knowledge representation approach for acquiring, storing, sharing, and reusing knowledge among machines and computing systems. We introduce the decision tree-based generative method for knowledge extraction and representation to make the NK-DNA more explainable. We examine...
-
Shading, Dusting and Incorrect Positioning of Photovoltaic Modules as Important Factors in Performance Reduction
PublicationThe amount of solar radiation reaching the front cover of a photovoltaic module is crucial for its performance. A number of factors must be taken into account at the design stage of the solar installation, which will ensure maximum utilization of the potential arising from the location. During the operation of a photovoltaic installation, it is necessary to limit the shading of the modules caused by both dust and shadowing by trees...
-
Conversion of waste biomass into activated carbon and evaluation of environmental consequences using life cycle assessment
PublicationIn this article, activated carbon was produced from Lantana camara and olive trees by H3PO4 chemical activation. The prepared activated carbons were analyzed by characterizations such as scanning electron microscopy, energy-dispersive X-ray spectroscopy, Brunauer–Emmett–Teller, X-ray diffraction, thermogravimetric analysis, and Fourier transform infrared spectroscopy. H3PO4 is used as an activator agent to create an abundant pore...
-
Hat problem on the cycle C4
PublicationThe topic of our paper is the hat problem. In that problem, each of n people is randomly tted with a blue or red hat. Then everybody can try to guess simultanously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
Basic evaluation of limb exercises based on electromyography and classification methods
PublicationSymptoms caused by cerebral palsy or stroke deprive a person partially or even completely of his ability to move. Nowadays we can observe more technologically advanced rehabilitation devices which incorporate biofeedback into the process of rehabilitation of such people. However, there is still a lack of devices that would analyse, assess, and control (independently or with limited support) specialised movement exercises. Here...
-
Solid road environment and its hazards
PublicationAccidents that involve vehicles departing the road tend to have very high severity, as they often result in the vehicle hitting a permanent obstacle (which can be a ree, a pole, facility pillar, front wall of a culvert or a barrier). In recent years, this type of accident caused approx. 19% of all road deaths in Poland. A particularly high risk can be observed on roads located in northern and western...
-
Global defensive sets in graphs
PublicationIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
The hat problem on cycles on at least nine vertices
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...