Playing Tic-Tac-Toe Using Genetic Neural Network with Double Transfer Functions
|
|
- Todd Lawson
- 6 years ago
- Views:
Transcription
1 Journa of Integent Learnng Sytem an Aaton, 0, 3, o:0.436/a Pubhe Onne February 0 (htt:// 37 Payng T-Ta-Toe Ung Genet Neura Network wth Doube Tranfer Funton Sa Ho Lng, Hak Keung Lam Fauty of Engneerng an Informaton Engneerng, Unverty of Tehnoogy Syney, New South Wae, Autraa; Dvon of Engneerng, Kng Coege Lonon, Lonon, UK. Ema: Steve.Lng@ut.eu.au, hak-keung.am@k.a.uk Reeve Otober 4 th, 00; reve November 3 r, 00; aete January 4 th, 0 ABSTRACT Comutatona ntegene a owerfu too for game eveoment. In th aer, an agorthm of ayng the game T-Ta-Toe wth omutatona ntegene eveoe. Th agorthm earne by a Neura Network wth Doube Tranfer funton (NNDTF), whh trane by genet agorthm (GA). In the NNDTF, the neuron ha two tranfer funton an exhbt a noe-to-noe reatonh n the hen ayer that enhane the earnng abty of the network. A T-Ta-Toe game ue to how that the NNDTF rove a better erformane than the tratona neura network oe. Keywor: Game, Genet Agorthm, Neura Network. Introuton Game uh a Bakgammon, Che, Cheker, Go, Otheo an T-Ta-Toe are wey ue atform for tuyng the earnng abty of an eveong earnng agorthm for mahne. By ayng game, the mahne ntegene an be reveae. Some tehnque of artfa ntegene, uh a the brute-fore metho an knowege-bae metho [], were reorte. Brutefore metho, e.g. retrograe anay [] an enhane tranoton-tabe metho, ove the game robem by ontrutng atabae for the game. For ntane, the atabae forme by a termna oton []. The bet move then etermne by workng bakwar on the ontrute atabae. For knowege-bae metho, the bet move etermne by earhng a game tree. For game uh a Cheker, the tree annng very arge. Tree earhng w be tme onumng even for a few e. Hene, an effent earhng agorthm an mortant ue. Some earhng agorthm, whh are afe a knowege-bae metho, are threat-ae earh an -earh, roof-number earh [3], eth-frt roof-number earh an attern earh. It an be een that the above game-ovng metho e many on the atabae ontruton an earhng. The robem are ove by formng a obe et of outon bae on the game onton, or earhng for the et of outon bae on the urrent game onton. The mahne annot earn to ay the game by tef. Unke an evoutonary aroah n [], neura network (NN) wa emoye to evove an to earn for ayng T-Ta-Toe wthout the nee of a atabae. Evoutonary rogrammng wa ue to egn the NN an nk weght. A mar ea ha been ae n a Cheker game [4-7]. Other game uh a Bakgammon [8], Otheo [9] an Cheker [0] ayng NN or omutatona ntegene tehnque an ao be foun. In th aer, a neura network wth oube tranfer funton (NNDTF) rooe to earn the rue of T-ta-toe. Eah obe move evauate by a rooe agorthm wth a ore. By maxmzng the tota ore (evauate vaue), the rue of T-Ta-Toe an be extrate by the NNDTF. Dfferent from the tratona fee-forwar mute-ereton NN, ome mofe tranfer funton wth a noe-to-noe reatonh are ntroue to the rooe NN. The mofe tranfer funton are aowe to hange the hae urng oeraton. Hene, the workng oman arger than that of the tratona one. By ntroung the noe-to-noe reatonh between hen noe, nformaton an be exhange between hen ayer. A a reut, the earnng abty enhane. A genet agorthm (GA) [] nvetgate to tran the NNDTF. The trane NNDTF w then be emoye to ay T-Ta-Toe wth a human ayer a an exame. Coyrght 0 SRe.
2 38 Payng T-Ta-Toe Ung Genet Neura Network wth Doube Tranfer Funton Th aer organze a foow. An agorthm to evauate eah move on ayng the T-Ta-Toe w be rooe n eton. NNDTF w be reente n eton 3. Genet Agorthm w be reente n eton 4. Tranng of the NNDTF ung GA to earn the rue of T-Ta-Toe w be reente n eton 5. An exame on ayng T-Ta-Toe w be gven n eton 6. A onuon w be rawn n eton 7.. Agorthm for Payng T-Ta-Toe The game T-ta-toe, ao known a naught an roe, a two-ayer game. Eah ayer w ae a marker, X for the frt ayer an O for the eon ayer, n turn n a three-by-three gr area. The frt ayer take the frt move. The goa to ae three marker n a ne of any reton on the gr area. An agorthm rooe n th eton to evauate the move on eah gr. An X an an O on a gr are enote by an reetvey. An emty gr enote by 0.5. The foowng roeure ue to evauate eah obe move. ) Pae an X on an emty gr. ) Correonng to te, um u a the gr vaue for eah ne n any reton, e.g., for a gr n the orner, we have three evauate vaue beaue there are three ne to wn or oe. 3) Remove the X ae n te an ae an X on another emty gr. Evauate th gr ung the agorthm n te. Reeat th roe t a emty gr are evauate. 4) After evauaton, eah gr w have been agne at eat evauate vaue for a obe ne, e.g. the enter gr w have 4 evauate vaue, orner gr w have 3 evauate vaue an other gr w have evauate vaue. There are totay 6 obe evauate vaue: 3 ( + + ),.5 ( ), ( ), ( + + ), 0.5 ( ) an ( + ). The mot mortant evauate vaue of a gr 3, whh nt a wnnng of the game (3 X n a ne) f you ut an X on that gr. The rorty of takng that move the hghet. The eon mortant evauate vaue of a gr ( O an X n a ne), whh nt that the oonent hou be revente from wnnng the game. The rorty of takng that move the eon hghet. Ung th ratonae, the t of rorty n a eng orer : 3,,.5,,, 0.5. Bae on thee agne evauate vaue, a ore w be agne to eah obe move. Frt, eah evauate vaue agne a ore: , 5 6, , 3 4, 3 3 an 05., The hoen ore have the foowng roerte, 4 () () (3) 3 4 (4) 4 (5) The um of the ore of a gr the fna ore. The fna ore w be ue to etermne the rorte of the obe move. A hgher fna ore of a gr nate a hgher rorty of that move. The reaon for hoong the ore n th way wth the roerte of () to (5) are a foow. A the evauate vaue of 3 nate a wnnng of the game (3 X n a ne), the ore of 6 mut be the hghet. There are at mot four evauate vaue for a gr. Hene, 6 mut be greater than 4 tme the eon arget evauate vaue,.e Conequenty, the rorty of a gr havng an evauate ore wth a hgher rorty w not be affete by other ower evauate ore. For ntane, oner a gr havng evauate vaue of 3 an 0.5, an another gr havng evauate vaue of,.5, an 0.5. The fna ore of the former gr (7 7 + ) bgger than an atter gr (7 7 + an ). Thu, the X hou be ae at the gr havng an evauate vaue of 3 to wn the game. Take the game a hown n Fgure a an exame, we have 3 X an 3 O. The next move w be to ae an X. After agnng an emty gr to be 0.5, an X to be, an O to be, Fgure (b) obtane. Foowng Ste to Ste 3, we obtan the evauate vaue a hown n Fgure (). Bae on Ste 4, Fgure () how the fna ore for the emty gr. A the hghet ore 87334, the mot arorate move to ut an X on the bottom rght orner. Th move not (a) ,.5,.5 (b).5, () () Fgure. Evauaton roe. 3, -,.5 Coyrght 0 SRe.
3 Payng T-Ta-Toe Ung Genet Neura Network wth Doube Tranfer Funton 39 ony ne u 3 X to wn a game, but ao revent the oonent to ne u 3 O. The eon arorate move, nte by the fna ore of 5906, an gan a hane to wn by nng u X, an revent the oonent to wn. 3. Neura Network wth Doube Tranfer Funton (NNDTF) NN wa rove to be a unvera aroxmator []. A 3-ayer fee-forwar NN an aroxmate any nonnear ontnuou funton to an arbtrary auray. NN are wey ae n area uh a reton, ytem moeng an ontro []. Owng to t artuar truture, a NN goo n earnng [] ung ome earnng agorthm uh a GA [] an bak roagaton []. In genera, the roeng of a tratona fee-forwar NN one n a ayer-by-ayer manner. In th aer, by ntroung a noe-to-noe reatonh n the hen ayer of the NN, a better erformane an be obtane. Fgure how the rooe neuron. It ha two atvaton tranfer funton to govern the nut-outut reatonh of the neuron: tat tranfer funton (STF) an ynam tranfer funton (DTF). For the STF, the arameter are fxe an t outut e on the nut of the neuron. For the DTF, the arameter of the atvaton tranfer funton e on the outut of other neuron an t STF. Wth th rooe neuron, the onneton of the rooe NN hown n Fgure 3, whh a three-ayer NN. A noe-to-noe reatonh ntroue n the hen ayer. Comarng wth the tratona fee-forwar NN [], t wa reorte n [3] that the rooe NN an offer a better erformane an nee fewer hen noe. The eta of the NNDTF are reente a foow. 3.. The Neuron Moe We oner the STF frt. Let v be the ynat onneton weght from the -th nut omonent x to the -th neuron. The outut of the -th neuron STF efne a, x v v x v nn x nn, z STF net () net () DTF th neuron z, Fgure. Moe of the rooe neuron. z x x x nn v nh v nn v v v nn v n n n h n h nh z z n h nh nh z nh nh n h w w w nh w nout w n h n out w nout Fgure 3. Conneton of the NNDTF. n n net xv (6) where,,, n n,,,, n h ; nn enote the number of nut an net a tat atvaton tranfer funton. The atvaton tranfer funton efne a, n n xv m nn xv n n xv m e f xv m net e otherwe (7) where m an are the tat mean an tat tanar evaton for the -th STF reetvey. The arameter ( m an ) are fxe after the tranng roeng. Thu, the atvaton tranfer funton tat. The outut of the STF e on the nut of the neuron ony. From (7), the outut vaue range from to. The hae of the rooe atvaton tranfer funton hown n Fgure 4 an Fgure 5. It an be oberve from thee fgure that net f a f. nn y y nout net f a f an Conerng the DTF, the neuron outut z of the -th neuron efne a, z net,m, (8) where net the DTF efne a foow, m e f m net,m, m e otherwe (9) Coyrght 0 SRe.
4 40 Payng T-Ta-Toe Ung Genet Neura Network wth Doube Tranfer Funton net m=0. m=0 m=-0. m=-0.4 m= f Fgure 4. Same tranfer funton of the rooe neuron ( = 0.). net f Fgure 5. Same tranfer funton of the rooe neuron (m = 0). where m z (0),, z () m an are the ynam mean an ynam tanar evaton for the -th DTF. z an z rereent the outut of the -th an -th neuron reetvey., enote the weght of the nk between the -th noe an the -th noe an, enote the weght of the nk between the -th noe an the -th noe. It hou be note that f,, equa to n h,an f nh,, equa to,. In th DTF, unke the STF, the atvaton tranfer funton ynam a the arameter of t atvaton tranfer funton e on the outut of the -th an -th neuron. Referrng to (4), the nut-outut reatonh of the rooe neuron a foow, n n z net net xv,m, () 3.. Conneton of the NNDTF A hown n Fgure 3, the NNDTF ha three ayer wth n n noe n the nut ayer, n h noe n the hen ayer, an n out noe n the outut ayer. In the hen ayer, the neuron moe reente n the revou eton emoye. The outut vaue of the hen noe e on the neghborng noe an nut noe. In the outut ayer, a tat atvaton tranfer funton emoye. Conerng an nut-outut ar ( x, y), the outut of the -th noe of the hen ayer gven by n n z net net xv (3) The outut of the NNDTF efne a, n out y neto zw,,,, n out (4) nout n n neto net net xv w (5) where w enote the weght of the nk between the -th hen an the -th outut noe; neto enote the atvaton tranfer funton of the outut neuron. The tranfer funton of the outut noe efne a foow, zk mo o e f zk mo netoz (6) zk mo o e otherwe where mo an o are the mean an the tanar evaton of the outut noe atvaton tranfer funton reetvey. The arameter of the NNDTF an be trane by GA []. 4. Genet Agorthm Genet agorthm (GA) are owerfu earhng agorthm. The tratona GA roe [4-6] hown n Fgure 6. Frt, a ouaton of hromoome reate. Seon, the hromoome are evauate by a efne ftne funton. Thr, ome of the hromoome are eete for erformng genet oeraton. Forth, genet oeraton of roover an mutaton are erforme. The roue offrng reae ther arent n the nta ouaton. Th GA roe reeat unt a uer-efne rteron reahe. In th aer, the tratona GA mofe an new genet oerator [] are ntroue to mrove t erformane. The mofe GA roe hown n Fgure 7. It eta w be gven a foow. 4.. Inta Pouaton The nta ouaton a otenta outon et P. The Coyrght 0 SRe.
5 Payng T-Ta-Toe Ung Genet Neura Network wth Doube Tranfer Funton 4 Proeure of the me GA begn 0 // : teraton generaton ntaze P() //P(): ouaton for teraton t evauate f(p()) // f(p()):ftne funton whe (not termnaton onton) o begn + eet arent an from P(-) erform genet oeraton (roover an mutaton) reroue a new P() evauate f(p()) Fgure 6. Proeure of me GA. Proeure of the mrove GA begn 0 // : teraton ntaze P() //P(): ouaton for teraton t evauate f(p()) // f(p()):ftne funton whe (not termnaton onton) o begn + eet arent an from P(-) erform roover oeraton aorng (3) to (8) erform mutaton oeraton aorng to (30) to three offrng no, no an no 3 // reroue a new P() f ranom number < a The one among no, no an no 3 wth the arget ftne vaue reae the hromoome wth the maet ftne vaue n the ouaton ee f f(no ) > maet ftne vaue n the P(-) no reae the hromoome wth the maet ftne vaue f f(no ) > maet ftne vaue n the uate P(-) no reae the hromoome wth the maet ftne vaue f f(no 3 ) > maet ftne vaue n the uate P(-) no 3 reae the hromoome wth the maet ftne vaue evauate P() Fgure 7. Proeure of the mofe GA. frt et of ouaton uuay generate ranomy. P,,, (7) o _ ze no_var,,,, o _ ze;,,,no _ var (8) ara ara (9) mn max where o_ze enote the ouaton ze; no_var enote the number of varabe to be tune;,,,, o_ze;,,, no_var, are the arameter to be tune; ara mn an ara max are the mnmum an maxmum vaue of the arameter for a. It an be een from (7) to (9) that the otenta outon et P ontan ome anate outon (hromoome). The hromoome ontan ome varabe (gene). 4.. Evauaton Eah hromoome n the ouat on w be evauate by a efne ftne funton. The better hromoome w return hgher vaue n th roe. The ftne funton to evauate a hromoome n the ouaton an be wrtten a, ftne f (0) The form of the ftne funton e on the aaton Seeton Two hromoome n the ouaton w be eete to unergo genet oeraton for rerouton by the metho of nnng the rouette whee [6]. It beeve that hgh otenta arent w roue better offrng (urvva of the bet one). The hromoome havng a hgher ftne vaue hou therefore have a hgher hane to be eete. The eeton an be one by agnng a robabty q to the hromoome : q f o _ ze f,,,, o _ ze () The umuatve robabty ˆq for the hromoome efne a, ˆq q () The eeton roe tart by ranomy generatng a nonzero foatng-ont number, 0. Then, the hromoome hoen f qˆ ˆ q,,,, o_ze, an q ˆ0 0. It an be oberve from th eeton roe that a hromoome havng a arger f w have a hgher hane to be eete. Conequenty, the bet hromoome w get more offrng, the average w tay an the wort w e off. In the eeton roe, ony two hromoome w be eete to unergo the genet oeraton Genet Oeraton The genet oeraton are to generate ome new hromoome (offrng) from ther arent after the eeton roe. They nue the roover an the mutaton oeraton. Coyrght 0 SRe.
6 4 Payng T-Ta-Toe Ung Genet Neura Network wth Doube Tranfer Funton Croover The roover oeraton many for exhangng nformaton from the two arent, hromoome an, obtane n the eeton roe. The two arent w roue one offrng. Frt, four hromoome w be generate aorng to the foowng mehanm, o o o o no_var (3) o o o o no_var (4) w max, w o max o o o w, w no_var mn mn (5) o o o o no_var max mn w w (6) no _ var max aramax aramax ara max (7) no _ var mn aramn aramn ara mn (8) where w 0 enote a weght to be etermne by uer, max, enote a vetor wth eah eement obtane by takng the maxmum among the orreonng eement of an. For ntane, max 3, Smary, mn, gve a vetor by takng the mnmum vaue. For ntane, mn 3, 3. Among 4 o to o, the one wth the arget ftne vaue ue a the offrng of the roover oeraton. The offrng efne a, o o o o o no _ var o (9) where o enote the nex whh gve a maxmum vaue of f o, 34,,,. If the roover oeraton an rove a goo offrng, a hgher ftne vaue an be reahe n e teraton. A een from (3) to (6), the offrng rea over the oman: (3) an (6) w move the offrng near entre regon of the onerne oman (a w n (6) a- 4 roahe, o aroahe ), an (4) an (5) w move the offrng near the oman bounary (a w 3 n (4) an (5) aroahe, o an o aroahe max an mn reetvey). The hane of gettng a goo offrng thu enhane Mutaton The offrng (30) w then unergo the mutaton oeraton. The mutaton oeraton to hange the gene of the hromoome. Conequenty, the feature of the hromoome nherte from ther arent an be hange. Three new offrng w be generate by the mutaton oeraton: no o o o no_var (30) bno bno bno _ var no no _ var where b,,,, no _ var, an ony take the vaue of 0 or ; no,,,, no _ var, are ranomy generate number uh that aramn o no ara max. The frt new offrng ( ) obtane aorng to (30) wth that ony one b ( beng ranomy generate wthn the range) aowe to be an a the other are zero. The eon new offrng obtane aorng to (30) wth that ome ranomy hoen b are et to be an other are zero. The thr new offrng obtane aorng to (30) wth a b. Thee three new offrng w then be evauate ung the ftne funton of (). A rea number w be generate ranomy an omare wth a uer-efne number a 0. If the rea number maer than a, the one wth the arget ftne vaue f among the three new offrng w reae the hromoome wth the maet ftne f n the ouaton (even when f f.) If the rea number arger than a, the frt offrng w reae the hromoome wth the maet ftne vaue f n the ouaton f f f ; the eon an the thr offrng w o the ame. a effetvey the robabty of aetng a ba offrng n orer to reue the hane of onvergng to a oa otmum. Hene, the obty of reahng the goba otmum ket. We have three offrng generate n the mutaton roe. From (30), the frt mutaton ( ) n fat a unform mutaton. The eon mutaton aow ome ranomy eete gene to hange mutaneouy. The thr mutaton hange a gene mutaneouy. The eon an the thr mutaton aow mute gene to be hange. Hene, the oman to be earhe arger a omare wth a oman haraterze by hangng a nge gene. A three offrng are roue n eah generaton, the gene w have a arger ae for mrovng the ftne vaue when the ftne vaue ma. When the ftne vaue are arge an neary teay, hangng the vaue of a nge gene (the frt mutaton) may be enough a ome gene may have reahe the otma vaue. After the oeraton of eeton, roover, an mutaton, a new ouaton generate. Th new ouaton w reeat the ame roe. Suh an teratve roe an be termnate when the reut reahe a efne onton, e.g. a efne number of teraton have been Coyrght 0 SRe.
7 Payng T-Ta-Toe Ung Genet Neura Network wth Doube Tranfer Funton 43 reahe. 5. Tranng of the NNDTF In th eton, the GA w be emoye to tran the arameter of the NNDTF to ay T-Ta-Toe bae on the gamng agorthm n Seton. The NNDTF wth 9 nut an outut emoye. The gr are numbere from to 9 from rght to eft an from to to bottom. An X on the gr enote by, an O enote by, an an emty gr enote by 0.5. The gr attern rereente by numera vaue w be ue a the nut of the NNDTF. The outut of the NNDTF ( y t whh a foatng ont number range from to 9) rereent the oton of the marker that hou be ae on. In orer to have a ega move (ae a marker on an emty gr), the marker ae on an emty gr that ha t gr number oet to the outut of the network. To erform the tranng, we have to etermne the arameter to be trane an the ftne funton erbng the robem obetve. The arameter of the mofe network to be turne v m,, w mo o for a,,, whh w be hoen a the hromoome for the GA. 00 fferent tranng attern (obtane bae on the rooe gamng agorthm tate n Seton ) are ue to fee nto the NNDTF for tranng. The ftne funton egne a foow, ftne 00 m 00 max S y t, x t S x t (3) where y t enote the outut of the NNDTF wth the t-th tranng attern x t a the nut, Sm yt, x t enote the fna ore for gr y t an the t-th tranng attern x t bae on the gamng agorthm. Smax x t enote the maxmum fna ore vaue among a the emty gr for the t-th tranng attern x t. The GA to maxmze the ftne vaue (range from 0 to ) o a to fore the outut of the NNDTF to the gr number havng the arget fna ore to enure the bet move. 6. Exame In th eon, a 9-nut--outut NNDTF ue for tranng. The number of hen noe hoen to be tranng attern are ue for tranng wth teraton. The ouaton ze, robabty of aetane, an w are hoen to be 0, 0.5 an 0., reetvey. After tranng, the ftne vaue obtane The uer an ower boun of eah arameter are an, Tabe. Reut of the rooe NN ayng T-Ta-Toe agant wth the tratona NN for 50 game. Prooe aroah move frt Tratona aroah move frt Prooe NN Wn: Draw: Loe 8: 3: 4 3: 4: 8 reetvey. The nta vaue of the arameter are generate ranomy. For omaron uroe, a tratona 3-ayer feeforwar NN [7] trane by GA wth arthmet roover an non-unform mutaton [7] ao ae uner the ame onton to earn the gamng trategy n Seton. The robabte of roover an mutaton are eete to be 0.8 an 0., reetvey. The hae arameter of the tratona GA for non-unform mutaton [7] eete to be 5. Thee arameter are eete by tra an error for the bet erformane. After tranng for teraton, the ftne vaue obtane To tet the erformane of our rooe metho, our trane NN ay T-Ta-Toe wth the trane tratona NN for 50 game arre out. The frt 5 gr attern, whh are generate ranomy wth O an X, are the ame a the next 5 gr attern. For the frt 5 game, the rooe aroah move frt. For the eon 5 game, the tratona aroah move frt. The reut are tabuate n Tabe. It an be een that the rooe aroah erform better. The number of wn 8 by ung NNDTF whe ony 3 by ung the traton NN. 7. Conuon A neura network wth oube tranfer funton an trane wth genet agorthm ha been rooe. An agorthm of ayng T-Ta-Toe ha been reente. A new tranfer funton of the neuron wth a noe-to-noe reatonh ha been rooe. The rooe neura network trane by genet agorthm to earn the agorthm of ayng T-ta-toe. A a omaron, the trane NN ha aye agant the tratona NN trane by the tratona GA. The reut ha hown that the rooe aroah erform better. REFERENCES [] H. J. V. D. Herk, J. W. H. M. Uterwk an J. V. Rwk, Game Sove: Now an n the Future, Artfa Integene, Vo. 34, No. -, 00, o:0. 06/S (0)005-7 [] H. J. V. D. Herk an I. S. Herhberg, The Contruton of an Omnent Engame Data Bae, ICCA Journa, Vo. 8, No., 985, Coyrght 0 SRe.
8 44 Payng T-Ta-Toe Ung Genet Neura Network wth Doube Tranfer Funton [3] L. V. A, M. V. D. Meuen an. V. D. Herk, Proof- Number Searh, Artfa Integene, Vo. 66, No., 994, o:0.06/ (94) [4] D. B. Foge an K. Cheaa, Verfyng Anaona Exert Ratng by Cometng agant Chnook: Exerment n Co-Evovng a Neura Cheker Payer, Neuromutng, Vo. 4, No. -4, 00, o:0.0 6/S095-3(0)00594-X [5] K. Cheaa an D. B. Foge, Evovng Neura Network to Pay Cheker wthout Reyng on Exert Knowege, IEEE Tranaton on Neura Network, Vo. 0, No. 6, 999, o:0.09/ [6] K. Cheaa an D. B. Foge, Evovng an Exert Cheker Payng Program wthout Ung Human Exerte, IEEE Tranaton on Evoutonary Comutaton, Vo. 5, No. 4, 00, o:0.09/ [7] K. Cheaa an D. B. Foge, Autonomou Evouton of Toograh Reguarte n Artfa Neura Network, Neura Comutaton, Vo., No. 7, 00, o:0.6/neo [8] G. Teauro, Programmng Bakgammon Ung Sef- Teahng Neura Net, Artfa Integene, Vo. 34, No. -, 00, o:0.06/s (0) 000- [9] S. Y. Chong, M. K. Tan an J. D. Whte, Obervng the Evouton of Neura Network Learnng to Pay the Game of Otheo, IEEE Tranaton on Evoutonary Comutaton, Vo. 9, No. 3, 005, o:0.09/te- VC [0] D. E. Bea an M. C. Smth, Ranom Evouton n Che, ICCA Journa, Vo. 7, No., 994, [] F. H. F. Leung, H. K. Lam, S. H. Lng an P. K. S. Tam, Tunng of the Struture an Parameter of Neura Network Ung an Imrove Genet Agorthm, IEEE Tranaton on Neura Network, Vo.4, No., 003, o:0.09/tnn [] M. Brown an C. Harr, Neurafuzzy Aatve Moeng an Contro, Prente Ha, Uer Sae Rver, 994. [3] S. H. Lng, F. H. F. Leung, H. K. Lam, Y. S. Lee an P. K. S. Tam, A Nove GA-Bae Neura Network for Short-Term Loa Foreatng, IEEE Tranaton on Inutra Eetron, Vo. 50, No. 4, 003, o:0.09/tie [4] J. H. Hoan, Aataton n Natura an Artfa Sytem, Unverty of Mhgan Pre, Ann Arbor, 975. [5] D. T. Pham an D. Karaboga, Integent Otmzaton Tehnque, Genet Agorthm, Tabu Searh, Smuate Anneang an Neura Network, Srnger-Verag, New York, 000. [6] Z. Mhaewz, Genet Agorthm + Data Struture = Evouton Program, n Eton, Srnger-Verag, New York, 994. [7] S. Haykn, Neura network: A Comrehenve Founaton, n Eton, Prente Ha, Uer Sae Rver, 999. Coyrght 0 SRe.
Estimation of a proportion under a certain two-stage sampling design
Etmaton of a roorton under a certan two-tage amng degn Danutė Kraavcatė nttute of athematc and nformatc Lthuana Stattc Lthuana Lthuana e-ma: raav@tmt Abtract The am of th aer to demontrate wth exame that
More informationProject 2. PID Controller Design with Root Locus
ECSE 4440 Control Engneerng Sytem Projet PD Controller Degn wth Root Lou TA. Abtrat. ntrouton. PD Controller Degn wth Root Lou 4. Exerment 5. Conluon . Abtrat The uroe of th rojet to learn to egn a ontroller
More informationXin Li Department of Information Systems, College of Business, City University of Hong Kong, Hong Kong, CHINA
RESEARCH ARTICLE MOELING FIXE OS BETTING FOR FUTURE EVENT PREICTION Weyun Chen eartment of Educatona Informaton Technoogy, Facuty of Educaton, East Chna Norma Unversty, Shangha, CHINA {weyun.chen@qq.com}
More informationInverse Kinematics From Position to Angles
Invere Knemat From Poton to Ange Invere Knemat Gven a dered poton P & orentaton R o the end-eetor Y,, z, O, A, T z q,, n Fnd the jont varabe whh an brng the robot to the dered onguraton. Sovabt 0 Gven
More informationSupervised Learning. Neural Networks and Back-Propagation Learning. Credit Assignment Problem. Feedforward Network. Adaptive System.
Part 7: Neura Networ & earnng /2/05 Superved earnng Neura Networ and Bac-Propagaton earnng Produce dered output for tranng nput Generaze reaonaby & appropratey to other nput Good exampe: pattern recognton
More informationAssociative Memories
Assocatve Memores We consder now modes for unsupervsed earnng probems, caed auto-assocaton probems. Assocaton s the task of mappng patterns to patterns. In an assocatve memory the stmuus of an ncompete
More informationMulticommodity Distribution System Design
Mummodt strbun stem esgn Consder the probem where ommodtes are produed and shpped from pants through potenta dstrbun enters C usmers. Pants C Cosmers Mummodt strbun stem esgn Consder the probem where ommodtes
More informationNeural network-based athletics performance prediction optimization model applied research
Avaabe onne www.jocpr.com Journa of Chemca and Pharmaceutca Research, 04, 6(6):8-5 Research Artce ISSN : 0975-784 CODEN(USA) : JCPRC5 Neura networ-based athetcs performance predcton optmzaton mode apped
More informationJacobians: Velocities and Static Force.
Jaoban: Veote and Stat Fore mrkabr Unerty o ehnoogy Computer Engneerng Inormaton ehnoogy Department http://e.aut.a.r/~hry/eture/robot-4/robot4.htm Derentaton o poton etor Derate o a etor: V Q d dt Q m
More informationA A Non-Constructible Equilibrium 1
A A Non-Contructbe Equbrum 1 The eampe depct a eparabe contet wth three payer and one prze of common vaue 1 (o v ( ) =1 c ( )). I contruct an equbrum (C, G, G) of the contet, n whch payer 1 bet-repone
More informationGaussian Approximation of the BER for Non-Coherent Optical Fiber CDMA Networks Using Sparse Codes
Gauan Aroxmaton of the BE for Non-Coherent Otcal Fber CDMA Networ Ung are Coe Pham Manh am Faculty of cence an Technology Aumton Unverty Bango Thalan Abtract An analy bae on a Gauan aroxmaton of the BE
More informationUNIT 7. THE FUNDAMENTAL EQUATIONS OF HYPERSURFACE THEORY
UNIT 7. THE FUNDAMENTAL EQUATIONS OF HYPERSURFACE THEORY ================================================================================================================================================================================================================================================
More informationSupplementary Material: Learning Structured Weight Uncertainty in Bayesian Neural Networks
Shengyang Sun, Changyou Chen, Lawrence Carn Suppementary Matera: Learnng Structured Weght Uncertanty n Bayesan Neura Networks Shengyang Sun Changyou Chen Lawrence Carn Tsnghua Unversty Duke Unversty Duke
More informationTypical Neuron Error Back-Propagation
x Mutayer Notaton 1 2 2 2 y Notaton ayer of neuron abeed 1,, N neuron n ayer = vector of output from neuron n ayer nput ayer = x (the nput pattern) output ayer = y (the actua output) = weght between ayer
More informationwe have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows:
APPENDICES Aendx : the roof of Equaton (6 For j m n we have Smary from Equaton ( note that j '( ( ( j E Y x t ( ( x ( x a V ( ( x a ( ( x ( x b V ( ( x b V x e d ( abx ( ( x e a a bx ( x xe b a bx By usng
More informationAdditional File 1 - Detailed explanation of the expression level CPD
Addtonal Fle - Detaled explanaton of the expreon level CPD A mentoned n the man text, the man CPD for the uterng model cont of two ndvdual factor: P( level gen P( level gen P ( level gen 2 (.).. CPD factor
More informationECE 422 Power System Operations & Planning 2 Synchronous Machine Modeling
ECE 422 Power System Operatons & Plannng 2 Synhronous Mahne Moelng Sprng 219 Instrutor: Ka Sun 1 Outlne 2.1 Moelng of synhronous generators for Stablty Stues Synhronous Mahne Moelng Smplfe Moels for Stablty
More informationECE 522 Power Systems Analysis II 2 Power System Modeling
ECE 522 Power Systems Analyss II 2 Power System Moelng Sprng 218 Instrutor: Ka Sun 1 Outlne 2.1 Moelng of synhronous generators for Stablty Stues Synhronous Mahne Moelng Smplfe Moels for Stablty Stues
More information3. MODELING OF PARALLEL THREE-PHASE CURRENT-UNIDIRECTIONAL CONVERTERS 3. MODELING OF PARALLEL THREE-PHASE CURRENT-
3. MOEING OF PARAE THREE-PHASE URRENT-UNIIRETIONA ONERTERS 3. MOEING OF PARAE THREE-PHASE URRENT- UNIIRETIONA ONERTERS Ths chater eelos the moels of the arallel three-hase current-unrectonal swtch base
More informationMore Ramsey Pricing. (firm willing to produce) Notation: 1 of 6
EP 7426, Problem Set 3 Len abrera More Ramey Prng regulated frm rodue two rodut, and, and ell them dretly to fnal utomer. onumer demand for thee erve known erfetly, a are the frm' roduton ot. Produt rodued
More informationMulti-objective Optimal Block Transaction model based Transient Stability Evaluation
Proceedngs of the 5th WSEAS Internatona Conference on Aed Comuter Scence, Hangzhou, Chna, Ar 6-8, 006 (907-9) Mut-objectve Otma Boc Transacton mode based Transent Stabty Evauaton Ru Ma, Hongwen Yan Changsha
More informationDynamics of Linked Hierarchies. Constrained dynamics The Featherstone equations
Dynm o Lnke Herrhe Contrne ynm The Fethertone equton Contrne ynm pply ore to one omponent, other omponent repotone, rom ner to r, to ty tne ontrnt F Contrne Boy Dynm Chpter 4 n: Mrth mpule-be Dynm Smulton
More informationIterative Methods for Searching Optimal Classifier Combination Function
htt://www.cub.buffalo.edu Iteratve Method for Searchng Otmal Clafer Combnaton Functon Sergey Tulyakov Chaohong Wu Venu Govndaraju Unverty at Buffalo Identfcaton ytem: Alce Bob htt://www.cub.buffalo.edu
More informationThe Sugeno Fuzzy Model Identification Method In Parameter Variation of Systems
The Sueno Fuzzy Mode Identfaton Method In araeter Varaton of Systes Shravan Chandaa Deartent of ECEChatanya Insttute of Tehnooy VsahaatnaInda Abstrat - Ths aer resents the sueno ode dentfaton ethod by
More informationChapter 2: Rigid Body Motions and Homogeneous Transforms
Chater : igi Bo Motion an Homogeneou Tranform (original lie b Stee from Harar) ereenting oition Definition: oorinate frame Aetn n of orthonormal bai etor anning n For eamle When rereenting a oint we nee
More informationPattern Classification (II) 杜俊
attern lassfcaton II 杜俊 junu@ustc.eu.cn Revew roalty & Statstcs Bayes theorem Ranom varales: screte vs. contnuous roalty struton: DF an DF Statstcs: mean, varance, moment arameter estmaton: MLE Informaton
More informationand decompose in cycles of length two
Permutaton of Proceedng of the Natona Conference On Undergraduate Reearch (NCUR) 006 Domncan Unverty of Caforna San Rafae, Caforna Apr - 4, 007 that are gven by bnoma and decompoe n cyce of ength two Yeena
More informationResearch on Complex Networks Control Based on Fuzzy Integral Sliding Theory
Advanced Scence and Technoogy Letters Vo.83 (ISA 205), pp.60-65 http://dx.do.org/0.4257/ast.205.83.2 Research on Compex etworks Contro Based on Fuzzy Integra Sdng Theory Dongsheng Yang, Bngqng L, 2, He
More informationEnhanced Receivers for Interference Cancellation in 3G Systems
ADIOENGINEEING, VOL. 8, NO. 4, DECEMBE 9 477 Enhane eevers for Interferene Caneaton n 3G Systems Petr KEJÍK, Stansav HANUS Det. of ao Eetrons, Brno Unversty of Tehnoogy, Purkyňova 8, 6 Brno, Czeh eub xkejk@stu.fee.vutbr.z,
More informationFor higher resolution, can try to match drive and sense axis another to avoid output drift. Drive Electrode. Tuning. Electrodes. Response Amplitude
EE 45: Introuton to MEMS Leture 7: Gyros, & MDS CTN 1/3/09 MEMSBase Fork Gyrosoe Moe Mathng for Hgher Resoluton an sense axes must be stable or at least trak one For hgheesoluton, an try to math re an
More informationTHE SOLAR SYSTEM. We begin with an inertial system and locate the planet and the sun with respect to it. Then. F m. Then
THE SOLAR SYSTEM We now want to apply what we have learned to the olar ytem. Hitorially thi wa the great teting ground for mehani and provided ome of it greatet triumph, uh a the diovery of the outer planet.
More informationModule 3. Process Control. Version 2 EE IIT, Kharagpur 1
Moule 3 Process Control Verson 2 EE IIT, Kharagur 1 Lesson 13 Controller Tunng Verson 2 EE IIT, Kharagur 2 Instructonal Objectves At the en of ths lesson, the stuent shoul be able to Exlan the mortance
More informationClosed-Loop Compensation Method for Oscillations Caused by Control Valve Stiction
Artle ub.a.org/iecr Cloe-Loo Coenaton Metho for Ollaton Caue by Control Valve Stton Janong Wang* College of Engneerng, Pekng Unverty, Bejng, Chna 0087 ABSRAC: h aer rooe a loe-loo oenaton etho to reove
More informationParks Equations Generalised Machines. Represent ac machines in the simplest possible way.
Park Euaton Generale Machne ereent ac machne n the mlet oble way. All machne excet oubly alent reluctance machne e.g. SM an teng motor are eentally alternatng n nature Ueful torue from funamental (atal)
More informationInternal Model Control
Internal Model Control Part o a et o leture note on Introdution to Robut Control by Ming T. Tham 2002 The Internal Model Prinile The Internal Model Control hiloohy relie on the Internal Model Prinile,
More informationNonequilibrium Thermodynamics of open driven systems
1 Boynam Otal Imagng Center (BIOPIC) 2 Beng Internatonal Center for Matematal Resear (BICMR) Peng Unversty, Cna Nonequlbrum ermoynams of oen rven systems Hao Ge A sngle boemal reaton yle B + AP 1 C + ADP
More informationUniversity of Southern California School Of Engineering Department Of Electrical Engineering
Unverty f Suthern afrna Sch Of Enneern Deartent Of Eectrca Enneern EE 48: ewrk nent # fa, Due 9/7/ ha Fure : The redrawn cnfuratn f "F P." t b t a Gven the fure, ne can wrte the fwn equatn: λ t t { λ }
More informationFingerprint Verification Using Genetic Algorithms
Fngerrnt Verfcaton Ung Genetc Algorthm Xuejun Tan and Br Bhanu Center for Reearch n Intellgent Sytem, Unverty of Calforna, Rverde, CA 92521 {xtan, bhanu}@cr.ucr.edu Abtract Fngerrnt matchng tll a challengng
More informationSome remarks about the transformation of Charnes and Cooper by Ezio Marchi *)
Some remars about the transformaton of Charnes an Cooper b Eo Marh * Abstrat In ths paper we eten n a smple wa the transformaton of Charnes an Cooper to the ase where the funtonal rato to be onsere are
More informationClustering. CS4780/5780 Machine Learning Fall Thorsten Joachims Cornell University
Clusterng CS4780/5780 Mahne Learnng Fall 2012 Thorsten Joahms Cornell Unversty Readng: Mannng/Raghavan/Shuetze, Chapters 16 (not 16.3) and 17 (http://nlp.stanford.edu/ir-book/) Outlne Supervsed vs. Unsupervsed
More informationLecture 8: S-modular Games and Power Control
CDS270: Otmzaton Game and Layerng n Commncaton Networ Lectre 8: S-modlar Game and Power Control Ln Chen /22/2006 Otlne S-modlar game Sermodlar game Sbmodlar game Power control Power control va rcng A general
More informationOutline. Clustering: Similarity-Based Clustering. Supervised Learning vs. Unsupervised Learning. Clustering. Applications of Clustering
Clusterng: Smlarty-Based Clusterng CS4780/5780 Mahne Learnng Fall 2013 Thorsten Joahms Cornell Unversty Supervsed vs. Unsupervsed Learnng Herarhal Clusterng Herarhal Agglomeratve Clusterng (HAC) Non-Herarhal
More informationExam-style practice: A Level
Exa-tye practce: A Leve a Let X dete the dtrbut ae ad X dete the dtrbut eae The dee the rad varabe Y X X j j The expected vaue Y : E( Y) EX X j j EX EX j j EX E X 7 The varace : Var( Y) VarX VarX j j Var(
More informationACTA TECHNICA NAPOCENSIS
87 ECHNICAL UNIVERIY OF CLUJ-NAPOCA ACA ECHNICA NAPOCENI ere: Aled athemat, ehan, and Engneerng Vol. 8, Iue I, arh, 2 AHEAICAL ODELING OF A CNC ACHINE RUCURE WIH 3+2 AXI Andre KOZUK, Petru BERCE Abtrat:
More informationCOXREG. Estimation (1)
COXREG Cox (972) frst suggested the modes n whch factors reated to fetme have a mutpcatve effect on the hazard functon. These modes are caed proportona hazards (PH) modes. Under the proportona hazards
More informationSegmentation Method of MRI Using Fuzzy Gaussian Basis Neural Network
Neural Informaton Processng - Letters and Revews Vol.8, No., August 005 LETTER Segmentaton Method of MRI Usng Fuzzy Gaussan Bass Neural Networ We Sun College of Electrcal and Informaton Engneerng, Hunan
More informationA new algorithm for multiplying two Dirac numbers
new algorthm for multlyng two Dra numers leksanr Carow Galna Carowa Faulty of Comuter enes an Informaton Tehnologes Żołnerska - zzen Polan {atarov gtarova}@wzuteul tel strat In ths work a ratonalze algorthm
More informationExample: Suppose we want to build a classifier that recognizes WebPages of graduate students.
Exampe: Suppose we want to bud a cassfer that recognzes WebPages of graduate students. How can we fnd tranng data? We can browse the web and coect a sampe of WebPages of graduate students of varous unverstes.
More informationDiscriminative Estimation (Maxent models and perceptron)
srmnatve Estmaton Maxent moels an pereptron Generatve vs. srmnatve moels Many sles are aapte rom sles by hrstopher Mannng Introuton So ar we ve looke at generatve moels Nave Bayes But there s now muh use
More informationJointly optimized rate-compatible UEP-LDPC codes for half-duplex co-operative relay networks
Khattak an Sanberg EURASIP Journal on Wreless Communatons an Networkng 2014, 2014:22 http://wn.euraspournals.om/ontent/2014/1/22 RESEARCH Open Aess Jontly optmze rate-ompatble UEP-LDPC oes for half-uplex
More informationInternational Conference on Electromechanical Control Technology and Transportation (ICECTT 2015)
Internatona Conferene on Eetroehana Contro Tehnoogy and Tranportaton (ICECTT ) Mode Anay of Car Fve Degree of Freedo Vbraton Syte Baed on Energy Deoupng Method XU Boa BAO Jadngb* WU Janwe4 WANG Hanhao
More informationRipple Design of LT Codes for AWGN Channel
Re Desgn of T Coes for AWGN Channe Jeser H. Sørensen, Toshak Koke-Akno, Ph Ork, Jan Østergaar, an Petar Poovsk Aaborg Unversty, Deartment of Eectronc Systems, Frerk Bajers Vej 7, 9 Aaborg, Denmark Mtsubsh
More informationExact Inference: Introduction. Exact Inference: Introduction. Exact Inference: Introduction. Exact Inference: Introduction.
Exat nferene: ntroduton Exat nferene: ntroduton Usng a ayesan network to ompute probabltes s alled nferene n general nferene nvolves queres of the form: E=e E = The evdene varables = The query varables
More informationChapter 7 Clustering Analysis (1)
Chater 7 Clusterng Analyss () Outlne Cluster Analyss Parttonng Clusterng Herarchcal Clusterng Large Sze Data Clusterng What s Cluster Analyss? Cluster: A collecton of ata obects smlar (or relate) to one
More informationLecture-7. Homework (Due 2/13/03)
Leture-7 Ste Length Seleton Homewor Due /3/3 3. 3. 3.5 3.6 3.7 3.9 3. Show equaton 3.44 he last ste n the roo o heorem 3.6. see sldes Show that >.5, the lne searh would exlude the mnmzer o a quadrat, and
More informationDesign of Recursive Digital Filters IIR
Degn of Recurve Dgtal Flter IIR The outut from a recurve dgtal flter deend on one or more revou outut value, a well a on nut t nvolve feedbac. A recurve flter ha an nfnte mule reone (IIR). The mulve reone
More informationA Multiple Evolutionary Neural Network Classifier Based on Niche Genetic Algorithm *
Fourth Internatonal Conference on atural Comutaton A ultle Evolutonar eural etwork Classfer Based on che Genetc Algorthm * Jang Wu, hange Tang, Taong L,, Yue Jang, Shangu Ye, Xun Ln,, Je Zuo School of
More informationCOMPLEX COEFFICIENT OF COMPLEXITY FOR GAME-TREE STRUCTURES IN DISCRETE OPTIMIZATION OF A GEAR PUMP HAVING TEETH UNDERCUTTING
COMPLEX COEFFICIENT OF COMPLEXITY FOR GAME-TREE STRUCTURES IN DISCRETE OPTIMIZATION OF A GEAR PUMP HAVING TEETH UNDERCUTTING Adam DEPTUŁA, Maran A. PARTYA Abstrat: A gear um otmzaton requres alulatng olumetr,
More informationA solution to the Curse of Dimensionality Problem in Pairwise Scoring Techniques
A soluton to the Curse of Dmensonalty Problem n Parwse orng Tehnques Man Wa MAK Dept. of Eletron and Informaton Engneerng The Hong Kong Polytehn Unversty un Yuan KUNG Dept. of Eletral Engneerng Prneton
More informationInternational Journal "Information Theories & Applications" Vol.13
290 Concuson Wthn the framework of the Bayesan earnng theory, we anayze a cassfer generazaton abty for the recognton on fnte set of events. It was shown that the obtane resuts can be appe for cassfcaton
More informationVIII. Addition of Angular Momenta
VIII Addition of Anguar Momenta a Couped and Uncouped Bae When deaing with two different ource of anguar momentum, Ĵ and Ĵ, there are two obviou bae that one might chooe to work in The firt i caed the
More informationFigure 1 Siemens PSSE Web Site
Stability Analyi of Dynamic Sytem. In the lat few lecture we have een how mall ignal Lalace domain model may be contructed of the dynamic erformance of ower ytem. The tability of uch ytem i a matter of
More informationChapter 6 Hidden Markov Models. Chaochun Wei Spring 2018
896 920 987 2006 Chapter 6 Hdden Markov Modes Chaochun We Sprng 208 Contents Readng materas Introducton to Hdden Markov Mode Markov chans Hdden Markov Modes Parameter estmaton for HMMs 2 Readng Rabner,
More informationComparison of BPA and LMA methods for Takagi - Sugeno type MIMO Neuro-Fuzzy Network to forecast Electrical Load Time Series
Comarson of BPA and LA methods for akag - Sugeno tye IO euro-fuzzy etwork to forecast Eectrca Load me Seres [Fex Pasa] Comarson of BPA and LA methods for akag - Sugeno tye IO euro-fuzzy etwork to forecast
More informationCh. 3: Forward and Inverse Kinematics
Ch. : Fowa an Invee Knemat Reap: The Denavt-Hatenbeg (DH) Conventon Repeentng eah nvual homogeneou tanfomaton a the pout of fou ba tanfomaton: pout of fou ba tanfomaton: x a x z z a a a Rot Tan Tan Rot
More informationController Design for Networked Control Systems in Multiple-packet Transmission with Random Delays
Appled Mehans and Materals Onlne: 03-0- ISSN: 66-748, Vols. 78-80, pp 60-604 do:0.408/www.sentf.net/amm.78-80.60 03 rans eh Publatons, Swtzerland H Controller Desgn for Networed Control Systems n Multple-paet
More informationNEAR NET SHAPE FORGING USING THE BACKWARD DEFORMATION METHOD
VII Internatonal Conference on Computatonal Platcty COMPLAS 2003 E. Oñate an D. R. J. Owen (E) CIMNE, Barcelona, 2003 NEAR NET SHAPE FORGING USING THE BACKWARD DEFORMATION METHOD Bglar F. R. *, Abrna K.
More informationNumerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes
Numerca Investgaton of Power Tunabty n Two-Secton QD Superumnescent Dodes Matta Rossett Paoo Bardea Ivo Montrosset POLITECNICO DI TORINO DELEN Summary 1. A smpfed mode for QD Super Lumnescent Dodes (SLD)
More informationModel Reference Adaptive Temperature Control of the Electromagnetic Oven Process in Manufacturing Process
RECENT ADVANCES n SIGNAL PROCESSING, ROBOTICS and AUTOMATION Model Reference Adatve Temerature Control of the Electromagnetc Oven Process n Manufacturng Process JIRAPHON SRISERTPOL SUPOT PHUNGPHIMAI School
More information2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period
-Adc Comlexty of a Seuence Obtaned from a Perodc Bnary Seuence by Ether Insertng or Deletng Symbols wthn One Perod ZHAO Lu, WEN Qao-yan (State Key Laboratory of Networng and Swtchng echnology, Bejng Unversty
More informationMachine Learning: and 15781, 2003 Assignment 4
ahne Learnng: 070 and 578, 003 Assgnment 4. VC Dmenson 30 onts Consder the spae of nstane X orrespondng to all ponts n the D x, plane. Gve the VC dmenson of the followng hpothess spaes. No explanaton requred.
More informationA Developed Method of Tuning PID Controllers with Fuzzy Rules for Integrating Processes
A Develope Metho of Tunng PID Controllers wth Fuzzy Rules for Integratng Proesses Janmng Zhang, Nng Wang an Shuqng Wang Abstrat The proportonal ntegral ervatve (PID) ontrollers are wely apple n nustral
More informationStudy on Supplier Selection Based on the Collaborative Mechanism and Game Strategy *
Tehnology an Invetment, 212, 3, 225-229 http://x.o.org/1.4236/t.212.3431 Publhe Onlne November 212 (http://www.srp.org/journal/t) Stuy on Suppler Seleton Bae on the Collaboratve Mehanm an Game Strategy
More informationA Robust Hierarchical Approach To Multi-stage Task Allocation Under Uncertainty
Proceedngs of the 44th IEEE Conference on Decson and Contro, and the Euroean Contro Conference 5 Seve, San, December -5, 5 TuIB8.5 A Robust Herarchca Aroach To ut-stage Tas Aocaton Under Uncertanty Dongxu
More informationTHIS PAGE DECLASSIFIED IAW E
THS PAGE DECLASSFED AW E0 2958 BL K THS PAGE DECLASSFED AW E0 2958 THS PAGE DECLASSFED AW E0 2958 B L K THS PAGE DECLASSFED AW E0 2958 THS PAGE DECLASSFED AW EO 2958 THS PAGE DECLASSFED AW EO 2958 THS
More informationW. E. P. Würzburg Economic Papers. No. 70. Does the Service Argument Justify Resale Price Maintenance? Norbert Schulz
W. E. P. Würzburg Eonom Paer No. 70 oe the Serve Argument Jutfy Reae Pre Mantenane? Norbert Shuz Unvertät Würzburg Lehrtuh VWL 3 Sanerrng, -97070 Würzburg Norbert.Shuz@ma.un-uerzburg.e Pota Are Norbert
More informationE-Companion: Mathematical Proofs
E-omnon: Mthemtcl Poo Poo o emm : Pt DS Sytem y denton o t ey to vey tht t ncee n wth d ncee n We dene } ] : [ { M whee / We let the ttegy et o ech etle n DS e ]} [ ] [ : { M w whee M lge otve nume oth
More informationOptimal Design of Multi-loop PI Controllers for Enhanced Disturbance Rejection in Multivariable Processes
Proeedng of the 3rd WSEAS/IASME Internatonal Conferene on Dynamal Sytem and Control, Arahon, Frane, Otober 3-5, 2007 72 Optmal Degn of Mult-loop PI Controller for Enhaned Dturbane Rejeton n Multvarable
More informationMechanical Systems Part B: Digital Control Lecture BL4
BL4: 436-433 Mechancal Systems Part B: Dgtal Control Lecture BL4 Interretaton of Inverson of -transform tme resonse Soluton of fference equatons Desgn y emulaton Dscrete PID controllers Interretaton of
More informationController Design of Nonlinear TITO Systems with Uncertain Delays via Neural Networks and Error Entropy Minimization
Controer Desgn of Nonnear TITO Systes wth Uncertan Deays va Neura Networs Error Entroy Mnzaton J. H. Zhang A. P. Wang* H. Wang** Deartent of Autoaton North Chna Eectrc Power Unversty Bejng 6 P. R. Chna
More informationa new crytoytem baed on the dea of Shmuley and roved t rovably ecure baed on ntractablty of factorng [Mc88] After that n 999 El Bham, Dan Boneh and Om
Weak Comote Dffe-Hellman not Weaker than Factorng Koohar Azman, azman@ceharfedu Javad Mohajer mohajer@harfedu Mahmoud Salmazadeh alma@harfedu Electronc Reearch Centre, Sharf Unverty of Technology Deartment
More informationInstance-Based Learning and Clustering
Instane-Based Learnng and Clusterng R&N 04, a bt of 03 Dfferent knds of Indutve Learnng Supervsed learnng Bas dea: Learn an approxmaton for a funton y=f(x based on labelled examples { (x,y, (x,y,, (x n,y
More informationMultisensor Particle Filter Cloud Fusion for Multitarget Tracking
utenor Partce Fter Coud Fuon for uttarget Trackng Dane Danu, Tha Krubaraan Deartment of Eectrca and Comuter Engneerng cater Unverty, Hamton, Canada danudg@unvma.c.mcmater.ca kruba@mcmater.ca Abtract Wthn
More informationNonlinear Robust Regression Using Kernel Principal Component Analysis and R-Estimators
IJCSI Internatona Journa of Comuter Scence Issues, Vo. 8, Issue 5, o, Setember 0 ISS (Onne: 694-084 www.ijcsi.org 75 onnear Robust Regresson Usng Kerne rnca Comonent Anayss and R-Estmators Anton Wbowo
More informationAli Karimpour Associate Professor Ferdowsi University of Mashhad
LINEAR CONTROL SYSTEMS Ali Karimour Aoiate Profeor Ferdowi Univerity of Mahhad Leture 0 Leture 0 Frequeny domain hart Toi to be overed inlude: Relative tability meaure for minimum hae ytem. ain margin.
More informationImprovements on Waring s Problem
Imrovement on Warng Problem L An-Png Bejng 85, PR Chna al@nacom Abtract By a new recurve algorthm for the auxlary equaton, n th aer, we wll gve ome mrovement for Warng roblem Keyword: Warng Problem, Hardy-Lttlewood
More informationAlgorithms for factoring
CSA E0 235: Crytograhy Arl 9,2015 Instructor: Arta Patra Algorthms for factorng Submtted by: Jay Oza, Nranjan Sngh Introducton Factorsaton of large ntegers has been a wdely studed toc manly because of
More informationDistance-Based Approaches to Inferring Phylogenetic Trees
Dstance-Base Approaches to Inferrng Phylogenetc Trees BMI/CS 576 www.bostat.wsc.eu/bm576.html Mark Craven craven@bostat.wsc.eu Fall 0 Representng stances n roote an unroote trees st(a,c) = 8 st(a,d) =
More informationF í s. i c HARMONIC MOTION. A p l. i c a U C L M
HRONI OTION 070311 1 Hooke w hrterzton of Sme Hrmon oton (SH) Veoty n eerton n hrmon moton. Exeme. Horzont n vert rng Sme enuum Phy enuum Energy n hrmon moton Dme hrmon moton Hooke w Srng ontnt The fore
More informationA Technique for Relating Vehicle Structural Modes to Stiffness as Determined in Static Determinate Tests
00-0-76 A Tehnque for Relatng Vehle Strutural Moe to Stffne a Determne n Stat Determnate Tet Copyrght 00 Soety of Automotve Engneer, In. Dav Grffth, Allan Aubert, Ewar R. Green, an Jm Dng Rouh Inutre ABSTRACT
More informationAnalysis of Block OMP using Block RIP
Anayss of ock OMP usng ock RIP Jun Wang, Gang L, Hao Zhang, Xqn Wang Department of Eectronc Engneerng, snghua Unversty, eng 00084, Chna Emas: un-wang05@mas.tsnghua.eu.cn, {gang, haozhang, wangq_ee}@tsnghua.eu.cn
More informatione a = 12.4 i a = 13.5i h a = xi + yj 3 a Let r a = 25cos(20) i + 25sin(20) j b = 15cos(55) i + 15sin(55) j
Vetors MC Qld-3 49 Chapter 3 Vetors Exerse 3A Revew of vetors a d e f e a x + y omponent: x a os(θ 6 os(80 + 39 6 os(9.4 omponent: y a sn(θ 6 sn(9 0. a.4 0. f a x + y omponent: x a os(θ 5 os( 5 3.6 omponent:
More informationLecture 9-3/8/10-14 Spatial Description and Transformation
Letue 9-8- tl Deton nd nfomton Homewo No. Due 9. Fme ngement onl. Do not lulte...8..7.8 Otonl et edt hot oof tht = - Homewo No. egned due 9 tud eton.-.. olve oblem:.....7.8. ee lde 6 7. e Mtlb on. f oble.
More informationLarge-Scale Data-Dependent Kernel Approximation Appendix
Large-Scale Data-Depenent Kernel Approxmaton Appenx Ths appenx presents the atonal etal an proofs assocate wth the man paper [1]. 1 Introucton Let k : R p R p R be a postve efnte translaton nvarant functon
More informationResearch on dynamic adjustment of cooperation in price duopoly game
3rd Internatonal Conferene on Mehatrons and Informaton Tehnology (ICMIT 06 Researh on dynam adjustment of ooeraton n re duooly game Gung ShaDehang XabYujng gao3bentu L4dDehua Wang5e 345 Shandong Voatonal
More informationAnalytical calculation of adiabatic processes in real gases
Journal of Physs: Conferene Seres PAPER OPEN ACCESS Analytal alulaton of adabat roesses n real gases o te ths artle: I B Amarskaja et al 016 J. Phys.: Conf. Ser. 754 11003 Related ontent - Shortuts to
More informationCyclic Codes BCH Codes
Cycc Codes BCH Codes Gaos Feds GF m A Gaos fed of m eements can be obtaned usng the symbos 0,, á, and the eements beng 0,, á, á, á 3 m,... so that fed F* s cosed under mutpcaton wth m eements. The operator
More informationVAAL UNIVERSITY OF TECHNOLOGY FACULTY OF ENGINEERING
VAAL UNIVERSITY OF TECHNOLOGY FACULTY OF ENGINEERING DEPARTMENT: PROCESS CONTROL AND COMPUTER SYSTEMS BACCALAUREUS TECHNOLOGIAE: ENGINEERING ELECTRICAL SUBJECT : CIRCUIT ANALYSIS IV EICAM4A ASSESSMENT
More informationSemi-microscopic level densities. Roberto Capote, IAEA/NDS, Vienna, Austria Alberto Ventura, ENEA and INFN, Bologna, Italy
Sem-mrosop eve enstes Roberto Capote IAA/DS Venna Austra Aberto Ventura A an IF Boogna Itay RCODD IPUT PARATR LIBRARY etron Starter Fe (known as Reerene Input Parameter Lbrary-1) was eveope an mae avaabe
More informationtwenty one concrete construction: shear & deflection Shear in Concrete Beams ACI Shear Values ACI Shear Values
ARCHIECURA SRUCURES: FORM, BEHAVIOR, AND DESIGN DR. ANNE NICHOS SUMMER 07 leture twenty one Shear n Conrete Beam lexure ombne wth hear to orm agonal rak horzontal renorement oen t help trrup = vertal renorement
More information