Protecting Biometric Templates with Image Watermarking Techniques

Size: px
Start display at page:

Download "Protecting Biometric Templates with Image Watermarking Techniques"

Transcription

1 Protectig Biometric Templates with Image Watermarkig Techiques Nikos Komios ad Tassos Dimitriou Athes Iformatio Techology, GR Peaia Attiki, Greece Abstract. Biometric templates are subject to modificatios for idetity fraud especially whe they are stored i databases. I this paper, a ew approach to protectig biometric templates with image watermarkig techiques is proposed. The ovelty of this approach is that we have combied lattice ad block-wise image watermarkig techiques to maitai image quality alog with cryptographic techiques to embed figerprit templates ito facial images ad vice-versa. Thus, protectig them from beig modified. Keywords: Biometric templates, figerprits, face pictures, autheticatio, watermarkig. 1 Itroductio Visual based biometric systems use feature extractio algorithms to extract the discrimiat iformatio that is ivariat to as may variatios embedded i the raw data (e.g. scalig, traslatio, rotatio) as possible. Template-based methods crop a particular subimage (the template) from the origial sesory image, ad extract features from the template by applyig global-level processig, without a priori kowledge of the object s structural properties. Compared to geometric feature extractio algorithms, image template approaches eed to locate far fewer poits to obtai a correct template. For example, i the probabilistic decisio-based eural etwork (PDBNN) face recogitio syste oly two poits (left ad right eyes) eed to be located to extract a facial recogitio template. A early compariso betwee the two types of feature extractio methods was made by Bruelli ad Poggio [1]. They foud the template approach to be faster ad able to geerate more accurate recogitio results tha the geometric approach. I practice, there is ot always a perfect match betwee templates ad idividuals. Oe speaks of a false positive if the biometric recogitio system says 'yes', but the aswer should be 'o'. A false egative works the other way roud: the system says 'o', where it should be a 'yes'. Oe of the mai challeges with biometric systems is to miimise the rates of both false positives ad of false egatives. I theory oe is iclied to keep the false positives low, but i practical situatios it ofte works the other way roud: people that operate these systems dislike false egatives, because they slow dow the process ad result i extra work ad people complaiig. S.-W. Lee ad S.Z. Li (Eds.): ICB 2007, LNCS 4642, pp , Spriger-Verlag Berli Heidelberg 2007

2 Protectig Biometric Templates with Image Watermarkig Techiques 115 A potetial protectio approach of biometric templates is feasible with image watermarkig techiques i visual-based biometric systems. Watermarkig techiques attempt to protect the copyrights of ay digital medium by embeddig a uique patter or message withi the origial iformatio. The embeddig method ivolves the use of a umber of differet autheticatio, ecryptio ad hash algorithms ad protocols to achieve the validity ad copy protectio of the particular message. Oe of the most importat requiremets of watermarkig is the perceptual trasparecy betwee the origial work ad the watermarked. Especially for images that objective metrics are widely used [6]. The watermark message may have a higher or lower level of perceptibility, meaig that there is a greater or lesser likelihood that a give observer will perceive the differece. I this paper, we apply watermarkig techiques to biometric templates to overcome serious cases of idetity theft. I particular, we embed a perso s figerprit template ito his facial image with the form of a cryptographic ecoder that utilizes ecryptio algorithms, hash fuctios ad digital sigatures. Oce the facial image has bee watermarked, it ca be stored i public databases without riskig a idetity modificatio or fabricatio. Followig this itroductio, the paper is orgaized as follows. Sectio 2 presets curret work that combie watermarkig ad biometrics techiques. Sectio 3 discusses the requiremets for efficiet watermarkig ad briefly describes lattice ad block-wise embeddig methods ad how these ca be used alog with cryptographic techiques to protect biometric templates. Sectio 4 evaluates the performace ad the efficiecy of the two embeddig methods, through simulatio tests. Sectio 5 cocludes with remarks ad commets o the ope issues i watermarkig ad biometric templates. 2 Related Work Curret research efforts i combiig watermarkig techiques ad visual-based biometric systems follow a hierarchical approach, with the most explored area beig that of biometrics. Watermarkig techiques o the other had have bee explored less i cojuctio with biometrics templates. Despite the fact that several attempts of combiig watermarkig techiques ad biometric systems have already bee proposed. I Lucilla et al. [5], a techique for the autheticatio of ID cardholders is preseted, which combies dyamic sigature verificatio with hologram watermarks. Two biometric features are already itegral parts of ID cards for maual verificatio: the user s face ad sigature. This techique embeds dyamic features of the cardholder s sigature ito the persoal data prited o the ID card, thereby facilitatig automated user autheticatio based o the embedded iformatio. Ay modificatio of the image ca also be detected ad will further disallow the biometric verificatio of the forger. Jai ad Uludag [2] worked with hidig figerprit miutiae i images. For this purpose, they cosidered two applicatio scearios: A set of figerprit miutiae is trasferred as the watermark of a arbitrary image ad a face image is watermarked with figerprit miutiae. I the first sceario, the figerprit miutiae are trasferred via a o-secure chael hidde i a arbitrary image. Before beig embedded ito

3 116 N. Komios ad T. Dimitriou the host image, the figerprit miutiae are ecrypted, which further icreases the security of the data. The produced image is set through the isecure commuicatio chael. I the ed, the image is received ad the figerprit miutiae are extracted, decrypted ad ready for ay further processig. I the secod sceario, a face sca is watermarked with figerprit miutiae data ad the result is ecoded i a smart card. For the autheticatio of a user, the image is retrieved from the smart card, the figerprit miutiae are extracted from it ad they are compared to the miutiae obtaied from the user olie. The user is autheticated based o the two figerprit miutiae data sets ad the face image. Jai et al. [3] have preseted a figerprit image watermarkig method that ca embed facial iformatio ito host figerprit images. The cosidered applicatio sceario i this case is as follows: The figerprit image of a perso is watermarked with face iformatio of the same perso ad stored o a smart card. At a access cotrol site, the figerprit of the user is sesed ad compared with the oe stored o the smart card. After the figerprit matchig has successfully bee completed, the facial iformatio ca be extracted from the figerprit image o the smart card ad ca be used for further autheticatio purposes. 3 Combiig Image Watermarkig Techiques with Visual Based Biometric Systems Visual-based biometric systems use feature extractio techiques to collect uique facial patters ad create biometric templates. However, biometric templates are subject to fraud especially i passport cloig ad illegal immigratio. Image watermarkig techiques alog with cryptographic primitives ca be used to verify the autheticity of a perso ad also detect ay modificatio to biometric templates whe these are securely stored. Biometric templates of a figerprit ad a face sca ca be hashed ad ecrypted with cryptographic algorithms ad the embedded ito a image. For example, with the use of hash fuctios ad ecryptio methods, the ower of a facial image ca embed his/her template. The recipiet ca extract it by decryptig it ad therefore ca verify that the received image was the oe iteded by the seder. Ecryptig ad hashig watermarked iformatio ca guaratee the autheticatio of the ower ad the image itself sice the purpose of watermarks is two-fold: (i) they ca be used to determie owership, ad (ii) they ca be used to detect tamperig. There are two ecessary features that all watermarks must possess [7]. First, all watermarks should be detectable. I order to determie owership, it is imperative that oe be able to recover the watermark. Secod, watermarks must be robust to various types of processig of the sigal (i.e. croppig, filterig, traslatio, compressio, etc.). If the watermark is ot robust, it serves little purpose, as owership will be lost upo processig. Aother importat requiremet for watermarks is the perceptual trasparecy betwee the origial work ad the watermarked; ad for images objective metrics are widely used. The watermarked message may have a higher or lower level of perceptibility, meaig that there is a greater or lesser likelihood that a give observer will perceive the differece. The ideal is to be as imperceptible as possible ad it is required to develop models that are

4 Protectig Biometric Templates with Image Watermarkig Techiques 117 used to compare two differet versios of the works ad evaluate ay alteratios. Evaluatig the perceptibility of the watermarks ca be doe with distortio metrics. These distortio metrics do ot exploit the properties of the huma visual system but they provide reliable results. Also, there is a objective criterio that relies o the sesitivity of the eye ad is called Watso perceptual distace. It is also kow as just oticeable differeces ad cosists of a sesitivity fuctio, two maskig compoets based o lumiace, cotrast maskig, ad a poolig compoet. Table 1 gives the metrics that are used more ofte. Table 1. Quality Measuremets Sigal to Noise Ratio (SNR) Peak Sigal to Noise Ratio (PSNR) Image Fidelity (IF) 2 ~ 2 SNR Im, / I I Normalized Cross Correlatio (NC) 2 ~ PSNR MN max I 2 m, / I I ~ 2 I I Mea Square MSE I 2 Error (MSE) m, I Correlatio Quality (CQ) 2 IF 1 / Im, Watso Distace (WD) 1 ~ MN ~ 2 NC I I / Im, ~ CQ I I / I Dwat 1 / 4 4 0, w, i, j, k c c d i, j k There are plety of image watermarkig techiques available i the literature but we have combied lattice ad semi-fragile, or block-wise, embeddig methods to take advatage of their uique features. Briefly, the lattice watermarkig system embeds oly oe bit per 256 pixels i a image. Each bit is ecoded usig the trellis code ad produces a sequece of four bits. The trellis codig is a covolutio code ad the umber of states is 2 3 =8 with possible outputs 2 4 =16. After the ecodig procedure, the bits eed to be embedded i 256 pixels which meas that each of the four bits is embedded i 256/4=64 pixels [6]. The block-wise method ivolves the basic properties of the JPEG compressio where DCT domai takes place. Four bits are embedded i the high-frequecy DCT of each 8x8 (64 pixels) block i the image ad ot i the low-frequecy i order to avoid ay visual differeces that would lead to uacceptably poor fidelity. By usig the block-wise method, the image ca host 16 times more iformatio tha lattice. Specifically 28 coefficiets are used which meas that each bit is embedded i seve coefficiets. The seve coefficiets that host oe bit are chose radomly accordig to a seed umber ad thus, each coefficiet is ivolved i oly oe bit [6]. By combig the two methods, we ca exploit their advatages particularly, i circumstaces where both the quality ad the ability to otice the corrupted blocks is essetial. I a image, the part that is likely to be illegally altered is watermarked with the block-wise method while the rest of the image is watermarked with the lattice method. I a facial image, for example, the areas of the eyes, mouth ad jaw ca be used to embed the figerprit template. The roud area of the face ca be used to embed additioal iformatio, such as the ame ad/or address of the perso show i the photo with the lattice method. If a adversary chages for example the color of

5 118 N. Komios ad T. Dimitriou the eyes or some characteristics of the face (e.g. addig a moustache) the combied algorithm is able to determiate the modified pixels. This is achieved by comparig the extracted message with the origial. The combiatio of the two embeddig methods is implemeted i a cryptographic ecoder-decoder. The authority that wishes to protect a face or figerprit photo, extracts the biometric template(s) of that perso ad alog with a short descriptio ad a uique feature of the image are iserted i a hash fuctio ad the result is ecrypted with a 1024-bit secret key. The sigature, together with the short ad the extracted uique descriptio, is embedded with the lattice method while the biometric template is embedded with the block-wise algorithm. As a uique descriptio we have used the sum of the pixel values of the four blocks i the corers. The Secure Hash Algorithm (SHA) ad the Rivest, Shamir, Aldema (RSA) [8] have bee used to hash ad sig the figerprit template, short ad uique descriptios. The desig of the ecoder is illustrated i Fig. 1a. Biometric Template Short Descriptio Origial Image Watermarked Image Biometric Template Short Descriptio Extracted Descriptio Extract Uique Descriptio Detect Extract Uique Descriptio SHA Hash Fuctio Sigature 1024-bit Secret Key RSA Ecryptio 1024-bit Public Key RSA Decryptio Biometric Template Short Descriptio Uique Descriptio SHA Hash Fuctio Close? Sigature Message Short Descriptio Uique Descriptio Embed =? Both Yes? Watermarked Image Valid \ Ivalid (a) (b) Fig. 1. Cryptographic Ecoder / Decoder From the watermarked versio of the image, at the decoder s side, the sigature, the short ad uique descriptios are extracted with the lattice method while the biometric template is extracted with the block-wise algorithm. The, the uique descriptio is compared with the extracted oe. Thus, the first step is to verify whether the uique descriptios match. I the case of the watermark beig copied ad embedded i aother image, the extracted descriptio will ot be the same. This is due to the fact that the pixel values of the image have bee slightly chaged to host the watermark, the extracted descriptio caot be exactly the same, but ca be very close. Therefore, some upper ad lower boudaries have bee determied for this step of verificatio.

6 Protectig Biometric Templates with Image Watermarkig Techiques 119 The ext step is to decrypt the sigature usig the 1024-bit RSA public key ad retrieve the hash value. The biometric template, short ad uique descriptios that have bee extracted, is agai the iput to the hash fuctio. The obtaied hash value is the compared with the oe decrypted from the sigature. The third step of the decoder is to verify whether the decrypted hash value matches exactly with the oe calculated by the decoder. If both hash values ad uique descriptios are valid, the autheticatio process is successful. The whole desig of the decoder is preseted i Fig. 1b. 4 Experimetal Results I order to evaluate the performace ad the efficiecy of the embeddig methods, excessive tests have take place. A umber of cases have bee cosidered each with a differet variable parameter. A grayscale bitmap image with 300x300 (Fig. 2a) resolutio has bee used for the experimets. The differece betwee the origial ad the watermarked image was evaluated by the ideal values of the origial image that are preseted i Table 2. Table 2. Ideal Values of the test Image Quality Measuremets Ideal Values Quality Measuremets Ideal Values MSE 0 NC 1 SNR (db) 97 CQ PSNR (db) 104 Watso Distace 0 IF 100 Cases have also bee cosidered oce agai each with a differet variable parameter, idepedet of lattice ad block-wise methods i order to maitai image quality. Whe combied image watermarkig is performed, a small part of the image is watermarked with the block-wise method ad the rest is watermarked with the lattice method. We assume that the most vulerable to illegal modificatios, is the small part. The biometric template is embedded i the small part while the short ad extracted descriptios are embedded i the large part of the image. The experimetal tests of the quality measuremets were performed usig: oly lattice; oly block-wise; combied block-wise ad lattice. It was foud that the lattice method achieves better results tha the block-wise ad expected that the produced result values of the combied case would be i betwee the values of those produced by the two methods. Particularly, i the case of the lattice algorithm the maximum umber of the embedded bit ca be 351 (oe bit per 256 pixels). The formulas that are used to evaluate the differeces betwee two images are preseted i Table 1. The tests were executed usig a rage of values for the parameter i order to coclude what the best values are. The parameters are the embeddig stregth (β) ad the lattice spacig (α). The rage of the α value was from 0.35 to 5.33 ad the rage of β from 0.7 to 1.1. The icesemet steps for a was 0.02 ad for β 0.1.

7 120 N. Komios ad T. Dimitriou The measuremet values for the lattice method are very close to the ideal oes. More specifically, the directio towards zero is achieved usig low values of α i the case of MSE. If at the same time the value of β that is used is low, the MSE is decreased eve further. I the case of SNR ad PSNR, the result values are higher whe the parameters α ad β are low. The image fidelity (IF), which is defied as a percetage of how idetical the images are, the value of 100% is cosidered to be the optimum ad as ca be oticed from Table 3, the results are very close to this. Utilizig the NC ad the CQ quality measuremets, it is observed that their measuremets are closer to the ideal oes (Table 2), as the values of α ad β are decreased. The above observatios are also justified from the Watso measuremet which is based o lumiace, cotrast, ad poolig maskig. Table 3. Results From Lattice, Block-Wise ad Combied Embeddig Methods alpha(a)=1.53, beta(β)=0.8, alpha(a) =0.2 alpha(a)=0.93, beta(β)=1.0, alpha(a)=0.1 Lattice alpha(a), beta(β) Block- Wise alpha(a) Combied alpha(a),beta(β) alpha(a) MSE SNR PSNR IF NC CQ Watso- Distace Lattice alpha(a), beta(β) (a) Block-Wise alpha(a) Combied alpha(a),beta(β), alpha(a) MSE SNR PSNR IF NC CQ Watso-Distace (b) Therefore, it could be suggested that the optimum parameter values are those that give the best results. They could eve be the zero values. But at the decoder s side ot all the bits are extracted correctly. Specifically whe usig low values of α ad β, the decoder is ot able to get the correct embedded bits. I coclusio it ca be said that a trade-off betwee the quality results ad the decoder s result is ecessary i order to determie the optimum values. From the tests we cocluded that suggested values could be α 1.53 ad β = 0.8 (Table 3b). Similarly, i the case of the block-wise method, the tests were executed for the same image i order to be comparable with those of the lattice method. Oe major differece is the umber of bits that are embedded. Sice the method embeds four bits i every 64 pixels ad the image has pixels i total, the umber of bits ca be hosted i The size of the iformatio that ca be watermarked is sigificatly

8 Protectig Biometric Templates with Image Watermarkig Techiques 121 higher ad i fact is 16 times greater tha the size i the lattice method. Therefore, before eve executig the test, it is expected that the results will ot be as good. The iformatio i the block-wise method is much more, which meas that the alteratios i the image will produce worse values i the quality measuremets. The observatio of the results proves what is beig stated i the begiig. The values of the quality measuremets are ot as good i compariso with those of the lattice method sice the measuremet of the MSE is higher tha the ideal value, which is zero. The values of the SNR ad PSNR, which are widely used, show that as the value of the parameter alpha (a) is icreased, the result becomes worse. I the case of the IF, NC, ad CQ, the measuremets seem to be distat from the ideal values as alpha (a) takes higher values. The same coclusio ca be phrased for the perceptual distace give by the Watso model, where the results are worse as the value of alpha (a) is icreased. It seems that as the value of alpha is icreased, the watermarked image has poorer fidelity. So the optimum value of the parameter should perhaps possibly be a small oe e.g However, it seems that values below 0.05 do ot allow the decoder to get the right message. The chose value of alpha depeds o how sesitive the user wats the method to be i order to locate the corrupted bits ad mark the correspodig blocks. Higher values icrease the sesitivity but at the same time the quality of the image is reduced. So it is agai ecessary to make a trade-off betwee the results ad the sesitivity. A possible suggested value could be a 0.2 (Table 3b). Ideed the results were ot as good as those of the lattice method but they were better tha those of the block-wise method. I Table 3 some result values of the combiatio are give i order to compare them with those of the two methods whe they are applied idividually. Table 3 justifies that the combiatio produces quality measuremets betwee the two methods. Table 4 presets the maximum umber of bits that ca be hosted i the image usig the two embeddig methods ad a combiatio of them. Table 4. Maximum Number of Embedded Bits Lattice Block- Wise Combied Max Embedded Bits The last test was to verify that i case somebody modifies the block-wise part of the image, which is the biometric template, the decoder realizes the modificatio, iforms the authority that the autheticatio applicatio failed ad outputs a file with the modified blocks marked. The part that is likely to be illegally altered is the eyes or jaw ad the biometric template(s) of the facial ad/or figerprit images which are embedded with the block-wise method (Fig. 2b). I the watermarked versio the distace betwee the eyes was chaged ad this image was iserted i the decoder i order to verify its autheticity. The autheticatio process failed ad a marked image was produced (Fig. 2c). By observig the last image it is clear that the decoder has successfully located the modified blocks.

9 122 N. Komios ad T. Dimitriou (a) (b) (c) Fig. 2. Origial Image (a), Watermarked Image (b), Marked Image (c) Throughout the paper we have cosidered the case where a figerprit ad/or facial template is embedded ito a facial image. That does ot mea that a facial image caot be embedded with our method ito a figerprit image, which is illustrated i Fig. 3. Similar to Fig. 2, Fig. 3a is the origial image, Fig. 3b is the watermarked ad Fig. 3c is the marked image geerated by our testbed. (a) (b) (c) Fig. 3. Origial Image (a), Watermarked Image (b), Marked Image (c) The potetial dager with sesitive databases cotaiig biometric idetifiers, such as facial, figerprit images ad templates, is that they are likely to be attacked by hackers or crimials. Watermarkig the iformatio i these databases ca allow the itegrity of the cotets to be verified. Aother dager is that this critical data ca be attacked while it is beig trasmitted. For example, a third party could itercept this data ad maliciously alter the data before re-trasmittig it to its fial destiatio. The trasmissio problem is eve more critical i cellular ad wireless chaels. The chaels themselves are quite oisy ad ca degrade the sigal quality. Additioally, data trasmitted through wireless chaels is far from secure as they are omi-directioal, ad as such ca be eavesdropped with relative ease. The growth of the wireless market ad e-commerce applicatios for PDAs requires a robust cryptographic method for data security. There are compact solid state sesors already available i the market, which ca capture figerprits or faces for the purpose of idetity verificatio. These devices ca also be easily attached to PDAs ad other had-held cellular devices for use i idetificatio ad verificatio. Cosiderig all the oise ad distortio i cellular chaels, our combied watermarkig techique alog with the cryptographic ecoder/decoder will maily work i smudgig, compressio ad filterig. Our cryptographic ecoder/decoder will oly fail whe oise ad distortio is detected i the sesitive areas of the images that have bee embedded with the block-wise algorithm. If our watermarked image is trasferred i a oisy chael, the we eed to reduce the amout of iformatio iserted with the block-wise method to have a high rate of success.

10 Protectig Biometric Templates with Image Watermarkig Techiques Coclusio Watermarkig biometric data is of growig importace as more robust methods of verificatio ad autheticatio are beig used. Biometrics provides the ecessary uique characteristics but their validity must be esured. This ca be guarateed to a extet by watermarks. Ufortuately, they caot provide a foolproof solutio especially whe the trasmissio of data is ivolved. A receiver ca ot always determie whether or ot he has received the correct data without the seder givig access to critical iformatio (i.e., the watermark). I this paper we have preseted a cryptographic ecoder/decoder that digitally sigs biometric templates, which are embedded with combied lattice ad block-wise image watermarkig techiques ito a image. Combiig image watermarkig techiques with cryptographic primitives eables us to protect biometric templates that have bee geerated by a visual-based biometric system without ay distortio of the image. Sice biometric templates are essetial tools for autheticatig people, it is ecessary to protect them for possible alteratios ad fabricatios i cojuctio with their biometric image(s) whe these are stored i private/public databases. Image watermarkig techiques i cojuctio with cryptographic primitives provide a powerful tool to autheticate a image, its biometric template ad ay additioal iformatio that is cosidered importat accordig to a particular applicatio. I the passport-based sceario, for example, the photograph ad the private iformatio (i.e. ame/address) of a idividual ca be protected with the proposed approach. Our results showed that we ca combie watermarkig techiques to securely embed private iformatio i a biometric image without fadig it out. Refereces 1. Bruelli, R., Poggio, T.: Face recogitio: features versus templates. IEEE Tras. O Patter Aalysis ad Machie Itelligece 15, (1993) 2. Jai, A.K., Uludag, U.: Hidig Figerprit Miutiae i Images. I: Proc. Automatic Idetificatio Advaced Techologies (AutoID), New York, pp (March 14-15, 2002) 3. Jai, A.K., Uludag, U., Hsu, R.-L.: Hidig a face i a figerprit image. I: Proc. Iteratioal Coferece o Patter Recogitio (ICPR), Caada, (August 11-15, 2002) 4. Kug, S.Y., Mak, M.W., Li, S.H.: Biometric Autheticatio: A Machie Learig Approach. Pretice Hall Iformatio ad System Scieces Series (2005) 5. Lucilla, C.F., Astrid, M., Markus, F., Claus, V., Ralf, S., Edward, D.J.: Biometric Autheticatio for ID cards with hologram watermarks. I: Proc. Security ad Watermarkig of Multimedia Cotets SPIE 02, vol. 4675, pp (2002) 6. Peticolas, F., Aderso, R., Kuh, M.: Iformatio hidig a survey. IEEE Proceedigs 87(7), (1999) 7. Wog, P.H.W., Au, O.C., Yueg, Y.M.: Novel blid watermarkig techique for images. IEEE Tras. O Circuits ad Systems for Video Techology 13(8), (2003) 8. Hao, F., Aderso, R., Daugma, J.: Combiig Crypto with Biometrics Effectively. IEEE Trasactio o Computers 55(9), (2006)

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

More information

Message Integrity and Hash Functions. TELE3119: Week4

Message Integrity and Hash Functions. TELE3119: Week4 Message Itegrity ad Hash Fuctios TELE3119: Week4 Outlie Message Itegrity Hash fuctios ad applicatios Hash Structure Popular Hash fuctios 4-2 Message Itegrity Goal: itegrity (ot secrecy) Allows commuicatig

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Security of Bluetooth: An overview of Bluetooth Security

Security of Bluetooth: An overview of Bluetooth Security Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give

More information

Precise Psychoacoustic Correction Method Based on Calculation of JND Level

Precise Psychoacoustic Correction Method Based on Calculation of JND Level Vol. 116 (2009) ACTA PHYSICA POLONICA A No. 3 Optical ad Acoustical Methods i Sciece ad Techology Precise Psychoacoustic Correctio Method Based o Calculatio of JND Level Z. Piotrowski Faculty of Electroics,

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

VIDEO WATERMARKING IN 3D DCT DOMAIN

VIDEO WATERMARKING IN 3D DCT DOMAIN 14th Europea Sigal Processig Coferece (EUSIPCO 06), Florece, Italy, September 4-8, 06, copyright by EURASIP VIDEO WATERMARKING IN 3D DCT DOMAIN M. Carli, R. Mazzeo, ad A. Neri AE Departmet Uiversity of

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Further Attacks on Yeung-Mintzer Fragile Watermarking Scheme

Further Attacks on Yeung-Mintzer Fragile Watermarking Scheme Header for SPIE use Further Attacks o Yeug-Mitzer Fragile Watermarkig Scheme Jiri Fridrich, Miroslav Golja, ad Nasir Memo a Departmet of Systems Sciece ad Idustrial Egieerig, SUNY Bighamto, Bighamto, NY

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

A DIGITAL WATERMARKING SCHEME BASED ON ICA DETECTION

A DIGITAL WATERMARKING SCHEME BASED ON ICA DETECTION A DIGITAL WATERMARKING SCHEME BASED ON ICA DETECTION Ju Liu,, Xigag Zhag, Jiade Su ad Miguel Agel Laguas, 3 School of Iformatio Sciece ad Egieerig, Shadog Uiversity, Jia 5, Chia Telecommuicatios Techological

More information

Table 2 GSM, UMTS and LTE Coverage Levels

Table 2 GSM, UMTS and LTE Coverage Levels 6 INDICATORS OF QUALITY OF SERVICE This sectio defies quality idicators that characterize the performace of services supported o mobile commuicatio systems i their various phases of access ad use 6. 6.1

More information

Data diverse software fault tolerance techniques

Data diverse software fault tolerance techniques Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

WYSE Academic Challenge Sectional Computer Science 2005 SOLUTION SET

WYSE Academic Challenge Sectional Computer Science 2005 SOLUTION SET WYSE Academic Challege Sectioal Computer Sciece 2005 SOLUTION SET 1. Correct aswer: a. Hz = cycle / secod. CPI = 2, therefore, CPI*I = 2 * 28 X 10 8 istructios = 56 X 10 8 cycles. The clock rate is 56

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

ECE4050 Data Structures and Algorithms. Lecture 6: Searching ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated

More information

Private Key Cryptography. TELE3119: Week2

Private Key Cryptography. TELE3119: Week2 Private Key Cryptography TELE3119: Week2 Private Key Ecryptio Also referred to as: covetioal ecryptio symmetric key ecryptio secret-key or sigle-key ecryptio Oly alterative before public-key ecryptio i

More information

MOTIF XF Extension Owner s Manual

MOTIF XF Extension Owner s Manual MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

are two specific neighboring points, F( x, y)

are two specific neighboring points, F( x, y) $33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'

More information

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager. CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig

More information

Trusted Design in FPGAs

Trusted Design in FPGAs Trusted Desig i FPGAs Mark Tehraipoor Itroductio to Hardware Security & Trust Uiversity of Florida 1 Outlie Itro to FPGA Architecture FPGA Overview Maufacturig Flow FPGA Security Attacks Defeses Curret

More information

An Efficient Data Hiding Technique in Frequency domain by using Fresnelet Basis

An Efficient Data Hiding Technique in Frequency domain by using Fresnelet Basis A Efficiet Data Hidig Techique i Frequecy domai by usig Freselet Basis Muhammad Nazeer ad Dai-Gyoug Kim* Abstract A ovel method for a efficiet data hidig is proposed with more robust retrievig hidde iformatio

More information

AN EFFICIENT GROUP KEY MANAGEMENT USING CODE FOR KEY CALCULATION FOR SIMULTANEOUS JOIN/LEAVE: CKCS

AN EFFICIENT GROUP KEY MANAGEMENT USING CODE FOR KEY CALCULATION FOR SIMULTANEOUS JOIN/LEAVE: CKCS Iteratioal Joural of Computer Networks & Commuicatios (IJCNC) Vol.4, No.4, July 01 AN EFFICIENT GROUP KEY MANAGEMENT USING CODE FOR KEY CALCULATION FOR SIMULTANEOUS JOIN/LEAVE: CKCS Melisa Hajyvahabzadeh

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Probability of collisions in Soft Input Decryption

Probability of collisions in Soft Input Decryption Issue 1, Volume 1, 007 1 Probability of collisios i Soft Iput Decryptio Nataša Živić, Christoph Rulad Abstract I this work, probability of collisio i Soft Iput Decryptio has bee aalyzed ad calculated.

More information

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

1&1 Next Level Hosting

1&1 Next Level Hosting 1&1 Next Level Hostig Performace Level: Performace that grows with your requiremets Copyright 1&1 Iteret SE 2017 1ad1.com 2 1&1 NEXT LEVEL HOSTING 3 Fast page loadig ad short respose times play importat

More information

One advantage that SONAR has over any other music-sequencing product I ve worked

One advantage that SONAR has over any other music-sequencing product I ve worked *gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka O-lie cursive letter recogitio usig sequeces of local miima/maxima Summary Robert Powalka 19 th August 1993 This report presets the desig ad implemetatio of a o-lie cursive letter recogizer usig sequeces

More information

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING Christoph Busch, Ralf Dörer, Christia Freytag, Heike Ziegler Frauhofer Istitute for Computer Graphics, Computer Graphics Ceter

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Graphic Standards for District Identification. September, 2012

Graphic Standards for District Identification. September, 2012 Graphic Stadards for District Idetificatio September, 2012 CASE Graphic Stadards for District Idetificatio DRAFT 12.8.14 Coucil for Advacemet ad Support of Educatio, 2012. 1 . This documet is a draft of

More information

The impact of GOP pattern and packet loss on the video quality. of H.264/AVC compression standard

The impact of GOP pattern and packet loss on the video quality. of H.264/AVC compression standard The impact of GOP patter ad packet loss o the video quality of H.264/AVC compressio stadard MIROSLAV UHRINA, JAROSLAV FRNDA, LUKÁŠ ŠEVČÍK, MARTIN VACULÍK Departmet of Telecommuicatios ad Multimedia Uiversity

More information

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering 0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy

More information

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

More information

Message Authentication Codes. Reading: Chapter 4 of Katz & Lindell

Message Authentication Codes. Reading: Chapter 4 of Katz & Lindell Message Autheticatio Codes Readig: Chapter 4 of Katz & Lidell 1 Message autheticatio Bob receives a message m from Alice, he wats to ow (Data origi autheticatio) whether the message was really set by Alice.

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

Face Recognition Algorithm Using Discrete Gabor Transform

Face Recognition Algorithm Using Discrete Gabor Transform Selected Papers from: Commuicatios & Iformatio Techology 2008, Circuits, Systems ad Sigals 2008, Applied Mathematics, Simulatio, Modellig 2008, Maratho Beach, Attica, Greece, Jue 1-3, 2008 Face Recogitio

More information

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS) CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a

More information

1. SWITCHING FUNDAMENTALS

1. SWITCHING FUNDAMENTALS . SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig

More information

Searching a Russian Document Collection Using English, Chinese and Japanese Queries

Searching a Russian Document Collection Using English, Chinese and Japanese Queries Searchig a Russia Documet Collectio Usig Eglish, Chiese ad Japaese Queries Fredric C. Gey (gey@ucdata.berkeley.edu) UC Data Archive & Techical Assistace Uiversity of Califoria, Berkeley, CA 94720 USA ABSTRACT.

More information

GE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III

GE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III GE2112 - FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III PROBLEM SOLVING AND OFFICE APPLICATION SOFTWARE Plaig the Computer Program Purpose Algorithm Flow Charts Pseudocode -Applicatio Software Packages-

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Using VTR Emulation on Avid Systems

Using VTR Emulation on Avid Systems Usig VTR Emulatio o Avid Systems VTR emulatio allows you to cotrol a sequece loaded i the Record moitor from a edit cotroller for playback i the edit room alog with other sources. I this sceario the edit

More information

Random Network Coding in Wireless Sensor Networks: Energy Efficiency via Cross-Layer Approach

Random Network Coding in Wireless Sensor Networks: Energy Efficiency via Cross-Layer Approach Radom Network Codig i Wireless Sesor Networks: Eergy Efficiecy via Cross-Layer Approach Daiel Platz, Dereje H. Woldegebreal, ad Holger Karl Uiversity of Paderbor, Paderbor, Germay {platz, dereje.hmr, holger.karl}@upb.de

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

Outline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions

Outline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions FFT Circuit Desig Outlie Applicatios of FFT i Commuicatios Fudametal FFT Algorithms FFT Circuit Desig Architectures Coclusios DAB Receiver Tuer OFDM Demodulator Chael Decoder Mpeg Audio Decoder 56/5/ 4/48

More information

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

APPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview

APPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview APPLICATION NOTE Automated Gai Flatteig Scope ad Overview A flat optical power spectrum is essetial for optical telecommuicatio sigals. This stems from a eed to balace the chael powers across large distaces.

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

More information

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1 ad Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-10559 Berli,

More information

Novel Encryption Schemes Based on Catalan Numbers

Novel Encryption Schemes Based on Catalan Numbers D. Sravaa Kumar, H. Sueetha, A. hadrasekhar / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Novel Ecryptio Schemes Based o atala Numbers 1 D. Sravaa Kumar H. Sueetha

More information

A Key Distribution method for Reducing Storage and Supporting High Level Security in the Large-scale WSN

A Key Distribution method for Reducing Storage and Supporting High Level Security in the Large-scale WSN Iteratioal Joural of Digital Cotet Techology ad its Applicatios Vol. 2 No 1, March 2008 A Key Distributio method for Reducig Storage ad Supportig High Level Security i the Large-scale WSN Yoo-Su Jeog *1,

More information

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

More information

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 9, 85-0 (2003) Evaluatio of Distributed ad Replicated HLR for Locatio Maagemet i PCS Network Departmet of Computer Sciece ad Iformatio Egieerig Natioal Chiao

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead

More information

SECURITY PROOF FOR SHENGBAO WANG S IDENTITY-BASED ENCRYPTION SCHEME

SECURITY PROOF FOR SHENGBAO WANG S IDENTITY-BASED ENCRYPTION SCHEME SCURITY PROOF FOR SNGBAO WANG S IDNTITY-BASD NCRYPTION SCM Suder Lal ad Priyam Sharma Derpartmet of Mathematics, Dr. B.R.A.(Agra), Uiversity, Agra-800(UP), Idia. -mail- suder_lal@rediffmail.com, priyam_sharma.ibs@rediffmail.com

More information

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs Dyamic Aalysis ad Desig Patter Detectio i Java Programs Outlie Lei Hu Kamra Sartipi {hul4, sartipi}@mcmasterca Departmet of Computig ad Software McMaster Uiversity Caada Motivatio Research Problem Defiitio

More information

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1 Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

Authenticating the Identity of Computer Users with Typing Biometrics and the Fuzzy Min-Max Neural Network

Authenticating the Identity of Computer Users with Typing Biometrics and the Fuzzy Min-Max Neural Network IJBSCHS (2009-4-0-06) Biomedical Soft Computig ad Huma Scieces, Vol.4, No., pp.47-53 (2009) [Origial article] Copyright 995 Biomedical Fuzzy Systems Associatio (Accepted o 2008.0.03) Autheticatig the Idetity

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P. Aalborg Uiversitet Idetificatio of the Swiss Z24 Highway Bridge by Frequecy Domai Decompositio Bricker, Rue; Aderse, P. Published i: Proceedigs of IMAC 2 Publicatio date: 22 Documet Versio Publisher's

More information

performance to the performance they can experience when they use the services from a xed location.

performance to the performance they can experience when they use the services from a xed location. I the Proceedigs of The First Aual Iteratioal Coferece o Mobile Computig ad Networkig (MobiCom 9) November -, 99, Berkeley, Califoria USA Performace Compariso of Mobile Support Strategies Rieko Kadobayashi

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic. Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig

More information

1. Introduction o Microscopic property responsible for MRI Show and discuss graphics that go from macro to H nucleus with N-S pole

1. Introduction o Microscopic property responsible for MRI Show and discuss graphics that go from macro to H nucleus with N-S pole Page 1 Very Quick Itroductio to MRI The poit of this itroductio is to give the studet a sufficietly accurate metal picture of MRI to help uderstad its impact o image registratio. The two major aspects

More information

ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES

ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES Thomas Läbe, Timo Dickscheid ad Wolfgag Förster Istitute of Geodesy ad Geoiformatio, Departmet of Photogrammetry, Uiversity of Bo laebe@ipb.ui-bo.de,

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

More information