Wyszukiwarka
Filtry
wszystkich: 1693
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SORTED LINEAR TREE
-
Construction of a picewise-linear classifier by applaing discriminant analysis to decision tree induction
PublikacjaArtykuł prezentuje metodę konstrukcji drzew decyzyjnych. W odróżnieniu od większości popularnych algorytmów, które wybierają pojedyncze cechy do budowy reguł decyzyjnych w węzłach drzewa, ta metoda łączy wszystkie cechy. Używa ona wieloklasowego kryterium Fishera do wydzielenia nowych cech, które są liniowa kombinacją cech pierwotnych. Takie drzewa mogą aproksymować złożone regiony decyzyjne używając mniejszej liczby węzłów w porównaniu...
-
Improving all-reduce collective operations for imbalanced process arrival patterns
PublikacjaTwo 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...
-
All-gather Algorithms Resilient to Imbalanced Process Arrival Patterns
PublikacjaTwo 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...
-
The complexity of bicriteria tree-depth
PublikacjaThe 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...
-
On extremal sizes of locally k-tree graphs
PublikacjaA 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...
-
Cross-validation for triplets of HRV and BPV indices based on ordinal patterns in differentiating OSA patients from healthy controls
Dane BadawczeResults of cross-validation for triplets of HRV and BPV indices based on ordinal patterns, as described in the paper “Differentiating patients with obstructive sleep apnea from healthy controls based on heart rate–blood pressure coupling quantified by entropy-based indices” by P. Pilarczyk, G. Graff, J.M. Amigó, K. Tessmer, K. Narkiewicz, B. Graff.
-
Cross-validation for triplets of classical HRV and BPV indices in differentiating OSA patients from healthy controls
Dane BadawczeResults of cross-validation for triplets of classical HRV and BPV indices, as described in the paper “Differentiating patients with obstructive sleep apnea from healthy controls based on heart rate–blood pressure coupling quantified by entropy-based indices” by P. Pilarczyk, G. Graff, J.M. Amigó, K. Tessmer, K. Narkiewicz, and B. Graff.
-
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.
-
Evaluation of the content of inorganic anions in tree saps
PublikacjaTree 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...
-
Empirical analysis of tree-based classification models for customer churn prediction
PublikacjaCustomer 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...
-
Incremental construction of Minimal Tree Automata [online]
PublikacjaWe 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...
-
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...
-
Average Size of a Suffix Tree for Markov Sources
PublikacjaWe 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...
-
Perfect hashing tree automata
PublikacjaWe 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...
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublikacjaWe 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
PublikacjaWe 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.
-
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)...
-
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...
-
TREE PHYSIOLOGY
Czasopisma -
Atmospheric deposition in coniferous and deciduous tree stands in Poland
PublikacjaThe 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...
-
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...
-
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...
-
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,...
-
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,...
-
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...
-
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...
-
Reversible data hiding in encrypted DICOM images using sorted binary sequences of pixels
PublikacjaIn this paper, a novel reversible data hiding method for encrypted DICOM images is proposed. The method utilizes binary decomposition of the input data paired with a sorting process of the obtained binary sequences to ensure efficient data embedding in each predefined data block for specific most significant bit (MSB) planes while exploiting the properties of run-length encoding. The proposed scheme is lossless, and based on the...
-
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...
-
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...
-
Use of Bi-Temporal ALS Point Clouds for Tree Removal Detection on Private Property in Racibórz, Poland
PublikacjaTrees 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,...
-
The energy consumption during the birch tree sap concentration process using the reverse osmosis system
PublikacjaBirch 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.
-
Comparison of non-linear statical analysis of truss with linear and rotational side supports and 3d roof model
PublikacjaIn the paper geometrically non-linear analysis of example truss with linear and rotational elastic side supports is compared with geometrically non-linear analysis of part of the roof construction with purlins and truss-bracing. For different stiffness of side-supports a non linear relation between normal force in compressed chord due to out of truss plane displacement has been calculated.
-
LINEAR & MULTILINEAR ALGEBRA
Czasopisma -
A Unique and Stable Polyproline I Helix Sorted out from Conformational Equilibrium by Solvent Polarity
Publikacja -
A note on mixed tree coloring
PublikacjaZaproponowano 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].
-
Tree rings as an indicator of atmospheric pollutant deposition to subalpine spruce forests in the Sudetes (Southern Poland)
PublikacjaIn 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...
-
The need for linear revitalization. Gdynia case
PublikacjaThe aim of the article is to discuss the need of defining and implementation of the linear revitalization - the new approach related to the revitalization processes. The results of the preliminary investigations indicate that this kind of revitalization seems to be an important tool supporting city management and planning, especially in cases of cities fragmentation - causing lack of physical, social, economic and ecological cohesion....
-
Tree-Ring Research
Czasopisma -
Tree Genetics & Genomes
Czasopisma -
Programowanie Liniowe (Linear Programming)
Kursy OnlineMateriały do przedmiotów: - Badania operacyjne (1/3), kier: informatyka mgr stac. rok. 1. sem. 1. - Operational research (1/3), kier: informatyka mgr stac. (ang) rok. 1. sem. 1. - Badania operacyjne (1/2), kier: informatyka mgr niestac. rok. 2. sem. 3.
-
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....
-
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...
-
An implementation of deterministic tree automata minimization
PublikacjaWstę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.
PublikacjaW pracy przedstawiono dolne ograniczenie na liczbę dominowania w drzewach oraz przedstawiono pełną charakterystykę grafów ekstremalnych.
-
Automated Design of Linear Phase Filters
PublikacjaThis paper presents a fast technique for an automated design of microwave filters with linear phase. The proposed method exploits the cost function defined using the location of complex zeros and poles of the filter’s transfer and reflection function. The effectiveness of the proposed technique is presented with two illustrative examples.
-
Linear revitalization - problems and challenges. Discursive article
PublikacjaThe aim of the article, defined by the author as discursive, is to give the answer as to whether within ‘revitalization’ we should distinguish the notion of ‘linear revitalization’ – not yet defined in Polish and English-language literature. The author presents the thesis that we should do so by presenting the idea, its specific character and its role. This kind of action seems to have, in the author’s opinion, a positive influence...
-
Attitudes to tree removal on private properties in two Polish cities.
Dane BadawczeLarge cities are increasingly faced with declining urban tree cover and related problems, such as increased urban heat islands and flash floods. Reducing these phenomena increasingly has to rely on trees located on private property. However, to effectively engage private landowners on these issues, more attention must be paid to understanding their...
-
Efficiency of linear and non-linear classifiers for gas identification from electrocatalytic gas sensor
PublikacjaElectrocatalytic gas sensors belong to the family of electrochemical solid state sensors. Their responses are acquired in the form of I-V plots as a result of application of cyclic voltammetry technique. In order to obtain information about the type of measured gas the multivariate data analysis and pattern classification techniques can be employed. However, there is a lack of information in literature about application of such...
-
Stability by linear approximation for time scale dynamical systems
PublikacjaWe study systems on time scales that are generalizations of classical differential or difference equations and appear in numerical methods. In this paper we consider linear systems and their small nonlinear perturbations. In terms of time scales and of eigenvalues of matrices we formulate conditions, sufficient for stability by linear approximation. For non-periodic time scales we use techniques of central upper Lyapunov exponents...
-
Metabolic activity of tree saps of different origin towards cultured human cells in the light of grade correspondence analysis and multiple regression modeling
PublikacjaTree 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...