Filtry
wszystkich: 6839
wybranych: 4618
-
Katalog
- Publikacje 4618 wyników po odfiltrowaniu
- Czasopisma 20 wyników po odfiltrowaniu
- Konferencje 1 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 85 wyników po odfiltrowaniu
- Wynalazki 5 wyników po odfiltrowaniu
- Projekty 18 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 118 wyników po odfiltrowaniu
- Wydarzenia 13 wyników po odfiltrowaniu
- Dane Badawcze 1958 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: TREE SAPS
-
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...
-
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)...
-
Lefschetz periodic point free self-maps of compact manifolds
PublikacjaLet f be a self-map of a compact connected manifold M. We characterize Lefschetz periodic point free continuous self-maps of M for several classes of manifolds and generalize the results of Guirao and Llibre [J.L.G. Guirao, J. Llibre, On the Lefschetz periodic point free continuous self-maps on connected compact manifolds, Topology Appl. 158 (16) (2011) 2165-2169].
-
Lefschetz periodic point free self-maps of compact manifolds
PublikacjaLet f be a self-map of a compact connected manifold M. We characterize Lefschetz periodic point free continuous self-maps of M for several classes of manifolds and generalize the results of Guirao and Llibre [J.L.G. Guirao, J. Llibre, On the Lefschetz periodic point free continuous self-maps on connected compact manifolds,
-
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...
-
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.
-
Role of nitrogen in optical and electrical band gaps of hydrogenated/hydrogen free carbon nitride film
PublikacjaWe report the optical and electrical band gap energy of amorphous hydrogenated carbon nitride (a-HCNx) and carbon nitride (a-CNx) as a function of nitrogen concentration (N/C). The optical band gap of a-HCNx and a-CNx films has been determined by means of Ellipsometry and UV-VIS. Both optical and electrical band gaps increase with elevated nitrogen concentration. Experimentally obtained electrical band gap is compared with the...
-
Low-volume label-free SARS-CoV-2 detection with the microcavity-based optical fiber sensor
PublikacjaAccurate and fast detection of viruses is crucial for controlling outbreaks of many diseases; therefore, to date, numerous sensing systems for their detection have been studied. On top of the performance of these sensing systems, the availability of biorecognition elements specific to especially the new etiological agents is an additional fundamental challenge. Therefore, besides high sensitivity and selectivity, such advantages...
-
A comparison of three solvent-free techniques coupled with gas chromatography for determining trihalomethanes in urine samples
PublikacjaDąż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...
-
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].
-
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...
-
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...
-
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.
-
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...
-
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.
-
Drawing maps with advice
PublikacjaW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Drawing maps with advice
PublikacjaRozważamy następujący problem obliczeniowy. Agent zostaje umieszczony w wierzchołku nieznanego mu grafu. Wierzchołki grafu są nierozróżnialne, natomiast krawędzie posiadają numery portów. Zadaniem agenta jest wyznaczenie mapy, tzn. obliczenie izomorficznej kopii grafu, lub obliczenie dowolnego drzewa spinającego grafu. Bez dodatkowej informacji zadań tych nie można wykonać. W artykule wyznaczamy oszacowania na minimalną liczbę...
-
Rozwój technologii SaaS.
PublikacjaWyjaśniono koncepcję usług informacyjnych w oparciu o modele przetwarzania rozproszonego i zespołowego. Przedstawiono podstawowe kategorie usług i protokoły wspomagające ich wykonanie. Podano sposób wykorzystania usług złożonych w realizacji różnego typu przedsięwzięć elektronicznych.
-
The usefulness of birch saps from the area of Podkarpacie to produce birch syrup
PublikacjaIn 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...
-
Colonization of germ-free mice with a mixture of three lactobacillus strains enhances the integrity of gut mucosa and ameliorates allergic sensitization
Publikacja -
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...
-
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...
-
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...
-
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...
-
Lower bound on the paired domination number of a tree
PublikacjaW pracy przedstawione jest ograniczenie dolne dla liczby dominowania parami oraz scharakteryzowane są wszystkie drzewa ekstremalne.
-
Complexity of weak acceptonic conditions in tree automata
PublikacjaRozważ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
PublikacjaExtended 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...
-
Tourism Investment Gaps in Poland
Publikacja -
Otopy classes of equivariant maps
PublikacjaW artykule definiuje się stopień topologiczny niezmienniczych odwzorowań lokalnych w przypadku gradientowym i niegradientowym. Wyniki dotyczą relacji pomiędzy tymi dwoma niezmiennikami topologicznymi.
-
On the space of equivariant local maps
Publikacja -
Indices of iterations of planar maps
PublikacjaArtykuł omawia najnowsze rezultaty badań dotyczące postaci indeksów punktu stałego iteracji odwzorowań planarnych.
-
AI in the creation of the satellite maps
PublikacjaSatellite and aerial imagery acquisition is a very useful source of information for remote monitoring of the Earth’s surface. Modern satellite and aerial systems provide data about the details of the site topography, its characteristics due to different criteria (type of terrain, vegetation cover, soil type and moisture content), or even information about emergency situations or disasters. The paper proposes and discusses the process...
-
Credit default swaps and banks
PublikacjaThis chapter aims to explore the evolving role of credit default swaps (CDS) in managing and transferring default risk from the perspective of banks from a holistic perspective. This chapter examines credit default swaps (CDSs) as derivative financial instruments that transfer credit risk on debt securities. While CDSs offer benefits such as risk management and risk trading, they also introduce potential systemic risks, as evidenced...
-
Lower bound on the weakly connected domination number of a tree
PublikacjaPraca 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
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...
-
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...
-
Lower bound on the distance k-domination number of a tree
PublikacjaW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Self Organizing Maps for Visualization of Categories
PublikacjaVisualization of Wikipedia categories using Self Organizing Mapsshows an overview of categories and their relations, helping to narrow down search domains. Selecting particular neurons this approach enables retrieval of conceptually similar categories. Evaluation of neural activations indicates that they form coherent patterns that may be useful for building user interfaces for navigation over category structures.
-
Fixed orbit index for equivariant maps
Publikacja -
Circular saws with closed chip grooves
PublikacjaW pracy przedstawiono analizę wpływu kształtu rowków wiórowych ostrzy piły tarczowej na sposób odprowadzania wiórów ze strefy skrawania. Zaprezentowano rozwiązanie konstrukcyjne piły tarczowej z domkniętymi rowkami wiórowymi
-
On the topology of spaces of partial and local maps
Publikacja -
Gradient otopies of gradient local maps
Publikacja -
Axsial run-out circular saws
PublikacjaW pracy przedstawiono podstawowe przyczyny i efekty bicia osiowego ostrzy pił w układzie przecinania na pilarkach tarczowych.
-
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...
-
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.
-
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...
-
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,...