Filters
total: 1945
filtered: 1392
-
Catalog
- Publications 1392 available results
- Journals 93 available results
- Conferences 2 available results
- People 83 available results
- Inventions 12 available results
- Projects 14 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 122 available results
- Events 12 available results
- Open Research Data 213 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: AKTYNOMYCYNA D
-
Synthesis of conjugates of muramyl dipeptide and nor-muramyl dipeptide derivatives with adenosine as potential immunosuppressant
PublicationZaprezentowano syntezę koniugatów adenozyny z pochodnymi muramylo- i nor-muramylodipeptydów zawierających w części peptydowej D-aminokwasy (D-Ala, D-Val, D-Ser, D-Pro, D-2-ABA). Jako substrat zastosowano rybozyd 6-chloropuryny, który łączono poprzez 1,2-diaminoetan z odpowiednimi pochodnymi MDP lub nor-MDP w obecności EDCI i HOBt. Struktury otrzymanych związków zostały potwierdzone widmami 1H i 13C NMR (500 MHz), widmami MS oraz...
-
Synthesis of conjugates of muramyl dipeptide and nor-muramyl dipeptide derivatives with adenosine as potential immunosuppressants
PublicationPrzedstawiono syntezę koniugatów pochodnych muramylodipeptydu (MDP) i nor-MDP z adenozyną jako potencjalnych związków o działaniu immunosupresyjnym. Jako substrat zastosowano rybozyd 6-chloropuryny, który łączonp poprzez 1,2-diaminoetan z pochodną MDP lub nor-MDP. Do syntezy wykorzystano pochodne MDP zawierające w części peptydowej D-aminokwasy (D-Ala, D-Val, D-Ser, D-Pro, D-2-ABA). Jako odczynniki sprzęgające zastosowano EDCI...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Allocation of tools to machines in a flexible machining cell. W: Computerintegrated manufacturing. Advanced design and management. Ed.: B. Skołud, D. Krenczyk. Warszawa: Wydaw. Nauk.-Tech.**2003 s. 486-493, 5 rys. 2 tabl.bibliogr. 10 poz. Przydział narzędzi do obrabiarek w elastycznym gnieździe obróbkowym.
PublicationPrzedstawiono zagadnienia modelowania i analizy przepływu narzędzi w wielo-maszynowym elastycznym gnieździe, zorientowanym na wytwarzanie przedmiotów klasy korpus. Zaproponowano oryginalną metodę i algorytmy współbieżnego sze-regowania zadań produkcyjnych i przydziału narzędzi w warunkach ograniczono-ści zasobów systemu. Wybrane strategie przydziału operacji technologicznych i adekwatnych zestawów narzędziowych poddano analizie...
-
On trees with equal domination and total outer-independent domination numbers
PublicationFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Distinguishing views in symmetric networks: A tight lower bound
PublicationThe 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.
-
Molekularne mechanizmy selektywności działania antybiotyku przeciwgrzybowe- go: estru metylowego N-metylo-N-D-fruktozylo amfoterycyny B.**2002, 108 s. 23 rys. 15 tab. bibliogr. 83 poz. maszyn. Rozprawa doktorska /17.04.2002/. P. Gdań., Wydz. Chemiczny. Promotor: prof. dr inż. E. Borowski.
Publication.
-
Modeling of flow phenomena on the mould plastic interface associated withpolymer injection. Trends Production Technol.**2002 Bd 3 s. 122-137, 11 rys Proceedings of the International Colloquium on Production Science. Gdańsk, April 15th 2002. Ed. D. Spaht. Modelowanie zjawisk zachodzących podczas wtrysku w strefie tworzywo-forma.
PublicationPodczas wtrysku występują w warstwie tworzywa przy ściance formy zjawiska,które są źródłem wad. Opisano powyższe zjawiska oraz zaprezentowano model zachowania się tworzywa w strefie przyściennej z wykorzystaniem symulacji komputerowej procesu wtrysku. Symulację wykonano na komputerach CI TASK przyuzyciu programu FIDAP. Ponadto przedstawiono wyniki badań doświadczalnych w postaci fotografii i profilogramów powierzchni, które...
-
Total restrained bondage in graphs
PublicationPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double 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. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Total outer-connected domination numbers of trees
PublicationNiech G=(V,E) będzie grafem bez wierzchołków izolowanych. Zbiór wierzchołków D nazywamy zbiorem dominującym totalnym zewnętrznie spójnym jeżli każdy wierzchołek grafu ma sąsiada w D oraz podgraf indukowany przez V-D jest grafem spójnym. Moc najmniejszego zbioru D o takich własnościach nazywamy liczbą dominowania totalnego zewnątrznie spójnego. Praca m.in. zawiera dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublicationFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
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,...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
On trees with double domination number equal to total domination number plus one
PublicationA 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. A vertex of a graph is said to dominate itself and all of its neighbors. A double 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. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Marcinkiewicz Averages of Smooth Orthogonal Projections on Sphere
PublicationWe construct a single smooth orthogonal projection with desired localization whose average under a group action yields the decomposition of the identity operator. For any full rank lattice \Gamma ⊂ R^d , a smooth projection is localized in a neighborhood of an arbitrary precompact fundamental domain R^d / \Gamma. We also show the existence of a highly localized smooth orthogonal projection, whose Marcinkiewicz average under the...
-
Kinetics of pollutants removal in vertical and horizontal flow constructed wetlands in temperate climate
PublicationThis paper reports a comparative study on kinetics of organic matter expressed as BOD5 and nitrogen removal in constructed wetlands operated in Poland. Analyzed data were collected at eight wetland systems, composed of subsurface flow beds: horizontal flow (HF) and vertical flow (VF), in different number and sequences. The analysis involved particularly mass removal rates (MRR) and first-order removal rate coefficients of BOD5...
-
On a Recurrence Arising in Graph Compression
PublicationIn 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 1p). A new node is created as long as...
-
Static Shunt PE Voltage-Quality Controllers
PublicationThis chapter focuses on power electronics (PE)-based solutions used in distribution networks for reduction of supply-voltage-quality deterioration, from long interruptions to the harmonics. Various PE devices and their combinations are addressed for particular or a range of voltage disturbances. A particular solution is applied taking into account demands for voltage quality and network configuration. In general, there are three...
-
Role of research and development in internationalization of high-tech firms: Empirical results from Poland
PublicationThe article focuses on the significance of research and development (R&D) in driving the internationalization of Polish high-tech firms. R&D is essential for businesses to remain competitive and adapt their products to the specific requirements of different markets. The study aims to investigate the relationship between R&D and the internationalization process of high-tech firms based in Poland, with a focus on the innovation context....
-
Impact of aeration conditions on the removal of low concentrations of nitrogen in a tertiary partially aerated biological filter
PublicationA submerged biological aerated filter (BAF) partially aerated was used to study the removal of low concentrations of ammonia nitrogen (0.3 g N/m3 to 30.5 g N/m3) typically found in nutrient enriched river and lake waters, and treated effluents. Four series of experiments were performed with a synthetic wastewater at ammonia loading rates between 6 g N/m3 d and 903 g N/m3 d and C/N ratios from 2 to 20. The results showed that ammonia...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
2-outer-independent domination in graphs
PublicationWe initiate the study of 2-outer-independent domination in graphs. 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 at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
X-ray diffraction and high-resolution NMR spectroscopy of methyl 3azido-2,3-dideoxy-ŕD-lyxo-hexopyranoside
PublicationOpisano strukturę 3-azydo-2,3 dideoksy-ŕ-d-lykso-heksopiranozydu metylu na podstawie danych otrzymanych przy pomocy rentgenowskiej analizy strukturalnej oraz wysokorozdzielczej spektroskopii magnetycznego rezonansu jądrowego. Przedyskutowano również wpływ pierścieniowego atomu tlenu na wartości stałych sprężeń atomów wodoru przy atomach C6 i C1 pierścienia 2-deoksy-D-lyksooraz-D-ksylo-heksopiranozydów.
-
Active Power Quality Controllers
PublicationDynamic Static Synchronous Compensator is the most important controller for distribution networks and probably in SEEN. It has been widely used since the 1990s to regulate system voltage precisely, improve voltage profile, reduce voltage harmonics, reduce transient voltage disturbances and load compensation. Rather than using conventional capacitors and inductors combined with fast switches, the D-STATCOM uses a power-electronics...
-
New insights into modeling two-step nitrification in activated sludge systems – The effects of initial biomass concentrations, comammox and heterotrophic activities
PublicationIn this study, the conventional two-step nitrification model was extended with complete ammonia oxidation (comammox) and heterotrophic denitrification on soluble microbial products. The data for model calibration/validation were collected at four long-term washout experiments when the solid retention time (SRT) and hydraulic retention time (HRT) were progressively reduced from 4 d to 1 d, with mixed liquor suspended solids (MLSS)...
-
Modelluntersuchungen zur Windeinwirkung auf stahlerne Doppelmantelbehalter
PublicationPodano wyniki badań w tunelu aerodynamicznym modeli zbiorników stalowych o podwójnym płaszczu. Badano modele zbiorników z dachem stałym i dachem pływającym. Stosunek wysokości płaszcza ''h'' do średnicy modelu ''d'' wynosi h/d= 0,25 lub h/d= 0,45 a różnica odległości pomiędzy płaszczem zewnętrznym dz a płaszczem wewnętrznym dw wyniosła dz/dw= 1,063; 1,125 oraz 1,200
-
Fast Collaborative Graph Exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Synchronization helps robots to detect black holes in directed graphs
PublicationPraca zawiera nowe wyniki dla problemu poszukiwania czarnej dziury w grafie skierowanym przez zbiór agentów. Czarna dziura jest węzłem niszczącym wszystkich wchodzącej do niej agentów. Pokazano, że w przypadku, gdy stopień wejściowy czarnej dziury wynosi D, do przeszukania grafu skierowanego w modelu synchronicznym wystarcza O(D 2^D) agentów. Wartość ta jest bliska znanemu z literatury oszacowaniu dolnemu Omega (2^D). W pracy pokazano...
-
Wytwarzanie biogazu z kiszonki Sucrosorgo 506
PublicationW pracy przeprowadzono badania eksperymentalne nad fermentacją metanową kiszonki sorgo cukrowego Sucrosorgo 506 (Sorghum saccharatum) metodą mokrą. Doświadczenie prowadzono w skali laboratoryjnym w reaktorze o objętości czynnej 6 dm3. Hydrauliczny czas zatrzymania wsadu surowcowego (HRT) oraz obciążenie ładunkiem organicznym (OLR) wynosiły odpowiednio 60 d i 1,31±0,10 kg s.m.o/m3·d. Temperatura fermentacji wynosiła 39C. W oparciu...
-
Energy policy and the role of bioenergy in Poland
PublicationPrzedstawiono sytuacje energetyczną kraju. Omówiono poszczególne sektory wytwarzania energii oraz zapotrzebowania na energię i paliwa. Omówiono przekształcenia sektorów energetycznych w Polsce na przestrzeni lat 1990-2002. Na tym tle przedstawiono techniczne, ekonomiczne, społeczne i prawne aspekty rozwoju energetyki źródeł odnawialnych a w szczególności opartych o bioenergię. Przedstawiono wnioski dla Polski płynące z dotychczasowych...
-
Smooth orthogonal projections on sphere.
PublicationWe construct a decomposition of the identity operator on the sphere S^d as a sum of smooth orthogonal projections subordinate to an open cover of S^d. We give applications of our main result in the study of function spaces and Parseval frames on the sphere.
-
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...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Clearing directed subgraphs by mobile agents
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
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,...
-
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...
-
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...
-
The Snow Team Problem
PublicationWe 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)...
-
Structure and properties of the exopolysaccharides produced by Pseudomonas mutabilis T6 and P. mutabilis ATCC 31014
PublicationThis paper presents a study on the purification, primary structure, and rheological properties of exopolysaccharides isolated from cultures of Pseudomonas mutabilis T6 and P. mutabilis ATCC 31014. Both polymers are exopolysaccharides of D-mannose. The mannan isolated from P. mutabilis T6 contains on average about 5% of residual b-D-glucose, in contrast to the mannan from P. mutabilis ATCC 31014, which contained only trace amounts...
-
On greedy graph coloring in the distributed model
PublicationArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Strefa podmiejska w warunkach zrównoważonego rozwoju.
PublicationNR DOKUM: D 73137
-
Cold-Active beta-Galactosidases: Sources, Biochemical Properties and Their Biotechnological Potential
Publicationbeta-D-Galactosidases have been studied extensively in terms of their application to a variety of industrial technologies. To date, considerable research efforts have been devoted to characterization of new cold-active beta-D-galactosidases which were isolated directly from selected species of bacteria and yeasts, as well as with the use of metagenomic approaches. This chapter will provide a review of current research towards cold-active...
-
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...
-
Systems of Nonlinear Fractional Differential Equations
PublicationUsing the iterative method, this paper investigates the existence of a unique solution to systems of nonlinear fractional differential equations, which involve the right-handed Riemann-Liouville fractional derivatives D(T)(q)x and D(T)(q)y. Systems of linear fractional differential equations are also discussed. Two examples are added to illustrate the results.
-
Fast collaborative graph exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
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...
-
Amygdalin: Toxicity, Anticancer Activity and Analytical Procedures for Its Determination in Plant Seeds
PublicationAmygdalin (D-Mandelonitrile 6-O--D-glucosido--D-glucoside) is a natural cyanogenic glycoside occurring in the seeds of some edible plants, such as bitter almonds and peaches. It is a medically interesting but controversial compound as it has anticancer activity on one hand and can be toxic via enzymatic degradation and production of hydrogen cyanide on the other hand. Despite numerous contributions on cancer cell lines, the clinical...