Stability of Cascaded Takagi-Sugeno Fuzzy Systems

Size: px
Start display at page:

Download "Stability of Cascaded Takagi-Sugeno Fuzzy Systems"

Transcription

1 Stability of Cascaded Takagi-Sugeno Fuzzy Systes Zs. Lendek R. Babuska B. De Schutter Abstract- A large class of nonlinear systes can be well approxiated by Takagi-Sugeno (TS) fuzzy odels, with local odels often chosen linear or affine. It is well-known that the stability of these local odels does not ensure the stability of the overall fuzzy syste. Therefore, several stability conditions have been developed for TS fuzzy systes. We study a special class of nonlinear dynaic systes, that can be decoposed into cascaded subsystes. These subsystes are represented as TS fuzzy odels. We analyze the stability of the overall TS syste based on the stability of the subsystes. For a general nonlinear, cascaded syste, global asyptotic stability of the individual subsystes is not sufficient for the stability of the cascade. However, for the case of TS fuzzy systes, we prove that the stability of the subsystes iplies the stability of the overall syste. The ain benefit of this approach is that it relaxes the conditions iposed when the syste is globally analyzed, therefore solving soe of the feasibility probles. Another benefit is, that by using this approach, the diension of the associated linear atrix inequality (LMI) proble can be reduced. Applications of such cascaded systes include ultiagent systes, distributed process control hierarchical large-scale systes. 1. INTRODUCTION Dynaic systes are often odeled in the state-space fraework, using a state-transition odel, which describes the evolution of states over tie a easureent (sensor) odel, which relates the easureents to the states. Traditionally, the class of linear, tie-invariant systes have doinated control theory. The linearity tieinvariance ake these types of systes easy to analyze. The disadvantage is that such odels usually fail to describe nonlinear systes globally. An accurate approxiation of a nonlinear syste can only be expected in the vicinity of an equilibriu point or trajectory. A large class of nonlinear systes can be well approxiated by TS fuzzy odels [1], which in theory can approxiate a general nonlinear syste to an arbitrary accuracy [2]. The TS fuzzy odel consists of a fuzzy rule base. The antecedents of the rules partition a given subspace of the odel variables into fuzzy regions. The consequent of each rule is usually a linear odel, valid locally in the region defined by the corresponding antecedent. Although the local odels are often chosen to be linear or affine, the stability of these odels does not ensure the stability of the fuzzy odel. Therefore, several stability conditions have been developed for TS fuzzy systes, ost of the relying on the feasibility of an associated syste of linear atrix inequalities (LMI) [3]-[6]. However, the The authors are with the Delft Center for Systes Control, Delft University of Technology, Mekelweg 2, 2628 CD Delft, The Netherls (eail: zs.lendek@tudelft.nl, r.babuska@tudelft.nl). B. De Schutter is also with the Marine Transport Technology Departent of the Delft University of Technology (eail: b@deschutter.info). coplexity of the syste grows exponentially with the nuber of antecedents the stability analysis proble eventually becoes intractable for a large nuber of rules. An iportant class of nonlinear dynaic systes can be represented as cascaded subsystes. In several cases, conclusions referring to the overall syste can be drawn based on the study of the individual subsystes. E. g., for linear systes, the stability of the individual subsystes iply the stability of the cascaded syste [7]. This property, however, in general does not hold for nonlinear or tievarying systes. Even global asyptotic stability of the individual subsystes does not necessarily iply stability of the cascade. In the literature, the stability of several types of cascaded systes has been studied. The ain otivation cae fro the linear-nonlinear cascade [8], resulting fro input-output linearization. Conditions to ensure the overall stability of ore general cascades, in which all subsystes are nonlinear, were derived in [7], [9], [1]. We study a special class of systes, represented as TS fuzzy systes, which can be decoposed into cascaded subsystes, analyze the stability of the whole syste based on the stability of the subsystes. This class of systes is very iportant, as any systes are naturally distributed (e.g., ulti-agent systes) or cascaded (e.g., hierarchical large-scale systes). Others ay be represented as cascaded subsystes, which are less coplex than the original syste. The ain benefit of this approach is, that it relaxes the conditions iposed by analyzing the global syste. A global analysis of the syste ay lead to infeasible LMI probles, even if the analyzed syste is stable. In this paper, we propose ore relaxed stability conditions, which ay render the associated LMI proble feasible. Moreover, for soe applications, the diension of the associated LMI syste is greatly reduced. The results presented can also be extended to observer design for the class of cascaded systes. The structure of the paper is as follows. Section 2 introduces the proposed cascaded setting for nonlinear systes presents stability conditions for cascaded systes for TS fuzzy odels. The proposed stability conditions for cascaded fuzzy systes are presented in Section 3. Exaples are given in Section 4. Finally, Section 5 concludes the paper /7/$ IEEE. Authorized licensed use liited to: Technische Universiteit Delft. Downloaded on June 9, 29 at 6:52 fro IEEE Xplore. Restrictions apply.

2 II. STABILITY OF CASCADED DYNAMIC SYSTEMS A. Preliinaries Consider the following nth order, general nonlinear syste with outputs: ±1 = fi (x, U) X2 = f2 (X, U) Yi = hi(x,u) Y2 = h2(x,u) ±n = fn (X, U) Y = h(x, u) Assue that this syste (both the states the outputs) can be partitioned into several subsystes. For the ease of notation, two subsystes are considered here (without loss of generality): (1) t1 = fl(tl, u) ~~~(2) Yi hi (xi, u) 2= f2(x, X2,U) (3) Y2 = h2(x, X2, u) with x = X1 UX2 1xn X2 = In general, such a partition of the odel ay not necessarily exist,, if it exists, it ight not be unique. Since stability is independent of the easureent odels h, h2, in the sequel, the odels h, h2 are not considered. Then, for two subsystes, the cascaded structure is depicted in Figure 1. Fig. 1. Cascaded subsystes. B. Stability of Cascaded Systes It is well-known that the cascade of stable linear systes is stable, since the eigenvalues of the joint syste are deterined only by the eigenvalues of the individual subsystes [7]. Therefore, the stability of the subsystes iplies the stability of the joint syste. However, the sae reasoning does not necessarily hold for nonlinear or tievarying systes. Even global asyptotic stability (GAS) of the individual subsystes does not necessarily iply the stability of the cascade. In the literature, the stability of several special cases is studied. The ain otivation coes fro a linear-nonlinear cascade resulting fro input-output linearization [8]. More general cascades in which both subsystes are nonlinear were studied conditions to ensure the overall stability were presented in [7]. Several relevant results are presented below. Definition 1: A continuous function a : >R+> R+ belongs to class IC if it is strictly increasing a?(o) =. If a(s) -> oo when s -> oo, then a is said to be of class /C. Consider the nonlinear, cascaded, autonoous syste It has been shown in tl = fi(xi) X2 = f2l, X2) [11] that if (4) (5). the functions fi f2 are sufficiently sooth in their arguents, * syste (5) is input-to-state-stable with regard to the input x1,. syste (4) X2 = f2(ix2) (6) are GAS, then the cascaded syste (4)-(5) is GAS. An equivalent sufficient stability condition is presented in [1]: the cascaded syste is GAS, if both subsystes are GAS all solutions are bounded. The ain difficulty with this approach is that in general, boundedness of all the solutions is not easy to deterine the conditions to ensure boundedness ay be very conservative. More relaxed sufficient stability conditions have been derived for systes of the for: i f (xi) ( x) (7) _t2 f2(x2) + 9(X1, X2) assuing that the individual subsystes are GAS, additionally, certain restrictions related to the continuity /or slope, apply for the interconnection ter g [8], [12], [13]. A theore for the unifor GAS (UGAS) of the cascaded syste (7) [7] is presented below. Assuptions: 1) Syste (6) is UGAS. 2) There exist constants cl, c2,,u > a Lyapunov function V(t, X2) for (6) such that V : R+ x R' --> R+ is positive definite, radially unbounded, V(t, X2) < o < ClV(t,Xi2) V'1X2 1 >, av OX2-121< 3) There exist two continuous functions 1, 2 :R+ R+ such that g(x) satisfies:..g(x).. <- 1QXfl.) +2QXfl.)..X2.. (9) 4) There exists a class IC function a(.) so that for all to >, the trajectories of the syste (4) satisfy r J 41 (t; to, xi (to)) dt < aq(x (to) ) (1) Theore 1: Let Assuption 1 hold suppose that the trajectories of (4) are uniforly globally bounded. If in addition, Assuptions 2-4 are satisfied, then the solutions ofthe Authorized licensed use liited to: Technische Universiteit Delft. Downloaded on June 9, 29 at 6:52 fro IEEE Xplore. Restrictions apply.

3 syste (7) are uniforly globally bounded. If furtherore, syste (4) is UGAS, then so is the cascaded syste (7). Proposition 1: If in addition to the above assuptions systes (4) (6) are exponentially stable, then the cascaded syste (7) is also exponentially stable. The proof of the Theore 1 the study of different cases of the interconnection ter can be found in [7], [8]. Stabilizability conditions for such cascaded systes were derived in [13], [14]. C. Stability of Fuzzy Systes Consider an autonoous fuzzy syste expressed as: IEwi(z)Aix, (1 where Ai, i = 1, 2,... is the state atrix of the ith local linear odel, wi is its corresponding noralized ebership function, z denotes the scheduling vector. Syste (11) can also be regarded as a linear paraeter varying (LPV) syste: =A(z) (12) with A(z) Z> Wi(z)Ai. For the syste (11), several stability conditions were derived. Aong the, a well-known frequently used condition is forulated below [3]. Theore 2: Syste (11) is exponentially stable if there exist p pt > so that AiP + PAi <, for alli 1, 2,...,. A siilar condition is used if the fuzzy syste is subject to vanishing disturbances (perturbations): z = 5 wi (z)aix + Df (t, x) (13) where D is a perturbation distribution atrix f is a vanishing disturbance, i.e., f (t, x) > when t > oo, f is Lipschitz, i.e., there exists,u > so that f(t, x) <p,ulxz for all t x. With these assuptions, a sufficient stability condition can be foralized by the following theore. Theore 3: Syste (13) is exponentially stable if there exist atrices p = pt, Q = QT, so that P>O Q>O < Ain (Q) +PDA<2 AfTp±+PA < -2Q i= 1, 2,..., Several variants of the above theore exist, together with algoriths to copute robustness easures [15]. However, these approaches are conservative, by disregarding the fact that the local odels are valid only in a region of the state-space. For fuzzy systes, the ebership functions often have a bounded support. Therefore, it is sufficient that xt (ATP + PA T)X < only where wi (z) >. Stability conditions for the case when the support of each ebership function is bounded were derived in [4]. Another approach, based on partitioning the state-space into operating interpolation regies, is described in [16]. Assuing that in (11), z can be expressed as soe function of x, the syste can be written as: = Ewi(K)Aix iekk X C Xk (15) where Kk is the index set of the linear subsystes active in the region Xk. Then, using a Lyapunov function of the for V(x) xtpx when x C Xi, the syste (15) is stable, under the conditions expressed by the following theore [16]. Theore 4: Syste (15) is stable, if there exist atrices Pi = PT, H HT>,F,i 1, 2,..., IKl, so that: Pi F THFi Pi > FAx F <x AkfP, + PtAk < Vx C Xi n X Vk C Ki (16) For ore relaxed conditions, the coputations of the corresponding atrices see [17], [18]. Siilar conditions for the discrete-tie case are described in [19]. Last, but not least, for a paraeter-dependent Lyapunov function of the for: V(x) = xtp(z)x = XT 5 wi(z)pi (17) the stability conditions can be forulated as follows [15]. Theore 5: The syste (11) is stable if there exist a >, P P >,P Pi >, A, = A T >, Q = QT > so that P -Ai <P P+Ai >Pi Gii < -Q (18) Gij + Gji <-Q 5I Ai < aq where Gij = Ai j + PjAi, j = 1, 2,...,. Note that all the above conditions rely on the feasibility of the corresponding linear atrix inequality proble. Since efficient algoriths exist for solving LMIs, they can be easily verified. However, two shortcoings of the above theores have to be entioned: 1) the conditions are conservative often lead to infeasible LMIs 2) the nuber of LMIs can grow exponentially with the nuber of local odels, depending on the support of the ebership functions (in particular for Theores 4-5). III. STABILITY OF CASCADED FuzzY SYSTEMS Consider the case when the syste atrices of the odel (1 1) for each rule i = 1, 2,..., can be written as: Ai (A1 O2\ (Ali ~A21 A2) A21i A2) Authorized licensed use liited to: Technische Universiteit Delft. Downloaded on June 9, 29 at 6:52 fro IEEE Xplore. Restrictions apply.

4 i.e., the syste can be expressed as the cascade of two fuzzy systes: 1=Ewij(zi)Aijxi (19) Xt2 = W2i (z) (A2liAl + A2iX2) or, equivalently: with =Ali(zl)xl (2) -t2 =A21 (Z) Xt1+A2 (Z) X2 A1(Zi) = Ewij(zi)Aixi, A21(z) = EW2i(z)A21iX1, etc. Below, we prove that if the subsystes i = Al(zl)xl (21) X2 =A2(z)2 (22) are stable, it is possible to apply Theore 1 to fuzzy systes of the for (19), i.e., Theore 6: If there exist two Lyapunov functions of the for Vi(xi) = xipxi V2(X2) P2X2 so that the subsystes (21) (22) are UGAS, then the cascaded syste (2) is also UGAS. Proof: Consider two Lyapunov functions of the for Vi(xi) = 4TP x V2(X2) = XT4P2X2 for the subsystes (21) (22). Note that such Lyapunov functions satisfy Assuptions 1 4 also ensure exponential stability. Furtherore,. Assuption 2 is satisfied as: V 1X211 >,u x242 =2 P2 X2 < 2Aax (P2) X2 2 < Cl V2 (X2) for any cl > 2Aax (P2) For the second condition Ai.n(P2) condition of Assuption 2, we have V x2 <, 2 = XT24P2 < 2 42H P2 < 2IiAax(P2) = C2. Assuption 3 is satisfied by choosing continuous functions aj(xf1 a2(qxl1) = - ( ) ax la21(z2) x1 Since the conditions of Theore 1 are satisfied, the cascaded syste is UGAS. Furtherore, if these Lyapunov functions ensure exponential stability of the subsystes, then, based on Proposition 1, the cascaded syste is also exponentially stable. LIi Z2 While it is true that the cascaded syste is stable under the above conditions, finding a Lyapunov function valid for the cascaded syste is not trivial. The construction of a crosster in the global Lyapunov function has been proposed in [12], under the condition that the cascaded syste satisfies Assuptions 2 3. Then, the global Lyapunov function is of the for: VO(Xl,X2) = Vl(Xl) + V2(X2) + T(Xl,X2) (23) where V1 V2 are Lyapunov functions for the (21) (22), respectively. systes For the case when the first subsyste is LTI, the authors of [12] proved that the cross-ter exists is continuous, Vo is positive definite radially unbounded. If (21) is globally exponentially stable, the result fro [12] can be extended to the syste (2). The cross-ter T is then given by: T(X1, X2)= V (-i2(s))a21(z(s)).tr-(s)ds where x1 x2 are the trajectories of the systes (21) (22), respectively. To verify the stability of the cascaded fuzzy syste (19) by the Theores 2-5 fro Section II-C, additional sufficient, but by no eans necessary conditions can be derived using a Lyapunov function of the for VO(X,X2) = Vl(Xi) + V2 (X2). For exaple, Theore 2 requires a coon atrix P = pt > so that A TP + PAi <. Let P = diag[pl P2] = pt >. Then, the additional condition to those of Theore 6, to satisfy the requireents of Theore 2 is the negative definiteness of Gi for all i = 1, 2,..., with G, = Al Tpl + PiAl Gi= V P2A21 A21TP2 A2TP2 + P2A2 In the sae way, for all the above theores, the stability conditions presented in Section II-C can be relaxed. The new conditions for Theores 3 4 are presented below. The conditions of Theore 3 can be replaced as follows. Theore 7: Consider the syste (19) expressed as:.c=zwi(z) (1 A2) (A21 (Z) ) This syste is stable, if there exist Pi = PfT >, P2 P2T >, so that: AfTP1 + P1Ajj < A2P2 + P2A2i < for all i = 1, 2,...,. The proof is siilar to that of Theore 6. Note that in order to satisfy all the conditions of Theore 3 an additional condition is needed: there exists Q =QT > so that: 1 < Ain (Q) in P2A21 (Z) i Authorized licensed use liited to: Technische Universiteit Delft. Downloaded on June 9, 29 at 6:52 fro IEEE Xplore. Restrictions apply.

5 However, this condition is necessary only when applying Theore 3, is no longer needed to prove the stability of the cascaded syste (2). In order to relax the conditions of Theore 4 let K1 K2 be the nuber of operating interpolation regies for the individual subsystes, with K{ K2 the index set corresponding to the local odels of the subsystes active in the atching region. Then, the conditions can be expressed as: Theore 8: The syste (15) is UGAS, if there exist atrices pl = (p1 )T >, Pi = (p21)t >, H1 HT >, H2 = H2T >, F1, 1, 2,...,K2, so that: F2j, i = 1, 2,...,K1, j PFI= (F¾ciH P= F2i)TH2F2 Xi = F i zcx1 n xl F3it = F2t2 VX2 C x-i n X2 ',I (24) Ax AfJkPL + P Alk<k A2¾kP2Y + P2A2k < Vk C K1 Vk C K2 The additional condition to satisfy Theore 4 is: Ain(Pi Al ) Ain (P2A2) < P2A21k, k C Ki Siilarly, this condition is necessary only to satisfy all the conditions of Theore 4 is no longer needed to prove stability of the cascaded syste (2). When applying Theore 5, the restrictions on Gii Gij have to be odified, which leads to conditions siilar to those of Theore 4. Note, that the proposed conditions are still only sufficient conditions for the stability of cascaded fuzzy systes. However, by taking the advantage of the special for of the syste, i.e., studying the subsystes instead of global fuzzy syste, the coplexity of the associated LMI proble is reduced with respect to the presented Theores 2-5. IV. EXAMPLES In this section, the benefits of the proposed approach are deonstrated on siulation exaples. A. Feasibility Consider the fuzzy syste: 2 + =,wi(z)aix (25) with w, (z) = w(t) t w2 (t) = 1- w (t), for all At t C [, At], i.e., the syste changes in tie fro one local odel to another. The state atrices of the local linear odels were roly generated are given as: A A2 = / The local odels are stable siulations indicate that the syste (25) is also stable. However, the LMI proble P > O ATP + PA1 < ATP + PA2 < is infeasible, so Theores 2 3 cannot be applied. The stability of this syste can be investigated using Theores 4-5. By exaining the for of the syste atrices, one can easily see that the syste can be cascaded, with x 1 [X1 X2 X3]1 X2 = [X4 X5 X6]T Based on Theore 6, the syste (25) is stable if the individual subsystes are stable. As such, in order to prove the stability of the syste (25), it is sufficient that the LMI probles (Theore 6) Pi > ATLP1 + P1All < ATP1 + P1A12 < A12P2 + P2A12 < A2fP2 + P2A22 < P2 > are feasible. Using Yalip's solvesdp [2] one can easily see that it is so. This exaple illustrates the ain benefit of the proposed stability conditions: while the conditions iposed by conventional ethods lead to an infeasible LMI syste, it is still possible to prove stability of the syste under study. B. Diension reduction Consider the nonlinear syste: 1 =X- X2 =-2x2 + 16x,z2sinz where z C [-w, w] is a easured variable. It can be proven that this syste is globally asyptotically stable, e.g., by using the Lyapunov function V = 64w4x2 +42 A fuzzy approxiation of this syste can be obtained by linearizing the syste around all z C {- w,j-r/2, -w/4,, w/4, w/2, w}. The obtained atrices Authorized licensed use liited to: Technische Universiteit Delft. Downloaded on June 9, 29 at 6:52 fro IEEE Xplore. Restrictions apply.

6 are: A(t-j) = A(O) = A()= At-gr2)= (47 2-2) A(- /4) =( 222 ) A(7/4) (= 2w2 2) A(7/2) =4r (412 2) i.e., there are 5 distinct local linear odels. Using Theore 2, this eans that 5 LMIs have to be solved, while in case of Theores 4 5, this nuber is uch larger (11 13, respectively). However, using the proposed approach, the proble is reduced to two one-diensional LMIs: -1P + P1 (-1) < -2P2 + P2(-2) < This exaple illustrates how, by analyzing the subsystes instead of the global fuzzy syste, both the nuber of LMIs their diension can be reduced. V. CONCLUSIONS In any real-life applications, a coplex process odel can be decoposed into sipler, cascaded subsystes. This partitioning of a process leads to increased odularity reduced coplexity of the proble, while also aking the analysis easier. In this paper, we have studied the stability of a cascaded fuzzy syste, based on its individual subsystes. We have proven that the stability of such a syste is deterined only by the stability of the individual subsystes. Furtherore, the proposed approach relaxes the conventional stability conditions ay reduce the diension of the proble to be solved. The benefits of studying stability based on subsystes have been deonstrated on siulation exaples. In our future research, we will investigate the theoretical conditions under which observers can be designed individually for such cascaded processes while aintaining the sae perforance (stability, convergence rate) as a centralized observer. [3] K. Tanaka, T. Ikeda, H. Wang, "Fuzzy regulators fuzzy observers: relaxed stability conditions LMI-based designs," IEEE Transactions on Fuzzy Systes, vol. 6, pp , [4] M. Johansson, A. Rantzer, K. Arzen, "Piecewise quadratic stability of fuzzy systes," IEEE Transactions on Fuzzy Systes, vol. 7, pp , [5] P. Bergsten, R. Pal, D. Driankov, "Fuzzy observers," in The 1th IEEE International Conference on Fuzzy Systes, 21, vol. 2, 21, pp [6] K. Tanaka H.. Wang, Fuzzy Control Systes Design Analysis: A Linear Matrix Inequality Approach. John Wiley & Sons, Inc., 21. [7] A. Loria E. Panteley, Advanced Topics in Control Systes Theory. Springer Berlin / Heidelberg, 25, ch. Cascaded nonlinear tievarying systes: Analysis design, pp [8] M. Arcak, D. Angeli, E. Sontag, "A unifying integral ISS fraework for stability of nonlinear cascades," SIAM J. Control Opti., vol. 4, pp , 22. [9] E. D. Sontag, "Sooth stabilization iplies coprie factorization," IEEE Transactions on Autoatic Control,, vol. 34, pp , [1] P. Seibert R. Suarez, "Global stabilization of nonlinear cascade systes," Systes Control Letters, vol. 14, pp , 199. [11] E. Sontag, "Rearks on stabilization input-to-state stability," in IEEE CDC, 1989, pp [12] M. Jankovic, R. Sepulchre, P. Kokotovic, "Constructive Lyapunov stabilization of nonlinear cascade systes," IEEE Transactions on Autoatic Control, vol. 41, pp , [13] A. Chaillet A. Loria, "Necessary sufficient conditions for unifor seiglobal practical asyptotic stability: Application to cascaded systes," Autoatica, vol. 42, pp , 26. [14] A. Bacciotti, P. Boieri, L. Mazzi, "Linear stabilization of nonlinear cascade systes," Math. Control, Signals, Syst., vol. 6, pp , [15] P. Bergsten, "Observers controllers for Takagi-Sugeno fuzzy systes," Ph.D. dissertation, Orebro University, 21. [16] A. Rantzer M. Johansson, "Piecewise linear quadratic optial control," IEEE Transactions on Autoatic Control, vol. 45, pp , 2. [17] M. Johansson A. Rantzer, "Coputation of piecewise quadratic Lyapunov functions for hybrid systes," IEEE Transactions on Autoatic Control, vol. 43, pp , [18] M. Johansson, "Piecewise linear control systes," Ph.D. dissertation, Departent of Autoatic Control, Lund Institute of Technology, [19] W.-J. Wang C.-H. Sun, "Relaxed stability stabilization conditions for a TS fuzzy discrete syste," Fuzzy Sets Systes, vol. 156, pp , 25. [2] J. Lofberg, " YALMIP: a toolbox for odeling optiization in MATLAB," in Proceedings of the CACSD Conference, Taipei, Taiwan, 24. [Online]. Available: joloef/yalip.php ACKNOWLEDGMENT This research is partly sponsored by Senter, Ministry of Econoic Affairs of the Netherls within the project Interactive Collaborative Inforation Systes (grant no. BSIK324). REFERENCES [1] T. Takagi M. Sugeno, "Fuzzy identification of systes its applications to odeling control," IEEE Transactions on Systes, Man, Cybernetics, vol. 15, pp , [2] C. Fantuzzi R. Rovatti, "On the approxiation capabilities of the hoogeneous takagi-sugeno odel," in Fifth IEEE International Conference on Fuzzy Systes (FUZZ-IEEE'96), 1996, pp Authorized licensed use liited to: Technische Universiteit Delft. Downloaded on June 9, 29 at 6:52 fro IEEE Xplore. Restrictions apply.

Stability of cascaded Takagi-Sugeno fuzzy systems

Stability of cascaded Takagi-Sugeno fuzzy systems Delft University of Technology Delft Center for Systems Control Technical report 07-012 Stability of cascaded Takagi-Sugeno fuzzy systems Zs. Lendek, R. Babuška, B. De Schutter If you want to cite this

More information

Stability of cascaded fuzzy systems and observers

Stability of cascaded fuzzy systems and observers Delft University of Technology Delft Center for Systems and Control Technical report 8-1 Stability of cascaded fuzzy systems and observers Zs. Lendek, R. Babuška, and B. De Schutter If you want to cite

More information

STABILITY RESULTS FOR CONTINUOUS AND DISCRETE TIME LINEAR PARAMETER VARYING SYSTEMS

STABILITY RESULTS FOR CONTINUOUS AND DISCRETE TIME LINEAR PARAMETER VARYING SYSTEMS STABILITY RESULTS FOR CONTINUOUS AND DISCRETE TIME LINEAR PARAMETER VARYING SYSTEMS Franco Blanchini Stefano Miani Carlo Savorgnan,1 DIMI, Università degli Studi di Udine, Via delle Scienze 208, 33100

More information

Multi-Dimensional Hegselmann-Krause Dynamics

Multi-Dimensional Hegselmann-Krause Dynamics Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory

More information

Hybrid System Identification: An SDP Approach

Hybrid System Identification: An SDP Approach 49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The

More information

Constrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008

Constrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008 LIDS Report 2779 1 Constrained Consensus and Optiization in Multi-Agent Networks arxiv:0802.3922v2 [ath.oc] 17 Dec 2008 Angelia Nedić, Asuan Ozdaglar, and Pablo A. Parrilo February 15, 2013 Abstract We

More information

Decentralized Adaptive Control of Nonlinear Systems Using Radial Basis Neural Networks

Decentralized Adaptive Control of Nonlinear Systems Using Radial Basis Neural Networks 050 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 44, NO., NOVEMBER 999 Decentralized Adaptive Control of Nonlinear Systes Using Radial Basis Neural Networks Jeffrey T. Spooner and Kevin M. Passino Abstract

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

On Lotka-Volterra Evolution Law

On Lotka-Volterra Evolution Law Advanced Studies in Biology, Vol. 3, 0, no. 4, 6 67 On Lota-Volterra Evolution Law Farruh Muhaedov Faculty of Science, International Islaic University Malaysia P.O. Box, 4, 570, Kuantan, Pahang, Malaysia

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October

More information

Distributed Subgradient Methods for Multi-agent Optimization

Distributed Subgradient Methods for Multi-agent Optimization 1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 5, MAY /$ IEEE

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 5, MAY /$ IEEE IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 5, MAY 2009 1035 TABLE IV COMPARISON OF NUMERICAL SENSITIVITY FROM BOTH APPROACHES as (19), and copute the standard deviation of the values of the corresponding

More information

Adaptive Stabilization of a Class of Nonlinear Systems With Nonparametric Uncertainty

Adaptive Stabilization of a Class of Nonlinear Systems With Nonparametric Uncertainty IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 46, NO. 11, NOVEMBER 2001 1821 Adaptive Stabilization of a Class of Nonlinear Systes With Nonparaetric Uncertainty Aleander V. Roup and Dennis S. Bernstein

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Journal of Marine Science and Technology, Vol 19, No 5, pp 509-513 (2011) 509 LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Ming-Tao Chou* Key words: fuzzy tie series, fuzzy forecasting,

More information

Optimal Jamming Over Additive Noise: Vector Source-Channel Case

Optimal Jamming Over Additive Noise: Vector Source-Channel Case Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE7C (Spring 018: Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee7c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee7c@berkeley.edu October 15,

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

Studying Large Scale System Using Decentralized Control

Studying Large Scale System Using Decentralized Control Studyin Lare Scale Syste Usin Decentralized Control MRHOJJAI, SAKRAMINEJAD, MRAZMDIDEH Mechanic Electronic Institute, Junior Collee of asa, IRAN hojatir@ailco, sakrain@ailco, ahdiehlady@yahooco Abstract:

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

Sharp Time Data Tradeoffs for Linear Inverse Problems

Sharp Time Data Tradeoffs for Linear Inverse Problems Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used

More information

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. IX Uncertainty Models For Robustness Analysis - A. Garulli, A. Tesi and A. Vicino

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. IX Uncertainty Models For Robustness Analysis - A. Garulli, A. Tesi and A. Vicino UNCERTAINTY MODELS FOR ROBUSTNESS ANALYSIS A. Garulli Dipartiento di Ingegneria dell Inforazione, Università di Siena, Italy A. Tesi Dipartiento di Sistei e Inforatica, Università di Firenze, Italy A.

More information

Department of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China

Department of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China 6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith

More information

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and

More information

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109

More information

Supplementary Information for Design of Bending Multi-Layer Electroactive Polymer Actuators

Supplementary Information for Design of Bending Multi-Layer Electroactive Polymer Actuators Suppleentary Inforation for Design of Bending Multi-Layer Electroactive Polyer Actuators Bavani Balakrisnan, Alek Nacev, and Elisabeth Sela University of Maryland, College Park, Maryland 074 1 Analytical

More information

Asynchronous Gossip Algorithms for Stochastic Optimization

Asynchronous Gossip Algorithms for Stochastic Optimization Asynchronous Gossip Algoriths for Stochastic Optiization S. Sundhar Ra ECE Dept. University of Illinois Urbana, IL 680 ssrini@illinois.edu A. Nedić IESE Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul

More information

Chaotic Coupled Map Lattices

Chaotic Coupled Map Lattices Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each

More information

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax:

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax: A general forulation of the cross-nested logit odel Michel Bierlaire, EPFL Conference paper STRC 2001 Session: Choices A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics,

More information

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN

More information

Data-Driven Imaging in Anisotropic Media

Data-Driven Imaging in Anisotropic Media 18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands

More information

Fixed-to-Variable Length Distribution Matching

Fixed-to-Variable Length Distribution Matching Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de

More information

Ch 12: Variations on Backpropagation

Ch 12: Variations on Backpropagation Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

Ufuk Demirci* and Feza Kerestecioglu**

Ufuk Demirci* and Feza Kerestecioglu** 1 INDIRECT ADAPTIVE CONTROL OF MISSILES Ufuk Deirci* and Feza Kerestecioglu** *Turkish Navy Guided Missile Test Station, Beykoz, Istanbul, TURKEY **Departent of Electrical and Electronics Engineering,

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

Internet-Based Teleoperation of Carts Considering Effects of Time Delay via Continuous Pole Placement

Internet-Based Teleoperation of Carts Considering Effects of Time Delay via Continuous Pole Placement Aerican Journal of Engineering and Applied Sciences Original Research Paper Internet-Based Teleoperation of Carts Considering Effects of Tie Delay via Continuous Pole Placeent Theophilus Okore-Hanson and

More information

A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEM

A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEM INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volue 3, Nuber 2, Pages 211 231 c 2006 Institute for Scientific Coputing and Inforation A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR

More information

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,

More information

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

OPTIMIZATION in multi-agent networks has attracted

OPTIMIZATION in multi-agent networks has attracted Distributed constrained optiization and consensus in uncertain networks via proxial iniization Kostas Margellos, Alessandro Falsone, Sione Garatti and Maria Prandini arxiv:603.039v3 [ath.oc] 3 May 07 Abstract

More information

Comparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations

Comparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations International Journal of Applied Science and Technology Vol. 7, No. 3, Septeber 217 Coparison of Stability of Selected Nuerical Methods for Solving Stiff Sei- Linear Differential Equations Kwaku Darkwah

More information

A NOVEL FOR EXPONENTIAL STABILITY OF LINEAR SYSTEMS WITH MULTIPLE TIME-VARYING DELAYS

A NOVEL FOR EXPONENTIAL STABILITY OF LINEAR SYSTEMS WITH MULTIPLE TIME-VARYING DELAYS International Journal of Pure and Applied Matheatics Volue 96 No. 4 2014, 529-538 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpa.eu doi: http://dx.doi.org/10.12732/ijpa.v96i4.8

More information

Ph 20.3 Numerical Solution of Ordinary Differential Equations

Ph 20.3 Numerical Solution of Ordinary Differential Equations Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a

More information

Lecture 21. Interior Point Methods Setup and Algorithm

Lecture 21. Interior Point Methods Setup and Algorithm Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and

More information

Understanding Machine Learning Solution Manual

Understanding Machine Learning Solution Manual Understanding Machine Learning Solution Manual Written by Alon Gonen Edited by Dana Rubinstein Noveber 17, 2014 2 Gentle Start 1. Given S = ((x i, y i )), define the ultivariate polynoial p S (x) = i []:y

More information

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna

More information

Adaptive Controller Design for a Synchronous Generator with Unknown Perturbation in Mechanical Power

Adaptive Controller Design for a Synchronous Generator with Unknown Perturbation in Mechanical Power 308 International Journal of Control Xiaohong Autoation Jiao Yuanzhang and Systes Sun vol and 3 Tielong no (special Shen edition) pp 308-34 June 005 Adaptive Controller Design for a Synchronous Generator

More information

Stochastic Subgradient Methods

Stochastic Subgradient Methods Stochastic Subgradient Methods Lingjie Weng Yutian Chen Bren School of Inforation and Coputer Science University of California, Irvine {wengl, yutianc}@ics.uci.edu Abstract Stochastic subgradient ethods

More information

Multi-view Discriminative Manifold Embedding for Pattern Classification

Multi-view Discriminative Manifold Embedding for Pattern Classification Multi-view Discriinative Manifold Ebedding for Pattern Classification X. Wang Departen of Inforation Zhenghzou 450053, China Y. Guo Departent of Digestive Zhengzhou 450053, China Z. Wang Henan University

More information

Analyzing Simulation Results

Analyzing Simulation Results Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient

More information

IAENG International Journal of Computer Science, 42:2, IJCS_42_2_06. Approximation Capabilities of Interpretable Fuzzy Inference Systems

IAENG International Journal of Computer Science, 42:2, IJCS_42_2_06. Approximation Capabilities of Interpretable Fuzzy Inference Systems IAENG International Journal of Coputer Science, 4:, IJCS_4 6 Approxiation Capabilities of Interpretable Fuzzy Inference Systes Hirofui Miyajia, Noritaka Shigei, and Hiroi Miyajia 3 Abstract Many studies

More information

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL

More information

Research Article On the Isolated Vertices and Connectivity in Random Intersection Graphs

Research Article On the Isolated Vertices and Connectivity in Random Intersection Graphs International Cobinatorics Volue 2011, Article ID 872703, 9 pages doi:10.1155/2011/872703 Research Article On the Isolated Vertices and Connectivity in Rando Intersection Graphs Yilun Shang Institute for

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

A Markov Framework for the Simple Genetic Algorithm

A Markov Framework for the Simple Genetic Algorithm A arkov Fraework for the Siple Genetic Algorith Thoas E. Davis*, Jose C. Principe Electrical Engineering Departent University of Florida, Gainesville, FL 326 *WL/NGS Eglin AFB, FL32542 Abstract This paper

More information

Computational and Statistical Learning Theory

Computational and Statistical Learning Theory Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher

More information

Modeling Chemical Reactions with Single Reactant Specie

Modeling Chemical Reactions with Single Reactant Specie Modeling Cheical Reactions with Single Reactant Specie Abhyudai Singh and João edro Hespanha Abstract A procedure for constructing approxiate stochastic odels for cheical reactions involving a single reactant

More information

Nonlinear Backstepping Learning-based Adaptive Control of Electromagnetic Actuators with Proof of Stability

Nonlinear Backstepping Learning-based Adaptive Control of Electromagnetic Actuators with Proof of Stability MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.erl.co Nonlinear Backstepping Learning-based Adaptive Control of Electroagnetic Actuators with Proof of Stability Benosan, M.; Atinc, G.M. TR3-36 Deceber

More information

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket. Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,

More information

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer

More information

On Conditions for Linearity of Optimal Estimation

On Conditions for Linearity of Optimal Estimation On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

Average Consensus and Gossip Algorithms in Networks with Stochastic Asymmetric Communications

Average Consensus and Gossip Algorithms in Networks with Stochastic Asymmetric Communications Average Consensus and Gossip Algoriths in Networks with Stochastic Asyetric Counications Duarte Antunes, Daniel Silvestre, Carlos Silvestre Abstract We consider that a set of distributed agents desire

More information

Machine Learning Basics: Estimators, Bias and Variance

Machine Learning Basics: Estimators, Bias and Variance Machine Learning Basics: Estiators, Bias and Variance Sargur N. srihari@cedar.buffalo.edu This is part of lecture slides on Deep Learning: http://www.cedar.buffalo.edu/~srihari/cse676 1 Topics in Basics

More information

On random Boolean threshold networks

On random Boolean threshold networks On rando Boolean threshold networs Reinhard Hecel, Steffen Schober and Martin Bossert Institute of Telecounications and Applied Inforation Theory Ul University Albert-Einstein-Allee 43, 89081Ul, Gerany

More information

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,

More information

Research Article Approximate Multidegree Reduction of λ-bézier Curves

Research Article Approximate Multidegree Reduction of λ-bézier Curves Matheatical Probles in Engineering Volue 6 Article ID 87 pages http://dxdoiorg//6/87 Research Article Approxiate Multidegree Reduction of λ-bézier Curves Gang Hu Huanxin Cao and Suxia Zhang Departent of

More information

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES

More information

Fairness via priority scheduling

Fairness via priority scheduling Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation

More information

RANDOM GRADIENT EXTRAPOLATION FOR DISTRIBUTED AND STOCHASTIC OPTIMIZATION

RANDOM GRADIENT EXTRAPOLATION FOR DISTRIBUTED AND STOCHASTIC OPTIMIZATION RANDOM GRADIENT EXTRAPOLATION FOR DISTRIBUTED AND STOCHASTIC OPTIMIZATION GUANGHUI LAN AND YI ZHOU Abstract. In this paper, we consider a class of finite-su convex optiization probles defined over a distributed

More information

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t. CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when

More information

arxiv: v3 [cs.sy] 29 Dec 2014

arxiv: v3 [cs.sy] 29 Dec 2014 A QUADRATIC LOWER BOUND FOR THE CONVERGENCE RATE IN THE ONE-DIMENSIONAL HEGSELMANN-KRAUSE BOUNDED CONFIDENCE DYNAMICS EDVIN WEDIN AND PETER HEGARTY Abstract. Let f k n) be the axiu nuber of tie steps taken

More information

PRÜFER SUBSTITUTIONS ON A COUPLED SYSTEM INVOLVING THE p-laplacian

PRÜFER SUBSTITUTIONS ON A COUPLED SYSTEM INVOLVING THE p-laplacian Electronic Journal of Differential Equations, Vol. 23 (23), No. 23, pp. 9. ISSN: 72-669. URL: http://ejde.ath.txstate.edu or http://ejde.ath.unt.edu ftp ejde.ath.txstate.edu PRÜFER SUBSTITUTIONS ON A COUPLED

More information

Physics 215 Winter The Density Matrix

Physics 215 Winter The Density Matrix Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it

More information

The Methods of Solution for Constrained Nonlinear Programming

The Methods of Solution for Constrained Nonlinear Programming Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained

More information

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

More information

Lower Bounds for Quantized Matrix Completion

Lower Bounds for Quantized Matrix Completion Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &

More information

Donald Fussell. October 28, Computer Science Department The University of Texas at Austin. Point Masses and Force Fields.

Donald Fussell. October 28, Computer Science Department The University of Texas at Austin. Point Masses and Force Fields. s Vector Moving s and Coputer Science Departent The University of Texas at Austin October 28, 2014 s Vector Moving s Siple classical dynaics - point asses oved by forces Point asses can odel particles

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are,

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are, Page of 8 Suppleentary Materials: A ultiple testing procedure for ulti-diensional pairwise coparisons with application to gene expression studies Anjana Grandhi, Wenge Guo, Shyaal D. Peddada S Notations

More information

ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER

ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER IEPC 003-0034 ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER A. Bober, M. Guelan Asher Space Research Institute, Technion-Israel Institute of Technology, 3000 Haifa, Israel

More information

Statistics and Probability Letters

Statistics and Probability Letters Statistics and Probability Letters 79 2009 223 233 Contents lists available at ScienceDirect Statistics and Probability Letters journal hoepage: www.elsevier.co/locate/stapro A CLT for a one-diensional

More information

1 Rademacher Complexity Bounds

1 Rademacher Complexity Bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #10 Scribe: Max Goer March 07, 2013 1 Radeacher Coplexity Bounds Recall the following theore fro last lecture: Theore 1. With probability

More information

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40 On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words) 1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu

More information

Generalized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili,

Generalized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili, Australian Journal of Basic and Applied Sciences, 5(3): 35-358, 20 ISSN 99-878 Generalized AOR Method for Solving Syste of Linear Equations Davod Khojasteh Salkuyeh Departent of Matheatics, University

More information

12 Towards hydrodynamic equations J Nonlinear Dynamics II: Continuum Systems Lecture 12 Spring 2015

12 Towards hydrodynamic equations J Nonlinear Dynamics II: Continuum Systems Lecture 12 Spring 2015 18.354J Nonlinear Dynaics II: Continuu Systes Lecture 12 Spring 2015 12 Towards hydrodynaic equations The previous classes focussed on the continuu description of static (tie-independent) elastic systes.

More information

Boosting with log-loss

Boosting with log-loss Boosting with log-loss Marco Cusuano-Towner Septeber 2, 202 The proble Suppose we have data exaples {x i, y i ) i =... } for a two-class proble with y i {, }. Let F x) be the predictor function with the

More information

Tight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions

Tight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions Tight Inforation-Theoretic Lower Bounds for Welfare Maxiization in Cobinatorial Auctions Vahab Mirrokni Jan Vondrák Theory Group, Microsoft Dept of Matheatics Research Princeton University Redond, WA 9805

More information