Highly Imperceptible and Reversible Text Steganography Using Invisible Character based Codeword
|
|
- Walter Griffin
- 6 years ago
- Views:
Transcription
1 Assocaton for Informaton Systms AIS Elctronc Lbrary (AISL) PACIS 2017 Procdngs Pacfc Asa Confrnc on Informaton Systms (PACIS) Summr Hghly Imprcptbl and Rvrsbl Txt Stganography Usng Invsbl Charactr basd Codword Mohammad Sadur Rahman RMIT Unvrsty, Mlbourn, Ibrahm Khall RMIT Unvrsty, Mlbourn, Xun Y RMIT Unvrsty, Mlbourn, xun.y@rmt.du.au Ha Dong RMIT Unvrsty, Mlbourn, ha.dong@rmt.du.au Follow ths and addtonal works at: Rcommndd Ctaton Rahman, Mohammad Sadur; Khall, Ibrahm; Y, Xun; and Dong, Ha, "Hghly Imprcptbl and Rvrsbl Txt Stganography Usng Invsbl Charactr basd Codword" (2017). PACIS 2017 Procdngs Ths matral s brought to you by th Pacfc Asa Confrnc on Informaton Systms (PACIS) at AIS Elctronc Lbrary (AISL). It has bn accptd for ncluson n PACIS 2017 Procdngs by an authorzd admnstrator of AIS Elctronc Lbrary (AISL). For mor nformaton, plas contact lbrary@asnt.org.
2 Hghly Imprcptbl and Rvrsbl Txt Stganography Hghly Imprcptbl and Rvrsbl Txt Stganography Usng Invsbl Charactr basd Codword Compltd Rsarch Papr Mohammad Sadur Rahman School of Scnc, RMIT Unvrsty Mlbourn, Vctora, Australa Ibrahm Khall School of Scnc, RMIT Unvrsty Mlbourn, Vctora, Australa Xun Y School of Scnc, RMIT Unvrsty Mlbourn, Vctora, Australa xun.y@rmt.du.au Ha Dong School of Scnc, RMIT Unvrsty Mlbourn, Vctora, Australa ha.dong@rmt.du.au Abstract Txt stganography mthod can b appld for protctng prvacy and authntcty of txt-basd documnts. Txt stganography s a challngng task as slght modfcaton n txt fl can b dntfd. In gnral, mprcptblty of txt stganography s vry poor. Addtonally, data hdng capacty of txt stganography s vry lss. Currnt rsarch works fal to solv both mprcptblty and capacty problms smultanously. W propos a novl data comprsson basd rvrsbl txt stganography schm addrssng both mprcptblty and capacty problms of txt stganography. Our proposd mthod mbds scrt mssag wthn txt fl as nvsbl charactr by followng a st of mbddng ruls. W prsnt xprmntal rsults that dmonstrat hghr mprcptblty and capacty of proposd mthod wthout ncrasng sz of txt fl contanng scrt nformaton. Most mportantly, our proposd mthod succssfully rtrvs scrt nformaton and rconstructs orgnal txt fl wthout any rror. Kywords: Txt stganography, Huffman codng, scurty, prvacy prsrvaton Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
3 Hghly Imprcptbl and Rvrsbl Txt Stganography Introducton Rcnt mprovmnt n Informaton and Communcaton Tchnology (ICT) producs larg volum of txt data rlatd to customrs, supplrs and opratons ownd by busnss organzatons. Mmos, busnss agrmnts, mals, rports and customr rcords ar fw xampls of txt-basd busnss data. Managng larg volum of txt-basd data by thr own s xpnsv for busnss organzatons. Cloud basd managmnt of larg volum data mnmzs th cost of data storag. Addtonally, cloud offrs scalabl storag wth ffcnt managmnt of data producd by organzatons. Hnc, busnss organzatons ar outsourcng thr bg data to thrd-party cloud for storng and managng (Lu, 2013). Data stord n th cloud ar snstv. Outsourcng data to cloud arss prvacy concrns for data ownrs (Hashm, 2015; Lu, 2014). For nstanc, stord data n th cloud can b compromsd, and ndvdual prsonal nformaton can b dsclosd (Lu, 2014). Svral cryptography mthods ar bng usd for protctng prvacy and authntcty of snstv txt-basd data n cloud. Howvr, opratons ovr cryptographcally ncryptd data ar usually complx and tm consumng (Lu, 2014). Morovr, mannglss form of ncryptd data may attract th attnton of ntrudrs (Chang, 2010). Altrnatvly, nformaton hdng tchnqu such as stganography can b usd for provsonng prvacy and authntcty of scrt nformaton. Stganography s an art of nformaton hdng that provds scrt communcaton ovr publc channl that allows avodanc of unauthorzd usrs attnton (Artz, 2001). It s manly usd for sharng scrt nformaton. Howvr, authntcty of a communcaton can b nsurd as wll by applyng stganography. For xampl, dgtal sgnaturs of two busnss parts can b hddn nsd a busnss agrmnt through a txt stganography mthod to produc a dgtally sgnd busnss agrmnt. Th sgnd busnss agrmnt can b stord n cloud. Latr, th sam txt stganography mthod can b appld to chck authntcty of th stord busnss agrmnt. In gnral, stganography mthod masks a scrt mssag n a covr mdum. Th covr mdum can b any dgtal mda such as txt (Jn'An, 2008; L, 2013; Por, 2012), mag (Subhdar, 2014), sgnal (Abuadbba, 2016), audo and vdo. A stgo mdum s producd as a rsult of maskng scrt mssag n covr mdum. Th functon that s usd to hd scrt mssag n covr mdum s calld mbddng procdur. Extracton procdur rtrvs th hddn scrt mssag from stgo mdum. Important rqurmnts of a stganography mthod ar mprcptblty, robustnss and capacty (Zakr, 2012). Imprcptblty s a masur of scurty of stganography mthod that dtrmns th lvl of prcpton of xstnc of a scrt mssag n a covr fl. Robustnss dnots th lvl of ablty to rsst altraton of scrt mssag. Capacty rfrs to amount of data that can b hddn n a covr mdum. A rvrsbl or losslss stganography approach can tak out a scrt mssag from stgo mdum and rconstruct covr mdum wthout any altraton. Thrfor, th prmary goals of stganographc approachs ar hgh mbddng capacty and low dstorton of th covr mdum (L, 2013). In ths rsarch work, w dvlop a txt-basd stganography approach. Th txt-basd stganography s challngng snc a slght modfcaton n txt contnt can b asly dscovrd (L, 2013). Hnc, th mprcptblty of txt covr mdum s vry poor. Svral rsarch works ar don on txt basd stganography. Rsarch works n (Jn'An, 2008; Yu, 2008) convrts th txt fls nto dgtal mags and mbd scrt mssag by adjustng spacng of lttrs, words or lns. As a rsult, txt fl cannot b modfd latr. Th work n (Por, 2012) hds scrt mssag as nvsbl charactr n Mcrosoft Word fl. Th work s not applcabl for othr txt format. Morovr, mbddng scrt mssag ncrass sz of stgo txt fl than covr txt fl. Fw comprsson basd tchnqus ar proposd n (Chn, 2010; L, 2013; Satr, 2012; Satr, 2014) that comprss covr txt fl bfor mbddng. Imprcptblty of txt covr fl bcoms vry lss f th covr txt fl s comprssd. Th objctv of ths rsarch s to dvlop a hghly mprcptbl and rvrsbl txt stganography mthod wth hghr capacty. Our work prsnts a hghly mprcptbl and rvrsbl txt stganography mthod basd on Huffman Cod to ncod scrt mssag. W us bnary format of scrt mssag n our papr. A scrt mssag can b data ownr s dntfcaton numbr, dgtal sgnatur of a busnss organzaton, tc. Encodd scrt mssag s mbddd nto txt covr fl as nvsbl charactrs. Customr rcords, nvocs, and busnss agrmnts can b namd as txt covr mdums. Th proposd txt stganography approach conssts of thr parts: (1) gnratng a codng tabl for a st of symbols, (2) mbddng a scrt mssag n a txt covr fl basd on th codng tabl, and (3) xtractng th hddn scrt mssag from th stgo txt fl and rconstructon of covr txt fl. A codng tabl s gnratd usng Huffman Cod that contans symbols, thr corrspondng frquncy and codword. Each codword n th codng tabl has th proprty that no codword n th Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
4 Hghly Imprcptbl and Rvrsbl Txt Stganography dctonary s a prfx of any othr codword n th dctonary (Huffman, 1952). In our approach, a n symbol s a bnary block of lngth n. Thrfor, w hav 2 possbl bnary symbols. If n 2, thn numbr of possbl symbols s Hnc, th symbols ar { 00,01,10,11}. Th codng tabl s usd to mbd th scrt mssag. Th lngth of a bnary block n s a scrt nformaton that nd to b dcdd pror to th mbddng opraton starts. Th lngth of a block nds to b passd scrtly to both mbddng and xtracton algorthm. Th gnraton procss of codng tabl s shown n Fgur 1(a). (a) (b) (c) Fgur 1. Ovrvw of Proposd Txt Stganography Approach. (a) Gnraton of Codng Tabl usng Huffman Codng Tchnqu, (b) Embddng Procdur, and (c) Extracton Procdur Th scrt mssag mbddng algorthm hds a scrt mssag nsd a txt fl usng fw stps (s Fgur 1(b)). Frst, scrt mssag s ncodd usng th codng tabl to obtan ncodd scrt mssag. Encodng scrt mssag ncrass th scurty of th stganography (Satr, 2012;Satr, 2014). Scond, mbddng algorthm dtrmns th locatons of th spac charactrs n th txts of covr txt fl. Lt, total numbr of locatons for SPACE charactrs s t. Assum that thr ar k numbr of bnary bts n th scrt mssag, whr k t. Thrd, k numbr of locatons of spac charactrs s chosn. Locaton of th spac charactrs ar slctd randomly basd on a psudo-random squnc. Th psudo-random squnc s gnratd usng a scrt ky. Th scrt ky s usd as th sd for gnratng psudo-random squnc. Sam scrt ky s usd to gnrat psudo-random squnc durng xtracton procss. Fnally, bnary bts of ncodd scrt mssag ar rplacd by nvsbl Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
5 Hghly Imprcptbl and Rvrsbl Txt Stganography Uncod charactrs basd on a rul obtanng Stgo txt fl. A stgo ky s constructd ncludng ncssary nformaton that s rqurd to xtract scrt mssag. Th xtracton algorthm has multpl stps as wll (s Fgur 1(c)). Frst, th xtracton algorthm dntfs th locatons of nvsbl charactrs. Scond, a psudo-random squnc of k lmnts s gnratd usng th sam scrt ky (.. sd) that s usd n th mbddng procss. Thrd, f an lmnt of th squnc s nvsbl charactr thn th charactr s rplacd by corrspondng bnary bt and stord as ncodd scrt bt. Th nvsbl charactrs ar rplacd by a SPACE charactr n th stgo txt fl. As a rsult, th covr txt fl s rconstructd from th stgo txt fl wth any loss of nformaton. Fnally, th xtractd ncodd scrt mssag s dcodd usng codng tabl and scrt mssag s obtand. Contrbutons of our work ar as follows: 1) Th Scrt mssag s mbddd as nvsbl charactrs. As a rsult, no alpha-numrc charactrs n stgo txt fl ar dstortd. Thrfor, mprcptblty of th stgo txt fl bcoms hghr as th prsnc of scrt mssag cannot b prcvd. 2) Our proposd mthod succssfully rconstructs th covr fl aftr xtracton of scrt mssag. Hnc, our work s fully rvrsbl or losslss. 3) Szs of covr txt fl and stgo txt fl ar sam n our proposd mthod. Thrfor, payload s zro n our mthod. 4) Th scrt mssag s dsgusd usng Huffman Cod. Hnc, th lngth of scrt mssag s rducd and mbddng capacty s mprovd. Th rst of th papr s organzd as follows. W brfly dscrb rcnt rlvant work n Rlatd Work scton. In nxt Scton, w dscuss our proposd hghly mprcptbl and rvrsbl txt stganography mthod. W show th rsult of our xprmnts and dscuss th prformanc of our proposd txt stganography mthod n Exprmntal Rsults and Prformanc Analyss Scton. Fnally, Scton Concluson concluds th papr. Rlatd Work Svral txt basd stganography schms hav bn proposd tll dat. W dscrb som of th rcnt rsarch works rlatd to txt stganography approachs. Rsarch works n (Jn'An, 2008;Yu, 2008) convrts th txt fls nto dgtal mags frst. Latr, th scrt mssag s mbddd by modratly adjustng th spacng of lttrs, words, or lns. Th dsadvantag of convrtng txt fls nto mags s that th txts n covr fl cannot b modfd furthr onc convrtd nto mags. A dgnratng documnt contnt basd txt stganography mthod s dscussd n (Lu, 2007). Txt sgmnts ar dgnratd by nfror wrtng. Nxt, th documnt s rvsd usng chang trackng n Mcrosoft Word documnts. Th scrt mssag s mbddd n th chang trackng and th stgo fl s snt to th rcvr. Th rcvr xtracts th scrt nformaton by usng chang trackng n Mcrosoft Word documnts. Th lmtaton of ths approach s that larg amount of dtng ruls nds to b stord. Morovr, th hdng capacty s vry low. Anothr documnt basd work n (Por, 2012) that s rfrrd as UnSpaCh. Th work mbds scrt nformaton n Mcrosoft Word documnt. UnSpaCh consdrs combnaton of ntr-word, ntr-sntnc, nd-of-ln and ntr-paragraph spacng to mbd scrt nformaton n a documnt. In UnSpaCh, a two bts combnaton of scrt nformaton s rplacd by a Uncod spac charactrs and mbddd n th covr documnt. Th mappng of bt combnatons and Uncod spac charactrs ar shard as a ky pror to th communcaton. In ordr to mprov th scurty of th stganography mthod, th scrt nformaton s ncryptd bfor data mbddng. Howvr, ths approach cannot b usd for othr txt fl format. Addtonally, mbddng scrt mssag ncrass sz of stgo txt fl than covr txt fl. Comprsson basd txt stganographc mthods ar addrssd n (Chn, 2010; L, 2013;Satr, 2012;Satr, 2014). Th work n (Chn, 2010) hds th scrt mssag n th comprsson cods usng Lmpl-Zv-Wlch (LZW) mthod. Ths schm mbds scrt data n LZW comprsson cods by rducng symbol lngth. Anothr rsarch work n (L, 2013) proposd a losslss txt stganography mthod by Huffman Comprsson Codng. A modfd Huffman Codng, namd varabl Huffman codng, s usd n ths work to gnrat codwords for symbols n th covr fl. Scrt data s thn mbddd n th codwords. Rsarch works n (Satr, 2012) and (Satr, 2014) us LZW and Huffman cod basd comprsson tchnqus, rspctvly. Emal s consdrd as covr mdum. Scrt mssag s mbddd n txts of mal body from th prvously constructd txt bas. Latr, mal s Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
6 Hghly Imprcptbl and Rvrsbl Txt Stganography comprssd to produc stgo txt. Th aformntond comprsson basd stganography mthods comprss th covr fl to ncras mbddng capacty and rduc transmsson cost. Howvr, th dsadvantag of comprssng covr fl s that th mprcptblty of stgo fl s vry poor. As a rsult, stgo fl bcoms mor pron to attack. Morovr, codwords nd to b rcalculatd f th contnt of th covr fl s changd. Proposd Rvrsbl Txt Stganography Approach W dscuss our proposd rvrsbl txt stganography approach n ths scton. W us txt fl as our covr mdum. W assum that w hav a txt fl H that has p charactrs. Formally, H can b dnotd as H h, h,, h }. A scrt mssag M contans m bnary bts and dnotd { 1 2 p by M { b1, b2,, bm }. Our proposd schm has thr man stps: (1) ncodng scrt mssag, (2) mbddng ncodd mssag nto covr txt fl, and (3) xtractng ncodd scrt mssag and rconstructon of covr txt fl. Th aformntond stps of our proposd mthod ar dscrbd n th followng subsctons. Fgur 2. Gnratd Huffman Tr for Bnary Scrt Mssag Encodng Scrt Mssag W us Huffman codng (Huffman, 1952) to ncod scrt mssag M. Stps of ncodng M ar dscrbd blow: Stp-1: Idntfy st of unqu symbols S s, s,, s } n M and corrspondng Stp-2: Stp-3: { 1 2 n frquncs F f, f,, f }, whr n s th numbr of unqu symbols n M. In ordr to { 1 2 n do ths, choos a postv ntgr d that dvds th numbr of bts m n M (.., m and m 2 d 2 valu of n s d ). Hr, d dtrmns th numbr of bts n a symbol. Thrfor, maxmum 2 d. Sort lmnts s of S n ncrasng ordr accordng to thr occurrnc frquncs f n F, whr 1 n. Rmov th two last frqunt lmnts from S and mak ach lmnt a laf nod. Nxt, crat a nw nod as a parnt nod of th two laf nods wth a frquncy computd by summng th frquncs of ts two chld nods. Two bnary bts, 0 and 1, ar thn assgnd to th lft dg and rght dg of th nw nod, rspctvly. Stp-4: Insrt th nw cratd nod and ts frquncy nto st S and F, rspctvly. Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
7 Hghly Imprcptbl and Rvrsbl Txt Stganography Stp-5: Stp-6: Rpat Stps 2-4 untl th root nod s obtand. Hnc, th Huffman tr s gnratd. Each symbol s s assgnd a unqu bnary strng (codword) by travrsng th Huffman tr from th root nod to ach laf nod aftr constructng th Huffman tr. Formally, th st of codwords s dnotd by W w, w,, w }, whr n s th numbr of symbols as { 1 2 n wll as codwords. A codng Tabl T s obtand that can b xprssd as T S F, W,. Stp-7: Substtut th orgnal symbols by corrspondng codwords accordng to T obtanng an ncodd scrt mssag M { m 1, m 2,, m k }, whr m s a bt of ncodd scrt mssag( 1 k ) and k s th numbr of bts of ncodd scrt mssag ( k m ). Tabl 1. Th Codng Tabl, T Symbol Codword Frquncy Tabl 1. Th Codng Tabl, T Exampl 1: Encodng Scrt Mssag Assum that w hav th followng bnary scrt mssag for ncodng usng th aformntond stps: Th lngth of bnary scrt mssag s m mssag s d 4. Hr, d m and m 2 d 2. Lt, th numbr of bts n a symbol of th scrt. Hnc, th maxmum numbr of unqu symbols s Th st of unqu symbols n bnary scrt mssag s S = {0000,0001,001 0,001 1,01 00,01 01,01 1 0,01 1 1,1 000,1 001,1 01 0, }. Hr, th numbr of unqu symbols n gvn bnary scrt mssag s S 12. Th st of frquncs of symbols n S ar F = {4, 3, 3, 5, 5, 1, 2, 3, 1, 1, 1, 1}. Rsultng Huffman tr for th bnary scrt mssag s shown n Fgur 2. Nxt, codword s obtand for ach symbol n S from th Huffman tr and a codng tabl T s gnratd. Th codng tabl T s prsntd n Tabl 1 contanng symbols n bnary scrt mssag, thr corrspondng codwords that s obtand from th Huffman tr and frquncs. Now, ach symbol of bnary scrt mssag s rplacd by corrspondng codword statd n T. For xampl, symbol ' ' s rplacd by ' 11 1', ' 0001 ' s rplacd by ' 001 ', and so on. As a rsult, w gt th followng ncodd scrt mssag for th gvn scrt mssag: Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
8 Hghly Imprcptbl and Rvrsbl Txt Stganography Th ncodd scrt mssag has 1 01 bts,.. k 1 01 usng Huffman codng rducs scrt mssag sz. Embddng Scrt Mssag Th obtand ncodd scrt mssag M. Thrfor, ncodng th bnary scrt mssag s mbddd n covr txt fl H to gnrat stgo txt fl H. Formally, H s dnotd as H h, h,, h }, whr p s th numbr of charactrs n H. Th { 1 2 p stps of mbddng scrt mssag ar statd blow: Stp-1: Copy all th charactrs of H nto H. Stp-2: Fnd a st E that contans ndxs of SPACE charactrs n H. Formally, E s dnotd as E { 1 j t,1 p, h SPACE }. Hr, t s th total numbr of SPACE charactrs n H. j j j Stp-3: A psudo-random squnc R wth k lmnts s gnratd usng a psudo-random squnc gnrator sd. Th valu of an lmnt of R must b btwn 1 and p. Formally, R s dnotd as R { r 1 k,1 r p } r { j 1 j t } ).. Hr, r rfrs to an ndx of E (.., Stp-4: Each m s mbddd at j th ndx of H such that r { j 1 j t }. Instad of mbddng a scrt bt drctly, an nvsbl charactr s mbddd. Assum that w hav two nvsbl charactrs: and. In ordr to mbd a scrt bt m, an nvsbl charactr rplacs a SPACE charactr at h j usng th followng rul: h j f f m m 0 1 (1) Fnally, th stgo txt fl H s obtand. Fgur 3. Rlatonshp among H, H, E, R and M Gnraton of Stgo Ky A stgo ky K s constructd at th nd of mbddng procdur n ordr to xtract scrt mssag and rconstruct covr txt fl. Th stgo ky ncluds codng tabl ( T ), numbr of bts n ncodd scrt mssag ( k ), sd ( ) for gnratng psudo-random squnc and valus of two nvsbl charactrs and. Formally, K s dfnd as a tupl K T, k,,,. Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
9 Hghly Imprcptbl and Rvrsbl Txt Stganography Exampl 2: Embddng Scrt Mssag Consdr that w hav a txt fl H. W plan to mbd ncodd scrt mssag numbr of bts n M s 1 01 M wthn H. Lt, k. Th contnt of H s copd to anothr fl H. Nxt, a st E s gnratd contanng th ndxs of spac charactrs n H. Assum that numbr of spacs n H s 1 85 ( t 1 85 ). Hnc, Th numbr of lmnts E s 1 85 (.., E 1 85 ). A psudo random squnc R wth 1 01 lmnts s gnratd usng a sd 119. Hr, lmnts of R rang btwn 1 and An lmnt of R rfrs to an ndx of E. For xampl, th frst lmnt of R rfrs to th 19th ndx of E, th scond lmnt of R rfrs to th 7th ndx of E, and so on. Nxt, a bt m of ncodd scrt mssag M s to b mbddd n H. Th frst bt 1 of ncodd scrt mssag s to b mbddd at th ndx dnotd by th 19th lmnt of E. Consdr, 19th lmnt of E contans a valu Thrfor, th frst ncodd scrt bt 1 should b mbddd at ndx 7 61 of H. Rlatonshp among H, H, E, R and M s llustratd n Fgur 3. Instad of mbddng a bnary bt, w rplac a bnary bt by an nvsbl charactr accordng to a rul spcfd n Equaton 1. Consdr that w slct SPACE and NULL as two nvsbl charactrs,.., SPACE and NULL. If a bt of th ncodd scrt mssag s 0, thn SPACE charactr of H at a locaton accordng to psudo random squnc s rplacd by SPACE. On th othr hand, SPACE charactr of H at a locaton accordng to psudo random squnc s rplacd by NULL If a bt of th ncodd scrt mssag s 1. Prformng th opraton for all of th ncodd scrt bts, H bcoms th stgo txt fl. Aftr gnratng th stgo fl, a stgo ky K T, k,,, s constructd as K T, 1 01,119, SPACE, NULL. Extractng Scrt Mssag and Rconstructon of Covr txt fl Th objctv of ths procdur s to xtract th scrt mssag from stgo txt fl H h, h,, h }, { 1 2 p whr p s th numbr of charactrs n H. Addtonally, covr txt fl H s rconstructd n ths procdur. Extracton of scrt mssag and rconstructon of H rqurs stgo ky K. Th stps ar dscussd blow: Stp-1: Fnd a st E that contans th locatons of nvsbl charactrs n H. Formally, E s dfnd as E { 1 j t,1 q, h h }. Hr, t s th total numbr of and. j j j j Stp-2: A psudo-random squnc R wth k lmnts s gnratd usng sd. R s dnotd as R { r 1 k,1 r q }. Hr, r rfrs to an ndx of E (.., { j 1 j t } ). Stp-3: Crat a st M { m, m,, m } of lngth 1 2 k k to hold th xtractd ncodd bts of scrt mssag. r Stp-4: Chck th j followng rul: charactr of H (.., h ) whr j r, and nsrt 0 or 1 at m basd on th j m 0 1 f f h h j j (2) Stp-5: Substtut j th charactr of H by SAPCE charactr f Stp-6: Rpat Stp 4-5 for ach txt fl. H s th rconstructd covr txt fl. h. j r R to obtan ncodd scrt mssag M and rconstruct covr Stp-7: Crat an mpty st M to hold dcodd scrt mssag bts. Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
10 Hghly Imprcptbl and Rvrsbl Txt Stganography Stp-8: Each codword s dntfd n M and dcodd usng th codng tabl T. Each dcodd symbol s addd to M. Fnally, bnary scrt mssag M s obtand. Exampl 3: Extractng Scrt Mssag and Rconstructon of Covr txt fl Assum that w hav stgo ky cratd that contans ndxs of nvsbl charactrs K T, k,,, as K T 1 01,1 1 9, SPACE, NULL,. A st E s SPACE and NULL. Th numbr of lmnts of E s E Subsquntly, a psudo-random squnc R wth k 1 01 lmnts s cratd usng sd Hr, R s smlar to th psudo-random squnc R that s gnratd durng mbddng procdur du to sam sd Elmnts of R rang btwn 1 and An lmnt of R rfrs to an ndx of E. Nxt, a st M wth k 1 01 lmnts s cratd for holdng ncodd scrt bts. Assum that frst lmnt of R s 19. Hnc, charactr at a locaton of H that s pontd by th 19th lmnt of E s chckd and mbddd bt s rtrvd usng Equaton 2. If th charactr s SPACE thn add 0 to th frst ndx of M. Add 1 to th frst ndx of M f th charactr s NULL, and rplac NULL charactr by SPACE charactr. Sam procdur nds to b followd for vry lmnt of R. As a rsult, w gt a st of ncodd scrt mssag rconstructd covr txt fl H, and M and H H. Aftrwards, an mpty st M s cratd. Nxt, ach codword n M s dntfd and dcodd usng codng tabl T (s Tabl 1). Fnally, w gt M as bnary scrt mssag. Exprmntal Rsults and Prformanc Analyss A st of xprmnts ar carrd out to valuat th prformanc of our proposd txt stganography approach n trms of thr paramtrs: mbddng capacty (EC), bt rror rat (BER) and mprcptblty. In partcular, EC masurs bt rat that s th sz of scrt mssag rlatv to sz of covr txt fl (Dsoky, 2009). EC s calculatd as follows: BER of xtractd scrt mssag s a masur that dtrmns th corrcton capablts of a stganography approach. BER s th rato (n prcntag) btwn numbr of bts that s xtractd corrctly and numbr of bts of orgnal scrt mssag (Abuadbba, 2016). BER can b dfnd as follows: Imprcptblty of a stganography mthod dtrmns th lvl of prcpton of th prsnc of scrt mssag nsd a fl (Subhdar, 2014). Th mprcptblty of a txt basd stganography s hghr f rlatv changs of charactrs btwn covr and stgo txt fl ar lowr. Exprmnts ar prformd on Intl(R) Cor(TM) GHz prsonal computr wth 8 GB RAM. Softwar for th proposd mthod s dvlopd n Java programmng languag. A larg txt fl s chosn as covr txt fl from URL: Dffrnt szs (n bts) of scrt mssag ar xamnd to valuat th prformanc of our proposd approach. In Tabl 2, mbddng capacty (EC) bfor and aftr ncodng th scrt mssag has bn dmonstratd. Th sz of our sampl covr fl s bts. W xamn th mbddng capacty of our proposd mthod for multpl scrt mssags wth dffrnt lngth. It s found that mbddng capacty s mprovd aftr ncodng th scrt mssag. Tabl 3 llustrats valus of bt rror rat (BER) of our proposd mthod for dffrnt scrt mssags. It s found that BER s 0% for ach scrt mssag. (3) (4) Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
11 Hghly Imprcptbl and Rvrsbl Txt Stganography In Fgur 4, t s dmonstratd that th prsnc of scrt mssag n stgo fl cannot b prcvd. Fgur 4(a) and 4(b) rprsnt covr fl and stgo fl rspctvly. Hnc, th mprcptblty of our proposd mthod s vry hgh. Covr Fl Sz (n bts) Tabl 2. Embddng Capacty of Proposd Mthod Scrt Mssag Encodd Scrt EC (%) Sz (n bts) Mssag Sz Bfor (n Bts) Encodng Tabl 2. Embddng Capacty of Proposd Mthod EC (%) Aftr Encodng Tabl 3. Bt Error Rat (BER) of Proposd Mthod Scrt Mssag Sz (n bts) Bts Rtrvd Corrctly BER (%) Tabl 3. Bt Error Rat (BER) of Proposd Mthod (a) Fgur 4. Dmonstraton of Imprcptblty of Proposd mthod. (a) Covr Txt Fl and (b) Stgo Txt Fl (b) It s worthwhl mntonng that sz of covr fl and stgo fl n our proposd stganography mthod ar sam. Thrfor, our stganography mthod has no payload. Addtonally, th prcntag of charactrs of covr fl that ar succssfully rconstructd aftr xtracton of scrt mssags and Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
12 Hghly Imprcptbl and Rvrsbl Txt Stganography th numbr of charactrs n covr fl s always sam (s Fgur 5). Hnc, our proposd txt stganography mthod s fully rvrsbl. In Tabl 4, our proposd mthod s compard wth othr mostly rlvant rsarch works. Comparson s prformd n trms of mprcptblty and payload ncurrd. Rsarch works n (Chn, 2010;L, 2013;Satr, 2012;Satr, 2014) comprss covr fl to produc stgo fl. Hnc, mprcptblty bcoms vry poor. On th othr hand, our proposd mthod usd comprsson codng tchnqu to rduc th lngth of scrt mssag. Thrfor, mprcptblty of our proposd mthod s vry hgh. Th work n (Por, 2012) hds scrt mssag as nvsbl charactr wthn words, sntncs and paragraphs. Th sz of stgo fl s hghr than covr fl that rsults n payload. In contrast, our proposd mthod has 0% payload. Fgur 5. Rvrsblty of Proposd Mthod Tabl 4. Comparson of Imprcptblty and Payload Crtra Mthod Dscusson Imprcptblty Payload Concluson (Chn, 2010) (L, 2013) (Satr, 2012) (Satr, 2014) Our proposd mthod (Por, 2012) Our proposd mthod Stgo txt fl s producd by comprssng covr fl. Thrfor, mprcptblty s vry poor and pron to attack. Scrt mssag s ncodd usng comprsson codng tchnqu and mbddd n covr fl to produc stgo ky. Thrfor, mprcptblty s vry hgh. A block of scrt mssag s mbddd as a block of nvsbl Uncod charactrs wthn words, sntncs and paragraphs. Th sz of stgo fl s hghr than that of covr fl. A bt of ncodd scrt mssag s mbddd as an nvsbl charactr btwn words by rplacng spac charactr. Payload s 0% as th fl szs of stgo fl and covr fl ar sam. Tabl 4. Comparson of Imprcptblty and Payload Outsourcng txt-basd busnss documnts to cloud arss prvacy concrns for busnss organzatons. Svral cryptography mthods ar bng usd for protctng prvacy and authntcty of snstv txt-basd data n cloud. Howvr, opratons ovr cryptographcally ncryptd data ar usually complx and tm consumng. Morovr, mannglss form of ncryptd data may attract th attnton of ntrudrs. Altrnatvly, stganography mthods can b usd to provd prvacy and authntcty of outsourcd txt-basd busnss data. In ths papr, w hav proposd a novl txt stganography tchnqu. W us Huffman codng tchnqu to ncod scrt mssag bfor mbddng. As a rsult, sz of scrt mssag s rducd. Th scrt mssag s mbddd n th covr txt fl as nvsbl charactr wthout affctng th txts n covr fl. Thrfor, our proposd Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
13 Hghly Imprcptbl and Rvrsbl Txt Stganography mthod s hghly mprcptbl. From th xprmntal rsults, t s shown that proposd mthod mprovs hdng capacty. Addtonally, our proposd mthod ncurs no payload to stgo fl. In othr words, szs of th covr fl and stgo fl ar sam. Our proposd txt stganography schm succssfully rtrvs scrt nformaton and rconstructs covr txt fl wthout any rror. As a futur work, w plan to mprov th hdng capacty whl kpng th mprcptblty hghr. Rfrncs Artz, D "Dgtal stganography: hdng data wthn data." IEEE Intrnt computng 5(3): Abuadbba, A., t al "Rslnt to shard spctrum nos schm for protctng cogntv rado smart grd radngs BCH basd stganographc approach." Ad Hoc Ntworks 41: Chn, C.-C. and C.-C. Chang Hgh-capacty rvrsbl data-hdng for LZW cods. Computr Modlng and Smulaton, ICCMS'10. Scond Intrnatonal Confrnc on, IEEE. Chang, C.-C. and T. D. Ku "A rvrsbl data hdng schm usng complmntary mbddng stratgy". Informaton Scncs 180(16): Dsoky, A "Lstga: lst-basd stganography mthodology." Intrnatonal Journal of Informaton Scurty 8(4): Huffman, D. A "A mthod for th constructon of mnmum-rdundancy cods". Procdngs of th IRE 40(9): Hashm, I. A. T., t al "Th rs of bg data on cloud computng: Rvw and opn rsarch ssus". Informaton Systms 47: Jn'An, L., t al A txt dgtal watrmarkng for Chns word documnt. Computr Scnc and Computatonal Tchnology, ISCSCT'08. Intrnatonal Symposum on, IEEE. L, C.-F. and H.-L. Chn Losslss txt stganography n comprsson codng. Rcnt Advancs n Informaton Hdng and Applcatons, Sprngr: Lu, T.-Y. and W.-H. Tsa "A nw stganographc mthod for data hdng n mcrosoft word documnts by a chang trackng tchnqu". IEEE Transactons on Informaton Fornscs and Scurty 2(1): Lu, C.-W., t al An mprovmnt to data srvc n cloud computng wth contnt snstv transacton, analyss and adaptaton. Computr Softwar and Applcatons Confrnc Workshops (COMPSACW), 2013 IEEE 37th Annual, IEEE. Lu, R., t al "Toward ffcnt and prvacy-prsrvng computng n bg data ra." IEEE Ntwork 28(4): Ln, H.-Y. and W.-G. Tzng "A scur rasur cod-basd cloud storag systm wth scur data forwardng". IEEE transactons on paralll and dstrbutd systms 23(6): Por, L. Y., t al "UnSpaCh: A txt-basd data hdng mthod usng Uncod spac charactrs". Journal of Systms and Softwar 85(5): Subhdar, M. S. and V. H. Mankar "Currnt status and ky ssus n mag stganography: A survy". Computr scnc rvw 13: Satr, E. and H. Isk "A comprsson-basd txt stganography mthod." Journal of Systms and Softwar 85(10): Satr, E. and H. Isk "A Huffman comprsson basd txt stganography mthod". Multmda Tools and Applcatons 70(3): Yu, J., t al A fragl documnt watrmarkng tchnqu basd on wt papr cod. Intllgnt Informaton Hdng and Multmda Sgnal Procssng, IIHMSP'08 Intrnatonal Confrnc on, IEEE. Zakr, N. and A. Hamzh "A novl stganalyss for TPVD stganographc mthod basd on dffrncs of pxl dffrnc hstogram". Multmda Tools and Applcatons 58(1): Twnty Frst Pacfc Asa Confrnc on Informaton Systms, Langkaw 2017
10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D
Comp 35 Introducton to Machn Larnng and Data Mnng Fall 204 rofssor: Ron Khardon Mxtur Modls Motvatd by soft k-mans w dvlopd a gnratv modl for clustrng. Assum thr ar k clustrs Clustrs ar not rqurd to hav
More informationJournal of Theoretical and Applied Information Technology 10 th January Vol. 47 No JATIT & LLS. All rights reserved.
Journal o Thortcal and Appld Inormaton Tchnology th January 3. Vol. 47 No. 5-3 JATIT & LLS. All rghts rsrvd. ISSN: 99-8645 www.att.org E-ISSN: 87-395 RESEARCH ON PROPERTIES OF E-PARTIAL DERIVATIVE OF LOGIC
More informationLucas Test is based on Euler s theorem which states that if n is any integer and a is coprime to n, then a φ(n) 1modn.
Modul 10 Addtonal Topcs 10.1 Lctur 1 Prambl: Dtrmnng whthr a gvn ntgr s prm or compost s known as prmalty tstng. Thr ar prmalty tsts whch mrly tll us whthr a gvn ntgr s prm or not, wthout gvng us th factors
More informationCOMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP
ISAHP 00, Bal, Indonsa, August -9, 00 COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP Chkako MIYAKE, Kkch OHSAWA, Masahro KITO, and Masaak SHINOHARA Dpartmnt of Mathmatcal Informaton Engnrng
More informationSoft k-means Clustering. Comp 135 Machine Learning Computer Science Tufts University. Mixture Models. Mixture of Normals in 1D
Comp 35 Machn Larnng Computr Scnc Tufts Unvrsty Fall 207 Ron Khardon Th EM Algorthm Mxtur Modls Sm-Suprvsd Larnng Soft k-mans Clustrng ck k clustr cntrs : Assocat xampls wth cntrs p,j ~~ smlarty b/w cntr
More informationON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS
MATEMATICA MONTISNIRI Vol XL (2017) MATEMATICS ON TE COMPLEXITY OF K-STEP AN K-OP OMINATIN SETS IN RAPS M FARAI JALALVAN AN N JAFARI RA partmnt of Mathmatcs Shahrood Unrsty of Tchnology Shahrood Iran Emals:
More informationAuthentication Transmission Overhead Between Entities in Mobile Networks
0 IJCSS Intrnatonal Journal of Computr Scnc and twork Scurty, VO.6 o.b, March 2006 Authntcaton Transmsson Ovrhad Btwn Entts n Mobl tworks Ja afr A-Sararh and Sufan Yousf Faculty of Scnc and Tchnology,
More informationGroup Codes Define Over Dihedral Groups of Small Order
Malaysan Journal of Mathmatcal Scncs 7(S): 0- (0) Spcal Issu: Th rd Intrnatonal Confrnc on Cryptology & Computr Scurty 0 (CRYPTOLOGY0) MALAYSIA JOURAL OF MATHEMATICAL SCIECES Journal hompag: http://nspm.upm.du.my/ournal
More informationLecture 23 APPLICATIONS OF FINITE ELEMENT METHOD TO SCALAR TRANSPORT PROBLEMS
COMPUTTION FUID DYNMICS: FVM: pplcatons to Scalar Transport Prolms ctur 3 PPICTIONS OF FINITE EEMENT METHOD TO SCR TRNSPORT PROBEMS 3. PPICTION OF FEM TO -D DIFFUSION PROBEM Consdr th stady stat dffuson
More informationA Note on Estimability in Linear Models
Intrnatonal Journal of Statstcs and Applcatons 2014, 4(4): 212-216 DOI: 10.5923/j.statstcs.20140404.06 A Not on Estmablty n Lnar Modls S. O. Adymo 1,*, F. N. Nwob 2 1 Dpartmnt of Mathmatcs and Statstcs,
More informationOutlier-tolerant parameter estimation
Outlr-tolrant paramtr stmaton Baysan thods n physcs statstcs machn larnng and sgnal procssng (SS 003 Frdrch Fraundorfr fraunfr@cg.tu-graz.ac.at Computr Graphcs and Vson Graz Unvrsty of Tchnology Outln
More informationHigher order derivatives
Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of
More informationSearch sequence databases 3 10/25/2016
Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an
More informationPhysics of Very High Frequency (VHF) Capacitively Coupled Plasma Discharges
Physcs of Vry Hgh Frquncy (VHF) Capactvly Coupld Plasma Dschargs Shahd Rauf, Kallol Bra, Stv Shannon, and Kn Collns Appld Matrals, Inc., Sunnyval, CA AVS 54 th Intrnatonal Symposum Sattl, WA Octobr 15-19,
More informationThe Hyperelastic material is examined in this section.
4. Hyprlastcty h Hyprlastc matral s xad n ths scton. 4..1 Consttutv Equatons h rat of chang of ntrnal nrgy W pr unt rfrnc volum s gvn by th strss powr, whch can b xprssd n a numbr of dffrnt ways (s 3.7.6):
More informationReview - Probabilistic Classification
Mmoral Unvrsty of wfoundland Pattrn Rcognton Lctur 8 May 5, 6 http://www.ngr.mun.ca/~charlsr Offc Hours: Tusdays Thursdays 8:3-9:3 PM E- (untl furthr notc) Gvn lablld sampls { ɛc,,,..., } {. Estmat Rvw
More informationCHAPTER 7d. DIFFERENTIATION AND INTEGRATION
CHAPTER 7d. DIFFERENTIATION AND INTEGRATION A. J. Clark School o Engnrng Dpartmnt o Cvl and Envronmntal Engnrng by Dr. Ibrahm A. Assakka Sprng ENCE - Computaton Mthods n Cvl Engnrng II Dpartmnt o Cvl and
More informationNaresuan University Journal: Science and Technology 2018; (26)1
Narsuan Unvrsty Journal: Scnc and Tchnology 018; (6)1 Th Dvlopmnt o a Corrcton Mthod or Ensurng a Contnuty Valu o Th Ch-squar Tst wth a Small Expctd Cll Frquncy Kajta Matchma 1 *, Jumlong Vongprasrt and
More informationOptimal Ordering Policy in a Two-Level Supply Chain with Budget Constraint
Optmal Ordrng Polcy n a Two-Lvl Supply Chan wth Budgt Constrant Rasoul aj Alrza aj Babak aj ABSTRACT Ths papr consdrs a two- lvl supply chan whch consst of a vndor and svral rtalrs. Unsatsfd dmands n rtalrs
More informationCandidate Generation for Interactive Chinese Speech Recognition
Canddat Gnraton for ntractv Chns Spch Rcognton Xnhu L 1 2 Xangdong Wang 1 Yulang Qan 1 Shouxun Ln 1 1 Ky Laboratory of ntllgnt nformaton Procssng nsttut of Computng Tchnology Chns Acadmy of Scncs Bng 100190
More informationComputing and Communications -- Network Coding
89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc
More information2. Grundlegende Verfahren zur Übertragung digitaler Signale (Zusammenfassung) Informationstechnik Universität Ulm
. Grundlgnd Vrfahrn zur Übrtragung dgtalr Sgnal (Zusammnfassung) wt Dc. 5 Transmsson of Dgtal Sourc Sgnals Sourc COD SC COD MOD MOD CC dg RF s rado transmsson mdum Snk DC SC DC CC DM dg DM RF g physcal
More informationStudy of Dynamic Aperture for PETRA III Ring K. Balewski, W. Brefeld, W. Decking, Y. Li DESY
Stud of Dnamc Aprtur for PETRA III Rng K. Balws, W. Brfld, W. Dcng, Y. L DESY FLS6 Hamburg PETRA III Yong-Jun L t al. Ovrvw Introducton Dnamcs of dampng wgglrs hoc of machn tuns, and optmzaton of stupol
More informationAnalyzing Frequencies
Frquncy (# ndvduals) Frquncy (# ndvduals) /3/16 H o : No dffrnc n obsrvd sz frquncs and that prdctd by growth modl How would you analyz ths data? 15 Obsrvd Numbr 15 Expctd Numbr from growth modl 1 1 5
More informationCHAPTER 33: PARTICLE PHYSICS
Collg Physcs Studnt s Manual Chaptr 33 CHAPTER 33: PARTICLE PHYSICS 33. THE FOUR BASIC FORCES 4. (a) Fnd th rato of th strngths of th wak and lctromagntc forcs undr ordnary crcumstancs. (b) What dos that
More informationExternal Equivalent. EE 521 Analysis of Power Systems. Chen-Ching Liu, Boeing Distinguished Professor Washington State University
xtrnal quvalnt 5 Analyss of Powr Systms Chn-Chng Lu, ong Dstngushd Profssor Washngton Stat Unvrsty XTRNAL UALNT ach powr systm (ara) s part of an ntrconnctd systm. Montorng dvcs ar nstalld and data ar
More informationConstruction of asymmetric orthogonal arrays of strength three via a replacement method
isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy
More informationBinary Decision Diagram with Minimum Expected Path Length
Bnary Dcson Dagram wth Mnmum Expctd Path Lngth Y-Yu Lu Kuo-Hua Wang TngTng Hwang C. L. Lu Dpartmnt of Computr Scnc, Natonal Tsng Hua Unvrsty, Hsnchu 300, Tawan Dpt. of Computr Scnc and Informaton Engnrng,
More information1 Minimum Cut Problem
CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms
More informationOPTIMAL TOPOLOGY SELECTION OF CONTINUUM STRUCTURES WITH STRESS AND DISPLACEMENT CONSTRAINTS
Th Svnth East Asa-Pacfc Confrnc on Structural Engnrng & Constructon August 27-29, 1999, Koch, Japan OPTIMAL TOPOLOGY SELECTION OF CONTINUUM STRUCTURES WITH STRESS AND DISPLACEMENT CONSTRAINTS Qng Quan
More informationte Finance (4th Edition), July 2017.
Appndx Chaptr. Tchncal Background Gnral Mathmatcal and Statstcal Background Fndng a bas: 3 2 = 9 3 = 9 1 /2 x a = b x = b 1/a A powr of 1 / 2 s also quvalnt to th squar root opraton. Fndng an xponnt: 3
More informationA New Partially Blind Signature Based on Factoring and Discrete Logarithms
Journal of Mathmatcs and Statstcs 4 (2): 124-129, 2008 ISSN 1549-3644 2008 Scnc Publcatons A Nw Partally Blnd Sgnatur Basd on Factorng and Dscrt Logarthms N.M.F. Tahat, S.M.A. Shatnaw and E.S. Ismal School
More informationConstruction of Aho Corasick Automaton in Linear Time for Integer Alphabets
Constructon of Aho Corasck Automaton n Lnar Tm for Intgr Alphabts Shr Dor Gad M. Landau Unvrsty of Hafa Unvrsty of Hafa & Polytchnc Unvrsty Abstract W prsnt a nw smpl algorthm that constructs an Aho Corasck
More information??? Dynamic Causal Modelling for M/EEG. Electroencephalography (EEG) Dynamic Causal Modelling. M/EEG analysis at sensor level. time.
Elctroncphalography EEG Dynamc Causal Modllng for M/EEG ampltud μv tm ms tral typ 1 tm channls channls tral typ 2 C. Phllps, Cntr d Rchrchs du Cyclotron, ULg, Blgum Basd on slds from: S. Kbl M/EEG analyss
More informationAim To manage files and directories using Linux commands. 1. file Examines the type of the given file or directory
m E x. N o. 3 F I L E M A N A G E M E N T Aim To manag ils and dirctoris using Linux commands. I. F i l M a n a g m n t 1. il Examins th typ o th givn il or dirctory i l i l n a m > ( o r ) < d i r c t
More informationA NEW GENERALISATION OF SAM-SOLAI S MULTIVARIATE ADDITIVE GAMMA DISTRIBUTION*
A NEW GENERALISATION OF SAM-SOLAI S MULTIVARIATE ADDITIVE GAMMA DISTRIBUTION* Dr. G.S. Davd Sam Jayakumar, Assstant Profssor, Jamal Insttut of Managmnt, Jamal Mohamd Collg, Truchraall 620 020, South Inda,
More informationA Sub-Optimal Log-Domain Decoding Algorithm for Non-Binary LDPC Codes
Procdings of th 9th WSEAS Intrnational Confrnc on APPLICATIONS of COMPUTER ENGINEERING A Sub-Optimal Log-Domain Dcoding Algorithm for Non-Binary LDPC Cods CHIRAG DADLANI and RANJAN BOSE Dpartmnt of Elctrical
More informationAn Efficient Algorithm for Mining Frequent Itemests over the Entire History of Data Streams
An Ecnt Algorthm or Mnng Frqunt Itmsts ovr th Entr Hstory o Data Strams Hua-Fu L, Suh-Yn L and Man-Kwan Shan Dpartmnt o Computr Scnc and Inormaton Engnrng, Natonal Chao-Tung Unvrsty, No. 00 Ta Hsuh Road,
More informationChapter 6 Student Lecture Notes 6-1
Chaptr 6 Studnt Lctur Nots 6-1 Chaptr Goals QM353: Busnss Statstcs Chaptr 6 Goodnss-of-Ft Tsts and Contngncy Analyss Aftr compltng ths chaptr, you should b abl to: Us th ch-squar goodnss-of-ft tst to dtrmn
More informationST 524 NCSU - Fall 2008 One way Analysis of variance Variances not homogeneous
ST 54 NCSU - Fall 008 On way Analyss of varanc Varancs not homognous On way Analyss of varanc Exampl (Yandll, 997) A plant scntst masurd th concntraton of a partcular vrus n plant sap usng ELISA (nzym-lnkd
More informationJones vector & matrices
Jons vctor & matrcs PY3 Colást na hollscol Corcagh, Ér Unvrst Collg Cork, Irland Dpartmnt of Phscs Matr tratmnt of polarzaton Consdr a lght ra wth an nstantanous -vctor as shown k, t ˆ k, t ˆ k t, o o
More informationLecture 3: Phasor notation, Transfer Functions. Context
EECS 5 Fall 4, ctur 3 ctur 3: Phasor notaton, Transfr Functons EECS 5 Fall 3, ctur 3 Contxt In th last lctur, w dscussd: how to convrt a lnar crcut nto a st of dffrntal quatons, How to convrt th st of
More informationAn Overview of Markov Random Field and Application to Texture Segmentation
An Ovrvw o Markov Random Fld and Applcaton to Txtur Sgmntaton Song-Wook Joo Octobr 003. What s MRF? MRF s an xtnson o Markov Procss MP (D squnc o r.v. s unlatral (causal: p(x t x,
More informationA Distributed Real-time Database Index Algorithm Based on B+ Tree and Consistent Hashing
Avalabl onln at www.scncdrct.com Procda Engnrng 24 (2011) 171 176 2011 Intrnatonal Confrnc on Advancs n Engnrng A Dstrbutd Ral-tm Databas Indx Algorthm Basd on B+ Tr and Consstnt Hashng Xanhu L a, Cuhua
More informationA New Competitive Ratio for Network Applications with Hard Performance Guarantees
A Nw Compttv Rato for Ntwork Applcatons wth Hard Prformanc Guarants Han Dng Dpartmnt of ECE Txas A&M Unvrsty Collg Staton, TX 77840, USA Emal: hdng@maltamudu I-Hong Hou Dpartmnt of ECE Txas A&M Unvrsty
More informationGrand Canonical Ensemble
Th nsmbl of systms mmrsd n a partcl-hat rsrvor at constant tmpratur T, prssur P, and chmcal potntal. Consdr an nsmbl of M dntcal systms (M =,, 3,...M).. Thy ar mutually sharng th total numbr of partcls
More informationCOHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.
MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function
More informationOptimal Data Transmission and Channel Code Rate Allocation in Multi-path Wireless Networks
Optmal Data Transmsson and Channl Cod Rat Allocaton n Mult-path Wrlss Ntwors Kvan Ronas, Amr-Hamd Mohsnan-Rad,VncntW.S.Wong, Sathsh Gopalarshnan, and Robrt Schobr Dpartmnt of Elctrcal and Computr Engnrng
More informationEconomics 600: August, 2007 Dynamic Part: Problem Set 5. Problems on Differential Equations and Continuous Time Optimization
THE UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND Economcs 600: August, 007 Dynamc Part: Problm St 5 Problms on Dffrntal Equatons and Contnuous Tm Optmzaton Quston Solv th followng two dffrntal quatons.
More informationSCITECH Volume 5, Issue 1 RESEARCH ORGANISATION November 17, 2015
Journal of Informaton Scncs and Computng Tchnologs(JISCT) ISSN: 394-966 SCITECH Volum 5, Issu RESEARCH ORGANISATION Novmbr 7, 5 Journal of Informaton Scncs and Computng Tchnologs www.sctcrsarch.com/journals
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationAS technology advances, we wish to communicate over
MAY 27 A Survy on Trappng Sts and Stoppng Sts Adn Prc and Joann Hall, Mmbr, IEEE. arxv:75.5996v [cs.it] 7 May 27 Abstract LDPC cods ar usd n many applcatons, howvr, thr rror corrctng capablts ar lmtd by
More informationCOMPARISON OF L1 C/A L2C COMBINED ACQUISITION TECHNIQUES
COMPARION OF C/A C COMBINE ACQUIITION TECHNIQUE Cyrll Grnot, Kyl O Kf and Gérard achapll Poston, ocaton and Navgaton PAN Rsarch Group partmnt of Gomatcs Engnrng, Unvrsty of Calgary chulch chool of Engnrng
More informationu x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula
7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting
More informationSpace Information Flow: Multiple Unicast
Spac Informaton Flow: Multpl Uncast Zongpng L Dpt. of Computr Scnc, Unvrsty of Calgary and Insttut of Ntwork Codng, CUHK zongpng@ucalgary.ca Chuan Wu Dpartmnt of Computr Scnc Th Unvrsty of Hong Kong cwu@cs.hku.hk
More informationFakultät III Univ.-Prof. Dr. Jan Franke-Viebach
Unv.Prof. r. J. FrankVbach WS 067: Intrnatonal Economcs ( st xam prod) Unvrstät Sgn Fakultät III Unv.Prof. r. Jan FrankVbach Exam Intrnatonal Economcs Wntr Smstr 067 ( st Exam Prod) Avalabl tm: 60 mnuts
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationVLSI Implementation and Performance Evaluation of Low Pass Cascade & Linear Phase FIR Filter
Intrnatonal Journal of Engnrng and Tchncal Rsarch IJETR ISS: 3-869, Volum-3, Issu-6, Jun 5 VLSI Implmntaton and Prformanc Evaluaton of Low Pass Cascad & Lnar Phas Fltr Jaya Gupta, Arpan Shah, Ramsh Bhart
More information5.80 Small-Molecule Spectroscopy and Dynamics
MIT OpnCoursWar http://ocw.mit.du 5.80 Small-Molcul Spctroscopy and Dynamics Fall 008 For information about citing ths matrials or our Trms of Us, visit: http://ocw.mit.du/trms. Lctur # 3 Supplmnt Contnts
More informationDetermination of Optimum Length of Frames and Number of Vectors to Compress ECG Signals
World Acadmy of Scnc, Engnrng and Tchnology Vol:, No:, 7 Dtrmnaton of Optmum ngth of rams and Numbr of Vctors to Comprss ECG Sgnals aft Adnz, Pınar Tüfç, and B.Sıddı Yarman Intrnatonal Scnc Ind, Elctroncs
More information8-node quadrilateral element. Numerical integration
Fnt Elmnt Mthod lctur nots _nod quadrlatral lmnt Pag of 0 -nod quadrlatral lmnt. Numrcal ntgraton h tchnqu usd for th formulaton of th lnar trangl can b formall tndd to construct quadrlatral lmnts as wll
More informationHomotopy perturbation technique
Comput. Mthods Appl. Mch. Engrg. 178 (1999) 257±262 www.lsvir.com/locat/cma Homotopy prturbation tchniqu Ji-Huan H 1 Shanghai Univrsity, Shanghai Institut of Applid Mathmatics and Mchanics, Shanghai 272,
More informationMUSIC Based on Uniform Circular Array and Its Direction Finding Efficiency
Intrnatonal Journal of Sgnal Procssng Systms Vol. 1, No. 2 Dcmbr 2013 MUSIC Basd on Unform Crcular Array and Its Drcton Fndng Effcncy Baofa Sun Dpartmnt of Computr Scnc and Tchnology, Anhu Sanlan Unvrsty,
More informationHORIZONTAL IMPEDANCE FUNCTION OF SINGLE PILE IN SOIL LAYER WITH VARIABLE PROPERTIES
13 th World Confrnc on Earthquak Engnrng Vancouvr, B.C., Canada August 1-6, 4 Papr No. 485 ORIZONTAL IMPEDANCE FUNCTION OF SINGLE PILE IN SOIL LAYER WIT VARIABLE PROPERTIES Mngln Lou 1 and Wnan Wang Abstract:
More information(Upside-Down o Direct Rotation) β - Numbers
Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg
More informationProblem Set #2 Due: Friday April 20, 2018 at 5 PM.
1 EE102B Spring 2018 Signal Procssing and Linar Systms II Goldsmith Problm St #2 Du: Friday April 20, 2018 at 5 PM. 1. Non-idal sampling and rcovry of idal sampls by discrt-tim filtring 30 pts) Considr
More informationApproximation and Inapproximation for The Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model
20 3st Intrnational Confrnc on Distributd Computing Systms Workshops Approximation and Inapproximation for Th Influnc Maximization Problm in Social Ntworks undr Dtrministic Linar Thrshold Modl Zaixin Lu,
More informationDecentralized Adaptive Control and the Possibility of Utilization of Networked Control System
Dcntralzd Adaptv Control and th Possblty of Utlzaton of Ntworkd Control Systm MARIÁN ÁRNÍK, JÁN MURGAŠ Slovak Unvrsty of chnology n Bratslava Faculty of Elctrcal Engnrng and Informaton chnology Insttut
More informationRoadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems
Roadmap XML Indxing CPS 296.1 Topics in Databas Systms Indx fabric Coopr t al. A Fast Indx for Smistructurd Data. VLDB, 2001 DataGuid Goldman and Widom. DataGuids: Enabling Qury Formulation and Optimization
More informationEinstein Equations for Tetrad Fields
Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for
More information4.8 Huffman Codes. Wordle. Encoding Text. Encoding Text. Prefix Codes. Encoding Text
2/26/2 Word A word a word coag. A word contrctd ot of on of th ntrctor ar: 4.8 Hffan Cod word contrctd ng th java at at word.nt word a randozd grdy agorth to ov th ackng rob Encodng Txt Q. Gvn a txt that
More informationHeisenberg Model. Sayed Mohammad Mahdi Sadrnezhaad. Supervisor: Prof. Abdollah Langari
snbrg Modl Sad Mohammad Mahd Sadrnhaad Survsor: Prof. bdollah Langar bstract: n ths rsarch w tr to calculat analtcall gnvalus and gnvctors of fnt chan wth ½-sn artcls snbrg modl. W drov gnfuctons for closd
More informationFunction Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0
unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr
More informationA Packet Buffer Evaluation Method Exploiting Queueing Theory for Wireless Sensor Networks
DOI: 10.2298/CSIS110227057Q A Packt Buffr Evaluaton Mthod Explotng Quung Thory for Wrlss Snsor Ntworks T Qu 1,2, Ln Fng 2, Fng Xa 1*, Guow Wu 1, and Yu Zhou 1 1 School of Softwar, Dalan Unvrsty of Tchnology,
More informationFakultät III Wirtschaftswissenschaften Univ.-Prof. Dr. Jan Franke-Viebach
Unvrstät Sgn Fakultät III Wrtschaftswssnschaftn Unv.-rof. Dr. Jan Frank-Vbach Exam Intrnatonal Fnancal Markts Summr Smstr 206 (2 nd Exam rod) Avalabl tm: 45 mnuts Soluton For your attnton:. las do not
More informationStator Short Circuits Detection in PMSM by means of Higher Order Spectral Analysis (HOSA)
Stator Short Crcuts Dtcton n PMSM by mans of Hghr Ordr Spctral Analyss (HOSA) J. Rosro 1, J. Ortga, J. Urrsty, J. Cárdnas, L. Romral 1 ABB, -mal: javr.rosro@s.abb.com Moton Control and Industral Applcatons
More informationProblem Set 6 Solutions
6.04/18.06J Mathmatics for Computr Scinc March 15, 005 Srini Dvadas and Eric Lhman Problm St 6 Solutions Du: Monday, March 8 at 9 PM in Room 3-044 Problm 1. Sammy th Shark is a financial srvic providr
More informationStress-Based Finite Element Methods for Dynamics Analysis of Euler-Bernoulli Beams with Various Boundary Conditions
9 Strss-Basd Fnt Elmnt Mthods for Dynamcs Analyss of Eulr-Brnoull Bams wth Varous Boundary Condtons Abstract In ths rsarch, two strss-basd fnt lmnt mthods ncludng th curvatur-basd fnt lmnt mthod (CFE)
More informationPropositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs
More informationLinear Algebra Provides a Basis for Elasticity without Stress or Strain
Soft, 05, 4, 5-4 Publshd Onln Sptmbr 05 n ScRs. http://www.scrp.org/ournal/soft http://dx.do.org/0.46/soft.05.400 Lnar Algbra Provds a Bass for Elastcty wthout Strss or Stran H. H. Hardy Math/Physcs Dpartmnt,
More informationPolytropic Process. A polytropic process is a quasiequilibrium process described by
Polytropc Procss A polytropc procss s a quasqulbrum procss dscrbd by pv n = constant (Eq. 3.5 Th xponnt, n, may tak on any valu from to dpndng on th partcular procss. For any gas (or lqud, whn n = 0, th
More informationAbstract Interpretation: concrete and abstract semantics
Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion
More informationEmotion Recognition from Speech Using IG-Based Feature Compensation
Computatonal Lngustcs and Chns Languag Procssng Vol. 12, No. 1, March 2007, pp. 65-78 65 Th Assocaton for Computatonal Lngustcs and Chns Languag Procssng Emoton Rcognton from Spch Usng IG-Basd Fatur Compnsaton
More informationBasic Polyhedral theory
Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist
More informationModeling and Simulation Analysis of Power Frequency Electric Field of UHV AC Transmission Line
(IJACSA) Intrnatonal Journal of Advancd Computr Scnc and Applcatons, Vol., o., Modlng and Smulaton Analyss of Powr Frquncy Elctrc Fld of UHV AC Transmsson Ln Chn Han Collg of Elctronc and Elctrcal Engnrng
More informationA Novel SecureVideo Watermarking Scheme using DWT &Random Frame Selection
A Novl ScurVido Watrmarking Schm using DWT &Random Slction Pavnt K Athwal Dpartmnt of Computr Scinc Enginring RIMT, M.G.G, Punjab,India Ranprt Kaur Dpartmnt of Computr Scinc Enginring RIMT, M.G.G, Punjab,India
More informationA Self-adaptive open loop architecture for weak GNSS signal tracking
NTERNATONAL JOURNAL OF CRCUTS, SYSTEMS AND SGNAL PROCESSNG Volum 8, 014 A Slf-adaptv opn loop archtctur for wa GNSS sgnal tracng Ao Png, Gang Ou, Janghong Sh Abstract An FFT-basd opn loop carrr tracng
More informationEpistemic Foundations of Game Theory. Lecture 1
Royal Nthrlands cadmy of rts and Scncs (KNW) Mastr Class mstrdam, Fbruary 8th, 2007 Epstmc Foundatons of Gam Thory Lctur Gacomo onanno (http://www.con.ucdavs.du/faculty/bonanno/) QUESTION: What stratgs
More informationA Quasi-Static Approach to Minimizing Energy Consumption in Real-Time Systems under Reward Constraints
n Proc. Intl. Confrnc on Ral-Tm and mbddd Computng Systms and Applcatons, 2006, pp. 279-286. A Quas-Statc Approach to Mnmzng nrgy Consumpton n Ral-Tm Systms undr Rward Constrants Lus Aljandro Cortés 1
More informationThe graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the
Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.
C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More informationThe following manuscript was published in
h followng manuscrpt was publshd n JunW Hsh Shang-L Yu and Yung-Shng Chn Moton-basd vdo rtrval by trajctory matchng IEEE ransactons on Crcuts and Systms for Vdo chnology Vol. 16 No. 3 396-409 2006. Moton-basd
More informationThat is, we start with a general matrix: And end with a simpler matrix:
DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss
More informationUNTYPED LAMBDA CALCULUS (II)
1 UNTYPED LAMBDA CALCULUS (II) RECALL: CALL-BY-VALUE O.S. Basic rul Sarch ruls: (\x.) v [v/x] 1 1 1 1 v v CALL-BY-VALUE EVALUATION EXAMPLE (\x. x x) (\y. y) x x [\y. y / x] = (\y. y) (\y. y) y [\y. y /
More informationMor Tutorial at www.dumblittldoctor.com Work th problms without a calculator, but us a calculator to chck rsults. And try diffrntiating your answrs in part III as a usful chck. I. Applications of Intgration
More information3 Finite Element Parametric Geometry
3 Finit Elmnt Paramtric Gomtry 3. Introduction Th intgral of a matrix is th matrix containing th intgral of ach and vry on of its original componnts. Practical finit lmnt analysis rquirs intgrating matrics,
More informationNEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA
NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals
More informationSeptember 27, Introduction to Ordinary Differential Equations. ME 501A Seminar in Engineering Analysis Page 1. Outline
Introucton to Ornar Dffrntal Equatons Sptmbr 7, 7 Introucton to Ornar Dffrntal Equatons Larr artto Mchancal Engnrng AB Smnar n Engnrng Analss Sptmbr 7, 7 Outln Rvw numrcal solutons Bascs of ffrntal quatons
More informationChapter 6 Folding. Folding
Chaptr 6 Folding Wintr 1 Mokhtar Abolaz Folding Th folding transformation is usd to systmatically dtrmin th control circuits in DSP architctur whr multipl algorithm oprations ar tim-multiplxd to a singl
More information