We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors
|
|
- Gervase Donald Welch
- 5 years ago
- Views:
Transcription
1 We are IntehOpen, the worl leaing publiher of Open Ae book Built by ientit, for ientit 4, 116, 12M Open ae book available International author an eitor Downloa Our author are among the 154 Countrie elivere to TOP 1% mot ite ientit 12.2% Contributor from top 5 univeritie Seletion of our book inee in the Book Citation Ine in Web of Siene Core Colletion (BKCI) Interete in publihing with u? Contat book.epartment@intehopen.om Number iplaye above are bae on latet ata ollete. For more information viit
2 5 Lole Steganography for Speeh Communiation Naofumi Aoki Grauate Shool of Information Siene an Tehnology, Hokkaio Univerity Japan 1. Introution Tranmitting upplementary aty teganography, new funtion an be ae to ommuniation ytem without hanging onventional ata format. Bae on thi onept, everal appliation have been propoe for enhaning the peeh quality of telephony ommuniation. Thee appliation eretly tranmit ie information along with peeh ata itelf for enhaning the performane of ignal proeing uh a paket lo onealment an ban etenion (Aoki, 23; Aoki, 26; Aoki, 27a; Aoki, 212). The implet teganography tehnique employe in uh appliation i the LSB (Leat Signifiant Bit) replaement tehnique (Co, 28). It jut replae the LSB of peeh ata with eret meage. Sine the LSB of peeh ata i not very important in pereption, the LSB replaement tehnique i uffiient enough in many pratial ae. However, there i no way to avoi inevitable egraation of peeh aty embeing eret meage with the LSB replaement tehnique. In orer to mitigate thi problem, thi artile eribe an iea of the lole teganography tehnique for telephony ommuniation (Aoki, 27b; Aoki, 28; Aoki, 29a; Aoki, 29b; Aoki, 21a). The propoe tehnique eploit the harateriti of the fole binary oe employe in everal peeh oe, uh a G.711 an DVI-ADPCM. 2. LSB replaement tehnique The LSB replaement tehnique i known a one of the implet teganography tehnique (Co, 28). It jut embe eret meage into the LSB of over ata. The embeing proeure of the LSB replaement tehnique i programme in C language a hown in Fig. 1. In thi proeure, b repreent a 1 bit eret meage an repreent an 8bit over ata. The LSB replaement tehnique i ategorize a a loy teganography tehnique, ine it may egrae over aty embeing eret meage. if (b == ) &= FE; if (b == 1) = 1; Fig. 1. Embeing proeure of the LSB replaement tehnique programme in C language.
3 76 Reent Avane in Steganography 3. Lole teganography tehnique bae on the fole binary oe For repreenting igne integer inary ata, many peeh oe employ the fole binary oe intea of the 2' omplement, the mot ommon format of binary ata. Table 1 how how an 8 bit peeh ata i repreente by the fole binary oe a well a the 2' omplement. eimal number 2' omplement fole binary oe ~ ~ Table 1. 2' omplement an fole binary oe for repreenting 8 bit peeh ata. A hown in thi table, an 8 bit peeh ata enoe in the 2' omplement range from -128 to On the other han, an 8 bit peeh ata enoe in the fole binary oe range from -127 to Although the fole binary oe annot repreent -128, it may repreent both + an - intea. Thi reunany an be a ontainer for embeing eret meage without any egraation. The embeing proeure of the propoe tehnique i programme in C language a hown in Fig. 2. In thi proeure, b repreent a 1 bit eret meage an repreent an 8bit over ata enoe in the fole binary oe. The propoe tehnique i ategorize a a lole teganography tehnique, ine it oe not egrae over aty embeing eret meage.
4 Lole Steganography for Speeh Communiation 77 if (( & 7F) == ) { if (b == ) &= 7F; if (b == 1) = 8; } Fig. 2. Embeing proeure of the propoe tehnique programme in C language. 4. G.711 G.711 i the mot ommon oe for telephony peeh tanarize by ITU-T (International Teleommuniation Union Teleommuniation Stanarization Setor) (ITU-T, 1988). It onit of -law an A-law heme eignate a PCMU an PCMA, repetively. PCMU i mainly employe in North Ameria an Japan. It enoe 14 bit peeh ata into 8 bit ompreion ata at an 8 khz ampling rate. PCMA i mainly employe in Europe. It enoe 13 bit peeh ata into 8 bit ompreion ata at an 8 khz ampling rate. Figure 3 an 4 how the enoing an eoing proeure of PCMU. The ompreion ata of PCMU onit of 1 bit ign, 3 bit eponent, an 4 bit mantia (ITU-T, 25). The ompreion ata i enoe in the fole binary oe. Table 2 how ome of the ompreion ata an their orreponing peeh ata eoe with PCMU. A hown in thi table, the peeh ata eoe with PCMU range from - to -831, an + to Figure 5 an 6 how the enoing an eoing proeure of PCMA. The ompreion ata of PCMA onit of 1 bit ign, 3 bit eponent, an 4 bit mantia (ITU-T, 25). The ompreion ata i enoe in the fole binary oe. Table 2 how ome of the ign 14 bit peeh ata mantia 8 bit ompreion ata eponent 1 a b Fig. 3. Enoing proeure of PCMU.
5 78 Reent Avane in Steganography ompreion ata an their orreponing peeh ata eoe with PCMA. A hown in thi table, the peeh ata eoe with PCMA range from -1 to -432, an +1 to Note that there i an overlap in the peeh ata eoe with PCMU. On the other han, there i no uh an overlap in the peeh ata eoe with PCMA. Thi iniate that a lole teganography tehnique i available for PCMU, although it i not for PCMA. ign 14 bit peeh ata mantia 8 bit ompreion ata eponent 1 a b Fig. 4. Deoing proeure of PCMU. ign 13 bit peeh ata mantia 8 bit ompreion ata eponent a b Fig. 5. Enoing proeure of PCMA.
6 Lole Steganography for Speeh Communiation 79 ign 13 bit peeh ata mantia 8 bit ompreion ata eponent a b Fig. 6. Deoing proeure of PCMA. ompreion ata +127 ~ ~ -127 eoe peeh ata (PCMU) eoe peeh ata (PCMA) Table 2. Speeh ata eoe with PCMU an PCMA.
7 8 Reent Avane in Steganography 5. Lole teganography tehnique for G.711 Taking aount of the harateriti of PCMU, eret meage an be embee into both + an - in the ompreion ata without any egraation. When i require to be embee, the ign bit of the ompreion ata i hange to be. Thi mean that the ompreion ata i hange to be +. When 1 i require to be embee, the ign bit of the ompreion ata i hange to be 1. Thi mean that the ompreion ata i hange to be -. The embeing proeure of the propoe tehnique i efine a follow. (, b ) (, b 1) (1) where b repreent a 1 bit eret meage an repreent an 8 bit ompreion ata. Thi proeure i programme in C language a hown in Fig. 7. Figure 8 how an eample of the propoe tehnique. The ompreion ata i repreente a white an blak irle aoring to the ign bit. The ign bit of the ompreion ata repreente by white irle i. On the other han, the ign bit of the ompreion ata repreente by blak irle i 1. Thi eample how 4 aniate that an ontain 4 bit eret meage in total. Aoring to their ign bit, thee ata originally ontain 4 bit eret meage repreente a (,, 1, 1). In orer to embe eret meage repreente a (, 1,, 1), the propoe tehnique hange thee ata a hown in Fig. 8. Sine all of thee are eoe to be even if their ign bit are hange, the propoe tehnique oe not egrae the peeh quality at all. if (( & 7F) == ) { if (b == ) &= 7F; if (b == 1) = 8; } Fig. 7. Embeing proeure of the propoe tehnique programme in C language. 6. DVI-ADPCM The onept of the propoe tehnique may potentially be appliable to other oe that alo employ the fole binary oe. Another eample i DVI-ADPCM. Not only G.711 but alo DVI-ADPCM i employe in telephony ommuniation a a tanar VoIP (Voie over IP) oe (RFC, 1996).
8 Lole Steganography for Speeh Communiation 81 (a) (b) amplitue amplitue time 1 1 time Fig. 8. Eample of the propoe tehnique: (a) ompreion atefore embeing, an (b) ompreion ata after embeing. DVI-ADPCM i a peeh oe bae on the ADPCM (Aaptive Differential Pule Coe Moulation) algorithm evelope by DVI (Intel' Digital Vieo Interative Group) (Mirooft, 1994). The blok iagram of the ADPCM algorithm i hown in Fig. 9. In thi iagram, (n) repreent a peeh ata an (n) repreent a ompreion ata at the time of n. DVI-ADPCM i eignate a DVI3 an DVI4 aoring to the ize of ompreion ata. DVI3 enoe 16 bit peeh ata into 3 bit ompreion ata at an 8 khz ampling rate. DVI4 enoe 16 bit peeh ata into 4 bit ompreion ata at an 8 khz ampling rate. The ompreion ata of DVI3 onit of 1 bit ign an 2 bit magnitue. The ompreion ata of DVI4 onit of 1 bit ign an 3 bit magnitue. Both of thee are enoe in the fole binary oe. Figure 1 an 11 how the eoing proeure of DVI3 an DVI4 programme in C language. In thee proeure, i a ompreion ata, i a peeh ata, i a ifferene between the previou an the urrent peeh ata, an i a tep ize (Mirooft, 1994).
9 82 Reent Avane in Steganography (a) tep ize (n) (n) ompreion (n) ˆ( n 1) ˆ ( n) z -1 ˆ( n ) eompreion tep ize (b) (n) eompreion ˆ( n ) ˆ ( n) ˆ ( n 1) z -1 tep ize Fig. 9. Blok iagram of ADPCM: (a) enoing proeure, an (b) eoing proeure. = >> 2; if ( & 1) += >> 1; if ( & 2) += ; if ( & 4) = -; += ; Fig. 1. Deoing Proeure of DVI3 programme in C language.
10 Lole Steganography for Speeh Communiation 83 = >> 3; if ( & 1) += >> 2; if ( & 2) += >> 1; if ( & 4) += ; if ( & 8) = -; += ; Fig. 11. Deoing Proeure of DVI4 programme in C language. 7. Lole teganography tehnique for DVI-ADPCM The tep ize of DVI-ADPCM range from 7 to a hown in Fig.12 (Mirooft, 1994). When the magnitue of the ompreion ata i an the tep ize i 7, the peeh ata eoe with DVI4 oe not epen on the ign of the ompreion ata. Thi onition allow a lole teganography tehnique that an embe eret meage without any egraation. The embeing proeure of the propoe tehnique i efine a follow. int [89] = { 7, 8, 9, 1, 11, 12, 13, 14, 16, 17, 19, 21, 23, 25, 28, 31, 34, 37, 41, 45, 5, 55, 6, 66, 73, 8, 88, 97, 17, 118, 13, 143, 157, 173, 19, 29, 23, 253, 279, 37, 337, 371, 48, 449, 494, 544, 598, 658, 724, 796, 876, 963, 16, 1166, 1282, 1411, 1552, 177, 1878, 266, 2272, 2499, 2749, 324, 3327, 366, 426, 4428, 4871, 5358, 5894, 6484, 7132, 7845, 863, 9493, 1442, 11487, 12635, 13899, 15289, 16818, 185, 235, 22385, 24623, 2786, 29794, }; Fig. 12. Step ize of DVI-ADPCM. (, 7, b ) (, 7, b 1) (2) where b repreent a 1 bit eret meage, repreent a 4 bit ompreion ata, an repreent a tep ize. Thi proeure i programme in C language a hown in Fig. 13. Note that there i no uh a onition that allow a lole teganography tehnique for DVI3. Thi mean that a lole teganography tehnique i not available for DVI3 in the ame manner of the propoe tehnique for DVI4.
11 84 Reent Avane in Steganography if (( & 7) == && == 7) { if (b == ) &= 7; if (b == 1) = 8; } Fig. 13. Embeing proeure of the propoe tehnique programme in C language. 8. Capaity of the propoe tehnique The apaity of the propoe tehnique wa evaluate by uing peeh ata obtaine from atual telephony environment, uh a a private room, an offie room, a afeteria, an a railroa tation. In thee onition, 8 male peeh ata (m1 m8) an 8 female peeh ata (f1 f8) were ollete. A hown in Table 3, the uration of the peeh ata enote a L wa more than 12. The voie ativity ratio of the peeh ata enote a R wa at aroun 5 %, ine telephony peeh generally how the half uple truture ue to the alternate onveration proe (Wright, 21). RMS (Root Mean Square) of the bakgroun noie wa alulate from voie inative interval. private room offie room afeteria railroa tation peeh m1 m2 f1 f2 m3 m4 f3 f4 m5 m6 f5 f6 m7 m8 f7 f8 L () R (%) RMS (B) Table 3. Speeh ata obtaine from atual telephony environment.
12 Lole Steganography for Speeh Communiation apaity [%] RMS [B] Fig. 14. Capaity of the propoe tehnique for PCMU: Cirle, triangle, iamon, an quare repreent the apaity of a private room, an offie room, a afeteria, an a railroa tation, repetively. Soli line repreent the average apaity obtaine from a imulation uing a peeh ialogue atabae. The apaity of the propoe tehnique for PCMU i hown in Fig.14. Thi figure alo how a oli line that repreent the average apaity obtaine from a imulation uing a peeh ialogue atabae (ATR, 1997). It i iniate that the apaity of the propoe tehnique epen on the bakgroun noie in eah telephony environment. The apaity range from 3.3 % to 6.4 % for the peeh ata obtaine from a private room in whih the bakgroun noie i almot impereptible. It i interprete that the apaity range from 264 bp to 512 bp in thi onition. On the other han, the apaity range from.24 % to.44 % for the peeh ata obtaine from a railroa tation in whih the bakgroun noie i very annoying. It i interprete that the apaity range from 19.2 bp to 35.2 bp in thi onition. The apaity of the propoe tehnique for DVI4 a well a PCMU i hown in Table 4. Compare with PCMU, the apaity for DVI4 i muh maller. Note that the apaity for DVI4 i very mall even if the bakgroun noie i almot impereptible. The apaity
13 86 Reent Avane in Steganography range from.29 % to.16 % for the peeh ata obtaine from a private room. It i interprete that the apaity range from 2.32 bp to 12.8 bp in thi onition. On the other han, there i no apaity for the peeh ata obtaine from a afeteria an a railroa tation. private room peeh m1 m2 f1 f2 m3 PCMU (%) DVI4 (%) offie room afeteria m4 f3 f4 m5 m6 f5 f6 m railroa tation m8 f7 f Table 4. Capaity of the propoe tehnique for PCMU an DVI4. 9. Semi-lole teganography Semi-lole teganography tehnique i an iea for inreaing the apaity of the propoe tehnique (Aoki, 21b). Thi artile eribe how the apaity of the lole teganography tehnique for PCMU an be inreae by the emi-lole teganography tehnique. Figure 15 how how the emi-lole teganography tehnique embe eret meage. In the embeing proeure, thi tehnique moifie an 8 bit ompreion ata a follow. j ( 127 j) j ( 127 j ) (3) where j ( ) repreent the amplitue moifiation level.
14 Lole Steganography for Speeh Communiation 87 The amplitue moifiation may aue uneirable lipping in the 8 bit ompreion ata, if it magnitue eee 127-j. Conequently, thi tehnique an reover the original peeh ata only when the amplitue of the 8 bit ompreion ata range from -127+j to +127-j. (a) (b) () amplitue amplitue amplitue time time 1 3 time Fig. 15. Embeing proeure of the emi-lole teganography tehnique: (a) ompreion atefore embeing, (b) amplitue moifiation, an () ompreion ata after embeing. Mot of the pratial ae meet thi onition when the amplitue moifiation level i mall enough. Thi i bae on the fat that the amplitue of peeh ata tatitially how the eponential itribution (Rabiner, 1978). In general, the maimum magnitue of the 8 bit ompreion ata i le than 127-j. In thi ene, thi tehnique an be ategorize a a reverible teganography tehnique, if thi onition i atifie. However, if thi onition i not atifie, thi tehnique annot reover the original peeh ata any more. Therefore, thi tehnique i name emi-lole teganography tehnique in thi tuy. The embeing proeure of the emi-lole teganography tehnique i efine a follow.
15 88 Reent Avane in Steganography j j ( j, b 2 ) 1 ( j, b 2) ( j, b ) ( j, b 1) 1 ( j, b 3) j j ( j, b 2 1) (4) The apaity of the lole teganography tehnique i efine a N bit, where N repreent the number of the ompreion ata in whih the eret meage an be embee. On the other han, the apaity of the emi-lole teganography tehnique i efine a N(log 2( j 1) 1) bit. The apaity of the emi-lole teganography tehnique inreae aoring to the amplitue moifiation level. However, uneirable lipping may our more frequently in uh a ituation. After the etrating proeure of the eret meage, the emi-lole teganography tehnique reover the 8 bit ompreion ata a follow. j ( j 127) ( j j) j ( 127 j) (5) Of oure, the reovery proeure i neeary for eoing the original peeh ata. However, thi proeure i omitte in the onventional telephony ytem that o not implement the emi-lole teganography tehnique. In uh a ituation, there i no way to remove the egraation from the peeh ata. In orer to evaluate uh egraation, thi tuy invetigate the quality of the moifie peeh aty uing PESQ (Pereptual Evaluation of Speeh Quality) (ITU-T, 21). PESQ i wiely employe a an objetive evaluation meaure of the peeh quality in telephony ommuniation. Taking aount of the harateriti of human auitory pereption, PESQ poitively orrelate with a ubjetive evaluation meaure uh a MOS (Mean Opinion Sore). PESQ ore range from 4.5 to -.5. The higher the PESQ ore, the better the peeh quality. Figure 16 how the average PESQ ore with 95 % onfiene interval. Thee were alulate from the 16 peeh ata employe in the evaluation for the apaity of the propoe tehnique. A hown in thi figure, it i iniate that the amplitue moifiation aue ome egraation. However, it i almot impereptible when the amplitue moifiation level i mall enough. Thi reult may potentially aure the ompatibility of the emi-lole teganography tehnique with the onventional telephony ytem. Thi mean that normal playbak of the peeh ata moifie with the propoe tehnique i till aeptable in the onventional telephony ytem that o not implement the emi-lole teganography tehnique.
16 Lole Steganography for Speeh Communiation PESQ amplitue moifiation level Fig. 16. Degraation of peeh aty amplitue moifiation. 1. Conluion Thi artile eribe an iea for the lole teganography tehnique bae on the harateriti of the fole binary oe employe in everal peeh oe, uh a G.711 an DVI-ADPCM. In aition, an iea for the emi-lole teganography tehnique i alo eribe. The propoe tehnique take avantage of the reunany of the peeh oe. It i a ort of the loophole of the peeh oe that an be employe a a ontainer of eret meage. Suh a loophole play an important role for embeing eret meage without any egraation. The onept of the propoe tehnique may potentially be appliable to other oe that alo employ the fole binary oe. Beie G.711 an DVI-ADPCM, it i of interet to fin out the oe in whih the propoe tehnique i available. In aition, it i alo of interet to evelop ome pratial appliation that employ the propoe tehnique for tranmitting eret meage. Both of thee topi are the future work of thi tuy. 11. Aknowlegment The author woul like to epre the gratitue to the Minitry of Euation, Culture, Sport, Siene an Tehnology of Japan for proviing a grant (no ) towar thi tuy.
17 9 Reent Avane in Steganography 12. Referene Aoki, N. (23). A paket lo onealment tehnique for VoIP uing teganography bae on pith waveform repliation, IEICE Tranation on Communiation, vol.j86-b, no.12, pp Aoki, N. (26). A ban etenion tehnique for G.711 peeh uing teganography, IEICE Tranation on Communiation, vol.e89-b, no.6, pp Aoki, N. (27). A ban etenion tehnique for G.711 peeh uing teganography bae on full wave retifiation, IEICE Tranation on Communiation, vol.j9-b, no.7, pp Aoki, N. (27). A tehnique of lole teganography for G.711, IEICE Tranation on Communiation, vol.e9-b, no.11, pp Aoki, N. (28). A tehnique of lole teganography for G.711 telephony peeh, 28 Fourth International Conferene on Intelligent Information Hiing an Multimeia Signal Proeing (IIHMSP28), Harbin, China, pp Aoki, N. (29). Lole teganography tehnique for IP telephony peeh taking aount of the reunany of fole binary oe, AICIT 29 Fifth International Joint Conferene on INC, IMS an IDC (NCM29), Seoul, Korea, pp Aoki, N. (29). A lole teganography tehnique for G.711 telephony peeh, 29 APSIPA Annual Summit an Conferene (APSIPA ASC 29), Sapporo, Japan, pp Aoki, N. (21). A lole teganography tehnique for DVI-ADPCM Tranation on Funamental of Eletroni, Communiation an Computer Siene, vol.j93-a, no.2, pp Aoki, N. (21). A emi-lole teganography tehnique for G.711 telephony peeh, 21 Sith International Conferene on Intelligent Information Hiing an Multimeia Signal Proeing (IIHMSP21), Darmtat, Germany, pp Aoki, N. (212). Enhanement of peeh quality in telephony ommuniation by teganography, Multimeia Information Hiing Tehnologie an Methoologie for Controlling Data, IGI Global (To be publihe) ATR (1997). Speeh Dialogue Databae for Spontaneou Speeh Reognition Co, I., Miller, M., Bloom, J., Fririh, J., an Kalker, T. (28). Digital Watermarking an Steganography, Seon Eition, Morgan Kaufmann Publiher ITU-T (1988). G.711, Pule oe moulation (PCM) of voie frequenie ITU-T (21). P.862, Pereptual evaluation of peeh quality (PESQ), an objetive metho for en-to-en peeh quality aement of narrow-ban telephone network an peeh oe ITU-T (25). G.191, Software tool for peeh an auio oing tanarization Mirooft (1994). Multimeia Data Stanar Upate Rabiner, L.R. an Shafer, R.W. (1978). Digital Proeing of Speeh Signal, Prentie-Hall. RFC (1996). RFC189, RTP profile for auio an vieo onferene with minimal ontrol Wright, D.J. (21). Voie over Paket Network, John Wiley & Son
18 212 The Author(). Lienee IntehOpen. Thi i an open ae artile itribute uner the term of the Creative Common Attribution 3. Liene, whih permit unretrite ue, itribution, an reproution in any meium, provie the original work i properly ite.
Description of Traffic in ATM Networks by the First Erlang Formula
5th International Conferene on Information Tehnology and Appliation (ICITA 8) Deription of Traffi in ATM Network by the Firt Erlang Formula Erik Chromý, Matej Kavaký and Ivan Baroňák Abtrat In the paper
More informationRelayer Selection Strategies in Cellular Networks with Peer-to-Peer Relaying
Relayer Seletion Strategie in Cellular Network with Peer-to-Peer Relaying V. Sreng, H. Yanikomeroglu, and D. D. Faloner Broadband Communiation and Wirele Sytem (BCWS) Centre Dept. of Sytem and Computer
More informationKINEMATIC ANALYSIS OF VARIOUS ROBOT CONFIGURATIONS
International Reearh Journal of Engineering and Tehnology (IRJET) e-in: 39-6 Volume: 4 Iue: May -7 www.irjet.net p-in: 39-7 KINEMATI ANALYI OF VARIOU ROBOT ONFIGURATION Game R. U., Davkhare A. A., Pakhale..
More informationShortest Paths in Directed Graphs
Shortet Path in Direted Graph Jonathan Turner January, 0 Thi note i adapted from Data Struture and Network Algorithm y Tarjan. Let G = (V, E) e a direted graph and let length e a real-valued funtion on
More informationUSING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL
USING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL Robert A. Kilmer Department of Sytem Engineering Unite State Military Acaemy Wet Point, NY 1996 Alice E. Smith
More informationSolutions to Tutorial 2 (Week 9)
The University of Syney Shool of Mathematis an Statistis Solutions to Tutorial (Week 9) MATH09/99: Disrete Mathematis an Graph Theory Semester, 0. Determine whether eah of the following sequenes is the
More informationUnsupervised Segmentation of Stereoscopic Video Objects: Proposal. and Comparison of Two Depth-Based Approaches
Unsupervise Segmentation of Stereosopi Vieo Objets: Proposal an Comparison of Two Depth-Base Approahes Klimis S. Ntalianis an Athanasios S.Drigas Net Meia Lab, NCSR Demokritos, Athens, Greee E-mail: kntal@image.ntua.gr
More informationOSI Model. SS7 Protocol Model. Application TCAP. Presentation Session Transport. ISDN-UP Null SCCP. Network. MTP Level 3 MTP Level 2 MTP Level 1
Direte Event Simulation of CCS7 DAP Benjamin, AE Krzeinki and S Staven Department of Computer Siene Univerity of Stellenboh 7600 Stellenboh, South Afria fbenj,aek,taveng@.un.a.za ABSTRACT: Complex imulation
More informationEmbedded Video Compression with Error Resilience and Error Concealment
Embee Vieo Compression with Error Resiliene an Error Conealment Sungae Cho a an William A. Pearlman a a Center for Next Generation Vieo Department of Eletrial, Computer, an Systems Engineering Rensselaer
More informationCombined Radix-10 and Radix-16 Division Unit
Combined adix- and adix-6 Diviion Unit Tomá ang and Alberto Nannarelli Dept. of Eletrial Engineering and Computer Siene, Univerity of California, Irvine, USA Dept. of Informati & Math. Modelling, Tehnial
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationCalculations for multiple mixers are based on a formalism that uses sideband information and LO frequencies: ( ) sb
Setting frequeny parameter in the WASP databae A. Harri 24 Aug 2003 Calulation for multiple mixer are baed on a formalim that ue ideband information and LO frequenie: b b := ign f ig f LO f IF := f ig
More informationSelf-Contained Automated Construction Deposition System
Self-Containe Automate Contrution Depoition Sytem Robert L. William II Ohio Univerity, Athen, Ohio Jame S. Albu an Roger V. Botelman NIST, Gaitherburg, MD Automation in Contrution (an International Reearh
More informationKinematic design of a double wishbone type front suspension mechanism using multi-objective optimization
5 th utralaian Congre on pplied Mehani, CM 2007 10-12 Deember 2007, Bribane, utralia Kinemati deign of a double wihbone tpe front upenion mehanim uing multi-objetive optimiation J. S. wang 1, S. R. Kim
More informationDiffraction I Version 1.0 : March 12, 2019
Diffraction I Interference an Diffraction of Light Through Slit: The Jut Give Me The Formulae Verion! Steve Smith March 12, 2019 Content 1 Introuction 3 1.1 Huygen Principle.............................................
More informationInverse Kinematics 1 1/29/2018
Invere Kinemati 1 Invere Kinemati 2 given the poe of the end effetor, find the joint variable that produe the end effetor poe for a -joint robot, given find 1 o R T 3 2 1,,,,, q q q q q q RPP + Spherial
More information1 Disjoint-set data structure.
CS 124 Setion #4 Union-Fin, Greey Algorithms 2/20/17 1 Disjoint-set ata struture. 1.1 Operations Disjoint-set ata struture enale us to effiiently perform operations suh as plaing elements into sets, querying
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationDr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq
Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using
More information8. Wavelength measurement with a grating spectrometer
Spm 8. Wavelength meaurement with a grating pectrometer 8.1 Introuction A very exact examination of the chemical compoition of a ubtance can be unertaken by analying the electromagnetic raiation it emit
More informationMacrohomogenous Li-Ion-Battery Modeling - Strengths and Limitations
Marohomogenou Li-Ion-Battery Modeling - Strength and Limitation Marku Lindner Chritian Wieer Adam Opel AG Sope Purpoe of the reearh: undertand and quantify impat of implifiation in marohomogeneou model
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationA Full-Featured, Error Resilient, Scalable Wavelet Video Codec Based on the Set Partitioning in Hierarchical Trees (SPIHT) Algorithm
A Full-Feature, Error Resilient, Salable Wavelet Vieo Coe Base on the Set Partitioning in Hierarhial Trees (SPIHT) Algorithm Sungae Cho an William A. Pearlman Center for Next Generation Vieo Researh Rensselaer
More informationINTRODUCTION. USB Connection Cable included
INTRODUCTION USB Connetion Cable inlue PRG007 is the new programming interfae for alarms, l, parking now available an future proution. It s Winows sw base on. After owloaing an installing the software
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationLAB 4: Operations on binary images Histograms and color tables
LAB 4: Operations on binary images Histograms an olor tables Computer Vision Laboratory Linköping University, Sween Preparations an start of the lab system You will fin a ouple of home exerises (marke
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationThe Thresholding MLEM Algorithm
Journal of Meial an Biologial Engineering, 24(2: 85-9 85 The Thresholing MLEM Algorithm Keh-Shih Chuang, Meei-Ling Jan,2 Jay Wu Sharon Chen Yu-Ching Ni Ying-Kai Fu 2 epartment of Nulear Siene, National
More informationView-Based Tree-Language Rewritings
View-Baed Tree-Language Rewriting Lak Lakhmanan, Alex Thomo Univerity of Britih Columbia, Canada Univerity of Vitoria, Canada Importane of tree XML Semi-trutured textual format are very popular.
More informationAbout this Topic. Topic 4. Arithmetic Circuits. Different adder architectures. Basic Ripple Carry Adder
About thi Topi Topi 4 Arithmeti Ciruit Peter Cheung Department of Eletrial & Eletroni Engineering Imperial College London URL: www.ee.imperial.a.uk/pheung/ E-mail: p.heung@imperial.a.uk Comparion of adder
More informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationDeterministic Access for DSRC/802.11p Vehicular Safety Communication
eterminiti Ae for SRC/802.11p Vehiular Safety Communiation Jihene Rezgui, Soumaya Cheraoui, Omar Charoun INTERLAB Reearh Laboratory Univerité de Sherbrooe, Canada {jihene.rezgui, oumaya.heraoui, omar.haroun
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationAutomatic design of robust PID controllers based on QFT specifications
IFAC Conferene on Advane in PID Control PID'1 Breia (Italy), Marh 8-3, 1 Automati deign of robut PID ontroller baed on QFT peifiation R. Comaòliva*, T. Eobet* J. Quevedo* * Advaned Control Sytem (SAC),
More informationCross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer
Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based
More informationKeeping Things Simple: Finding Frequent Item Sets by Recursive Elimination
Keeping Things Simple: Fining Frequent Item Sets y Reursive Elimination Christian Borgelt Department of Knowlege Proessing an Language Engineering Shool of Computer Siene, Otto-von-Guerike-University of
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationTopics. FPGA Design EECE 277. Number Representation and Adders. Class Exercise. Laboratory Assignment #2
FPGA Deign EECE 277 Number Repreentation and Adder Dr. William H. Robinon Februar 2, 25 Topi There are kind of people in the world, thoe that undertand binar and thoe that don't. Unknown Adminitrative
More informationLearning Spatiotemporal Features for Infrared Action Recognition with 3D Convolutional Neural Networks
Learning Spatiotemporal Features for Infrare Ation Reognition with 3D Convolutional Neural Networks Zhuolin Jiang, Viktor Rozgi, Sanar Aali Raytheon BBN Tehnologies, Cambrige, MA, 02138 {zjiang, vrozgi,
More informationRotation Matrices Three interpretations of rotational matrices Representing the coordinates of a point in two different frames
From Lat Cla Numerial Integration Stabilit v. hoie of te ie Firt orer v. higher orer metho obot Kinemati obot onfiguration Configuration ae Joint oorinate v. workae oorinate Poition Kinemati otation Tranlation
More informationKaren L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract
Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial
More informationModelling data-aggregation in multi-replication data centric storage systems for wireless sensor and actor networks
Publihe in IET Communication Receive on 1t July 2010 Revie on 31t March 2011 oi: 10.1049/iet-com.2010.0574 In Special Iue on Ditribute Intelligence an Data Fuion for Senor Sytem Moelling ata-aggregation
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationThe influence of defeated arguments in defeasible argumentation
The influene of efeate arguments in efeasible argumentation Bart Verheij University of Limburg, Department of Metajuriia P.O. Box 616, 6200 MD Maastriht, The Netherlans fax: +31 43 256538 email: bart.verheij@metajur.rulimburg.nl
More information1. Introduction. Abstract
Automati Ontology Derivation Uing Clutering for Image Claifiation 1 Latifur Khan and Lei Wang Department of Computer Siene Univerity of Texa at Dalla, TX 75083-0688 Email: [lkhan, leiwang]@utdalla.edu
More informationPerformance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification
erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,
More informationarxiv: v1 [physics.soc-ph] 17 Oct 2013
Emergene of Blind Area in Information Sreading arxiv:131707v1 [hyi.o-h] 17 Ot 2013 Zi-Ke Zhang 1,2,, Chu-Xu Zhang 1,3,, Xiao-Pu Han 1,2 and Chuang Liu 1,2 1 Intitute of Information Eonomy, Hangzhou Normal
More informationAdobe Certified Associate
Adobe Certified Assoiate About the Adobe Certified Assoiate (ACA) Program The Adobe Certified Assoiate (ACA) program is for graphi designers, Web designers, video prodution designers, and digital professionals
More informationCS2100 Computer Organisation Tutorial #8: MSI Components Answers to Selected Questions
C Computer Organisation Tutorial #8: MI Components Answers to elete Questions. Realize the following funtion with (a) an 8: multiplexer, an (b) a 4: multiplexer using the first input variables as the seletor
More informationComplexity of Saliency-Cognizant Error Concealment Based on the Itti-Koch-Niebur Saliency Model
SIMON FRASER UNIVERSITY Complexity of Saliency-Cognizant Error Concealment Bae on the Itti-Koch-Niebur Saliency Moel Hai Haizaeh, Ivan V. Bajić, an Gene Cheung MCL TECHNICAL REPORT MCL-TR-01-11-01 November
More informationDynamic Backlight Adaptation for Low Power Handheld Devices 1
Dynami Baklight Adaptation for ow Power Handheld Devies 1 Sudeep Pasriha, Manev uthra, Shivajit Mohapatra, Nikil Dutt and Nalini Venkatasubramanian 444, Computer Siene Building, Shool of Information &
More informationTime delay estimation of reverberant meeting speech: on the use of multichannel linear prediction
University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel
More informationApproximate logic synthesis for error tolerant applications
Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationISSN (Online), Volume 1, Special Issue 2(ICITET 15), March 2015 International Journal of Innovative Trends and Emerging Technologies
International Journal of Innovative Trend and Emerging Tehnologie ROBUST SCAN TECHNIQUE FOR SECURED AES AGAINST DIFFERENTIAL CRYPTANALYSIS BASED SIDE CHANNEL ATTACK A.TAMILARASAN 1, MR.A.ANBARASAN 2 1
More informationE200 ORT series Torque Transducer 10mNm to 500Nm
E200 ORT series Torque Transuer 10mNm to 500Nm E200 ORT Series Optial Rotary Torque Transuer The E200 ORT Series (Optial Rotary Torque) Transuer offers, in onjuntion with an E201/2 Display Interfae, an
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationA Deterministic Fault-Tolerant and Deadlock-Free Routing Protocol in 2-D Meshes Based on Odd-Even Turn Model
A Determinitic Fault-Tolerant an Dealock-Free Routing Protocol in -D Mehe Bae on -ven Turn Moel Jie Wu Department of Computer Science an ngineering Floria Atlantic Univerity Boca Raton, FL 3343 jie@ce.fau.eu
More informationKS3 Maths Assessment Objectives
KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationParametric Micro-level Performance Models for Parallel Computing
Computer Siene Tehnial Report Computer Siene 12-5-1994 Parametri Miro-level Performane Model for Parallel Computing Youngtae Kim Iowa State Univerity Mark Fienup Iowa State Univerity Jeffrey S. Clary Iowa
More informationMulti-Channel Wireless Networks: Capacity and Protocols
Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationConstructing disjoint paths for failure recovery and multipath routing
Computer Network Computer Network (211) 1 12 Contructing ijoint path for failure recovery an multipath routing Yong Oh Lee, A. L. Naraimha rey 1 Dept. of Electrical an Computer Engineering, Texa A & M
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationAn Efficient Image Distortion Correction Method for an X-ray Digital Tomosynthesis System
An Effiient Image Distortion Corretion Metho for an X-ray Digital Tomosynthesis System J.Y. Kim Dept. of Mehatronis Engineering, Tongmyong University of Information Tehnology, 55 Yongang-ong, Nam-gu, Busan
More informationUplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks
62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationIncorporating Speculative Execution into Scheduling of Control-flow Intensive Behavioral Descriptions
Inorporating Speulative Exeution into Sheduling of Control-flow Intenive Behavioral Deription Ganeh Lakhminarayana, Anand Raghunathan, and Niraj K. Jha Dept. of Eletrial Engineering C&C Reearh Laboratorie
More informationCOSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems
COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems Andreas Brokalakis Synelixis Solutions Ltd, Greee brokalakis@synelixis.om Nikolaos Tampouratzis Teleommuniation
More informationDatum Transformations of NAV420 Reference Frames
NA4CA Appliation Note Datum ranformation of NA4 Referene Frame Giri Baleri, Sr. Appliation Engineer Crobow ehnology, In. http://www.xbow.om hi appliation note explain how to onvert variou referene frame
More informationCOURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017
COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017 Submiion Deadline: The ourework onit of two part (of a different nature) relating to one problem. A hown below
More informationExperimental validation of sound field control with a circular double-layer array of loudspeakers.
Downloae from orittuk on: Jan 04, 2018 Experimental valiation of oun fiel control with a circular oule-layer array of loupeaker Chang, Jiho; Jacoen, Finn Pulihe in: Acoutical Society of America Journal
More informationYou Can Do That. Unit 16. Motivation. Computer Organization. Computer Organization Design of a Simple Processor. Now that you have some understanding
.. ou Can Do That Unit Computer Organization Design of a imple Clou & Distribute Computing (CyberPhysical, bases, Mining,etc.) Applications (AI, Robotics, Graphics, Mobile) ystems & Networking (Embee ystems,
More informationEnumerating pseudo-triangulations in the plane
Enumerating pseuo-triangulations in the plane Sergey Bereg Astrat A pseuo-triangle is a simple polygon with exatly three onvex verties. A pseuo-triangulation of a finite point set S in the plane is a partition
More informationVisual Targeted Advertisement System Based on User Profiling and Content Consumption for Mobile Broadcasting Television
Viual Targeted Advertiement Sytem Baed on Uer Profiling and ontent onumption for Mobile Broadating Televiion Silvia Uribe Federio Alvarez Joé Manuel Menéndez Guillermo inero Abtrat ontent peronaliation
More informationPredicting Project Outcome Leveraging Socio-Technical Network Patterns
203 7th European Conferene on Software Maintenane an Reengineering Preiting Projet Outome Leveraging Soio-Tehnial Network Patterns Dii Surian, Yuan Tian, Davi Lo, Hong Cheng an Ee-Peng Lim Shool of Information
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More information(12) Patent Application Publication (10) Pub. No.: US 2011/ A1
(19) United State US 2011 0316690A1 (12) Patent Application Publication (10) Pub. No.: US 2011/0316690 A1 Siegman (43) Pub. Date: Dec. 29, 2011 (54) SYSTEMAND METHOD FOR IDENTIFYING ELECTRICAL EQUIPMENT
More informationBayesian Markov Chain Monte Carlo inversion for fluid term and dry fracture weaknesses
Bayeian Markov Chain Monte Carlo inverion or lui term an ry racture weaknee Huaizhen Chen an Kri Innanen CREWES project, Department o Geocience, Univerity o Calgary Summary Fracture weaknee an lui actor
More informationAnnouncements. CSE332: Data Abstractions Lecture 19: Parallel Prefix and Sorting. The prefix-sum problem. Outline. Parallel prefix-sum
Announcement Homework 6 due Friday Feb 25 th at the BEGINNING o lecture CSE332: Data Abtraction Lecture 19: Parallel Preix and Sorting Project 3 the lat programming project! Verion 1 & 2 - Tue March 1,
More informationQ1:Choose the correct answer:
Q:Chooe the orret anwer:. Purpoe of an OS i a. Create abtration b. Multiple proee ompete for ue of proeor. Coordination. Sheduler deide a. whih proee get to ue the proeor b. when proee get to ue the proeor.
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More informationA Novel Method for Removing Image Staircase Artifacts
Vol.139 (SIP 016, pp.56-63 http://dx.doi.org/10.1457/atl.016.139.54 A Novel Method for Removing Image Stairae Artifat Zhong Chen 1,, Zhiwei Hou 1, Yuegang Xing, Xiaobing Chen 1 1 Jiangu Key Laboratory
More informationA note on degenerate and spectrally degenerate graphs
A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove
More informationDynamic Restoration in Multi-layer IP/MPLS-over- Flexgrid Networks
Dynami Restoration in Multi-layer IP/MPLS-over- Flexgri Networks Alberto Castro, Luis Velaso, Jaume Comellas, an Gabriel Junyent Universitat Politènia e Catalunya (UPC), Barelona, Spain E-mail: aastro@a.up.eu
More informationA Dictionary based Efficient Text Compression Technique using Replacement Strategy
A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, 700023, India
More informationCONTROL RAPID PROTOTYPING OF REDUNDANTLY ACTUATED PARALLEL KINEMATICAL MACHINE
CONROL RAPID PROOYPING OF REDUNDANLY ACUAED PARALLEL KINEMAICAL MACHINE Michael Valášek, Zbyněk Šika, Jan Zavřel, omáš Skopec, Pavel Steinbauer CU in Prague, Faculty of Mechanical Engineering Abtract Reunantly
More informationAdvanced Algorithms for Fast and Scalable Deep Packet Inspection
Avane Algorithms for Fast an Salale Deep Paket Inspetion Sailesh Kumar Washington University sailesh@arl.wustl.eu Jonathan Turner Washington University jon.turner@wustl.eu John Williams Ciso Systems jwill@iso.om
More informationAutomatic Basis Selection Techniques for RBF Networks
Automatic Bai Selection Technique for RBF Network Ali Ghoi School of Computer Science Univerity of Waterloo Univerity Avenue Wet NL G, Canaa Email: aghoib@c.uwaterloo.ca Dale Schuurman School of Computer
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationFinite Elements Method in Split Hopkinson Pressure Bar developing process
6th WSEAS International Conference on SYSTEM SCIENCE and SIMULATION in ENGINEERING, Venice, Italy, November 1-3, 007 63 Finite Element Method in Split Hopkinon Preure Bar developing proce ROTARIU ADRIAN
More information