Adaptive H Tracking Control Design via Neural Networks of a Constrained Robot System
|
|
|
- Jocelyn Moody
- 10 years ago
- Views:
Transcription
1 Proceedigs of the 44th IEEE Coferece o Decisio ad Cotrol, ad the Europea Cotrol Coferece 25 Seville, Spai, December 12-15, 25 WeIB196 Adaptive H Trackig Cotrol Desig via Neural Networks of a Costraied Robot System Adre Petroilho, Adriao A G Siqueira ad Marco H Terra* Abstract I this paper, a oliear adaptive eural etwork trackig cotrol a guarateed H performace is proposed for a costraied robot maipulator plat ucertaities The eural etwork is used to lear the ukow dyamics by a adaptive algorithm Moreover, a force sesor is built to measure the forces ad torques betwee the experimetal robot UArm II ed-effector ad the eviromet Fially, results obtaied from the implemetatio of the proposed cotroller i the maipulator UArm II, uder a costraied movemet, are preseted I INTRODUCTION With the growth of automatio i idustries, the umber of robots used to perform tasks such as writig, scribig ad gridig, where the robot ed-effector keeps cotact its eviromet, has bee cotiuously icreasig I these mechaical systems, amed costraied robots, there exist variables that deteriorate the represetativity of the omial model, such as parametric ucertaities, umodelled dyamics, ad exteral disturbaces Therefore, the study of cotrol techiques to deal this kid of problem deserves special attetio A adaptive eural etwork trackig cotrol a guarateed H performace is developed i [3] for ucostraied maipulators; the eural etwork is employed first to approximate a cotiuous fuctio defied by the robot dyamic equatio ad torque disturbaces; the H cotroller is desiged to atteuate the effect of the approximatio error (geerated by the eural etwork algorithm ad cosidered as the disturbace to be atteuated) o the trackig error A compariso of this adaptive eural etwork trackig cotrol model-based cotrollers, based o results obtaied from a actual maipulator, is performed i [6] A fuzzy logic cotroller equipped a adaptive algorithm is preseted i [4] to achieve H performace for both holoomic ad oholoomic costraied robots As i [3], the approximatio error icludes the robot dyamics ad torque disturbaces All these H cotrol strategies are difficult to be implemeted i a actual robot The approximatio errors of these cotrollers iclude the robot dyamics ad it is difficult to verify, as assumed i [3], the L 2 property of these errors, that is essetial to guaratee the H atteuatio criterio I [2], a hybrid motio/force trackig cotrol desig a adaptive scheme that guaratees H performace for holoomic costraied robots is proposed For this approach *The authors are the Electrical Egieerig Departmet - Uiversity of São Paulo at São Carlos, CP359, São Carlos, SP, , Brazil s: apetroi,siqueira,terra@seleescuspbr it is required a precise kowledge of the etire robot dyamic model i order to guaratee the best performace of this cotroller I this paper, a adaptive eural etwork cotroller H performace is proposed to holoomic costraied robots It icludes the variable structure cotrol (VSC) proposed i [1] to elimiate the coditio of square-itegrability of the approximatio error Moreover, it is cosidered that a omial part of the robot dyamics is kow for the cotrol algorithm I this case, the eural etwork is employed to approximate oly the ucertai part of the robot dyamics The proposed adaptive eural etwork-based cotroller is implemeted i the experimetal maipulator UArm II [7], which performs a costraied movemet I order to measure the forces betwee the UArm II ed-effector ad the eviromet, a suitable force sesor device, which uses oe-directioal piezoelectric force sesors, was desiged ad built i our laboratory This paper is orgaized as follows: the reduced order model of a costraied robot is preseted i Sectio II; a adaptive eural etwork-based cotroller guarateed H performace for costraied robots is proposed i Sectio III; ad, fially, a descriptio of the force sesor device ad experimetal results are preseted i Sectio IV II REDUCED ORDER MODEL FOR HOLONOMIC CONSTRAINED ROBOTS Cosider a robot maipulator subject to holoomic costraits o its ed-effector The equatio of the m costraits is of the form φ(q)= where q R are the joit positios ad φ(q) : R R m is a smooth fuctio The dyamic equatio of the costraied robot is give from Lagrage theory as M(q) q +C(q, q) q + G(q)=τ + J T (q)λ + τ d (1) where M(q) R is the symmetric positive defiite iertia matrix, C(q, q) R is the Coriolis ad cetripetal matrix, G(q) R are the gravitatioal torques, τ R are the applied torques, λ R m is a vector of geeralized Lagragia multipliers associated the costraits, J(q)= ( φ/ q) R m is the Jacobia matrix, ad τ d R deotes the exteral disturbaces If the Jacobia matrix J(q) has full row rak m for all q R, the the vector q ca be partitioed as q = [(q 1 ) T (q 2 ) T ] T,whereq 1 =[q 1 1 q1 m ]T describes the costraied motio of the maipulator ad q 2 =[q 2 1 q2 m] T /5/$2 25 IEEE 5528
2 deotes the remaiig joits variables Moreover, there exist a ope set Ω c R m ad a fuctio σ : Ω c R m such that φ(q 1,σ(q 1 )) = Therefore, the reduced form of costraied robot (1) is give as ([2], [4] ad [8]) M(q 1 )L(q 1 ) q 1 +C L (q 1, q 1 ) q 1 + G(q 1 )=τ + J T (q)λ + τ d (2) where L(q 1 )= [ I m σ(q 1 ) q 1 ], I m meas idetity matrix ad C L (q 1, q 1 ) q 1 = M(q 1 )L(q 1 )+ C(q 1, q 1 )L(q 1 ) The matrices M(q 1 ), C(q 1, q 1 ) ad G(q 1 ) i (2) are obtaied by substitutig q 2 = σ(q 1 ) ad q = L q 1 i M(q),C(q, q) ad G(q) i (1), respectively III ADAPTIVE NEURAL NETWORK-BASED H CONTROL To obtai the error dyamic equatio, it is defied the followig trackig error x(t), see [2] ad refereces therei for more details, x(t) = [ ] [ x1 (t) = q 1 (t) q 1 d (t) ] x 2 (t) q 1 (t) q 1 d (t)+p(q1 (t) q 1 d (t)) (3) for some costat p >, where q 1 d (t) is a desired joit trajectory for q 1 (t) its time derivatives q 1 d (t), q1 d (t) ad d 3 (q 1 d (t))/dt3 bouded, ad satifyig φ(σ(q 1 (t)),q 1 (t)) = Premultiplyig both sides of (2) by L T (q 1 ),weget A L (q 1 ) q 1 + L T (q 1 )C L (q 1, q 1 ) q 1 + +L T (q 1 )G(q 1 )=L T (q 1 )(τ + τ d ) where A L (q 1 )=L T (q 1 )M(q 1 )L(q 1 ) Observe that L T (q 1 ) is formulated such that L T (q 1 )J T (q)= (4) The the error dyamic equatios ca be obtaied as ẋ 1 = px 1 + x 2 A L (q 1 )ẋ 2 = L T (q 1 )C L (q 1, q 1 )x 2 + L T (q 1 )( F(x e )+τ + τ d ) (5) where x e =[(q 1 ) T ( q 1 ) T (q 1 ) T d ( q 1 ) T d ( q 1 ) T d ]T ad F(x e ) = M(q 1 )L(q 1 )( q 1 d pẋ 1 )+C L (q 1, q 1 )( q 1 d px 1)+G(q 1 ) A parametric ucertaity ca be itroduced i (1) dividig the parameter matrices M(q), C(q, q), ad G(q) ito a omial ad a perturbed part M(q)=M (q)+ M(q) C(q, q)=c (q, q)+ C(q, q) G(q)=G (q)+ G(q) where M (q), C (q, q), adg (q) are the omial matrices ad M(q), C(q, q), ad G(q) are the parametric ucertaities The, F(x e ) ca be expressed as F(x e )=F (x e )+ F(x e ) (6) where F (x e ) is the omial part of F(x e ) computed M (q), C (q, q), adg (q) ad F(x e ) is the ucertai part computed M(q), C(q, q), ad G(q) A adaptive eural etwork, F(x e,θ), is used to estimate the term F(x e ) i (6), where Θ is a vector cotaiig the tuable etwork parameters The procedure to adjust the eural etwork, preseted i this sectio, was developed i [3] ad [1] Defie eural etworks F k (x e,θ k ), k = 1,, composed of oliear euros i every hidde layers ad liear euros i the iput ad output layers, the adjustable weights Θ k i the output layers The sigle-output eural etworks are of the form ) ad F k (x e,θ k ) = ξ k = p k H ( 5 w k ij x e j + m k i j=1 Θ ki = ξ T k Θ k (7) ( ) H 5 j=1 wk 1 j x e j + m k 1 ( ) H 5 j=1 wk p k j x e j + m k p k Θ k = Θ k1 Θ kp k where p k is the umber of euros i the hidde layers, the weights w k ij ad the biases mk i for 1 i p k,1 j 5 ad 1 k are assumed to be costat ad specified by the desiger ad H() is the hyperbolic taget fuctio H(z)= ez e z e z + e z The complete eural etwork ca be deoted by F(x e,θ) = F 1 (x e,θ 1 ) F (x e,θ ) = ξ1 T Θ 1 ξ T Θ ξ T 1 Θ 1 = ξ2 T Θ 2 ξ T Θ = ΞΘ (8) The followig assumptios, defied i [1], are used to guaratee the cotrol law stability based o eural etwork developed i Theorem 31: 5529
3 1) There exists a parameter value Θ Ω θ such that F(x e,θ ) ca approximate F(x e ) as close as possible, where Ω θ is a pre-assiged costrait regio defied as Ω θ = {Θ Θ T Θ M θ, M θ > } 2) There exists a fuctio k(x e ) > such that (δf(x e )) i k(x e ), for all 1 i, where δf(x e )= F(x e,θ ) F(x e ) Ad the followig defiitios are made λ c = λd k λ (λ λ d ) ad E = [ ] I( m) ( m) (9) m ( m) for some k λ >, where λ d (t) is a desired multiplier related to a desired costraied force f d (t), thatis, f d (t) = J T (q d (t))λ d (t) Theorem 31: Cosider the reduced model (2) plat ucertaities ad exteral disturbaces, ad desired referece trajectories q d (t) ad λ d (t) The adaptive eural etworkbased cotroller give by ρξ T Lx 2 if Θ < M θ or ( Θ = M θ ad x Θ T 2 = LT ΞΘ ) ρξ T Lx 2 + ρ xt 2 LT ΞΘ Θ if Θ = M Θ 2 θ ad x T 2 LT ΞΘ < (1) τ = F (x e )+ΞΘ k Ex 2 k(x e )sg(lx 2 ) J T λ c (11) ((q(), q()) are cosidered bouded ad satisfy Φ(q()) = ad J(q() q() =) achieves the followig performace for a suitable choice of the costat gai k : (1) Θ(t) Ω θ ad all the variables q(t), q(t) ad τ(t) are bouded for all t (2) The followig H performace holds x(t) 2 Q V ()+γ 2 τ d (t) 2, T (12) τ d () L 2 [, ), whereq is a weightig matrix ad γ is the atteuatio level (3) The steady-state force error λ λ d is iversely proportioal to the value of k λ + 1 (4) If τ d () L 2 [, ) L [, ), the we ca coclude that lim t (q 1 (t) q 1 d (t)) = adlim t ( q 1 (t) q 1 d (t)) = Proof This proof follows the lie of the proof preseted i [2] for adaptive trackig cotrol, where the liear parametrizatio property is used istead of the adaptive eural etwork approach The Lyapuov fuctio cadidate is chose as V (t,x, Θ)= α 2 xt 1 x xt 2 A L x ρ Θ T Θ (13) for some α >, where Θ = Θ Θ Takig ito accout the cotrol law (11) ad usig the property of skew-symmetry of Ȧ L 2L T C L x 2, the derivative of V(t,x, Θ) alog (5) is give as V(t,x, Θ)= α px T 1 x 1 + αx T 1 x 2 k x T 2 x 2 + x T 2 L T τ d +(x T 2 LT Ξ + 1 Θ T ) Θ + x T 2 ρ LT ( k(x e )sg(lx 2 )+δf(x e )) (14) The above equatio is differet from that oe preseted i [2], sice the eural etwork matrix Ξ is used i place of the regressio matrix Y ad the VSC term ( k(x e )sg(lx 2 )) is added to elimiate the limitatio o the approximatio error discussed i [1] From the defiitio of the update law (1), which is a stadard projectio algorithm [5], it ca be coclude that (x T 2 LT Ξ + 1 ρ Θ T ) Θ adθ(t) Ω θ,forall t ifθ() Ω θ Cosiderig Assumptio (2), it ca be guarateed that x T 2 LT ( k(x e )sg(lx 2 )+δf(x e )) k(x e ) (Lx 2 ) i + (δf(x e ))) i (Lx 2 ) i Hece, cosiderig the costrais obtaied i [2] for k ad p, (14) becomes V x 2 Q + γ2 τ d 2 (15) Itegratig from t = tot = T,siceV(T,x(T), Θ(T )), the above iequality leads to x 2 Q dt V(,x(), Θ()) + γ 2 τ d 2 dt Hece, the H performace is achieved The rest of the proof follows [2] IV RESULTS I this sectio we are goig to show the experimetal results obtaied the applicatio of the cotroller developed i Sectio III o our experimetal maipulator UArm II (Uderactuated Arm II), desiged ad built by H Be Brow, Jr of Pittsburgh, PA, USA [7] This 3- lik plaar maipulator cotais i each joit a DC motor, a break ad a optical ecoders quadrature decodig used to measure the joit positios, Fig 1 Joit velocities are obtaied by umerical differetiatio ad filterig The maipulator kiematic ad dyamic omial parameters, which are used to compute the term F (x e ),areshowi Table I The matrices M (q) ad C (q, q) ca be see i the Appedix TABLE I ROBOT PARAMETERS i m i I i l i lc i f i (kg) (kgm 2 ) (m) (m) (kgm 2 /s) Sice the forces betwee the robot ed-effector ad the eviromet are used i the cotrol law, a force sesor device was desiged ad built to measure the ormal ad tagetial 553
4 Fig 1 Maipulator UArm II Fig 3 Force Sesor Device coupled to UArm II ed-effector Fig 2 Force Sesor Device forces ad the z-directio momet applied i the UArm II ed-effector by the costrait surface described i the followig The device has a alumium-made sesor board where six FSG-15N1A force sesors from Hoeywell ad the acquisitio board are fixed As the FS series force sesor measures oly positive force values, two sesors are disposed i a opposite way for each directio to measure positive ad egative values, see Fig 2 Two force sesor pairs are used to measure the ormal force ad the z-directio momet, give, respectively, by F = F 1 +F 2 ad M z =(F 2 F 1 )r If oly traslatioal movemet is performed o the ormal directio, F 1 = F 2,adthez-directio momet is zero Otherwise, if oly rotatioal movemet is performed, F 1 = F 2 ad the ormal force is zero Figure 3 shows the experimetal maipulator UArm II the force sesor device coupled The costrait surface for the robot ed-effector is a segmet of a straight lie o the X-Y plae, ed-effector orietatio perpedicular to the costrait lie, that is, the orietatio must remai i a costat value c givebythe lie icliatio β The equatios of the m = 2 costraits are [ ] l1 s φ(q)= 1 l 2 s 12 l 3 s β [l 1 c 1 + l 2 c 12 + l 3 c 123 ]+b q 1 + q 2 + q 3 c [ ] = where b is the liear coefficiet of the costrait lie, s ik = si(q i + + q k ), c ik = cos(q i + + q k ), q i is the agular positio of joit i, adl i is the legth of the i-lik Hece, φ : R 3 R 2, ad the Jacobia matrix, J(q) = φ/ q, is give as [ ] J11 J J = 12 J 13 J 21 J 22 J 23 J 11 = l 1 c 1 l 2 c 12 l 3 c 123 β [l 1 s 1 + l 2 s 12 + l 3 s 123 ] J 12 = l 2 c 12 l 3 c 123 β [l 2 s 12 + l 3 s 123 ] J 13 = l 3 c 123 β [l 3 s 123 ] J 21 = J 22 = J 23 = 1 Defiig q 1 =[q 1 ] ad q 2 =[q 2 q 3 ], the matrix L(q) of the costrait lie is 1 L(q)= [cos(q 1)+cos(q 1 +q 2 )+β (si(q 1 )+si(q 1 +q 2 ))] [cos(q 1 +q 2 )+β si(q 1 +q 2 )] [cos(q 1 )+cos(q 1 +q 2 )+β (si(q 1 )+si(q 1 +q 2 ))] [cos(q 1 +q 2 )+β si(q 1 +q 2 )] 1 Observe that l 1 = l 2 = l 3 ad J(q) T L(q) T = The iitial ad fial coordiates of the movemet are (x,y )= (45,3) m ad (x(t ),y(t )) = (49,22) m, respectively I this case, β = 2, b = 12, ad c = 266 The referece trajectory for the joit variables q d (t) is a fifthdegree polyomial, trajectory duratio time T = 4 s It is desired that o force acts o the ormal directio of the costrai lie ad o momet acts o the z-directio, that is, λ d =[(F ) d (M z ) d ] T =[] T The level of atteuatio ad the weightig matrix Q defied for the cotroller are γ = 3adQ = 5I 2, respectively The selected cotrol gais are p = 2, k = 15, k λ = 8, ad ρ = 45, M θ = 1 The fuctio k(x e ) is defied as k(x e )=2 x x
5 The followig auxiliary variable is defied for computatio of F k (x e,θ k ) xx = (q i q d i )+ ( q i q d i ) The matrix Ξ ca be computed as Ξ = ξ 1 T ξ2 T ξ3 T ad ξ 1 =[ξ 11,,ξ 17 ] T, ξ 2 =[ξ 21,,ξ 27 ] T, ξ 3 =[ξ 31,,ξ 37 ] T ξ 11 = ξ 21 = ξ 31 = exx 15 e xx+15 e xx 15 + e xx+15 ξ 12 = ξ 22 = ξ 32 = exx 1 e xx+1 e xx 1 + e xx+1 ξ 13 = ξ 23 = ξ 33 = exx 5 e xx+5 e xx 5 + e xx+5 ξ 14 = ξ 24 = ξ 34 = exx e xx e xx + e xx ξ 15 = ξ 25 = ξ 35 = exx+5 e xx 5 e xx+5 + e xx 5 ξ 16 = ξ 26 = ξ 36 = exx+1 e xx 2 e xx+2 + e xx 2 ξ 17 = ξ 27 = ξ 37 = exx+15 e xx 15 e xx+15 + e xx 15 q i (16) Note that, these defiitios, 7 euros i the hidde layer are selected for the eural etworks the weights w k ij assumig the values 1 or 1 ad the biases m i assumig the values 15, 1, 5,, 5, 1, 15 The etwork parameters Θ are defied by Θ = Θ 1 Θ 2 Θ 3 Θ 1 =[Θ 11 Θ 12 Θ 13 Θ 14 Θ 15 Θ 16 Θ 17 ] T Θ 2 =[Θ 21 Θ 22 Θ 23 Θ 24 Θ 25 Θ 26 Θ 27 ] T Θ 3 =[Θ 31 Θ 32 Θ 33 Θ 34 Θ 35 Θ 36 Θ 37 ] T The experimetal results (joit positio ad torque) for the H cotrol are show i Figures 4 ad 5, respectively Figure 6 shows the measured ormal force ad momet at the robot ed-effector Fially, the ed-effector X Y positio is showifigure7 Joit Positio (º) Torque (Nm) Joit 1 Joit 2 Joit 3 Desired Time (s) Joit 1 Joit 2 Joit 3 Fig 4 Joit Positio ( ) Time (s) Fig 5 Torque (Nm) V CONCLUSIONS The most importat cotributio of this paper are the experimetal results obtaied a costraied robot maipulator subject to parametric ucertaities ad exteral disturbaces A adaptive eural etwork-based cotrol trackig performace is developed to atteuate the effects of the disturbaces o the trackig errors Also, a force cotrol is employed to track the costrait forces actig at the robot ed-effector to a desired value The force sesor device developed i this paper, that was built i our laboratory, presets simple desig ad structure, that ca be a ecoomical advatage i compariso available force sesors REFERENCES [1] Y C Chag, Neural etwork-based H trackig cotrol for robotic systems, IEE Proceedigs o Cotrol Theory Applicatios, vol147, o 3, 2, pp [2] Y C Chag ad B S Che, Adaptive Trackig Cotrol Desig of Costraied Robot Systems, Iteratioal Joural of Adaptive Cotrol Sigal Processig, vol 12, 1998, pp [3] Y C Chag ad B S Che, A Noliear Adaptive H Trackig Cotrol Desig i Robotic Systems via Neural Networks, IEEE Trasactios o Cotrol Systems Techology, vol 5, 1997, pp [4] YCChagadBSChe,RobustTrackigDesigsforBothHoloomic ad Noholoomic Costraied Mechaical Systems: Adaptive Fuzzy Approach, IEEE Trasactios o Fuzzy Systems, vol 8, 2, pp [5] H K Khalil, Adaptive ooutput feedback cotrol of oliear systems represeted by iput-output models, IEEE Trasactio o Automatic Cotrol, vol 41, 1996, pp
6 Force ad Momet Positio Y (m) Force (N) Momet (Nm) Time (s) Fig Force ad Momet Applied at the robot ed-effector Real Desired Positio X (m) Fig 7 Positio X, Y of the robot ed-effector [6] A A G Siqueira, A Petroilho ad M H Terra, Adaptive oliear H techiques applied to a robot maipulator, Proceedigs of the IEEE Coferece o Cotrol Applicatios, Istambul, Turquia, 23, pp [7] A A G Siqueira ad M H Terra Noliear ad Markovia H cotrols of uderactuated maipulators IEEE Trasactios o Cotrol Systems Techology, v 12, 6, 24, p [8] C Y Su, Y Stepaeko ad T P Leug Combied adaptive ad varible strucuture cotrol of costraied robots, Automatica, vol 31, 1995, pp APPENDIX The matrices M (q) ad C (q, q) for the plaar maipulator are give by: M (q)= M 11(q) M 12 (q) M 13 (q) M 21 (q) M 22 (q) M 23 (q) M 31 (q) M 32 (q) M 33 (q) M 11 (q)=m 1 lc m 2 (l1 2 + lc l 1 l c2 cos(q 2 )) + m 3 (l1 2 + l2 2 + lc l 1 l 2 cos(q 2 )+2l 2 l c3 cos(q 3 )) + 2m 3 l 1 l c3 cos(q 2 + q 3 )+I 1 + I 2 + I 3, M 12 (q)=m 2 (lc l 1 l c2 cos(q 2 )) + m 3 (l2 2 + lc l 1 l 2 cos(q 2 )) + m 3 (l 1 l c3 cos(q 2 + q 3 ) + 2l 2 l c3 cos(q 3 )) + I 2 + I 3, M 13 (q)=i 3 + m 3 (lc l 1 l c3 cos(q 2 + q 3 )+l 2 l c3 cos(q 3 )), M 21 (q)=m 12 (q), M 22 (q)=i 2 + I 3 + m 2 (lc 2 2 )+m 3 (l2 2 + l2 c 3 + 2l 2 l c3 cos(q 3 )), M 23 (q)=i 3 + m 3 (lc l 2 l c3 cos(q 3 )), M 31 (q)=m 13 (q), M 32 (q)=m 23 (q), M 33 (q)=i 3 + m 3 (lc 2 3 ), ad C (q, q)= C 11(q, q) C 12 (q, q) C 13 (q, q) C 21 (q, q) C 22 (q, q) C 23 (q, q), C 31 (q, q) C 32 (q, q) C 33 (q, q) C 11 (q, q)= [(m 2 l 1 l c2 si(q 2 )+m 3 l 1 l 2 si(q 2 ) + m 3 l 1 l c3 si(q 2 + q 3 )) q 2 +(m 3 l 1 l c3 si(q 2 + q 3 ) + m 3 l 2 l c3 si(q 3 )) q 3 ], C 12 (q, q)= [(m 2 l 1 l c2 si(q 2 )+m 3 l 1 l 2 si(q 2 ) + m 3 l 1 l c3 si(q 2 + q 3 ))( q 2 ) +(m 3 l 1 l c3 si(q 2 + q 3 )+m 3 l 2 l c3 si(q 3 )) q 3 ], C 13 (q, q)= [(m 3 l 1 l c3 si(q 2 + q 3 )+m 3 l 2 l c3 si(q 3 )) ( q 2 + q 3 )], C 21 (q, q)=(m 2 l 1 l c2 si(q 2 )+m 3 l 1 l 2 si(q 2 ) + m 3 l 1 l c3 si(q 2 + q 3 )) q 1 m 3 l 2 l c3 si(q 3 ) q 3, C 22 (q, q)= m 3 l 2 l c3 si(q 3 ) q 3, C 23 (q, q)= m 3 l 2 l c3 si(q 3 )( q 2 + q 3 ), C 31 (q, q)=(m 3 l 1 l c3 si(q 2 + q 3 )+m 3 l 2 l c3 si(q 3 )) q 1 + m 3 l 2 l c3 si(q 3 ) q 2, C 32 (q, q)=m 3 l 2 l c3 si(q 3 )( q 2 ), C 33 (q, q)=, where m i, l i, l ci, I i, q i ad q i, are the mass, the legth, the ceter of mass, the iertia mometum, the agular positio ad the agular velocity of the i-lik, respectively 5533
Systems Design Project: Indoor Location of Wireless Devices
Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 698-5295 Email: [email protected] Supervised
Modified Line Search Method for Global Optimization
Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o
Study on the application of the software phase-locked loop in tracking and filtering of pulse signal
Advaced Sciece ad Techology Letters, pp.31-35 http://dx.doi.org/10.14257/astl.2014.78.06 Study o the applicatio of the software phase-locked loop i trackig ad filterig of pulse sigal Sog Wei Xia 1 (College
Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT
Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee
Research Article Sign Data Derivative Recovery
Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece
THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n
We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample
Iran. J. Chem. Chem. Eng. Vol. 26, No.1, 2007. Sensitivity Analysis of Water Flooding Optimization by Dynamic Optimization
Ira. J. Chem. Chem. Eg. Vol. 6, No., 007 Sesitivity Aalysis of Water Floodig Optimizatio by Dyamic Optimizatio Gharesheiklou, Ali Asghar* + ; Mousavi-Dehghai, Sayed Ali Research Istitute of Petroleum Idustry
INVESTMENT PERFORMANCE COUNCIL (IPC)
INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks
Soving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
Cantilever Beam Experiment
Mechaical Egieerig Departmet Uiversity of Massachusetts Lowell Catilever Beam Experimet Backgroud A disk drive maufacturer is redesigig several disk drive armature mechaisms. This is the result of evaluatio
Chapter 6: Variance, the law of large numbers and the Monte-Carlo method
Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
I. Chi-squared Distributions
1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.
Sequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection
The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity
SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
Asymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006
Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam
Chapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio
Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley
Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these
Capacity of Wireless Networks with Heterogeneous Traffic
Capacity of Wireless Networks with Heterogeeous Traffic Migyue Ji, Zheg Wag, Hamid R. Sadjadpour, J.J. Garcia-Lua-Aceves Departmet of Electrical Egieerig ad Computer Egieerig Uiversity of Califoria, Sata
Overview on S-Box Design Principles
Overview o S-Box Desig Priciples Debdeep Mukhopadhyay Assistat Professor Departmet of Computer Sciece ad Egieerig Idia Istitute of Techology Kharagpur INDIA -721302 What is a S-Box? S-Boxes are Boolea
Incremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich [email protected] [email protected] Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
Chapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
Output Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
Normal Distribution.
Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued
Department of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
Stochastic Online Scheduling with Precedence Constraints
Stochastic Olie Schedulig with Precedece Costraits Nicole Megow Tark Vredeveld July 15, 2008 Abstract We cosider the preemptive ad o-preemptive problems of schedulig obs with precedece costraits o parallel
DAME - Microsoft Excel add-in for solving multicriteria decision problems with scenarios Radomir Perzina 1, Jaroslav Ramik 2
Itroductio DAME - Microsoft Excel add-i for solvig multicriteria decisio problems with scearios Radomir Perzia, Jaroslav Ramik 2 Abstract. The mai goal of every ecoomic aget is to make a good decisio,
Review: Classification Outline
Data Miig CS 341, Sprig 2007 Decisio Trees Neural etworks Review: Lecture 6: Classificatio issues, regressio, bayesia classificatio Pretice Hall 2 Data Miig Core Techiques Classificatio Clusterig Associatio
A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design
A Combied Cotiuous/Biary Geetic Algorithm for Microstrip Atea Desig Rady L. Haupt The Pesylvaia State Uiversity Applied Research Laboratory P. O. Box 30 State College, PA 16804-0030 [email protected] Abstract:
Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
Hypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.
18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The
5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
Subject CT5 Contingencies Core Technical Syllabus
Subject CT5 Cotigecies Core Techical Syllabus for the 2015 exams 1 Jue 2014 Aim The aim of the Cotigecies subject is to provide a groudig i the mathematical techiques which ca be used to model ad value
Recovery time guaranteed heuristic routing for improving computation complexity in survivable WDM networks
Computer Commuicatios 30 (2007) 1331 1336 wwwelseviercom/locate/comcom Recovery time guarateed heuristic routig for improvig computatio complexity i survivable WDM etworks Lei Guo * College of Iformatio
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
Safety Supervisory Strategy for an Upper-Limb Rehabilitation Robot Based on Impedance Control
Iteratioal Joural of Advaced Robotic Systems ARTICLE Safety Supervisory Strategy for a Upper-Limb Rehabilitatio Robot Based o Impedace Cotrol Regular Paper Lizheg Pa 1, Aiguo Sog 1,*, Guozheg Xu, Huiju
Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics
Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to
LECTURE 13: Cross-validation
LECTURE 3: Cross-validatio Resampli methods Cross Validatio Bootstrap Bias ad variace estimatio with the Bootstrap Three-way data partitioi Itroductio to Patter Aalysis Ricardo Gutierrez-Osua Texas A&M
Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System
Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1, Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-1559 Berli,
Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments
Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please
THE ABRACADABRA PROBLEM
THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected
Convention Paper 6764
Audio Egieerig Society Covetio Paper 6764 Preseted at the 10th Covetio 006 May 0 3 Paris, Frace This covetio paper has bee reproduced from the author's advace mauscript, without editig, correctios, or
Multiplexers and Demultiplexers
I this lesso, you will lear about: Multiplexers ad Demultiplexers 1. Multiplexers 2. Combiatioal circuit implemetatio with multiplexers 3. Demultiplexers 4. Some examples Multiplexer A Multiplexer (see
University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution
Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.
Data Analysis and Statistical Behaviors of Stock Market Fluctuations
44 JOURNAL OF COMPUTERS, VOL. 3, NO. 0, OCTOBER 2008 Data Aalysis ad Statistical Behaviors of Stock Market Fluctuatios Ju Wag Departmet of Mathematics, Beijig Jiaotog Uiversity, Beijig 00044, Chia Email:
Coordinating Principal Component Analyzers
Coordiatig Pricipal Compoet Aalyzers J.J. Verbeek ad N. Vlassis ad B. Kröse Iformatics Istitute, Uiversity of Amsterdam Kruislaa 403, 1098 SJ Amsterdam, The Netherlads Abstract. Mixtures of Pricipal Compoet
AMS 2000 subject classification. Primary 62G08, 62G20; secondary 62G99
VARIABLE SELECTION IN NONPARAMETRIC ADDITIVE MODELS Jia Huag 1, Joel L. Horowitz 2 ad Fegrog Wei 3 1 Uiversity of Iowa, 2 Northwester Uiversity ad 3 Uiversity of West Georgia Abstract We cosider a oparametric
Convexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
Stock Market Trading via Stochastic Network Optimization
PROC. IEEE CONFERENCE ON DECISION AND CONTROL (CDC), ATLANTA, GA, DEC. 2010 1 Stock Market Tradig via Stochastic Network Optimizatio Michael J. Neely Uiversity of Souther Califoria http://www-rcf.usc.edu/
A Fuzzy Model of Software Project Effort Estimation
TJFS: Turkish Joural of Fuzzy Systems (eissn: 309 90) A Official Joural of Turkish Fuzzy Systems Associatio Vol.4, No.2, pp. 68-76, 203 A Fuzzy Model of Software Project Effort Estimatio Oumout Chouseioglou
Properties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
THE HEIGHT OF q-binary SEARCH TREES
THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average
Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
Spam Detection. A Bayesian approach to filtering spam
Spam Detectio A Bayesia approach to filterig spam Kual Mehrotra Shailedra Watave Abstract The ever icreasig meace of spam is brigig dow productivity. More tha 70% of the email messages are spam, ad it
Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
Module 2. The Science of Surface and Ground Water. Version 2 CE IIT, Kharagpur
Module The Sciece of Surface ad Groud Water Versio CE IIT, Kharagpur Lesso 8 Flow Dyamics i Ope Chaels ad Rivers Versio CE IIT, Kharagpur Istructioal Objectives O completio of this lesso, the studet shall
CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
1 Computing the Standard Deviation of Sample Means
Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.
ADAPTIVE NETWORKS SAFETY CONTROL ON FUZZY LOGIC
8 th Iteratioal Coferece o DEVELOPMENT AND APPLICATION SYSTEMS S u c e a v a, R o m a i a, M a y 25 27, 2 6 ADAPTIVE NETWORKS SAFETY CONTROL ON FUZZY LOGIC Vadim MUKHIN 1, Elea PAVLENKO 2 Natioal Techical
Partial Di erential Equations
Partial Di eretial Equatios Partial Di eretial Equatios Much of moder sciece, egieerig, ad mathematics is based o the study of partial di eretial equatios, where a partial di eretial equatio is a equatio
Transient Behavior of Two-Machine Geometric Production Lines
Trasiet Behavior of Two-Machie Geometric Productio Lies Semyo M. Meerkov Nahum Shimki Liag Zhag Departmet of Electrical Egieerig ad Computer Sciece Uiversity of Michiga, A Arbor, MI 489-222, USA (e-mail:
Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find
1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.
*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.
Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.
Confidence Intervals for One Mean
Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a
Infinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
A Multifractal Wavelet Model of Network Traffic
A Multifractal Wavelet Model of Network Traffic Proect Report for ENSC80 Jiyu Re School of Egieerig Sciece, Simo Fraser Uiversity Email: [email protected] Abstract I this paper, a ew Multifractal Wavelet Model
CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive
TIGHT BOUNDS ON EXPECTED ORDER STATISTICS
Probability i the Egieerig ad Iformatioal Scieces, 20, 2006, 667 686+ Prited i the U+S+A+ TIGHT BOUNDS ON EXPECTED ORDER STATISTICS DIMITRIS BERTSIMAS Sloa School of Maagemet ad Operatios Research Ceter
Evaluating Model for B2C E- commerce Enterprise Development Based on DEA
, pp.180-184 http://dx.doi.org/10.14257/astl.2014.53.39 Evaluatig Model for B2C E- commerce Eterprise Developmet Based o DEA Weli Geg, Jig Ta Computer ad iformatio egieerig Istitute, Harbi Uiversity of
Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:
Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries
Using Four Types Of Notches For Comparison Between Chezy s Constant(C) And Manning s Constant (N)
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH OLUME, ISSUE, OCTOBER ISSN - Usig Four Types Of Notches For Compariso Betwee Chezy s Costat(C) Ad Maig s Costat (N) Joyce Edwi Bategeleza, Deepak
VEHICLE TRACKING USING KALMAN FILTER AND FEATURES
Sigal & Image Processig : A Iteratioal Joural (SIPIJ) Vol.2, No.2, Jue 2011 VEHICLE TRACKING USING KALMAN FILTER AND FEATURES Amir Salarpour 1 ad Arezoo Salarpour 2 ad Mahmoud Fathi 2 ad MirHossei Dezfoulia
Lecture 4: Cheeger s Inequality
Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular
Overview of some probability distributions.
Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability
An Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function
A Efficiet Polyomial Approximatio of the Normal Distributio Fuctio & Its Iverse Fuctio Wisto A. Richards, 1 Robi Atoie, * 1 Asho Sahai, ad 3 M. Raghuadh Acharya 1 Departmet of Mathematics & Computer Sciece;
A Recursive Formula for Moments of a Binomial Distribution
A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,
CHAPTER 3 THE TIME VALUE OF MONEY
CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all
Class Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
Research Article Heuristic-Based Firefly Algorithm for Bound Constrained Nonlinear Binary Optimization
Advaces i Operatios Research, Article ID 215182, 12 pages http://dx.doi.org/10.1155/2014/215182 Research Article Heuristic-Based Firefly Algorithm for Boud Costraied Noliear Biary Optimizatio M. Ferada
Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis
Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
COMPARISON OF THE EFFICIENCY OF S-CONTROL CHART AND EWMA-S 2 CONTROL CHART FOR THE CHANGES IN A PROCESS
COMPARISON OF THE EFFICIENCY OF S-CONTROL CHART AND EWMA-S CONTROL CHART FOR THE CHANGES IN A PROCESS Supraee Lisawadi Departmet of Mathematics ad Statistics, Faculty of Sciece ad Techoology, Thammasat
1 The Gaussian channel
ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.
7.1 Finding Rational Solutions of Polynomial Equations
4 Locker LESSON 7. Fidig Ratioal Solutios of Polyomial Equatios Name Class Date 7. Fidig Ratioal Solutios of Polyomial Equatios Essetial Questio: How do you fid the ratioal roots of a polyomial equatio?
ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE
Proceedigs of the Iteratioal Coferece o Theory ad Applicatios of Mathematics ad Iformatics ICTAMI 3, Alba Iulia ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE by Maria E Gageoea ad Silvia Moldoveau
