This report provides the formalization of DEECo concepts and operational semantic of DEECo systems. Further, it establishes the refinement relation and shows the centralized tuple space semantics (as featured by local and Apache River-based knowledge providers in jDEECo). Version: March 2nd, 2013 This work was partially supported by the Grant Agency of the Czech Republic project P202/11/0312. T...

Let k ≥ 1 be an integer and G a graph of minimum degree δ ( ) − 1. A set D ⊆ V is said to -tuple dominating if | N [ v ] ∩ for every vertex ∈ ), where represents the closed neighbourhood . The cardinality among all sets domination number In this paper, we continue with study classical parameter in graphs. particular, provide some relationships that exist between other parameters, like multiple ...

Coordination of mobile applications posses a number of issues. Devices should be able to communicate with each other without being connected with each other at the same time while maintaining privacy and limited network traffic. Current tuple based approaches solve these issues partially but none of them solves all of them. We propose a novel tuple space-based approach where tuple spaces are an...

In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any graph G, ×k(G) ln( − k + 2)+ ln(∑k−1 m=1(k −m)d̂m + )+ 1 − k + 2 n, where ×k(G) is the k-tuple domination number; is the minimal degree; d̂m is the m-degree of G; = 1 if k = 1 or 2 and =−d if k 3; d is the average degree...

We improve the generalized upper bound for the k-tuple domination number given in [A. Gagarin and V.E. Zverovich, A generalized upper bound for the k-tuple domination number, Discrete Math. 308 no. 5–6 (2008), 880–885]. Precisely, we show that for any graph G, when k = 3, or k = 4 and d ≤ 3.2, γ×k(G) ≤ ln(δ−k + 2) + ln ( (k − 2)d + ∑k−2 m=2 (k−m) 4min{m, k−2−m} d̂m + d̂k−1 ) + 1 δ − k + 2 n, and,...

In this paper we give conditions for a tuple of commutative bounded linear operators which holds in the property of the Hypercyclicity Criterion. We characterize topological transitivity and semi-hereiditarily of a dynamical system given  by an n-tuple of operators acting on a separable infinite dimensional Banach space .

We study the problem of finding the smallest power of an input graph that has k disjoint dominating sets, where the ith power of an input graph G is constructed by adding edges between pairs of vertices in G at distance i or less, and a subset of vertices in a graph G is a dominating set if and only if every vertex in G is adjacent to a vertex in this subset. The problem is a different view of ...

We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RGGs). In particular, we model these problems as Integer Linear Programs (ILPs), solve them optimally, and show on a large set of samples that RGGs are independent domatically full most likely (over 93% of the cases) and...