Filters
total: 882
-
Catalog
Search results for: CATEGORY GRAPH
-
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
PublicationWe study two variants of delivery problems for mobile robots sharing energy. Each mobile robot can store at any given moment at most two units of energy, and whenever two robots are at the same location, they can transfer energy between each other, respecting the maximum capacity. The robots operate in a simple graph and initially each robot has two units of energy. A single edge traversal by an robot reduces its energy by one...
-
Preface of guest editors
PublicationA special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 12th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 16-21 September 2007 in Karpacz, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, 2003 and 2005 in Karpacz. About 70 participants formed the audience of six invited lectures and 68...
-
Morse decompositions for a two-patch vaccination model
Open Research DataThis dataset contains selected results of rigorous numerical computations described in Section 5 of the paper "Rich bifurcation structure in a two-patch vaccination model" by D.H. Knipl, P. Pilarczyk, G. Röst, published in SIAM Journal on Applied Dynamical Systems (SIADS), Vol. 14, No. 2 (2015), pp. 980–1017, doi: 10.1137/140993934.
-
Labeler-hot Detection of EEG Epileptic Transients
PublicationPreventing early progression of epilepsy and sothe severity of seizures requires effective diagnosis. Epileptictransients indicate the ability to develop seizures but humansoverlook such brief events in an electroencephalogram (EEG)what compromises patient treatment. Traditionally, trainingof the EEG event detection algorithms has relied on groundtruth labels, obtained from the consensus...
-
On the Hat Problem on the Cycle C7
PublicationThe 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...
-
Elgold intermediate: raw texts
Open Research DataThe dataset contains raw texts scrapped from various internet sources which were used for creating the Elgold dataset.
-
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,...
-
A survey on known values and bounds on the Shannon capacity
PublicationIn this survey we present exact values and bounds on the Shannon capacity for different classes of graphs, for example for regular graphs and Kneser graphs. Additionally, we show a relation between Ramsey numbers and Shannon capacity.
-
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...
-
Software tool for modelling of mechatronic systems with elastic continua
PublicationThe paper presents a systematic computational package for modelling and analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The constructed computer program enables the frequency domain analysis of a class of linear systems and to obtain reduced order model in the form of bond graph. Obtained modal bond graph can be directly exported into 20-Sim package to further processing including nonlinear...
-
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,...
-
Weighted 2-sections and hypergraph reconstruction
PublicationIn the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...
-
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublicationIn the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
-
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...
-
Self diagnostics using smart glasses - preliminary study
Publicationn this preliminary study we analyzed the possibility of the reliable measurement of biomedical signals with some potential hardware extensions of smart glasses. Using specially designed experimental prototypes four category of biomedical signals were measured: electrocardiograms, electromyograms, electroencephalograms and respiration waveforms. Experi- ments with volunteers proved that using even simple construc- tion of sensors...
-
Load test of new European record holder in span length among extradosed type bridges
PublicationThe article presents acceptance load tests of a newly built extradosed MS-3 bridge located along the national road DK-16 near Ostróda (Poland). The structure features significant dimension in European reference scale. It is a new record holder in span length regarding this distinct bridge category. Its length ranges 206 m. Static and dynamic load tests were performed here. The program was extended by entire structural laser scanning...
-
The Potential of Greed for Independence
PublicationThe 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...
-
Continuation classes for a two-patch vaccination model
Open Research DataThis dataset contains selected results of rigorous numerical computations described in Section 5 of the paper "Rich bifurcation structure in a two-patch vaccination model" by D.H. Knipl, P. Pilarczyk, G. Röst, published in SIAM Journal on Applied Dynamical Systems (SIADS), Vol. 14, No. 2 (2015), pp. 980–1017, doi: 10.1137/140993934.
-
Compensation of Voltage Drops in Trolleybus Supply System Using Battery-Based Buffer Station
PublicationThis paper analyzes the results of a trial operation of a battery-based buffer station supporting a selected section of trolleybus power supply systems in Pilsen, Czech Republic. The buffer station aims to prevent the catenary from excessive voltage drops in a part of the route that is most remote from the traction substation. Compensation of voltage drops is carried out by continuously measuring the catenary voltage and injecting...
-
Analiza spostrzeżeń podczas audytów w przedsiębiorstwach z branży spożywczej
PublicationAnalizowano dane z 54 przedsiębiorstw potwierdzających zgodność z wdrożonym systemem ISO 22000 w latach 2005–2013 przez jednostkę certyfikującą DNV GL–BA. Przedstawiono najczęściej spotykane kategorie niezgodności stwierdzane podczas audytów certyfikujących w przedsiębiorstwach należących do łańcucha żywnościowego. Przeanalizowano występujące problemy wpływające na bezpieczeństwo żywności podczas procesu produkcyjnego. Obliczono...
-
Asymptotic behaviour in the set of nonhomogeneous chains of stochastic operators
PublicationWe study different types of asymptotic behaviour in the set of (infinite dimensional) nonhomogeneous chains of stochastic operators acting on L1(μ) spaces. In order to examine its structure we consider different norm and strong operator topologies. To describe the nature of the set of nonhomogeneous chains of Markov operators with a particular limit behaviour we use the category theorem of Baire. We show that the geometric structure...
-
Aspect-Oriented Management of Service Requests for Assurance of High Performance and Dependability
PublicationA new approach to service requests management in case of insufficient hardware resources is proposed. It is based on wide aspects of requests analysis and it assures reliable and fast access to priority services. Requests are analyzed for, among others, time of occurrence, category of user who made the request, type of service, current system load and hardware utilization. Deterministic but dynamic rules help to manage system load...
-
SAILING ROUTE PLANNING METHOD CONSIDERING VARIOUS USER CATEGORIES
PublicationThe article describes the methodology related to determining the multi-criteria routes for sailing ships. Details of sea area discretisation and discretisation of the description of the sailing vessel properties and manoeuvring principles are shown. User requirements were specified (for five different categories of users) and on this basis the criteria for selecting the most suitable shipping route were formulated. The presented...
-
Latin-American Algorithms, Graphs and Optimization Symposium
Conferences -
Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Conferences -
Krzysztof Jan Kaliński prof. dr hab. inż.
PeopleKrzysztof J. Kaliński completed his MSc study at Gdańsk University of Technology (GUT) Faculty of Production Engineering (1980, result – get a first). He obtained PhD at GUT Faculty of Machine Building (1988, result – get a first), DSc at GUT Faculty of Mechanical Engineering (ME) (2002, result – get a first), and professor’s title – w 2013 r. In 2015 r. he became full professor.His research area includes: theoretical and applied...
-
Preface
PublicationThis special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...
-
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublicationWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Morse decompositions for a population model with harvesting. Case Ha-Se: Harvesting adults only, equal survival rates of juveniles and adults
Open Research DataThis 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
Open Research DataThis 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
Open Research DataThis 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
Open Research DataThis 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
Open Research DataThis 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
Open Research DataThis 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.
-
The hat problem on cycles on at least nine vertices
PublicationThe 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...
-
Workshop on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
Conferences -
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublicationOne of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...
-
Ways of Harmonising Polish Competition Law with the Competition Law of the EU
PublicationThis article discusses the harmonisation of laws within the EU focusing on the specific ways of achieving an approximation of the Polish legal system with European competition law. It identifies and gives an overview of three specific ways of harmonising national laws with EU antitrust provisions: (1) spontaneous (or bottom-up) harmonisation; (2) judicial harmonisation and; (3) legislative harmonisation by means of EU Directives....
-
Analysis of soundscape recordings in close proximity to the road in changeable wather conditions
PublicationThe acoustic vehicle sensing is the least invasive type of traffic detection. Also, acoustic-based vehicle detection technology is insensitive to precipitation and can operate in low light level. Therefore, this kind of method may be used for automatic detection of the vehicle passage events. It can also be employed for measurements of a vehicle speed and the vehicle assignment to the particular category. In this paper the results...
-
A sector-an industry? Definitional challenges in economic sciences
Publicationthe aim of our paper is to present definitional challenges that we as scholars and teachers face while attempting to relate to a sector and an industry terms in economic analyses and from strategic management perspective. we employ secondary research and analyse the state of the academic discourse and common usages of the above terms. we argue that for an economic statistician classifications should be consistent and highlight...
-
Adaptive Method of Raster Images Compression and Examples of Its Applications in the Transport Telematic Systems
PublicationThe paper presents a concept and exemplary application of an adaptive method of compression of raster images which may be applied, i.a. in ITS systems. The described method allows to improve the efficiency of systems belonging to ITS category, which require transmission of large volumes of image data through telecommunications networks. The concept of the adaptive method of compression of raster images described in the paper uses...
-
The entrepreneurship of host cities of the Olympic Games – Between success and social destruction
PublicationMany publications focus on the deficit nature of the Olympic Games organisation, when considered from the point of view of host cities – organisers of such events. However, does such an event actually affect the region and the host country in a positive way? The presented article aims at the assessment of the organisation of mass sports events, such as the Olympic Games, taking into consideration entrepreneurial activities which...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublicationWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublicationThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...
-
Machining process sequencing and machine assignment in generative feature-based CAPP for mill-turn parts
PublicationProcess selection and sequencing, as one of the most complex issues when evaluated from a mathematical point of view and crucial in CAPP, still attract research attention. For the current trend of intelligent manufacturing, machining features (MFs) are the information carriers for workpiece geometry and topology representation. They are basically derived from CAD models and are used by downstream engineering applications. A feature-based...
-
Customer Assessment of Brand Valuation and Social Media
PublicationThe research problem engaged in this article is to determine whether contemporary consumers are able to assess brand equity in the overabundance of brands and products with similar features and qualities. The author argues that in the existing circumstances when differences between brands become insignificant the consumer is not capable of assessing their equity adequately. In order to verify the thesis the author has accepted...
-
Counting Lattice Paths With Four Types of Steps
Publication