The state-of-art Web services composition approaches are facing more and more serious bottlenecks of effectiveness and stability with the increasing diversity and real-time requirements of applications, since new web service chain must be generated from “scratch” for each application. To break these bottlenecks, this paper presents a Min-Conflict Heuristic-Based Web Service Chain Reconfiguratio...

In this paper, LCD cyclic, self dual and isodual codes over finite chain rings are investigated. It was proven recently that a non-free cyclic code does not exist rings. Based on algebraic number theory, we introduce necessary sufficient conditions for which all free ring LCD. We have also obtained the existence of non trivial any length when nilpotency index maximal ideal is even. Further, sev...

Let P be an ordered set. P is said to have the finite cutset property if for every x in P there is a finite set F of elements which are noncomparable to x such that every maximal chain in P meets {x} t.J F. It is well known that this property is equivalent to the space of maximal chains of P being compact. We consider the following question: Which ordered sets P can be embedded in an ordered se...

the aim of this study was to represent effective componentsin demand chain which help organizations attain high performance levelsthrough identification of these components and determining theirdegree of importance. the following questions were major ideas of thisstudy: what are the most effective components in demand chain? andhow are they effective on organizational performance? to this end,m...

For a graph property P, in particular maximal independence, minimal domination and maximal irredundance, we introduce iterated P-colorings of graphs. The six graph parameters arising from either maximizing or minimizing the number of colors used for each property, are related by an inequality chain, and in this paper we initiate the study of these parameters. We relate them to other well-studie...

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all such clones are finitely generated over the unary functions. In particular, we obtain an explicit description of the only maximal clone in this part of the ...

In this paper we discuss the problem of approximating a belief function (b.f.) with a necessity measure or “consonant belief function” (co.b.f.) from a geometric point of view. We focus in particular on outer consonant approximations, i.e. co.b.f.s less committed than the original b.f. in terms of degrees of belief. We show that for each maximal chain of focal elements the set of outer consonan...

This paper considers undiscounted Markov Decision Problems. For the general multichain case, we obtain necessary and sufficient conditions which guarantee that the maximal total expected reward for a planning horizon of n epochs minus n times the long run average expected reward has a finite limit as n -* oo for each initial state and each final reward vector. In addition, we obtain a character...