Formulating Cyber-Security as Convex Optimization Problems Æ

Size: px
Start display at page:

Download "Formulating Cyber-Security as Convex Optimization Problems Æ"

Transcription

1 Formulaing Cyber-Securiy a Convex Opimizaion Problem Æ Kyriako G. Vamvoudaki,João P. Hepanha, Richard A. Kemmerer 2, and Giovanni Vigna 2 Cener for Conrol, Dynamical-yem and Compuaion (CCDC), Univeriy of California, Sana Barbara, CA USA 2 Compuer Securiy Lab, Univeriy of California, Sana Barbara, CA USA {kyriako,hepanha}@ece.ucb.edu, {kemm,vigna}@c.ucb.edu Abrac. Miion-cenric cyber-ecuriy analy require a complee overview and underanding of he ae of a miion and any poenial hrea o heir compleion. To faciliae hi, we propoe opimizaionbaed algorihm ha can be ued o predic in real-ime how an aacker may ry o compromie a cyber-miion wih a limied amoun of reource, baed on a model ha ake ino accoun poenial damage o he miion and probabiliic uncerainy. Two differen opimizaion cheme are conidered: one where all he miion daa i known a priori o he aacker and anoher where yem idenificaion and a moving horizon opimizaion i ued o produce he eimae baed on hiorical daa. Our cheme are compared wih real aack carried our by human player in he 20 inernaional Capure The Flag (ictf) hacking compeiion. Keyword: Cyber-Securiy, Convex Opimizaion, Syem Idenificaion, ictf. Inroducion Guaraneeing he ecuriy of cyber-miion i a complex, muli-dimenional challenge ha demand a muli-faceed, raegic oluion. The erminology cyber-miion refer o a e of compuer ranacion aimed a accomplihing a pecific purpoe or ak, uch a placing an online hopping order, ubmiing a paper o a conference hrough an online ubmiion yem, or prining a bank aemen a an ATM machine. Cyber-miion ypically require a large number of compuer ervice, including encrypion ervice, auhenicaion erver, daabae engine, web erver. We are epecially inereed in cyber-miion Æ Thi maerial i baed upon work uppored by ARO MURI Gran number W9NF D.C. Tarraf (ed.), Conrol of Cyber-Phyical Syem, 85 Lecure Noe in Conrol and Informaion Science 449, DOI: 0.007/ _5, c Springer Inernaional Publihing Swizerland 203

2 86 K.G. Vamvoudaki e al. ha go hrough everal ae, each of which may require one or more compuer ervice. Cyber-miion are epecially vulnerable o aack becaue i may be poible o preven he miion compleion by compromiing ju one of he muliple ervice required by he miion, provided ha he righ ervice i compromied a he righ ime. Cyber-miion are pervaive and can be found in rading, banking, power yem managemen, road raffic managemen, healhcare, online hopping, buine-o-buine ranacion, ec. The dirupion o cyber-miion can hu reul in cyber or phyical conequence ha hreaen Naional and economic ecuriy, criical infrarucure, public healh, and welfare. Moreover, ealhy cyber-aacker can lay a hidden foundaion for fuure exploiaion or aack, which hey can laer execue a a ime of greaeadvanage. Securing cyberpace require a layered ecuriy approach acro he public and privae ecor. In he cyber-miion ecuriy domain, he ecuriy analy i inereed in making deciion baed on he poenial damage ha aack can inflic o he miion and alo on he probabiliy ha he poenial damage i realized. To focu heir aenion and coordinae defenive acion, ecuriy profeional mu be able o deermine which aack preen he bigge hrea and prioriize which ervice o defend, a problem ofen referred o a cyber iuaion awarene. Siuaion awarene [3] i a common feaure of many cyber-ecuriy oluion bu mo of hem are fragmened. In hi paper, we preen a model ha can be ued o predic how an aacker may ry o compromie a cyber-miion wih a limied amoun of reource, baed on a model ha ake ino accoun poenial damage o he miion and probabiliic uncerainy. Thi approach followed here moivaed by he need o avoid flooding he ecuriy analy wih raw daa abou complex miion and deailed log from inruion deecion yem (IDS). Inead, an auomaed or emi-auomaed yem hould proce hi daa and preen he analy wih high-level informaion abou he compuer ervice ha are currenly mo crucial for miion compleion and hu mo likely o be he arge of aack, baed on he curren ae of he miion and i fuure expeced evoluion. To achieve hi we propoe a relaively general model o decribe he damage o a cyber-miion caued by poenial aack. Thi model can be uilized in opimizaion cheme o dicover opimal policie o diribue aack reource over ime and over he differen compuer ervice relevan o he miion o a o maximize damage o he cyber miion. The model propoed, need miion parameer ha ypically vary wih ime according o complex dynamic, which are difficul o deermine in an analyic fahion. To avoid hi difficuly, we learn uch parameer uing yem idenificaion of low-order ae-pace model ha are ued o make predicion of he parameer evoluion for a reaonable fuure ime horizon. Securiy compeiion are excepional venue for reearcher o dicover and validae novel ecuriy oluion. The inernaional Capure The Flag (ictf) [5] i a diribued wide-area ecuriy exercie whoe goal i o e he ecuriy kill of he paricipan. The ictf cone i organized by he Securiy Lab of he Deparmen of Compuer Science a UCSB and i held once a year. The Capure

3 Formulaing Cyber-Securiy a Convex Opimizaion Problem 87 he Flag cone i a muli-ie, muli-eam hacking cone in which a number of eam compee independenly again each oher. The 20 ediion of ictf wa aimed a Cyber-Siuaion Awarene and, o our knowledge, produced he fir experimenal daae ha include miion decripion a well a aack log and he aue of compuer ervice required by miion [2,5]. We have ued hi daa o validae he algorihm preened in hi paper and how heir efficacy in predicing aack o cyber miion by he human paricipan in he exercie. The reul preened in hi paper were alo ued in he deign of a highlevel viualizaion ool o help ecuriy analy o proec he compuer yem under aack in he 20 ictf compeiion [4]. We are in he proce of developing human ubjec experimen o demonrae he benefi of uing he predicion generaed by he mehodology propoed in hi paper, inead of earching hrough miion race and ecuriy log. The remainder of he paper i rucured a follow. Secion 2 develop he general mahemaical framework for cyber-ecuriy and hen decribe how one can ue claical yem idenificaion echnique o idenify he compleely unknown or parially known ime-varying procee. Secion 3 decribe an opimizaion problem o dicover how an aacker would opimally allocae her reource hrough all he ervice a ime evolve for wo differen cenario. The fir aume ha he all he miion daa i known o he aacker, wherea he econd one ue a moving horizon opimizaion cheme ha eimae hi daa online o predic when and where o aack. In Secion 4, he algorihm propoed are applied o daa from he 20 ictf compeiion. Comparion reul beween how he eam in he compeiion aacked and he reul obained by he opimizaion cheme are preened in Secion 5. Finally, Secion refe:concluion conclude and dicue abou fuure work. 2 General Framework for Cyber-Securiy Our goal i o capure complex behavior wih a relaively imple model and incorporae ha in a cyber-ecuriy adviory yem o how i effecivene. Thi ecion preen a general framework o model miion-criical cyber-ecuriy cenario. 2. Cyber-Miion Damage Model Suppoe ha he (poenial) damage ha an aacker can inflic o a cyber miion i quanified by a calar x PD 0 ha i a funcion of he level of aack reource 0 devoed o he aack. The mapping from aack reource o poenial damage i expreed by he o called poenial damage equaion ha we approximae by a linear map: x PD fô Õ a b, ()

4 88 K.G. Vamvoudaki e al. where a È IR can be viewed a he zero-reource damage level (damage achieved wihou an inended aack), and b È IR he marginal damage per uni of aack reource. Wheher or no he poenial damage o he miion x PD i realized i aumed o be a ochaic even ha occur wih a given probabiliy ρ È Ö0, ha alo depend on he aack reource È IR, according o he o-called uncerainy equaion ha we approximae by a linear map projeced o he inerval Ö0, : ρ gô Õ Π Ö0, Ôc d Õ (2) where Π Ö0, :IR IR denoe he projecion funcion ³² 0 x 0 Π Ö0, ÔxÕ x x ÈÖ0, ³± x, he calar c 0 correpond o a zero-reource probabiliy of damage, and he calar d 0ohemarginaldecreae in he probabiliy of damage per uni of aack reource. We noe ha an increae in aack reource lead o an increae in he poenial damage x PD [expreed by he ign before he b erm in ()], bu may acually decreae he probabiliy ha he poenial damage will acually be realized [expreed by he ign before he d erm in (2)], which i moivaed by he fac ha a large-cale aack i more likely o rigger defene mechanim ha can preven he poenial damage from being realized. The oal expeced damage y TD o he miion can be found by muliplying equaion () and (2), leading o he expeced damage equaion y TD fô ÕgÔ Õ. (3) In he conex of cyber-miion ha evolve over ime and require muliple compuer ervice, he poenial damage equaion () and he uncerainy equaion (2) need o be augmened wih an index È Ø, 2,...,TÙ ha parameerize miion ime and an index È Ø, 2,..., SÙ ha parameerize he required compuer ervice, a in x PD f Ô Õa b, (4) ρ g Ô ÕΠ Ö0, Ôc d Õ (5) where denoe he aack reource commied o aack ervice a ime, x PD he poenial damage a ime due o an aack o he ervice, and P he probabiliy of realizing hi damage. The correponding expeced damage equaion hen become: y TD f Ô Õg Ô Õ. (6)

5 3 Opimizaion Formulaing Cyber-Securiy a Convex Opimizaion Problem 89 An inelligen aacker would eek o opimally allocae her available reource o maximize he oal expeced miing damage. We hall conider here everal opion for hi opimizaion ha differ on he informaion ha i available o he aacker. 3. Opimizaion Scheme wih Known Miion Damage Daa When all he daa Øa,b,c,d :, Ù ha define he poenial damage and uncerainy equaion i known a-priori, opimal aack reource allocaion can be deermined by olving he following opimizaion. maximize f Ô Õg Ô Õ ubjec o w.r.. U TR ÈÖ0, Õ,,, where U TR denoe he oal budge of aack reource available o he aacker. A aed in he following propoiion, hi opimizaion can be convered ino he following concave maximizaion. Propoiion. When he funcion f,g are of he form (4) (5) wih a,b,c, d 0,,. The value and opimum of (7) can be obained hrough he following concave maximizaion problem: maximize Ôa b ÕÔc d σ Õ ubjec o w.r.. È U TR, 0, c d,σ 0,,. c d σ,, When c È Ö0,, one can e he correponding opimizaion variable σ 0 in (8). Moreover, when c ÈÖ0,,, and all he conrain on he are inacive, he oluion o hi opimizaion can be found in cloed form and i equal o ū µ max 0, ô µ ū U TR, ū b c a d 2b d, µ 2b d S (7) (8) 2b d. Noe ha, if any of he conrain on he aack reource are acive, a cloedform oluion may no be eay and one ha o olve he opimizaion problem (8) inead.

6 90 K.G. Vamvoudaki e al. Proof. To prove ha (7) and (8) are equivalen, we ar by noing ha 0 c ³² d 0 c d g Ô Õ c ³± d c d c d c È. d, c d Suppoe, by conradicion, ha (8) could lead o a larger maximum han (7). The condiion È 0, c d guaranee ha he ame e of u AR aify he conrain of (7) and ha c g Ô Õ d c d c d c d c d and he condiion c d σ guaranee ha c d σ g Ô Õ c d c d σ g Ô Õ σ g Ô Õ c d, which how ha c d σ g Ô Õ and herefore (8) canno lead o a larger maximum han (7). Suppoe now, alo by conradicion, ha (7) could lead o a larger maximum han (8). Fir noe ha if a few of he ha maximize (7) were larger han c d, for hoe we would have g Ô Õ0 and he ame exac co could be obained for (7) by replacing each of hee wih c d. So we may aume, wihou lo of generaliy, ha all he are maller han or equal o c d In hi cae, we could ue he ame in (8) and e σ 0 c d c d c d.. Thi elecion of σ would aify he conrain of (8) and guaranee ha g Ô Õc d σ, and herefore (7) and (8) would lead o he ame maximum. Thi complee he proof ha (7) and (8) are equivalen. The opimizaion cheme ju defined i a concave maximizaion problem (convex minimizaion) wih linear conrain. The dual problem i given by,

7 Formulaing Cyber-Securiy a Convex Opimizaion Problem 9 J Ã max max Ôa λ 0,η 0,ζ 0 u AR ÈIR λ ζ UTR max max λ 0,η 0,ζ 0 u AR ÈIR λ η uar ζ uar max max λ 0,η 0,ζ 0 u AR ÈIR λ U TR c η d. η b uar ÕÔc d uar Õ c d a c a d λ U TR a c b d uar 2 c η d b c b d Ôb c a d 2 ζ η λõuar The inner maximizaion can be olved uing andard calculu and i achieved for yielding J Ã max λ 0,η 0,ζ 0 b c a d ζ η λ 2b, d Ôb c a d ζ η λ Õ 2 4b d η c d For hi problem he Karuh-Kuhn-Tucker (KKT) condiion [] lead o J Ã λ 0 λ T S b c a d ζ η 2b d T S 2b d J Ã η J Ã ζ Le u aume ha i inide he inerval he η and ζ U TR λ U TR. or λ 0 0 η ζ a d b c λ or η 0 0 ζ b c a d η λ or ζ 0. 0, c d equal o zero (inacive conrain) and herefore we would need, which would lead o all b c a d λ 2b d U TR λ or λ 0 T S b c a d 2b d T S 2b d U TR 0 (9)

8 92 K.G. Vamvoudaki e al. and ū µ max 0, ô µ ū U TR, ū b c a d 2b d, µ 2b d S 2b d We can view he erm being ubraced from a a normalizing erm ha make ure ha he addupoheconrainu TR. Noe ha if he cloed-form formula hown above for ever become negaive, hen he correponding ζ will become acive and we mu have. J Ã ζ 0 ζ λ a d b c 0. Similarly if he formula for ever become larger han c d, hen he correponding η will become acive and we mu have J Ã η 0 η b c λ a d c d. Remark. Noe ha, if any of he conrain on he aack reource are acive, a cloed-form oluion i no poible and one ha o olve he opimizaion problem inead. Ð 3.2 Unknown Miion Damage Daa Ofen he miion-pecific parameer Øa,b,c,d :, Ù ha define he poenial damage and uncerainy equaion are no known a-priori and, inead, need o be eimaed online. The eimaion problem will be poed uing a grey-box model ha look like a k-ep ahead predicor. The problem i olved a each ime inan o incorporae he new informaion ha i obained in he form of a new meauremen of he proce variable. One approach ha can be ued o addre hi cenario i o aume ha hee parameer are generaed by linear dynamic of he form x a A ax a Baw, a Cax a, (0) x b A b x b B b w, b C b x b, () x c A cx c Bcw, c Cc x c, (2) x d A d x d B d w, d C d x d, (3) where he Øw,, Ù are equence of zero-mean random procee wih variance σ w. One can hen ue hiorical daa o eimae hee dynamic uing blackbox idenificaion echnique. Once eimae for he dynamic are available, one can ue online daa o predic fuure value for he miion-pecific parameer Øa,b,c,d :, Ù, baed on pa obervaion.

9 Formulaing Cyber-Securiy a Convex Opimizaion Problem 93 I i crucial ha he daa colleced from he yem convey coninual informaion on he parameer o be eimaed and he idenificaion algorihm can rely on freh informaion in forming reliable curren eimae (perience of exciaion). Suppoe ha a ome ime k T he aacker ha oberved he value of he pa miion-pecific parameer Øa,b,c,d :, kù and need o make deciion on he fuure aack reource, k. One can ue (0) (3) o conruc eimae Øâ, ˆb, ĉ, ˆd :, kù for he fuure miion-pecific parameer and obain he fuure, k uing he following opimizaion: maximize ubjec o kô f Ô Õg Ô Õ k ˆf Ô Õĝ Ô Õ (4) U TR (5) w.r.. ÈÖ0, Õ, ÈØk,..., T Ù,, (6) where f and g denoe he funcion defined in (4) and (5), repecively, wherea ˆf and ĝ are eimae of hee funcion compued uing he eimaed miionpecific parameer Øâ, ˆb, ĉ, ˆd :, kù. The opimizaion (4) can be olved a each ime ep k ÈØ, 2,...,T Ù, allowing he aacker o improve her allocaion of aack reource a new informaion abou he miing parameer become available. Noe ha one could remove from he (double) ummaion in (4) any erm ha do no depend on he opimizaion variable. 4 ictf Compeiion The inernaional Capure The Flag (ictf) i a diribued wide-area ecuriy exercie o e he ecuriy kill of he paricipan. Thi cone i organized by he Securiy Lab of he Deparmen of Compuer Science a UCSB and i ha been held yearly ince In radiional ediion of he ictf ( ), he goal of each eam wa o mainain a e of ervice uch ha hey remain available and uncompromied hroughou he cone. Each eam alo had o aemp o compromie he oher eam ervice. Since all he eam received an idenical copy of he virual ho conaining he vulnerable ervice, each eam had o find he vulnerabiliie in heir copy of he ho and poibly fix he vulnerabiliie wihou diruping he ervice. A he ame ime, he eam had o leverage heir knowledge abou he vulnerabiliie hey found o compromie he erver run by oher eam. Compromiing a ervice allowed a eam o bypa he ervice ecuriy mechanim and o capure he flag aociaed wih he ervice. During he ictf, new compeiion deign have been inroduced. More preciely, in 2008 a eparae virual nework wa creaed for each eam. The goal wa o aack a errori nework and defue a bomb

10 94 K.G. Vamvoudaki e al. afer compromiing a number of ho. In 2009, he paricipan had o compromie he brower of a large group of imulaed uer, eal heir money, and creae a bone. In 200, he paricipan had o aack he rogue naion Liya, ruled by he evil Livoy Bironulek. The eam goal wa o aack he ervice upporing Liya infrarucure only a pecific ime, when cerain aciviie were in progre. In addiion, an inruion deecion yem would emporarily firewall ou he eam whoe aack were deeced. The 20 ictf compeiion i briefly ummarized below from he perpecive of one eam playing again he re of he world. The 200 [2] and 20 [5] ictf compeiion were deigned cloely mach pracical cyber-ecuriy miion cenario ictf The 20 ictf wa cenered around he heme of illegal money laundering. Thi aciviy i modeled afer cyber-criminal money laundering operaion and provided a perfec eing for rik-reward analyi, a he rade-off are very inuiively underood. The general idea behind he compeiion wa he converion ( laundering ) of money ino poin. The money wa obained by he eam by olving ecuriyrelaed challenge (e.g., decryping an encryped meage, find hidden informaion in a documen, ec.) The converion of money ino poin wa performed by uilizing daa capured from an exploied ervice. Therefore, fir a eam had o obain money by olving challenge, and hen he money had o be ranlaed ino poin by exploiing he vulnerabiliy in a ervice of anoher eam. Succeful converion of money o poin depended on a number of facor, calculaed ogeher a he rik funcion, which i decribed in deail below. Noe ha, a he end of he game, he money had no conribuion o he final and of a eam: only poin maered. One challenge wih he formulaion one-again-world i ha in he 20 ictf game, winning wa no ju abou maximizing poin. Winning wa abou geing more poin han each of he opponen (individually). The game wa played in round 255 (each ake abou 2min), bu we only have daa for 248 round ince he logging erver wa emporarily down. Each eam ho a erver ha run 0 ervice each wih i own (unknown) vulnerabiliie. Each ervice È Ø, 2,...,0Ù of each hoing eam i characerized by hree ime-varying quaniie ÈØ, 2,...,248Ù: hecu C, which i he percenage of money ha goe o he eam when money i laundered hrough ervice (ame value for every eam), hepayoff P, which i he percenage of money ha will be ranformed ino poin for he eam ha launder he money (ame value for every eam); P T ickacive 0.9e 0 herik R, which i he probabiliy of loing all he money (inead of geing a converion o poin).

11 Formulaing Cyber-Securiy a Convex Opimizaion Problem 95 The generaion of he ime erie for he cu, payoff, and rik for he differen ervice wa baed on an underlying e of cyber miion ha were running while he game wa played. Eenially, when he ae of he cyber miion required a paricular ervice, he cu, payoff, and rik would make ha ervice aracive for aacker from he perpecive of convering money o poin. However, he player were no informed abou he ae of he cyber-miion and, inead, a he beginning of each round, he eam i informed of he value of C, P, R for every, and. 4.2 Acion Available o Every Team A eam (we) ha he following key acion in he acual compeiion:. Defenive acion: Acivae/deacivae one of i own ervice. In he ictf compeiion a eam could alo correc any vulnerabiliy ha i dicovered in i ervice. We aumed here ha all known vulnerabiliie had been correced. 2. Money laundering: Selec (a) eam o aack (mue deciion wihin he one-again-world formulaion); (b) ervice o compromie, which implicily deermine he payoff P,he rik R, and he cu C ; (c) amoun of money o launder a ime hrough he ervice. Thi acion reul in a number of poin given by X P Ô C ÕD w.p. minøρ, Ù 0 w.p. minøρ (7), Ù where D i he eam defene level and ρ i he probabiliy ha he converion of money o poin will ucceed, a given by he formula ρ R 30 N j N j 700 Q Q 500 where N j i he overall amoun of money ha ha been laundered by he eam j hrough he paricular eam being exploied and Q i he overall amoun of money ha ha been laundered by he eam hrough he paricular ervice being exploied. Becaue we do no model each eam individually we will conider he wor cae cenario for he following quaniie, N 492, Q 2257 (according o daa from he compeiion), and defene level of he eam a D. To map hi game wih he general framework decribed in Secion 2, we aociae he money o launder a ime hrough ervice wih he reource devoed o aack ervice a ime, and aociae he poin X in (7) wih damage o he miion.

12 96 K.G. Vamvoudaki e al. The oal aack reource U TR available o each eam in he general framework decribed in Secion 2, now correpond o he money available o each eam. While we could model more accuraely he proce by which eam ge money, for impliciy we aumed ha each eam had available a fixed amoun of money ($5060) ha could be pend hroughou he duraion of he game which i given by he average money of all he eam during he compeiion. The reul regarding which ervice where aacked and when proved o be relaively ineniive o hi parameer. 4.3 Opimizaion Scheme and ictf In hi ecion we apply he opimizaion cheme defined in Secion 3. and 3.2 o he ictf game. We are eeking o opimally allocae our available reource in he compeiion uch ha he oal number of poin i maximized while meeing he pecified conrain. The maximizaion of he expeced reward by a eam can be formulaed a follow where, maximize ubjec o w.r ô 0ô 248 0ô ô ρ P Ô C ÕD U TR 5060 ÈÖ0, Õ, ÈØ, 2,...,0Ù, ÈØ, 2,...,248Ù, R ρ minøôβ 30 Õ, Ù, β N 700 Q N Q 500 and he parameer P,C,D,β can eiher be conidered known or unknown. By uing Propoiion, and eing he conrain σ 0in(8)(inceÔ ÕÈÖ0, ), we can wrie he equivalen opimizaion problem a, β maximize ubjec o w.r ô 0ô 248 0ô ô È Ô β R 30 ÕP Ô C Õ U TR 0, β, ÈØ, 2,...,0Ù, ÈØ, 2,...,248Ù, R 30 which i a concave maximizaion problem wih linear conrain ha i eay o olve numerically a decribed in Secion 3.. The above opimizaion depend on he following aignmen, a 0, b P Ô C Õ, c β, d R 30. When hee are no known, one can eimae

13 Formulaing Cyber-Securiy a Convex Opimizaion Problem 97 b P Ô C Õ, c β, d R 30 uing a low order ae pace model given by ()-(3). By hen applying he opimizaion cheme decribed in Secion 3.2, wih a horizon of N 5, one can ill make accurae predicion of when and how o diribue he available aack reource. The opimizaion model ju decribed, reul in an opimizaion o obain he fuure, k and performed under a moving horizon of 5 ick, maximize ubjec o kô 0ô 248 0ô ô 248 ô b Ôc d Õ U TRk x b A b x a B b w ˆb C b x b 0ô k ˆb Ôĉ ˆd Õ x c A c x c B c w ĉ C c x c x d A d x d B d w w.r.. ˆd C d x d È 0, ĉ ˆd, ÈØk,...,248Ù, ÈØ, 2,...,0Ù. 5 ictf Reul Thi ecion preen numerical reul obained from he opimizaion decribed above o daa from he aack log of he 20 ictf compeiion. All he opimizaion have been implemened hrough a Malab-baed convex opimizaion olver uch a CVX []. The opimizaion cheme decribed in Secion 3.2 yielded very cloe reul o he cheme decribed in Secion 3. for a predicing horizon of N 5. Iniially we will aume ha a ophiicaed aacker would be able o compromie any one of he 0 ervice. Figure how he poin and he money colleced by uch an opimal aacker, wherea Figure 2 how he ame (aggregae) daa for he eam ha paricipaed in he compeiion. One can alo conider aacker wih differen level of ophiicaion, e.g., aacker ha are only able o find vulnerabiliie in a ube of he 0 ervice ha he ophiicaed wa able o aack. By oberving he daa of he op 20 eam in he compeiion we were able o pariion he ophiicaion in wo level. For comparion, we how he behavior of an aacker A ha wa only able o aack he ervice, 2, 4, 5, 6, 9 (imilar o he fir 0 eam in he compeiion); and anoher aacker B ha wa only able o aack ervice, 2, 5, 6, 7, 8 (imilar o he eam from place o 20 in he compeiion). The ophiicaed aacker wa able o gaher wih 987 poin, wherea he wo oher aacker were able o ge 82 and 72 poin, repecively.

14 98 K.G. Vamvoudaki e al. (a) poin earned (b) money laundered Fig.. Behavior of an opimal ophiicaed aacker able o aack all 0 ervice (a) poin earned (b) money laundered Fig. 2. Aggregae behavior of all eam ha paricipaed in he compeiion (a) poin earned (b) money laundered Fig. 3. Behavior of an opimal aacker A able o aack ervice,2,4,5,6,9 The reul in Figure (a) how ha he mo profiable ervice o aack were 5, 6 and 9. The op 0 eam in he compeiion aacked moly 5 and 6 becaue 9 wa a hard ervice o ge ino. Only he op 3 eam dicovered

15 Formulaing Cyber-Securiy a Convex Opimizaion Problem 99 (a) poin earned (b) money laundered Fig. 4. Behavior of an opimal aacker B able o aack ervice,2,5,6,7,8 (a) poin earned (b) money laundered Fig. 5. Behavior of he op 3 eam during he compeiion how o aack ervice 9 and only a he end of he game o hey had relaively lile ime o explore ha vulnerabiliy. Aide from hi, he predicion baed on he opimizaion framework developed here qualiaively reflec he acion of he good eam. In fac, he op wo eam in he compeiion followed aack raegie qualiaively cloe o ha of aacker A in Figure 3 a een in Figure 5. 6 Fuure Work Our fuure work in hi area i focued on developing analyi ool o explore wha-if cenario baed on pa daa and he rucure of he cyber-miion. To hi end, we are developing opimizaion cheme for he defender poible acion, uch a aking a ervice off-line when he ervice i no needed or exending he duraion of a ae ha would be unable o progre if a cerain ervice i compromied. We are alo developing human-compuer inerface o demonrae he ueful of hi ype of analyi for ecuriy analy.

16 00 K.G. Vamvoudaki e al. Moreover hi work can be exended o provide a mehod o analyze cyberecuriy apec of power yem ae eimaor where he aacker ha limied reource and an index i inroduced o enable he operaor o ee wha reource are he mo imporan o proec. Reference. Boyd, S., Vandenberghe, L.: Convex Opimizaion. Cambridge Univeriy Pre (2004) 2. Doupe, A., Egele, M., Cailla, B., Sringhini, G., Yakin, G., Zand, A., Cavedon, L., Vigna, G.: Hi em where i hur: A live ecuriy exercie on cyber iuaional awarene. In: Proceeding of he Annual Compuer Securiy Applicaion Conference (ACSAC 20), Orlando, FL (December 20) 3. Endley, M.: Theoreical Underpinning of Siuaion Awarene: A Criical Review, ch., pp L. Erlbaum Aoc. (2000) 4. Sockman, N., Vamvoudaki, K.G., Devendorf, L., Höllerer, T., Kemmerer, R., Hepanha, J.P.: A Miion-Cenric Viualizaion Tool for Cyberecuriy Siuaion Awarene. Technical Repor, Univeriy of California, Sana Barbara (Augu 202) 5. Vigna, G.: The 20 UCSB ictf: Decripion of he game (20), hp://icf.c.ucb.edu/

Formulating Cyber-Security as Convex Optimization Problems

Formulating Cyber-Security as Convex Optimization Problems Formulaing Cyber-Securiy a Convex Opimizaion Problem Kyriako G. Vamvoudaki, João P. Hepanha, Richard A. Kemmerer, and Giovanni Vigna Univeriy of California, Sana Barbara Abrac. Miion-cenric cyber-ecuriy

More information

2.4 Network flows. Many direct and indirect applications telecommunication transportation (public, freight, railway, air, ) logistics

2.4 Network flows. Many direct and indirect applications telecommunication transportation (public, freight, railway, air, ) logistics .4 Nework flow Problem involving he diribuion of a given produc (e.g., waer, ga, daa, ) from a e of producion locaion o a e of uer o a o opimize a given objecive funcion (e.g., amoun of produc, co,...).

More information

How To Solve An Uncerain Daa Problem

How To Solve An Uncerain Daa Problem Robu Bandwidh Allocaion Sraegie Oliver Heckmann, Jen Schmi, Ralf Seinmez Mulimedia Communicaion Lab (KOM), Darmad Univeriy of Technology Merckr. 25 D-64283 Darmad Germany {Heckmann, Schmi, Seinmez}@kom.u-darmad.de

More information

Fortified financial forecasting models: non-linear searching approaches

Fortified financial forecasting models: non-linear searching approaches 0 Inernaional Conference on Economic and inance Reearch IPEDR vol.4 (0 (0 IACSIT Pre, Singapore orified financial forecaing model: non-linear earching approache Mohammad R. Hamidizadeh, Ph.D. Profeor,

More information

Chapter 7. Response of First-Order RL and RC Circuits

Chapter 7. Response of First-Order RL and RC Circuits Chaper 7. esponse of Firs-Order L and C Circuis 7.1. The Naural esponse of an L Circui 7.2. The Naural esponse of an C Circui 7.3. The ep esponse of L and C Circuis 7.4. A General oluion for ep and Naural

More information

How Much Can Taxes Help Selfish Routing?

How Much Can Taxes Help Selfish Routing? How Much Can Taxe Help Selfih Rouing? Tim Roughgarden (Cornell) Join wih Richard Cole (NYU) and Yevgeniy Dodi (NYU) Selfih Rouing a direced graph G = (V,E) a ource and a deinaion one uni of raffic from

More information

Calculation of variable annuity market sensitivities using a pathwise methodology

Calculation of variable annuity market sensitivities using a pathwise methodology cuing edge Variable annuiie Calculaion of variable annuiy marke eniiviie uing a pahwie mehodology Under radiional finie difference mehod, he calculaion of variable annuiy eniiviie can involve muliple Mone

More information

Performance Center Overview. Performance Center Overview 1

Performance Center Overview. Performance Center Overview 1 Performance Cener Overview Performance Cener Overview 1 ODJFS Performance Cener ce Cener New Performance Cener Model Performance Cener Projec Meeings Performance Cener Execuive Meeings Performance Cener

More information

Mathematics in Pharmacokinetics What and Why (A second attempt to make it clearer)

Mathematics in Pharmacokinetics What and Why (A second attempt to make it clearer) Mahemaics in Pharmacokineics Wha and Why (A second aemp o make i clearer) We have used equaions for concenraion () as a funcion of ime (). We will coninue o use hese equaions since he plasma concenraions

More information

Optimal Path Routing in Single and Multiple Clock Domain Systems

Optimal Path Routing in Single and Multiple Clock Domain Systems IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN, TO APPEAR. 1 Opimal Pah Rouing in Single and Muliple Clock Domain Syem Soha Haoun, Senior Member, IEEE, Charle J. Alper, Senior Member, IEEE ) Abrac Shrinking

More information

Heat demand forecasting for concrete district heating system

Heat demand forecasting for concrete district heating system Hea demand forecaing for concree diric heaing yem Bronilav Chramcov Abrac Thi paper preen he reul of an inveigaion of a model for hor-erm hea demand forecaing. Foreca of hi hea demand coure i ignifican

More information

A Comparative Study of Linear and Nonlinear Models for Aggregate Retail Sales Forecasting

A Comparative Study of Linear and Nonlinear Models for Aggregate Retail Sales Forecasting A Comparaive Sudy of Linear and Nonlinear Model for Aggregae Reail Sale Forecaing G. Peer Zhang Deparmen of Managemen Georgia Sae Univeriy Alana GA 30066 (404) 651-4065 Abrac: The purpoe of hi paper i

More information

The Application of Multi Shifts and Break Windows in Employees Scheduling

The Application of Multi Shifts and Break Windows in Employees Scheduling The Applicaion of Muli Shifs and Brea Windows in Employees Scheduling Evy Herowai Indusrial Engineering Deparmen, Universiy of Surabaya, Indonesia Absrac. One mehod for increasing company s performance

More information

CHAPTER 11 NONPARAMETRIC REGRESSION WITH COMPLEX SURVEY DATA. R. L. Chambers Department of Social Statistics University of Southampton

CHAPTER 11 NONPARAMETRIC REGRESSION WITH COMPLEX SURVEY DATA. R. L. Chambers Department of Social Statistics University of Southampton CHAPTER 11 NONPARAMETRIC REGRESSION WITH COMPLEX SURVEY DATA R. L. Chamber Deparmen of Social Saiic Univeriy of Souhampon A.H. Dorfman Office of Survey Mehod Reearch Bureau of Labor Saiic M.Yu. Sverchkov

More information

Maintenance scheduling and process optimization under uncertainty

Maintenance scheduling and process optimization under uncertainty Compuers and Chemical Engineering 25 (2001) 217 236 www.elsevier.com/locae/compchemeng ainenance scheduling and process opimizaion under uncerainy C.G. Vassiliadis, E.N. Piikopoulos * Deparmen of Chemical

More information

How has globalisation affected inflation dynamics in the United Kingdom?

How has globalisation affected inflation dynamics in the United Kingdom? 292 Quarerly Bullein 2008 Q3 How ha globaliaion affeced inflaion dynamic in he Unied Kingdom? By Jennifer Greenlade and Sephen Millard of he Bank Srucural Economic Analyi Diviion and Chri Peacock of he

More information

Market Liquidity and the Impacts of the Computerized Trading System: Evidence from the Stock Exchange of Thailand

Market Liquidity and the Impacts of the Computerized Trading System: Evidence from the Stock Exchange of Thailand 36 Invesmen Managemen and Financial Innovaions, 4/4 Marke Liquidiy and he Impacs of he Compuerized Trading Sysem: Evidence from he Sock Exchange of Thailand Sorasar Sukcharoensin 1, Pariyada Srisopisawa,

More information

Chapter 13. Network Flow III Applications. 13.1 Edge disjoint paths. 13.1.1 Edge-disjoint paths in a directed graphs

Chapter 13. Network Flow III Applications. 13.1 Edge disjoint paths. 13.1.1 Edge-disjoint paths in a directed graphs Chaper 13 Nework Flow III Applicaion CS 573: Algorihm, Fall 014 Ocober 9, 014 13.1 Edge dijoin pah 13.1.1 Edge-dijoin pah in a direced graph 13.1.1.1 Edge dijoin pah queiong: graph (dir/undir)., : verice.

More information

Distributing Human Resources among Software Development Projects 1

Distributing Human Resources among Software Development Projects 1 Disribuing Human Resources among Sofware Developmen Proecs Macario Polo, María Dolores Maeos, Mario Piaini and rancisco Ruiz Summary This paper presens a mehod for esimaing he disribuion of human resources

More information

Appendix A: Area. 1 Find the radius of a circle that has circumference 12 inches.

Appendix A: Area. 1 Find the radius of a circle that has circumference 12 inches. Appendi A: Area worked-ou s o Odd-Numbered Eercises Do no read hese worked-ou s before aemping o do he eercises ourself. Oherwise ou ma mimic he echniques shown here wihou undersanding he ideas. Bes wa

More information

Niche Market or Mass Market?

Niche Market or Mass Market? Niche Marke or Mass Marke? Maxim Ivanov y McMaser Universiy July 2009 Absrac The de niion of a niche or a mass marke is based on he ranking of wo variables: he monopoly price and he produc mean value.

More information

PROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE

PROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE Profi Tes Modelling in Life Assurance Using Spreadshees PROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE Erik Alm Peer Millingon 2004 Profi Tes Modelling in Life Assurance Using Spreadshees

More information

TEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS

TEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS TEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS RICHARD J. POVINELLI AND XIN FENG Deparmen of Elecrical and Compuer Engineering Marquee Universiy, P.O.

More information

The Transport Equation

The Transport Equation The Transpor Equaion Consider a fluid, flowing wih velociy, V, in a hin sraigh ube whose cross secion will be denoed by A. Suppose he fluid conains a conaminan whose concenraion a posiion a ime will be

More information

Physical Topology Discovery for Large Multi-Subnet Networks

Physical Topology Discovery for Large Multi-Subnet Networks Phyical Topology Dicovery for Large Muli-Subne Nework Yigal Bejerano, Yuri Breibar, Mino Garofalaki, Rajeev Raogi Bell Lab, Lucen Technologie 600 Mounain Ave., Murray Hill, NJ 07974. {bej,mino,raogi}@reearch.bell-lab.com

More information

Making a Faster Cryptanalytic Time-Memory Trade-Off

Making a Faster Cryptanalytic Time-Memory Trade-Off Making a Faser Crypanalyic Time-Memory Trade-Off Philippe Oechslin Laboraoire de Securié e de Crypographie (LASEC) Ecole Polyechnique Fédérale de Lausanne Faculé I&C, 1015 Lausanne, Swizerland philippe.oechslin@epfl.ch

More information

cooking trajectory boiling water B (t) microwave 0 2 4 6 8 101214161820 time t (mins)

cooking trajectory boiling water B (t) microwave 0 2 4 6 8 101214161820 time t (mins) Alligaor egg wih calculus We have a large alligaor egg jus ou of he fridge (1 ) which we need o hea o 9. Now here are wo accepable mehods for heaing alligaor eggs, one is o immerse hem in boiling waer

More information

Acceleration Lab Teacher s Guide

Acceleration Lab Teacher s Guide Acceleraion Lab Teacher s Guide Objecives:. Use graphs of disance vs. ime and velociy vs. ime o find acceleraion of a oy car.. Observe he relaionship beween he angle of an inclined plane and he acceleraion

More information

New Evidence on Mutual Fund Performance: A Comparison of Alternative Bootstrap Methods. David Blake* Tristan Caulfield** Christos Ioannidis*** and

New Evidence on Mutual Fund Performance: A Comparison of Alternative Bootstrap Methods. David Blake* Tristan Caulfield** Christos Ioannidis*** and New Evidence on Muual Fund Performance: A Comparion of Alernaive Boorap Mehod David Blake* Trian Caulfield** Chrio Ioannidi*** and Ian Tonk**** June 2014 Abrac Thi paper compare he wo boorap mehod of Koowki

More information

AP Calculus AB 2013 Scoring Guidelines

AP Calculus AB 2013 Scoring Guidelines AP Calculus AB 1 Scoring Guidelines The College Board The College Board is a mission-driven no-for-profi organizaion ha connecs sudens o college success and opporuniy. Founded in 19, he College Board was

More information

Explore the Application of Financial Engineering in the Management of Exchange Rate Risk

Explore the Application of Financial Engineering in the Management of Exchange Rate Risk SHS Web o Conerence 17, 01006 (015) DOI: 10.1051/ hcon/01517 01006 C Owned by he auhor, publihed by EDP Science, 015 Explore he Applicaion o Financial Engineering in he Managemen o Exchange Rae Rik Liu

More information

Process Modeling for Object Oriented Analysis using BORM Object Behavioral Analysis.

Process Modeling for Object Oriented Analysis using BORM Object Behavioral Analysis. Proce Modeling for Objec Oriened Analyi uing BORM Objec Behavioral Analyi. Roger P. Kno Ph.D., Compuer Science Dep, Loughborough Univeriy, U.K. r.p.kno@lboro.ac.uk 9RMW FKMerunka Ph.D., Dep. of Informaion

More information

Duration and Convexity ( ) 20 = Bond B has a maturity of 5 years and also has a required rate of return of 10%. Its price is $613.

Duration and Convexity ( ) 20 = Bond B has a maturity of 5 years and also has a required rate of return of 10%. Its price is $613. Graduae School of Business Adminisraion Universiy of Virginia UVA-F-38 Duraion and Convexiy he price of a bond is a funcion of he promised paymens and he marke required rae of reurn. Since he promised

More information

Individual Health Insurance April 30, 2008 Pages 167-170

Individual Health Insurance April 30, 2008 Pages 167-170 Individual Healh Insurance April 30, 2008 Pages 167-170 We have received feedback ha his secion of he e is confusing because some of he defined noaion is inconsisen wih comparable life insurance reserve

More information

TSG-RAN Working Group 1 (Radio Layer 1) meeting #3 Nynashamn, Sweden 22 nd 26 th March 1999

TSG-RAN Working Group 1 (Radio Layer 1) meeting #3 Nynashamn, Sweden 22 nd 26 th March 1999 TSG-RAN Working Group 1 (Radio Layer 1) meeing #3 Nynashamn, Sweden 22 nd 26 h March 1999 RAN TSGW1#3(99)196 Agenda Iem: 9.1 Source: Tile: Documen for: Moorola Macro-diversiy for he PRACH Discussion/Decision

More information

Nanocubes for Real-Time Exploration of Spatiotemporal Datasets

Nanocubes for Real-Time Exploration of Spatiotemporal Datasets Nanocube for RealTime Exploraion of Spaioemporal Daae Lauro Lin, Jame T Kloowki, and arlo Scheidegger Fig 1 Example viualizaion of 210 million public geolocaed Twier po over he coure of a year The daa

More information

Policies & Procedures. I.D. Number: 1071

Policies & Procedures. I.D. Number: 1071 Policie & Procedure Tile: Licened Pracical Nure (LPN ) ADDED SKILLS (Aigned Funcion) Auhorizaion: [x] SHR Nuring Pracice Commiee I.D. Number: 1071 Source: Nuring Dae Revied: Sepember 2004 Dae Effecive:

More information

Chapter 6: Business Valuation (Income Approach)

Chapter 6: Business Valuation (Income Approach) Chaper 6: Business Valuaion (Income Approach) Cash flow deerminaion is one of he mos criical elemens o a business valuaion. Everyhing may be secondary. If cash flow is high, hen he value is high; if he

More information

Chapter 1.6 Financial Management

Chapter 1.6 Financial Management Chaper 1.6 Financial Managemen Par I: Objecive ype quesions and answers 1. Simple pay back period is equal o: a) Raio of Firs cos/ne yearly savings b) Raio of Annual gross cash flow/capial cos n c) = (1

More information

On the Connection Between Multiple-Unicast Network Coding and Single-Source Single-Sink Network Error Correction

On the Connection Between Multiple-Unicast Network Coding and Single-Source Single-Sink Network Error Correction On he Connecion Beween Muliple-Unica ework Coding and Single-Source Single-Sink ework Error Correcion Jörg Kliewer JIT Join work wih Wenao Huang and Michael Langberg ework Error Correcion Problem: Adverary

More information

Multi-resource Allocation Scheduling in Dynamic Environments

Multi-resource Allocation Scheduling in Dynamic Environments MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol. 00, No. 0, Xxxxx 0000, pp. 000 000 in 1523-4614 ein 1526-5498 00 0000 0001 INFORMS doi 10.1287/xxxx.0000.0000 c 0000 INFORMS Muli-reource Allocaion Scheduling

More information

Hedging with Forwards and Futures

Hedging with Forwards and Futures Hedging wih orwards and uures Hedging in mos cases is sraighforward. You plan o buy 10,000 barrels of oil in six monhs and you wish o eliminae he price risk. If you ake he buy-side of a forward/fuures

More information

Vector Autoregressions (VARs): Operational Perspectives

Vector Autoregressions (VARs): Operational Perspectives Vecor Auoregressions (VARs): Operaional Perspecives Primary Source: Sock, James H., and Mark W. Wason, Vecor Auoregressions, Journal of Economic Perspecives, Vol. 15 No. 4 (Fall 2001), 101-115. Macroeconomericians

More information

Single-machine Scheduling with Periodic Maintenance and both Preemptive and. Non-preemptive jobs in Remanufacturing System 1

Single-machine Scheduling with Periodic Maintenance and both Preemptive and. Non-preemptive jobs in Remanufacturing System 1 Absrac number: 05-0407 Single-machine Scheduling wih Periodic Mainenance and boh Preempive and Non-preempive jobs in Remanufacuring Sysem Liu Biyu hen Weida (School of Economics and Managemen Souheas Universiy

More information

Cross-sectional and longitudinal weighting in a rotational household panel: applications to EU-SILC. Vijay Verma, Gianni Betti, Giulio Ghellini

Cross-sectional and longitudinal weighting in a rotational household panel: applications to EU-SILC. Vijay Verma, Gianni Betti, Giulio Ghellini Cro-ecional and longiudinal eighing in a roaional houehold panel: applicaion o EU-SILC Viay Verma, Gianni Bei, Giulio Ghellini Working Paper n. 67, December 006 CROSS-SECTIONAL AND LONGITUDINAL WEIGHTING

More information

Empirical heuristics for improving Intermittent Demand Forecasting

Empirical heuristics for improving Intermittent Demand Forecasting Empirical heuriic for improving Inermien Demand Forecaing Foio Peropoulo 1,*, Konanino Nikolopoulo 2, Georgio P. Spihouraki 1, Vailio Aimakopoulo 1 1 Forecaing & Sraegy Uni, School of Elecrical and Compuer

More information

Longevity 11 Lyon 7-9 September 2015

Longevity 11 Lyon 7-9 September 2015 Longeviy 11 Lyon 7-9 Sepember 2015 RISK SHARING IN LIFE INSURANCE AND PENSIONS wihin and across generaions Ragnar Norberg ISFA Universié Lyon 1/London School of Economics Email: ragnar.norberg@univ-lyon1.fr

More information

Banking, Inside Money and Outside Money

Banking, Inside Money and Outside Money Banking, Inide Mone and Ouide Mone Hongfei Sun Deparmen of Economic Univeri of Torono (Job Marke Paper) Abrac Thi paper preen an inegraed heor of mone and banking. I addre he following queion: when boh

More information

CALCULATION OF OMX TALLINN

CALCULATION OF OMX TALLINN CALCULATION OF OMX TALLINN CALCULATION OF OMX TALLINN 1. OMX Tallinn index...3 2. Terms in use...3 3. Comuaion rules of OMX Tallinn...3 3.1. Oening, real-ime and closing value of he Index...3 3.2. Index

More information

OPTIMAL BATCH QUANTITY MODELS FOR A LEAN PRODUCTION SYSTEM WITH REWORK AND SCRAP. A Thesis

OPTIMAL BATCH QUANTITY MODELS FOR A LEAN PRODUCTION SYSTEM WITH REWORK AND SCRAP. A Thesis OTIMAL BATH UANTITY MOELS FOR A LEAN ROUTION SYSTEM WITH REWORK AN SRA A Thei Submied o he Graduae Faculy of he Louiiana Sae Univeriy and Agriculural and Mechanical ollege in parial fulfillmen of he requiremen

More information

USE OF EDUCATION TECHNOLOGY IN ENGLISH CLASSES

USE OF EDUCATION TECHNOLOGY IN ENGLISH CLASSES USE OF EDUCATION TECHNOLOGY IN ENGLISH CLASSES Mehme Nuri GÖMLEKSİZ Absrac Using educaion echnology in classes helps eachers realize a beer and more effecive learning. In his sudy 150 English eachers were

More information

CHARGE AND DISCHARGE OF A CAPACITOR

CHARGE AND DISCHARGE OF A CAPACITOR REFERENCES RC Circuis: Elecrical Insrumens: Mos Inroducory Physics exs (e.g. A. Halliday and Resnick, Physics ; M. Sernheim and J. Kane, General Physics.) This Laboraory Manual: Commonly Used Insrumens:

More information

Towards Intrusion Detection in Wireless Sensor Networks

Towards Intrusion Detection in Wireless Sensor Networks Towards Inrusion Deecion in Wireless Sensor Neworks Kroniris Ioannis, Tassos Dimiriou and Felix C. Freiling Ahens Informaion Technology, 19002 Peania, Ahens, Greece Email: {ikro,dim}@ai.edu.gr Deparmen

More information

Task is a schedulable entity, i.e., a thread

Task is a schedulable entity, i.e., a thread Real-Time Scheduling Sysem Model Task is a schedulable eniy, i.e., a hread Time consrains of periodic ask T: - s: saring poin - e: processing ime of T - d: deadline of T - p: period of T Periodic ask T

More information

Option Put-Call Parity Relations When the Underlying Security Pays Dividends

Option Put-Call Parity Relations When the Underlying Security Pays Dividends Inernaional Journal of Business and conomics, 26, Vol. 5, No. 3, 225-23 Opion Pu-all Pariy Relaions When he Underlying Securiy Pays Dividends Weiyu Guo Deparmen of Finance, Universiy of Nebraska Omaha,

More information

AP Calculus AB 2010 Scoring Guidelines

AP Calculus AB 2010 Scoring Guidelines AP Calculus AB 1 Scoring Guidelines The College Board The College Board is a no-for-profi membership associaion whose mission is o connec sudens o college success and opporuniy. Founded in 1, he College

More information

MACROECONOMIC FORECASTS AT THE MOF A LOOK INTO THE REAR VIEW MIRROR

MACROECONOMIC FORECASTS AT THE MOF A LOOK INTO THE REAR VIEW MIRROR MACROECONOMIC FORECASTS AT THE MOF A LOOK INTO THE REAR VIEW MIRROR The firs experimenal publicaion, which summarised pas and expeced fuure developmen of basic economic indicaors, was published by he Minisry

More information

INTEREST RATE FUTURES AND THEIR OPTIONS: SOME PRICING APPROACHES

INTEREST RATE FUTURES AND THEIR OPTIONS: SOME PRICING APPROACHES INTEREST RATE FUTURES AND THEIR OPTIONS: SOME PRICING APPROACHES OPENGAMMA QUANTITATIVE RESEARCH Absrac. Exchange-raded ineres rae fuures and heir opions are described. The fuure opions include hose paying

More information

4. International Parity Conditions

4. International Parity Conditions 4. Inernaional ariy ondiions 4.1 urchasing ower ariy he urchasing ower ariy ( heory is one of he early heories of exchange rae deerminaion. his heory is based on he concep ha he demand for a counry's currency

More information

Automatic measurement and detection of GSM interferences

Automatic measurement and detection of GSM interferences Auomaic measuremen and deecion of GSM inerferences Poor speech qualiy and dropped calls in GSM neworks may be caused by inerferences as a resul of high raffic load. The radio nework analyzers from Rohde

More information

Morningstar Investor Return

Morningstar Investor Return Morningsar Invesor Reurn Morningsar Mehodology Paper Augus 31, 2010 2010 Morningsar, Inc. All righs reserved. The informaion in his documen is he propery of Morningsar, Inc. Reproducion or ranscripion

More information

AP Calculus BC 2010 Scoring Guidelines

AP Calculus BC 2010 Scoring Guidelines AP Calculus BC Scoring Guidelines The College Board The College Board is a no-for-profi membership associaion whose mission is o connec sudens o college success and opporuniy. Founded in, he College Board

More information

A Note on Using the Svensson procedure to estimate the risk free rate in corporate valuation

A Note on Using the Svensson procedure to estimate the risk free rate in corporate valuation A Noe on Using he Svensson procedure o esimae he risk free rae in corporae valuaion By Sven Arnold, Alexander Lahmann and Bernhard Schwezler Ocober 2011 1. The risk free ineres rae in corporae valuaion

More information

Strategic Optimization of a Transportation Distribution Network

Strategic Optimization of a Transportation Distribution Network Sraegic Opimizaion of a Transporaion Disribuion Nework K. John Sophabmixay, Sco J. Mason, Manuel D. Rossei Deparmen of Indusrial Engineering Universiy of Arkansas 4207 Bell Engineering Cener Fayeeville,

More information

Stochastic Optimal Control Problem for Life Insurance

Stochastic Optimal Control Problem for Life Insurance Sochasic Opimal Conrol Problem for Life Insurance s. Basukh 1, D. Nyamsuren 2 1 Deparmen of Economics and Economerics, Insiue of Finance and Economics, Ulaanbaaar, Mongolia 2 School of Mahemaics, Mongolian

More information

Appendix D Flexibility Factor/Margin of Choice Desktop Research

Appendix D Flexibility Factor/Margin of Choice Desktop Research Appendix D Flexibiliy Facor/Margin of Choice Deskop Research Cheshire Eas Council Cheshire Eas Employmen Land Review Conens D1 Flexibiliy Facor/Margin of Choice Deskop Research 2 Final Ocober 2012 \\GLOBAL.ARUP.COM\EUROPE\MANCHESTER\JOBS\200000\223489-00\4

More information

The Grantor Retained Annuity Trust (GRAT)

The Grantor Retained Annuity Trust (GRAT) WEALTH ADVISORY Esae Planning Sraegies for closely-held, family businesses The Granor Reained Annuiy Trus (GRAT) An efficien wealh ransfer sraegy, paricularly in a low ineres rae environmen Family business

More information

Equity Valuation Using Multiples. Jing Liu. Anderson Graduate School of Management. University of California at Los Angeles (310) 206-5861

Equity Valuation Using Multiples. Jing Liu. Anderson Graduate School of Management. University of California at Los Angeles (310) 206-5861 Equiy Valuaion Uing Muliple Jing Liu Anderon Graduae School of Managemen Univeriy of California a Lo Angele (310) 206-5861 jing.liu@anderon.ucla.edu Doron Niim Columbia Univeriy Graduae School of Buine

More information

Chapter 4: Exponential and Logarithmic Functions

Chapter 4: Exponential and Logarithmic Functions Chaper 4: Eponenial and Logarihmic Funcions Secion 4.1 Eponenial Funcions... 15 Secion 4. Graphs of Eponenial Funcions... 3 Secion 4.3 Logarihmic Funcions... 4 Secion 4.4 Logarihmic Properies... 53 Secion

More information

Stock Trading with Recurrent Reinforcement Learning (RRL) CS229 Application Project Gabriel Molina, SUID 5055783

Stock Trading with Recurrent Reinforcement Learning (RRL) CS229 Application Project Gabriel Molina, SUID 5055783 Sock raing wih Recurren Reinforcemen Learning (RRL) CS9 Applicaion Projec Gabriel Molina, SUID 555783 I. INRODUCION One relaively new approach o financial raing is o use machine learning algorihms o preic

More information

Differential Equations and Linear Superposition

Differential Equations and Linear Superposition Differenial Equaions and Linear Superposiion Basic Idea: Provide soluion in closed form Like Inegraion, no general soluions in closed form Order of equaion: highes derivaive in equaion e.g. dy d dy 2 y

More information

Trends in TCP/IP Retransmissions and Resets

Trends in TCP/IP Retransmissions and Resets Trends in TCP/IP Reransmissions and Reses Absrac Concordia Chen, Mrunal Mangrulkar, Naomi Ramos, and Mahaswea Sarkar {cychen, mkulkarn, msarkar,naramos}@cs.ucsd.edu As he Inerne grows larger, measuring

More information

Predicting Stock Market Index Trading Signals Using Neural Networks

Predicting Stock Market Index Trading Signals Using Neural Networks Predicing Sock Marke Index Trading Using Neural Neworks C. D. Tilakarane, S. A. Morris, M. A. Mammadov, C. P. Hurs Cenre for Informaics and Applied Opimizaion School of Informaion Technology and Mahemaical

More information

Impact of scripless trading on business practices of Sub-brokers.

Impact of scripless trading on business practices of Sub-brokers. Impac of scripless rading on business pracices of Sub-brokers. For furher deails, please conac: Mr. T. Koshy Vice Presiden Naional Securiies Deposiory Ld. Tradeworld, 5 h Floor, Kamala Mills Compound,

More information

THE FIRM'S INVESTMENT DECISION UNDER CERTAINTY: CAPITAL BUDGETING AND RANKING OF NEW INVESTMENT PROJECTS

THE FIRM'S INVESTMENT DECISION UNDER CERTAINTY: CAPITAL BUDGETING AND RANKING OF NEW INVESTMENT PROJECTS VII. THE FIRM'S INVESTMENT DECISION UNDER CERTAINTY: CAPITAL BUDGETING AND RANKING OF NEW INVESTMENT PROJECTS The mos imporan decisions for a firm's managemen are is invesmen decisions. While i is surely

More information

1. y 5y + 6y = 2e t Solution: Characteristic equation is r 2 5r +6 = 0, therefore r 1 = 2, r 2 = 3, and y 1 (t) = e 2t,

1. y 5y + 6y = 2e t Solution: Characteristic equation is r 2 5r +6 = 0, therefore r 1 = 2, r 2 = 3, and y 1 (t) = e 2t, Homework6 Soluions.7 In Problem hrough 4 use he mehod of variaion of parameers o find a paricular soluion of he given differenial equaion. Then check your answer by using he mehod of undeermined coeffiens..

More information

PROFITS AND POSITION CONTROL: A WEEK OF FX DEALING

PROFITS AND POSITION CONTROL: A WEEK OF FX DEALING PROFITS AND POSITION CONTROL: A WEEK OF FX DEALING Richard K. Lyon U.C. Berkeley and NBER Thi verion: June 1997 Abrac Thi paper examine foreign exchange rading a he dealer level. The dealer we rack average

More information

Botnet Economics: Uncertainty Matters

Botnet Economics: Uncertainty Matters Bone Economics: Uncerainy Maers Zhen Li Deparmen of Economics and Managemen Albion College Email:zli@albion.edu Qi Liao, Aaron Sriegel Deparmen of Compuer Science and Engineering Universiy of Nore Dame

More information

The Twin Agency Problems in Corporate Finance - On the basis of Stulz s theory -

The Twin Agency Problems in Corporate Finance - On the basis of Stulz s theory - The Twin Agency Problem in Corporae Finance - On he bai of Sulz heory - Von der Fakulä für Machinenbau, Elekroechnik und Wirchafingenieurween der Brandenburgichen Technichen Univeriä Cobu zur Erlangung

More information

DDoS Attacks Detection Model and its Application

DDoS Attacks Detection Model and its Application DDoS Aacks Deecion Model and is Applicaion 1, MUHAI LI, 1 MING LI, XIUYING JIANG 1 School of Informaion Science & Technology Eas China Normal Universiy No. 500, Dong-Chuan Road, Shanghai 0041, PR. China

More information

PRACTICES AND ISSUES IN OPERATIONAL RISK MODELING UNDER BASEL II

PRACTICES AND ISSUES IN OPERATIONAL RISK MODELING UNDER BASEL II Lihuanian Mahemaical Journal, Vol. 51, No. 2, April, 2011, pp. 180 193 PRACTICES AND ISSUES IN OPERATIONAL RISK MODELING UNDER BASEL II Paul Embrechs and Marius Hofer 1 RiskLab, Deparmen of Mahemaics,

More information

Chapter 8: Regression with Lagged Explanatory Variables

Chapter 8: Regression with Lagged Explanatory Variables Chaper 8: Regression wih Lagged Explanaory Variables Time series daa: Y for =1,..,T End goal: Regression model relaing a dependen variable o explanaory variables. Wih ime series new issues arise: 1. One

More information

BALANCE OF PAYMENTS. First quarter 2008. Balance of payments

BALANCE OF PAYMENTS. First quarter 2008. Balance of payments BALANCE OF PAYMENTS DATE: 2008-05-30 PUBLISHER: Balance of Paymens and Financial Markes (BFM) Lena Finn + 46 8 506 944 09, lena.finn@scb.se Camilla Bergeling +46 8 506 942 06, camilla.bergeling@scb.se

More information

How To Understand The Long Run Behavior Of Aving Rae

How To Understand The Long Run Behavior Of Aving Rae Subience Conumpion and Riing Saving Rae Kenneh S. Lin a, Hiu-Yun Lee b * a Deparmen of Economic, Naional Taiwan Univeriy, Taipei, 00, Taiwan. b Deparmen of Economic, Naional Chung Cheng Univeriy, Chia-Yi,

More information

MTH6121 Introduction to Mathematical Finance Lesson 5

MTH6121 Introduction to Mathematical Finance Lesson 5 26 MTH6121 Inroducion o Mahemaical Finance Lesson 5 Conens 2.3 Brownian moion wih drif........................... 27 2.4 Geomeric Brownian moion........................... 28 2.5 Convergence of random

More information

Journal Of Business & Economics Research September 2005 Volume 3, Number 9

Journal Of Business & Economics Research September 2005 Volume 3, Number 9 Opion Pricing And Mone Carlo Simulaions George M. Jabbour, (Email: jabbour@gwu.edu), George Washingon Universiy Yi-Kang Liu, (yikang@gwu.edu), George Washingon Universiy ABSTRACT The advanage of Mone Carlo

More information

Analogue and Digital Signal Processing. First Term Third Year CS Engineering By Dr Mukhtiar Ali Unar

Analogue and Digital Signal Processing. First Term Third Year CS Engineering By Dr Mukhtiar Ali Unar Analogue and Digial Signal Processing Firs Term Third Year CS Engineering By Dr Mukhiar Ali Unar Recommended Books Haykin S. and Van Veen B.; Signals and Sysems, John Wiley& Sons Inc. ISBN: 0-7-380-7 Ifeachor

More information

Working Paper No. 482. Net Intergenerational Transfers from an Increase in Social Security Benefits

Working Paper No. 482. Net Intergenerational Transfers from an Increase in Social Security Benefits Working Paper No. 482 Ne Inergeneraional Transfers from an Increase in Social Securiy Benefis By Li Gan Texas A&M and NBER Guan Gong Shanghai Universiy of Finance and Economics Michael Hurd RAND Corporaion

More information

Term Structure of Prices of Asian Options

Term Structure of Prices of Asian Options Term Srucure of Prices of Asian Opions Jirô Akahori, Tsuomu Mikami, Kenji Yasuomi and Teruo Yokoa Dep. of Mahemaical Sciences, Risumeikan Universiy 1-1-1 Nojihigashi, Kusasu, Shiga 525-8577, Japan E-mail:

More information

Real-time Particle Filters

Real-time Particle Filters Real-ime Paricle Filers Cody Kwok Dieer Fox Marina Meilă Dep. of Compuer Science & Engineering, Dep. of Saisics Universiy of Washingon Seale, WA 9895 ckwok,fox @cs.washingon.edu, mmp@sa.washingon.edu Absrac

More information

Two-Group Designs Independent samples t-test & paired samples t-test. Chapter 10

Two-Group Designs Independent samples t-test & paired samples t-test. Chapter 10 Two-Group Deign Independen ample -e & paired ample -e Chaper 0 Previou e (Ch 7 and 8) Z-e z M N -e (one-ample) M N M = andard error of he mean p. 98-9 Remember: = variance M = eimaed andard error p. -

More information

GoRA. For more information on genetics and on Rheumatoid Arthritis: Genetics of Rheumatoid Arthritis. Published work referred to in the results:

GoRA. For more information on genetics and on Rheumatoid Arthritis: Genetics of Rheumatoid Arthritis. Published work referred to in the results: For more informaion on geneics and on Rheumaoid Arhriis: Published work referred o in he resuls: The geneics revoluion and he assaul on rheumaoid arhriis. A review by Michael Seldin, Crisopher Amos, Ryk

More information

II.1. Debt reduction and fiscal multipliers. dbt da dpbal da dg. bal

II.1. Debt reduction and fiscal multipliers. dbt da dpbal da dg. bal Quarerly Repor on he Euro Area 3/202 II.. Deb reducion and fiscal mulipliers The deerioraion of public finances in he firs years of he crisis has led mos Member Saes o adop sizeable consolidaion packages.

More information

Optimal Investment and Consumption Decision of Family with Life Insurance

Optimal Investment and Consumption Decision of Family with Life Insurance Opimal Invesmen and Consumpion Decision of Family wih Life Insurance Minsuk Kwak 1 2 Yong Hyun Shin 3 U Jin Choi 4 6h World Congress of he Bachelier Finance Sociey Torono, Canada June 25, 2010 1 Speaker

More information

Outline. Role of Aggregate Planning. Role of Aggregate Planning. Logistics and Supply Chain Management. Aggregate Planning

Outline. Role of Aggregate Planning. Role of Aggregate Planning. Logistics and Supply Chain Management. Aggregate Planning Logisics and upply Chain Managemen Aggregae Planning 1 Ouline Role of aggregae planning in a supply chain The aggregae planning problem Aggregae planning sraegies mplemening aggregae planning in pracice

More information

ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS

ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS R. Caballero, E. Cerdá, M. M. Muñoz and L. Rey () Deparmen of Applied Economics (Mahemaics), Universiy of Málaga,

More information

A Two-Account Life Insurance Model for Scenario-Based Valuation Including Event Risk Jensen, Ninna Reitzel; Schomacker, Kristian Juul

A Two-Account Life Insurance Model for Scenario-Based Valuation Including Event Risk Jensen, Ninna Reitzel; Schomacker, Kristian Juul universiy of copenhagen Universiy of Copenhagen A Two-Accoun Life Insurance Model for Scenario-Based Valuaion Including Even Risk Jensen, Ninna Reizel; Schomacker, Krisian Juul Published in: Risks DOI:

More information

AP Calculus AB 2007 Scoring Guidelines

AP Calculus AB 2007 Scoring Guidelines AP Calculus AB 7 Scoring Guidelines The College Board: Connecing Sudens o College Success The College Board is a no-for-profi membership associaion whose mission is o connec sudens o college success and

More information

The naive method discussed in Lecture 1 uses the most recent observations to forecast future values. That is, Y ˆ t + 1

The naive method discussed in Lecture 1 uses the most recent observations to forecast future values. That is, Y ˆ t + 1 Business Condiions & Forecasing Exponenial Smoohing LECTURE 2 MOVING AVERAGES AND EXPONENTIAL SMOOTHING OVERVIEW This lecure inroduces ime-series smoohing forecasing mehods. Various models are discussed,

More information

Usefulness of the Forward Curve in Forecasting Oil Prices

Usefulness of the Forward Curve in Forecasting Oil Prices Usefulness of he Forward Curve in Forecasing Oil Prices Akira Yanagisawa Leader Energy Demand, Supply and Forecas Analysis Group The Energy Daa and Modelling Cener Summary When people analyse oil prices,

More information