Wyszukiwarka
Filtry
wszystkich: 637
wybranych: 458
-
Katalog
- Publikacje 458 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
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 20 wyników po odfiltrowaniu
- Wydarzenia 6 wyników po odfiltrowaniu
- Dane Badawcze 49 wyników po odfiltrowaniu
Filtry wybranego katalogu
Wyniki wyszukiwania dla: combinatorial thinking
-
On the connected and weakly convex domination numbers
PublikacjaIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds
PublikacjaFor a given self-map f of M, a closed smooth connected and simply-connected manifold of dimension m 4, we provide an algorithm for estimating the values of the topological invariant D^m_r [f], which equals the minimal number of r-periodic points in the smooth homotopy class of f. Our results are based on the combinatorial scheme for computing D^m_r [f] introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013),...
-
Zarządzanie informacyjnym środowiskiem pracy
PublikacjaCel. Niniejsza praca ma na celu wskazanie zależności pomiędzy zróżnicowanym poziomem zaangażowania projektantów w wykorzystanie Design Thinking w projektowaniu usług i kształtowaniu środowiska pracy projektantów a efektami ich pracy. Celem przeprowadzonych badań była identyfikacja czynników środowiskowych stymulujących efektywność pracy projektanta nowej usługi. Metoda/podejście. W środowisku akademickim w trzech grupach przyszłych projektantów...
-
Więcej niż odchudzanie. Istota koncepcji zarządzania Lean
PublikacjaArtykuł opisuje koncepcję Lean z punktu widzenia pracownika i metod zarządzania zasobami ludzkimi. Charakteryzuje tzw. Lean Thinking, czyli szczupłe myślenie towarzyszące technicznym zmianom związanym z wdrażaniem narzędzi wykorzystywanych przez koncepcję Lean.
-
Regenarative tourism – between theory and practice
PublikacjaPurpose: The aim of this article is to present a shift in thinking in terms of implementing the systems and practices needed to transition to a regenerative approach in tourism. The article aims to provide concrete ways to change thinking and move towards a regenerative paradigm in the tourism industry. Design/methodology/approach: This viewpoint paper defines regenerative tourism and explores its principles and the possibilities...
-
Eye-tracking Web Usability Research
PublikacjaIn this paper we present the results of a study that aims to evaluate the usability of three selected web services, based on eye–tracking and thinking aloud techniques. The gathered comments and observations, recapitulated and supported by particular measures, allow us to discover and describe typical user behavior pertaining to given tasks to solve.
-
Computations of the least number of periodic points of smooth boundary-preserving self-maps of simply-connected manifolds
PublikacjaLet $r$ be an odd natural number, $M$ a compact simply-connected smooth manifold, $\dim M\geq 4$, such that its boundary $\partial M$ is also simply-connected. We consider $f$, a $C^1$ self-maps of $M$, preserving $\partial M$. In [G. Graff and J. Jezierski, Geom. Dedicata 187 (2017), 241-258] the smooth Nielsen type periodic number $D_r(f;M,\partial M)$ was defined and proved to be equal to the minimal number of $r$-periodic points...
-
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...
-
Packing Three-Vertex Paths in 2-Connected Cubic Graphs
PublikacjaW pracy rozważano problem rozmieszczanie ścieżek P3 w 2-spójnych grafach 3-regularnych. Pokazano, że w 2-spójnym grafie 3-regularnym o n wierzchołkach można zawsze pokryć 9/11 n wierzchołków przez ścieżki P3; podano także odpowiednie oszacowania górne.
-
The complexity of list ranking of trees
PublikacjaUporządkowane kolorowanie grafu polega na takim etykietowaniu jego wierzchołków, aby każda ścieżka łącząca dwa wierzchołki o tym samym kolorze zawierała wierzchołek o kolorze wyższym. Jeśli każdy wierzchołek posiada dodatkowo listę dozwolonych dla niego etykiet, to mówimy wówczas o uporządkowanym listowym kolorowaniu wierzchołków. W pracy wskazano szereg klas grafów, dla których problem jest trudny: pełne drzewa binarne, drzewa...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublikacjaThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
On trees with double domination number equal to total domination number plus one
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. 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,...
-
The hat problem on cycles on at least nine vertices
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet 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...
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
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 -
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.
-
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 -
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...
-
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.
-
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...
-
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...
-
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...
-
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...
-
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,...
-
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....
-
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...