Migration of Virtual Machine (VM) is a critical challenge in cloud computing. The process to move VMs or applications from one Physical Machine (PM) to another is known as VM migration. In VM migration several issues should be considered. One of the major issues in VM migration problem is selecting an appropriate PM as a destination for a migrating VM. To face this issue, several approaches are...

a module $m$ is called $emph{h}$-cofinitely supplemented if for every cofinite submodule $e$ (i.e. $m/e$ is finitely generated) of $m$ there exists a direct summand $d$ of $m$ such that $m = e + x$ holds if and only if $m = d + x$, for every submodule $x$ of $m$. in this paper we study factors, direct summands and direct sums of $emph{h}$-cofinitely supplemented modules. let $m$ be an $emph{h}$...

This article presents a unified approach to the abstract notions of partial convolution and involution in $L^p$-function spaces over semi-direct product of locally compact groups. Let $H$ and $K$ be locally compact groups and $tau:Hto Aut(K)$ be a continuous homomorphism.  Let $G_tau=Hltimes_tau K$ be the semi-direct product of $H$ and $K$ with respect to $tau$. We define left and right $tau$-c...

Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

In this paper, we address a problem that is often overlooked in the gradual construction of a logic-based knowledge component: how can a new piece of information g be added into a component KC so that g is not subsumed by KC? More precisely, the focus is on iterating this subsumption-freeness enforcement process when the component is increased step by step. Interestingly, it is shown that the a...