Search
Filters
total: 70
Search results for: bounded solutions
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Computational aspects of greedy partitioning of graphs
PublicationIn 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...
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublicationIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
The speciation of selected heavy metals in sewage sludge stabilized in reed basins
PublicationThe aim of the work was to determine influence of time on organic matter content, nutrients concentrations as well as speciation of selected heavy metals (Cd, Pb, Ni, Cr, Cu and Zn) in sewage sludge stabilized in reed basins during 7-15 years. The analyzed sewage sludge was collected from reed basins from four municipal WWTPs located in Denmark serving from 9 000 to 40 000 pe in Vallo, Rudkøbing, Nakskov and Helsinge. Sewage...
-
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:...
-
A few steps more towards NPT bound entanglement
PublicationIn this paper, existence of bound entangled states with nonpositive partial transpose (NPT) is considered. As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover, it would rule out a simple mathematical description of the set of distillable states. The particular state, known to be 1-copy nondistillable and supposed to be bound entangled, is considered. The problem of...
-
Set-Bounded joined parameter and state estimation for model predictive control of integrated wastewater treatment plant systems at medium time scale.
PublicationW artykule opisano moduł łącznej estymacji w postaci zbiorów ograniczonych (ang. set-bounded) parametrów i stanu systemu dla potrzeb sterowania predykcyjnego zintegrowanym systemem ściekowym w średniej skali czasu. Jest to jeden ze składowych elementów Inteligentnej Hierarchicznej Struktury Sterowania opracowanej w celu pokonania następujących problemów, które występują w kontrolowanym systemie: różne skale czasowe procesów, silnie...
-
Strategic balance in graphs
PublicationFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Thermal and physical properties of ZrO2–AlO(OH) nanopowders synthesised by microwave hydrothermal method
PublicationIndustrially relevant nanopowder was synthesised by microwave hydrothermal synthesis to obtain well-controlled composition (ZrO2–AlO(OH) system) which was found to determine a number of physical and thermal characteristics. This study reports variation of particle size, density, specific surface area (SSABET), as well as thermal behaviour of nanopowder mixtures of ZrO2–AlO(OH) in the whole range of compositions. It was found that...
-
Randomness Amplification under Minimal Fundamental Assumptions on the Devices
PublicationRecently, the physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however, for reasons of practical relevance, the crucial question remained open regarding whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling components...
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublicationIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
Type III Responses to Transient Inputs in Hybrid Nonlinear Neuron Models
PublicationExperimental characterization of neuronal dynamics involves recording both of spontaneous activity patterns and of responses to transient and sustained inputs. While much theoretical attention has been devoted to the spontaneous activity of neurons, less is known about the dynamic mechanisms shaping their responses to transient inputs, although these bear significant physiological relevance. Here, we study responses to transient...
-
Long range molecular dynamics study of regulation of eukaryotic glucosamine-6-phosphate synthase activity by UDP-GlcNAc
PublicationGlucosamine-6-phosphate (GlcN-6-P) synthase catalyses the first and practically irreversible step in hexosamine metabolism. The final product of this pathway, uridine 5' diphospho N-acetyl-D-glucosamine (UDPGlcNAc), is an essential substrate for assembly of bacterialand fungal cell walls. Moreover, the enzyme is involved in phenomenon of hexosamine induced insulin resistance in type II diabetes, which makes it a potential target...
-
Global defensive secure structures
PublicationLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...
-
Normal-form preemption sequences for an open problem in scheduling theory
PublicationStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...
-
Brief Announcement: Energy Constrained Depth First Search
PublicationDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...
-
A Framework for Searching in Graphs in the Presence of Errors
PublicationWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Stable indirect adaptive control based on discrete-time T-S fuzzy model
PublicationThis paper presents an indirect adaptive fuzzy control scheme for uncertain nonlinear asymptotically stable plants.A discrete-time T-S fuzzy input-output model is employed to approximate the unknown plant dynamics. The T-S fuzzy model is fed with its own states, which are indeed its past outputs, rather than the measurements from the plants. Entirely based on this model, a feedback linearization control law is designed by using...
-
Stable indirect adaptive control based on discrete-time T-S fuzzy model
PublicationThis paper presents an indirect adaptive fuzzy control scheme for uncertain nonlinear asymptotically stable plants.A discrete-time T-S fuzzy input-output model is employed to approximate the unknown plant dynamics. The T-S fuzzy model is fed with its own states, which are indeed its past outputs, rather than the measurements from the plants. Entirely based on this model, a feedback linearization control law is designed by using...
-
Zintegrowane sterowanie systemami zaopatrzenia w wodę pitną
PublicationOptymalne ekonomicznie zaspokojenie w miastach bieżącego zapotrzebowania na wodę pitną tak, aby spełnione były wymagania jakości dostaw oraz jakości samej wody jest złożonym zadaniem. Zarówno aspekty aplikacyjne jak i teoretyczne tego problemu są przedmiotem intensywnych prac prowadzanych w sektorach naukowych i przemysłowych na całym świecie. Prace te finansowane są przez przemysł, komitety naukowe oraz Programy Ramowe Unii Europejskiej....