Research Article Optimal Control of Probabilistic Logic Networks and Its Application to Real-Time Pricing of Electricity
|
|
- Douglas Butler
- 5 years ago
- Views:
Transcription
1 Hindawi Pubishing Corporation Mathematica Probems in Engineering Voume 05, Artice ID 950, 0 pages Research Artice Optima Contro of Probabiistic Logic Networks and Its Appication to Rea-Time Pricing of Eectricity Koichi Kobayashi and Kunihiko Hiraishi Graduate Schoo of Information Science and Technoogy, Hokkaido University, Sapporo , Japan Schoo of Information Science, Japan Advanced Institute of Science and Technoogy, Ishikawa 9-9, Japan Correspondence shoud be addressed to Koichi Kobayashi; k-kobaya@ssiisthokudaiacjp Received Juy 05; Revised 8 October 05; Accepted 6 November 05 Academic Editor: Qinging Zhang Copyright 05 K Kobayashi and K Hiraishi This is an open access artice distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the origina work is propery cited In anaysis and contro of arge-scae compex systems, a discrete mode pays an important roe In this paper, a probabiistic ogic network (PLN) is considered as a discrete mode A PLN is a mathematica mode where mutivaued ogic functions are randomy switched For a PLN with two kinds of contro inputs, the optima contro probem is formuated, and an approximate soution method for this probem is proposed In the proposed method, using a matrix-based representation for a PLN, this probem is approximated by a mixed integer inear programming probem In appication, rea-time pricing of eectricity is studied In reatime pricing, eectricity conservation is achieved by setting a high eectricity price A numerica exampe is presented to show the effectiveness of the proposed method Introduction In the ast decade, contro of arge-scae compex systems has attracted considerabe attention, where compex noninear dynamics are taken into account In such cases, one of the natura approaches is to approximatey sove the contro probem of such compex systems using simpification/abstraction techniques (see, eg, ) Specificay, a discrete abstract mode pays an important roe in anaysis and contro of argescae compex systems Severadiscretemodeshavebeenproposedsofar(see, eg, ) Petri nets, Bayesian networks, and automata-based modes are frequenty adopted as a mathematica mode in anaysis of arge-scae compex systems Athough Booean networks (BNs) are frequenty adopted as a mode for anaysis, BNs are recenty adopted as a mathematica mode in contro of arge-scae compex systems In a BN, the state takes a binary vaue (0 or ), and the dynamics such as interactions of states are modeed by a set of Booean functions In 4, it ispointedoutthatsinceabnistoosimpe,thebehaviorof arge-scae compex systems such as gene reguatory networks cannot be appropriatey modeed One of the methods to overcome this criticism is to extend Booean functions to mutivaued ogic functions From this viewpoint, severa modeing methods using mutivaued ogic functions have been studied so far (see, eg, 5 8) Furthermore, since the behavior of arge-scae compex systems is frequenty stochastic by the effects of noise, a probabiistic ogic network (PLN), which is an extension of a probabiistic BN (PBN) 9, has been studied so far (see, eg, 0, ) In a PLN, a mutivaued ogic function is randomy seected from the candidates of functions We adopt a PLN as a discrete mode In this paper, first, we formuate the optima contro probem for the PLN with two kinds of contro inputs One of contro inputs is a conventiona contro input, which is incuded in mutivaued ogic functions The other is caed here a structura contro input, which is incuded in a given discrete probabiity distribution By the structura contro input, a discrete probabiity distribution is controed Such a contro input has been considered in, for exampe, 5 Next, an approximate soution method for the optima contro probem is proposed Soution methods have been studied in 0 However, arge sized matrices must be handed From this fact, it is difficut to directy appy the existing methods to arge-scae systems Hence, it is important to consider a new soution method To derive
2 Mathematica Probems in Engineering an approximate soution method, a matrix-based representation of PLNs is proposed The authors have proposed a matrix-based representation of BNs 6 and that of probabiistic BNs However, mutivaued ogic functions have not been studied so far Using a matrix-based representation, the origina probem is approximated by a mixed integer inear programming (MILP) probem In the case where there is no conventiona contro input, the origina probem is approximated by a inear programming probem In 7, it has been proven that the optima contro probem of PBNs is Σ p -hard probem, which is much harder than an NPcompete probem Hence, approximating the optima contro probem of PLNs by an MILP probem is usefu for soving that of a wider cass of PLNs A PLN has severa appications such as gene reguatory networks and power systems As aready expained, BNs and PBNs are we known as a mode of gene reguatory networks Logica modes with mutivaued variabes are aso used in theoretica anaysis of gene reguatory networks A PLN can be regarded as a generaized mode of these mathematica modes In this paper, as one of the other appications, we consider rea-time pricing of eectricity (see, eg, 8 ) A rea-time pricing system of eectricity is a system that charges different eectricity prices for different hours of the day and for different days Rea-time pricing is effective for reducingthepeakandfatteningtheoadcurveingenera, a rea-time pricing system consists of one controer deciding thepriceateachtimeandmutipeeectricconsumerssuch as commercia faciities and homes If eectricity conservation is needed, then the price is set to a high vaue Since the economic oad becomes high, consumers conserve eectricity Thus, eectricity conservation is achieved In the existing methods, the price at each time is given by a simpe function with respect to power consumptions and votage deviations andsoon(see,eg,)theauthorshaveproposedina method to mode decision making of consumers using a PBN However, the state of a consumer is given by a binary vaue, that is, 0 (a consumer conserves eectricity) or (a consumer normay uses eectricity) A PLN is appropriate as a more precise mode of consumers Notation For the nonnegative integer i, define the finite set D i f {0,,,i }Forthen-dimensiona vector x= x x x n and the index set I = {i,i,,i m } {,,,n}, define x i i I f x i x i x im Fortwo matrices A and B, et A B denote the Kronecker product of A and B In addition, for q vectors y,y,,y q and the index set J ={j,j,,j p } {,,,q}, define j J f y j y j y jp For exampe, for q two-dimensiona vectors z,z,,z q and J ={,5},wecanobtain j J z j =z z 5 = z() z () z() 5 z () 5 = z () z() 5 z () z() 5 z () z() 5 z () z() 5, () where z (i) j is the ith eement of z j Let m n denote the m n matrix whose eements are a one Let I n and 0 m n denote the n nidentitymatrixandthe m nzero matrix, respectivey For simpicity of notation, we sometimes use the symbo 0 instead of 0 m n,andthesymboi instead of I n Probabiistic Logic Network First, we expain a mutivaued ogic network (MVLN) This system is defined by x (k+) =f () (x j (k) j N,u j (k) j M ), x (k+) =f () (x j (k) j N,u j (k) j M ), x n (k+) =f (n) (x j (k) j Nn,u j (k) j Mn ), where x i D r(i), i =,,,n, x f x x x n is the state, and u i D s(i), i =,,,m, u f u u u m, is the contro input In addition, r(i) and s(i) are given, and k {0,,,}is the discrete time The sets N i {,,,n} and M i {,,,m}are given index sets, and the function () f (i) : j N i D r(j) j M i D s(j) D r(i) () is a given mutivaued ogic function Next, we expain a probabiistic ogic network (PLN) (see 0, for further detais) A PLN is a generaized version of a probabiistic Booean network proposed in 9 In a PLN, the candidates of f (i) are given, and, for each x i,seecting one Booean function is probabiisticay independent at each time Let f (i) (x j (k) j Ni,u j (k) j Mi ), =,,, (4) denote the candidates of f (i) Theprobabiitythatf (i) is seected is defined by c (i) f Prob (f (i) =f (i) ) (5) Then, the reation = c(i) =mustbe satisfied Probabiistic distributions are derived from experimenta resuts We present a simpe exampe Exampe Consider the PLN with two states x D, x D (r() =, r() = ) and no contro inputs Suppose that q() = q() = hods Functions f (), f() and f (), f() are given by the truth tabe in Tabe Probabiities are given by c () = 07, c () =0and c () = 08, c () =0Weseethat the reation = c(i) =is satisfied In this case, N = N =
3 Mathematica Probems in Engineering Tabe : Truth tabe x x f () f () f () f () {, } hods Next, consider the state trajectory For exampe, x() for x(0) = 0 0 can be obtained as Prob (x () =0 0 x(0) =0 0 ) = 04, Prob (x () =0 x(0) =0 0 ) = 056, Prob (x () = 0 x(0) =0 0 ) = 006, Prob (x () = x(0) =0 0 ) = 04 This PLN can be equivaenty transformed into the discretetime Markov chain with six states in which the transition probabiity matrix is given by (6) P= (7) Using the transition probabiity matrix expressing a given PLN, we can consider reachabiity anaysis and optima contro However, in many cases, the size of the matrix P becomes arge Remark In this paper, we consider the PLN with no time deay Using additiona states, we can easiy consider time deays Probem Formuation In this section, the optima contro probem for the PLN is formuated We assume that the vaue of the contro input can be arbitrariy set However, there is a possibiity that there exists no contro input satisfying this assumption In such a case, it is desirabe to use the structura contro input, which is used in, for exampe, contro theory of gene reguatory networks (see, eg,, 4) For exampe, in, the structura contro input is regarded as an externa stimuus, and a discrete probabiistic distribution is switched at each time by the structura contro input In other words, thediscreteprobabiisticdistributionisseectedamongthe set of candidates In, the structura contro input is used as the eectricity price in rea-time pricing systems By the structura contro input, probabiities in a discrete probabiity distribution are manipuated Thus, in compex systems, such as gene reguatory networks, power systems, and socia systems, it wi be desirabe to consider a weaker contro method using the structura contro input Hence, we consider both the conventiona contro input and the structura contro input The structura contro input V(k) formuated here is added to the probabiity c (i) in (5) as foows: c (i) (k) = + V (k), (8) where V(k) 0, R (the constraint is normaized) For simpicity of discussion, we consider the one-dimensiona structura contro input, but we may consider the mutidimensiona structura contro input Under the above preparation, we consider the foowing probem Probem Suppose that, for the PLN with the conventiona contro input u and the structura contro input V, theinitia state x(0) = x 0 is given Then, find u(0),u(),,u(n ) {0, } m and V(0), V(),, V(N ) 0, minimizing the foowing cost function: N J=E k=0 (Qx (k) +R u (k) +R V (k)) +Q f x (N) x(0) =x 0, subject to the foowing two constraints on c (i) (k): ( = + V (k)) =, 0 + V (k) (9) (0) In the cost function (9), Q, Q f R n, R R m,andr R are weighting vectors whose eement is a nonnegative rea number, and E denotes a conditiona expected vaue For simpicity of discussion, we consider the inear cost function (9) We remark that x 0, u 0,andV 0 hod The desired state x d, the desired conventiona contro input u d, and the desired structura contro input V d may be introduced Then, in the cost function (9), x(k), u(k), and V(k) mayberepacedwith x(k) x d, u(k) u d,and V(k) V d,respectiveyinthecaseofx i D and u i D (ie, probabiistic Booean networks), Probem can be rewritten as a poynomia optimization probem (see for further detais) However, ony few resuts on optima contro of genera PLNs have been obtained so far (see, eg, 0) Inthispaper,anapproximatesoutionmethodforProbem is proposed Furthermore, Probem is used in mode predictive contro (MPC) See Section 5 for further detais
4 4 Mathematica Probems in Engineering Hereafter, the condition x(0) = x 0 in the conditiona expected vaue is omitted 4 Derivation of Approximate Soution Method In this section, we derive an approximate soution method for Probem First, a matrix-based representation for PLNs is derived The obtained representation is an extension of a matrix-based representation for probabiistic Booean networks proposed in Next, using the matrix-based representation, Probem is approximated by a mixed integer inear programming (MILP) probem 4 Matrix-Based Representation for PLNs As a preparation, the notation is defined Binary variabes x 0 i (k), x i (k),,xr(i) i (k) are introduced If x i (k) = j hods, then x j i (k) = hods; otherwise xj i (k) = 0 hods Then, the equaity r(i) j= xj i (k) = is satisfied In addition, binary variabes u 0 i (k), u i (k),,us(i) i (k) are introduced If u i (k) = j hods, then u j i (k) = hods; otherwise uj i (k) = 0 hods Then, the equaity s(i) j= uj i (k) = is satisfied Using xj i (k), j=,,,r(i),andu j i (k), j=,,,s(i), define x i (k) f u i (k) f x 0 i (k) x i (k) {0, } r(i), (k) x r(i) i u 0 i (k) u i (k) {0, } s(i), (k) u s(i) i i=,,,n, i=,,,m In the case of r(i) =, x i (k) canbeobtainedas () x i (k) = x0 i (k) x i (k) = x i (k) () x i (k) First, consider transforming a given MVLN into a matrixbased representation Then, the matrix-based representation for x i (k+)is given by where x i (k+) =A (i) z i (k), () z i (k) f ( j N i x j (k)) ( j M i u j (k)) {0, } α(i), α (i) f j N i r (j) j M i s (j), A (i) {0, } r(i) α(i) (4) Tabe : Truth tabe for x x 0 (k) x (k) x0 (k) x (k) x (k) x0 (k + ) x (k + ) Tabe : Truth tabe for x x 0 x x 0 x x x 0 (k + ) x (k + ) x (k + ) The matrix A (i) can be derived from the truth tabe for x i (k+) using x j i (k), j=,,,r(i),anduj i (k), j=,,,s(i) We present a simpe exampe Exampe 4 Consider an MVLN with two states and no contro inputs For x D,theogicfunctionf () in Tabe is given For x D, the ogic function f () in Tabe is given Using x 0 (k), x (k) and x0 (k), x (k), x (k), ogic functions f () and f () can be expressed as truth tabes in Tabes and, respectivey From these truth tabes, we can obtain the foowing matrix-based representation of the MVLN: x0 (k+) x (k+) x (k+) x 0 (k) x0 (k) x 0 = (k) x (k) 0 x 0 (k) x (k) x (k) x0 (k), A () x (k) x (k) x (k) x (k) x 0 (k+) 0 0 x (k+) = z (k), x (k+) x (k+) A () z (k) (5) where z (k) = z (k)(= x (k) x (k)) EacheementofA (i), i =,,,isgivenbyabinaryvaue(0 or ), and a sum of a eements in each coumn of A (i) is equa to Such a matrix-based representation has been proposed in aso 6 8 The matrix-based representation for one x i,
5 Mathematica Probems in Engineering 5 in a given PLN is given by A (i) z i (k) Then, the expected vaue of x i (k + ) can be obtained as that is, (), may be derived by the method in 6 8 See aso Remark 9 Next, consider extending the matrix-based representation of an MVLN to that of a PLN Suppose that the matrixbased representation of the ogic function f (i) E x i (k+) = ( = c (i) (k) A (i) ) E z i (k), (6) where A (i) {0, } r(i) α(i), and the condition x(0) = x 0 in the expected vaue is omitted We remark here that the jth eement of Ex i (k + ) is the probabiity that x i (k) = j hods We present a simpe exampe Exampe 5 Consider the PLN in Exampe In this system, there are no contro input and no structura contro input Using the matrix-based representation, the expected vaue of x i (k + ) can be obtained as Ex (k+) = (07A () + 0A () )Ez (k), Ex (k+) = (08A () + 0A () )Ez (k), where z (k) = z (k) = x (k) x (k), A () = , A () = , 0 0 = , A () = A () (7) (8) 4 Reduction to an MILP Probem Using the matrix-based representation (6), consider transforming Probem First, we focus on the structura contro input V(k) 0, Using (8), the system (6) can be rewritten as Ex i (k+) =( = +( = (k) A (i) )Ez i (k) (k) A (i) ) V (k) Ez i (k) (9) Noting that the input constraint is imposed as V(k) 0,, the structura contro input V(k) canberegardedasthe expected vaue of some binary probabiistic variabe Ṽ(k) {0, }Then, V (k) Ez i (k) =Ez i (k) Ṽ (k) =Ez i (k)eṽ (k) (0) hods Here, according to the definitions of x i (k) and u i (k), we define Thus, we can obtain z i (k) f z i (k) Ṽ (k) Ṽ (k) Ex i (k+) =( = z i (k)( Ṽ(k)) z i (k) Ṽ (k) = +0 (k) A (i) )Ez i (k) = (k) A (i) E z i (k) () () Then,Probemcanbeequivaentyrewrittenasthefoowing probem Probem 6 Suppose that, for the PLN with the conventiona contro input u and the structura contro input V, theinitia state x(0) = x 0 is given Then, find u(0),u(),,u(n ) {0, } m and V(0), V(),, V(N ) 0, minimizing the cost function (9) subject to (0) and () Byasimpecacuation,Probem6canberewritten as a poynomia optimization probem However, it wi be difficut to sove a poynomia optimization probem for argescae PLNs In this paper, we focus on the reations among x i (k), u i (k), andz i (k) of (4) and z i (k) of () Using these reations, we derive the reaxed probem for Probem 6 The reaxedprobemisanmilpprobemandcanbesovedfaster than a poynomia optimization probem First, we present a simpe exampe Exampe 7 Consider Ez (k) in Exampe 5 Then, noting that Ex 0 (k) + Ex (k) + Ex (k) = hods, we can obtain Ex 0 (k)ex0 (k) Ex 0 (k)ex (k) Ex (k)ex (k) Ex (k)ex0 (k) Ex (k)ex (k) Ex (k)ex (k) =Ex 0 (k) Ez (k) ()
6 6 Mathematica Probems in Engineering In a simiar way, we can obtain Ex (k) Ex Ez (k) = (k) Ex (k) (4) Ex (k) In addition, a sum of a eements in Ez (k) is equa to Equaities obtained can be used as constraints in the reaxed probem Next, consider a genera case Noting that Eu j (k) = u j (k) hods, we can obtain the foowing constraints for Ez i (k): Ex jx (k) =C jx Ez i (k), j x N i ={j x,j x,,j x Ni }, j x <j x < <j x Ni, u ju (k) =D ju Ez i (k), j u M i ={j u,j u,,j u Mi }, j u <j u < <j u Mi, where (5) C jx = α(i)r(jx ) 0 d {0, } r(jx) α(i), 0 α(i)r(jx ) C jx =C j x C j x {0, } r(j x) α(i), α(i)(r(jx )r(j x )) 0 C j x = α(i)(r(jx )r(j x )) d {0, } r(j x) α(i)(r(j x )r(j x )), 0 α(i)(r(jx )r(j x )) C jx Ni =C j x Ni C j x Ni {0, }r(j x N i ) α(i), C j x Ni = α(i)(r(jx )r(j x ) r(j x Ni )) 0 d {0, } r(j x) α(i)(r(j x )r(j x ) r(j x Ni )), 0 α(i)(r(jx )r(j x ) r(j x Ni )) D ju =D j u D j u {0, } r(j u) α(i), (6) D j u = α(i)(r(jx ) r(j x Ni )r(j u )) 0 d {0, } r(j x) α(i)(r(j x ) r(j x Ni )r(j u )), 0 α(i)(r(jx ) r(j x Ni )r(j u )) D ju Mi =D j u Mi D j u Mi {0, }r(j u M i ) α(i), D j u Mi = α(i)(r(jx ) r(j x Ni )r(j u ) r(j u Mi )) 0 d 0 α(i)(r(jx ) r(j x Ni )r(j u ) r(j u Mi )) {0, } r(j x) α(i)(r(j x ) r(j x Ni )r(j u ) r(j u Mi ))
7 Mathematica Probems in Engineering 7 In a simiar way, we can obtain the foowing constraints for E z i (k): Ex jx (k) = C jx E z i (k), j x N i ={j x,j x,,j x Ni }, j x <j x < <j x Ni, u ju (k) = D j u E z i (k), j u M i ={j u,j u,,j u Ni }, j u <j u < <j u Mi, V (k) = D V V (k) E z i (k) (7) From the definition of z i (k),thatis,(),thematrices C jx, D j u can be obtained by repacing α(i) with α(i) in the matrices C jx,d ju Thematrix D V can be obtained as D V =I I {0, } α(i) (8) Thus, we can obtain the foowing probem as a reaxed probem of Probem 6 Probem 8 Suppose that, for the PLN with the conventiona contro input u and the structura contro input V, theinitia state x(0) = x 0 is given Then, find u(0),u(),,u(n ) {0, } m and V(0), V(),, V(N ) 0, minimizing the cost function (9) subject to (0) and () (7) By a simpe cacuation, Probem 8 can be equivaenty rewritten as an MILP probem In this MILP probem, continuous decision variabes are V(k), Ez i (k), E z i (k), k= 0,,,N, and binary decision variabes are u i (k), k= 0,,,N By soving the MILP probem, we can evauate the ower bound of the optima vaue of the cost function in Probem In this paper, we provide ony an approximate soutionmethodhowever,sincethecontroinputisobtained by soving an MILP probem, the proposed soution method enabes us to sove the optima contro probem for severa casses of PLNs In the case where there is no conventiona contro input, Probem 8 with ony the structura contro input is equivaent to a inear programing probem Remark 9 In anaysis/contro methods in 6 8, the matrixbased representation for x, whichcanbeobtainedfromthat for one x i,isusedasaresut,thematrixwiththesizeof n i= r(i) ( n i= r(i) m i=s(i)) must be manipuated In the proposed method, matrix A (i) with the size of r(i) α(i) is used (α(i) = j Ni r(j) j Ni s(j)) Thus, the proposed method enabes us to use ony matrices with the smaer size Remark 0 The difference between Probems and 8 can be evauated using nu spaces of matrices C j,d j, C j, D j,and D j Detais are one of future works If Ez i (k) and E z i (k) can be uniquey derived from (5) and (7), then Probems and 8areequivaent 5 Appication to Rea-Time Pricing of Eectricity In this section, we consider rea-time pricing of eectricity as an appication of optima contro of PLNs First, the outine of rea-time pricing is expained Next, decision making of consumers is modeed by a PLN Finay, a numerica exampe is presented 5 Outine The outine of rea-time pricing systems studied inthispaperisiustratedinfigurethissystemiscomposed of one controer (the independent system operator, ISO) and mutipe eectric consumers If eectricity conservation is needed, then the ISO decides to set the price to a high vaue To decrease the economic oad, consumers conserve eectricity As a resut, eectricity conservation is achieved Thus, rea-time pricing pays an important roe in energy management systems In the existing methods of rea-time pricing, the price at each time is given by a simpe function with respect to power consumptions and votage deviations and so on However, it is important to determine the eectricity price basedonpredictionusingamathematicamodeofeectricity consumption From this viewpoint, in, 4, probabiistic modes for rea-time pricing have been proposed On the other hand, in, a method to mode decision making of consumers by a PBN has been proposed However, the state of a consumer is given by a binary vaue, that is, 0 (a consumer conserves eectricity) or (a consumer normay uses eectricity) In this paper, we consider extending the method in to the method using a PLN As a mathematica mode of consumers, a PLN is more appropriate than a PBN It is one of the future efforts to discuss the reation between probabiisticmodesin,4andapln 5 Mode Consider modeing the set of consumers as a PLN The number of consumers is given by n Wesuppose that the state x i for consumer i {,,,n} is d-vaued; that is, x i D d (for simpicity, d does not depend on i) The state impies x i 0 consumer i conserves eectricity, {, = { { d consumer i maximay uses eectricity (9) The vaue of x i is determined from power consumption of consumer ifor consumeri, we consider the foowingpln: x i (k+) f (i) =x i (k) +, c (i) { = f (i) =x i (k), c (i) { { f (i) =x i (k), c (i) (k) =a(i) +b(i) V (k) (x i (k) =d ), (k) =a(i) +b(i) V (k), (k) =a(i) +b(i) V (k) (x i (k) =0) (0)
8 8 Mathematica Probems in Engineering 4 Controer Price Power consumption Consumers (eg, homes and commercia faciities) Average trajectory Figure : Iustration of rea-time pricing systems In this mode, there is no conventiona contro input, and the structura contro input V(k) corresponds to the eectricity price The function f (i) impies that power consumption of consumer i increases The function f (i) impies that power consumption of consumer i is not changed The function f (i) impies that power consumption of consumer i decreases Thus, decision making of consumers can be modeed by a PLN In, 4, it has been shown that the behavior of power consumption is probabiistic based on experimenta data Hence, it is appropriate to adopt a PLN as a mode of consumers We remark that the above functions are an exampe of modes for decision making Depending on rea situations, we may use other ogic functions Using the PLN-based mode obtained, we consider the foowing probem: (i) find a time sequence of the price such that consumers conserve eectricity as much as possibe However, it is not desirabe that the price is too high The condition that consumers conserve eectricity as much as possibe can be characterized by Ex i In other words, power consumption is expressed by Ex i Hence,thisprobemcan be formuated as Probem by appropriatey setting the weights Q and R 5 Numerica Exampe We present a numerica exampe Here, Probem 8 is repeatedy soved according to the foowing procedure of mode predictive contro (MPC) Procedure of MPC Step Set t=0,andgivex(0) = x 0 Step Derive V(t), V(t+),, V(t+N ) by soving Probem 8 Step Appy ony V(t) to the system Step 4 According to Ex i (k+) (ie, the discrete probabiity distribution for x i (k+)), obtained by using V(t), derive x i (k+ ) D i randomy Set t+ t,andreturntostep Time Figure : Average state trajectory of 00 sampes Consider the case of n=0and d=5 See the Appendix for parameters and ForV(k), theconstraintv(k) 0, 06 is imposed Under this constraint, (0) are satisfied Parameters in Probem are given as foows: x (0) = , N=0, Q= 0, R = () Next, we present the computation resut According to the above procedure of MPC, 00 sampes of the state trajectory in the time interva 0, 0 were generated Figure shows the average trajectory of 00 sampes Figure shows one sampe of the price (the structura contro input) obtained From thesefigures,weseethatthestatebecomessmabymanipuating the price In this exampe, 000 LP probems were soved Then, the worst computation time was 0548 (sec), and the mean computation time was 097 (sec), where we used Gurobi Optimizer 56 as an LP sover Thus, Probem 8canbesovedfast Finay, we discuss the optimaity Consider soving Probem 8 once under the above setting When the obtained contro input is appied to the system, the vaue of the cost function in Probem was 548InthecaseofV(k) = 0 (ie, the constant input), the vaue of the cost function in Probem was669 InthecaseofV(k) = 06, the vaue of the cost function in Probem was 556 From these vaues,we see thattheobtainedcontroinputismoreeffectivethantrivia contro inputs 6 Concusion In this paper, we discussed optima contro of probabiistic ogic networks (PLNs) and its appication to rea-time pricing of eectricity First, in the probem formuation, both
9 Mathematica Probems in Engineering 9 Price = 07, = 05, = 0, = 05, =0, =, i {, 7,, 7}, Time Figure:Onesampeofthepriceobtained the conventiona contro input and the structura contro input were introduced Next, an approximate soution method was proposed This method is a sophisticated and generaizedversionofthemethodproposedinfinay, we considered rea-time pricing of eectricity as an appication, and we presented a numerica exampe The proposed method provides us a new contro method for arge-scae compex systems There are severa open probems It is significant to deveop the identification method of PLNs It is aso significant to evauate the accuracy of an approximation from the theoretica viewpoint Appendix Parameters in Numerica Exampe Parameters foows: and = 05, = 05, = 05, = 05, =0, =, in the numerica exampe are given as i {, 6,, 6}, = 04, = 05, = 06, = 05, =0, =, = 05, = 04, = 05, = 06, =0, =, = 0, = 0, = 07, = 07, =0, =, i {, 8,, 8}, i {4, 9, 4, 9}, i {5, 0, 5, 0} (A) These parameters in the numerica exampe are given artificiay Athough finding these parameters from rea data is important, this topic is one of the future efforts
10 0 Mathematica Probems in Engineering Confict of Interests The authors decare that there is no confict of interests regarding the pubication of this paper Acknowedgment ThisresearchwaspartysupportedbyJST,CREST References P Tabuada, Verification and Contro of Hybrid Systems,Springer, New York, NY, USA, 009 H D Jong, Modeing and simuation of genetic reguatory systems: a iterature review, Journa of Computationa Bioogy, vo9,no,pp67 0,00 S A Kauffman, Metaboic stabiity and epigenesis in randomy constructed genetic nets, Journa of Theoretica Bioogy, vo, no, pp , A Mochizuki, An anaytica study of the number of steady states in gene reguatory networks, Journa of Theoretica Bioogy,vo6,no,pp9 0,005 5 C Chaouiya, A Nadi, E Remy, and D Thieffry, Petri net representation of muti-vaued ogica reguatory graphs, Natura Computing,vo0,no,pp77 750,0 6DCheng,HQi,andZLi,Anaysis and Contro of Booean Networks: A Semi-Tensor Product Approach, Springer, London, UK, 0 7 D Cheng and X Xu, Bi-decomposition of muti-vaued ogica functions and its appications, Automatica, vo 49, no 7, pp , 0 8 Y Zhao, Z Li, and D Cheng, Optima contro of ogica contro networks, IEEE Transactions on Automatic Contro,vo56,no 8, pp , 0 9 I Shmuevich, E R Dougherty, S Kim, and W Zhang, Probabiistic Booean networks: a rue-based uncertainty mode for gene reguatory networks, Bioinformatics,vo8,no,pp6 74, 00 0 Z B Liu, Y Z Wang, and H T Li, Two kinds of optima contros for probabiistic mix-vaued ogica dynamic networks, Science China Information Sciences, vo57,no5,pp 0, 04 Y Zhao and D Cheng, Controabiity and stabiizabiity of probabiistic ogica contro networks, in Proceedings of the 5st IEEE Conference on Decision and Contro (CDC ), pp , Maui, Hawaii, USA, December 0 K Kobayashi and K Hiraishi, Optima contro of gene reguatory networks with effectiveness of mutipe drugs: a Booean network approach, BioMed Research Internationa, vo0, Artice ID 4676, pages, 0 KKobayashiandKHiraishi, Aprobabiisticapproachtocontro of compex systems and its appication to rea-time pricing, Mathematica Probems in Engineering, vo04,articeid 90677, 8 pages, 04 4 I Shmuevich, E R Dougherty, and W Zhang, Contro of stationary behavior in probabiistic Booean networks by means of structura intervention, JournaofBioogicaSystems, vo 0, no 4, pp 4 445, 00 5 Y Xiao and E R Dougherty, The impact of function perturbations in Booean networks, Bioinformatics,vo, no0,pp 65 7, K Kobayashi and K Hiraishi, ILP/SMT-based method for design of Booean networks based on singeton attractors, IEEE/ACM Transactions on Computationa Bioogy and Bioinformatics,vo,no6,pp5 59,04 7 X Chen, T Akutsu, T Tamura, and W-K Ching, Finding optima contro poicy in probabiistic Booean networks with hard constraints by using integer programming and dynamic programming, in Proceedings of the IEEE Internationa Conference on Bioinformatics and Biomedicine (BIBM 0),pp40 46, Hong Kong, December 00 8 S Borenstein, M Jaske, and A Rosenfed, Dynamic Pricing, Advanced Metering, and Demand Response in Eectricity Markets, Center for the Study of Energy Markets, UC Berkeey, 00 9 M Roozbehani, M Daheh, and S Mitter, On the stabiity of whoesae eectricity markets under rea-time pricing, in Proceedings of the 49th IEEE Conference on Decision and Contro (CDC 0), pp 9 98, IEEE, Atanta, Ga, USA, December 00 0 P Samadi, A-H Mohsenian-Rad, R Schober, V W S Wong, and J Jatskevich, Optima rea-time pricing agorithm based on utiity maximization for smart grid, in Proceedings of the st IEEE Internationa Conference on Smart Grid Communications (SmartGridComm 0), pp 45 40, Gaithersburg, Md, USA, October 00 C Vivekananthan, Y Mishra, and G Ledwich, A nove rea time pricing scheme for demand response in residentia distribution systems, in Proceedings of the 9th Annua Conference of the IEEE Industria Eectronics Society (IECON ), pp956 96, Vienna, Austria, November 0 K Kobayashi and K Hiraishi, Optima contro of probabiistic Booean networks using poynomia optimization, IEICE Transactions on Fundamentas of Eectronics, Communications and Computer Sciences,vo95,no9,pp5 57,0 K Kobayashi and K Hiraishi, Agorithm for optima rea-time pricing based on switched Markov chain modes, in Proceedings oftheieeepower&energysocietyinnovativesmartgrid Technoogies Conference (ISGT 5), pp 5, Washington, DC, USA, Feburary 05 4 I Maruta and Y Takarada, Modeing of dynamics in demand response for rea-time pricing, in Proceedings of the 5th IEEE Internationa Conference on Smart Grid Communications (SmartGridComm 4), pp 806 8, Venice, Itay, November 04
11 Advances in Operations Research Hindawi Pubishing Corporation Voume 04 Advances in Decision Sciences Hindawi Pubishing Corporation Voume 04 Journa of Appied Mathematics Agebra Hindawi Pubishing Corporation Hindawi Pubishing Corporation Voume 04 Journa of Probabiity and Statistics Voume 04 The Scientific Word Journa Hindawi Pubishing Corporation Hindawi Pubishing Corporation Voume 04 Internationa Journa of Differentia Equations Hindawi Pubishing Corporation Voume 04 Voume 04 Submit your manuscripts at Internationa Journa of Advances in Combinatorics Hindawi Pubishing Corporation Mathematica Physics Hindawi Pubishing Corporation Voume 04 Journa of Compex Anaysis Hindawi Pubishing Corporation Voume 04 Internationa Journa of Mathematics and Mathematica Sciences Mathematica Probems in Engineering Journa of Mathematics Hindawi Pubishing Corporation Voume 04 Hindawi Pubishing Corporation Voume 04 Voume 04 Hindawi Pubishing Corporation Voume 04 Discrete Mathematics Journa of Voume 04 Hindawi Pubishing Corporation Discrete Dynamics in Nature and Society Journa of Function Spaces Hindawi Pubishing Corporation Abstract and Appied Anaysis Voume 04 Hindawi Pubishing Corporation Voume 04 Hindawi Pubishing Corporation Voume 04 Internationa Journa of Journa of Stochastic Anaysis Optimization Hindawi Pubishing Corporation Hindawi Pubishing Corporation Voume 04 Voume 04
Structural Control of Probabilistic Boolean Networks and Its Application to Design of Real-Time Pricing Systems
Preprints of the 9th Word Congress The Internationa Federation of Automatic Contro Structura Contro of Probabiistic Booean Networks and Its Appication to Design of Rea-Time Pricing Systems Koichi Kobayashi
More informationTheory of Generalized k-difference Operator and Its Application in Number Theory
Internationa Journa of Mathematica Anaysis Vo. 9, 2015, no. 19, 955-964 HIKARI Ltd, www.m-hiari.com http://dx.doi.org/10.12988/ijma.2015.5389 Theory of Generaized -Difference Operator and Its Appication
More informationResearch Article On the Lower Bound for the Number of Real Roots of a Random Algebraic Equation
Appied Mathematics and Stochastic Anaysis Voume 007, Artice ID 74191, 8 pages doi:10.1155/007/74191 Research Artice On the Lower Bound for the Number of Rea Roots of a Random Agebraic Equation Takashi
More informationImproving the Reliability of a Series-Parallel System Using Modified Weibull Distribution
Internationa Mathematica Forum, Vo. 12, 217, no. 6, 257-269 HIKARI Ltd, www.m-hikari.com https://doi.org/1.12988/imf.217.611155 Improving the Reiabiity of a Series-Parae System Using Modified Weibu Distribution
More informationResearch Article Building Infinitely Many Solutions for Some Model of Sublinear Multipoint Boundary Value Problems
Abstract and Appied Anaysis Voume 2015, Artice ID 732761, 4 pages http://dx.doi.org/10.1155/2015/732761 Research Artice Buiding Infinitey Many Soutions for Some Mode of Subinear Mutipoint Boundary Vaue
More informationA Solution to the 4-bit Parity Problem with a Single Quaternary Neuron
Neura Information Processing - Letters and Reviews Vo. 5, No. 2, November 2004 LETTER A Soution to the 4-bit Parity Probem with a Singe Quaternary Neuron Tohru Nitta Nationa Institute of Advanced Industria
More informationStochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997
Stochastic utomata etworks (S) - Modeing and Evauation Pauo Fernandes rigitte Pateau 2 May 29, 997 Institut ationa Poytechnique de Grenobe { IPG Ecoe ationae Superieure d'informatique et de Mathematiques
More informationA Brief Introduction to Markov Chains and Hidden Markov Models
A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,
More informationMARKOV CHAINS AND MARKOV DECISION THEORY. Contents
MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After
More informationCS229 Lecture notes. Andrew Ng
CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view
More informationResearch Article Numerical Range of Two Operators in Semi-Inner Product Spaces
Abstract and Appied Anaysis Voume 01, Artice ID 846396, 13 pages doi:10.1155/01/846396 Research Artice Numerica Range of Two Operators in Semi-Inner Product Spaces N. K. Sahu, 1 C. Nahak, 1 and S. Nanda
More informationThroughput Optimal Scheduling for Wireless Downlinks with Reconfiguration Delay
Throughput Optima Scheduing for Wireess Downinks with Reconfiguration Deay Vineeth Baa Sukumaran vineethbs@gmai.com Department of Avionics Indian Institute of Space Science and Technoogy. Abstract We consider
More informationSchool of Electrical Engineering, University of Bath, Claverton Down, Bath BA2 7AY
The ogic of Booean matrices C. R. Edwards Schoo of Eectrica Engineering, Universit of Bath, Caverton Down, Bath BA2 7AY A Booean matrix agebra is described which enabes man ogica functions to be manipuated
More informationSchool of Electrical Engineering, University of Bath, Claverton Down, Bath BA2 7AY
The ogic of Booean matrices C. R. Edwards Schoo of Eectrica Engineering, Universit of Bath, Caverton Down, Bath BA2 7AY A Booean matrix agebra is described which enabes man ogica functions to be manipuated
More informationAppendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model
Appendix of the Paper The Roe of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Mode Caio Ameida cameida@fgv.br José Vicente jose.vaentim@bcb.gov.br June 008 1 Introduction In this
More information<C 2 2. λ 2 l. λ 1 l 1 < C 1
Teecommunication Network Contro and Management (EE E694) Prof. A. A. Lazar Notes for the ecture of 7/Feb/95 by Huayan Wang (this document was ast LaT E X-ed on May 9,995) Queueing Primer for Muticass Optima
More informationMathematical Scheme Comparing of. the Three-Level Economical Systems
Appied Mathematica Sciences, Vo. 11, 2017, no. 15, 703-709 IKAI td, www.m-hikari.com https://doi.org/10.12988/ams.2017.7252 Mathematica Scheme Comparing of the Three-eve Economica Systems S.M. Brykaov
More informationAn approximate method for solving the inverse scattering problem with fixed-energy data
J. Inv. I-Posed Probems, Vo. 7, No. 6, pp. 561 571 (1999) c VSP 1999 An approximate method for soving the inverse scattering probem with fixed-energy data A. G. Ramm and W. Scheid Received May 12, 1999
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sampe cover image for this issue The actua cover is not yet avaiabe at this time) This artice appeared in a journa pubished by Esevier The attached copy is furnished to the author for interna
More informationA Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)
A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,
More informationAsynchronous Control for Coupled Markov Decision Systems
INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of
More informationThe Symmetric and Antipersymmetric Solutions of the Matrix Equation A 1 X 1 B 1 + A 2 X 2 B A l X l B l = C and Its Optimal Approximation
The Symmetric Antipersymmetric Soutions of the Matrix Equation A 1 X 1 B 1 + A 2 X 2 B 2 + + A X B C Its Optima Approximation Ying Zhang Member IAENG Abstract A matrix A (a ij) R n n is said to be symmetric
More informationLecture Note 3: Stationary Iterative Methods
MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or
More informationAlgorithms to solve massively under-defined systems of multivariate quadratic equations
Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations
More informationResearch of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance
Send Orders for Reprints to reprints@benthamscience.ae 340 The Open Cybernetics & Systemics Journa, 015, 9, 340-344 Open Access Research of Data Fusion Method of Muti-Sensor Based on Correation Coefficient
More informationFirst-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries
c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische
More informationAnalysis of the problem of intervention control in the economy on the basis of solving the problem of tuning
Anaysis of the probem of intervention contro in the economy on the basis of soving the probem of tuning arxiv:1811.10993v1 q-fin.gn] 9 Nov 2018 1 st eter Shnurov Nationa Research University Higher Schoo
More informationSymbolic models for nonlinear control systems using approximate bisimulation
Symboic modes for noninear contro systems using approximate bisimuation Giordano Poa, Antoine Girard and Pauo Tabuada Abstract Contro systems are usuay modeed by differentia equations describing how physica
More informationA. Distribution of the test statistic
A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch
More informationAn explicit Jordan Decomposition of Companion matrices
An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057
More informationDISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE
DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE Yury Iyushin and Anton Mokeev Saint-Petersburg Mining University, Vasiievsky Isand, 1 st ine, Saint-Petersburg,
More informationResearch Article The Diagonally Dominant Degree and Disc Separation for the Schur Complement of Ostrowski Matrix
Hindawi Pubishing Corporation Journa of Appied Mathematics Voume 2013, Artice ID 973152, 10 pages http://dxdoiorg/101155/2013/973152 Research Artice The Diagonay Dominant Degree and Disc Separation for
More informationConvergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems
Convergence Property of the Iri-Imai Agorithm for Some Smooth Convex Programming Probems S. Zhang Communicated by Z.Q. Luo Assistant Professor, Department of Econometrics, University of Groningen, Groningen,
More informationResearch Article New Iterative Method: An Application for Solving Fractional Physical Differential Equations
Abstract and Appied Anaysis Voume 203, Artice ID 6700, 9 pages http://d.doi.org/0.55/203/6700 Research Artice New Iterative Method: An Appication for Soving Fractiona Physica Differentia Equations A. A.
More informationXSAT of linear CNF formulas
XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open
More informationAn Algorithm for Pruning Redundant Modules in Min-Max Modular Network
An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai
More informationSequential Decoding of Polar Codes with Arbitrary Binary Kernel
Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient
More informationStochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract
Stochastic Compement Anaysis of Muti-Server Threshod Queues with Hysteresis John C.S. Lui The Dept. of Computer Science & Engineering The Chinese University of Hong Kong Leana Goubchik Dept. of Computer
More informationBALANCING REGULAR MATRIX PENCILS
BALANCING REGULAR MATRIX PENCILS DAMIEN LEMONNIER AND PAUL VAN DOOREN Abstract. In this paper we present a new diagona baancing technique for reguar matrix pencis λb A, which aims at reducing the sensitivity
More informationMode in Output Participation Factors for Linear Systems
2010 American ontro onference Marriott Waterfront, Batimore, MD, USA June 30-Juy 02, 2010 WeB05.5 Mode in Output Participation Factors for Linear Systems Li Sheng, yad H. Abed, Munther A. Hassouneh, Huizhong
More informationStatistical Learning Theory: A Primer
Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO
More informationTwo-sample inference for normal mean vectors based on monotone missing data
Journa of Mutivariate Anaysis 97 (006 6 76 wwweseviercom/ocate/jmva Two-sampe inference for norma mean vectors based on monotone missing data Jianqi Yu a, K Krishnamoorthy a,, Maruthy K Pannaa b a Department
More informationHigh-order approximations to the Mie series for electromagnetic scattering in three dimensions
Proceedings of the 9th WSEAS Internationa Conference on Appied Mathematics Istanbu Turkey May 27-29 2006 (pp199-204) High-order approximations to the Mie series for eectromagnetic scattering in three dimensions
More informationCombining reaction kinetics to the multi-phase Gibbs energy calculation
7 th European Symposium on Computer Aided Process Engineering ESCAPE7 V. Pesu and P.S. Agachi (Editors) 2007 Esevier B.V. A rights reserved. Combining reaction inetics to the muti-phase Gibbs energy cacuation
More informationTracking Control of Multiple Mobile Robots
Proceedings of the 2001 IEEE Internationa Conference on Robotics & Automation Seou, Korea May 21-26, 2001 Tracking Contro of Mutipe Mobie Robots A Case Study of Inter-Robot Coision-Free Probem Jurachart
More informationExplicit overall risk minimization transductive bound
1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,
More informationProblem set 6 The Perron Frobenius theorem.
Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator
More informationMelodic contour estimation with B-spline models using a MDL criterion
Meodic contour estimation with B-spine modes using a MDL criterion Damien Loive, Ney Barbot, Oivier Boeffard IRISA / University of Rennes 1 - ENSSAT 6 rue de Kerampont, B.P. 80518, F-305 Lannion Cedex
More informationAvailable online at ScienceDirect. IFAC PapersOnLine 50-1 (2017)
Avaiabe onine at www.sciencedirect.com ScienceDirect IFAC PapersOnLine 50-1 (2017 3412 3417 Stabiization of discrete-time switched inear systems: Lyapunov-Metzer inequaities versus S-procedure characterizations
More informationAkaike Information Criterion for ANOVA Model with a Simple Order Restriction
Akaike Information Criterion for ANOVA Mode with a Simpe Order Restriction Yu Inatsu * Department of Mathematics, Graduate Schoo of Science, Hiroshima University ABSTRACT In this paper, we consider Akaike
More informationT.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA
ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network
More informationRobust Sensitivity Analysis for Linear Programming with Ellipsoidal Perturbation
Robust Sensitivity Anaysis for Linear Programming with Eipsoida Perturbation Ruotian Gao and Wenxun Xing Department of Mathematica Sciences Tsinghua University, Beijing, China, 100084 September 27, 2017
More informationA SIMPLIFIED DESIGN OF MULTIDIMENSIONAL TRANSFER FUNCTION MODELS
A SIPLIFIED DESIGN OF ULTIDIENSIONAL TRANSFER FUNCTION ODELS Stefan Petrausch, Rudof Rabenstein utimedia Communications and Signa Procesg, University of Erangen-Nuremberg, Cauerstr. 7, 958 Erangen, GERANY
More informationSTABILITY OF A PARAMETRICALLY EXCITED DAMPED INVERTED PENDULUM 1. INTRODUCTION
Journa of Sound and Vibration (996) 98(5), 643 65 STABILITY OF A PARAMETRICALLY EXCITED DAMPED INVERTED PENDULUM G. ERDOS AND T. SINGH Department of Mechanica and Aerospace Engineering, SUNY at Buffao,
More informationNonlinear Analysis of Spatial Trusses
Noninear Anaysis of Spatia Trusses João Barrigó October 14 Abstract The present work addresses the noninear behavior of space trusses A formuation for geometrica noninear anaysis is presented, which incudes
More informationORTHOGONAL MULTI-WAVELETS FROM MATRIX FACTORIZATION
J. Korean Math. Soc. 46 2009, No. 2, pp. 281 294 ORHOGONAL MLI-WAVELES FROM MARIX FACORIZAION Hongying Xiao Abstract. Accuracy of the scaing function is very crucia in waveet theory, or correspondingy,
More informationIdentification of macro and micro parameters in solidification model
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vo. 55, No. 1, 27 Identification of macro and micro parameters in soidification mode B. MOCHNACKI 1 and E. MAJCHRZAK 2,1 1 Czestochowa University
More informationA proposed nonparametric mixture density estimation using B-spline functions
A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),
More informationWavelet Galerkin Solution for Boundary Value Problems
Internationa Journa of Engineering Research and Deveopment e-issn: 2278-67X, p-issn: 2278-8X, www.ijerd.com Voume, Issue 5 (May 24), PP.2-3 Waveet Gaerkin Soution for Boundary Vaue Probems D. Pate, M.K.
More informationTarget Location Estimation in Wireless Sensor Networks Using Binary Data
Target Location stimation in Wireess Sensor Networks Using Binary Data Ruixin Niu and Pramod K. Varshney Department of ectrica ngineering and Computer Science Link Ha Syracuse University Syracuse, NY 344
More informationBayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems
Bayesian Unscented Kaman Fiter for State Estimation of Noninear and Non-aussian Systems Zhong Liu, Shing-Chow Chan, Ho-Chun Wu and iafei Wu Department of Eectrica and Eectronic Engineering, he University
More informationPower Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks
ower Contro and Transmission Scheduing for Network Utiity Maximization in Wireess Networks Min Cao, Vivek Raghunathan, Stephen Hany, Vinod Sharma and. R. Kumar Abstract We consider a joint power contro
More information8 Digifl'.11 Cth:uits and devices
8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,
More informationarxiv: v3 [cs.si] 27 Oct 2016
Booean Gossiping Networs Bo Li, Junfeng Wu, Hongsheng Qi, Aexandre Proutiere, and Guodong Shi Abstract arxiv:1507.03323v3 [cs.si] 27 Oct 2016 This paper proposes and investigates a Booean gossiping mode
More informationTHE ROLE OF ENERGY IMBALANCE MANAGEMENT ON POWER MARKET STABILITY
Proceedings of HICSS-31, Big Isand of Hawaii, January 6-9, 1998, Voume III, pp. 4-8. THE ROLE OF ENERGY IMBALANCE MANAGEMENT ON POWER MARKET STABILITY Fernando L. Avarado Department of Eectrica and C.
More informationNearly Optimal Constructions of PIR and Batch Codes
arxiv:700706v [csit] 5 Jun 07 Neary Optima Constructions of PIR and Batch Codes Hia Asi Technion - Israe Institute of Technoogy Haifa 3000, Israe shea@cstechnionaci Abstract In this work we study two famiies
More informationImproving the Accuracy of Boolean Tomography by Exploiting Path Congestion Degrees
Improving the Accuracy of Booean Tomography by Expoiting Path Congestion Degrees Zhiyong Zhang, Gaoei Fei, Fucai Yu, Guangmin Hu Schoo of Communication and Information Engineering, University of Eectronic
More informationHYDROGEN ATOM SELECTION RULES TRANSITION RATES
DOING PHYSICS WITH MATLAB QUANTUM PHYSICS Ian Cooper Schoo of Physics, University of Sydney ian.cooper@sydney.edu.au HYDROGEN ATOM SELECTION RULES TRANSITION RATES DOWNLOAD DIRECTORY FOR MATLAB SCRIPTS
More informationDistributed average consensus: Beyond the realm of linearity
Distributed average consensus: Beyond the ream of inearity Usman A. Khan, Soummya Kar, and José M. F. Moura Department of Eectrica and Computer Engineering Carnegie Meon University 5 Forbes Ave, Pittsburgh,
More informationAdjustment of automatic control systems of production facilities at coal processing plants using multivariant physico- mathematical models
IO Conference Series: Earth and Environmenta Science AER OEN ACCESS Adjustment of automatic contro systems of production faciities at coa processing pants using mutivariant physico- mathematica modes To
More informationPrimal and dual active-set methods for convex quadratic programming
Math. Program., Ser. A 216) 159:469 58 DOI 1.17/s117-15-966-2 FULL LENGTH PAPER Prima and dua active-set methods for convex quadratic programming Anders Forsgren 1 Phiip E. Gi 2 Eizabeth Wong 2 Received:
More informationSource and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems
Source and Reay Matrices Optimization for Mutiuser Muti-Hop MIMO Reay Systems Yue Rong Department of Eectrica and Computer Engineering, Curtin University, Bentey, WA 6102, Austraia Abstract In this paper,
More informationDIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM
DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing
More informationDetermining The Degree of Generalization Using An Incremental Learning Algorithm
Determining The Degree of Generaization Using An Incrementa Learning Agorithm Pabo Zegers Facutad de Ingeniería, Universidad de os Andes San Caros de Apoquindo 22, Las Condes, Santiago, Chie pzegers@uandes.c
More informationComponentwise Determination of the Interval Hull Solution for Linear Interval Parameter Systems
Componentwise Determination of the Interva Hu Soution for Linear Interva Parameter Systems L. V. Koev Dept. of Theoretica Eectrotechnics, Facuty of Automatics, Technica University of Sofia, 1000 Sofia,
More informationOn generalized quantum Turing machine and its language classes
Proceedings of the 11th WSEAS Internationa onference on APPLIED MATHEMATIS, Daas, Texas, USA, March -4, 007 51 On generaized quantum Turing machine and its anguage casses SATOSHI IRIYAMA Toyo University
More informationPartial permutation decoding for MacDonald codes
Partia permutation decoding for MacDonad codes J.D. Key Department of Mathematics and Appied Mathematics University of the Western Cape 7535 Bevie, South Africa P. Seneviratne Department of Mathematics
More informationOptimal Control of Assembly Systems with Multiple Stages and Multiple Demand Classes 1
Optima Contro of Assemby Systems with Mutipe Stages and Mutipe Demand Casses Saif Benjaafar Mohsen EHafsi 2 Chung-Yee Lee 3 Weihua Zhou 3 Industria & Systems Engineering, Department of Mechanica Engineering,
More informationConverting Z-number to Fuzzy Number using. Fuzzy Expected Value
ISSN 1746-7659, Engand, UK Journa of Information and Computing Science Vo. 1, No. 4, 017, pp.91-303 Converting Z-number to Fuzzy Number using Fuzzy Expected Vaue Mahdieh Akhbari * Department of Industria
More informationA Comparison Study of the Test for Right Censored and Grouped Data
Communications for Statistica Appications and Methods 2015, Vo. 22, No. 4, 313 320 DOI: http://dx.doi.org/10.5351/csam.2015.22.4.313 Print ISSN 2287-7843 / Onine ISSN 2383-4757 A Comparison Study of the
More informationResearch Article Further Stability Criterion on Delayed Recurrent Neural Networks Based on Reciprocal Convex Technique
Mathematica Probems in Engineering Voume 2012, Artice ID 829037, 14 pages doi:10.1155/2012/829037 Research Artice Further Stabiity Criterion on Deayed Recurrent Neura Networks Based on Reciproca Convex
More informationPath planning with PH G2 splines in R2
Path panning with PH G2 spines in R2 Laurent Gajny, Richard Béarée, Eric Nyiri, Oivier Gibaru To cite this version: Laurent Gajny, Richard Béarée, Eric Nyiri, Oivier Gibaru. Path panning with PH G2 spines
More informationA Novel Learning Method for Elman Neural Network Using Local Search
Neura Information Processing Letters and Reviews Vo. 11, No. 8, August 2007 LETTER A Nove Learning Method for Eman Neura Networ Using Loca Search Facuty of Engineering, Toyama University, Gofuu 3190 Toyama
More informationProceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds.
Proceedings of the 2012 Winter Simuation Conference C. aroque, J. Himmespach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds. TIGHT BOUNDS FOR AMERICAN OPTIONS VIA MUTIEVE MONTE CARO Denis Beomestny Duisburg-Essen
More informationInteractive Fuzzy Programming for Two-level Nonlinear Integer Programming Problems through Genetic Algorithms
Md. Abu Kaam Azad et a./asia Paciic Management Review (5) (), 7-77 Interactive Fuzzy Programming or Two-eve Noninear Integer Programming Probems through Genetic Agorithms Abstract Md. Abu Kaam Azad a,*,
More informationAppendix A: MATLAB commands for neural networks
Appendix A: MATLAB commands for neura networks 132 Appendix A: MATLAB commands for neura networks p=importdata('pn.xs'); t=importdata('tn.xs'); [pn,meanp,stdp,tn,meant,stdt]=prestd(p,t); for m=1:10 net=newff(minmax(pn),[m,1],{'tansig','purein'},'trainm');
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Approximated MLC shape matrix decomposition with intereaf coision constraint Thomas Kainowski Antje Kiese Abstract Shape matrix decomposition is a subprobem in radiation therapy panning. A given fuence
More informationA Fuzzy Approach to Co-Ordinated and Non Co-Ordinated Two Stage Supply Chain
Internationa Journa of Pure and Appied Mathematica Sciences. ISS 097-988 Voume 0, umber (07), pp. -3 Research India Pubications http://www.ripubication.com A Fuzzy Approach to Co-Ordinated and on Co-Ordinated
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Agorithmic Operations Research Vo.4 (29) 49 57 Approximated MLC shape matrix decomposition with intereaf coision constraint Antje Kiese and Thomas Kainowski Institut für Mathematik, Universität Rostock,
More informationIntuitionistic Fuzzy Optimization Technique for Nash Equilibrium Solution of Multi-objective Bi-Matrix Games
Journa of Uncertain Systems Vo.5, No.4, pp.27-285, 20 Onine at: www.jus.org.u Intuitionistic Fuzzy Optimization Technique for Nash Equiibrium Soution of Muti-objective Bi-Matri Games Prasun Kumar Naya,,
More informationOptimum Design Method of Viscous Dampers in Building Frames Using Calibration Model
The 4 th Word Conference on Earthquake Engineering October -7, 8, Beijing, China Optimum Design Method of iscous Dampers in Buiding Frames sing Caibration Mode M. Yamakawa, Y. Nagano, Y. ee 3, K. etani
More informationJENSEN S OPERATOR INEQUALITY FOR FUNCTIONS OF SEVERAL VARIABLES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Voume 128, Number 7, Pages 2075 2084 S 0002-99390005371-5 Artice eectronicay pubished on February 16, 2000 JENSEN S OPERATOR INEQUALITY FOR FUNCTIONS OF
More informationA Statistical Framework for Real-time Event Detection in Power Systems
1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem
More informationFormulas for Angular-Momentum Barrier Factors Version II
BNL PREPRINT BNL-QGS-06-101 brfactor1.tex Formuas for Anguar-Momentum Barrier Factors Version II S. U. Chung Physics Department, Brookhaven Nationa Laboratory, Upton, NY 11973 March 19, 2015 abstract A
More informationBDD-Based Analysis of Gapped q-gram Filters
BDD-Based Anaysis of Gapped q-gram Fiters Marc Fontaine, Stefan Burkhardt 2 and Juha Kärkkäinen 2 Max-Panck-Institut für Informatik Stuhsatzenhausweg 85, 6623 Saarbrücken, Germany e-mai: stburk@mpi-sb.mpg.de
More informationOptimization Based Bidding Strategies in the Deregulated Market
Optimization ased idding Strategies in the Dereguated arket Daoyuan Zhang Ascend Communications, nc 866 North ain Street, Waingford, C 0649 Abstract With the dereguation of eectric power systems, market
More informationMaintenance activities planning and grouping for complex structure systems
Maintenance activities panning and grouping for compex structure systems Hai Canh u, Phuc Do an, Anne Barros, Christophe Bérenguer To cite this version: Hai Canh u, Phuc Do an, Anne Barros, Christophe
More informationNOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS
NOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS TONY ALLEN, EMILY GEBHARDT, AND ADAM KLUBALL 3 ADVISOR: DR. TIFFANY KOLBA 4 Abstract. The phenomenon of noise-induced stabiization occurs
More informationNEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION
NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA 904-635, U.S.A. Chun-Hung Chen
More informationEffect of transport ratio on source term in determination of surface emission coefficient
Internationa Journa of heoretica & Appied Sciences, (): 74-78(9) ISSN : 975-78 Effect of transport ratio on source term in determination of surface emission coefficient Sanjeev Kumar and Apna Mishra epartment
More information