Search results for: PAIRED DOMINATION, DOMINATION SUBDIVISION NUMBER, DOMINATION MULTISUBDIVISION NUMBER, BLOCK GRAPH
-
Conley-Morse graphs for a two-dimensional discrete neuron model (full range)
Open Research DataThis 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.
-
Multi-agent graph searching and exploration algorithms
PublicationA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublicationA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
Drawing maps with advice
PublicationW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Conley-Morse graphs for a non-linear Leslie population model with 2 varying parameters
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Conley-Morse graphs for a non-linear Leslie population model with 3 varying parameters
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Modelling AOB-NOB competition in shortcut nitrification compared with conventional nitrification-denitrification process
PublicationIn particular, mainstream deammonification and/or shortened nitrificationdenitrification via nitrite (so-called “nitrite shunt”) is a promising new treatment concept that has the potential to revolutionise how nitrogen removal is achieved at WWTPs. Understanding the role of the AOB/NOB competition in the nitrogen cycle in wastewater treatment systems will change operational strategies of the novel nitrogen removal processes. The...
-
Persulfates to degrade a mixture of dyes (rhodamine B, methylene blue) in the presence of glucose and visible light
PublicationA treatment process utilizing visible-light-activated (Vis) persulfates (PS) in the presence of an organic promoter (glucose) was developed for the simultaneous decolorization of a rhodamine B (RhB) and methylene blue (MB) mixture. Various doses of glucose, PS concentrations, pH values, initial dye concentrations and process time were tested to find out the most appropriate parameters for degrading the RhB/MB mixture in the...
-
Noise Analysis of Continuous GPS Time Series of Selected EPN Stations to Investigate Variations in Stability of Monument Types
PublicationThe type of monument that a GPS antenna is placed on plays a significant role in noise estimation for each permanent GPS station. In this research 18 Polish permanent GPS stations that belong to the EPN (EUREF Permanent Network) were analyzed using Maximum Likelihood Estimation (MLE). The antennae of Polish EPN stations are placed on roofs of buildings or on concrete pillars. The analyzed data covers a period of 5 years from 2008...
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublicationSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
Implementacja w FPGA algorytmu detekcji krawędzi obrazu w czasie rzeczywistym
PublicationW artykule przedstawiono projekt architektury oraz implementację układową toru przetwarzania wstępnego obrazu z modułem detekcji krawędzi. Układ został zaimplementowany w FPGA Intel Cyclone. Zrealizowany moduł wykorzystuje pięć wybranych algorytmów wykrywania krawędzi, w tym Robertsa, Sobela i Prewitt.
-
Graph classes generated by Mycielskians
PublicationIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publicationgenetic algorithms (ga) are a well-known tool used to obtain approximate solutions to optimization problems. successful application of genetic algorithm in solving given problem is largely dependant on selecting appropriate genetic operators. selection, mutation and crossover techniques play a fundamental role in both time needed to obtain results and their accuracy. in this paper we focus on applying genetic algorithms in calculating...
-
On Symmetry of Uniform and Preferential Attachment Graphs
PublicationMotivated 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...
-
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
The complexity of bicriteria tree-depth
PublicationThe 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...
-
Proposal of a method for effective tasks distribution in the execution of compolex problems
PublicationAn access to a great number of various services allows for decomposition of complex problems into smaller and less complex tasks. Those tasks can be presented in a form of a dependency graph. This paper shows an idea of executing such a problem using cooperating autonomous agents. Main focus of this work is cooperation covering effective tasks distribution among executors. This paper presents an algorithm for dynamic executor selection...
-
Product Graph Invariants with Applications in the Theory of Information
PublicationThere are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublicationIn this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...
-
Data on bicycle traffic in Lodz (Poland) paired with weather and air quality data
Open Research DataThe file contains data on bicycle traffic registered by counting stations loacted in Lodz in the years 2016-2019. The data are paired with weather and air quality data from Lodz collected for the same period. The data is described below:
-
Data on bicycle traffic in Gdansk paired with weather and air quality data
Open Research DataThe file contains data on bicycle traffic registered by counting stations loacted in Gdańsk in the years 2013-2020. The data are paired with weather and air quality data from Gdansk collected for the same period. The data is described below:
-
THE INFLUENCE OF WATER-LAND RELATIONS ON THE LANDSCAPE AND ARCHITECTURE OF THE VISTULA DELTA (POLAND)
PublicationThe Vistula Delta is unique region of water domination. In this part of Europe, historic rural assumptions have been developing since the 12th century. Practically, it can be said that most of the systems were related to the coexistence of the human and the water element. Relations of water and land, developed specific types of villages such as a water-based village. Water landscape; polders, canals, dikes and rivers, hydro-technical...
-
5-Selenocyanato and 5-trifluoromethanesulfonyl derivatives of 2′-deoxyuridine: synthesis, radiation and computational chemistry as well as cytotoxicity
Publication5-Selenocyanato-2′-deoxyuridine (SeCNdU) and 5-trifluoromethanesulfonyl-2′-deoxyuridine (OTfdU) have been synthesized and their structures have been confirmed with NMR and MS methods. Both compounds undergo dissociative electron attachment (DEA) when irradiated with X-rays in an aqueous solution containing a hydroxyl radical scavenger. The DEA yield of SeCNdU significantly exceeds that of 5-bromo-2′-deoxyuridine (BrdU), remaining...
-
Polyhedral Ramsey Numbers
PublicationGiven two polygons or polyhedrons P1 and P2, we can transform these figures to graphs G1 and G2, respectively. The polyhedral Ramsey number Rp(G1,G2) is the smallest integer n such that every graph, which represents polyhedron on n vertices either contains a copy of G1 or its complement contains a copy of G2. Using a computer search together with some theoretical results we have established some polyhedral Ramsey numbers, for example...
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
Synchronous black hole search in directed graphs
PublicationThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Bounds on the cover time of parallel rotor walks
PublicationThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
-
On minimum cost edge searching
PublicationWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
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...
-
Preparation and some properties of multiblock copoly(amide-b-amide)s
PublicationThe paper concerns the polymers built of oligoamide hard blocks and oligoamide soft blocks (KPAA, formula I). Oligo(laurolactam) (PA12) was used as hard block and the product of reaction of dimerized fatty acid and hexamethylene diamine (PA6,36) was used as a soft one. Effects of molar ratio of these blocks on the following properties of KPAA have been investigated: limiting viscosity number ([2]), degrees of swelling in water...
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 009_v_2
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 009_v_3
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 009_h_3
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 019_v_5
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 009_h_5
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 009_h_4
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 039_h_4
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 019_v_4
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 019_h_5
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 039_v_4
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 009_v_4
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 039_v_3
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 019_v_3
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 019_h_3
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 039_h_5
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 019_h_4
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 039_v_2
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
3D printed ABS thermoplastic vs. steel. Dry sliding wear test in constant load & velocity ring on flat configuration. Test parameters: print layer thickness and orientation. Test symbol: 039_h_3
Open Research DataData gathered in sliding ring-on-block (flat contact) tribological experiment. Materials: alloy steel (heat treated) vs. ABS plastic.
-
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
PublicationThis paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...