Wyszukiwarka
Wyniki wyszukiwania dla: EQIUTABLE COLORING CONJECTURE
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Hat problem on odd cycles
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 a win. In this version every player can...
-
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines
PublikacjaThe goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
-
Marek Kubale prof. dr hab. inż.
OsobyDetails concerning: Qualifications, Experiences, Editorial boards, Ph.D. theses supervised, Books, and Recent articles can be found at http://eti.pg.edu.pl/katedra-algorytmow-i-modelowania-systemow/Marek_KubaleGoogle ScholarSylwetka prof. Marka Kubalego Prof. Marek Kubale pracuje na Wydziale ETI Politechniki Gdańskiej nieprzerwanie od roku 1969. W tym czasie napisał ponad 150 prac naukowych, w tym ponad 40 z listy JCR. Ponadto...
-
A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence
PublikacjaWe resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the satisfiability problem. Knuth's recurrence resembles recurrences arising in the analysis of tries, in particular PATRICIA tries, and asymmetric leader election. We solve Knuth's recurrence exactly and asymptotically, using analytic techniques such as the Mellin transform and analytic depoissonization.
-
On structural physical approximations and entanglement breaking maps
PublikacjaVery recently, a conjecture saying that the so-called structural physical approximations (SPAs) to optimal positive maps (optimal entanglement witnesses) give entanglement breaking (EB) maps (separable states) has been posed (Korbicz et al 2008 Phys. Rev. A 78 062105). The main purpose of this contribution is to explore this subject. First, we extend the set of entanglement witnesses supporting the conjecture. Then, we ask whether...
-
On some open questions for Ramsey and Folkman numbers
PublikacjaWe discuss some of our favorite open questions about Ramsey numbers and a related problem on edge Folkman numbers. For the classical two-color Ramsey numbers, we first focus on constructive bounds for the difference between consecutive Ramsey numbers. We present the history of progress on the Ramsey number R(5,5) and discuss the conjecture that it is equal to 43.
-
Equitable colorings of some variation of corona products of cubic graphs
PublikacjaThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Fixed point indices of iterates of a low-dimensional diffeomorphism at a fixed point which is an isolated invariant set
PublikacjaLet f be an R^n-diffeomorphism, where n = 2, 3, for which {0} is an isolated invariant set. We determine all possible forms of the sequences of fixed point indices of iterates of f at 0, {ind(f n, 0)}_n, confirming in R3 the conjecture of Ruiz del Portal and Salazar (J Differ Equ 249, 989–1013, 2010).
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
Fixed point indices of iterated smooth maps in arbitrary dimension
PublikacjaWe give a complete description of possible sequences ofindices of iterations of f at an isolated fixed point, answering inaffirmative the Chow, Mallet-Paret and Yorke conjecture posed in[S.N. Chow, J. Mallet-Parret, J.A. Yorke, A periodic point index whichis a bifurcation invariant, in: Geometric Dynamics, Rio de Janeiro,1981, in: Lecture Notes in Math., vol. 1007, Springer, Berlin, 1983,pp. 109-131].
-
On relations between gradient and classical equivariant homotopy groups of spheres
PublikacjaWe investigate relations between stable equivariant homotopy groups of spheres in classical and gradient categories. To this end, the auxiliary category of orthogonal equivariant maps, a natural enlargement of the category of gradient maps, is used. Our result allows for describing stable equivariant homotopy groups of spheres in the category of orthogonal maps in terms of classical stable equivariant groups of spheres with shifted...
-
Periodic Points for Sphere Maps Preserving MonopoleFoliations
PublikacjaLet S^2 be a two-dimensional sphere. We consider two types of its foliations with one singularity and maps f:S^2→S^2 preserving these foliations, more and less regular. We prove that in both cases f has at least |deg(f)| fixed points, where deg(f) is a topological degree of f. In particular, the lower growth rate of the number of fixed points of the iterations of f is at least log|deg(f)|. This confirms the Shub’s conjecture in...
-
Performance evaluation of unified memory and dynamic parallelism for selected parallel CUDA applications
PublikacjaThe aim of this paper is to evaluate performance of new CUDA mechanisms—unified memory and dynamic parallelism for real parallel applications compared to standard CUDA API versions. In order to gain insight into performance of these mechanisms, we decided to implement three applications with control and data flow typical of SPMD, geometric SPMD and divide-and-conquer schemes, which were then used for tests and experiments. Specifically,...
-
A construction for the hat problem on a directed graph
PublikacjaA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
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...
-
Early Stages of RNA-Mediated Conversion of Human Prions
PublikacjaPrion diseases are characterized by the conversion of prion proteins from a PrPC fold into a disease-causing PrPSC form that is self-replicating. A possible agent to trigger this conversion is polyadenosine RNA, but both mechanism and pathways of the conversion are poorly understood. Using coarse-grained molecular dynamic simulations we study the time evolution of PrPC over 600 μs. We find that both the D178N mutation and interacting...
-
Periodic expansion in determining minimal sets of Lefschetz periods for Morse–Smale diffeomorphisms
PublikacjaWe apply the representation of Lefschetz numbers of iterates in the form of periodic expansion to determine the minimal sets of Lefschetz periods of Morse–Smale diffeomorphisms. Applying this approach we present an algorithmic method of finding the family of minimal sets of Lefschetz periods for Ng, a non-orientable compact surfaces without boundary of genus g. We also partially confirm the conjecture of Llibre and Sirvent (J Diff...
-
Rearrangeability in multicast Clos networks is NP-complete
PublikacjaPrzestrajalność w polach Closa z połączeniami jeden do jeden jest problemem wielomianowym. W pracy pokazano, że w polach z połączeniami jeden do wiele problem ten jest NP zupełny.Three-stage elos networks are commutation networks with circuit switching. So far, graph theory has been very useful tool for solving issues related to these networks with unicast connections. This is so because if elos network is represented as a bipartite...
-
E-cohomological Conley index
PublikacjaIn this thesis we continue with developing the E-cohomological Conley index which was introduced by A.Abbondandolo. In particular, we generalize the index to non-gradient flows, we show that it an possesses additional multiplicative structure and we prove the continuation principle. Then, using continuation principle, we show how the computation of the E-cohomological Conley index can be reduced to the computation of the classical...
-
A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks
PublikacjaIn 2006 Chen and Hwang gave a necessary and sufficient condition under which a three-stage Clos network is rearrangeable for broadcast connections. Assuming that only crossbars of the first stage have no fan-out property, we give similar conditions for f-cast Clos networks, where f is an arbitrary but fixed invariant of the network. Such assumptions are valid for some practical switching systems, e.g. high-speed crossconnects....
-
Conjectured strong complementary-correlations tradeoff
PublikacjaWe conjecture uncertainty relations that restrict correlations between the results of measurements performed by two separate parties on a shared quantum state. The first uncertainty relation bounds the sum of two mutual informations when one party measures a single observable and the other party measures one of two observables. The uncertainty relation does not follow from the Maassen-Uffink uncertainty relation and is much stronger...
-
IZOLACJA I IDENTYFIKACJA NATURALNYCH SUBSTANCJI BARWIĄCYCH OBECNYCH W PRÓBKACH FARB ARTYSTYCZNYCH I TKANINACH POCHODZENIA HISTORYCZNEGO
PublikacjaNatural organic dyes are group of substances that belong to various types of chemical compounds. The most commonly used in paintings and dyeing textiles were naturally occurring dyestuffs from group of anthraquinones, flavones and indigoid dyes. Identification of coloring substances present in historical artistic paints provides relevant information for a wide range of specialists dealing with works of art and in the field of conservation science....
-
The Effect of Full-Cell Impregnation of Pine Wood (Pinus sylvestris L.) on Changes in Electrical Resistance and on the Accuracy of Moisture Content Measurement Using Resistance Meters
PublikacjaThe impact of the full-cell impregnation of pine wood was investigated with respect to changes in electrical resistance and the accuracy of moisture content measurement. This study compared the resistance of impregnated and untreated pine timber harvested from the northern part of Poland (Pomeranian region). The wood was impregnated by the vacuum-pressure method. The preservative (TANALITH E 3475) and coloring (TANATONE 3950) agents...
-
Towards the boundary between easy and hard control problems in multicast Clos networks
PublikacjaIn this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially...
-
On Symmetry of Uniform and Preferential Attachment Graphs
PublikacjaMotivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant number m of existing ones according to some attachment scheme. We prove symmetry results for m=1 and 2 , and we conjecture that for m≥3 , both models yield asymmetry with high...
-
The symmetric extendibility of quantum states
PublikacjaStudies on the symmetric extendibility of quantum states have become particularly important in the context of the analysis of one-way quantum measures of entanglement, and the distillability and security of quantum protocols. In this paper we analyze composite systems containing a symmetric extendible part, with particular attention devoted to the one-way security of such systems. Further, we introduce a new one-way entanglement...
-
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 the size of identifying codes in triangle-free graphs
PublikacjaIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Copper Slag as a Potential Waste Filler for Polyethylene-Based Composites Manufacturing
PublikacjaThe present study aimed to analyze the application of waste material from copper production– copper slag (ŻŻL) as filler for composites based on the high-density polyethylene (HDPE). Copper slag filler was introduced in the amounts of 1–20 wt%, and its influence on the appearance (color analysis), chemical structure (Fourier-transform infrared (FTIR) spectroscopy), microstructure (optical microscopy), as well as static (tensile...
-
Methodology for Text Classification using Manually Created Corpora-based Sentiment Dictionary
PublikacjaThis paper presents the methodology of Textual Content Classification, which is based on a combination of algorithms: preliminary formation of a contextual framework for the texts in particular problem area; manual creation of the Hierarchical Sentiment Dictionary (HSD) on the basis of a topically-oriented Corpus; tonality texts recognition via using HSD for analysing the documents as a collection of topically completed fragments...
-
Progress towards a unified approach to entanglement distribution
PublikacjaEntanglement distribution is key to the success of secure communication schemes based on quantum mechanics, and there is a strong need for an ultimate architecture able to overcome the limitations of recent proposals such as those based on entanglement percolation or quantum repeaters. In this work we provide a broad theoretical background for the development of such technologies. In particular, we investigate the question of whether...
-
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...
-
Joanna Raczek dr inż.
OsobyWykształcenie 1997 -- 2001 Studia inżynierskie, Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska. Kierunek: Matematyka, specjalność: Matematyka Stosowana. 2001 -- 2003 Studia magisterskie, Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska. Kierunek: Matematyka, specjalność: Matematyka Stosowana. 2000 -- 2004 Studia inżynierskie, Wydział Elektroniki, Informatyki i Telekomunikacji,...
-
Clonal selection in discrete optimization
PublikacjaW rozprawie zajmujemy się efektywnymi metodami przybliżonego rozwiązywania problemów optymalizacji dyskretnej, a w szczególności algorytmami opartymi na metodzie selekcji klonalnej (SK), należącymi do kategorii sztucznych systemów immunologicznych. Techniki optymalizacji to znaczące pole badań w informatyce, a niektóre ze starszych technik, takie jak algorytmy genetyczne, symulowane wyżarzanie czy przeszukiwanie tabu, stały się...
-
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
PublikacjaWe study the classical and quantum values of a class of one-and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR(XOR-d) games we study are a subclass of the well-known linear games. We introduce a 'constraint graph' associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublikacjaThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Żółte barwniki organiczne w XIX-wiecznych farbach Jana Matejki - identyfikacja substancji barwiących, nośników, oraz wypełniaczy
PublikacjaNaturalne barwniki organiczne można znaleźć w wielu obiektach dziedzictwa kulturowego. Identyfikacja substancji barwiących obecnych w farbach historycznych dostarcza istotnych informacji dla wielu specjalistów zaangażowanych w naukę o sztuce. Identyfikacja składu farb pozwala na zastosowanie odpowiednich procedur dotyczących renowacji i konserwacji historycznych dzieł sztuki. Informacje te pozwalają na ich renowację zgodnie z decyzjami...
-
Towards a classification of networks with asymmetric inputs
PublikacjaCoupled cell systems associated with a coupled cell network are determined by (smooth) vector fields that are consistent with the network structure. Here, we follow the formalisms of Stewart et al (2003 SIAM J. Appl. Dyn. Syst. 2, 609–646), Golubitsky et al (2005 SIAM J. Appl. Dyn. Syst. 4, 78–100) and Field (2004 Dyn. Syst. 19, 217–243). It is known that two non-isomorphic n-cell coupled networks can determine the same sets of...
-
A multithreaded CUDA and OpenMP based power‐aware programming framework for multi‐node GPU systems
PublikacjaIn the paper, we have proposed a framework that allows programming a parallel application for a multi-node system, with one or more GPUs per node, using an OpenMP+extended CUDA API. OpenMP is used for launching threads responsible for management of particular GPUs and extended CUDA calls allow to manage CUDA objects, data and launch kernels. The framework hides inter-node MPI communication from the programmer who can benefit from...
-
Scheduling of compatible jobs on parallel machines
PublikacjaThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...