Filtry
wszystkich: 621
-
Katalog
- Publikacje 448 wyników po odfiltrowaniu
- Czasopisma 43 wyników po odfiltrowaniu
- Konferencje 31 wyników po odfiltrowaniu
- Osoby 28 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 17 wyników po odfiltrowaniu
- Wydarzenia 5 wyników po odfiltrowaniu
- Dane Badawcze 48 wyników po odfiltrowaniu
Wyniki wyszukiwania dla: combinatorial thinking
-
Formal Power Series and Algebraic Combinatorics
Konferencje -
EuroConference on Combinatorics, Graph Theory and Applications
Konferencje -
Workshop on Computational Graph Theory and Combinatorics
Konferencje -
W stronę spersonalizowanego miasta?
PublikacjaOd czasów Platona i Witruwiusza nie ustają wysiłki na rzecz dążenia do prawdy, dobra i piękna skupione wokół miasta jako idei politycznej i przestrzeni fundamentalnie egzystencjalnej. Towarzyszy im od wieków myślenie o idealnej organizacji i kompozycji miasta, o poczuciu podmiotowości mieszkańców i użytkowników, doświadczaniu przez nich czasu i przestrzeni. Szczególnie w ostatnich dekadach, gdy już nie przestrzeń, a czas i jego...
-
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...
-
Theoretical Study on Interactions of Bicyclic Vasopressin Analogues with Human Neurohypophyseal Hormone Receptors
Publikacja -
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 -
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...
-
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.
-
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...
-
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...
-
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...
-
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...
-
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.
-
Ewa Marjańska dr inż.
OsobyEwa Marjańska pracuje jako adiunkt na Politechnice Gdańskiej na Wydziale Zarządzania i Ekonomii. Uzyskała stopień doktora w dziedzinie nauk o towaroznawstwie. Jej zainteresowania naukowe koncentrują się przede wszystkim na metodach ilościowego pomiaru jakości, w tym analizie jakości żywności i systemach zarządzania jakością. Jest autorką artykułów opublikowanych w recenzowanych czasopismach o zasięgu międzynarodowym, m.in. Desalination...
-
Małgorzata Gawrycka dr hab.
OsobyMałgorzata Gawrycka, absolwentka Wydziału Zarządzania Uniwersytetu Gdańskiego, doktor habilitowana nauk ekonomicznych. W latach 2012-2020 prodziekan ds. dydaktyki Wydziału Zarządzania i Ekonomii Politechniki Gdańskiej. Obecnie dziekan Wydziału. Zainteresowania naukowe koncentrują się na zagadnieniach związanych z polityka makroekonomiczną państwa. W szczególności problematyka sytuacji na runku pracy, zmian demograficznych, kwalifikacji...
-
Trunked Radio Solutions for Special Application
PublikacjaIn the paper modern concepts of radio communication trunking-dispatch systems for special applications are presented. Basic standards of TETRA, DMR, and cdma2000 are mentioned. The aim of the paper is to present innovative trunking solutions based on the LTE system working both in FDD and TDD mode. The architecture of LTE trunked radio is shown as well as new services possible to implementation are described. The way of TETRA and...
-
Teaching architectural history through virtual reality
PublikacjaThe impact of implementing 3D models and virtual reality in teaching the theory of architecture and architectural history is the theme of this article. Virtual reality and easy-to-use 3D tools allow a whole historic object to be visualised. As a result, there is social and economic pressure to modernise present educational methods using this technology. Therefore, the authors have focused their research on an issue of significance...
-
Morse decompositions for a two-dimensional discrete neuron model (low resolution)
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Morse decompositions for a two-dimensional discrete neuron model (limited range)
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Morse decompositions for a two-dimensional discrete neuron model (full range)
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Design thinking - sem LETNI 2021/2022 sem II
Kursy Online -
Symposium On Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Konferencje -
Tighter bounds on the size of a maximum P3-matching in a cubic graph
PublikacjaW pracy pokazano, że największe P3-skojarzenie dla dowolnego grafu o n>16 wierzchołkach składa się z przynajmniej 117n/152 wierzchołków.
-
Counting Lattice Paths With Four Types of Steps
Publikacja -
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.
-
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...
-
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...
-
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...
-
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...
-
On trees attaining an upper bound on the total domination number
PublikacjaA 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. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
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...
-
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...
-
The Use of the Language of Mathematics as an Inspiration for Contemporary Architectural Design
PublikacjaThe purpose of the article is to present the evolution of the use of mathematical language as an inspiration for creating spatial, three-dimensional forms in art and architecture. The article focuses on the possibilities for art and architectural design ideas gained by contemporary mathematics, algorithms and computational parametric approach. The analysis of various examples represents the relationships between the composition...
-
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...
-
Pathological brain network activity: memory impairment in epilepsy
PublikacjaOur thinking, memory and cognition in general, relies upon precisely timed interactions among neurons forming brain networks that support cognitive processes. The surgical evaluation of drug-resistant epilepsy using intracranial electrodes provides a unique opportunity to record directly from human brain and to investigate the coordinated activity of cognitive networks. In this issue of Neurology®, Kleen and colleagues1 implicate...
-
Positive management of the university
PublikacjaPurpose: To demonstrate that contemporary universities may be improved by synthesis of strategic antinomies, i.e. seeking the possibility of combining opposite approaches to solving problems concerning university organization and management. Findings: That approach discounts the importance of building positive relationships between members of staff and undertaking activities intended to create a situation where the...
-
Comparison of High Performance Liquid Chromatography Methods with Different Detectors for Determination of Steroid Hormones in Aqueous Matrices
PublikacjaThis paper presents the development and comparison of procedures for the qualitative and quantitative determination of five estrogenic compounds (17-a-ethynylestradiol, estrone, estradiol, estriol, and progesterone) in drinking water and wastewater samples. Five extraction columns and two disks were tested for their efficiency. The C18 columns were superior on the basis of cost for solid phase extraction of drinking water or sewage....
-
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,...
-
Structural and Thermo-Mechanical Properties of Poly(ε-caprolactone) Modified by Various Peroxide Initiators
PublikacjaThe modification of poly(ε-caprolactone) (PCL) was successfully conducted during reactive processing in the presence of dicumyl peroxide (DCP) or di-(2-tert-butyl-peroxyisopropyl)-benzene (BIB). The peroxide initiators were applied in the various amounts of 0.5 or 1.0 pbw (part by weight) into the PCL matrix. The effects of the initiator type and its concentration on the structure and mechanical and thermal properties of PCL were...
-
A Universal Theory of Wisdom . A Mind - oriented Approach
PublikacjaThe purpose of the paper is to synthesize the issues of human wisdom in terms of minds which create knowledge-based judgment. We form a transdisciplinary, big-picture view of the wisdom of humans. Findings: Wisdom is the right judgment and choice in the context of the art of living. Practical implications: Wisdom can be developed within the set of minds. Social implications: To pursue wisdom in thinking and action, one must extend...
-
Curing characteristics, mechanical properties and morphology of butyl rubber filled with ground tire rubber (GTR)
PublikacjaThe results on testing application of ground tire rubber (GTR), as potential filler for butyl rubber, are pre- sented. The GTR content variation, within the range of 10–90 phr, was studied with respect to the vulcanization process, static mechanical properties (tensile strength, elongation-at-break, hardness and resilience), dynamic mechanical properties and the morphology of the obtained vulcanizates. Butyl rubber was characterized...
-
Southeastern International Conference on Combinatorics, Graph Theory, and Computing
Konferencje -
Aleksandra Parteka dr hab. inż.
OsobyAbout me: I am an associate professor and head of doctoral studies at the Faculty of Management and Economics, Gdansk University of Technology (GdanskTech, Poland). I got my MSc degree in Economics from Gdansk University of Technology (2003) and Universita’ Politecnica delle Marche (2005), as well as MA degree in Contemporary European Studies from Sussex University (2006, with distinction). I received my PhD in Economics...
-
Positive management of the university
PublikacjaAbstract: The prevailing view held at contemporary Polish universities is that their main goal is to achieve effects measured by indicators, which applies to each element of their mission: education, research and the third mission, whereas the means to accomplish this goal consists of increasing the requirements and motivating by the “carrot and stick” approach. That approach discounts the importance of building a positive relationship...
-
Database of the estimations of the numbers of simplices of triangulation of some classical Lie groups
Dane BadawczeIt is know that any smooth manifold can be triangulated. The number of simplices of triangulation of a given manifold depends on its topological and combinatorial structure. The data consists of the lower bounds for the numbers of simplices of each dimension of any triangulation of classical Lie groups U(n), SU(n), Sp(n), and SO(n) for n up to 25. Each...