Wyszukiwarka
Filtry
wszystkich: 163
wybranych: 162
Filtry wybranego katalogu
Wyniki wyszukiwania dla: TREE COMPARISON
-
MINERAL CONTENT OF TREE SAP FROM THE SUBCARPATHIAN REGION
Publikacjabut 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)...
-
The reliability of tree and star networks
PublikacjaThis 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.
-
Experience-Driven Model of Decision-Making Processes in Project Teams
PublikacjaThis article presents a model of decision-making processes in project teams. Project teams constitute a specific type of organization appointed to implement a project. Decisions made by project teams result from the methods of project management and best management practices. The authors have undertaken the task of formalizing these processes using the classical method of constructing decision trees. It has been established that...
-
Searching by heterogeneous agents
PublikacjaIn 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...
-
A machine learning approach to classifying New York Heart Association (NYHA) heart failure
PublikacjaAccording to the European Society of Cardiology, globally the number of patients with heart failure nearly doubled from 33.5 million in 1990 to 64.3 million in 2017, and is further projected to increase dramatically in this decade, still remaining a leading cause of morbidity and mortality. One of the most frequently applied heart failure classification systems that physicians use is the New York Heart Association (NYHA) Functional...
-
Searching by Heterogeneous Agents
PublikacjaIn 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...
-
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...
-
High-Speed Binary-to-Residue Converter Design Using 2-Bit Segmentation of the Input Word
PublikacjaIn this paper a new approach to the design of the high-speed binary-to-residue converter is proposed that allows the attaining of high pipelining rates by eliminating memories used in modulo m generators. The converter algorithm uses segmentation of the input binary word into 2-bit segments. The use and effects of the input word segmentation for the synthesis of converters for five-bit moduli are presented. For the number represented...
-
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.
-
Effect of the Road Environment on Road Safety in Poland
PublikacjaRun-off-road accidents tend to be very severe because when a vehicle leaves the road, it will often crash into a solid obstacle (tree, pole, supports, front wall of a culvert, barrier). A statistical analysis of the data shows that Poland's main roadside hazard is trees and the severity of vehicles striking a tree in a run-off-road crash. The risks are particularly high in north-west Poland with many of the roads lined up with...
-
Wybrane metody przydatne w analizie niezawodności i bezpieczeństwa funkcjonalnego systemów technicznych.
PublikacjaPrzedstawiono wybrane metody przydatne w analizie niezawodności i bezpieczeństwa funkcjonalnego systemów technicznych takie jak: metoda FMECA (failure mode, effect and criticality analysis, FTA (fault tree analysis, RBD (reliability block diagram) RCM (reliability centered maintenance, LCC (life cycle cost) i PMO (preventive maintenance optimising.
-
Why are trees still such a major hazard to drivers in Poland?
PublikacjaRoadside trees are one of Poland's most serious road safety issues. Since 2009 more than 2800 people have been killed as a result of tree collisions; this represents about 15% of all of Poland's accident fatalities between 2009 and 2013. In some of the country's regions striking a tree caused more than 30% of all road accident fatalities. With no proper regulations, guidelines or examples of good practice, roadside environments...
-
The complexity of zero-visibility cops and robber
PublikacjaWe consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...
-
Utilization of New Activated Carbon Derived from an Oak Leaves for Removal of Crystal Violet from Aqueous Solution
PublikacjaSignificant negative environmental impact has been noticed at the campus garden of Gdansk University of Technology , Poland, when the withered leaves of Quercus robur Oak Tree (OL) cover large areas at such places. In this regards,an attempt has been made to recycle the most abundant agricultural leaf waste into a high quality local activated carbon (LAC) for use in the decolorizating processes of dye industrial waste- water.
-
Distinguishing views in symmetric networks: A tight lower bound
PublikacjaThe view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers n ≥ D ≥ 1, there exists a port-labeled network with at most n nodes and diameter at most D which contains a pair of nodes whose (infinite) views are different, but whose views truncated to depth Omega( D log(n/ D )) are identical.
-
Drawing maps with advice
PublikacjaW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Building Polish space sector – from small islands of excellence to a national innovation ecosystem
PublikacjaIn the paper a national potential of Poland to build its space industry after joining the European Space Agency (ESA) in 2012 is assessed, based on the series of survey reports published annually by POLSA since 2016. Their methodology was based on the ESA technology tree, classifying all the space-related technical knowhow and allowed identification of the most promising strengths to exploit and shortages to challenge by policymakers...
-
The circle object detection with the use of Msplit estimation
PublikacjaThe paper presents the use of Msplit(q) - estimation in the filtration and aggregation of point clouds containing a known number of elliptical shapes with preliminary unknown - locations and dimensions. These theoretical solutions may have practical relevance especially in the modelling of terrestrial laser scanning data of objects that have similar shape to circles. Mentioned shapes can be scanned of tree trunks, columns, gutters,...
-
Collision-Free Network Exploration
PublikacjaA 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...
-
Electrical Tree Growth Behavior Under AC and DC High Voltage in Power Cables
PublikacjaThis 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...
-
Environmental Role of Rime Chemistry at Selected Mountain Sites in Poland
PublikacjaThe results of field experiments on fog pollutantdeposition enhanced by local mountain climate, completed by thedendrochronological analysis of the forest response, are presentedin this paper. In spite of their low absolute altitude (1,000-1,600 ma.s.l), the Sudetes and the Silesian Beskid form a noticeable orographicbarrier for the airflow of the humid Atlantic air masses.This results in the increase of cloudiness and fog frequency...
-
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,...
-
TWORZENIE MAP SIECI KOMPUTEROWYCH Z WYKORZYSTANIEM PROTOKOŁÓW TYPU LLDP
PublikacjaDla administratorów systemów sieciowych niezwykle istot-nym jest posiadanie narzędzia tworzącego dynamicznie mapę sieci do celów zarządzania, diagnostyki, zapobiegania awariom i włamaniom. Artykuł prezentuje protokoły wspierające tworzenie map sieci a także własne badania nad usprawnieniem istniejących algorytmów. Proponowane rozwiązania to: budowa map z użyciem protokołu LLDP i SNMP, odkrywanie wąskich gardeł w sieciach dzięki...
-
Investigation of continuous wave jamming in an IEEE 802.15.4 network
PublikacjaThis paper presents how continuous wave jamming affects IEEE 802.15.4 network. To this end, an office-based measurement setup has been proposed. Within the measurement area, 25 nodes have been set up in order to create a IEEE 802.15.4 tree-based test network structure. A dedicated jamming device that generates and transmits a continuous wave signal has been developed. Several tests have been conducted and presented to demonstrate...
-
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...
-
Vehicle classification based on soft computing algorithms
PublikacjaExperiments and results regarding vehicle type classification are presented. Three classes of vehicles are recognized: sedans, vans and trucks. The system uses a non-calibrated traffic camera, therefore no direct vehicle dimensions are used. Various vehicle descriptors are tested, including those based on vehicle mask only and those based on vehicle images. The latter ones employ Speeded Up Robust Features (SURF) and gradient images...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublikacjaWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA 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...
-
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,...
-
The Snow Team Problem
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Comparing phylogenetic trees using a minimum weight perfect matching
PublikacjaA phylogenetic tree represents historical evolutionary relationshipbetween different species or organisms. There are various methods for reconstructing phylogenetic trees.Applying those techniques usually results in different treesfor the same input data. An important problem is to determinehow distant two trees reconstructed in such a wayare from each other. Comparing phylogenetic trees is alsouseful in mining phylogenetic information...
-
Weighted 2-sections and hypergraph reconstruction
PublikacjaIn the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...
-
The impact of training and neurotrophins on functional recovery after spinal cord transection: cellular and molecular mechanisms contributing to motor improvement
PublikacjaBeneficial effects of locomotor training on the functional recovery after complete transection of the spinal cord indicate that in chronic spinal animals spontaneous recovery processes are enhanced and shaped by the training. The mechanisms of that use-dependent improvement are still not fully understood. This review tackles three aspects of this issue: (1) neurochemical attributes of functional improvement...
-
Limiting distribution of Lempel Ziv'78 redundancy
PublikacjaWe show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences....
-
On the Limiting distribution of Lempel Ziv'78 Redundancy for Memoryles Sources
PublikacjaWe show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences....
-
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...
-
New data acquisition system for birch sap concentrate production using the reverse osmosis technology
PublikacjaThe work presents a simple electronic device that helps to monitor the basic parameters of the reverse osmosis (RO) system during the concentration of birch tree sap. The construction costs are low (around 150 Euro) but the functionality of the device is high. It has an in-build two channel conductometer and can measure the volumetric flow rate of two streams of liquids. The collected data are transmitted wirelessly via Bluetooth...
-
The Effect of Protrusions on the Initiation of Partial Discharges in XLPE High Voltage Cables
PublikacjaThis paper is focusing on 3D Finite Elements Analysis (FEA) based modelling of protrusions as defects or imperfections in the XLPE high voltage cable. This study is aiming to examine the impact protrusions have on the initiation of partial discharges. Spherical and ellipsoidal protrusions with different sizes at the conductor screen of the high voltage cable is an essential content of this paper. In addition, a spherical gas-filled...
-
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...
-
Runoff Water
PublikacjaThis entry summarizes the current state of knowledge on the role of atmospheric pollutants' transport to the surface and transformations of wet deposition on contact with various surfaces. Runoff waters are one of the forms in which precipitation reaches the groundwater and surface water. They are formed when rain or melting snow washes the surfaces of roofs, highways, agricultural areas, or tree canopies. Pollutants present in...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublikacjaLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Conversion of waste biomass into activated carbon and evaluation of environmental consequences using life cycle assessment
PublikacjaIn 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...
-
Gossiping by energy-constrained mobile agents in tree networks
PublikacjaEvery 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...
-
Examining Classifiers Applied to Static Hand Gesture Recognition in Novel Sound Mixing System
PublikacjaThe main objective of the chapter is to present the methodology and results of examining various classifiers (Nearest Neighbor-like algorithm with non-nested generalization (NNge), Naive Bayes, C4.5 (J48), Random Tree, Random Forests, Artificial Neural Networks (Multilayer Perceptron), Support Vector Machine (SVM) used for static gesture recognition. A problem of effective gesture recognition is outlined in the context of the system...
-
Reconstruction of 3D structure of positive corona streamer by local methods
PublikacjaThe computer algorithms were used for reconstruction of streamer 3D structure. We propose the 3D tree structure model of corona discharge streamer composed with nodes and edges between chosen couples of nodes, which enables easy computation of some important parameters ofstreamers. The 3D model can be derived directly from two projection images by global methods like evolutionary searching or particle simulations. In this paper...
-
The reliability of tree and star networks.
PublikacjaOne 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...
-
Clearing directed subgraphs by mobile agents
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublikacjaW 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....
-
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...
-
Estimation of the Ultimate Strength of FRP Strips-to-Masonry Substrates Bond
PublikacjaFiber-Reinforced Polymers (FRP) were developed as a new method over the past decades due to their many beneficial mechanical properties, and they are commonly applied to strengthen masonry structures. In this paper, the Artificial Neural Network (ANN), K-fold Cross-Validation (KFCV) technique, Multivariate Adaptive Regression Spline (MARS) method, and M5 Model Tree (M5MT) method were utilized to predict the ultimate strength of...