Probability of collisions in Soft Input Decryption
|
|
- Diana Cook
- 5 years ago
- Views:
Transcription
1 Issue 1, Volume 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. Collisios of cryptographic check values cause wrog verificatio results. Therefore, it is importat to fid a aalytical form of a probability of collisios, which ca be used for estimatio of a efficiecy of Soft Iput Decryptio. It is kow, that shorter cryptographic check values cause ofte collisios. For that reaso, the umber of collisios for cryptographic check values has bee tested ad compared with the theoretical results. Keywords Collisios, Probability of Collisios, Probability of a Match, Soft Iput Decryptio. C I. INTRODUCTION HANNEL codig is a costitutioal part of commuicatio systems, which uses redudat iformatio for the recogitio or correctio of errors that occur durig the data trasfer over a oisy chael. Cryptography is icreasigly used i moder commuicatio systems to provide secure iformatio trasfer, i.e. to protect agaist eavesdroppig or maipulatio of trasmitted iformatio, or masqueradig of data origi. The cooperatio betwee chael codig ad cryptography has bee researched i [1], [] ad [3]: usig chael decodig for the improvemet of decryptio results ad, vice versa, usig cryptography for the improvemet of chael decodig. This cocept is called Joit Chael Codig ad Cryptography. A message with a cryptographic check value is trasmitted over a oisy chael usig chael codig ad decodig. The decryptio of the cryptographic check value is very fragile, because all bits of the message ad the cryptographic check value have to be correct. I case that oe bit or more of the iput of decryptio is wrog, about 50 % of decrypted bits are false, ad the verificatio of cryptographic check value fails. This problem ca be solved usig the method of correctio which is studied i this work ad called Soft Iput Decryptio: if the decoder is ot able to recostruct the Mauscript received February 9, 007; Revised received July 11,007. Nataša Živić is with the Istitute for Data Commuicatios Systems, Electrical Egieerig ad Iformatics Departmet, Uiversity of Siege, Siege, 57076, Germay ( atasa.zivic@ui-siege.de). Christoph Rulad is the maager of the Istitute for Data Commuicatios Systems ad a professor at the Electrical Egieerig ad Iformatics Departmet, Uiversity of Siege, Siege, 57076, Germay ( christoph.rulad@ui-siege.de). origial message ad cryptographic check value because of a oisy chael or iefficiecy of the chael decodig algorithm, it is possible to correct the message with the cryptographic check value usig side iformatio of the chael decoder i form of so called L-values. Chael decodig ca be improved usig a message with cryptographic check value which has bee corrected by Soft Iput Decryptio. This method is studied i this work as well ad it uses corrected L-values as feedback iformatio to the chael decoder for improved decodig of those bits which have ot bee yet corrected. The feedback method is iterative, because L-values corrected i oe roud are used for the correctio of bits i the ext iteratio. Collisios of cryptographic check values cause wrog verificatio results. The probability of collisios has bee calculated i this paper. II. CRYPTOGRAPHIC MECHANISMS OF DATA INTEGRITY AND DATA ORIGIN AUTHENTICATION Data itegrity is the property that data have ot bee altered or destroyed i a uauthorized maer [4, 5]. As data ca be chaged durig the trasfer or storig phase, it is importat to check that o modificatio happeed util they were received. Data origi autheticatio is the corroboratio that the source of data received is as claimed [5, 6]. It is the cryptographic service, which proves the idetity of the data origi, i.e. that data were ideed set by the etity which is assumed to be the origiator. Hash values, MAC/H-MACs ad digital sigatures are cosidered as redudacy values i this work, because they have differet legths which ifluece the codig gai, code rate ad probability of collisios. A. Hash Fuctios A hash fuctio is a oe-way fuctio which maps strigs of bits of variable legth to fix-legth strigs of bits, satisfyig two followig properties: - for a give output, it is computatioally ifeasible to fid a iput which maps to this output ad - for a give iput, it is computatioally ifeasible to fid a secod iput which maps to the same output [7]. The same stadard defies a hash code as the strig of bits which is the output of the hash fuctio. A collisio resistat hash fuctio is defied as a hash fuctio satisfyig the followig property: it is computatioally ifeasible to fid ay two distict iputs
2 Issue 1, Volume 1, 007 which map to the same output. Computatioal feasibility depeds o the specific security requiremets ad eviromet [7]. Collisio resistat hash fuctios are used for the geeratio of digital sigatures. The most commoly used legths of hash value are 160, 8 ad 56 bits. I this case, the collisio probability is greater tha 0.5 after about 80 radomly chose iput messages accordig to the birthday paradox. B. Message Autheticatio Codes (MAC) MAC is a applicatio of a symmetric block cipher [4]. Examples of used block cipher algorithm are DES [8], 3 DES ad AES [9]. ISO/IEC specifies MAC algorithms that use a secret key ad a -bit block cipher to calculate a -bit MAC. These mechaisms ca be used as data itegrity mechaisms to verify the fact that data have ot bee altered. MAC provides oly subective autheticatio, because idetity of data origi caot be prove by a third party (at least two parties are able to geerate the same MAC) [10]. MAC ca oly be used as a message autheticatio mechaism to provide assurace that a message has bee origiated by a etity i possessio of the secret key. A MAC algorithm is a fuctio which maps a strig D of bits ad a secret key K to fixed-legth strigs of bits, satisfyig the followig properties [4]: - for ay key ad ay iput strig the fuctio ca be computed efficietly - for ay fixed key, ad give o prior kowledge of the key, it is computatioally ifeasible to compute a fuctio value o ay ew iput strig. It should be oted that the birthday paradox applies also o MACs. Typical legth of the MAC is the block legth of the block cipher, i.e. 64 or 18 bits. Details about the MAC algorithm are give i [4]. C. Hashed Message Autheticatio Codes (H-MAC) [11] specifies MAC algorithms that use a secret key ad a hash fuctio (or its roud - fuctio) with a -bit result to calculate a m-bit MAC. These mechaisms ca be used as data itegrity mechaisms to verify that data have ot bee altered i a uauthorized maer. They ca also be used as message autheticatio mechaisms to provide assurace that a message has bee origiated by a etity i possessio of the secret key [11]. The legth of H MAC is the same as that of uderlyig hash fuctio: 64, 160, 8 or 56 bits, but the legth ca be adusted as ecessary. For example, for hash fuctios RIPEMID 160 ad SHA 1 the legth of H MAC is 160 bits. Collisio resistace of H MAC is defied as for hash fuctio (see chap. II A.). A H-MAC algorithm (or hashed cryptographic check fuctio) computes a fuctio which maps strig D of bits ad a secret key K to fixed-legth strigs of bits (H-MAC or hashed cryptographic check value), satisfyig the followig properties [11]: - for ay key ad ay iput strig the fuctio ca be computed efficietly - for ay fixed key, ad give o prior kowledge of the key, it is computatioally ifeasible to compute a fuctio value o ay ew iput strig. Details about the H-MAC algorithm are give i [11]. D. Digital Sigatures Digital sigatures provide data origi autheticatio ad support o-repudiatio services. They ormally use asymmetric cryptography, eve if there are solutios for symmetric algorithms based digital sigatures [1]. There are two types of digital sigatures: 1. sigatures givig message recovery (Fig. 1) [13]. sigatures with appedix (Fig. ) [14, 15]. a) Fig. 1 Digital Sigatures givig message recovery (simplified): a) Geeratio b) Verificatio Sigatures givig message recovery ca be applied to short messages, which are exteded by a oetime presigature before the executio of the sigature operatio (see Fig. 1). The decryptor recovers the message from the sigature, if the sigature is proved to be correct. Short message meas, that the legth of the message plus b)
3 Issue 1, Volume 1, redudacy is shorter tha the legth of the private key used i the sigature algorithm. If the message does ot cotai eough redudacy for verificatio, it is added by use of a hash fuctio. If the message is too log, the message recovery is partial. I this case the message is divided ito recoverable part (icluded i the sigature) ad orecoverable part (stored ad/or trasmitted alog with the sigature) [13]. I the case of digital sigatures with appedix, the message has a arbitrary legth (Fig. ). The ecryptor geerates a digital sigature over a hash value which has bee calculated over the message to be siged. The decryptor computes the hash value over the received message ad verifies the sigature by usig the public key. The result of the sigature verificatio is true or false. a) repudiatio. The algorithm of Soft Iput Decryptio (Fig. 3) is as follows: The decryptio is successfully completed, if the verificatio of the cryptographic check value is successful, i.e. the output is true. If the verificatio is egative, the soft output of the chael decoder is aalyzed ad the bits with the lowest L values are flipped (XOR 1 ), the the decryptor performs the verificatio process ad proves the result of the verificatio agai. If the verificatio is agai egative, bits with aother combiatio of the lowest L -values are chaged. This iterative process will stop whe the verificatio is successful or the eeded resources are cosumed. I case that the attempts for correctio fail, the umber of errors is too large as a result of a very oisy chael or a attack, so that the resources are ot sufficiet to try eough combiatios of flippig bits of low L -values. It may happe that the attempts for correctio of SID block succeed, but the corrected cryptographic value is ot equal to the origial oe: a collisio happes. This case has a extremely low probability whe cryptographic check values are chose uder security aspects. Collisio aspects of cryptographic check values i Soft Iput Decryptio are the subect of this paper. Fig. Digital Sigatures with appedix (simplified): b) a) Geeratio b) Verificatio I both cases, the verificatio result is egative if the iput of the sigature verificatio compared to the output of the siger is modified, or the public key ad private key do ot belog to the same key system. Digital sigatures ad messages - as iput to the decryptor - have to be delivered from the chael decoder free of errors or modificatios to verify the sigature successfully. III. SOFT INPUT DECRYPTION The basic techique which is described ad used i this work is called Soft Iput Decryptio. It cosists of a decryptor which uses soft output of the chael decoder as soft iput. [1]. The cryptographic mechaism which is used by ecryptor ad decryptor geerates ad verifies cryptographic check values (hash values, digital sigatures, MACs, H-MACs) providig data itegrity, data origi autheticatio ad o Fig. 3 Algorithm of the Soft Iput Decryptio Soft Iput Decryptio is block orieted. The block which is take from sequetial iput bits to the chael ecoder ad should be corrected by Soft Iput Decryptio after chael decodig is called SID block (Soft Iput Decryptio block). The SID block may have differet cotets depedig o cryptographic mechaisms ad scearios []. IV. COLLISIONS Collisios caused by chages of bits of a message ad of a redudacy check value by Soft Iput Decryptio (SID) will be aalyzed ad calculated i this paper. A redudacy check value RCV is a cryptographic check value CCV (digital sigature, MAC, H-MAC), if
4 Issue 1, Volume 1, cryptographic check fuctios are used or ay other systematic redudacy value added to a message, for example hash value or CRC. The redudacy check value is the result of a redudacy check fuctio RCF. Note: A hash value has characteristics of a cryptographic check fuctio, but the properties are of a redudacy check fuctio if the hash value is ot combied with ay other cryptographic mechaism. A hash value itself provides o security. The problem of collisios is described i Fig. 4. Note: This type of collisio does ot represet a collisio i the cryptographic sese defied for hash fuctios. This coditio causes wrog results, although the verificatio is successful. Therefore, this evet is regarded as a collisio. This type of collisio happes by chagig bits by Soft Iput Decryptio ad is also the subect of this paper. V. THE PROBABILITY OF MATCH A match is the evet, that the verificatio is successful: RCF ( = RCV" (4) The probability of a match is defied as: Fig. 4 Descriptio of the problem There are followig types of collisios: Type 1: It may happe that the first verificatio before Soft Iput Decryptio started is successful, although the origially set message ad the message which resulted i the successful verificatio are differet. The coditio for collisio i these cases is: [( message message ') ( RCF ( message ') = RCV ')] The collisio is caused by modificatios durig the trasmissio over the chael which could ot be corrected by the chael decoder. This type of collisio is ot a implicatio of Soft Iput Decryptio. For this reaso this collisio will ot be the subect of this paper. Type : It may happe that RCV is equal to the origially set RCV, ad verificatio is successful, although the origially set message ad message are differet. The coditio for this type of collisio is: [( message ( RCV = RCV") ( RCF( This type of collisio happes by chagig bits by Soft Iput Decryptio ad is the subect of this chapter. This type of collisio represets a collisio i the cryptographic sese defied for hash fuctios. Type 3: It may also happe that RCV differs from the origially set RCV, ad a message differs from origially set message, but the verificatio is successful. The coditio for this type of collisio is: [( message ( RCV RCV") ( RCF( (1) () (3) P match = P[ RCF( (5) i ay trial of Soft Iput Decryptio. The correct match P correct is the case that the message ad redudacy check value are corrected by Soft Iput Decryptio ad that o collisio happeed: [( message = ( RCF( The probability of a match betwee the message ad redudacy check value will be calculated uder followig assumptios: 1. all redudacy check values have the same probability of appearace. bits which are chaged i Soft Iput Decryptio are radomly distributed over the message ad redudacy check value. *Note: This assumptio is true for CRC, but it is ot prove that it is true for, for example, hash values. p(match, i) is the probability that a match happes whe i bits of chaged bits are i the message part. Because of assumptio., the probability that i bits of flipped bits are located i the message part of legth of m is give by hypergeometric distributio [10]: (6) m i i p m ( i) =, i = 0,1,..., (7) m + For example, if = 16 ad m = (Fig.53), distributio of i is symmetrical aroud the most likely value i = 8, which meas that it is most likely that the same umber of chaged bits is located i the message ad i the redudacy check value, as expected. For m > the distributio is ot symmetrical ad positios of lowest L -values are mostly i the message. I the case preseted i Fig. 4 with m =, it is
5 Issue 1, Volume 1, most likely that 11 positios of the lowest L values are placed i a message, i.e. 5 positios are i redudacy check value. p i, match i = (9) ad the opposite probability that o match with a specific message occurs is: p i, match 1 pi, match = (10) After attempts of tests, with i bits i the message part, the probability that o match occurs is: i p ( match i) ( p i, match ) 1 = = (11) Fig. 5 Probability p (i) whe m = ( = 16) So, the probability of a match after attempts with i bits i the message part is: p i ( match i) 1 1 = (1) The probability of a match whe i bits with the lowest L values are i a message part is p(match i). The probability of a match p match, whe bits are flipped, ca be calculated as the sum of probabilities of matches for each i: p = p( match, i) = p ( i) p( match i) (8) match Fig. 6 Probability p (i) whe m = ( = 16), i= 0 i= 0 Flippig chose bits withi the Soft Iput Decryptio algorithm, a set of i differet messages ad a set of -i differet redudacy check values are obtaied. The redudacy check fuctio of each of i messages might be equal to ay of -i produced redudacy check values. The probability that ay of -i redudacy check values match to oe specific message is: m Whe the umber of flipped bits is icreased from -1 to, -1 tests are performed, because these tests have ot bee performed before. If the additioally flipped bit is i a m i message part, it happes with the probability of. m + Vice versa, if the additioally flipped bit is i a redudacy check value part, it happes with the probability of ( i). Fially, the probability of a match after flippig m + up to N bits is give as: where ad B = P match = A + B, (13) m i 1 N 1 i ( i) = = i i = i 1 m+ m+ A (14) N 1 = 1 i= 1 m m i i i 1 m+ m+ i i 1 1 (15)
6 Issue 1, Volume 1, VI. THE PROBABILITY OF COLLISIONS A collisio as a implicatio of Soft Iput Decryptio happes i case. (collisio type ) ad 3. (collisio type 3) of Chapter III ad ca be calculated as: P coll = P P (16) match correct The correct match (P correct ) is oe of m+ possible matches of messages ad redudacy check values: P correct m + = 1 (17) The collisio probability is, usig equatios (11), (1), (15) ad (16): P = A + B (18) coll P correct where A ad B are give by equatios (14) ad (15), respectively. The results of tests are show i Fig. 8 i compariso to the results of equatio (18). The results of equatio (18) deped maily o the legth of the redudacy check value, ad they stay almost costat, if the legth of the message chages (the results chage o 7. or higher decimal positio). Tested collisio probability of Soft Iput Decryptio depeds also o the legth of the redudacy check value ad has o sigificat chage (o 4. or higher decimal place) with the chage of message legth, but it is lower tha the collisio probability calculated by equatio (18). The reaso that tested collisio probability is lower tha the oe of equatio (18) is that the equatio (18) is got assumig radom combiatios of chaged bits. Soft Iput Decryptio uses L -values to fid the correct message ad ot radom combiatios of chaged bits, so that the probability of the correct match is much higher tha that i equatio (17). For that reaso, the results of equatio (18) theoretic results i Fig. 8, ca be used as the worst case, i.e. a upper limit of the collisio probability. VII. COLLISION TESTS Collisio tests were performed by simulatios of Soft Iput Decryptio usig short redudacy check values (up to 4 bits) ad messages of various legths, for N = 8. All simulatios are programmed i C/C++ programmig laguage. For each poit of the curves tests are performed, which is eough for reliability of results [16]. The trasfer of the SID block is simulated by the use of a AWGN chael. The used covolutioal ecoder has a code rate r = 1/ ad costrait legth m = (Fig. 7). The decoder uses a MAP algorithm [17]. SHA-1 hash fuctio (160 bits) is used as a redudacy check fuctio. Shorter redudacy check values used for tests are got by takig right most bits of the hash value. Soft Iput Decryptio tests stopped after the first successful verificatio. After each verificatio it is checked if the verificatio is correct or a collisio happeed. So, the umber of collisios is couted. u c 1 c Fig. 8 Compariso of collisio results of tests ad theoretical results for up to 8 trials VIII. CONCLUSION This paper aalyzes probability of collisios which ca happe usig Soft Iput Decryptio. Collisios are stadard problem i cryptography, as they implicate wrog verificatio results. Probability of collisios grows as the legth of cryptographic check values decrease. Computatio of probability of collisio has bee performed by subtractio of the probability of match ad probability of the correct match. Additioally, simulatios have bee performed for compariso of aalytical (theoretical) results ad results of tests. The compariso shows that aalytical results ca be used for estimatio of the efficiecy of Soft Iput Decryptio, as the upper boud of probability of collisios of Soft Iput Decryptio. Fig. 7 Covolutioal ecoder r = ½, m =
7 Issue 1, Volume 1, REFERENCES [1] N. Živić, C. Rulad, Soft Iput Decryptio, 4 th Turbocode Coferece, 6 th Source ad Chael Code Coferece, VDE/IEEE, i Plastics, Muich, April 006. [] N. Živić, C. Rulad: Chael Codig as a Cryptography Ehacer, Advaces i Commuicatios, Proceedig i the 11th WSEAS iteratioal coferece o Commuicatios (part of the 007 CSCC multicoferece), Agios Nikolaos, Crete Islad, Greece, July 007. [3] N. Živić, C. Rulad, Feedback i Joit Codig ad Cryptography, 7 th Iteratioal ITG Coferece o Source ad Chael Codig VDE/IEEE, Ulm, Jauary 008. [4] ISO/IEC , Iformatio techology Security techiques Message Autheticatio Codes (MACs) Part 1: Mechaisms usig a block cipher, [5] ISO/IEC , Iformatio techology Security techiques Norepudiatio Part 1: Geeral, 004. [6] ISO/IEC , Iformatio techology Security techiques Etity autheticatio mechaisms Part 1: Geeral, [7] ISO/IEC , Iformatio techology Security techiques Hashfuctios Part 1: Geeral, 000. [8] ISO/IEC 837, Modes of operatio for 64-bit block cipher algorithm, [9] ISO/IEC , Iformatio techology Security techiques Ecryptio algorithms Part 3: Block ciphers, 005. [10] C. Rulad, Iformatiossicherheit i Dateetze, Datacom Verlag, Bergheim, [11] ISO/IEC 9797-, Iformatio techology Security techiques Message Autheticatio Codes (MACs) Part : Mechaisms usig a hash- fuctio, 000. [1] C. Rulad, Realizig digital sigatures with oe-way hash fuctio, Cryptologia, Vol XVII, Number 3, July [13] ISO/IEC 9796-, Iformatio techology Security techiques Digital sigatures givig message recovery Part : Discrete logarithm based mechaisms, 006. [14] ISO/IEC , Iformatio techology Security techiques Digital sigatures with appedix Part 1: Geeral, [15] ISO/IEC , Iformatio techology Security techiques Cryptographic techiques based o Elliptic Curves Part 4: Digital sigatures givig message recovery, 004. [16] M. Jeruchim, P. Balaba, K. S. Shamuga, Simulatio of Commuicatio Systems, Kluwer Academic/Pleum Publ, New York, 000. [17] L. Bahl, J. Jeliek, J., Raviv, F. Raviv, Optimal decodig of liear codes for miimizig symbol error rate, IEEE Trasactios o Iformatio Theory, IT-0, March 1974.
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 informationMessage 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 informationECE4050 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 informationA 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 informationPrivate 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 informationBayesian 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 informationBig-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 informationNetwork Security. Chapter 2 Basics 2.3 Cryptographic Hash Functions. Motivation (1) Motivation (2) Cryptographic Hash Functions: Definition
Chair for Network Architectures ad Services Departmet of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.3 Cryptographic Hash Fuctios Motivatio Cryptographic Hash Fuctios SHA-1 Message
More informationLecture 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 informationSecurity 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 informationAnalysis 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 informationWYSE 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 informationAn Improvement of the Basic El-Gamal Public Key Cryptosystem
Iteratioal Joural of Computer Applicatios Techology ad Research A Improvemet of the Basic El-Gamal Public Key Cryptosystem W.D.M.G.M. Dissaayake (PG/MPhil/2015/09 Departmet of Computer Egieerig Faculty
More informationEE 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 informationCSC 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 informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationBASED 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 informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationChair for Network Architectures and Services Department of Informatics TU München Prof. Carle. Network Security
Chair for Network Architectures ad Services Departmet of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Cryptography 2.2 Cryptographic Hash Fuctios Motivatio Cryptographic Hash Fuctios SHA-1,
More informationMessage 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 informationLecture 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 informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationRedundancy 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 informationElementary 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 information3D 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 informationIMP: 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 informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationSECURITY 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 informationPolynomial 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 informationOnes 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 informationAn 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 informationISSN (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 informationChair for Network Architectures and Services Department of Informatics TU München Prof. Carle. Network Security
Chair for Network Architectures ad Services Departmet of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Cryptography 2.2 Cryptographic Hash Fuctios Motivatio Cryptographic Hash Fuctios SHA-1,
More informationBig-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 informationAN 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 informationChapter 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 informationImproving 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 informationEvaluation 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 informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationAuthenticating Aviation Augmentation System Broadcasts
Autheticatig Aviatio Augmetatio System Broadcasts Sherma C. Lo, Staford Uiversity Per K. Ege, Staford Uiversity BIOGRAPHY Sherma C. Lo is curretly a seior research egieer at the Staford Uiversity Global
More informationCS 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 informationImproving 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 informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationThe 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 informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationNovel 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 informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationExtending The Sleuth Kit and its Underlying Model for Pooled Storage File System Forensic Analysis
Extedig The Sleuth Kit ad its Uderlyig Model for Pooled File System Foresic Aalysis Frauhofer Istitute for Commuicatio, Iformatio Processig ad Ergoomics Ja-Niclas Hilgert* Marti Lambertz Daiel Plohma ja-iclas.hilgert@fkie.frauhofer.de
More information1. 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 informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationRandomized and Quantum Protocols in Distributed Computation
Radomized ad Quatum Protocols i Distributed Computatio Michael Be-Or The Hebrew Uiversity Michael Rabi s Birthday Celebratio Radomized Protocols Power of Radomizatio Expoetial speedup for kow algorithms
More informationA 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 information15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015
15-859E: Advaced Algorithms CMU, Sprig 2015 Lecture #2: Radomized MST ad MST Verificatio Jauary 14, 2015 Lecturer: Aupam Gupta Scribe: Yu Zhao 1 Prelimiaries I this lecture we are talkig about two cotets:
More informationProtecting Biometric Templates with Image Watermarking Techniques
Protectig Biometric Templates with Image Watermarkig Techiques Nikos Komios ad Tassos Dimitriou Athes Iformatio Techology, GR-19002 Peaia Attiki, Greece {kotdim}@ait.edu.gr Abstract. Biometric templates
More informationΤεχνολογία Λογισμικού
ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationOntology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection
2017 Asia-Pacific Egieerig ad Techology Coferece (APETC 2017) ISBN: 978-1-60595-443-1 Otology-based Decisio Support System with Aalytic Hierarchy Process for Tour Pacage Selectio Tie-We Sug, Chia-Jug Lee,
More informationCS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1
CS200: Hash Tables Prichard Ch. 13.2 CS200 - Hash Tables 1 Table Implemetatios: average cases Search Add Remove Sorted array-based Usorted array-based Balaced Search Trees O(log ) O() O() O() O(1) O()
More informationData 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 informationAdaptive 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 informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationFurther 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 informationA Study on the Performance of Cholesky-Factorization using MPI
A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio
More informationReliable 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 informationFast 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 informationPruning 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 informationCSE 417: Algorithms and Computational Complexity
Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm
More informationPattern 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 informationThroughput-Delay Tradeoffs in Large-Scale MANETs with Network Coding
Throughput-Delay Tradeoffs i Large-Scale MANETs with Network Codig Chi Zhag ad Yuguag Fag Departmet of Electrical ad Computer Egieerig Uiversity of Florida, Gaiesville, FL 326 Email: {zhagchi@, fag@ece.}ufl.edu
More informationAlgorithm. Counting Sort Analysis of Algorithms
Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will
More informationDESIGN AND ANALYSIS OF LDPC DECODERS FOR SOFTWARE DEFINED RADIO
DESIGN AND ANALYSIS OF LDPC DECODERS FOR SOFTWARE DEFINED RADIO Sagwo Seo, Trevor Mudge Advaced Computer Architecture Laboratory Uiversity of Michiga at A Arbor {swseo, tm}@umich.edu Yumig Zhu, Chaitali
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
More informationMAC Throughput Improvement Using Adaptive Contention Window
Joural of Computer ad Commuicatios, 2015, 3, 1 14 Published Olie Jauary 2015 i SciRes. http://www.scirp.org/joural/jcc http://dx.doi.org/10.4236/jcc.2015.31001 MAC Throughput Improvemet Usig Adaptive Cotetio
More informationBAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini
Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR
More informationFREQUENCY 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 informationRandom 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 informationCS 111: Program Design I Lecture 15: Objects, Pandas, Modules. Robert H. Sloan & Richard Warner University of Illinois at Chicago October 13, 2016
CS 111: Program Desig I Lecture 15: Objects, Padas, Modules Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago October 13, 2016 OBJECTS AND DOT NOTATION Objects (Implicit i Chapter 2, Variables,
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationAvid Interplay Bundle
Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers
More informationHADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING
Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is
More informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationLecture 10 Collision resolution. Collision resolution
Lecture 10 Collisio resolutio Collisio resolutio May applicatios ivolve a iquiry over a shared chael, which ca be ivoked for: discovery of eighborig devices i ad hoc etworks, coutig the umber of RFID tags
More informationOur second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.
Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for
More informationPerformance Analysis of Multiclass FIFO: Motivation, Difficulty and a Network Calculus Approach
Performace Aalysis of Multiclass FIFO: Motivatio, Difficulty ad a Network alculus Approach Yumig Jiag Norwegia Uiversity of Sciece ad Techology (NTNU) 1 19 March 2014, 2d Workshop o Network alculus, Bamberg,
More information