We give some sufficient conditions under which the tuple of the adjoint of weighted composition operators $(C_{omega_1,varphi_1}^*‎ , ‎C_{omega_2,varphi_2}^*)$ on the Hilbert space $mathcal{H}$ of analytic functions is supercyclic‎.

An approach is presented which extends the MOMfaulttolerant implementation of the Linda model of parallel programming. The original MOM system provided persistence of tuples and tuple states across both tuplespace and worker node halt failures. Unfortunately, the requirement that system tuple space reside in a central location restricted the scalability of the MOM model. In this work, an approa...

let $g=(v, e)$ be a graph. by emph{directional labeling (ord-labeling)} of an edge $x=uv$ of $g$ by an ordered $n$-tuple$(a_1,a_2,...,a_n)$, we mean a labeling of the edge $x$ such thatwe consider the label on $uv$ as $(a_1,a_2,...,a_n)$ in thedirection from $u$ to $v$, and the label on $x$ as$(a_{n},a_{n-1},...,a_1)$ in the direction from $v$ to $u$. inthis paper, we study graphs, called emph{...

In this paper a tuple space based co-ordination language, and a run-time system which supports it is described. The co-ordination language is called WCL, and it is designed to support agent co-ordination over the Internet between agents which are geographically distributed. WCL uses tuple spaces as used in Linda. WCL provides a richer set of primitives that traditional tuple space based systems...

The co-ordination language Linda has been used for parallel processing for many years. Linda uses a shared tuple space and a number of primitives to provide access to the tuple space and thereby enabling communication between processes executing concurrently. Linda provides asynchronous communication between processes, but synchronous access between the processes and the tuple spaces. The Bonit...

Decentralized Tuple Space (DTS) implements tuple space model among a series of decentralized hosts and provides the logical global shared tuple repository. Replication has been introduced to promote performance problem incurred by remote tuple access. In this paper, we propose a replication approach of DTS allowing replication policies self-adapting. The accesses from users or other nodes are m...

For programming distributed systems it is very convenient to have shared memory that can be accessed by cooperating processes. The abstraction of a commonly usable storage greatly simplifies programming a distributed system, because the developer does not need to bother about the difficulties that are inherent in the distribution, such as message ordering or syncrony of memory accesses. Distrib...

In the last 20 years of research in coordination, researchers were able to demonstrate that distributed languages are made of two distinct parts: a computation and a coordination language. Among a plethora of coordination models (the basis of a coordination language) available today, Linda is perhaps the most successful. Linda advocates that processes should interact solely via associative shar...

For a fixed positive integer k, a k-tuple total dominating set of a graph G is a subset D ⊆ V (G) such that every vertex of G is adjacent to at least k vertices in D. The k-tuple total domination problem is to determine a minimum k-tuple total dominating set of G. This paper studies k-tuple total domination from an algorithmic point of view. In particular, we present a linear-time algorithm for...