Search
Filters
total: 8764
filtered: 5113
-
Catalog
- Publications 5113 available results
- Journals 30 available results
- Conferences 3 available results
- Publishing Houses 1 available results
- People 87 available results
- Projects 3 available results
- Research Equipment 1 available results
- e-Learning Courses 45 available results
- Events 3 available results
- Open Research Data 3478 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: LOCALLY TREE
-
On extremal sizes of locally k-tree graphs
PublicationA 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...
-
A comparison of three solvent-free techniques coupled with gas chromatography for determining trihalomethanes in urine samples
PublicationDążenie do oznaczania lotnych analitów organicznych w próbkach płynów biologicznych charakteryzujących się złożonym, a często zmiennym składem matrycy, stanowi siłę napędową do działań analityków w zakresie poszukiwania nowych rozwiązań metodycznych i aparaturowych. Publikacja ta przedstawia porównanie trzech technik zastosowanych do tych celów: technikę analizy fazy nadpowierzchniowej z generacją strumienia ciekłego sorbentu...
-
European X-Ray Free Electron Laser (EXFEL): local implications
Publication -
Development of Free Electron Lasers in Europe Local and Global Implications – 2016
Publication -
The reliability of tree and star networks
PublicationThis 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.
-
A note on mixed tree coloring
PublicationZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
The reliability of tree and star networks.
PublicationOne 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...
-
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...
-
The complexity of bicriteria tree-depth
PublicationThe 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...
-
MODEL OF COOPERATION IN CREATING SOCIALLY ENGAGED URBAN SPACE � THE ROLE OF LOCAL PARTICIPATION
Publication -
An implementation of deterministic tree automata minimization
PublicationWstępujący, deterministyczny, skończony automat drzewiasty (DTA) może być używany jako struktura danych do przechowywania zbiorów nieuporządkowanych drzew bez narzuconej liczby poddrzew. Takie automaty są zwykle rzadsze niż automaty działające na napisach i dlatego należy zwrócić szczególną uwagę na ich wydajną minimalizację. W dostępnej literaturze jest jednak ciężko znaleźć proste i szczegółowe opisy procedury minimalizacji....
-
Lower bound on the domination number of a tree.
PublicationW pracy przedstawiono dolne ograniczenie na liczbę dominowania w drzewach oraz przedstawiono pełną charakterystykę grafów ekstremalnych.
-
Colonization of germ-free mice with a mixture of three lactobacillus strains enhances the integrity of gut mucosa and ameliorates allergic sensitization
Publication -
Fe local structure in Pt-free nitrogen-modified carbon based electrocatalysts: XAFS study
PublicationThe paper presents a new results on the bonding environment (coordination number and geometry) and on oxidation states of Fe in nitrogen-modified Fe/C composites used as Pt-free catalysts for oxygen reduction in Direct Hydrogen Fuel Cells. Starting from glucose or fructose, two catalysts displaying different electrochemical performance were prepared and studied in the form of pristine powder and thin catalytic layer of electrode...
-
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...
-
Lower bound on the paired domination number of a tree
PublicationW pracy przedstawione jest ograniczenie dolne dla liczby dominowania parami oraz scharakteryzowane są wszystkie drzewa ekstremalne.
-
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...
-
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...
-
Complexity of weak acceptonic conditions in tree automata
PublicationRozważano złożoność problemu pustości dla automatów na drzewach ze słabymi warunkami akceptowalności. Rozważano także translacje pomiędzy słabymi i silnymi warunkami akceptowalności.
-
Tool support for ECSDM fault tree methodology
PublicationExtended Common Safety Description Model (ECSDM) jest językiem do formalnej specyfikacji systemów związanych z bezpieczeństwem oraz ich komponentów. Język ten zawiera konstrukcje umożliwiające specyfikację zależności czasowych. Może on zostać użyty w analizie drzew błędów, aby uzyskać jednoznaczną specyfikację hazardów w sytuacji, gdy są one uzależnione od związków czasowych pomiędzy przyczynami. Artykuł opisuje narzędzie wytworzone...
-
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...
-
Atmospheric deposition in coniferous and deciduous tree stands in Poland
PublicationThe 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...
-
Lower bound on the weakly connected domination number of a tree
PublicationPraca dotyczy dolnego ograniczenia liczby dominowania słabo spójnego w drzewach (ograniczenie ze względu na ilość wierzchołków i ilość wierzchołków końcowych w drzewie).
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery 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...
-
MINERAL CONTENT OF TREE SAP FROM THE SUBCARPATHIAN REGION
Publicationbut 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)...
-
Lower bound on the distance k-domination number of a tree
PublicationW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Local and global response of sandwich beams made of GFRP facings and PET foam core in three point bending test
PublicationIn the paper behaviour of laminated sandwich beams (FRP face sheet – PET foam core – FRP face sheet) subjected to three point bending is studied. The paper aim is to find practical descriptions enabling effective and accurate estimation of the elastic response, damage and failure of the beams, basing on experiments and static calculations. Therefore a number of tests are described, that were done on laminated coupons and foam specimens...
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.
-
An algorithm for listing all minimal double dominating sets of a tree
PublicationWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
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...
-
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,...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 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...
-
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...
-
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...
-
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,...
-
Hybridized PWM Strategy for Three- and Multiphase Three-Level NPC Inverters
PublicationA simple hybridized pulsewidth modulation (PWM) algorithm for three- and multiphase three-level neutral point clamped (NPC) inverters is proposed. The proposed solution is based on classical space vector PWM (SVPWM) algorithms for two-level inverters but can also be based on sinusoidal PWM with min–max injection. An additional level of output voltage is obtained by modifying the resulting switching patterns taking into account...
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Preserving Trees in Automata
PublicationWe 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.
-
Paired bondage in trees
PublicationW pracy zdefiniowano pojęcie liczby zniewolenia parami jako moc najmniejszego zbioru krawędzi, którego usunięcie z grafu spowoduje wzrost liczby dominowania parami. W szczególności scharakteryzowane są wszystkie drzewa, w których liczba zniewolenia wynosi 0, czyli takie, w których usunięcie dowolnego podzbioru krawędzi nie zwiększy liczby dominowania parami.
-
Isocyanate-Free Polyurethanes
PublicationIsocyanate-free polyurethanes (also called non-isocyanate polyurethanes, or NIPUs) are alternatives to the conventional (commercially used) polyurethanes synthesized using di- or polyisocyanates, polyols, and chain extenders with low molecular weight. The major routes of NIPUs’ synthesis involve polyaddition of cyclic carbonates and di- or polyamines, polycondensation of carbamates, and diols. The most important intermediates are...
-
On adaptive covariance and spectrum estimation of locally stationary multivariate processes
PublicationWhen estimating the correlation/spectral structure of a locally stationary process, one has to make two important decisions. First, one should choose the so-called estimation bandwidth, inversely proportional to the effective width of the local analysis window, in the way that complies with the degree of signal nonstationarity. Too small bandwidth may result in an excessive estimation bias, while too large bandwidth may cause excessive...
-
On Adaptive Spectrum Estimation of Multivariate Autoregressive Locally Stationary Processes
PublicationAutoregressive modeling is a widespread parametricspectrum estimation method. It is well known that, in the caseof stationary processes with unknown order, its accuracy canbe improved by averaging models of different complexity usingsuitably chosen weights. The paper proposes an extension of thistechnique to the case of multivariate locally stationary processes.The proposed solution is based on local autoregressive...
-
Critical Case Stochastic Phylogenetic Tree Model via the Laplace Transform
PublicationBirth–and–death models are now a common mathematical tool to describe branching patterns observed in real–world phylogenetic trees. Liggett and Schinazi (2009) is one such example. The authors propose a simple birth–and–death model that is compatible with phylogenetic trees of both influenza and HIV, depending on the birth rate parameter. An interesting special case of this model is the critical case where the birth rate equals the...
-
Perfect hashing with pseudo-minimal bottom-up deterministic tree automata
PublicationWe 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...
-
Empirical analysis of tree-based classification models for customer churn prediction
PublicationCustomer churn is a vital and reoccurring problem facing most business industries, particularly the telecommunications industry. Considering the fierce competition among telecommunications firms and the high expenses of attracting and gaining new subscribers, keeping existing loyal subscribers becomes crucial. Early prediction of disgruntled subscribers can assist telecommunications firms in identifying the reasons for churn and...
-
A city is not a tree: a multi-city study on street network and urban life
PublicationChristopher 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...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublicationW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.
-
On adaptive selection of estimation bandwidth for analysis of locally stationary multivariate processes
PublicationWhen estimating the correlation/spectral structure of a locally stationary process, one should choose the so-called estimation bandwidth, related to the effective width of the local analysis window. The choice should comply with the degree of signal nonstationarity. Too small bandwidth may result in an excessive estimation bias, while too large bandwidth may cause excessive estimation variance. The paper presents a novel method...
-
Locally-adaptive Kalman smoothing approach to identification of nonstationary stochastic systems
Publication -
Position and Orientation Estimation in Radio Network With Groups of Locally Synchronized Nodes
PublicationThis article presents a positioning system with groups of locally synchronized nodes. A mobile object is equipped with a group of several synchronized receivers that are able to measure the difference in the time of arrival of signals from reference transmitters. The reference transmitters are synchronized only in local groups, with no global synchronization between groups. It is assumed that the synchronous operation of transmitters...