An n-tuple is defined for each n-person monotonic characteristic function game, This n-tuple is an imputation when the sum of the components of it is equal to v( N). On the boundary of the set of all monotonic games" we can obtain a condition for the n-tuple being an imputation. The n-tuple belongs to the core when it is an imputation. If the sum of the components of it exceeds v( N), the kerne...

Given a simple graph G = (V, E) and a fixed positive integer k. In a graph G, a vertex is said to dominate itself and all of its neighbors. A set D ⊆ V is called a k-tuple dominating set if every vertex in V is dominated by at least k vertices of D. The k-tuple domination problem is to find a minimum cardinality k-tuple dominating set. This problem is NP-complete for general graphs. In this pap...

In combinatorics, a latin square is $$n\times n$$ matrix filled with n different symbols, each occurring exactly once in row and column. Associated to square, we can define simple graph called graph. this article, compute lower upper bounds for the domination number k-tuple total numbers of such graphs. Moreover, describe formula 2-tuple number.

Experimental setup: • Dataset: Real census data (http://ipums.org/) composed of 600,000 tuples. Each tuple stores information about an individual: 4 QI-attributes and one private attribute having 50 possible values. Insertions and deletions were randomly performed to obtain a history of 21 releases. • Parameters: p = 0.04; m = 6; L = 21; h = 0.1. Given these parameters, the level n of (m,n)-his...

Linda is a language for programming parallel applications whose most notable feature is a distributed shared memory called tuple space. While suitable for a wide variety of programs, one shortcoming of the language as commonly defined and implemented is a lack of support for writing programs that can tolerate failures in the underlying computing platform. This paper describes FT-Linda, a versio...

For actual decision making problems, decision makers sometimes may have difficulty to provide all the preference information over alternatives through pairwise comparisons. In this paper, we focus on estimating missing elements for an incomplete uncertain 2-tuple linguistic preference relation. First, the additive consistency of an uncertain 2-tuple linguistic preference relation is defined. Ba...

In order to update k-anonymous and confidential database, the suppression based and generalization based updating protocol technique has been proposed. These protocols check whether the database inserted with the new tuple is still k anonymous without knowing the content of the table and database respectively. But these methods will not work if initial database is empty. Also, if the incoming t...

The tuple space coordination model is one of the most interesting communication models for open distributed systems due to its space and time decoupling and its synchronization power. Several works have tried to improve the dependability of tuple spaces. Some have made tuple spaces fault-tolerant while others have focused on security. However, many practical applications in the Internet require...

In this paper, we introduce the design of a parallel library for MPI based on the Linda programming paradigm, called Eilean. It provides a scalable distribution of the Tuple Space through an hierarchical (or cluster) partitioning scheme, and tuple type specific access/distribution policies. Portability of the library is achieved using the message passing standard MPI as the underlying communica...