Filtry
wszystkich: 3887
-
Katalog
- Publikacje 3083 wyników po odfiltrowaniu
- Czasopisma 56 wyników po odfiltrowaniu
- Konferencje 28 wyników po odfiltrowaniu
- Osoby 19 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Kursy Online 8 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 691 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: COMBINATORIAL BOUND
-
Marek Czachor prof. dr hab.
Osoby -
The Potential of Greed for Independence
PublikacjaThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
Morse decompositions for a population model with harvesting. Case Ha-Se: Harvesting adults only, equal survival rates of juveniles and adults
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Morse decompositions for a population model with harvesting. Case He-S1: Equal harvesting of juveniles and adults, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Morse decompositions for a population model with harvesting. Case Ha-S1: Harvesting adults only, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Morse decompositions for a population model with harvesting. Case He-Se: Equal harvesting and equal survival rates of juveniles and adults
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Morse decompositions for a population model with harvesting. Case Hj-Se: Harvesting juveniles only, equal survival rates of juveniles and adults
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Morse decompositions for a population model with harvesting. Case Hj-S1: Harvesting juveniles only, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Extending Service Selection Algorithms with Interoperability Analysis
PublikacjaApplication development by integration of existing, atomic services reduces development cost and time by extensive reuse of service components. In Service Oriented Architecture, there exist alternative versions of services supplying the same functionality but differing in Quality of Service (QoS) attributes, which enables developers to select services with optimal QoS. Existing algorithms of service selection focus on the formal...
-
An Influence of the Aromatic Side Chains Conformations in Positions 2 and 3 of Vasopressin Analogs on Interactions with Vasopressin and Oxytocin Receptors
Publikacja -
Molecular Modeling of Meta II Rhodopsin
Publikacja -
Molecular Modeling of Interaction of the Vasopressin Analogs with Vasopressin and Oxytocin Receptors
Publikacja -
Study of New Oxytocin Antagonist Barusiban (Fe200 440) Affinity Toward Human Oxytocin Receptor Versus Vasopressin V1a and V2 Receptors - Molecular Dynamics Simulation in POPC Bilayer
Publikacja -
Molecular Dynamics of Complexes of Atosiban with Neurohypophyseal Receptors in the Fully Hydrated Phospholipid Bilayer
Publikacja -
Theoretical Study on Interactions of Bicyclic Vasopressin Analogues with Human Neurohypophyseal Hormone Receptors
Publikacja -
Packing [1,Delta]-factors in graphs of small degree
PublikacjaRozważano problem znalezienia w grafie zadanej liczby k krawędziowo rozłącznych [1,Delta]-faktorów, gdzie Delta oznacza stopień grafu. Problem ten można rozwiązać w czasie liniowym dla k=2, jest on jednak NP-trudny dla każdego k>=3. Pokazano, że wariant minimalizacjny problemu dla k=2 jest NP-trudny dla grafów planarnych podkubicznych, jednak w ogólności istnieje algorytm (42 Delta - 30) / (35 Delta - 21) - aproksymacyjny.
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
On zero-error codes produced by greedy algorithms
PublikacjaWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Computational aspects of greedy partitioning of graphs
PublikacjaIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Zero-visibility cops and robber and the pathwidth of a graph
PublikacjaWe examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublikacjaLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Imunofan—RDKVYR Peptide—Stimulates Skin Cell Proliferation and Promotes Tissue Repair
PublikacjaRegeneration and wound healing are vital to tissue homeostasis and organism survival. One of the biggest challenges of today’s science and medicine is finding methods and factors to stimulate these processes in the human body. Effective solutions to promote regenerative responses will accelerate advances in tissue engineering, regenerative medicine, transplantology, and a number of other clinical specialties. In this study, we...
-
Effect of temperature and composition on physical properties of deep eutectic solvents based on 2-(methylamino)ethanol – measurement and prediction
PublikacjaNovel deep eutectic solvents were synthesized using 2-(methylamino)ethanol as hydrogen bond donor with tetrabutylammonium bromide or tetrabutylammonium chloride or tetraethylammonium chloride as hydrogen bond acceptors. Mixtures were prepared at different molar ratios of 1:6, 1:8 and 1:10 salt to alkanolamine and then Fourier Transform Infrared Spectroscopy measurements were performed to confirm hydrogen bonds interactions between...
-
Ryszard Woźniak dr inż.
OsobyJest absolwentem Wydziału Mechanicznego i Organizacji Politechniki Lubelskiej, gdzie w 1984 uzyskał tytuł magistra inżyniera mechanika w zakresie Mechaniki specjalności Samochody i Ciągniki. W 2002 roku w Politechnice Gdańskiej obronił pracę doktorską na temat: "Hałas opon w warunkach występowania znacznych sił stycznych w strefie styku opony z jezdnią" i uzyskał stopień naukowy doktora nauk technicznych w zakresie budowy i eksploatacji...
-
Symposium On Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Konferencje -
Non-Least Square GNSS Positioning Algorithm for Densely Urbanized Areas
PublikacjaThe paper introduces an essentially new algorithm for calculating the GNSS position as an alternative to the least-square method. The proposed approach can be widely applied to any positioning method that uses multiple position lines for position calculation and is an example ofhow using a numerical solution can improve position accuracy without access to historical data. In essence, the method is based on the adaptation of the...
-
Cure kinetics of epoxy/MWCNTs nanocomposites: Isothermal calorimetric and rheological analyses
PublikacjaA combinatorial route has been applied in cure kinetics study of epoxy nanocomposites containing multi-walled carbon nanotubes (MWCNTs) based on differential scanning calorimetry and rheokinetic analyses under isothermal conditions. Pristine and amine-modified MWCNTs bearing primary and secondary amines were used at very low concentrations (0.1 and 0.3 wt.% based on epoxy weight). Model-free and model-fitting methods were applied...
-
Counting Lattice Paths With Four Types of Steps
Publikacja -
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Some Progress on Total Bondage in Graphs
PublikacjaThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Estimates for minimal number of periodic points for smooth self-maps of simply-connected manifolds
Dane BadawczeWe consider a closed smooth connected and simply-connected manifold of dimension at least 4 and its self-map f. The topological invariant Dr[f] is equal to the minimal number of r-periodic points in the smooth homotopy class of f. We assume that r is odd and all coefficients b(k) of so-called periodic expansion of Lefschetz numbers of iterations are...
-
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...
-
Interoperability Constraints in Service Selection Algorithms
PublikacjaIn Service Oriented Architecture, composite applications are developed by integration of existing, atomic services that may be available in alternative versions realizing the same functionality but having different Quality of Service (QoS) attributes. The development process requires effective service selection algorithms that balance profits and constraints of QoS attributes. Additionally, services operate in a heterogeneous environment,...
-
Imunofan - RDKVYR peptide - stimulates skin cell proliferation and promotes tissue repair
PublikacjaRegeneration and wound healing are vital to tissue homeostasis and organism survival. One of the biggest challenges of today's science and medicine is finding methods and factors to stimulate these processes in the human body. Effective solutions to promote regenerative responses will accelerate advances in tissue engineering, regenerative medicine, transplantology, and a number of other clinical...
-
Modelling and simulation of GPU processing in the MERPSYS environment
PublikacjaIn this work, we evaluate an analytical GPU performance model based on Little's law, that expresses the kernel execution time in terms of latency bound, throughput bound, and achieved occupancy. We then combine it with the results of several research papers, introduce equations for data transfer time estimation, and finally incorporate it into the MERPSYS framework, which is a general-purpose simulator for parallel and distributed...
-
Hydration of N-Hydroxyurea from Ab Initio Molecular Dynamics Simulations
PublikacjaN-Hydroxyurea (HU) is an important chemotherapeutic agent used as a first-line treatment in conditions such as sickle cell disease and β-thalassemia, among others. To date, its properties as a hydrated molecule in the blood plasma or cytoplasm are dramatically understudied, although they may be crucial to the binding of HU to the radical catalytic site of ribonucleotide reductase, its molecular target. The purpose of this work...
-
Igor Garnik dr inż.
OsobyJest absolwentem Wydziału Elektroniki Politechniki Gdańskiej (1992). Z Politechniką Gdańską związany zawodowo od 1997 roku – zatrudniony najpierw jako asystent w Zakładzie Ergonomii i Eksploatacji Systemów Technicznych na Wydziale Zarządzania i Ekonomii, a następnie – po uzyskaniu stopnia doktora w 2006 roku jako adiunkt. W latach 2009–2015 pełnił funkcję koordynatora Bałtyckiego Festiwalu Nauki na Wydziale Zarządzania i Ekonomii....
-
Southeastern International Conference on Combinatorics, Graph Theory, and Computing
Konferencje -
Analiza osadów dennych pod kątem ich właściwości nawozowych
PublikacjaThe analysis of bottom sediments in terms of their fertilizing properties. In paper the characterize of sediments as product to nature usage was done. Analyzed material was taken from ecological treatment system located in wastewater treatment plant in Swarzewo (Pomerania Region) about flow Q= 6000 m3/d. Measurements of dry matter and organic matter content, as well as nitrogen concentrations and phosphorus fractions: loosely...
-
Infinite chromatic games
PublikacjaIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
Comprehensive evaluation of physical properties and carbon dioxide capacities of new 2-(butylamino)ethanol-based deep eutectic solvents
PublikacjaThe aim of this research was to assess the impact of the components of alkanolamine deep eutectic solvents (DESs) on the physical properties of those DESs and their carbon dioxide capacity. To achieve this goal, novel deep eutectic solvents were synthesized by using 2-(butylamino)ethanol (BAE) as the hydrogen bond donor (HBD), along with tetrabutylammonium bromide TBAB), tetrabutylammonium chloride (TBAC), or tetraethy- lammonium...
-
Stochastic intervals for the family of quadratic maps
Dane BadawczeNumerical analysis of chaotic dynamics is a challenging task. The one-parameter families of logistic maps and closely related quadratic maps f_a(x)=a-x^2 are well-known examples of such dynamical systems. Determining parameter values that yield stochastic-like dynamics is especially difficult, because although this set has positive Lebesgue measure,...
-
The complexity of node blocking for dags
PublikacjaRozważamy następującą grę (pomiędzy dwoma graczami) kombinatoryczną o nazwie ''node blocking''. Dany jest graf skierowany. Każdy wierzchołek może być zajęty przez co najwyżej jeden token. Wyróżniamy dwa kolory tokenów, biały i czarny, każdy gracz może przemieszczać tylko własne tokeny. Gracze wykonują ruchy naprzemiennie. Ruch polega na wyborze dowolnego tokena własnego koloru i przesunięciu go na dowolnego niezajętego przez inny...
-
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets
PublikacjaThis work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry...
-
Comparison and Analysis of Service Selection Algorithms
PublikacjaIn Service Oriented Architecture, applications are developed by integration of existing services in order to reduce development cost and time. The approach, however, requires algorithms that select appropriate services out of available, alternative ones. The selection process may consider both optimalization requirements, such as maximalization of performance, and constraint requirements, such minimal security or maximum development...
-
Structural and dynamic properties of water within the solvation layer around various conformations of the glycine-based polypeptide
PublikacjaSeveral conformations of the solvated glycine-based polypeptides were investigated using molecular dynamics simulations. Some properties of water in the neighbouring space around these molecules were investigated. It was found, that water forms a well-defined layer - the first solvation shell - around the peptide molecule, and thickness of this layer is independent of the peptide structure, and it equals to approximately 0.28 nm....