Robust and Reversible Relational Database Watermarking Algorithm Based on Clustering and Polar Angle Expansion
|
|
- Hillary Stewart
- 5 years ago
- Views:
Transcription
1 Robust and Reversble Relatonal Database Watermarkng Algorthm Based on Clusterng and Polar Angle Expanson Zhyong L, Junmn Lu and Wecheng Tao College of Informaton Scence and Engneerng, Hunan Unversty, Changsha, Chna Abstract. Dgtal watermarkng has been wdely appled to relatonal database for ownershp protecton and nformaton hdng. But robustness and reversblty are two key challenges due to the frequently database mantanng operators on those tuples. Ths paper proposes a novel relatonal database watermarkng scheme based on a fast and stable clusterng method on database tuples, whch adopts Mahalanobs dstance as the smlarty measurement. Before the process of watermark embeddng and detectng, the databases tuples are adaptvely clustered nto groups accordng to the length of bnary watermark. Moreover the watermark segments are respectvely embedded nto or detected from those groups accordng to the numerc feld's Lowest Sgnfcant Bt (LSB) and polar angle expanson. The majorty decson strategy s used to determne the value of watermark bt n blnd detecton process. The experment results ndcate that the proposed watermarkng scheme has hgher robustness and reversblty under blnd detecton aganst the database mantanng operators. Keywords: Database watermarkng, robustness, reversblty, blnd detecton, tuples clusterng, polar angle expanson. Introducton Dgtal watermarkng s developed n recent years as a potental nformaton securty key technology, whch can determne the ownershp or orgnalty of dgtal content by embeddng percevable or unpercevable nformaton n dgtal works []. It has better characterstcs on securty, nvsblty and robustness [2]. Smlarly, database watermarkng has been proposed on large database securty-control. However, there are some dfferences between relatonal database and multmeda data [3]. So database watermarkng should also have the ablty of real-tme update and blnd detecton and cannot drectly adopt those multmeda watermarkng method. It s more dffcult to ensure the robustness and reversblty of database watermarkng. In recent years, scholars have carred out extensve research on database watermarkng. The groundbreakng study n ths area was conducted by R. Agrawal and R. Son n 2002 [4], [5]. In 2003, X.M. Nu proposed that a meanngful strng
2 could be nserted nto relatonal database as the watermark [6]. Y.J. L rased a method of nsertng watermark by changng the order of relatonal data ndex [7], and t does not change the physcal locaton or data value to mpar ts use. Y. Zhang converted mage nformaton nto watermark cloud droplets accordng to D.Y. L's cloud model dea, and then embedded t nto relatonal data [8]. When beng extracted, the cloud droplet should be compared wth orgnal copyrght mage. Moreover, Y. Zhang put forward a r eversble watermarkng method for relatonal database [9] that took the dfferences at the end of relatonal data and expanded t usng wavelet transformaton, then embedded watermark nformaton. G. Gupta utlzed dfference expanson and Lowest-Effectve-Bt on ntegers to acheve embeddng and blnd detecton of watermark, but the method s only used for nteger data that make t not unversal [0]. Many other watermark workers also make a lot of efforts to promote the development of database watermarkng []-[4], yet there are stll many shortcomngs n current study, they could be ncluded nto two aspects: On one hand the watermark robustness s too weak to resst varous conventonal database operatons and llegal watermark attacks, such as selecton, addton, modfcaton and so on, on the other hand the orgnal relaton cannot be restored from the watermarked relaton. As a result, how to mprove the robustness and reversblty of database watermarkng s a very dffcult and sgnfcant work. To mprove the robustness and reversblty of database watermarkng, the paper puts forward an adaptve relatonal database watermarkng scheme based on clusterng and polar angle expanson. 2 Method Allowng for the dsorderlness of tuples and attrbutes, nsuffcent redundant space of database, along wth weak robustness of the general database watermarkng algorthm, t s practcable to realze the database watermarkng embeddng and robust detecton wth the stable, hgh-effcency and large-capacty database tuples clusterng method, whch s regarded as the bass of database watermarkng algorthm n ths paper. Meanwhle there are frequently database mantanng operators on tuples and attrbutes whch would affect the robustness of database watermarkng, and we use the majorty decson method to solve the problem when extractng watermark. Moreover, the orgnal data should be restored exactly after extractng watermark for a hghly avalable database, whch means that the watermark should have not only robustness but also reversblty. We already studed a reversble and blnd database watermark method based on polar angle expanson before [5], whch maps the attrbutes to polar coordnates and embeds watermark nto those ponts extendng polar angle. In vew of the aforementoned tuples clusterng, majorty decson strategy and our prelmnary related study, the paper proposes a r obust and reversble database watermark method based on clusterng and polar angle expanson for numercal data. The man dea s as follows: Frst we classfy the tuples by the gven number, and each category represents a partcular meanng; Next use a key as a pseudo-random number seed to produces pseudo-random numbers to select the watermark embeddng 2
3 poston n each category, then map these attrbutes to polar coordnates one by one, and embed watermark nto those ponts extendng polar angle; Fnally take the LSB method to extract the watermark. Some notatons used n the watermarkng algorthms are gven n table. Table. Notatons used n the watermarkng algorthms. Notaton Explanaton Notaton Explanaton W Bnary bt length f ( x) = hash( x) Hash functon that meet hash( Y ) = hash( Y ) R Orgnal database α = ( α, α2,, α n ) Polar angle correspondng to Y that meet R Expendng polar angle Watermarked β = ( β, β2,, β n ) correspondng to Y that database meet Y = hash( Y ) tan ( β ) Database tuple Y = ( y, y2,, y n ) attrbute where the watermark wll be embedded p( D ) Watermark detecton rate Database tuple Y = ( y, y 2,, y n ) attrbute where the W = w, w2,, wn Bnary representaton of watermark have the watermark been embedded G = ( g, g,, g k ) Tuples clusterng µ The up lmt of data 2 { } L = L, L,, Lk 2 Accumulaton pont change 2. Tuples Clusterng Here we apply the fast clusterng method to the classfcaton of database tuples, whch begns wth classfyng samples roughly, then uses certan regulatons to adjust the categores gradually based on the dstance between samples. It s sutable for clusterng analyss of large data sets. The smlarty of samples s measured by dstance. Due to the dsunty of varous attrbutes unts n database, n order to elmnate the nfluence of dmenson, ths paper adopts Mahalanobs dstance to cluster the tuples. Defnton (Mahalanobs Dstance) : x (, 2,, ) T = x x xq for =, 2,, n represents n samples. Mahalanobs dstance s marked as T d( x, xj) = ( x xj) s ( x xj) where s s the covarance matrx of samples. Defnton 2 (Clusterng):For a data set A= ( a, a2,, a n ), clusterng algorthm s to classfy A nto k categores marked as G = ( g, g2,, g k ) accordng to the gven rule. Each category has hgh smlarty but dffer greatly from other category, k and t meets the condton g = A where g g j =, j. = Defnton 3: q and n respectvely ndcate the number of attrbutes and tuples 3
4 n database R, so n tuples can be taken as n samples n q dmensonal space. Procedure of Fast Clusterng. L = x 0, x 0,, x 0 k ncludes k ntal cluster ponts. Step. Suppose the set 0 { 2 } Step2. Acheve ntal classfcaton accordng to the followng rule: G 0 ( 0 ) { ( 0 = d xx, x: d xx, j), j=, 2,, k, j }, =, 2,, k Thus n samples are dvded nto k non-ntersect categores G { = G, G2,, Gk } by ther respectve closest ntal cluster pont. Step3. Calculate new cluster ponts set L { x, x2,, xk} x = xl, =, 2,, k s the barycenter of n 0 xl G = based on G 0, where 0 G and n s the number of samples. Next classfy samples agan by L to get a n ew classfcaton G { = G, G2,, Gk}. t t t Then calculate n turn as above. Assumng we get a classfcaton Gt = { G, G2,, Gk} n step t, where x s the barycenter of Gt and nether sample nor the barycenter t of Gt. As the ncrease of t, the classfcaton tends to be stable when approxmate to the barycenter of G t and t+ t t+ t t x x x, G G, and the calculaton can t+ be stopped now. Sometmes classfcaton { t+ t+ G t G, G2,, Gk } t t t Gt { G, G2,, Gk} + = and = are just the same from step t n practcal calculaton, and at ths pont the calculaton can be over. As a r esult, we can use the fast clusterng method measured by Mahalanobs dstance to classfy orgnal database tuples nto desred categores. The convergence condton s as below: when the changed maxmum dstance of cluster ponts s less than or equal to a specfed value multpled by the mnmum dstance of orgnal cluster ponts, the algorthm wll be termnated. 2.2 Database Watermarkng Algorthm Adaptve Factor. We should analyze the nfluence of embedded watermark to data before gvng specfc watermarkng algorthm. Suppose the clusterng result of data set A s G = ( g, g2,, g k ) before embeddng watermark and G = ( g, g 2,, g k ) after embeddng watermark. Interleaved class s defned as follows. Defnton 4 (Interleaved Class):For x A, f x belongs to a classfcaton before embeddng watermark but not belongs to t after embeddng watermark, x s called nterleaved class, that s, ( x g) &&( x g j), where j. Assumng the mnmum dstance between any two adjacent classfcatons s { mn (, ),, } d = d x x x g x g a b. In order to avod arsng nterleaved class, ab j a j b the change of data should meet the followng stuaton: 4
5 η µ () η ga + dab ab, =, 2,, k, a b 2 The neghborhood η of x s shown n fgure, where x s any sample of classfcaton g a, x s the sample after embeddng watermark, d ab s the nearest dstance between g a and g b. Thus, the change of data just needs to meet x x ga + dab ab, =, 2,, k, a b. 2 Watermarkng Embeddng Algorthm. Step. Generate bnary watermark and use fast clusterng method to classfy database tuples nto W categores and lst ts sequence. Step2. Use hash map to select the locaton of the watermark embeddng, whch take the key and the tuple prmary key as parameters. Step3. Select the Y = ( y, y2,, y ) watermark embeddng attrbute n and calculate the correspondng polar angle α based on lterature [5]. Step4. Get the expandng polar angle β by combnng the polar angle related to each category wth one watermark bt successvely. Step5. Calculate the watermarked attrbute and wrte t back to the database. The number of embedded multplcty s m, and the method of embeddng watermark s to change the least sgnfcant bt. The database owner holds the key, the number of embedded multplcty and the length of watermark. Watermarkng Detecton and Data Recovery Algorthm. Watermarkng detecton and data recovery s the nverse of the embeddng process. Step. Classfy test database nto W categores, and use the rankng functon to acheve synchronzaton of detectng watermarkng, whch takes secret key as parameters and lsts ts sequence based on tuple prmary key. Step2. Use the key to fnd the poston of embedded watermark and calculatng the correspondng polar angle β. Step3. Extract watermark from β by the means of LSB and majorty decson method and get polar angle α. Step4. Restore the orgnal attrbute and wrte t back to the database. Fg.. Stuaton that the change of data needs to meet. Fg. 2. Detecton stuaton of subset selecton attack. Fg. 3. Detecton stuaton of subset addton attack. Fg. 4. Detecton stuaton of subset modfcaton attack. 5
6 3 Smulaton Experment and Analyss We use open-source database MySQL to make research and smulaton of database watermark and take vsual studo as fore-end. There s tuples, each of whch has 2 attrbutes (attrbutes value s generated randomly by computer). Selectng 0 numerc data as canddate attrbutes to embed watermark, and nsertng HNU nto database for 00 tmes. Moreover expermental result s compared wth lterature [0] algorthm under the same data set. Invsblty. The holstc nfluence of embedded watermark to each attrbute column of data n database (Rounded to 3 decmal places) s shown n table 2. It can be seen that the error caused by embeddng watermark s very small and not far removed from the result of lterature [0] algorthm. Table 2. Invsblty after embeddng watermark. The changed rato of Mean (%) The changed rato of Varance (%) Attrbutes Lterature [0] Lterature [0] Our algorthm Our algorthm algorthm algorthm a a a a a a a a a a Test of Database reversblty. Due to space lmtatons, here we only talk about a group of 24 watermarked attrbutes, as shown n table 3. We can fnd that the restoraton s satsfactory. Table 3. Stuaton before and after data restoraton. Before restoraton After restoraton Before restoraton After restoraton Before restoraton After restoraton
7 Test of Watermarkng Robustness. The smulated attacks nclude subset selecton, subset addton and subset modfcaton. These attack tests take the current system tme as random seed and select tuples and attrbutes randomly (takng the average of 20 tests). The result of smulaton experment s shown n Fgure 3, 4 and 5. Fgure 3 shows that the detecton effect on subset selecton attack s better than the algorthm from lterature [0] and ncreased by nearly 5%. Fgure 4 shows that the robustness on subset addton attack s preferably and relatvely stable. Fgure 5 shows that the robustness on subset modfcaton attack s the same as lterature [0] algorthm on the whole. Analyss of Algorthm Tme Complexty. Algorthm : The orgnal operatons of fast clusterng whch classfy n samples nto k categores nclude calculatng the dstance between two samples, comparng the sze, and calculatng cluster ponts. Suppose f( n) = On ( + k) + Onqk ( ( )) represents the tme complexty at the teratons, where the frst tem s the tme complexty of computng cluster ponts and the second tem s the asymptotc tme complexty at one clusterng. The algorthm wll be stopped after n teratons, so the whole asymptotc tme complexty s: T ( n) = O( tkqn) (2) Where t s the number of teratons, k s the class number of clusterng, q s the number of attrbutes (dmensonalty) and n s the samples number. Algorthm 2: Watermarkng embeddng ncludes bnarzng, clusterng, sortng and embeddng, thus the asymptotc tme complexty of algorthm 2 s n T2 ( n) = Ok ( ) + Otkqn ( ) + On ( log ) + Ok ( g ). Where g s the samples of category and whose extremum s g = n. Snce k and q are far less than n, n T2 ( n) = O( tkqn) + O( nlog ). Serously, due to the local convergence of fast clusterng [6], the number of teraton t s uncertan. Convergence crteron defned n algorthm ndcates that t s less than n, therefore the tme complexty of the algorthm n the worst case s: 2 T2 ( n) = On ( ) (3) Algorthm 3: Smlarly, the tme complexty of algorthm 3 n the worst case s 2 T2 ( n) = On ( ). Capacty. The length of watermarkng sequences s W, tuples number s n and the number of embedded multplcty s m, thus the capacty c = n/ ( W m). It can be seen that once the tuples number n n database and watermark are made, only can we adjust the embedded multplcty m to reduce capacty so as to make small data modfcatons. Owng to the hgher watermarkng robustness requrement of copyrght protecton s allowed. Robustness Analyss. Suppose the attackers select each tuple wth an equal probablty pt ( ) = / n and choose each attrbute of tuple wth an equal probablty pa ( ) = / q. At the followng, we wll analyze the watermarkng detecton rate under attacks such as random bt flppng, subset selecton, sortng, subset substtuton and 7
8 subset addton. Random Bt Flppng: We assume that the attackers know the number of database classfcaton, namely: the length of watermarkng sequences s W. The most extreme case of destroyng watermarkng detecton s to make random bt flppng on the category wth least data records. Suppose the category tuple records s ν, the attackers randomly choose ξ tuples and flp the LSB bts of all attrbutes wthout mpactng data. Thus the watermark can be detected by probablty: ν m ξ m pd ( ) = ν ξ where ξ m. Subset Selecton: Smlarly, suppose the attackers know the number of categores. If they can ptch on the tuples wthout watermark on the category wth least data records, they are able to destroy watermark detecton successfully as random bt flppng. The probablty of detectng watermark successfully s: pd ( ) = m = m ν m ξ ν ξ (4) (5) Sortng: It makes no dfference to watermark detecton f the attackers randomly resort the database tuples. We just need to make database fast clusterng and recover the orgnal order by secret key rearrangement of each category, then extract watermark. Subset Substtuton: Subset substtuton s smlar to subset selecton. Subset Addton: Subset addton wll only ncrease the tuple records of each category. Snce the embedded locaton s determned by the secret key and hash mappng of tuple prmary key n the process of watermark embeddng and detectng, subset addton wll not produce huge mpact. Secondary Watermark Addton: Suppose A nserts watermark w a nto R to get R a, whle B prates the database of A and makes some operatons as above to obtan attacked database R a, then adds ts own watermark w b to get database R. So A can detect watermark w a from R n probablty pd ( ) and B only can detect watermark w b from R a, n probablty ρ 0. As a result, t s effectve to resst secondary watermark addton attack wth the probablty of pd ( ). 4 Concluson Ths paper provdes a n ovel adaptve watermarkng scheme based on clusterng and polar angle expanson for relatonal database, whch frst takes advantage of the dsorder character among database tuples to cluster them by Mahalanobs dstance, and then combnes wth the polar angle expanson strategy to embed and extract watermark. The scheme shows a hgh robustness under blnd detecton for subset selecton, addton and modfcaton attack, and also can restore the orgnal data more 8
9 truly. Due to the local convergence of fast clusterng and the error of restoraton data, t can not satsfy the applcaton requrement of hgh-accuracy data. The next step s to adopt new update strategy to speed up convergence rate and global convergence, then desgn a co mpletely reversble database watermarkng algorthm and prove t n theory. Acknowledgments. Ths work was supported by the Natonal Natural Scence Foundaton of Chna (67307), the research project of Educaton Mnstry and Scence Mnstry, Guangdong Provnce, Chna (20A ) and the Scence and Technology Plan of Changsha, Hunan Provnce, Chna (K09099-). References. R.G. van Schyndel, A.Z. Trkel, and C.F. Osborne, A Dgtal Watermark, Proc. ICIP 94, vol. 2, pp (994) 2. I. Cox, M. Mller, J. Bloom, and Chrs Honsnger, Dgtal Watermarkng, Academc Press, USA(2002) 3. R. Son, M. Atallah, and S.Prabhakar, Rghts Protecton for Relatonal Data, IEEE Transactons on Knowledge and Data Engneerng, vol. 6, no.2, pp (2004) 4. R. Agrawal and J. Kernan, Watermarkng Relatonal Databases, Proc. VLDB 02, pp (2002) 5. R. Son, M. Atallah, and S. Prabhakar, On Watermarkng Numerc Sets, Proc. IWDW, pp. 2-5(2002) 6. Xamu Nu et al, Watermarkng Relatonal Databases for Ownershp Protecton, Chnese Journal of Electroncs (n Chnese), vol. 3, no. 2A, pp (2003) 7. Y.J. L, V. Swarup, and S. Jajoda, Fngerprntng Relatonal Databases: Schemes and Specaltes, IEEE Transactons on Dependable Secure Computng, vol. 2, no., pp (2005) 8. Y. Zhang, X.M. Nu, and D.N. Zhao, A Method of Protectng Relatonal Databases Copyrght wth Cloud Watermark, Proc. World Academy of Scence, Engneerng and Technology, vol. 3, pp (2005) 9. Y. Zhang, B. Yang, and X.M. Nu, Reversble Watermarkng for Relatonal Database Authentcaton, Journal of Computers, vol. 7, no. 2, pp (2006) 0. G. Gupta and J. Peprzyk, Reversble and Blnd Database Watermarkng Usng Dfference Expanson, Internatonal Journal of Dgtal Crme and Forenscs, vol., no. 2, pp (2009). I. Kamel, A Schema for Protectng the Integrty of Databases, Computers & Securty, vol. 28, no. 7, pp (2009) 2. A.H. Al et al, Copyrght Protecton of Relatonal Database Systems, Proc. 2nd Internatonal Conference on Networked Dgtal Technologes, vol.87, pp (200) 3. G.A. Davd, Query-Preservng Watermarkng of Relatonal Databases and XML Documents, ACM Transactons on Database System, vol. 36, no., pp (20) 4. Mahmoud E. Farfour et al, A blnd reversble method for watermarkng relatonal databases based on a tme-stampng protocol, vol.39, no.3, pp (202) 5. W.C. Tao, Z.Y. L, and H.F. L, Reversble and Blnd Database Watermark Algorthm Based on Polar Angle Expanson, Computer Engneerng (n Chnese), vol. 36, no. 22, pp (200) 6. Z.Q. Wen and Z.X. Ca, Convergence Analyss of Mean Shft Algorthm, Journal of Software (n Chnese), vol. 8, No. 2, pp (2007) 9
Cluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationA Robust Webpage Information Hiding Method Based on the Slash of Tag
Advanced Engneerng Forum Onlne: 2012-09-26 ISSN: 2234-991X, Vols. 6-7, pp 361-366 do:10.4028/www.scentfc.net/aef.6-7.361 2012 Trans Tech Publcatons, Swtzerland A Robust Webpage Informaton Hdng Method Based
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationKey-Selective Patchwork Method for Audio Watermarking
Internatonal Journal of Dgtal Content Technology and ts Applcatons Volume 4, Number 4, July 2010 Key-Selectve Patchwork Method for Audo Watermarkng 1 Ch-Man Pun, 2 Jng-Jng Jang 1, Frst and Correspondng
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationAn Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league
More informationModular PCA Face Recognition Based on Weighted Average
odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationA Clustering Algorithm for Key Frame Extraction Based on Density Peak
Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao
More informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationA new segmentation algorithm for medical volume image based on K-means clustering
Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based
More informationIdentify the Attack in Embedded Image with Steganalysis Detection Method by PSNR and RGB Intensity
Internatonal Journal of Computer Systems (ISSN: 394-1065), Volume 03 Issue 07, July, 016 Avalable at http://www.jcsonlne.com/ Identfy the Attack n Embedded Image wth Steganalyss Detecton Method by PSNR
More informationRobust Blind Video Watermark Algorithm in Transform Domain Combining with 3D Video Correlation
JOURNAL OF MULTIMEDIA, VOL. 8, NO. 2, APRIL 2013 161 Robust Blnd Vdeo Watermark Algorthm n Transform Doman Combnng wth 3D Vdeo Correlaton DING Ha-yang 1,3 1. Informaton Securty Center, Bejng Unversty of
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationData Hiding and Image Authentication for Color-Palette Images
Data Hdng and Image Authentcaton for Color-Palette Images Chh-Yang Yn ( 殷志揚 ) and Wen-Hsang Tsa ( 蔡文祥 ) Department of Computer & Informaton Scence Natonal Chao Tung Unversty 00 Ta Hsueh Rd., Hsnchu, Tawan
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationDeep learning is a good steganalysis tool when embedding key is reused for different images, even if there is a cover source-mismatch
Deep learnng s a good steganalyss tool when embeddng key s reused for dfferent mages, even f there s a cover source-msmatch Lonel PIBRE 2,3, Jérôme PASQUET 2,3, Dno IENCO 2,3, Marc CHAUMONT 1,2,3 (1) Unversty
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationResearch of Multiple Text Watermarks Technique in Electric Power System Texts
Sensors & Transducers 203 by IFSA http://www.sensorsportal.com Research of Multple Text atermarks Technque n Electrc Power System Texts Xao-X XING, Qng CHEN, 2 Lan-X FU School of Optcal-Electrcal and Computer
More informationRobust Watermarking for Text Images Based on Arnold Scrambling and DWT-DCT
Internatonal Conference on Mechatroncs Electronc Industral and Control Engneerng (MEIC 015) Robust Watermarkng for Text Images Based on Arnold Scramblng and DWT-DCT Fan Wu College of Informaton Scence
More informationA Lossless Watermarking Scheme for Halftone Image Authentication
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.6 No.2B, February 2006 147 A Lossless Watermarkng Scheme for Halftone Image Authentcaton Jeng-Shyang Pan, Hao Luo, and Zhe-Mng Lu,
More informationA CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION
A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION 1 FENG YONG, DANG XIAO-WAN, 3 XU HONG-YAN School of Informaton, Laonng Unversty, Shenyang Laonng E-mal: 1 fyxuhy@163.com, dangxaowan@163.com, 3 xuhongyan_lndx@163.com
More informationHigh Payload Reversible Data Hiding Scheme Using Difference Segmentation and Histogram Shifting
JOURNAL OF ELECTRONIC SCIENCE AND TECHNOLOGY, VOL. 11, NO. 1, MARCH 2013 9 Hgh Payload Reversble Data Hdng Scheme Usng Dfference Segmentaton and Hstogram Shftng Yung-Chen Chou and Huang-Chng L Abstract
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationA NEW AUDIO WATERMARKING METHOD BASED
A NEW AUDIO WATERMARKING METHOD BASED ON DISCRETE COSINE TRANSFORM WITH A GRAY IMAGE Mohammad Ibrahm Khan 1, Md. Iqbal Hasan Sarker 2, Kaushk Deb 3 and Md. Hasan Furhad 4 1,2,3 Department of Computer Scence
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationEnhanced Watermarking Technique for Color Images using Visual Cryptography
Informaton Assurance and Securty Letters 1 (2010) 024-028 Enhanced Watermarkng Technque for Color Images usng Vsual Cryptography Enas F. Al rawashdeh 1, Rawan I.Zaghloul 2 1 Balqa Appled Unversty, MIS
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationArticle Reversible Dual-Image-Based Hiding Scheme Using Block Folding Technique
Artcle Reversble Dual-Image-Based Hdng Scheme Usng Block Foldng Technque Tzu-Chuen Lu, * and Hu-Shh Leng Department of Informaton Management, Chaoyang Unversty of Technology, Tachung 4349, Tawan Department
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationSuppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization
Suppresson for Lumnance Dfference of Stereo Image-Par Based on Improved Hstogram Equalzaton Zhao Llng,, Zheng Yuhu 3, Sun Quansen, Xa Deshen School of Computer Scence and Technology, NJUST, Nanjng, Chna.School
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationFinite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c
Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor
More informationResearch on Categorization of Animation Effect Based on Data Mining
MATEC Web of Conferences 22, 0102 0 ( 2015) DOI: 10.1051/ matecconf/ 2015220102 0 C Owned by the authors, publshed by EDP Scences, 2015 Research on Categorzaton of Anmaton Effect Based on Data Mnng Na
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More informationThe Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b
3rd Internatonal Conference on Materal, Mechancal and Manufacturng Engneerng (IC3ME 2015) The Comparson of Calbraton Method of Bnocular Stereo Vson System Ke Zhang a *, Zhao Gao b College of Engneerng,
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationResearch Article High Capacity Reversible Watermarking for Audio by Histogram Shifting and Predicted Error Expansion
e Scentfc World Journal, Artcle ID 656251, 7 pages http://dx.do.org/1.1155/214/656251 Research Artcle Hgh Capacty Reversble Watermarkng for Audo by Hstogram Shftng and Predcted Error Expanson Fe Wang,
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts
More informationWireless Sensor Network Localization Research
Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationA Hybrid Semi-Blind Gray Scale Image Watermarking Algorithm Based on DWT-SVD using Human Visual System Model
A Hybrd Sem-Blnd Gray Scale Image Watermarkng Algorthm Based on DWT-SVD usng Human Vsual System Model Rajesh Mehta r Scence & Engneerng, USICT Guru Gobnd Sngh Indrarprastha Unversty New Delh, Inda rajesh00ust@gmal.com
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationA Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme
Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationEnhanced AMBTC for Image Compression using Block Classification and Interpolation
Internatonal Journal of Computer Applcatons (0975 8887) Volume 5 No.0, August 0 Enhanced AMBTC for Image Compresson usng Block Classfcaton and Interpolaton S. Vmala Dept. of Comp. Scence Mother Teresa
More informationA New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1
A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationCorrelative features for the classification of textural images
Correlatve features for the classfcaton of textural mages M A Turkova 1 and A V Gadel 1, 1 Samara Natonal Research Unversty, Moskovskoe Shosse 34, Samara, Russa, 443086 Image Processng Systems Insttute
More informationAn Image Compression Algorithm based on Wavelet Transform and LZW
An Image Compresson Algorthm based on Wavelet Transform and LZW Png Luo a, Janyong Yu b School of Chongqng Unversty of Posts and Telecommuncatons, Chongqng, 400065, Chna Abstract a cylpng@63.com, b y27769864@sna.cn
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
More informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
More informationNetwork Intrusion Detection Based on PSO-SVM
TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
More informationClustering Algorithm of Similarity Segmentation based on Point Sorting
Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan
More informationPalmprint Minutia Point Matching Algorithmand GPU Application
Palmprnt Mnuta Pont Matchng Algorthmand GPU Applcaton 1 Beng Crmnal Scence Insttuton, Beng, 100054,Chna E-mal: wucs@sccas.cn Zhgang Lu 2 Publc Securty Bureau of Beng s Dongcheng, Beng, 100061, Chna Cagang
More informationPerformance Assessment and Fault Diagnosis for Hydraulic Pump Based on WPT and SOM
Performance Assessment and Fault Dagnoss for Hydraulc Pump Based on WPT and SOM Be Jkun, Lu Chen and Wang Zl PERFORMANCE ASSESSMENT AND FAULT DIAGNOSIS FOR HYDRAULIC PUMP BASED ON WPT AND SOM. Be Jkun,
More informationProfessional competences training path for an e-commerce major, based on the ISM method
World Transactons on Engneerng and Technology Educaton Vol.14, No.4, 2016 2016 WIETE Professonal competences tranng path for an e-commerce maor, based on the ISM method Ru Wang, Pn Peng, L-gang Lu & Lng
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More information