pso algorithm for the opf problem

... the elements stably, the whole algorithm is stable The hashing scheme of Bast and Hagerup is conservative The justification that the other parts of the algorithm are conservative is straightforward ... reliability, Theorem 2.11 is theoretically stronger than Theorem 2.7, but the program based on the former will be much more complicated Moreover, n must be very large before the algorithm of Theorem ... distance measure is the standard Euclidean metric In his seminal paper on randomized algorithms, Rabin w27x proposed an algorithm for solving the closest-pair problem The key idea of the algorithm is...

Ngày tải lên: 21/04/2015, 15:39

... compensated for these injections and other procedures and likely under-reported them For this reason, our effectiveness algorithm may perform better when there is a financial incentive to code these ... used only to capture the DAS28, the CDAI and other clinical characteristics measured at the baseline and outcome VARA visits; all other data used for the analysis were from the administrative claims ... 1.2 unit improvement in their DAS28 The PPV of the administrative data-based effectiveness algorithm was 75%, and the NPV was 90% The sensitivity of the effectiveness algorithm was 75%, and its...

Ngày tải lên: 25/10/2012, 10:45

... improve the performance on some problems by slowing down convergence We made no effort to customize the algorithm to the problems on hand, and used the same formulas for the population size and the ... discuss GAs for the p-median problem in the next section Despite the combinatorial nature of the problem, optimal algorithms can solve some instances of the p-median problem with reasonable effort A ... general, and for the p-median problem in particular In the first paper applying the GA framework to the p-median problem, Hosage and Goodchild (1986) encoded the solutions of the problem as a...

Ngày tải lên: 08/08/2013, 08:38

... optical power, the more photoelectrons per pixel will be generated, and hence the higher the signal-to-noise ratio and therefore the accuracy of the range measurements On the other hand, the power ... p=1 (13) Therefore, each of the motion hypotheses for the block in the central frame is assigned a reliability measure, which depends on the compensation error and the similarity of the current ... yield the N lowest values of the cost function Then, we continue with the motion estimation for each of the N best candidates found in the frame F (t − 1) by finding their N best matches in the...

Ngày tải lên: 20/06/2014, 04:20

... the time variable T , which is the main difficulty When we derive these estimates we use some ideas from 4, First we construct the energy equation for the solution of problem 2.1 – 2.4 under the ... 3.10 is satisfied In the continuation we use the above results and the conditions of Theorem 2.1 Similarly as in 4, , we derive the estimates for the solution ρ, v, ω, θ of problem 2.1 – 2.7 , ... η we construct the quantities exp η, u exp η u 2.22 The aim of this work is to prove the following theorem Theorem 2.1 Suppose that the initial functions satisfy 2.6 , 2.7 , and the following...

Ngày tải lên: 21/06/2014, 16:20

... that the variational inequality problem 1.1 is equivalent to some fixedpoint problems The element u ∈ C is a solution of the variational inequality problem 1.1 if and only if u ∈ C satisfies the ... > is a constant The alternative equivalent formulation has played a significant role in the studies of the the variational inequalities and related optimization problems Recall the following definitions ... is the optimality condition for the minimization problem x∈C Ax, x − h x , 1.19 where C is the fixed-point set of a nonexpansive mapping S, h is a potential function for γf i.e., h x γf x for...

Ngày tải lên: 22/06/2014, 03:20

... give an outline of the paper In Section we state the continuous alternating Schwarz sequences for the obstacle problem, and define their respective finite element counterparts in the context of nonmatching ... and consequently, which completes the proof The proof for the discrete case is similar 4 Obstacle problem Proposition 2.2 Under the notations and conditions of the preceding lemma, we have u−u ... obstacle problem Let Ω be a convex domain in R2 with sufficiently smooth boundary ∂Ω We consider the bilinear form a(u,v) = (∇u · ∇v)dx, (2.1) f (x) · v(x)dx, (2.2) Ω the linear form ( f ,v) = Ω the...

Ngày tải lên: 22/06/2014, 22:20

... Dirichlet forms [6, 13] Concerning (g) we observe that in the bilinear case the Leibniz rule holds for both the arguments of the form [6, 13], but in the nonlinear case the property holds only for the ... into account the quasi-continuity of u for the measure m, we have (2.43) for a.e xo ∈ Ω We recall that u is also quasi-continuous for the capacity relative to α, then (2.43) holds for q.e xo ∈ ... list now the assumptions that give the relations between the topology, the distance and the measure on X Assumption (H7 ) A distance d is defined on X, such that α(d) ≤ m in the sense of the measures...

Ngày tải lên: 22/06/2014, 22:20

... efficient and reliable improved algorithm for the piecewise-smooth Mumford-Shah segmentation problem with edge preserving Unlike the classic algorithms [6, 10], computing the extensions of functions ... image where the classical algorithm fails to stop at the correct boundaries, thus, our algorithm can better on this kind of image Figure demonstrates another advantage of the improved algorithm ... can also make the algorithm more computationally efficient When τ = or τ > the convergence of the curve to object boundary will become too slow, although the algorithm still stops at the correct...

Ngày tải lên: 22/06/2014, 22:20

... In addition, the algorithm should work well, regardless of the positive definiteness of the covariance matrices Furthermore, the algorithm should provide a straightforward method for the generation ... one another Therefore, the scenario where the variances of the Rayleigh envelopes are equal to one another and the powers of real parts are equal to those of imaginary parts, such as the scenario ... combining their proposed method with the method proposed in [10] Specifically, the authors took the outputs of the method in [10] and simply input them into step in their method However, the step in the...

Ngày tải lên: 23/06/2014, 00:20

... Suppose the inward edge comes from a fork Since the degree of o is four, o must be the white node in the fork Hence one of the remaining edges is contained in the same fork However, their directions ... In some of the cases in Figure 74, the neighborhood of the target node o contains some other nodes of degree The algorithm covers the analysis of the neighborhood of these nodes in the following ... 42 Proof We have the following cases: Suppose that a comes from a fork Since the degree of o is 4, o must be the white node in the fork Thus, f is contained in the same fork Then node must have...

Ngày tải lên: 08/08/2014, 14:23

... Speakers at the Conference were encouraged to submit their views for publication and these manuscripts are published together as a thematic publication grouping on HAE in the official journal of the ... manuscript is the 2010 International Consensus Algorithm for the Diagnosis, Therapy and Management of Hereditary Angioedema that was agreed to at that conference and this was further circulated for review ... by USA FDA October th, 2009 for therapy of HAE events and licensed in many other countries for many years Cetor® from Sanquin has been available in The Netherlands for some time [35,53] Berinert®,...

Ngày tải lên: 08/08/2014, 21:20

... cân theo nguyên lý cân bánh đà, điều khiển cân theo thuật toán điều khiển bền vững H thuật toán giảm bậc mô hình dựa theo phân tích Schur Điểm đề xuất hoàn thiện thuật toán giảm mô hình dựa theo ... gian đáp ứng hệ Thuật toán giảm bậc mô hình dựa theo phân tích Schur 2.1 Bài toán giảm bậc mô hình Cho hệ tuyến tính, liên tục, tham số bất biến theo thời gian, có nhiều đầu vào, nhiều đầu ra, ... tích, thiết kế, điều khiển hệ thống 2.2 Thuật toán giảm bậc mô hình dựa theo phân tích Schur Thuật toán giảm bậc mô hình dựa theo phân tích Schur phát triển nhóm nghiên cứu dựa sở kỹ thuật cắt ngắn...

Ngày tải lên: 24/07/2015, 16:33

... medium problems The MoM analysis can be carried out either in the spectral domain [35]-[36] or the spatial domain [37]-[38] To generate the impedance matrix in the spectral domain formulation, the ... of the fast Fourier transform to speed up the matrix-vector multiplication The method to alleviate the problem is to use the fast multipole method [42]-[45] The fast multipole method improves the ... project the triangular elements onto uniform grids using the adaptive integral method [46]-[49] The resulting algorithm has the memory requirement proportional to O(N) and the operation count for the...

Ngày tải lên: 11/09/2015, 09:02

... created in the next generation The objective function is then again calculated for all the individual of the new generation and all the genetic operations are again performed and the second generation ... capacity and location There are two distinct means of placing a FACTS device in the system for the purpose of increasing the system’s ability to transmit power, thereby allowing for the use of more ... in the more heavily loaded lines to limit the power flow in that line This causes more power to be sent through the remaining portions of the system while protecting the line with the device for...

Ngày tải lên: 26/03/2016, 02:38

... does not exist, hut there is a node connected to the tie switch, then the nodes belong to class C If there exist nodes connected to neither the source nor the tie switch, the nodes belong to ... are formed by omitting the lines connected to OBNs In any subsystem, there exists a node connected to the source, then the nodes in the subsystem belong to class B If a node connected to the ... searching for the upstream lines based on the load flow in the normal state The downstream nodes after this breaker belong to classes B, C or D The specific class should be determined The other nodes,...

Ngày tải lên: 03/01/2014, 19:39

... topological K1 and the fact that α induces the identity map on the Elliott invariant force α to induce the identity map at the level of the Hausdorffized algebraic K1 -group The KKclass of α is the same ... that ON THE CLASSIFICATION PROBLEM FOR NUCLEAR C ∗ -ALGEBRAS 1043 the moment one relaxes the slow dimension growth condition for AH algebras (and therefore, a fortiori for ASH algebras), one obtains ... conjectured shortly thereafter that the topological K-groups, the Choquet simplex of tracial states, and the natural connections between these objects would form a complete invariant for the class of...

Ngày tải lên: 16/02/2014, 06:20

... (see [D, p 761] for further references) The derivation problem for the group algebra is linked to the name of B E Johnson, who pursued it over the years as a pertinent example in his theory of cohomology ... x−1 (see the proof of THE DERIVATION PROBLEM FOR GROUP ALGEBRAS 225 Corollary 1.2), they write N for the closure of the elements of G belonging to relatively compact conjugacy classes Then Cond ... that of Day’s fixed point theorem (compare [Gr, p 50]) It is enough to show the result for linear transformations A(x) THE DERIVATION PROBLEM FOR GROUP ALGEBRAS 229 ˜ ˜ (otherwise, we pass to X...

Ngày tải lên: 06/03/2014, 08:21

Ngày tải lên: 06/03/2014, 15:21

... close the paper, we give another example for solving Problem A and B Example Find an optimal tour for Problem A and B with the following input data (the source a4 and the sink a11 for Problem ... the above results we can find optimal tours for Problem A and Problem B under condition (1) as follows Problem A The optimal tour π of Problem A consists of three parts, one or two parts of them ... that before solving Problem A or B we have to make sure that the condition (1) is fulfilled (by renumbering the vertices of the graph if necessary) This can be done by using an algorithm for sorting...

Ngày tải lên: 14/03/2014, 13:20