Reliability Analysis for Cryptographic Key Management
|
|
- Sheena Booth
- 6 years ago
- Views:
Transcription
1 Reliabiliy Analysis for Crypographic Key Managemen 1 Sheng Xiao, 2 Weibo Gong, 3 Don Towsley, 4, 5 Qingquan Zhang, 5 Ting Zhu 1 College of Informaion Science and Engineering, Hunan Universiy, China 2 Dep. Elecrical and Compuer Engineering, Universiy of Massachuses, Amhers, U.S.A. 3 Dep. Compuer Science, Universiy of Massachuses, Amhers, U.S.A. 4 Dep. Elecrical and Compuer Engineering, Universiy of Minnesoa, Twin Ciies, U.S.A. 5 Dep. Compuer Science, Sae Universiy of New York, Binghampon, U.S.A. Absrac The main duy of key managemen is o keep crypographic keys in secre. However, i is difficuly o quaniaively assess ha how well does a key managemen scheme proec he keys. In his paper, we propose o use reliabiliy heory, which was mainly used o evaluae performance persisence for engineering sysems, o esimae he performance of key managemen schemes. The reliabiliy analysis leads o couner-inuiive resuls such as he widely deployed periodic key updae scheme is ineffecive when key hefs are possible. The analysis also shows ha using password wih an elecronic securiy oken for auhenicaion is a srong securiy measure in he beginning bu is unreliable in he long run. In general, he reliabiliy analysis demonsraes ha curren key managemen schemes focus oo much on posponing he firs key hef from occurring bu lack of consideraions on quickly recovering solen keys. In he laer par of his paper, we discuss possible direcions ha may improve he reliabiliy of key managemen schemes. I. INTRODUCTION Safey of crypographic keys is a premise of informaion securiy. If adversary knows he key, even he sronges crypographic algorihms would no work. Consequenly, almos all he securiy funcions, such as auhenicaion and encrypion, would sop working. In informaion securiy sysems, key managemen schemes are designed and implemen o proec key safey. Therefore, in order o examine he level of informaion securiy, i is necessary o assess he proecion performance of key managemen schemes. There are convenional, qualiaive beliefs on he performance of key managemen schemes. For example, i is ofen advocaed ha users should change heir accoun passwords once every hree monhs. I is believed ha his securiy policy could effecively miigae he securiy hreas from password hefs. However, here is lile previous sudy ha ells us why hree monhs is an appropriae password updae period or how much safer he passwords would be afer his securiy policy had been applied. In his paper, we propose o model key safey as a reliabiliy engineering problem and apply measures from reliabiliy engineering heory as performance measures for key managemen schemes. We rea key hefs as sysem failures and key updaes as he mainenance effors ha can recover a failed sysem. The engineering reliabiliy measures, such as availabiliy, mean ime o recover, ec, are mapped ino securiy conexs. We analyze several key managemen schemes wih hese securiy reliabiliy measures. Noably, our analysis demonsraes ha he periodic key updae scheme, e.g. change password once every hree monhs, is inherenly inefficien. This finding coincides wih empirical sudies such as [1] and [2]. The analysis also shows ha by using password ogeher wih an elecronic securiy oken or a porable digial cerificae, a.k.a. wo-facor auhenicaion, he rusworhiness of auhenicaion can be improved. However, such a combinaion ends o be unreliable in he long erm. We exends reliabiliy analysis o a caegory of key managemen schemes, namely k-ou-of-n keyed sysems. Wih homogeneiy condiions, we find analyic form for he average ime ha he sysem remains in securiy. This resul furher validaes he feasibiliy of using reliabiliy analysis o evaluae key managemen performances. Afer case analyses, we summarize ha convenional key managemen designs end o focus on prevening keys from being seized by adversary and neglec he imporance of quickly replacing solen keys. A reliable key managemen scheme should ake boh aspecs ino consideraion. The main conribuions of his paper are: We model key safey problem as a reliabiliy engineering problem and ranslae reliabiliy measures o key safey measures. We analyze periodic key updae scheme and wo-facor auhenicaion scheme using reliabiliy analysis. The resuls reveal inheren weaknesses in hese wo schemes. We apply reliabiliy analysis mehods on k-ou-of-n keyed sysems and find analyic soluion o he mean ime o firs sysem failure for his ype of informaion securiy sysems. We discuss possible ways of improving reliabiliy for key managemen schemes. The res of his paper is organized as follows: Secion II presens previous sudies ha moivae and suppor our research in his paper. Secion III formulaes key safey problem from a reliabiliy engineering perspecive and discusses he securiy meanings of sysem failure rae and mainenance schedules. Secion IV presens reliabiliy analysis for periodic key updae schemes. Secion V analyzes wo-facor auhenicaion schemes which are widely used in applicaions ha /14/$ IEEE 999
2 require srong auhenicaion. Secion VI demonsraes he analyic power of reliabiliy analysis by solving he mean ime o firs sysem failure for k-ou-of-n keyed sysems. Secion VII suggess reliabiliy improvemens over curren key managemen schemes. Secion VIII concludes he paper. II. RELATED WORK A. Reliabiliy and Securiy Reliabiliy heory has been inroduced ino sofware securiy research. A series of works such as [3] and [4] rea sofware as an engineering sysem and propose o use reliabiliy measures as he securiy performance merics. A sofware sysem may be inruded and pached many imes in is life span. Models for such sofware sysems are collecively named as inrusion oleran sysems. There is a line of research ha uses sae ransiion model and sochasic process as ool o analyze he inrusion olerance of sofware sysems such as [5]. Reliabiliy and securiy are ofen invesigaed as wo independen properies in oher informaion securiy domains. The wo conceps rarely inervene wih each oher, parly because reliabiliy is more abou he long erm average and securiy is ypically viewed as an insananeous propery. To our knowledge, his paper is an early aemp o apply reliabiliy analysis on key managemen securiy. B. Key Srengh vs. Key Safey Previous works on quanifying he safey level of a crypographic key are largely associaed wih he key srengh, or more precisely, he informaion enropy conained in he key. This measure accuraely reflecs he difficuly level for an adversary o obain he key when he adversary is limied by only using brue-force search aacks. However, key srengh is inadequae o characerize key safey in general. Key enropy is less useful when adversary aemps o crack encrypion algorihms ha uilize he key. In his case, he key would be safer if less daa are encryped by he same key value [6]. When we consider sysem inrusions ha allow adversary o seize he key, he level of inrusion resisance deermines he key safey and leaves key enropy irrelevan [7]. In his paper, we argue ha reliabiliy measures could be more comprehensive in characerizing key safey from a ime series saisical perspecive. III. RELIABILITY ANALYSIS AND KEY SAFETY MODEL In his secion, we propose a reliabiliy engineering model for key safey and assign securiy meanings o reliabiliy conceps. We exensively discuss wo criical reliabiliy conceps in his model: failure disribuion and mainenance schedule. A. Reliabiliy Analysis Terminologies We use a mechanic sysem wih only one componen as he example o inroduce reliabiliy engineering conceps. The componen in his sysem is eiher properly working or malfuncioning. A malfuncioned componen, i.e. a failed componen, can be repaired and reurn o work. Over ime, he componen s failures and repairs can be modeled by an ON-OFF process X(). X() = { 1, if sysem is working, if sysem is failed. (1) The firs reliabiliy engineering meric o be inroduced is Mean Time To Failure (MTTF). MTTF is he expeced ime ha he sysem can keep working before a failure occurs. Le N f (T ) denoe he number of failures in [,T]. MTTF can be expressed as T MTTF = lim T X()d. (2) N f (T ) Similarly, we have Mean Time To Recover (MTTR), he average ime i akes o recover he sysem from a failure. MTTF is defined as MTTR = lim T T (1 X())d. (3) N f (T ) Average availabiliy is anoher widely used meric. I characerizes he fracion of ime ha he sysem funcions properly over he oal sysem running ime. The average availabiliy is defined by inegraing X() over ime, and hen aking he limi as ime goes o infiniy, T A avg = lim X()d. (4) T T I can also be derived from MTTF and MTTR. MTTF A avg = (5) MTTF + MTTR In he key safey conex, MTTF characerizes he average ime ha a crypographic key remains unknown o adversary afer is issuance. MTTF is collecively decided by he inensiy of key sealing aacks and he srengh of proecion mechanisms deployed in key generaion, key disribuion, and sorage. MTTR defines he average ime gap beween a key being solen and he key being replaced wih a new key. MTTR is highly criical for key safey bu ofen overlooked in convenional key managemen schemes. MTTR defines he ime window ha a key-sealing adversary can aack wih he solen key. A shor MTTR means less ime o exploi he solen key and less incenive for an adversary o seal he key. Average availabiliy is a useful performance indicaor ha demonsraes he persisence of key safey by combining MTTF and MTTR. There is anoher imporan reliabiliy meric, Mean Time o Firs Sysem Failure (MTFSF), which is he average running ime from he ime a sysem sars working o is firs ever failure. In his paper, we would demonsraes ha convenional key managemen schemes focus on opimizing MTFSF insead of MTTF and MTTR. B. Key Safey Model We model he key safey saus over ime as an ON-OFF process ha coincides wih he process used o characerize he mechanic sysem above. As shown in Figure 1, an ON-OFF process X() represens he key safey over ime. X() =1denoes ha he key is safe 1
3 a ime. X() =means an adversary knows he key. The sae ransiion from ON (X() =1) o OFF (X() =) corresponds o a key hef. If a key updae occurs a ime and X() =, he process would have a sae ransiion from X() =o X() =1. 1 X() key hefs key updaes o verify he legiimacy of Inerne websies. Digial cerificaes use he periodic key updae scheme as well. Afer a period of ime, ypically a couple of years, he public key signaure for a digial cerificae would expire and he cerificae owner needs o renew his digial cerificae. We model he key safey over ime as an ON-OFF process, as shown in Figure 2. X() key hefs key updaes 1 ON OFF Fig. 1. An ON-OFF process model for key safey saus over ime. In his paper, we use key hef o represen even ha adversary obains he key, regardless of he key-obaining mehods used by he adversary. C. Failure Disribuions of Key Thefs In engineering sysems, he occurrence rae of failures is criical o characerized he sysem reliabiliy. Over he ime, if he failure rae increases, i.e. Increased Failure Rae (IFR), he sysem becomes less reliable in he long run. If he failure rae decreases, i.e. Decreased Failure Rae (DFR), he sysem gains reliabiliy over ime. The hird case is Consan Failure Rae (CFR). In he key safey conex, IFR shows ha he key managemen is loose and adversary gain advanage by accumulaing experience from previous key hefs. The fuure key hefs become easier for he adversary. DFR means he key managemen is igh and he informaion securiy sysem operaor paches key hef vulnerabiliies ahead of adversary s aacks. The sysem becomes more and more resilien o key hef aacks over ime. DFR is hard o achieve in realiy. Frequen paching is no necessarily a meri for informaion securiy because he added complexiy may implan unforeseeable vulnerabiliies when paching known issues. CFR corresponds o he simples failure disribuions. In engineering sysems, i means ha a new componen has he same expeced life span as he res life span of a currenly working componen. CFR suggess ha he failures occurrences compose a homogeneous Poisson process. This paper, as a preliminary work o bridge reliabiliy heory and crypographic key managemen, would assume ha key hefs occur a CFR. The sequence of key hefs is modeled by a ime invarian homogeneous Poisson process. D. Mainenance Schedule and Key Managemen Scheme The mechanic sysem may have a mainenance schedule ha replace he criical componen from ime o ime. In key managemen, he crypographic key is also regularly updaed. The reliabiliy analysis for mainenance scheduling opimizaion can be used as a guide o he design of key managemen schemes. IV. ANALYSIS FOR PERIODIC KEY UPDATES Periodic key updae scheme is commonly used in pracice. A noable example is he IT sysem securiy policy ha requires he users o change heir login passwords once every hree monhs. Anoher example is he digial cerificaes used T Fig. 2. An ON-OFF process model for he reliabiliy of he periodic key updae scheme The key updae period is denoed as T. In pracice, he value of T is ofen much smaller han he average ime beween wo successive key hef evens, 1/λ. We assume a mos one key hef occurs beween wo successive key updaes. MTTR of periodic key updae scheme can be calculaed by exploiing he memoryless propery of he exponenial disribuion [8]. MTTR P = kt (k 1)T (kt )λe λ d k=1 T = 1 e λt T 1 λ I follows from equaion (6) ha MTTR P is lower bounded by MTTR P > T (7) 2 for all T>and 1/λ >. Inequaliy (7) demonsraes fundamenal inefficiency of he periodic key updae scheme. The average ime o recover a solen key is always greaer han half of he key updae period. If we expec a solen crypographic key o be replaced wihin 24 hours, hen he key updae period T has o be less han 48 hours. Such a relenless key updae scheme is impracical for mos real world applicaions. On he oher hand, if T is a large, pracical value, such as T =3monhs, hen he adversary will have more han one monh o aack wih he solen key. The periodic key updae fails is purpose o promply replace he solen key. We furher examine he average availabiliy of a crypographic key wih he periodic key updae scheme, 1/λ A avg,p = = 1 1/λ + MTTR P λt (1 e λt ), (8) which represens he porion of ime ha he key is safe in a long erm. Consider an example of a hree-monh periodic password updae scheme for a user s online accoun. Suppose on average adversary needs one year o compue and crack he user s password, i.e. 1/λ = 12 monhs. The average availabiliy is less han.9. This user would expec his online accoun (6) 11
4 o be unproeced for more han a monh in a year. Even if srong password proecion echniques are applied and he password only leaked o adversary once every 1 years, he average availabiliy is sill less han.99. Users would expec averagely more han 3 days of securiy blackou each year. I is imperceivable ha any securiy sensiive ask could be performed wih his low level of reliabiliy of key safey. Pracical siuaions is worse han he above esimaion. The average enropy conained in online passwords is much less han he searching power of curren password cracking machines [9]. The ypical average ime o crack a password is on he range of minues insead of a year. Figure 3 plos he average availabiliy of he periodic key updae scheme wih various T and 1/λ. Average Availabiliy / = 1 year 1/ = 1 years V. ANALYSIS FOR TWO-FACTOR AUTHENTICATION In pracice, people also find ha he password alone is no sufficienly rusworhy o safeguard securiy sensiive accouns. Therefore, wo-facor auhenicaion schemes are proposed o provide sronger auhenicaion. The wo-facor auhenicaion scheme requires he user o submi he password and one addiional credenial, such as an elecronic securiy oken, ogeher as he proof of ideniy. An elecronic securiy oken is a porable hardware ha has been programmed o display a pseudo random code ha changes every 3 seconds. The pseudo random codes are generaed from a seed value. The auhenicaion server sores he seed value herefore i can verify if he submied pseudo code is from he user s oken by synchronously generaing he same pseudo random code. When a user aemps o login, he submis his password ogeher wih he pseudo random code displayed on his oken. The password-oken auhenicaion scheme can be characerized by a wo-componen reliabiliy model, shown as Figure 4. The password and he elecronic securiy oken are wo componens in he sysem. The auhenicaion scheme fails when boh componens fail, i.e. adversary obains boh he password and he pseudo random code (or he seed value) securiy oken 3 monhs 1 year 3 years key updae period T password Fig. 3. Average availabiliy of he periodic key updae scheme for 1/λ =1 year and 1/λ =1years. Typical key updae periods are noed on X-axis. 3 monhs corresponds o he regular web password updaes. 1 year is he ypical expiraion period for a personal digial cerificae. 3 years is he life span of he roo cerificae used by Inerne cerificae auhoriies. Consider he he digial cerificae sysem used in he Inerne. There are hundreds of roo cerificaes sored in our Inerne browsers. These roo cerificaes are he roos of he rus hierarchy in he Inerne. If adversary obains any of hese keys, he can creae fake websies ha mimic legiimae sies such as Our Inerne browser would no be able o disinguish he fake websie wih he auhenic sie. The privae keys of hese roo cerificaes are sored in op level CA companies and proeced wih exreme cauion. The roo cerificaes are updaed very infrequenly, ypically once a decade or longer. From Figure 3, we can esimae he safey requiremen for he privae keys of he Inerne roo cerificaes. The higher posiioned curve suggess ha if any adversary can obain a roo privae key in 1 years, our curren Inerne digial cerificae sysem will no be dependable because he average availabiliy of he roo cerificaes, i.e. he porion of ime ha a roo cerificae is rusworhy, is below.4. The op ier cerificae auhoriy (CA) needs o guaranee ha he key hef rae o be less han once every hundred years o provide a reasonable average availabiliy for he Inerne digial cerificae sysem. Such an assumpion may no be close o realiy [1]. Fig. 4. The combinaion of elecronic securiy oken and password improves he auhenicaion srengh. The password and he oken have disincive reliabiliy properies. The password is suscepible o various passwordsealing aacks. The failure rae of he password componen could be subsanial in pracice. On he oher hand, he password can be periodically updaed a an affordable cos. A password hef will no cause he permanen failure of he password componen. The oken has a low failure rae because i is hard o know he dynamically changing pseudo code when adversary aemps o login. I is exremely difficul o penerae he heavily proeced auhenicaion server o obain he seed value. On he oher hand, updaing he seed value would require reprogramming he oken hardware. Such an updae is complex and expensive. As a resul, he seed value almos never changes in pracice. If an adversary obains he seed value, he oken may remain in he failed sae for a long period of ime. We apply he ON-OFF modeling echnique o characerize he password-securiy oken auhenicaion scheme, as shown in Figure 5. The ON-OFF process for he auhenicaion scheme is he superposiion of he ON-OFF processes of he wo componens. In he ime period before he elecronic securiy oken componen fails, he auhenicaion oucome is always rusworhy regardless of he password safey saus. Afer he failure of he oken componen, he safey of password componen would deermine he reliabiliy of he auhenicaion oucome. If he 12
5 secre solen secre solen wo facors one facor unrusworhy securiy oken password auhenicaion Fig. 5. ON-OFF process model for he wo-facor auhenicaion scheme using securiy oken and password. failure rae of he oken componen is no zero, i.e. i will fail a some ime poin, MTTF, MTTR, and average availabiliy of he wo-facor auhenicaion scheme will be he same as hose of he password only auhenicaion scheme. For he password-oken auhenicaion scheme, is MTFSF is he average ime lengh before he firs ime boh he oken and he password fail. Because i is much harder o compromise he elecronic securiy oken han he password, we have and herefore MTFSF oken MTFSF password (9) MTFSF oken password MTFSF oken. (1) The MTFSF of password-oken auhenicaion is close o ha of securiy oken only auhenicaion. The password-oken scheme is designed in he hope ha he oken never fail. If he oken failed, he sysem would run on password-only auhenicaion for a long ime, which is unaccepable for securiy-sensiive sysems. However, we do observe failures of elecronic securiy okens occurs in pracice. One prominen inciden is he seed value hef and algorihm cracking of RSA s SecureID TM which is deployed in sensiive places such as he Penagon and Lockheed Marin Company. The seed value of SecureID TM was found o be leaked o adversarial groups in May, 212 [11]. Laer, is pseudo codes generaion algorihm was also repored cracked [12]. In pracice, he MTFSF of he elecronic oken-password auhenicaion scheme may be much lower han is design expecaion. VI. ANALYSIS FOR K-OUT-OF-N KEYED SYSTEMS Pracical informaion securiy sysems ofen make a combined use of muliple, independenly managed keys. A ypical example of muli-key securiy scenarios is he use of access keys for highly classified informaion, such as plans for miliary missions. There are several keys ha handled by differen deparmens or individuals. Only when all of hese keys presen ogeher, he informaion becomes accessible. Anoher example is he access keys for a muli-user daabase. For users convenience, he daabase adminisraor may allow each user o access he enire daabase wih his/her individual key. Any of users keys can be used o pass he securiy check of his daabase sysem. The wo examples demonsrae wo possible advanages of using muliple keys over using a single key. One possible advanage of using muliple keys is ha he risk of all keys are obained by adversary is much smaller han using a single key. Anoher possible advanage is ha he access o one ou of many viable keys is subsanially more convenien han o find one paricular key. We call he prior example as he n- ou-of-n keyed sysem, and he laer example as he 1-ou-of-n keyed sysem. Each of he wo examples has is own pifall. The n-ou-ofn sysem is associaed wih a high managemen cos because if any of he n keys is los or damaged, e.g. is sorage device is malfuncioned, he enire sysem would be in panic. The 1-ouof-n sysem is associaed wih high securiy risk because if any of he n keys is solen, he sysem securiy is compromised. Therefore, i is possible o design k-ou-of-n sysems for 1 <k<nha balance he securiy risk and he managemen cos. In his secion, we apply reliabiliy analysis o general k-ou-of-n sysems and calculae heir MTFSF. The analysis would reveal he ime expecaions for hese sysems o remain in securiy since hey begin o work. To simplify he analysis, we assume ha key hefs o differen keys are independen evens. For each key, he sequence of key hef evens is modeled as a homogeneous Poisson process wih rae λ. All he n keys are never updaed. The MTFSF of a k-ou-of-n keyed sysem is he ime expecaion of is firs sysem failure, which occurs when an adversary seals k keys. Suppose he adversary obains he k- h solen key a ime T. Before ime T, exacly k 1 keys are solen. The k-h key is solen a he small ime period [T Δ, T ). The probabiliy densiy funcion for T is ( ) n p T () =k (1 e k λ ) k 1 e λ(n k) λd. (11) MTFSF of a k-ou-of-n sysem is he expecaion of T on he ime range [, ), E[T ]= = p T ()d (12) The analyic form of E[T ] can be expressed in Euler Gamma funcion Γ(n) and is logarihm derivaive Ψ(n), where Γ(n) = e n 1 d (13) and Ψ(n) d ln Γ(n). (14) dn Equaion (13) exends he facorial definiion of Gamma funcion ino complex number domain. I is sraighforward o verify ha Γ(n) =(n 1)! for n =1, 2,. We would like o menion ha here are many previous sudies on k-ou-of-n keyed securiy framework such as [13]. The analysis here no only demonsraes he feasibiliy of using 13
6 reliabiliy analysis o quanify securiy levels, bu also echoes and suppors previous sudies. For 1 <k<n, equaion (12) can be inerpreed as E[T ]= n n k (Ψ(n) Ψ(n k)) 1 λ. (15) By normalizing 1/λ =1,wehaveE[T ] for various n and k ploed in Figure 6. auhenicaion schemes. The analysis no only validaes he feasibiliy of using reliabiliy analysis on key managemen schemes, bu also sugges he necessiy of including reliabiliy requiremens in key managemen scheme designs. ACKNOWLEDGMENT This work is suppored in par by Naional Science Foundaion of China (Gran No ), Unied Saes Naional Science Foundaion gran CNS , and Hunan Universiy Young Faculy Fund Award. REFERENCES Fig. 6. VII. MTFSF for k-ou-of-n keyed sysems for various n and k REQUIREMENTS FOR RELIABLE KEY MANAGEMENT According o he analysis in previous secions, many exising key managemen schemes emphasize he criical mission of prevening crypographic keys from being solen and overlooks he imporance of long erm persisence of key safey. New key proecion echniques are developed o reduce he key hef rae and prolong MTFSF. However, a reliable key managemen scheme also needs o cover MTTR. A shor MTTR is essenial o limi damage caused by key hefs. Moreover, shorening MTTR can effecively lower he incenive for adversary o seal he key, and herefore indirecly reduce he key hef rae. As a summary, a reliable key managemen scheme should saisfy he following requiremens: 1) I has key proecion echniques ha can effecively limi key hef rae λ. 2) I has smar key managemen scheduling ha can quickly recover solen key and shoren MTTR. 3) Under pracical condiions, is MTFSF, MTTF, MTTR, and average availabiliy mee he users expecaion for key safey. The research on reducing key hef rae and increasing MTFSF is sill advancing each day [14][15]. On he oher side, i is wide open o explore for mehods ha can effecively decrease MTTR for various informaion securiy sysems [16][17][18][19]. VIII. CONCLUSION In his paper, we proposed a reliabiliy model o assess key safey under various key managemen schemes. Based on his model, our analysis explains why changing password every hree monhs is no an effecive securiy policy and reveals he facors associaed wih he rusworhiness of wo-facor [1] D. Florencio and C. Herley, A large-scale sudy of web password habis, in Proceedings of WWW 7, pp [2] C. Herley, So long, and no hanks for he exernaliies: he raional rejecion of securiy advice by users, in Proceedings of he 29 workshop on New securiy paradigms workshop, pp [3] B. Madan, K. Gogeva-Popsojanova, K. Vaidyanahan, and K. Trivedi, Modeling and quanificaion of securiy aribues of sofware sysems, in Proceedings of DSN 22, 22, pp [4] S. Chandra, R. A. Khan, K. Kaur, and H. Singh, Availabiliy sae ransiion model, ACM SIGSOFT Sofware Engineering Noes, vol. 36, no. 3, pp. 1 3, 211. [5] T. Uemura, T. Dohi, and N. Kaio, Availabiliy analysis of an inrusion oleran disribued server sysem wih prevenive mainenance, Reliabiliy, IEEE Transacions on, vol. 59, no. 1, pp , 21. [6] A. Biau, M. Handley, and J. Lackey, The final nail in wep s coffin, in Securiy and Privacy, 26 IEEE Symposium on, pp [7] J. Lin, J. Jing, and P. Liu, Evaluaing inrusion-oleran cerificaion auhoriy sysems, Qualiy and Reliabiliy Engineering Inernaional, vol. 28, no. 8, pp , 212. [8] S. Xiao, W. Gong, and D. Towsley, Secure wireless communicaion wih dynamic secres, in INFOCOM, 21 Proceedings IEEE, pp [9] P. G. Kelley, S. Komanduri, M. L. Mazurek, R. Shay, T. Vidas, L. Bauer, N. Chrisin, L. F. Cranor, and J. Lopez, Guess again (and again and again): Measuring password srengh by simulaing password-cracking algorihms, in Securiy and Privacy (SP), 212 IEEE Symposium on, pp [1] N. Leavi, Inerne securiy under aack: The undermining of digial cerificaes, Compuer, vol. 44, no. 12, pp. 17 2, 211. [11] R. Koch, B. Sele, and M. Golling, Aack rends in presen compuer neworks, in Proceedings of CYCON 212, pp [12] R. Bardou, R. Focardi, Y. Kawamoo, L. Simionao, G. Seel, and J.-K. Tsay, Efficien padding oracle aacks on crypographic hardware, in Advances in Crypology, CRYPTO 212, vol. 7417, pp [13] K. Benne, C. Grohoff, T. Horozov, and I. Parascu, Efficien sharing of encryped daa, in Informaion Securiy and Privacy. Springer, 22, pp [14] T. Zhu and M. Yu, A dynamic secure qos rouing proocol for wireless ad hoc neworks, in Sarnoff Symposium, 26 IEEE, pp [15], Nis2-4: A secure qualiy of service rouing proocol for wireless ad hoc neworks, in GLOBECOM 6. IEEE, pp [16] S. Xiao, H. Pishro-Nik, and W. Gong, Dense pariy check based secrecy sharing in wireless communicaions, in Proceedings of IEEE Globecom 7, pp [17] S. Xiao and W. Gong, Mobiliy can help: Proec user ideniy wih dynamic credenial, in Mobile Daa Managemen (MDM), 21 Elevenh Inernaional Conference on, pp [18] S. Xiao, W. Gong, and D. Towsley, From uncerainy o secrecy: A dynamic approach, in Signals, Sysems and Compuers (ASILOMAR) Conference. IEEE, 21, pp [19] T. Zhu, S. Xiao, Y. Ping, D. Towsley, and W. Gong, A secure energy rouing mechanism for sharing renewable energy in smar microgrid, in Smar Grid Communicaions (SmarGridComm), 211 IEEE Inernaional Conference on, pp
Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)
Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,
More informationQuantitative macro models feature an infinite number of periods A more realistic (?) view of time
INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many
More informationCoded Caching with Multiple File Requests
Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a
More informationTest - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version
Tes - Accredied Configuraion Engineer (ACE) Exam - PAN-OS 6.0 Version ACE Exam Quesion 1 of 50. Which of he following saemens is NOT abou Palo Alo Neworks firewalls? Sysem defauls may be resored by performing
More informationSimple Network Management Based on PHP and SNMP
Simple Nework Managemen Based on PHP and SNMP Krasimir Trichkov, Elisavea Trichkova bsrac: This paper aims o presen simple mehod for nework managemen based on SNMP - managemen of Cisco rouer. The paper
More informationCOSC 3213: Computer Networks I Chapter 6 Handout # 7
COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:
More informationMATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008
MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o
More informationLecture 18: Mix net Voting Systems
6.897: Advanced Topics in Crypography Apr 9, 2004 Lecure 18: Mix ne Voing Sysems Scribed by: Yael Tauman Kalai 1 Inroducion In he previous lecure, we defined he noion of an elecronic voing sysem, and specified
More informationImproving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services
Improving he Efficiency of Dynamic Service Provisioning in Transpor Neworks wih Scheduled Services Ralf Hülsermann, Monika Jäger and Andreas Gladisch Technologiezenrum, T-Sysems, Goslarer Ufer 35, D-1585
More informationA Matching Algorithm for Content-Based Image Retrieval
A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using
More informationSam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.
8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged
More informationProtecting User Privacy in a Multi-Path Information-Centric Network Using Multiple Random-Caches
Chu WB, Wang LF, Jiang ZJ e al. Proecing user privacy in a muli-pah informaion-cenric nework using muliple random-caches. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 32(3): 585 598 May 27. DOI.7/s39-7-73-2
More informationM(t)/M/1 Queueing System with Sinusoidal Arrival Rate
20 TUTA/IOE/PCU Journal of he Insiue of Engineering, 205, (): 20-27 TUTA/IOE/PCU Prined in Nepal M()/M/ Queueing Sysem wih Sinusoidal Arrival Rae A.P. Pan, R.P. Ghimire 2 Deparmen of Mahemaics, Tri-Chandra
More informationLearning in Games via Opponent Strategy Estimation and Policy Search
Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen
More informationTrust-based Service Management of Mobile Devices in Ad Hoc Networks
Trus-based Service Managemen of Mobile Devices in Ad Hoc Neworks Yaing Wang, Ing-Ray Chen Virginia Tech Deparmen of Compuer Science Falls Church, VA, USA Email: {yaingw, irchen}@v.edu Jin-Hee Cho U.S.
More informationAn efficient approach to improve throughput for TCP vegas in ad hoc network
Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: 395-0056 Volume: 0 Issue: 03 June-05 www.irje.ne p-issn: 395-007 An efficien approach o improve hroughpu for TCP vegas in ad hoc
More informationNetwork management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);
QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is
More informationA time-space consistency solution for hardware-in-the-loop simulation system
Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong
More informationDesign Alternatives for a Thin Lens Spatial Integrator Array
Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of
More informationLess Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks
Less Pessimisic Wors-Case Delay Analysis for Packe-Swiched Neworks Maias Wecksén Cenre for Research on Embedded Sysems P O Box 823 SE-31 18 Halmsad maias.wecksen@hh.se Magnus Jonsson Cenre for Research
More informationAn Adaptive Spatial Depth Filter for 3D Rendering IP
JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod
More informationsource managemen, naming, proecion, and service provisions. This paper concenraes on he basic processor scheduling aspecs of resource managemen. 2 The
Virual Compuers A New Paradigm for Disribued Operaing Sysems Banu Ozden y Aaron J. Goldberg Avi Silberschaz z 600 Mounain Ave. AT&T Bell Laboraories Murray Hill, NJ 07974 Absrac The virual compuers (VC)
More informationGauss-Jordan Algorithm
Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried
More informationAnalysis of Various Types of Bugs in the Object Oriented Java Script Language Coding
Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened
More informationFIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS
FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2
More informationDifficulty-aware Hybrid Search in Peer-to-Peer Networks
Difficuly-aware Hybrid Search in Peer-o-Peer Neworks Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni School of Compuer Science and Technology Huazhong Univ. of Science and Technology {chenhanhua, hjin}@hus.edu.cn
More informationThe Impact of Product Development on the Lifecycle of Defects
The Impac of Produc Developmen on he Lifecycle of Rudolf Ramler Sofware Compeence Cener Hagenberg Sofware Park 21 A-4232 Hagenberg, Ausria +43 7236 3343 872 rudolf.ramler@scch.a ABSTRACT This paper invesigaes
More information4 Error Control. 4.1 Issues with Reliable Protocols
4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can
More informationVulnerability Evaluation of Multimedia Subsystem Based on Complex Network
JOURAL OF MULTIMDIA, VOL. 8, O. 4, AUGUST 23 439 Vulnerabiliy valuaion of Mulimedia Subsysem Based on Complex ewor Xiaoling Tang Insiue of Higher ducaion Research, Jilin Business and Technology College,
More informationImage segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding
Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same
More informationScheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012
EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule
More informationWho Thinks Who Knows Who? Socio-cognitive Analysis of Networks. Technical Report
Who Thinks Who Knows Who? Socio-cogniive Analysis of Email Neworks Technical Repor Deparmen of Compuer Science and Engineering Universiy of Minnesoa 4-192 EECS Building 200 Union Sree SE Minneapolis, MN
More informationVideo Content Description Using Fuzzy Spatio-Temporal Relations
Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer
More informationNonparametric CUSUM Charts for Process Variability
Journal of Academia and Indusrial Research (JAIR) Volume 3, Issue June 4 53 REEARCH ARTICLE IN: 78-53 Nonparameric CUUM Chars for Process Variabiliy D.M. Zombade and V.B. Ghue * Dep. of aisics, Walchand
More informationEECS 487: Interactive Computer Graphics
EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified
More informationUtility-Based Hybrid Memory Management
Uiliy-Based Hybrid Memory Managemen Yang Li Saugaa Ghose Jongmoo Choi Jin Sun Hui Wang Onur Mulu Carnegie Mellon Universiy Dankook Universiy Beihang Universiy ETH Zürich While he memory fooprins of cloud
More informationAutomatic Calculation of Coverage Profiles for Coverage-based Testing
Auomaic Calculaion of Coverage Profiles for Coverage-based Tesing Raimund Kirner 1 and Waler Haas 1 Vienna Universiy of Technology, Insiue of Compuer Engineering, Vienna, Ausria, raimund@vmars.uwien.ac.a
More information4. Minimax and planning problems
CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems
More informationWho thinks who knows who? Socio-Cognitive Analysis of an Network
Who hinks who knows who? Socio-Cogniive Analysis of an Email Nework Nishih Pahak Deparmen of Compuer Science Universiy of Minnesoa Minneapolis, MN, USA npahak@cs.umn.edu Sandeep Mane Deparmen of Compuer
More informationVoltair Version 2.5 Release Notes (January, 2018)
Volair Version 2.5 Release Noes (January, 2018) Inroducion 25-Seven s new Firmware Updae 2.5 for he Volair processor is par of our coninuing effors o improve Volair wih new feaures and capabiliies. For
More informationDynamic Route Planning and Obstacle Avoidance Model for Unmanned Aerial Vehicles
Volume 116 No. 24 2017, 315-329 ISSN: 1311-8080 (prined version); ISSN: 1314-3395 (on-line version) url: hp://www.ijpam.eu ijpam.eu Dynamic Roue Planning and Obsacle Avoidance Model for Unmanned Aerial
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state
Ouline EECS 5 - Componens and Design Techniques for Digial Sysems Lec 6 Using FSMs 9-3-7 Review FSMs Mapping o FPGAs Typical uses of FSMs Synchronous Seq. Circuis safe composiion Timing FSMs in verilog
More informationChapter 3 MEDIA ACCESS CONTROL
Chaper 3 MEDIA ACCESS CONTROL Overview Moivaion SDMA, FDMA, TDMA Aloha Adapive Aloha Backoff proocols Reservaion schemes Polling Disribued Compuing Group Mobile Compuing Summer 2003 Disribued Compuing
More informationMIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch
CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple
More informationJoint Feature Learning With Robust Local Ternary Pattern for Face Recognition
Join Feaure Learning Wih Robus Local Ternary Paern for Face Recogniion Yuvaraju.M 1, Shalini.S 1 Assisan Professor, Deparmen of Elecrical and Elecronics Engineering, Anna Universiy Regional Campus, Coimbaore,
More informationRelevance Ranking using Kernels
Relevance Ranking using Kernels Jun Xu 1, Hang Li 1, and Chaoliang Zhong 2 1 Microsof Research Asia, 4F Sigma Cener, No. 49 Zhichun Road, Beijing, China 100190 2 Beijing Universiy of Poss and Telecommunicaions,
More informationChapter 8 LOCATION SERVICES
Disribued Compuing Group Chaper 8 LOCATION SERVICES Mobile Compuing Winer 2005 / 2006 Overview Mobile IP Moivaion Daa ransfer Encapsulaion Locaion Services & Rouing Classificaion of locaion services Home
More informationPartition-based document identifier assignment (PBDIA) algorithm. (long queries)
( ) Pariion-based documen idenifier assignmen (PBDIA) algorihm PBDIA (long queries) (parallel IR) :,,,, d-gap Compressing an invered file can grealy improve query performance of an informaion rerieval
More informationOpen Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u
Send Orders for Reprins o reprins@benhamscience.ae The Open Biomedical Engineering Journal, 5, 9, 9-3 9 Open Access Research on an Improved Medical Image Enhancemen Algorihm Based on P-M Model Luo Aijing
More informationAttack-Resilient Time Synchronization for Wireless Sensor Networks
ack-resilien Time Synchronizaion for Wireless Sensor Neworks Hui Song, Sencun Zhu, and Guohong Cao Deparmen of Compuer Science & Engineering The Pennsylvania Sae Universiy Universiy Park, P 1682 Email:
More informationMichiel Helder and Marielle C.T.A Geurts. Hoofdkantoor PTT Post / Dutch Postal Services Headquarters
SHORT TERM PREDICTIONS A MONITORING SYSTEM by Michiel Helder and Marielle C.T.A Geurs Hoofdkanoor PTT Pos / Duch Posal Services Headquarers Keywords macro ime series shor erm predicions ARIMA-models faciliy
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. XX, NO. XX, XX XXXX 1
This is he auhor's version of an aricle ha has been published in his journal. Changes were made o his version by he publisher prior o publicaion. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. XX,
More informationNEWTON S SECOND LAW OF MOTION
Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during
More informationAssignment 2. Due Monday Feb. 12, 10:00pm.
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how
More informationAn Efficient Delivery Scheme for Coded Caching
201 27h Inernaional Teleraffic Congress An Efficien Delivery Scheme for Coded Caching Abinesh Ramakrishnan, Cedric Wesphal and Ahina Markopoulou Deparmen of Elecrical Engineering and Compuer Science, Universiy
More informationMOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018
MOBILE COMPUTING CSE 40814/60814 Spring 2018 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationMOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi:
MOBILE COMPUTING CSE 40814/60814 Fall 2015 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationDesign and Application of Computer-aided English Online Examination System NONG DeChang 1, a
3rd Inernaional Conference on Maerials Engineering, Manufacuring Technology and Conrol (ICMEMTC 2016) Design and Applicaion of Compuer-aided English Online Examinaion Sysem NONG DeChang 1, a 1,2 Guangxi
More informationRECENT advancements in vehicular communication and
Reliabiliy-oriened Opimizaion of Compuaion Offloading for Cooperaive Vehicle-Infrasrucure Sysems Jianshan Zhou, Daxin Tian, Senior Member, IEEE, Yunpeng Wang, Zhengguo Sheng, Xuing Duan, and Vicor C.M.
More informationAudio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA
Audio Engineering Sociey Convenion Paper Presened a he 119h Convenion 2005 Ocober 7 10 New Yor, New Yor USA This convenion paper has been reproduced from he auhor's advance manuscrip, wihou ediing, correcions,
More informationA Formalization of Ray Casting Optimization Techniques
A Formalizaion of Ray Casing Opimizaion Techniques J. Revelles, C. Ureña Dp. Lenguajes y Sisemas Informáicos, E.T.S.I. Informáica, Universiy of Granada, Spain e-mail: [jrevelle,almagro]@ugr.es URL: hp://giig.ugr.es
More informationOptimal Crane Scheduling
Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move
More informationDimmer time switch AlphaLux³ D / 27
Dimmer ime swich AlphaLux³ D2 426 26 / 27! Safey noes This produc should be insalled in line wih insallaion rules, preferably by a qualified elecrician. Incorrec insallaion and use can lead o risk of elecric
More informationTowards a Realistic Model for Failure Propagation in Interdependent Networks
Towards a Realisic Model for Failure Propagaion in Inerdependen Neworks Agosino Suraro, Simone Silvesri, Mauro Coni, Sajal K. Das Deparmen of Mahemaics, Universiy of Padua, email: agosino.suraro@sudeni.unipd.i,
More informationNetwork Slicing for Ultra-Reliable Low Latency Communication in Industry 4.0 Scenarios
1 Nework Slicing for Ulra-Reliable Low Laency Communicaion in Indusry 4.0 Scenarios Anders Ellersgaard Kalør, René Guillaume, Jimmy Jessen Nielsen, Andreas Mueller, and Pear Popovski arxiv:1708.09132v1
More informationAML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves
AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves
More informationPART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR
. ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral
More informationPERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAGATION MODELS
PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAGATION MODELS Jun Peng Elecrical Engineering Deparmen, Universiy of Texas Rio Grande Valley, Edinburg, Texas, USA ABSTRACT Unmanned
More informationDefinition and examples of time series
Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is
More informationPerformance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks
Journal of Compuer Science 2 (5): 466-472, 2006 ISSN 1549-3636 2006 Science Publicaions Performance Evaluaion of Implemening Calls Prioriizaion wih Differen Queuing Disciplines in Mobile Wireless Neworks
More informationWeb System for the Remote Control and Execution of an IEC Application
Web Sysem for he Remoe Conrol and Execuion of an IEC 61499 Applicaion Oana ROHAT, Dan POPESCU Faculy of Auomaion and Compuer Science, Poliehnica Universiy, Splaiul Independenței 313, Bucureși, 060042,
More informationWINNOWING : Protecting P2P Systems Against Pollution By Cooperative Index Filtering
WINNOWING : Proecing P2P Sysems Agains Polluion By Cooperaive Index Filering Kyuyong Shin, Douglas S. Reeves, Injong Rhee, Yoonki Song Deparmen of Compuer Science Norh Carolina Sae Universiy Raleigh, NC
More informationSTEREO PLANE MATCHING TECHNIQUE
STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo
More informationHandling uncertainty in semantic information retrieval process
Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,
More informationAccelerating Call Route Query of Multi-domain SIP System via P2P GONG Jing, SHEN Qing-guo, SHEN Huan-sheng
3rd Inernaional Conference on Mecharonics and Informaion Technology (ICMIT 2016) Acceleraing Call Roue Query of Muli-domain IP ysem via P2P GONG Jing, HEN Qing-guo, HEN Huan-sheng College of Communicaions
More informationRule-Based Multi-Query Optimization
Rule-Based Muli-Query Opimizaion Mingsheng Hong Dep. of Compuer cience Cornell Universiy mshong@cs.cornell.edu Johannes Gehrke Dep. of Compuer cience Cornell Universiy johannes@cs.cornell.edu Mirek Riedewald
More informationImproving Explicit Congestion Notification with the Mark-Front Strategy
Improving Explici Congesion Noificaion wih he Mark-Fron Sraegy Chunlei Liu Raj Jain Deparmen of Compuer and Informaion Science Chief Technology Officer, Nayna Neworks, Inc. The Ohio Sae Universiy, Columbus,
More informationPacket Scheduling in a Low-Latency Optical Interconnect with Electronic Buffers
Packe cheduling in a Low-Laency Opical Inerconnec wih Elecronic Buffers Lin Liu Zhenghao Zhang Yuanyuan Yang Dep Elecrical & Compuer Engineering Compuer cience Deparmen Dep Elecrical & Compuer Engineering
More informationA Progressive-ILP Based Routing Algorithm for Cross-Referencing Biochips
16.3 A Progressive-ILP Based Rouing Algorihm for Cross-Referencing Biochips Ping-Hung Yuh 1, Sachin Sapanekar 2, Chia-Lin Yang 1, Yao-Wen Chang 3 1 Deparmen of Compuer Science and Informaion Engineering,
More informationShortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.
Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah
More informationModeling of IEEE in a Cluster of Synchronized Sensor Nodes
Modeling of IEEE 802.15.4 in a Cluser of Synchronized Sensor Nodes Kenji Leibniz, Naoki Wakamiya, and Masayuki Muraa Graduae School of Informaion Science and Technology, Osaka Universiy, 1-5 Yamadaoka,
More informationA GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER
A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER ABSTRACT Modern graphics cards for compuers, and especially heir graphics processing unis (GPUs), are designed for fas rendering of graphics.
More informationLet s get physical - EDA Tools for Mobility
Le s ge physical - EDA Tools for Mobiliy Aging and Reliabiliy Communicaion Mobile and Green Mobiliy - Smar and Safe Frank Oppenheimer OFFIS Insiue for Informaion Technology OFFIS a a glance Applicaion-oriened
More informationPLC Network Traffic Modeling for Implementation of Remote Monitoring of Electrical Power Consumption in Tanzania.
PLC Nework Traffic Modeling for Implemenaion of Remoe Monioring of Elecrical Power Consumpion in Tanzania. Jusinian Anaory, Mussa M. Kissaka and Nerey H. Mvungi Faculy of Elecrical and Compuer Sysems Engineering
More informationSEINA: A Stealthy and Effective Internal Attack in Hadoop Systems
SEINA: A Sealhy and Effecive Inernal Aack in Hadoop Sysems Jiayin Wang, Teng Wang, Zhengyu Yang, Ying ao, Ningfang i, and Bo Sheng Deparmen of Compuer Science, Universiy of assachuses Boson, 1 orrissey
More informationMoBAN: A Configurable Mobility Model for Wireless Body Area Networks
MoBAN: A Configurable Mobiliy Model for Wireless Body Area Neworks Majid Nabi 1, Marc Geilen 1, Twan Basen 1,2 1 Deparmen of Elecrical Engineering, Eindhoven Universiy of Technology, he Neherlands 2 Embedded
More informationAn Improved Square-Root Nyquist Shaping Filter
An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com
More informationPage 1. Key Points from Last Lecture Frame format. EEC173B/ECS152C, Winter Wireless LANs
EEC173/ECS152C, Winer 2006 Key Poins from Las Lecure Wireless LANs 802.11 Frame forma 802.11 MAC managemen Synchronizaion, Handoffs, Power MAC mehods: DCF & PCF CSMA/CA wih posiive ACK Exponenial backoff
More informationMotion Level-of-Detail: A Simplification Method on Crowd Scene
Moion Level-of-Deail: A Simplificaion Mehod on Crowd Scene Absrac Junghyun Ahn VR lab, EECS, KAIST ChocChoggi@vr.kais.ac.kr hp://vr.kais.ac.kr/~zhaoyue Recen echnological improvemen in characer animaion
More informationMORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES
MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image
More informationCENG 477 Introduction to Computer Graphics. Modeling Transformations
CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World
More informationReal-time 2D Video/3D LiDAR Registration
Real-ime 2D Video/3D LiDAR Regisraion C. Bodenseiner Fraunhofer IOSB chrisoph.bodenseiner@iosb.fraunhofer.de M. Arens Fraunhofer IOSB michael.arens@iosb.fraunhofer.de Absrac Progress in LiDAR scanning
More informationThe Effects of Multi-Layer Traffic on the Survivability of IP-over-WDM Networks
The Effecs of Muli-Layer Traffic on he Survivabiliy of IP-over-WDM Neworks Peera Pacharinanakul and David Tipper Graduae Telecommunicaions and Neworking Program, Universiy of Pisburgh, Pisburgh, PA 15260,
More information(Structural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS
(Srucural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS Himadri Ghosh, Prajneshu and Savia Wadhwa I.A.S.R.I., Library Avenue, New Delhi-110 01 him_adri@iasri.res.in, prajnesh@iasri.res.in,
More informationIn fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps
In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magneic Field Maps A. D. Hahn 1, A. S. Nencka 1 and D. B. Rowe 2,1 1 Medical College of Wisconsin, Milwaukee, WI, Unied
More informationLow-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany
Low-Cos WLAN based Time-of-fligh fligh Trilaeraion Precision Indoor Personnel Locaion and Tracking for Emergency Responders Third Annual Technology Workshop, Augus 5, 2008 Worceser Polyechnic Insiue, Worceser,
More informationVisual Indoor Localization with a Floor-Plan Map
Visual Indoor Localizaion wih a Floor-Plan Map Hang Chu Dep. of ECE Cornell Universiy Ihaca, NY 14850 hc772@cornell.edu Absrac In his repor, a indoor localizaion mehod is presened. The mehod akes firsperson
More informationFUZZY HUMAN/MACHINE RELIABILITY USING VHDL
FUZZY HUMN/MCHINE RELIBILITY USING VHDL Carlos. Graciós M. 1, lejandro Díaz S. 2, Efrén Gorroiea H. 3 (1) Insiuo Tecnológico de Puebla v. Tecnológico 420. Col. Maravillas, C. P. 72220, Puebla, Pue. México
More informationIROS 2015 Workshop on On-line decision-making in multi-robot coordination (DEMUR 15)
IROS 2015 Workshop on On-line decision-making in muli-robo coordinaion () OPTIMIZATION-BASED COOPERATIVE MULTI-ROBOT TARGET TRACKING WITH REASONING ABOUT OCCLUSIONS KAROL HAUSMAN a,, GREGORY KAHN b, SACHIN
More informationEP2200 Queueing theory and teletraffic systems
EP2200 Queueing heory and eleraffic sysems Vikoria Fodor Laboraory of Communicaion Neworks School of Elecrical Engineering Lecure 1 If you wan o model neworks Or a comple daa flow A queue's he key o help
More information