Wyniki wyszukiwania dla: tree networks - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: tree networks

Wyniki wyszukiwania dla: tree networks

  • Gossiping by energy-constrained mobile agents in tree networks

    Publikacja

    - THEORETICAL COMPUTER SCIENCE - Rok 2021

    Every 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The reliability of tree and star networks

    This 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.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The reliability of tree and star networks.

    Publikacja

    - Rok 2008

    One 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...

  • Exploiting multi-interface networks: Connectivity and Cheapest Paths

    Publikacja

    - WIRELESS NETWORKS - Rok 2010

    Let 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Distinguishing views in symmetric networks: A tight lower bound

    Publikacja

    The 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.

    Pełny tekst do pobrania w portalu

  • The Use of Artificial Neural Networks and Decision Trees to Predict the Degree of Odor Nuisance of Post-Digestion Sludge in the Sewage Treatment Plant Process

    This paper presents the application of artificial neural networks and decision trees for the prediction of odor properties of post-fermentation sludge from a biological-mechanical wastewater treatment plant. The input parameters were concentrations of popular compounds present in the sludge, such as toluene, p-xylene, and p-cresol, and process parameters including the concentration of volatile fatty acids, pH, and alkalinity in...

    Pełny tekst do pobrania w portalu

  • Collision-Free Network Exploration

    Publikacja
    • J. Czyzowicz
    • D. Dereniowski
    • L. Gąsieniec
    • R. Klasing
    • A. Kosowski
    • D. Pająk

    - Rok 2014

    A 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Collision-free network exploration

    Publikacja
    • J. Czyzowicz
    • D. Dereniowski
    • L. Gąsieniec
    • R. Klasing
    • A. Kosowski
    • D. Pająk

    - JOURNAL OF COMPUTER AND SYSTEM SCIENCES - Rok 2017

    Mobile 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...

    Pełny tekst do pobrania w portalu

  • A city is not a tree: a multi-city study on street network and urban life

    Publikacja

    Christopher 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...

    Pełny tekst do pobrania w portalu

  • Examining Classifiers Applied to Static Hand Gesture Recognition in Novel Sound Mixing System

    The 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • COVID-19 severity forecast based on machine learning and complete blood count data

    Proper triage of COVID-19 patients is a key factor in eective case management, especially with limited and insucient resources. In this paper, we propose a machine-aided diagnostic system to predict how badly a patient with COVID-19 will develop disease. The prognosis of this type is based on the parameters of commonly used complete blood count tests, which makes it possible to obtain data from a wide range of patients.We chose...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • COVID-19 severity forecast based on machine learning and complete blood count data

    Proper triage of COVID-19 patients is a key factor in eective case management, especially with limited and insucient resources. In this paper, we propose a machine-aided diagnostic system to predict how badly a patient with COVID-19 will develop disease. The prognosis of this type is based on the parameters of commonly used complete blood count tests, which makes it possible to obtain data from a wide range of patients.We chose...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Knowledge management in the IPv6 migration process

    There are many reasons to deploy IPv6 protocol with IPv4 address space depletion being the most obvious. Unfortunately, migration to IPv6 protocol seems slower than anticipated. To improve pace of the IPv6 deployment, authors of the article developed an application that supports the migration process. Its main purpose is to help less experienced network administrators to facilitate the migration process with a particular target...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • A comparative analysis of the effectiveness of corporate bankruptcy prediction models based on financial ratios: Evidence from Colombia, 2008 to 2015

    Logit and discriminant analyses have been used for corporate bankruptcy prediction in several studies since the last century. In recent years there have been dozens of studies comparing the several models available, including the ones mentioned above and also probit, artificial neural networks, support vector machines, among others. For the first time for Colombia, this paper presents a comparative analysis of the effectiveness...

    Pełny tekst do pobrania w portalu

  • Privacy-Preserving, Scalable Blockchain-Based Solution for Monitoring Industrial Infrastructure in the Near Real-Time

    This paper proposes an improved monitoring and measuring system dedicated to industrial infrastructure. Our model achieves security of data by incorporating cryptographical methods and near real-time access by the use of virtual tree structure over records. The currently available blockchain networks are not very well adapted to tasks related to the continuous monitoring of the parameters of industrial installations. In the database...

    Pełny tekst do pobrania w portalu

  • Prediction of energy consumption and evaluation of affecting factors in a full-scale WWTP using a machine learning approach

    Publikacja

    - PROCESS SAFETY AND ENVIRONMENTAL PROTECTION - Rok 2021

    Treatment of municipal wastewater to meet the stringent effluent quality standards is an energy-intensive process and the main contributor to the costs of wastewater treatment plants (WWTPs). Analysis and prediction of energy consumption (EC) are essential in designing and operating sustainable energy-saving WWTPs. In this study, the effect of wastewater, hydraulic, and climate-based parameters on the daily consumption of EC by...

    Pełny tekst do pobrania w portalu

  • Machine learning-based seismic fragility and seismic vulnerability assessment of reinforced concrete structures

    Many studies have been performed to put quantifying uncertainties into the seismic risk assessment of reinforced concrete (RC) buildings. This paper provides a risk-assessment support tool for purpose of retrofitting and potential design strategies of RC buildings. Machine Learning (ML) algorithms were developed in Python software by innovative methods of hyperparameter optimization, such as halving search, grid search, random...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On extremal sizes of locally k-tree graphs

    Publikacja

    - CZECHOSLOVAK MATHEMATICAL JOURNAL - Rok 2010

    A graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Collaborative Exploration of Trees by Energy-Constrained Mobile Robots

    Publikacja

    - THEORY OF COMPUTING SYSTEMS - Rok 2018

    We study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Evaluation of the content of inorganic anions in tree saps

    Publikacja
    • M. Bilek
    • K. Stawarczyk
    • P. Kuniar
    • M. Olszewski
    • K. Kędziora
    • E. Cielik

    - Journal of Elementology - Rok 2016

    Tree 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...

    Pełny tekst do pobrania w portalu

  • Improving methods to calculate the loss of ecosystem services provided by urban trees using LiDAR and aerial orthophotos

    Publikacja

    - URBAN FORESTRY & URBAN GREENING - Rok 2021

    In this paper we propose a methodology for combining remotely sensed data with field measurements to assess selected tree parameters (diameter at breast height (DBH) and tree species) required by the i-Tree Eco model to estimate ecosystem services (ES) provided by urban trees. We determined values of ES provided by trees in 2017 in Racibórz (a city in South Poland) and estimated the loss of ES from January 1, 2017 to March 5, 2017,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Study of various machine learning approaches for Sentinel-2 derived bathymetry

    Publikacja

    - PLOS ONE - Rok 2023

    In recent years precise and up-to-date information regarding seabed depth has become more and more important for companies and institutions that operate on coastlines. While direct, in-situ measurements are performed regularly, they are expensive, time-consuming and impractical to be performed in short time intervals. At the same time, an ever-increasing amount of satellite imaging data becomes available. With these images, it...

    Pełny tekst do pobrania w portalu

  • The complexity of bicriteria tree-depth

    Publikacja

    The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Process arrival pattern aware algorithms for acceleration of scatter and gather operations

    Imbalanced process arrival patterns (PAPs) are ubiquitous in many parallel and distributed systems, especially in HPC ones. The collective operations, e.g. in MPI, are designed for equal process arrival times (PATs), and are not optimized for deviations in their appearance. We propose eight new PAP-aware algorithms for the scatter and gather operations. They are binomial or linear tree adaptations introducing additional process...

    Pełny tekst do pobrania w portalu

  • Use of Bi-Temporal ALS Point Clouds for Tree Removal Detection on Private Property in Racibórz, Poland

    Publikacja

    - Remote Sensing - Rok 2021

    Trees 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,...

    Pełny tekst do pobrania w portalu

  • Trees having many minimal dominating sets

    We provide an algorithm for listing all minimal dominating sets of a tree of order n in time O(1.4656^n). This leads to that every tree has at most 1.4656^n minimal dominating sets. We also give an infinite family of trees of odd and even order for which the number of minimal dominating sets exceeds 1.4167^n, thus exceeding 2^{n/2}. This establishes a lower bound on the running time of an algorithm for listing all minimal dominating...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree

    We 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.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Psychological and physical components in forming preferences on urban greenery management – The case of trees

    Publikacja

    - ENVIRONMENTAL SCIENCE & POLICY - Rok 2023

    Public opinion is increasingly important in managing urban greenery. In this regard, this study demonstrates the importance of sociological (environmental worldviews), psychological (place attachment, perceived benefits of trees), and physical factors (type of building people live in, and urban greenery) in forming residents’ opinions on whether the municipality or landowners should decide about tree removal on private land. Logistic...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Minimal 2-dominating sets in Trees

    We 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.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Minimal double dominating sets in trees

    Publikacja

    - Rok 2014

    We 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 double dominating sets of a tree

    Publikacja

    We 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.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Empirical analysis of tree-based classification models for customer churn prediction

    Publikacja
    • F. E. Usman-Hamza
    • A. O. Balogun
    • S. K. Nasiru
    • L. F. Capretz
    • H. A. Mojeed
    • S. A. Salihu
    • A. G. Akintola
    • M. A. Mabayoje
    • J. B. Awotunde

    - Scientific African - Rok 2023

    Customer 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...

    Pełny tekst do pobrania w portalu

  • Incremental construction of Minimal Tree Automata [online]

    Publikacja

    - ALGORITHMICA - Rok 2009

    We 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Study of Multi-Class Classification Algorithms’ Performance on Highly Imbalanced Network Intrusion Datasets

    Publikacja

    - Informatica - Rok 2021

    This paper is devoted to the problem of class imbalance in machine learning, focusing on the intrusion detection of rare classes in computer networks. The problem of class imbalance occurs when one class heavily outnumbers examples from the other classes. In this paper, we are particularly interested in classifiers, as pattern recognition and anomaly detection could be solved as a classification problem. As still a major part of...

    Pełny tekst do pobrania w portalu

  • Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance

    Publikacja

    In the paper, we describe a method for comparing arbitrary, not necessary fully resolved, unrooted phylogenetic trees. Proposed method is based on finding a minimum weight matching in bipartite graphs and can be regarded as a generalization of well-known Robinson-Foulds distance. We present some properties and advantages of the new distance. We also investigate some properties of presented distance in a common biological problem...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The energy consumption during the birch tree sap concentration process using the reverse osmosis system

    Birch tree sap was concentrated by mens of the reversed osmosis technique. The energy consumption in a small-scale pilot apparatus was estimated. The threshold value for the water removal above which the specific energy consumption significantly increased was identified. Below the threshold value the reversed osmosis had low energy demand and could be an attractive method for the production of birch tree sap-based beverages.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The usefulness of birch saps from the area of Podkarpacie to produce birch syrup

    Publikacja

    - Biotechnology and Food Science - Rok 2016

    In northern European countries, as well as in North America tree saps of maples and birches are used for the production of syrups. Birch syrups are characterized by a specific aromatic taste and can be used as an addition to sweets, desserts, salads and meats. Attention is paid to the health benefits of birch syrups, mainly for high mineral content. The aim of this study was to evaluate the usefulness of birch saps obtained from...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Metabolic activity of tree saps of different origin towards cultured human cells in the light of grade correspondence analysis and multiple regression modeling

    Publikacja
    • A. Wnorowski
    • M. Bilek
    • K. Stawarczyk
    • M. Gostkowski
    • M. Olszewski
    • M. Wójciak-Kosior
    • I. Sowa

    - ACTA SOCIETATIS BOTANICORUM POLONIAE - Rok 2017

    Tree 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...

    Pełny tekst do pobrania w portalu

  • Modeling and Evaluation of Electric Treeing Phenomena in Polymeric Cable Insulation

    Publikacja
    • Q. Khan
    • S. S. Refaat
    • H. Abu-Rub
    • H. Toliyat
    • M. Olesz

    - Rok 2021

    This paper investigates the treeing phenomenon in polymeric materials such as crosslinked polyethylene (XLPE) that is widely used in medium and high voltage power cables as primary insulation. The modeling of electrical tree growth in the insulation from its initiation to breakdown is significant research work that illustrates the discharge dynamics and its impact on aging process in polymeric insulation. This study utilizes pulse...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Monitoring Trends of Land Use and Land Cover Changes in Rajang River Basin

    Publikacja

    - Rok 2021

    In this study, the spatiotemporal changes in land use and land cover (LULC) were evaluated from 1992 to 2015 for the Rajang River Basin (RRB) located in the Sarawak State of Malaysia. The changes in water bodies cropped lands, and forests were assessed based on the available remotely sensed satellite data. Supervised classification with the Maximum-Likelihood-Algorithm technique was adopted for monitoring the LULC changes using...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Narratives on cutting down trees on private land. A comparison of urban and rural municipalities in Poland using the Q-deliberation method

    Publikacja
    • K. Mączka
    • P. Matczak
    • M. Mielewczyk
    • P. Przewoźna
    • A. Inglot
    • P. Wężyk
    • K. Zięba-kulawik
    • P. Hawryło

    - LAND USE POLICY - Rok 2023

    Increased development in rural and urban areas leads to a decrease in tree cover and reduces the ecosystem services that trees provide. Municipal authorities must consider managing trees on private land to ensure that residents have access to trees and green spaces. In doing so, they must frequently confront conflicting stakeholder views, which are driven by diverse public and private interests and impacted by the type of landscape...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Brief Announcement: Energy Constrained Depth First Search

    Publikacja

    - Rok 2018

    Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Analyzing sets of phylogenetic trees obtained from bayesian MCMC process using topology metrics

    Publikacja

    - Rok 2009

    The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationship between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations amongorganisms and geographical areas.In the paper, we describe a general method for comparing hylogenetic trees....

  • Reconfiguring Minimum Dominating Sets in Trees

    Publikacja

    We provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...

    Pełny tekst do pobrania w portalu

  • Approximation Strategies for Generalized Binary Search in Weighted Trees

    Publikacja

    - Rok 2017

    We consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Verification of a Novel Method of Detecting Faults in Medium-Voltage Systems with Covered Conductors

    Publikacja

    - Metrology and Measurement Systems - Rok 2017

    This paper describes the use of new methods of detecting faults in medium-voltage overhead lines built of covered conductors. The methods mainly address such faults as falling of a conductor, contacting a conductor with a tree branch, or falling a tree branch across three phases of a medium-voltage conductor. These faults cannot be detected by current digital relay protection systems. Therefore, a new system that can detect the...

    Pełny tekst do pobrania w portalu

  • Analyzing sets of phylogenetic trees using metrics

    Publikacja

    The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetictrees...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On trees attaining an upper bound on the total domination number

    A total 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. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Tree rings as an indicator of atmospheric pollutant deposition to subalpine spruce forests in the Sudetes (Southern Poland)

    Publikacja

    - ATMOSPHERIC RESEARCH - Rok 2015

    In spite of their moderate altitude (1000–1600m a.s.l.), the Western SudetyMountains belong to areas with the most efficient fog precipitation in Europe. Intense industrial activity in the area of windward western foothills caused an exceptional intensification of atmospheric pollutant deposition via precipitation and fog to take place since the 1950s. In the second half of the 1970s a massive spruce forest dieback began affecting...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Average Size of a Suffix Tree for Markov Sources

    Publikacja

    - Rok 2016

    We 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Structure and Randomness in Planning and Reinforcement Learning

    Publikacja

    - Rok 2021

    Planning in large state spaces inevitably needs to balance the depth and breadth of the search. It has a crucial impact on the performance of a planner and most manage this interplay implicitly. We present a novel method \textit{Shoot Tree Search (STS)}, which makes it possible to control this trade-off more explicitly. Our algorithm can be understood as an interpolation between two celebrated search mechanisms: MCTS and random...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Adding Interpretability to Neural Knowledge DNA

    Publikacja

    - CYBERNETICS AND SYSTEMS - Rok 2022

    This 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...

    Pełny tekst do pobrania w portalu

  • Inception and Propagation of Electrical Trees in the Presence of Space Charge in HVAC Extruded Cables

    Publikacja
    • M. A. Saleh
    • S. S. Refaat
    • M. Olesz
    • H. Abu-Rub

    - IEEE TRANSACTIONS ON DIELECTRICS AND ELECTRICAL INSULATION - Rok 2021

    This paper presents the space charge impact on the inception and propagation of electrical trees in cross-linked polyethylene (XLPE) insulation via simulations and experimentation. A 3D finite element analysis (FEA)-based modeling is proposed to simulate electrical trees via a needle embedded on the XLPE insulation. The proposed FEA model demonstrates the influence of the space charge magnitude and polarity on the initiation of...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Analysis and Detection of Faults at Insulated Conductors of Overhead Medium Voltage Lines

    Publikacja

    - Rok 2013

    The paper dealt with the issue of breakdowns detection of isolated hanging wires on the medium-voltage transmission. The main aim of article is to describe the function of created breakdowns detector and evaluation its. The breakdowns detector is created based in indicators of faults such as touch between tree limbs and insulated wire, touch tree limbs with several phases or fall insulated wire on the ground. Breakdowns detector...

  • On a Recurrence Arising in Graph Compression

    Publikacja

    - ELECTRONIC JOURNAL OF COMBINATORICS - Rok 2012

    In a recently proposed graphical compression algorithm by Choi and Szpankowski (2012), the following tree arose in the course of the analysis. The root contains n balls that are consequently distributed between two subtrees according to a simple rule: In each step, all balls independently move down to the left subtree (say with probability p) or the right subtree (with probability 1􀀀p). A new node is created as long as...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Super Dominating Sets in Graphs

    Publikacja

    In 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.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Exploring Stock Traders’ Cognitive Biases: Research Design and Simulator Framework

    Publikacja

    - Rok 2023

    Cognitive bias is a phenomenon that has been extensively studied in stock trading and many other fields. This paper presents a framework for a Mobile Stock Trading Simulator (MSTS) that facilitates automatic investment in stocks with minimal human influence, by investigating the behavioral patterns and cognitive errors of stock market investors. The paper aims to determine whether investors’ investment strategies can be improved...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Ranking ecosystem services delivered by trees in urban and rural areas

    Publikacja

    - AMBIO - Rok 2022

    Policies and strategies for tree management and protection on a national, regional, and local level have not sufficiently considered differences between rural and urban areas. We used expert knowledge to compare rural and urban areas in a case study evaluating the relative importance of ecosystem services (ES) in policy development. The Analytic Hierarchy Process (AHP) and focus group discussions were used to rank 17 ES, representing...

    Pełny tekst do pobrania w portalu

  • The Complexity of Zero-Visibility Cops and Robber

    Publikacja

    - Rok 2014

    In this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • MINERAL CONTENT OF TREE SAP FROM THE SUBCARPATHIAN REGION

    Publikacja
    • M. Bilek
    • K. Stawarczyk
    • M. Gostkowski
    • M. Olszewski
    • K. Kędziora
    • E. Cieślik

    - Journal of Elementology - Rok 2016

    but 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)...

    Pełny tekst do pobrania w portalu

  • Experience-Driven Model of Decision-Making Processes in Project Teams

    This 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Searching by heterogeneous agents

    In 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Perfect hashing with pseudo-minimal bottom-up deterministic tree automata

    Publikacja

    - Rok 2008

    We 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...

  • Searching by Heterogeneous Agents

    Publikacja

    - Rok 2019

    In 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • High-Speed Binary-to-Residue Converter Design Using 2-Bit Segmentation of the Input Word

    In 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...

    Pełny tekst do pobrania w portalu

  • Preserving Trees in Automata

    Publikacja

    - Rok 2015

    We 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.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Effect of the Road Environment on Road Safety in Poland

    Run-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...

    Pełny tekst do pobrania w portalu

  • Visual TreeCmp : Comprehensive Comparison of Phylogenetic Trees on the Web

    Publikacja

    1. We present Visual TreeCmp—a package of applications for comparing phylogenetic tree sets. 2. Visual TreeCmp includes a graphical web interface allowing the visualization of compared trees and command line application extended by comparison methods recently proposed in the literature. 3. The phylogenetic tree similarity analysis in Visual TreeCmp can be performed using eighteen metrics, of which 11 are dedicated to rooted trees...

    Pełny tekst do pobrania w portalu

  • Atmospheric deposition in coniferous and deciduous tree stands in Poland

    Publikacja

    - ATMOSPHERIC ENVIRONMENT - Rok 2016

    The objective of this study was to assess the transformation of precipitation in terms of quantity and chemical composition following contact with the crown layer in tree stands with varied species composition, to investigate the effect of four predominant forest-forming species (pine, spruce, beech, and oak) on the amount and composition of precipitation reaching forest soils, and to determine the sources of pollution in atmospheric...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Wybrane metody przydatne w analizie niezawodności i bezpieczeństwa funkcjonalnego systemów technicznych.

    Publikacja

    Przedstawiono 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?

    Roadside 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Comparison of Absorbed and Intercepted Fractions of PAR for Individual Trees Based on Radiative Transfer Model Simulations

    Publikacja
    • W. Wojnowski
    • S. Wei
    • W. Li
    • T. Yin
    • X. Li
    • G. Lai Fern Ow
    • M. Lokman Mohd Yusof
    • A. J. Whittle

    - Remote Sensing - Rok 2021

    The fraction of absorbed photosynthetically active radiation (fAPAR) is a key parameter for estimating the gross primary production (GPP) of trees. For continuous, dense forest canopies, fAPAR, is often equated with the intercepted fraction, fIPAR. This assumption is not valid for individual trees in urban environments or parkland settings where the canopy is sparse and there are well-defined tree crown boundaries. Here, the distinction...

    Pełny tekst do pobrania w portalu

  • Utilization of New Activated Carbon Derived from an Oak Leaves for Removal of Crystal Violet from Aqueous Solution

    Significant 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.

    Pełny tekst do pobrania w portalu

  • The complexity of zero-visibility cops and robber

    Publikacja

    - THEORETICAL COMPUTER SCIENCE - Rok 2015

    We 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...

    Pełny tekst do pobrania w portalu

  • Drawing maps with advice

    Publikacja

    W 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ć...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Building Polish space sector – from small islands of excellence to a national innovation ecosystem

    Publikacja

    In 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...

    Pełny tekst do pobrania w portalu

  • All-gather Algorithms Resilient to Imbalanced Process Arrival Patterns

    Two novel algorithms for the all-gather operation resilient to imbalanced process arrival patterns (PATs) are presented. The first one, Background Disseminated Ring (BDR), is based on the regular parallel ring algorithm often supplied in MPI implementations and exploits an auxiliary background thread for early data exchange from faster processes to accelerate the performed all-gather operation. The other algorithm, Background Sorted...

    Pełny tekst do pobrania w portalu

  • The circle object detection with the use of Msplit estimation

    Publikacja

    - Rok 2018

    The 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,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Investigation into MPI All-Reduce Performance in a Distributed Cluster with Consideration of Imbalanced Process Arrival Patterns

    Publikacja

    - Advances in Intelligent Systems and Computing - Rok 2020

    The paper presents an evaluation of all-reduce collective MPI algorithms for an environment based on a geographically-distributed compute cluster. The testbed was split into two sites: CI TASK in Gdansk University of Technology and ICM in University of Warsaw, located about 300 km from each other, both connected by a fast optical fiber Ethernet-based 100 Gbps network (900 km part of the PIONIER backbone). Each site hosted a set...

    Pełny tekst do pobrania w portalu

  • Electrical Tree Growth Behavior Under AC and DC High Voltage in Power Cables

    Publikacja
    • M. A. Saleh
    • S. S. Refaat
    • M. Olesz
    • H. Abu-Rub

    - Rok 2021

    This 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Environmental Role of Rime Chemistry at Selected Mountain Sites in Poland

    The 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Investigation of continuous wave jamming in an IEEE 802.15.4 network

    Publikacja

    This 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • TWORZENIE MAP SIECI KOMPUTEROWYCH Z WYKORZYSTANIEM PROTOKOŁÓW TYPU LLDP

    Dla 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...

  • A lower bound on the total outer-independent domination number of a tree

    A 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,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Vehicle classification based on soft computing algorithms

    Experiments 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Bounds on the vertex-edge domination number of a tree

    Publikacja

    - COMPTES RENDUS MATHEMATIQUE - Rok 2014

    A 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...

    Pełny tekst do pobrania w portalu

  • Comparing phylogenetic trees using a minimum weight perfect matching

    Publikacja

    - Rok 2008

    A 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The Snow Team Problem

    Publikacja

    - Rok 2017

    We 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)...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Improving all-reduce collective operations for imbalanced process arrival patterns

    Publikacja

    Two new algorithms for the all-reduce operation optimized for imbalanced process arrival patterns (PAPs) are presented: (1) sorted linear tree, (2) pre-reduced ring as well as a new way of online PAP detection, including process arrival time estimations, and their distribution between cooperating processes was introduced. The idea, pseudo-code, implementation details, benchmark for performance evaluation and a real case example...

    Pełny tekst do pobrania w portalu

  • An upper bound on the 2-outer-independent domination number of a tree

    A 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,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree

    A 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints

    We 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...

    Pełny tekst do pobrania w portalu

  • Weighted 2-sections and hypergraph reconstruction

    Publikacja

    In 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The impact of training and neurotrophins on functional recovery after spinal cord transection: cellular and molecular mechanisms contributing to motor improvement

    Beneficial 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

    Publikacja

    - Rok 2011

    We 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....

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On the Limiting distribution of Lempel Ziv'78 Redundancy for Memoryles Sources

    Publikacja

    - Rok 2014

    We 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

    Publikacja

    A 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...

    Pełny tekst do pobrania w portalu

  • New data acquisition system for birch sap concentrate production using the reverse osmosis technology

    The 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The Effect of Protrusions on the Initiation of Partial Discharges in XLPE High Voltage Cables

    Publikacja

    - Bulletin of the Polish Academy of Sciences-Technical Sciences - Rok 2021

    This 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...

    Pełny tekst do pobrania w portalu

  • Runoff Water

    Publikacja

    - Rok 2013

    This 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...

    Pełny tekst do pobrania w serwisie zewnętrznym