(۰۳ بهمن ۱۳۹۵ ۰۸:۳۸ ب.ظ)darush12 نوشته شده توسط:  

We compare these results with some other representative
works.

(۰۳ بهمن ۱۳۹۵ ۱۰:۱۷ ق.ظ)soosoo نوشته شده توسط:  سلام آقای شریعتی
ممنونم از تون
خدا خیرتون بده. .
میشه بی زحمت اینو هم لطف کنید و بگید با مترجم گوگل ترجمه کردم ویرایشش کردم اما معنی نموده
Detailed Description of KL algorithm: Let G = (V, E, c) be an undirected graph where V is the set of vertices, E is the set of edges and c is the edge-weight function such that c(u,v) denotes the weight of the edge between vertex u and vertex v. If there is no edge between u and v, we will assume that c(u,v) = 0. Let (V1, V2) be an initial partition. The cost of a partition (V1, V2), denoted as cost(V1, V2), is defined as the sum of weights of all the edges (u,v) crossing the partition i.e. where u and v belong to two different partitions. Let us take an illustrative example to explain the above concept. This example is taken from [7] and will serve as our running example in this disposition.
For any vertex a V1, define external cost of a as Ea = c(a,v) where v V2 and internal cost of a V1 as Ia = c(a,v) where v V1. Also define Da = Ea - Ia. Similarly, define Eb, Ib and Db for any vertex b V2. Note that Da denotes the amount by which the cost of the initial partition (V1, V2) will be reduced if we move vertex a from its present partition to the complementary partition. Now, let a V1 and b V2. If we swap a and b, the net reduction in the cost of the partition is gab = Da + Db – ۲c(a, b). In the first iteration of KL algorithm, D-values of all vertices and g-values of all candidate pairs for swapping are calculated and the pair of vertices (a, b) is found out where a V1 and b V2 and gab is maximum among all other candidate pairs. Then a and b are swapped and locked for all subsequent iterations. By locking we mean that once we swap a and b, neither a nor b will be considered for swapping in any of the following iterations. This first step of KL algorithm on the initial partition of Figure [refer] will produce the following Ex, Ix, Dx and gxy

---

ببخشید میدانم زیاد شد و خیلی وقتتون رو میگیره. ..
ممنون میشم
این دیگه اخریشه

(۰۹ بهمن ۱۳۹۵ ۰۳:۵۱ ب.ظ)darush12 نوشته شده توسط:  

It is reasonable to decompose a real-time system into a set of self-contained subsystems called clusters.

(۱۱ بهمن ۱۳۹۵ ۰۷:۲۵ ق.ظ)darush12 نوشته شده توسط:  

A controlled object, e.g., a car or an industrial plant, changes its state as a function
of time

(۱۲ بهمن ۱۳۹۵ ۰۶:۲۷ ب.ظ)life24 نوشته شده توسط:  سلام
ببخشید این یعنی چی؟ it is up to you to
Of course, it is up to you to determine which command-line arguments your
program will respond to

(۱۲ بهمن ۱۳۹۵ ۰۶:۵۹ ب.ظ)hosein_zt نوشته شده توسط:  it is up to you to
Of course, it is up to you to determine which command-line arguments your
program will respond to

(۱۴ بهمن ۱۳۹۵ ۰۵:۱۶ ق.ظ)life24 نوشته شده توسط:  سلام
منظور ماسمالی کردن هست؟
first glance, this might seem like a flat-out lie